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"
37 #include "diagnostic.h"
42 #include "langhooks.h"
43 #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 variant of the C language being processed. */
92 enum c_language_kind c_language;
94 /* The following symbols are subsumed in the c_global_trees array, and
95 listed here individually for documentation purposes.
97 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
99 tree short_integer_type_node;
100 tree long_integer_type_node;
101 tree long_long_integer_type_node;
103 tree short_unsigned_type_node;
104 tree long_unsigned_type_node;
105 tree long_long_unsigned_type_node;
107 tree boolean_type_node;
108 tree boolean_false_node;
109 tree boolean_true_node;
111 tree ptrdiff_type_node;
113 tree unsigned_char_type_node;
114 tree signed_char_type_node;
115 tree wchar_type_node;
116 tree signed_wchar_type_node;
117 tree unsigned_wchar_type_node;
119 tree float_type_node;
120 tree double_type_node;
121 tree long_double_type_node;
123 tree complex_integer_type_node;
124 tree complex_float_type_node;
125 tree complex_double_type_node;
126 tree complex_long_double_type_node;
128 tree intQI_type_node;
129 tree intHI_type_node;
130 tree intSI_type_node;
131 tree intDI_type_node;
132 tree intTI_type_node;
134 tree unsigned_intQI_type_node;
135 tree unsigned_intHI_type_node;
136 tree unsigned_intSI_type_node;
137 tree unsigned_intDI_type_node;
138 tree unsigned_intTI_type_node;
140 tree widest_integer_literal_type_node;
141 tree widest_unsigned_literal_type_node;
143 Nodes for types `void *' and `const void *'.
145 tree ptr_type_node, const_ptr_type_node;
147 Nodes for types `char *' and `const char *'.
149 tree string_type_node, const_string_type_node;
151 Type `char[SOMENUMBER]'.
152 Used when an array of char is needed and the size is irrelevant.
154 tree char_array_type_node;
156 Type `int[SOMENUMBER]' or something like it.
157 Used when an array of int needed and the size is irrelevant.
159 tree int_array_type_node;
161 Type `wchar_t[SOMENUMBER]' or something like it.
162 Used when a wide string literal is created.
164 tree wchar_array_type_node;
166 Type `int ()' -- used for implicit declaration of functions.
168 tree default_function_type;
170 A VOID_TYPE node, packaged in a TREE_LIST.
174 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
175 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
176 VAR_DECLS, but C++ does.)
178 tree function_name_decl_node;
179 tree pretty_function_name_decl_node;
180 tree c99_function_name_decl_node;
182 Stack of nested function name VAR_DECLs.
184 tree saved_function_name_decls;
188 tree c_global_trees[CTI_MAX];
190 /* TRUE if a code represents a statement. The front end init
191 langhook should take care of initialization of this array. */
193 bool statement_code_p[MAX_TREE_CODES];
195 /* Nonzero if we can read a PCH file now. */
199 /* Switches common to the C front ends. */
201 /* Nonzero if prepreprocessing only. */
203 int flag_preprocess_only;
205 /* Nonzero means don't output line number information. */
207 char flag_no_line_commands;
209 /* Nonzero causes -E output not to be done, but directives such as
210 #define that have side effects are still obeyed. */
214 /* Nonzero means dump macros in some fashion. */
216 char flag_dump_macros;
218 /* Nonzero means pass #include lines through to the output. */
220 char flag_dump_includes;
222 /* The file name to which we should write a precompiled header, or
223 NULL if no header will be written in this compile. */
225 const char *pch_file;
227 /* Nonzero if an ISO standard was selected. It rejects macros in the
231 /* Nonzero whenever Objective-C functionality is being used. */
234 /* Nonzero if -undef was given. It suppresses target built-in macros
238 /* Nonzero means don't recognize the non-ANSI builtin functions. */
242 /* Nonzero means don't recognize the non-ANSI builtin functions.
245 int flag_no_nonansi_builtin;
247 /* Nonzero means give `double' the same size as `float'. */
249 int flag_short_double;
251 /* Nonzero means give `wchar_t' the same size as `short'. */
253 int flag_short_wchar;
255 /* Nonzero means allow Microsoft extensions without warnings or errors. */
256 int flag_ms_extensions;
258 /* Nonzero means don't recognize the keyword `asm'. */
262 /* Nonzero means give string constants the type `const char *', as mandated
265 int flag_const_strings;
267 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
269 int flag_signed_bitfields = 1;
270 int explicit_flag_signed_bitfields;
272 /* Nonzero means warn about pointer casts that can drop a type qualifier
273 from the pointer target type. */
277 /* Warn about functions which might be candidates for format attributes. */
279 int warn_missing_format_attribute;
281 /* Nonzero means warn about sizeof(function) or addition/subtraction
282 of function pointers. */
284 int warn_pointer_arith;
286 /* Nonzero means warn for any global function def
287 without separate previous prototype decl. */
289 int warn_missing_prototypes;
291 /* Warn if adding () is suggested. */
293 int warn_parentheses;
295 /* Warn if initializer is not completely bracketed. */
297 int warn_missing_braces;
299 /* Warn about comparison of signed and unsigned values.
300 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified
301 (in which case -Wextra gets to decide). */
303 int warn_sign_compare = -1;
305 /* Nonzero means warn about usage of long long when `-pedantic'. */
307 int warn_long_long = 1;
309 /* Nonzero means warn about deprecated conversion from string constant to
312 int warn_write_strings;
314 /* Nonzero means warn about multiple (redundant) decls for the same single
315 variable or function. */
317 int warn_redundant_decls;
319 /* Warn about testing equality of floating point numbers. */
321 int warn_float_equal;
323 /* Warn about a subscript that has type char. */
325 int warn_char_subscripts;
327 /* Warn if a type conversion is done that might have confusing results. */
331 /* Warn about #pragma directives that are not recognized. */
333 int warn_unknown_pragmas; /* Tri state variable. */
335 /* Warn about format/argument anomalies in calls to formatted I/O functions
336 (*printf, *scanf, strftime, strfmon, etc.). */
340 /* Warn about Y2K problems with strftime formats. */
344 /* Warn about excess arguments to formats. */
346 int warn_format_extra_args;
348 /* Warn about zero-length formats. */
350 int warn_format_zero_length;
352 /* Warn about non-literal format arguments. */
354 int warn_format_nonliteral;
356 /* Warn about possible security problems with calls to format functions. */
358 int warn_format_security;
361 /* C/ObjC language option variables. */
364 /* Nonzero means message about use of implicit function declarations;
365 1 means warning; 2 means error. */
367 int mesg_implicit_function_declaration = -1;
369 /* Nonzero means allow type mismatches in conditional expressions;
370 just make their values `void'. */
372 int flag_cond_mismatch;
374 /* Nonzero means enable C89 Amendment 1 features. */
378 /* Nonzero means use the ISO C99 dialect of C. */
382 /* Nonzero means that we have builtin functions, and main is an int */
386 /* Nonzero means add default format_arg attributes for functions not
389 int flag_noniso_default_format_attributes = 1;
391 /* Nonzero means warn when casting a function call to a type that does
392 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
393 when there is no previous declaration of sqrt or malloc. */
395 int warn_bad_function_cast;
397 /* Warn about traditional constructs whose meanings changed in ANSI C. */
399 int warn_traditional;
401 /* Nonzero means warn for non-prototype function decls
402 or non-prototyped defs without previous prototype. */
404 int warn_strict_prototypes;
406 /* Nonzero means warn for any global function def
407 without separate previous decl. */
409 int warn_missing_declarations;
411 /* Nonzero means warn about declarations of objects not at
412 file-scope level and about *all* declarations of functions (whether
413 or static) not at file-scope level. Note that we exclude
414 implicit function declarations. To get warnings about those, use
417 int warn_nested_externs;
419 /* Warn if main is suspicious. */
423 /* Nonzero means warn about possible violations of sequence point rules. */
425 int warn_sequence_point;
427 /* Nonzero means to warn about compile-time division by zero. */
428 int warn_div_by_zero = 1;
430 /* Nonzero means warn about use of implicit int. */
432 int warn_implicit_int;
434 /* Warn about NULL being passed to argument slots marked as requiring
440 /* ObjC language option variables. */
443 /* Open and close the file for outputting class declarations, if
446 int flag_gen_declaration;
448 /* Generate code for GNU or NeXT runtime environment. */
450 #ifdef NEXT_OBJC_RUNTIME
451 int flag_next_runtime = 1;
453 int flag_next_runtime = 0;
456 /* Tells the compiler that this is a special run. Do not perform any
457 compiling, instead we are to test some platform dependent features
458 and output a C header file with appropriate definitions. */
460 int print_struct_values;
462 /* ???. Undocumented. */
464 const char *constant_string_class_name;
466 /* Warn if multiple methods are seen for the same selector, but with
467 different argument types. Performs the check on the whole selector
468 table at the end of compilation. */
472 /* Warn if a @selector() is found, and no method with that selector
473 has been previously declared. The check is done on each
474 @selector() as soon as it is found - so it warns about forward
477 int warn_undeclared_selector;
479 /* Warn if methods required by a protocol are not implemented in the
480 class adopting it. When turned off, methods inherited to that
481 class are also considered implemented. */
483 int warn_protocol = 1;
486 /* C++ language option variables. */
489 /* Nonzero means don't recognize any extension keywords. */
491 int flag_no_gnu_keywords;
493 /* Nonzero means do emit exported implementations of functions even if
494 they can be inlined. */
496 int flag_implement_inlines = 1;
498 /* Nonzero means do emit exported implementations of templates, instead of
499 multiple static copies in each file that needs a definition. */
501 int flag_external_templates;
503 /* Nonzero means that the decision to emit or not emit the implementation of a
504 template depends on where the template is instantiated, rather than where
507 int flag_alt_external_templates;
509 /* Nonzero means that implicit instantiations will be emitted if needed. */
511 int flag_implicit_templates = 1;
513 /* Nonzero means that implicit instantiations of inline templates will be
514 emitted if needed, even if instantiations of non-inline templates
517 int flag_implicit_inline_templates = 1;
519 /* Nonzero means generate separate instantiation control files and
520 juggle them at link time. */
522 int flag_use_repository;
524 /* Nonzero if we want to issue diagnostics that the standard says are not
527 int flag_optional_diags = 1;
529 /* Nonzero means we should attempt to elide constructors when possible. */
531 int flag_elide_constructors = 1;
533 /* Nonzero means that member functions defined in class scope are
534 inline by default. */
536 int flag_default_inline = 1;
538 /* Controls whether compiler generates 'type descriptor' that give
539 run-time type information. */
543 /* Nonzero if we want to conserve space in the .o files. We do this
544 by putting uninitialized data and runtime initialized data into
545 .common instead of .data at the expense of not flagging multiple
548 int flag_conserve_space;
550 /* Nonzero if we want to obey access control semantics. */
552 int flag_access_control = 1;
554 /* Nonzero if we want to check the return value of new and avoid calling
555 constructors if it is a null pointer. */
559 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
560 initialization variables.
561 0: Old rules, set by -fno-for-scope.
562 2: New ISO rules, set by -ffor-scope.
563 1: Try to implement new ISO rules, but with backup compatibility
564 (and warnings). This is the default, for now. */
566 int flag_new_for_scope = 1;
568 /* Nonzero if we want to emit defined symbols with common-like linkage as
569 weak symbols where possible, in order to conform to C++ semantics.
570 Otherwise, emit them as local symbols. */
574 /* Nonzero to use __cxa_atexit, rather than atexit, to register
575 destructors for local statics and global objects. */
577 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
579 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
583 /* Nonzero means make the default pedwarns warnings instead of errors.
584 The value of this flag is ignored if -pedantic is specified. */
588 /* Nonzero means to implement standard semantics for exception
589 specifications, calling unexpected if an exception is thrown that
590 doesn't match the specification. Zero means to treat them as
591 assertions and optimize accordingly, but not check them. */
593 int flag_enforce_eh_specs = 1;
595 /* The version of the C++ ABI in use. The following values are
598 0: The version of the ABI believed most conformant with the
599 C++ ABI specification. This ABI may change as bugs are
600 discovered and fixed. Therefore, 0 will not necessarily
601 indicate the same ABI in different versions of G++.
603 1: The version of the ABI first used in G++ 3.2.
605 Additional positive integers will be assigned as new versions of
606 the ABI become the default version of the ABI. */
608 int flag_abi_version = 1;
610 /* Nonzero means warn about things that will change when compiling
611 with an ABI-compliant compiler. */
615 /* Nonzero means warn about invalid uses of offsetof. */
617 int warn_invalid_offsetof = 1;
619 /* Nonzero means warn about implicit declarations. */
621 int warn_implicit = 1;
623 /* Nonzero means warn when all ctors or dtors are private, and the class
626 int warn_ctor_dtor_privacy = 0;
628 /* Nonzero means warn in function declared in derived class has the
629 same name as a virtual in the base class, but fails to match the
630 type signature of any virtual function in the base class. */
632 int warn_overloaded_virtual;
634 /* Nonzero means warn when declaring a class that has a non virtual
635 destructor, when it really ought to have a virtual one. */
639 /* Nonzero means warn when the compiler will reorder code. */
643 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
647 /* Nonzero means warn when we convert a pointer to member function
648 into a pointer to (void or function). */
650 int warn_pmf2ptr = 1;
652 /* Nonzero means warn about violation of some Effective C++ style rules. */
656 /* Nonzero means warn where overload resolution chooses a promotion from
657 unsigned to signed over a conversion to an unsigned of the same size. */
661 /* Nonzero means warn when an old-style cast is used. */
663 int warn_old_style_cast;
665 /* Nonzero means warn when non-templatized friend functions are
666 declared within a template */
668 int warn_nontemplate_friend = 1;
670 /* Nonzero means complain about deprecated features. */
672 int warn_deprecated = 1;
674 /* Maximum template instantiation depth. This limit is rather
675 arbitrary, but it exists to limit the time it takes to notice
676 infinite template instantiations. */
678 int max_tinst_depth = 500;
682 /* The elements of `ridpointers' are identifier nodes for the reserved
683 type names and storage classes. It is indexed by a RID_... value. */
686 tree (*make_fname_decl) (tree, int);
688 /* If non-NULL, the address of a language-specific function that takes
689 any action required right before expand_function_end is called. */
690 void (*lang_expand_function_end) (void);
692 /* Nonzero means the expression being parsed will never be evaluated.
693 This is a count, since unevaluated expressions can nest. */
696 /* Information about how a function name is generated. */
699 tree *const decl; /* pointer to the VAR_DECL. */
700 const unsigned rid; /* RID number for the identifier. */
701 const int pretty; /* How pretty is it? */
704 /* The three ways of getting then name of the current function. */
706 const struct fname_var_t fname_vars[] =
708 /* C99 compliant __func__, must be first. */
709 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
710 /* GCC __FUNCTION__ compliant. */
711 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
712 /* GCC __PRETTY_FUNCTION__ compliant. */
713 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
717 static int constant_fits_type_p (tree, tree);
719 /* Keep a stack of if statements. We record the number of compound
720 statements seen up to the if keyword, as well as the line number
721 and file of the if. If a potentially ambiguous else is seen, that
722 fact is recorded; the warning is issued when we can be sure that
723 the enclosing if statement does not have an else branch. */
732 static if_elt *if_stack;
734 /* Amount of space in the if statement stack. */
735 static int if_stack_space = 0;
738 static int if_stack_pointer = 0;
740 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
741 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
742 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
743 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
744 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
745 static tree handle_always_inline_attribute (tree *, tree, tree, int,
747 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
748 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
749 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
750 static tree handle_transparent_union_attribute (tree *, tree, tree,
752 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
753 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
754 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
755 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
756 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
757 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
758 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
759 static tree handle_visibility_attribute (tree *, tree, tree, int,
761 static tree handle_tls_model_attribute (tree *, tree, tree, int,
763 static tree handle_no_instrument_function_attribute (tree *, tree,
765 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
766 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
768 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
769 static tree handle_deprecated_attribute (tree *, tree, tree, int,
771 static tree handle_vector_size_attribute (tree *, tree, tree, int,
773 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
774 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
775 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
776 static tree vector_size_helper (tree, tree);
778 static void check_function_nonnull (tree, tree);
779 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
780 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
781 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
783 /* Table of machine-independent attributes common to all C-like languages. */
784 const struct attribute_spec c_common_attribute_table[] =
786 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
787 { "packed", 0, 0, false, false, false,
788 handle_packed_attribute },
789 { "nocommon", 0, 0, true, false, false,
790 handle_nocommon_attribute },
791 { "common", 0, 0, true, false, false,
792 handle_common_attribute },
793 /* FIXME: logically, noreturn attributes should be listed as
794 "false, true, true" and apply to function types. But implementing this
795 would require all the places in the compiler that use TREE_THIS_VOLATILE
796 on a decl to identify non-returning functions to be located and fixed
797 to check the function type instead. */
798 { "noreturn", 0, 0, true, false, false,
799 handle_noreturn_attribute },
800 { "volatile", 0, 0, true, false, false,
801 handle_noreturn_attribute },
802 { "noinline", 0, 0, true, false, false,
803 handle_noinline_attribute },
804 { "always_inline", 0, 0, true, false, false,
805 handle_always_inline_attribute },
806 { "used", 0, 0, true, false, false,
807 handle_used_attribute },
808 { "unused", 0, 0, false, false, false,
809 handle_unused_attribute },
810 /* The same comments as for noreturn attributes apply to const ones. */
811 { "const", 0, 0, true, false, false,
812 handle_const_attribute },
813 { "transparent_union", 0, 0, false, false, false,
814 handle_transparent_union_attribute },
815 { "constructor", 0, 0, true, false, false,
816 handle_constructor_attribute },
817 { "destructor", 0, 0, true, false, false,
818 handle_destructor_attribute },
819 { "mode", 1, 1, false, true, false,
820 handle_mode_attribute },
821 { "section", 1, 1, true, false, false,
822 handle_section_attribute },
823 { "aligned", 0, 1, false, false, false,
824 handle_aligned_attribute },
825 { "weak", 0, 0, true, false, false,
826 handle_weak_attribute },
827 { "alias", 1, 1, true, false, false,
828 handle_alias_attribute },
829 { "no_instrument_function", 0, 0, true, false, false,
830 handle_no_instrument_function_attribute },
831 { "malloc", 0, 0, true, false, false,
832 handle_malloc_attribute },
833 { "no_stack_limit", 0, 0, true, false, false,
834 handle_no_limit_stack_attribute },
835 { "pure", 0, 0, true, false, false,
836 handle_pure_attribute },
837 { "deprecated", 0, 0, false, false, false,
838 handle_deprecated_attribute },
839 { "vector_size", 1, 1, false, true, false,
840 handle_vector_size_attribute },
841 { "visibility", 1, 1, true, false, false,
842 handle_visibility_attribute },
843 { "tls_model", 1, 1, true, false, false,
844 handle_tls_model_attribute },
845 { "nonnull", 0, -1, false, true, true,
846 handle_nonnull_attribute },
847 { "nothrow", 0, 0, true, false, false,
848 handle_nothrow_attribute },
849 { "may_alias", 0, 0, false, true, false, NULL },
850 { "cleanup", 1, 1, true, false, false,
851 handle_cleanup_attribute },
852 { NULL, 0, 0, false, false, false, NULL }
855 /* Give the specifications for the format attributes, used by C and all
858 const struct attribute_spec c_common_format_attribute_table[] =
860 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
861 { "format", 3, 3, false, true, true,
862 handle_format_attribute },
863 { "format_arg", 1, 1, false, true, true,
864 handle_format_arg_attribute },
865 { NULL, 0, 0, false, false, false, NULL }
868 /* Record the start of an if-then, and record the start of it
869 for ambiguous else detection.
871 COND is the condition for the if-then statement.
873 IF_STMT is the statement node that has already been created for
874 this if-then statement. It is created before parsing the
875 condition to keep line number information accurate. */
878 c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
880 /* Make sure there is enough space on the stack. */
881 if (if_stack_space == 0)
884 if_stack = (if_elt *) xmalloc (10 * sizeof (if_elt));
886 else if (if_stack_space == if_stack_pointer)
888 if_stack_space += 10;
889 if_stack = (if_elt *) xrealloc (if_stack, if_stack_space * sizeof (if_elt));
892 IF_COND (if_stmt) = cond;
895 /* Record this if statement. */
896 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
897 if_stack[if_stack_pointer].locus = input_location;
898 if_stack[if_stack_pointer].needs_warning = 0;
899 if_stack[if_stack_pointer].if_stmt = if_stmt;
903 /* Called after the then-clause for an if-statement is processed. */
908 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
909 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
912 /* Record the end of an if-then. Optionally warn if a nested
913 if statement had an ambiguous else clause. */
916 c_expand_end_cond (void)
919 if (if_stack[if_stack_pointer].needs_warning)
920 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
921 &if_stack[if_stack_pointer].locus);
922 last_expr_type = NULL_TREE;
925 /* Called between the then-clause and the else-clause
926 of an if-then-else. */
929 c_expand_start_else (void)
931 /* An ambiguous else warning must be generated for the enclosing if
932 statement, unless we see an else branch for that one, too. */
934 && if_stack_pointer > 1
935 && (if_stack[if_stack_pointer - 1].compstmt_count
936 == if_stack[if_stack_pointer - 2].compstmt_count))
937 if_stack[if_stack_pointer - 2].needs_warning = 1;
939 /* Even if a nested if statement had an else branch, it can't be
940 ambiguous if this one also has an else. So don't warn in that
941 case. Also don't warn for any if statements nested in this else. */
942 if_stack[if_stack_pointer - 1].needs_warning = 0;
943 if_stack[if_stack_pointer - 1].compstmt_count--;
946 /* Called after the else-clause for an if-statement is processed. */
951 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
952 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
955 /* Begin an if-statement. Returns a newly created IF_STMT if
958 Unlike the C++ front-end, we do not call add_stmt here; it is
959 probably safe to do so, but I am not very familiar with this
960 code so I am being extra careful not to change its behavior
961 beyond what is strictly necessary for correctness. */
964 c_begin_if_stmt (void)
967 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
971 /* Begin a while statement. Returns a newly created WHILE_STMT if
974 Unlike the C++ front-end, we do not call add_stmt here; it is
975 probably safe to do so, but I am not very familiar with this
976 code so I am being extra careful not to change its behavior
977 beyond what is strictly necessary for correctness. */
980 c_begin_while_stmt (void)
983 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
988 c_finish_while_stmt_cond (tree cond, tree while_stmt)
990 WHILE_COND (while_stmt) = cond;
993 /* Push current bindings for the function name VAR_DECLS. */
996 start_fname_decls (void)
999 tree saved = NULL_TREE;
1001 for (ix = 0; fname_vars[ix].decl; ix++)
1003 tree decl = *fname_vars[ix].decl;
1007 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
1008 *fname_vars[ix].decl = NULL_TREE;
1011 if (saved || saved_function_name_decls)
1012 /* Normally they'll have been NULL, so only push if we've got a
1013 stack, or they are non-NULL. */
1014 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1015 saved_function_name_decls);
1018 /* Finish up the current bindings, adding them into the
1019 current function's statement tree. This is done by wrapping the
1020 function's body in a COMPOUND_STMT containing these decls too. This
1021 must be done _before_ finish_stmt_tree is called. If there is no
1022 current function, we must be at file scope and no statements are
1023 involved. Pop the previous bindings. */
1026 finish_fname_decls (void)
1029 tree body = NULL_TREE;
1030 tree stack = saved_function_name_decls;
1032 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1033 body = chainon (TREE_VALUE (stack), body);
1037 /* They were called into existence, so add to statement tree. Add
1038 the DECL_STMTs inside the outermost scope. */
1039 tree *p = &DECL_SAVED_TREE (current_function_decl);
1040 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1041 while (TREE_CODE (*p) != COMPOUND_STMT)
1042 p = &TREE_CHAIN (*p);
1043 p = &COMPOUND_BODY (*p);
1044 if (TREE_CODE (*p) == SCOPE_STMT)
1045 p = &TREE_CHAIN (*p);
1047 body = chainon (body, *p);
1051 for (ix = 0; fname_vars[ix].decl; ix++)
1052 *fname_vars[ix].decl = NULL_TREE;
1056 /* We had saved values, restore them. */
1059 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1061 tree decl = TREE_PURPOSE (saved);
1062 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1064 *fname_vars[ix].decl = decl;
1066 stack = TREE_CHAIN (stack);
1068 saved_function_name_decls = stack;
1071 /* Return the text name of the current function, suitably prettified
1075 fname_as_string (int pretty_p)
1077 const char *name = NULL;
1080 name = (current_function_decl
1081 ? (*lang_hooks.decl_printable_name) (current_function_decl, 2)
1083 else if (current_function_decl && DECL_NAME (current_function_decl))
1084 name = IDENTIFIER_POINTER (DECL_NAME (current_function_decl));
1090 /* Return the text name of the current function, formatted as
1091 required by the supplied RID value. */
1094 fname_string (unsigned int rid)
1098 for (ix = 0; fname_vars[ix].decl; ix++)
1099 if (fname_vars[ix].rid == rid)
1101 return fname_as_string (fname_vars[ix].pretty);
1104 /* Return the VAR_DECL for a const char array naming the current
1105 function. If the VAR_DECL has not yet been created, create it
1106 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1107 ID is its name (unfortunately C and C++ hold the RID values of
1108 keywords in different places, so we can't derive RID from ID in
1109 this language independent code. */
1112 fname_decl (unsigned int rid, tree id)
1115 tree decl = NULL_TREE;
1117 for (ix = 0; fname_vars[ix].decl; ix++)
1118 if (fname_vars[ix].rid == rid)
1121 decl = *fname_vars[ix].decl;
1124 tree saved_last_tree = last_tree;
1125 /* If a tree is built here, it would normally have the lineno of
1126 the current statement. Later this tree will be moved to the
1127 beginning of the function and this line number will be wrong.
1128 To avoid this problem set the lineno to 0 here; that prevents
1129 it from appearing in the RTL. */
1130 int saved_lineno = input_line;
1133 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1134 if (last_tree != saved_last_tree)
1136 /* We created some statement tree for the decl. This belongs
1137 at the start of the function, so remove it now and reinsert
1138 it after the function is complete. */
1139 tree stmts = TREE_CHAIN (saved_last_tree);
1141 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1142 last_tree = saved_last_tree;
1143 saved_function_name_decls = tree_cons (decl, stmts,
1144 saved_function_name_decls);
1146 *fname_vars[ix].decl = decl;
1147 input_line = saved_lineno;
1149 if (!ix && !current_function_decl)
1150 pedwarn_with_decl (decl, "`%s' is not defined outside of function scope");
1155 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1158 fix_string_type (tree value)
1160 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1161 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1162 const int nchars_max = flag_isoc99 ? 4095 : 509;
1163 int length = TREE_STRING_LENGTH (value);
1166 /* Compute the number of elements, for the array type. */
1167 nchars = wide_flag ? length / wchar_bytes : length;
1169 if (pedantic && nchars - 1 > nchars_max && c_language == clk_c)
1170 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1171 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1173 /* Create the array type for the string constant.
1174 -Wwrite-strings says make the string constant an array of const char
1175 so that copying it to a non-const pointer will get a warning.
1176 For C++, this is the standard behavior. */
1177 if (flag_const_strings && ! flag_writable_strings)
1180 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1183 = build_array_type (elements,
1184 build_index_type (build_int_2 (nchars - 1, 0)));
1188 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1189 build_index_type (build_int_2 (nchars - 1, 0)));
1191 TREE_CONSTANT (value) = 1;
1192 TREE_READONLY (value) = ! flag_writable_strings;
1193 TREE_STATIC (value) = 1;
1197 /* Given a VARRAY of STRING_CST nodes, concatenate them into one
1201 combine_strings (varray_type strings)
1203 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1204 const int nstrings = VARRAY_ACTIVE_SIZE (strings);
1207 int wide_length = 0;
1212 /* Don't include the \0 at the end of each substring. Count wide
1213 strings and ordinary strings separately. */
1214 for (i = 0; i < nstrings; ++i)
1216 t = VARRAY_TREE (strings, i);
1218 if (TREE_TYPE (t) == wchar_array_type_node)
1220 wide_length += TREE_STRING_LENGTH (t) - wchar_bytes;
1225 length += (TREE_STRING_LENGTH (t) - 1);
1226 if (C_ARTIFICIAL_STRING_P (t) && !in_system_header)
1227 warning ("concatenation of string literals with __FUNCTION__ is deprecated");
1231 /* If anything is wide, the non-wides will be converted,
1232 which makes them take more space. */
1234 length = length * wchar_bytes + wide_length;
1236 p = xmalloc (length);
1238 /* Copy the individual strings into the new combined string.
1239 If the combined string is wide, convert the chars to ints
1240 for any individual strings that are not wide. */
1243 for (i = 0; i < nstrings; ++i)
1247 t = VARRAY_TREE (strings, i);
1248 this_wide = TREE_TYPE (t) == wchar_array_type_node;
1249 len = TREE_STRING_LENGTH (t) - (this_wide ? wchar_bytes : 1);
1250 if (this_wide == wide_flag)
1252 memcpy (q, TREE_STRING_POINTER (t), len);
1257 const int nzeros = (TYPE_PRECISION (wchar_type_node)
1258 / BITS_PER_UNIT) - 1;
1261 if (BYTES_BIG_ENDIAN)
1263 for (k = 0; k < len; k++)
1265 for (j = 0; j < nzeros; j++)
1267 *q++ = TREE_STRING_POINTER (t)[k];
1272 for (k = 0; k < len; k++)
1274 *q++ = TREE_STRING_POINTER (t)[k];
1275 for (j = 0; j < nzeros; j++)
1282 /* Nul terminate the string. */
1285 for (i = 0; i < wchar_bytes; i++)
1291 value = build_string (length, p);
1295 TREE_TYPE (value) = wchar_array_type_node;
1297 TREE_TYPE (value) = char_array_type_node;
1302 static int is_valid_printf_arglist (tree);
1303 static rtx c_expand_builtin (tree, rtx, enum machine_mode,
1304 enum expand_modifier);
1305 static rtx c_expand_builtin_printf (tree, rtx, enum machine_mode,
1306 enum expand_modifier, int, int);
1307 static rtx c_expand_builtin_fprintf (tree, rtx, enum machine_mode,
1308 enum expand_modifier, int, int);
1310 /* Print a warning if a constant expression had overflow in folding.
1311 Invoke this function on every expression that the language
1312 requires to be a constant expression.
1313 Note the ANSI C standard says it is erroneous for a
1314 constant expression to overflow. */
1317 constant_expression_warning (tree value)
1319 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1320 || TREE_CODE (value) == VECTOR_CST
1321 || TREE_CODE (value) == COMPLEX_CST)
1322 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1323 pedwarn ("overflow in constant expression");
1326 /* Print a warning if an expression had overflow in folding.
1327 Invoke this function on every expression that
1328 (1) appears in the source code, and
1329 (2) might be a constant expression that overflowed, and
1330 (3) is not already checked by convert_and_check;
1331 however, do not invoke this function on operands of explicit casts. */
1334 overflow_warning (tree value)
1336 if ((TREE_CODE (value) == INTEGER_CST
1337 || (TREE_CODE (value) == COMPLEX_CST
1338 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1339 && TREE_OVERFLOW (value))
1341 TREE_OVERFLOW (value) = 0;
1342 if (skip_evaluation == 0)
1343 warning ("integer overflow in expression");
1345 else if ((TREE_CODE (value) == REAL_CST
1346 || (TREE_CODE (value) == COMPLEX_CST
1347 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1348 && TREE_OVERFLOW (value))
1350 TREE_OVERFLOW (value) = 0;
1351 if (skip_evaluation == 0)
1352 warning ("floating point overflow in expression");
1354 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1356 TREE_OVERFLOW (value) = 0;
1357 if (skip_evaluation == 0)
1358 warning ("vector overflow in expression");
1362 /* Print a warning if a large constant is truncated to unsigned,
1363 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1364 Invoke this function on every expression that might be implicitly
1365 converted to an unsigned type. */
1368 unsigned_conversion_warning (tree result, tree operand)
1370 tree type = TREE_TYPE (result);
1372 if (TREE_CODE (operand) == INTEGER_CST
1373 && TREE_CODE (type) == INTEGER_TYPE
1374 && TREE_UNSIGNED (type)
1375 && skip_evaluation == 0
1376 && !int_fits_type_p (operand, type))
1378 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1379 /* This detects cases like converting -129 or 256 to unsigned char. */
1380 warning ("large integer implicitly truncated to unsigned type");
1381 else if (warn_conversion)
1382 warning ("negative integer implicitly converted to unsigned type");
1386 /* Nonzero if constant C has a value that is permissible
1387 for type TYPE (an INTEGER_TYPE). */
1390 constant_fits_type_p (tree c, tree type)
1392 if (TREE_CODE (c) == INTEGER_CST)
1393 return int_fits_type_p (c, type);
1395 c = convert (type, c);
1396 return !TREE_OVERFLOW (c);
1399 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1400 Invoke this function on every expression that is converted implicitly,
1401 i.e. because of language rules and not because of an explicit cast. */
1404 convert_and_check (tree type, tree expr)
1406 tree t = convert (type, expr);
1407 if (TREE_CODE (t) == INTEGER_CST)
1409 if (TREE_OVERFLOW (t))
1411 TREE_OVERFLOW (t) = 0;
1413 /* Do not diagnose overflow in a constant expression merely
1414 because a conversion overflowed. */
1415 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1417 /* No warning for converting 0x80000000 to int. */
1418 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1419 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1420 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1421 /* If EXPR fits in the unsigned version of TYPE,
1422 don't warn unless pedantic. */
1424 || TREE_UNSIGNED (type)
1425 || ! constant_fits_type_p (expr,
1426 c_common_unsigned_type (type)))
1427 && skip_evaluation == 0)
1428 warning ("overflow in implicit constant conversion");
1431 unsigned_conversion_warning (t, expr);
1436 /* A node in a list that describes references to variables (EXPR), which are
1437 either read accesses if WRITER is zero, or write accesses, in which case
1438 WRITER is the parent of EXPR. */
1445 /* Used to implement a cache the results of a call to verify_tree. We only
1446 use this for SAVE_EXPRs. */
1449 struct tlist_cache *next;
1450 struct tlist *cache_before_sp;
1451 struct tlist *cache_after_sp;
1455 /* Obstack to use when allocating tlist structures, and corresponding
1457 static struct obstack tlist_obstack;
1458 static char *tlist_firstobj = 0;
1460 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1462 static struct tlist *warned_ids;
1463 /* SAVE_EXPRs need special treatment. We process them only once and then
1464 cache the results. */
1465 static struct tlist_cache *save_expr_cache;
1467 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1468 static void merge_tlist (struct tlist **, struct tlist *, int);
1469 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1470 static int warning_candidate_p (tree);
1471 static void warn_for_collisions (struct tlist *);
1472 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1473 static struct tlist *new_tlist (struct tlist *, tree, tree);
1474 static void verify_sequence_points (tree);
1476 /* Create a new struct tlist and fill in its fields. */
1477 static struct tlist *
1478 new_tlist (struct tlist *next, tree t, tree writer)
1481 l = (struct tlist *) obstack_alloc (&tlist_obstack, sizeof *l);
1488 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1489 is nonnull, we ignore any node we find which has a writer equal to it. */
1492 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1496 struct tlist *next = add->next;
1499 if (! exclude_writer || add->writer != exclude_writer)
1500 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1505 /* Merge the nodes of ADD into TO. This merging process is done so that for
1506 each variable that already exists in TO, no new node is added; however if
1507 there is a write access recorded in ADD, and an occurrence on TO is only
1508 a read access, then the occurrence in TO will be modified to record the
1512 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1514 struct tlist **end = to;
1517 end = &(*end)->next;
1523 struct tlist *next = add->next;
1525 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1526 if (tmp2->expr == add->expr)
1530 tmp2->writer = add->writer;
1534 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1535 end = &(*end)->next;
1542 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1543 references in list LIST conflict with it, excluding reads if ONLY writers
1547 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1552 /* Avoid duplicate warnings. */
1553 for (tmp = warned_ids; tmp; tmp = tmp->next)
1554 if (tmp->expr == written)
1559 if (list->expr == written
1560 && list->writer != writer
1561 && (! only_writes || list->writer))
1563 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1564 warning ("operation on `%s' may be undefined",
1565 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1571 /* Given a list LIST of references to variables, find whether any of these
1572 can cause conflicts due to missing sequence points. */
1575 warn_for_collisions (struct tlist *list)
1579 for (tmp = list; tmp; tmp = tmp->next)
1582 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1586 /* Return nonzero if X is a tree that can be verified by the sequence point
1589 warning_candidate_p (tree x)
1591 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1594 /* Walk the tree X, and record accesses to variables. If X is written by the
1595 parent tree, WRITER is the parent.
1596 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1597 expression or its only operand forces a sequence point, then everything up
1598 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1600 Once we return, we will have emitted warnings if any subexpression before
1601 such a sequence point could be undefined. On a higher level, however, the
1602 sequence point may not be relevant, and we'll merge the two lists.
1604 Example: (b++, a) + b;
1605 The call that processes the COMPOUND_EXPR will store the increment of B
1606 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1607 processes the PLUS_EXPR will need to merge the two lists so that
1608 eventually, all accesses end up on the same list (and we'll warn about the
1609 unordered subexpressions b++ and b.
1611 A note on merging. If we modify the former example so that our expression
1614 care must be taken not simply to add all three expressions into the final
1615 PNO_SP list. The function merge_tlist takes care of that by merging the
1616 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1617 way, so that no more than one access to B is recorded. */
1620 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1623 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1624 enum tree_code code;
1627 /* X may be NULL if it is the operand of an empty statement expression
1633 code = TREE_CODE (x);
1634 class = TREE_CODE_CLASS (code);
1636 if (warning_candidate_p (x))
1638 *pno_sp = new_tlist (*pno_sp, x, writer);
1648 case TRUTH_ANDIF_EXPR:
1649 case TRUTH_ORIF_EXPR:
1650 tmp_before = tmp_nosp = tmp_list3 = 0;
1651 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1652 warn_for_collisions (tmp_nosp);
1653 merge_tlist (pbefore_sp, tmp_before, 0);
1654 merge_tlist (pbefore_sp, tmp_nosp, 0);
1655 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1656 merge_tlist (pbefore_sp, tmp_list3, 0);
1660 tmp_before = tmp_list2 = 0;
1661 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1662 warn_for_collisions (tmp_list2);
1663 merge_tlist (pbefore_sp, tmp_before, 0);
1664 merge_tlist (pbefore_sp, tmp_list2, 1);
1666 tmp_list3 = tmp_nosp = 0;
1667 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1668 warn_for_collisions (tmp_nosp);
1669 merge_tlist (pbefore_sp, tmp_list3, 0);
1671 tmp_list3 = tmp_list2 = 0;
1672 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1673 warn_for_collisions (tmp_list2);
1674 merge_tlist (pbefore_sp, tmp_list3, 0);
1675 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1676 two first, to avoid warning for (a ? b++ : b++). */
1677 merge_tlist (&tmp_nosp, tmp_list2, 0);
1678 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1681 case PREDECREMENT_EXPR:
1682 case PREINCREMENT_EXPR:
1683 case POSTDECREMENT_EXPR:
1684 case POSTINCREMENT_EXPR:
1685 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1689 tmp_before = tmp_nosp = tmp_list3 = 0;
1690 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1691 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1692 /* Expressions inside the LHS are not ordered wrt. the sequence points
1693 in the RHS. Example:
1695 Despite the fact that the modification of "a" is in the before_sp
1696 list (tmp_before), it conflicts with the use of "a" in the LHS.
1697 We can handle this by adding the contents of tmp_list3
1698 to those of tmp_before, and redoing the collision warnings for that
1700 add_tlist (&tmp_before, tmp_list3, x, 1);
1701 warn_for_collisions (tmp_before);
1702 /* Exclude the LHS itself here; we first have to merge it into the
1703 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1704 didn't exclude the LHS, we'd get it twice, once as a read and once
1706 add_tlist (pno_sp, tmp_list3, x, 0);
1707 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1709 merge_tlist (pbefore_sp, tmp_before, 0);
1710 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1711 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1712 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1716 /* We need to warn about conflicts among arguments and conflicts between
1717 args and the function address. Side effects of the function address,
1718 however, are not ordered by the sequence point of the call. */
1719 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1720 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1721 if (TREE_OPERAND (x, 1))
1722 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1723 merge_tlist (&tmp_list3, tmp_list2, 0);
1724 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1725 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1726 warn_for_collisions (tmp_before);
1727 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1731 /* Scan all the list, e.g. indices of multi dimensional array. */
1734 tmp_before = tmp_nosp = 0;
1735 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1736 merge_tlist (&tmp_nosp, tmp_before, 0);
1737 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1744 struct tlist_cache *t;
1745 for (t = save_expr_cache; t; t = t->next)
1751 t = (struct tlist_cache *) obstack_alloc (&tlist_obstack,
1753 t->next = save_expr_cache;
1755 save_expr_cache = t;
1757 tmp_before = tmp_nosp = 0;
1758 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1759 warn_for_collisions (tmp_nosp);
1764 struct tlist *t = tmp_nosp;
1766 merge_tlist (&tmp_list3, t, 0);
1768 t->cache_before_sp = tmp_before;
1769 t->cache_after_sp = tmp_list3;
1771 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1772 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1781 if (first_rtl_op (code) == 0)
1783 x = TREE_OPERAND (x, 0);
1799 int max = first_rtl_op (TREE_CODE (x));
1800 for (lp = 0; lp < max; lp++)
1802 tmp_before = tmp_nosp = 0;
1803 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1804 merge_tlist (&tmp_nosp, tmp_before, 0);
1805 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1812 /* Try to warn for undefined behavior in EXPR due to missing sequence
1816 verify_sequence_points (tree expr)
1818 struct tlist *before_sp = 0, *after_sp = 0;
1821 save_expr_cache = 0;
1822 if (tlist_firstobj == 0)
1824 gcc_obstack_init (&tlist_obstack);
1825 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1828 verify_tree (expr, &before_sp, &after_sp, 0);
1829 warn_for_collisions (after_sp);
1830 obstack_free (&tlist_obstack, tlist_firstobj);
1834 c_expand_expr_stmt (tree expr)
1836 /* Do default conversion if safe and possibly important,
1837 in case within ({...}). */
1838 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1839 && (flag_isoc99 || lvalue_p (expr)))
1840 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1841 expr = default_conversion (expr);
1843 if (warn_sequence_point)
1844 verify_sequence_points (expr);
1846 if (TREE_TYPE (expr) != error_mark_node
1847 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1848 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1849 error ("expression statement has incomplete type");
1851 last_expr_type = TREE_TYPE (expr);
1852 return add_stmt (build_stmt (EXPR_STMT, expr));
1855 /* Validate the expression after `case' and apply default promotions. */
1858 check_case_value (tree value)
1860 if (value == NULL_TREE)
1863 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1864 STRIP_TYPE_NOPS (value);
1865 /* In C++, the following is allowed:
1868 switch (...) { case i: ... }
1870 So, we try to reduce the VALUE to a constant that way. */
1871 if (c_language == clk_cplusplus)
1873 value = decl_constant_value (value);
1874 STRIP_TYPE_NOPS (value);
1875 value = fold (value);
1878 if (TREE_CODE (value) != INTEGER_CST
1879 && value != error_mark_node)
1881 error ("case label does not reduce to an integer constant");
1882 value = error_mark_node;
1885 /* Promote char or short to int. */
1886 value = default_conversion (value);
1888 constant_expression_warning (value);
1893 /* Return an integer type with BITS bits of precision,
1894 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1897 c_common_type_for_size (unsigned int bits, int unsignedp)
1899 if (bits == TYPE_PRECISION (integer_type_node))
1900 return unsignedp ? unsigned_type_node : integer_type_node;
1902 if (bits == TYPE_PRECISION (signed_char_type_node))
1903 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1905 if (bits == TYPE_PRECISION (short_integer_type_node))
1906 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1908 if (bits == TYPE_PRECISION (long_integer_type_node))
1909 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1911 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1912 return (unsignedp ? long_long_unsigned_type_node
1913 : long_long_integer_type_node);
1915 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1916 return (unsignedp ? widest_unsigned_literal_type_node
1917 : widest_integer_literal_type_node);
1919 if (bits <= TYPE_PRECISION (intQI_type_node))
1920 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1922 if (bits <= TYPE_PRECISION (intHI_type_node))
1923 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1925 if (bits <= TYPE_PRECISION (intSI_type_node))
1926 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1928 if (bits <= TYPE_PRECISION (intDI_type_node))
1929 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1934 /* Return a data type that has machine mode MODE.
1935 If the mode is an integer,
1936 then UNSIGNEDP selects between signed and unsigned types. */
1939 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1941 if (mode == TYPE_MODE (integer_type_node))
1942 return unsignedp ? unsigned_type_node : integer_type_node;
1944 if (mode == TYPE_MODE (signed_char_type_node))
1945 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1947 if (mode == TYPE_MODE (short_integer_type_node))
1948 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1950 if (mode == TYPE_MODE (long_integer_type_node))
1951 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1953 if (mode == TYPE_MODE (long_long_integer_type_node))
1954 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1956 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1957 return unsignedp ? widest_unsigned_literal_type_node
1958 : widest_integer_literal_type_node;
1961 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1964 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1967 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1970 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1972 #if HOST_BITS_PER_WIDE_INT >= 64
1973 if (mode == TYPE_MODE (intTI_type_node))
1974 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1977 if (mode == TYPE_MODE (float_type_node))
1978 return float_type_node;
1980 if (mode == TYPE_MODE (double_type_node))
1981 return double_type_node;
1983 if (mode == TYPE_MODE (long_double_type_node))
1984 return long_double_type_node;
1986 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1987 return build_pointer_type (char_type_node);
1989 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1990 return build_pointer_type (integer_type_node);
1995 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1997 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1999 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
2001 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
2003 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
2005 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
2007 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
2009 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
2011 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
2013 return V16SF_type_node;
2015 return V4SF_type_node;
2017 return V2SF_type_node;
2019 return V2DF_type_node;
2027 /* Return an unsigned type the same as TYPE in other respects. */
2029 c_common_unsigned_type (tree type)
2031 tree type1 = TYPE_MAIN_VARIANT (type);
2032 if (type1 == signed_char_type_node || type1 == char_type_node)
2033 return unsigned_char_type_node;
2034 if (type1 == integer_type_node)
2035 return unsigned_type_node;
2036 if (type1 == short_integer_type_node)
2037 return short_unsigned_type_node;
2038 if (type1 == long_integer_type_node)
2039 return long_unsigned_type_node;
2040 if (type1 == long_long_integer_type_node)
2041 return long_long_unsigned_type_node;
2042 if (type1 == widest_integer_literal_type_node)
2043 return widest_unsigned_literal_type_node;
2044 #if HOST_BITS_PER_WIDE_INT >= 64
2045 if (type1 == intTI_type_node)
2046 return unsigned_intTI_type_node;
2048 if (type1 == intDI_type_node)
2049 return unsigned_intDI_type_node;
2050 if (type1 == intSI_type_node)
2051 return unsigned_intSI_type_node;
2052 if (type1 == intHI_type_node)
2053 return unsigned_intHI_type_node;
2054 if (type1 == intQI_type_node)
2055 return unsigned_intQI_type_node;
2057 return c_common_signed_or_unsigned_type (1, type);
2060 /* Return a signed type the same as TYPE in other respects. */
2063 c_common_signed_type (tree type)
2065 tree type1 = TYPE_MAIN_VARIANT (type);
2066 if (type1 == unsigned_char_type_node || type1 == char_type_node)
2067 return signed_char_type_node;
2068 if (type1 == unsigned_type_node)
2069 return integer_type_node;
2070 if (type1 == short_unsigned_type_node)
2071 return short_integer_type_node;
2072 if (type1 == long_unsigned_type_node)
2073 return long_integer_type_node;
2074 if (type1 == long_long_unsigned_type_node)
2075 return long_long_integer_type_node;
2076 if (type1 == widest_unsigned_literal_type_node)
2077 return widest_integer_literal_type_node;
2078 #if HOST_BITS_PER_WIDE_INT >= 64
2079 if (type1 == unsigned_intTI_type_node)
2080 return intTI_type_node;
2082 if (type1 == unsigned_intDI_type_node)
2083 return intDI_type_node;
2084 if (type1 == unsigned_intSI_type_node)
2085 return intSI_type_node;
2086 if (type1 == unsigned_intHI_type_node)
2087 return intHI_type_node;
2088 if (type1 == unsigned_intQI_type_node)
2089 return intQI_type_node;
2091 return c_common_signed_or_unsigned_type (0, type);
2094 /* Return a type the same as TYPE except unsigned or
2095 signed according to UNSIGNEDP. */
2098 c_common_signed_or_unsigned_type (int unsignedp, tree type)
2100 if (! INTEGRAL_TYPE_P (type)
2101 || TREE_UNSIGNED (type) == unsignedp)
2104 if (TYPE_PRECISION (type) == TYPE_PRECISION (signed_char_type_node))
2105 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2106 if (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
2107 return unsignedp ? unsigned_type_node : integer_type_node;
2108 if (TYPE_PRECISION (type) == TYPE_PRECISION (short_integer_type_node))
2109 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2110 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_integer_type_node))
2111 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2112 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_long_integer_type_node))
2113 return (unsignedp ? long_long_unsigned_type_node
2114 : long_long_integer_type_node);
2115 if (TYPE_PRECISION (type) == TYPE_PRECISION (widest_integer_literal_type_node))
2116 return (unsignedp ? widest_unsigned_literal_type_node
2117 : widest_integer_literal_type_node);
2119 #if HOST_BITS_PER_WIDE_INT >= 64
2120 if (TYPE_PRECISION (type) == TYPE_PRECISION (intTI_type_node))
2121 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2123 if (TYPE_PRECISION (type) == TYPE_PRECISION (intDI_type_node))
2124 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2125 if (TYPE_PRECISION (type) == TYPE_PRECISION (intSI_type_node))
2126 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2127 if (TYPE_PRECISION (type) == TYPE_PRECISION (intHI_type_node))
2128 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2129 if (TYPE_PRECISION (type) == TYPE_PRECISION (intQI_type_node))
2130 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2135 /* Return the minimum number of bits needed to represent VALUE in a
2136 signed or unsigned type, UNSIGNEDP says which. */
2139 min_precision (tree value, int unsignedp)
2143 /* If the value is negative, compute its negative minus 1. The latter
2144 adjustment is because the absolute value of the largest negative value
2145 is one larger than the largest positive value. This is equivalent to
2146 a bit-wise negation, so use that operation instead. */
2148 if (tree_int_cst_sgn (value) < 0)
2149 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2151 /* Return the number of bits needed, taking into account the fact
2152 that we need one more bit for a signed than unsigned type. */
2154 if (integer_zerop (value))
2157 log = tree_floor_log2 (value);
2159 return log + 1 + ! unsignedp;
2162 /* Print an error message for invalid operands to arith operation
2163 CODE. NOP_EXPR is used as a special case (see
2164 c_common_truthvalue_conversion). */
2167 binary_op_error (enum tree_code code)
2174 error ("invalid truth-value expression");
2178 opname = "+"; break;
2180 opname = "-"; break;
2182 opname = "*"; break;
2184 opname = "max"; break;
2186 opname = "min"; break;
2188 opname = "=="; break;
2190 opname = "!="; break;
2192 opname = "<="; break;
2194 opname = ">="; break;
2196 opname = "<"; break;
2198 opname = ">"; break;
2200 opname = "<<"; break;
2202 opname = ">>"; break;
2203 case TRUNC_MOD_EXPR:
2204 case FLOOR_MOD_EXPR:
2205 opname = "%"; break;
2206 case TRUNC_DIV_EXPR:
2207 case FLOOR_DIV_EXPR:
2208 opname = "/"; break;
2210 opname = "&"; break;
2212 opname = "|"; break;
2213 case TRUTH_ANDIF_EXPR:
2214 opname = "&&"; break;
2215 case TRUTH_ORIF_EXPR:
2216 opname = "||"; break;
2218 opname = "^"; break;
2221 opname = "rotate"; break;
2223 opname = "unknown"; break;
2225 error ("invalid operands to binary %s", opname);
2228 /* Subroutine of build_binary_op, used for comparison operations.
2229 See if the operands have both been converted from subword integer types
2230 and, if so, perhaps change them both back to their original type.
2231 This function is also responsible for converting the two operands
2232 to the proper common type for comparison.
2234 The arguments of this function are all pointers to local variables
2235 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2236 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2238 If this function returns nonzero, it means that the comparison has
2239 a constant value. What this function returns is an expression for
2243 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2244 enum tree_code *rescode_ptr)
2247 tree op0 = *op0_ptr;
2248 tree op1 = *op1_ptr;
2249 int unsignedp0, unsignedp1;
2251 tree primop0, primop1;
2252 enum tree_code code = *rescode_ptr;
2254 /* Throw away any conversions to wider types
2255 already present in the operands. */
2257 primop0 = get_narrower (op0, &unsignedp0);
2258 primop1 = get_narrower (op1, &unsignedp1);
2260 /* Handle the case that OP0 does not *contain* a conversion
2261 but it *requires* conversion to FINAL_TYPE. */
2263 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2264 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2265 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2266 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2268 /* If one of the operands must be floated, we cannot optimize. */
2269 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2270 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2272 /* If first arg is constant, swap the args (changing operation
2273 so value is preserved), for canonicalization. Don't do this if
2274 the second arg is 0. */
2276 if (TREE_CONSTANT (primop0)
2277 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2280 int temi = unsignedp0;
2288 unsignedp0 = unsignedp1;
2311 *rescode_ptr = code;
2314 /* If comparing an integer against a constant more bits wide,
2315 maybe we can deduce a value of 1 or 0 independent of the data.
2316 Or else truncate the constant now
2317 rather than extend the variable at run time.
2319 This is only interesting if the constant is the wider arg.
2320 Also, it is not safe if the constant is unsigned and the
2321 variable arg is signed, since in this case the variable
2322 would be sign-extended and then regarded as unsigned.
2323 Our technique fails in this case because the lowest/highest
2324 possible unsigned results don't follow naturally from the
2325 lowest/highest possible values of the variable operand.
2326 For just EQ_EXPR and NE_EXPR there is another technique that
2327 could be used: see if the constant can be faithfully represented
2328 in the other operand's type, by truncating it and reextending it
2329 and see if that preserves the constant's value. */
2331 if (!real1 && !real2
2332 && TREE_CODE (primop1) == INTEGER_CST
2333 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2335 int min_gt, max_gt, min_lt, max_lt;
2336 tree maxval, minval;
2337 /* 1 if comparison is nominally unsigned. */
2338 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2341 type = c_common_signed_or_unsigned_type (unsignedp0,
2342 TREE_TYPE (primop0));
2344 /* If TYPE is an enumeration, then we need to get its min/max
2345 values from it's underlying integral type, not the enumerated
2347 if (TREE_CODE (type) == ENUMERAL_TYPE)
2348 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2350 maxval = TYPE_MAX_VALUE (type);
2351 minval = TYPE_MIN_VALUE (type);
2353 if (unsignedp && !unsignedp0)
2354 *restype_ptr = c_common_signed_type (*restype_ptr);
2356 if (TREE_TYPE (primop1) != *restype_ptr)
2357 primop1 = convert (*restype_ptr, primop1);
2358 if (type != *restype_ptr)
2360 minval = convert (*restype_ptr, minval);
2361 maxval = convert (*restype_ptr, maxval);
2364 if (unsignedp && unsignedp0)
2366 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2367 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2368 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2369 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2373 min_gt = INT_CST_LT (primop1, minval);
2374 max_gt = INT_CST_LT (primop1, maxval);
2375 min_lt = INT_CST_LT (minval, primop1);
2376 max_lt = INT_CST_LT (maxval, primop1);
2380 /* This used to be a switch, but Genix compiler can't handle that. */
2381 if (code == NE_EXPR)
2383 if (max_lt || min_gt)
2384 val = boolean_true_node;
2386 else if (code == EQ_EXPR)
2388 if (max_lt || min_gt)
2389 val = boolean_false_node;
2391 else if (code == LT_EXPR)
2394 val = boolean_true_node;
2396 val = boolean_false_node;
2398 else if (code == GT_EXPR)
2401 val = boolean_true_node;
2403 val = boolean_false_node;
2405 else if (code == LE_EXPR)
2408 val = boolean_true_node;
2410 val = boolean_false_node;
2412 else if (code == GE_EXPR)
2415 val = boolean_true_node;
2417 val = boolean_false_node;
2420 /* If primop0 was sign-extended and unsigned comparison specd,
2421 we did a signed comparison above using the signed type bounds.
2422 But the comparison we output must be unsigned.
2424 Also, for inequalities, VAL is no good; but if the signed
2425 comparison had *any* fixed result, it follows that the
2426 unsigned comparison just tests the sign in reverse
2427 (positive values are LE, negative ones GE).
2428 So we can generate an unsigned comparison
2429 against an extreme value of the signed type. */
2431 if (unsignedp && !unsignedp0)
2438 primop1 = TYPE_MIN_VALUE (type);
2444 primop1 = TYPE_MAX_VALUE (type);
2451 type = c_common_unsigned_type (type);
2454 if (TREE_CODE (primop0) != INTEGER_CST)
2456 if (val == boolean_false_node)
2457 warning ("comparison is always false due to limited range of data type");
2458 if (val == boolean_true_node)
2459 warning ("comparison is always true due to limited range of data type");
2464 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2465 if (TREE_SIDE_EFFECTS (primop0))
2466 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2470 /* Value is not predetermined, but do the comparison
2471 in the type of the operand that is not constant.
2472 TYPE is already properly set. */
2474 else if (real1 && real2
2475 && (TYPE_PRECISION (TREE_TYPE (primop0))
2476 == TYPE_PRECISION (TREE_TYPE (primop1))))
2477 type = TREE_TYPE (primop0);
2479 /* If args' natural types are both narrower than nominal type
2480 and both extend in the same manner, compare them
2481 in the type of the wider arg.
2482 Otherwise must actually extend both to the nominal
2483 common type lest different ways of extending
2485 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2487 else if (unsignedp0 == unsignedp1 && real1 == real2
2488 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2489 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2491 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2492 type = c_common_signed_or_unsigned_type (unsignedp0
2493 || TREE_UNSIGNED (*restype_ptr),
2495 /* Make sure shorter operand is extended the right way
2496 to match the longer operand. */
2498 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2499 TREE_TYPE (primop0)),
2502 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2503 TREE_TYPE (primop1)),
2508 /* Here we must do the comparison on the nominal type
2509 using the args exactly as we received them. */
2510 type = *restype_ptr;
2514 if (!real1 && !real2 && integer_zerop (primop1)
2515 && TREE_UNSIGNED (*restype_ptr))
2521 /* All unsigned values are >= 0, so we warn if extra warnings
2522 are requested. However, if OP0 is a constant that is
2523 >= 0, the signedness of the comparison isn't an issue,
2524 so suppress the warning. */
2525 if (extra_warnings && !in_system_header
2526 && ! (TREE_CODE (primop0) == INTEGER_CST
2527 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2529 warning ("comparison of unsigned expression >= 0 is always true");
2530 value = boolean_true_node;
2534 if (extra_warnings && !in_system_header
2535 && ! (TREE_CODE (primop0) == INTEGER_CST
2536 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2538 warning ("comparison of unsigned expression < 0 is always false");
2539 value = boolean_false_node;
2548 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2549 if (TREE_SIDE_EFFECTS (primop0))
2550 return build (COMPOUND_EXPR, TREE_TYPE (value),
2557 *op0_ptr = convert (type, primop0);
2558 *op1_ptr = convert (type, primop1);
2560 *restype_ptr = boolean_type_node;
2565 /* Return a tree for the sum or difference (RESULTCODE says which)
2566 of pointer PTROP and integer INTOP. */
2569 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2576 /* The result is a pointer of the same type that is being added. */
2578 tree result_type = TREE_TYPE (ptrop);
2580 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2582 if (pedantic || warn_pointer_arith)
2583 pedwarn ("pointer of type `void *' used in arithmetic");
2584 size_exp = integer_one_node;
2586 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2588 if (pedantic || warn_pointer_arith)
2589 pedwarn ("pointer to a function used in arithmetic");
2590 size_exp = integer_one_node;
2592 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2594 if (pedantic || warn_pointer_arith)
2595 pedwarn ("pointer to member function used in arithmetic");
2596 size_exp = integer_one_node;
2598 else if (TREE_CODE (TREE_TYPE (result_type)) == OFFSET_TYPE)
2600 if (pedantic || warn_pointer_arith)
2601 pedwarn ("pointer to a member used in arithmetic");
2602 size_exp = integer_one_node;
2605 size_exp = size_in_bytes (TREE_TYPE (result_type));
2607 /* If what we are about to multiply by the size of the elements
2608 contains a constant term, apply distributive law
2609 and multiply that constant term separately.
2610 This helps produce common subexpressions. */
2612 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2613 && ! TREE_CONSTANT (intop)
2614 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2615 && TREE_CONSTANT (size_exp)
2616 /* If the constant comes from pointer subtraction,
2617 skip this optimization--it would cause an error. */
2618 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2619 /* If the constant is unsigned, and smaller than the pointer size,
2620 then we must skip this optimization. This is because it could cause
2621 an overflow error if the constant is negative but INTOP is not. */
2622 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2623 || (TYPE_PRECISION (TREE_TYPE (intop))
2624 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2626 enum tree_code subcode = resultcode;
2627 tree int_type = TREE_TYPE (intop);
2628 if (TREE_CODE (intop) == MINUS_EXPR)
2629 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2630 /* Convert both subexpression types to the type of intop,
2631 because weird cases involving pointer arithmetic
2632 can result in a sum or difference with different type args. */
2633 ptrop = build_binary_op (subcode, ptrop,
2634 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2635 intop = convert (int_type, TREE_OPERAND (intop, 0));
2638 /* Convert the integer argument to a type the same size as sizetype
2639 so the multiply won't overflow spuriously. */
2641 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2642 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2643 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2644 TREE_UNSIGNED (sizetype)), intop);
2646 /* Replace the integer argument with a suitable product by the object size.
2647 Do this multiplication as signed, then convert to the appropriate
2648 pointer type (actually unsigned integral). */
2650 intop = convert (result_type,
2651 build_binary_op (MULT_EXPR, intop,
2652 convert (TREE_TYPE (intop), size_exp), 1));
2654 /* Create the sum or difference. */
2656 result = build (resultcode, result_type, ptrop, intop);
2658 folded = fold (result);
2659 if (folded == result)
2660 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2664 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2665 or validate its data type for an `if' or `while' statement or ?..: exp.
2667 This preparation consists of taking the ordinary
2668 representation of an expression expr and producing a valid tree
2669 boolean expression describing whether expr is nonzero. We could
2670 simply always do build_binary_op (NE_EXPR, expr, boolean_false_node, 1),
2671 but we optimize comparisons, &&, ||, and !.
2673 The resulting type should always be `boolean_type_node'. */
2676 c_common_truthvalue_conversion (tree expr)
2678 if (TREE_CODE (expr) == ERROR_MARK)
2681 #if 0 /* This appears to be wrong for C++. */
2682 /* These really should return error_mark_node after 2.4 is stable.
2683 But not all callers handle ERROR_MARK properly. */
2684 switch (TREE_CODE (TREE_TYPE (expr)))
2687 error ("struct type value used where scalar is required");
2688 return boolean_false_node;
2691 error ("union type value used where scalar is required");
2692 return boolean_false_node;
2695 error ("array type value used where scalar is required");
2696 return boolean_false_node;
2703 switch (TREE_CODE (expr))
2706 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2707 case TRUTH_ANDIF_EXPR:
2708 case TRUTH_ORIF_EXPR:
2709 case TRUTH_AND_EXPR:
2711 case TRUTH_XOR_EXPR:
2712 case TRUTH_NOT_EXPR:
2713 TREE_TYPE (expr) = boolean_type_node;
2720 return integer_zerop (expr) ? boolean_false_node : boolean_true_node;
2723 return real_zerop (expr) ? boolean_false_node : boolean_true_node;
2726 /* If we are taking the address of an external decl, it might be zero
2727 if it is weak, so we cannot optimize. */
2728 if (DECL_P (TREE_OPERAND (expr, 0))
2729 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2732 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2733 return build (COMPOUND_EXPR, boolean_type_node,
2734 TREE_OPERAND (expr, 0), boolean_true_node);
2736 return boolean_true_node;
2739 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2740 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2741 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2742 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2750 /* These don't change whether an object is nonzero or zero. */
2751 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2755 /* These don't change whether an object is zero or nonzero, but
2756 we can't ignore them if their second arg has side-effects. */
2757 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2758 return build (COMPOUND_EXPR, boolean_type_node, TREE_OPERAND (expr, 1),
2759 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2761 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2764 /* Distribute the conversion into the arms of a COND_EXPR. */
2765 return fold (build (COND_EXPR, boolean_type_node, TREE_OPERAND (expr, 0),
2766 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2767 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2770 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2771 since that affects how `default_conversion' will behave. */
2772 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2773 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2775 /* fall through... */
2777 /* If this is widening the argument, we can ignore it. */
2778 if (TYPE_PRECISION (TREE_TYPE (expr))
2779 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2780 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2784 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2785 aren't guaranteed to the be same for modes that can represent
2786 infinity, since if x and y are both +infinity, or both
2787 -infinity, then x - y is not a number.
2789 Note that this transformation is safe when x or y is NaN.
2790 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2792 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2794 /* fall through... */
2796 /* This and MINUS_EXPR can be changed into a comparison of the
2798 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2799 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2800 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2801 TREE_OPERAND (expr, 1), 1);
2802 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2803 fold (build1 (NOP_EXPR,
2804 TREE_TYPE (TREE_OPERAND (expr, 0)),
2805 TREE_OPERAND (expr, 1))), 1);
2808 if (integer_onep (TREE_OPERAND (expr, 1))
2809 && TREE_TYPE (expr) != boolean_type_node)
2810 /* Using convert here would cause infinite recursion. */
2811 return build1 (NOP_EXPR, boolean_type_node, expr);
2815 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2816 warning ("suggest parentheses around assignment used as truth value");
2823 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2825 tree t = save_expr (expr);
2826 return (build_binary_op
2827 ((TREE_SIDE_EFFECTS (expr)
2828 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2829 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2830 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2834 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2837 static tree builtin_function_2 (const char *, const char *, tree, tree,
2838 int, enum built_in_class, int, int,
2841 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2842 down to the element type of an array. */
2845 c_build_qualified_type (tree type, int type_quals)
2847 /* A restrict-qualified pointer type must be a pointer to object or
2848 incomplete type. Note that the use of POINTER_TYPE_P also allows
2849 REFERENCE_TYPEs, which is appropriate for C++. Unfortunately,
2850 the C++ front-end also use POINTER_TYPE for pointer-to-member
2851 values, so even though it should be illegal to use `restrict'
2852 with such an entity we don't flag that here. Thus, special case
2853 code for that case is required in the C++ front-end. */
2854 if ((type_quals & TYPE_QUAL_RESTRICT)
2855 && (!POINTER_TYPE_P (type)
2856 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2858 error ("invalid use of `restrict'");
2859 type_quals &= ~TYPE_QUAL_RESTRICT;
2862 if (TREE_CODE (type) == ARRAY_TYPE)
2863 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2865 TYPE_DOMAIN (type));
2866 return build_qualified_type (type, type_quals);
2869 /* Apply the TYPE_QUALS to the new DECL. */
2872 c_apply_type_quals_to_decl (int type_quals, tree decl)
2874 if ((type_quals & TYPE_QUAL_CONST)
2875 || (TREE_TYPE (decl)
2876 && TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE))
2877 TREE_READONLY (decl) = 1;
2878 if (type_quals & TYPE_QUAL_VOLATILE)
2880 TREE_SIDE_EFFECTS (decl) = 1;
2881 TREE_THIS_VOLATILE (decl) = 1;
2883 if (type_quals & TYPE_QUAL_RESTRICT)
2885 if (!TREE_TYPE (decl)
2886 || !POINTER_TYPE_P (TREE_TYPE (decl))
2887 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (TREE_TYPE (decl))))
2888 error ("invalid use of `restrict'");
2889 else if (flag_strict_aliasing)
2890 /* Indicate we need to make a unique alias set for this pointer.
2891 We can't do it here because it might be pointing to an
2893 DECL_POINTER_ALIAS_SET (decl) = -2;
2897 /* Return the typed-based alias set for T, which may be an expression
2898 or a type. Return -1 if we don't do anything special. */
2901 c_common_get_alias_set (tree t)
2905 /* Permit type-punning when accessing a union, provided the access
2906 is directly through the union. For example, this code does not
2907 permit taking the address of a union member and then storing
2908 through it. Even the type-punning allowed here is a GCC
2909 extension, albeit a common and useful one; the C standard says
2910 that such accesses have implementation-defined behavior. */
2912 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2913 u = TREE_OPERAND (u, 0))
2914 if (TREE_CODE (u) == COMPONENT_REF
2915 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2918 /* That's all the expressions we handle specially. */
2922 /* The C standard guarantees that any object may be accessed via an
2923 lvalue that has character type. */
2924 if (t == char_type_node
2925 || t == signed_char_type_node
2926 || t == unsigned_char_type_node)
2929 /* If it has the may_alias attribute, it can alias anything. */
2930 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2933 /* The C standard specifically allows aliasing between signed and
2934 unsigned variants of the same type. We treat the signed
2935 variant as canonical. */
2936 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2938 tree t1 = c_common_signed_type (t);
2940 /* t1 == t can happen for boolean nodes which are always unsigned. */
2942 return get_alias_set (t1);
2944 else if (POINTER_TYPE_P (t))
2948 /* Unfortunately, there is no canonical form of a pointer type.
2949 In particular, if we have `typedef int I', then `int *', and
2950 `I *' are different types. So, we have to pick a canonical
2951 representative. We do this below.
2953 Technically, this approach is actually more conservative that
2954 it needs to be. In particular, `const int *' and `int *'
2955 should be in different alias sets, according to the C and C++
2956 standard, since their types are not the same, and so,
2957 technically, an `int **' and `const int **' cannot point at
2960 But, the standard is wrong. In particular, this code is
2965 const int* const* cipp = &ipp;
2967 And, it doesn't make sense for that to be legal unless you
2968 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2969 the pointed-to types. This issue has been reported to the
2971 t1 = build_type_no_quals (t);
2973 return get_alias_set (t1);
2979 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2980 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2981 flag controls whether we should diagnose possibly ill-formed
2982 constructs or not. */
2984 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2986 const char *op_name;
2988 enum tree_code type_code = TREE_CODE (type);
2990 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2991 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2993 if (type_code == FUNCTION_TYPE)
2995 if (op == SIZEOF_EXPR)
2997 if (complain && (pedantic || warn_pointer_arith))
2998 pedwarn ("invalid application of `sizeof' to a function type");
2999 value = size_one_node;
3002 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
3004 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
3006 if (type_code == VOID_TYPE
3007 && complain && (pedantic || warn_pointer_arith))
3008 pedwarn ("invalid application of `%s' to a void type", op_name);
3009 value = size_one_node;
3011 else if (!COMPLETE_TYPE_P (type))
3014 error ("invalid application of `%s' to an incomplete type", op_name);
3015 value = size_zero_node;
3019 if (op == SIZEOF_EXPR)
3020 /* Convert in case a char is more than one unit. */
3021 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
3022 size_int (TYPE_PRECISION (char_type_node)
3025 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
3028 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3029 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3030 never happen. However, this node should really have type
3031 `size_t', which is just a typedef for an ordinary integer type. */
3032 value = fold (build1 (NOP_EXPR, size_type_node, value));
3033 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
3038 /* Implement the __alignof keyword: Return the minimum required
3039 alignment of EXPR, measured in bytes. For VAR_DECL's and
3040 FIELD_DECL's return DECL_ALIGN (which can be set from an
3041 "aligned" __attribute__ specification). */
3044 c_alignof_expr (tree expr)
3048 if (TREE_CODE (expr) == VAR_DECL)
3049 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
3051 else if (TREE_CODE (expr) == COMPONENT_REF
3052 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
3054 error ("`__alignof' applied to a bit-field");
3057 else if (TREE_CODE (expr) == COMPONENT_REF
3058 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
3059 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
3061 else if (TREE_CODE (expr) == INDIRECT_REF)
3063 tree t = TREE_OPERAND (expr, 0);
3065 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3067 while (TREE_CODE (t) == NOP_EXPR
3068 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3072 t = TREE_OPERAND (t, 0);
3073 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3074 if (thisalign > bestalign)
3075 best = t, bestalign = thisalign;
3077 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3080 return c_alignof (TREE_TYPE (expr));
3082 return fold (build1 (NOP_EXPR, size_type_node, t));
3085 /* Handle C and C++ default attributes. */
3087 enum built_in_attribute
3089 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3090 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3091 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3092 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3093 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No entry needed in enum. */
3094 #include "builtin-attrs.def"
3095 #undef DEF_ATTR_NULL_TREE
3097 #undef DEF_ATTR_IDENT
3098 #undef DEF_ATTR_TREE_LIST
3103 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3105 static bool c_attrs_initialized = false;
3107 static void c_init_attributes (void);
3109 /* Build tree nodes and builtin functions common to both C and C++ language
3113 c_common_nodes_and_builtins (void)
3117 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3118 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3119 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3120 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3121 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3122 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3123 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3124 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3125 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3126 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3127 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3128 #include "builtin-types.def"
3129 #undef DEF_PRIMITIVE_TYPE
3130 #undef DEF_FUNCTION_TYPE_0
3131 #undef DEF_FUNCTION_TYPE_1
3132 #undef DEF_FUNCTION_TYPE_2
3133 #undef DEF_FUNCTION_TYPE_3
3134 #undef DEF_FUNCTION_TYPE_4
3135 #undef DEF_FUNCTION_TYPE_VAR_0
3136 #undef DEF_FUNCTION_TYPE_VAR_1
3137 #undef DEF_FUNCTION_TYPE_VAR_2
3138 #undef DEF_FUNCTION_TYPE_VAR_3
3139 #undef DEF_POINTER_TYPE
3143 typedef enum builtin_type builtin_type;
3145 tree builtin_types[(int) BT_LAST];
3146 int wchar_type_size;
3147 tree array_domain_type;
3148 tree va_list_ref_type_node;
3149 tree va_list_arg_type_node;
3151 /* Define `int' and `char' first so that dbx will output them first. */
3152 record_builtin_type (RID_INT, NULL, integer_type_node);
3153 record_builtin_type (RID_CHAR, "char", char_type_node);
3155 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3156 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3157 but not C. Are the conditionals here needed? */
3158 if (c_language == clk_cplusplus)
3159 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3160 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3161 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3162 record_builtin_type (RID_MAX, "long unsigned int",
3163 long_unsigned_type_node);
3164 if (c_language == clk_cplusplus)
3165 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3166 record_builtin_type (RID_MAX, "long long int",
3167 long_long_integer_type_node);
3168 record_builtin_type (RID_MAX, "long long unsigned int",
3169 long_long_unsigned_type_node);
3170 if (c_language == clk_cplusplus)
3171 record_builtin_type (RID_MAX, "long long unsigned",
3172 long_long_unsigned_type_node);
3173 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3174 record_builtin_type (RID_MAX, "short unsigned int",
3175 short_unsigned_type_node);
3176 if (c_language == clk_cplusplus)
3177 record_builtin_type (RID_MAX, "unsigned short",
3178 short_unsigned_type_node);
3180 /* Define both `signed char' and `unsigned char'. */
3181 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3182 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3184 /* These are types that c_common_type_for_size and
3185 c_common_type_for_mode use. */
3186 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3188 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3190 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3192 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3194 #if HOST_BITS_PER_WIDE_INT >= 64
3195 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3196 get_identifier ("__int128_t"),
3199 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3200 unsigned_intQI_type_node));
3201 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3202 unsigned_intHI_type_node));
3203 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3204 unsigned_intSI_type_node));
3205 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3206 unsigned_intDI_type_node));
3207 #if HOST_BITS_PER_WIDE_INT >= 64
3208 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3209 get_identifier ("__uint128_t"),
3210 unsigned_intTI_type_node));
3213 /* Create the widest literal types. */
3214 widest_integer_literal_type_node
3215 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3216 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3217 widest_integer_literal_type_node));
3219 widest_unsigned_literal_type_node
3220 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3221 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3222 widest_unsigned_literal_type_node));
3224 /* `unsigned long' is the standard type for sizeof.
3225 Note that stddef.h uses `unsigned long',
3226 and this must agree, even if long and int are the same size. */
3228 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3229 signed_size_type_node = c_common_signed_type (size_type_node);
3230 set_sizetype (size_type_node);
3232 build_common_tree_nodes_2 (flag_short_double);
3234 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3235 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3236 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3238 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3239 get_identifier ("complex int"),
3240 complex_integer_type_node));
3241 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3242 get_identifier ("complex float"),
3243 complex_float_type_node));
3244 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3245 get_identifier ("complex double"),
3246 complex_double_type_node));
3247 (*lang_hooks.decls.pushdecl)
3248 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3249 complex_long_double_type_node));
3251 /* Types which are common to the fortran compiler and libf2c. When
3252 changing these, you also need to be concerned with f/com.h. */
3254 if (TYPE_PRECISION (float_type_node)
3255 == TYPE_PRECISION (long_integer_type_node))
3257 g77_integer_type_node = long_integer_type_node;
3258 g77_uinteger_type_node = long_unsigned_type_node;
3260 else if (TYPE_PRECISION (float_type_node)
3261 == TYPE_PRECISION (integer_type_node))
3263 g77_integer_type_node = integer_type_node;
3264 g77_uinteger_type_node = unsigned_type_node;
3267 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3269 if (g77_integer_type_node != NULL_TREE)
3271 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3272 get_identifier ("__g77_integer"),
3273 g77_integer_type_node));
3274 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3275 get_identifier ("__g77_uinteger"),
3276 g77_uinteger_type_node));
3279 if (TYPE_PRECISION (float_type_node) * 2
3280 == TYPE_PRECISION (long_integer_type_node))
3282 g77_longint_type_node = long_integer_type_node;
3283 g77_ulongint_type_node = long_unsigned_type_node;
3285 else if (TYPE_PRECISION (float_type_node) * 2
3286 == TYPE_PRECISION (long_long_integer_type_node))
3288 g77_longint_type_node = long_long_integer_type_node;
3289 g77_ulongint_type_node = long_long_unsigned_type_node;
3292 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3294 if (g77_longint_type_node != NULL_TREE)
3296 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3297 get_identifier ("__g77_longint"),
3298 g77_longint_type_node));
3299 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3300 get_identifier ("__g77_ulongint"),
3301 g77_ulongint_type_node));
3304 record_builtin_type (RID_VOID, NULL, void_type_node);
3306 void_zero_node = build_int_2 (0, 0);
3307 TREE_TYPE (void_zero_node) = void_type_node;
3309 void_list_node = build_void_list_node ();
3311 /* Make a type to be the domain of a few array types
3312 whose domains don't really matter.
3313 200 is small enough that it always fits in size_t
3314 and large enough that it can hold most function names for the
3315 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3316 array_domain_type = build_index_type (size_int (200));
3318 /* Make a type for arrays of characters.
3319 With luck nothing will ever really depend on the length of this
3321 char_array_type_node
3322 = build_array_type (char_type_node, array_domain_type);
3324 /* Likewise for arrays of ints. */
3326 = build_array_type (integer_type_node, array_domain_type);
3328 string_type_node = build_pointer_type (char_type_node);
3329 const_string_type_node
3330 = build_pointer_type (build_qualified_type
3331 (char_type_node, TYPE_QUAL_CONST));
3333 /* This is special for C++ so functions can be overloaded. */
3334 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3335 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3336 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3337 if (c_language == clk_cplusplus)
3339 if (TREE_UNSIGNED (wchar_type_node))
3340 wchar_type_node = make_unsigned_type (wchar_type_size);
3342 wchar_type_node = make_signed_type (wchar_type_size);
3343 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3347 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3348 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3351 /* This is for wide string constants. */
3352 wchar_array_type_node
3353 = build_array_type (wchar_type_node, array_domain_type);
3356 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3359 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3361 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3363 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3365 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3366 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3368 (*lang_hooks.decls.pushdecl)
3369 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3370 va_list_type_node));
3372 (*lang_hooks.decls.pushdecl)
3373 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3374 ptrdiff_type_node));
3376 (*lang_hooks.decls.pushdecl)
3377 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3380 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3382 va_list_arg_type_node = va_list_ref_type_node =
3383 build_pointer_type (TREE_TYPE (va_list_type_node));
3387 va_list_arg_type_node = va_list_type_node;
3388 va_list_ref_type_node = build_reference_type (va_list_type_node);
3391 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3392 builtin_types[(int) ENUM] = VALUE;
3393 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3394 builtin_types[(int) ENUM] \
3395 = build_function_type (builtin_types[(int) RETURN], \
3397 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3398 builtin_types[(int) ENUM] \
3399 = build_function_type (builtin_types[(int) RETURN], \
3400 tree_cons (NULL_TREE, \
3401 builtin_types[(int) ARG1], \
3403 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3404 builtin_types[(int) ENUM] \
3405 = build_function_type \
3406 (builtin_types[(int) RETURN], \
3407 tree_cons (NULL_TREE, \
3408 builtin_types[(int) ARG1], \
3409 tree_cons (NULL_TREE, \
3410 builtin_types[(int) ARG2], \
3412 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3413 builtin_types[(int) ENUM] \
3414 = build_function_type \
3415 (builtin_types[(int) RETURN], \
3416 tree_cons (NULL_TREE, \
3417 builtin_types[(int) ARG1], \
3418 tree_cons (NULL_TREE, \
3419 builtin_types[(int) ARG2], \
3420 tree_cons (NULL_TREE, \
3421 builtin_types[(int) ARG3], \
3423 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3424 builtin_types[(int) ENUM] \
3425 = build_function_type \
3426 (builtin_types[(int) RETURN], \
3427 tree_cons (NULL_TREE, \
3428 builtin_types[(int) ARG1], \
3429 tree_cons (NULL_TREE, \
3430 builtin_types[(int) ARG2], \
3433 builtin_types[(int) ARG3], \
3434 tree_cons (NULL_TREE, \
3435 builtin_types[(int) ARG4], \
3436 void_list_node)))));
3437 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3438 builtin_types[(int) ENUM] \
3439 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3440 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3441 builtin_types[(int) ENUM] \
3442 = build_function_type (builtin_types[(int) RETURN], \
3443 tree_cons (NULL_TREE, \
3444 builtin_types[(int) ARG1], \
3447 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3448 builtin_types[(int) ENUM] \
3449 = build_function_type \
3450 (builtin_types[(int) RETURN], \
3451 tree_cons (NULL_TREE, \
3452 builtin_types[(int) ARG1], \
3453 tree_cons (NULL_TREE, \
3454 builtin_types[(int) ARG2], \
3457 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3458 builtin_types[(int) ENUM] \
3459 = build_function_type \
3460 (builtin_types[(int) RETURN], \
3461 tree_cons (NULL_TREE, \
3462 builtin_types[(int) ARG1], \
3463 tree_cons (NULL_TREE, \
3464 builtin_types[(int) ARG2], \
3465 tree_cons (NULL_TREE, \
3466 builtin_types[(int) ARG3], \
3469 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3470 builtin_types[(int) ENUM] \
3471 = build_pointer_type (builtin_types[(int) TYPE]);
3472 #include "builtin-types.def"
3473 #undef DEF_PRIMITIVE_TYPE
3474 #undef DEF_FUNCTION_TYPE_1
3475 #undef DEF_FUNCTION_TYPE_2
3476 #undef DEF_FUNCTION_TYPE_3
3477 #undef DEF_FUNCTION_TYPE_4
3478 #undef DEF_FUNCTION_TYPE_VAR_0
3479 #undef DEF_FUNCTION_TYPE_VAR_1
3480 #undef DEF_FUNCTION_TYPE_VAR_2
3481 #undef DEF_FUNCTION_TYPE_VAR_3
3482 #undef DEF_POINTER_TYPE
3484 if (!c_attrs_initialized)
3485 c_init_attributes ();
3487 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3488 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3493 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3497 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3500 ? (NAME + strlen ("__builtin_")) \
3502 built_in_attributes[(int) ATTRS]); \
3504 decl = builtin_function_2 (NAME, \
3505 NAME + strlen ("__builtin_"), \
3506 builtin_types[TYPE], \
3507 builtin_types[LIBTYPE], \
3512 built_in_attributes[(int) ATTRS]); \
3514 built_in_decls[(int) ENUM] = decl; \
3516 implicit_built_in_decls[(int) ENUM] = decl; \
3518 #include "builtins.def"
3521 (*targetm.init_builtins) ();
3523 main_identifier_node = get_identifier ("main");
3527 build_va_arg (tree expr, tree type)
3529 return build1 (VA_ARG_EXPR, type, expr);
3533 /* Linked list of disabled built-in functions. */
3535 typedef struct disabled_builtin
3538 struct disabled_builtin *next;
3540 static disabled_builtin *disabled_builtins = NULL;
3542 static bool builtin_function_disabled_p (const char *);
3544 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3545 begins with "__builtin_", give an error. */
3548 disable_builtin_function (const char *name)
3550 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3551 error ("cannot disable built-in function `%s'", name);
3554 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3556 new->next = disabled_builtins;
3557 disabled_builtins = new;
3562 /* Return true if the built-in function NAME has been disabled, false
3566 builtin_function_disabled_p (const char *name)
3568 disabled_builtin *p;
3569 for (p = disabled_builtins; p != NULL; p = p->next)
3571 if (strcmp (name, p->name) == 0)
3578 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3579 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3580 of these may be NULL (though both being NULL is useless).
3581 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3582 TYPE is the type of the function with the ordinary name. These
3583 may differ if the ordinary name is declared with a looser type to avoid
3584 conflicts with headers. FUNCTION_CODE and CLASS are as for
3585 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3586 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3587 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3588 ATTRS is the tree list representing the builtin's function attributes.
3589 Returns the declaration of BUILTIN_NAME, if any, otherwise
3590 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3591 or if NONANSI_P and flag_no_nonansi_builtin. */
3594 builtin_function_2 (const char *builtin_name, const char *name,
3595 tree builtin_type, tree type, int function_code,
3596 enum built_in_class class, int library_name_p,
3597 int nonansi_p, tree attrs)
3599 tree bdecl = NULL_TREE;
3600 tree decl = NULL_TREE;
3602 if (builtin_name != 0)
3603 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3604 class, library_name_p ? name : NULL, attrs);
3606 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3607 && !(nonansi_p && flag_no_nonansi_builtin))
3608 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3610 return (bdecl != 0 ? bdecl : decl);
3613 /* Nonzero if the type T promotes to int. This is (nearly) the
3614 integral promotions defined in ISO C99 6.3.1.1/2. */
3617 c_promoting_integer_type_p (tree t)
3619 switch (TREE_CODE (t))
3622 return (TYPE_MAIN_VARIANT (t) == char_type_node
3623 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3624 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3625 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3626 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3627 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3630 /* ??? Technically all enumerations not larger than an int
3631 promote to an int. But this is used along code paths
3632 that only want to notice a size change. */
3633 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3643 /* Return 1 if PARMS specifies a fixed number of parameters
3644 and none of their types is affected by default promotions. */
3647 self_promoting_args_p (tree parms)
3650 for (t = parms; t; t = TREE_CHAIN (t))
3652 tree type = TREE_VALUE (t);
3654 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3660 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3663 if (c_promoting_integer_type_p (type))
3669 /* Recursively examines the array elements of TYPE, until a non-array
3670 element type is found. */
3673 strip_array_types (tree type)
3675 while (TREE_CODE (type) == ARRAY_TYPE)
3676 type = TREE_TYPE (type);
3681 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3683 /* Expand a call to an unordered comparison function such as
3684 __builtin_isgreater(). FUNCTION is the function's declaration and
3685 PARAMS a list of the values passed. For __builtin_isunordered(),
3686 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3687 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3688 that give the opposite of the desired result. UNORDERED_CODE is
3689 used for modes that can hold NaNs and ORDERED_CODE is used for the
3693 expand_unordered_cmp (tree function, tree params,
3694 enum tree_code unordered_code,
3695 enum tree_code ordered_code)
3697 tree arg0, arg1, type;
3698 enum tree_code code0, code1;
3700 /* Check that we have exactly two arguments. */
3701 if (params == 0 || TREE_CHAIN (params) == 0)
3703 error ("too few arguments to function `%s'",
3704 IDENTIFIER_POINTER (DECL_NAME (function)));
3705 return error_mark_node;
3707 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3709 error ("too many arguments to function `%s'",
3710 IDENTIFIER_POINTER (DECL_NAME (function)));
3711 return error_mark_node;
3714 arg0 = TREE_VALUE (params);
3715 arg1 = TREE_VALUE (TREE_CHAIN (params));
3717 code0 = TREE_CODE (TREE_TYPE (arg0));
3718 code1 = TREE_CODE (TREE_TYPE (arg1));
3720 /* Make sure that the arguments have a common type of REAL. */
3722 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3723 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3724 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3726 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3728 error ("non-floating-point argument to function `%s'",
3729 IDENTIFIER_POINTER (DECL_NAME (function)));
3730 return error_mark_node;
3733 if (unordered_code == UNORDERED_EXPR)
3735 if (MODE_HAS_NANS (TYPE_MODE (type)))
3736 return build_binary_op (unordered_code,
3737 convert (type, arg0),
3738 convert (type, arg1),
3741 return integer_zero_node;
3744 return build_unary_op (TRUTH_NOT_EXPR,
3745 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3748 convert (type, arg0),
3749 convert (type, arg1),
3755 /* Recognize certain built-in functions so we can make tree-codes
3756 other than CALL_EXPR. We do this when it enables fold-const.c
3757 to do something useful. */
3758 /* ??? By rights this should go in builtins.c, but only C and C++
3759 implement build_{binary,unary}_op. Not exactly sure what bits
3760 of functionality are actually needed from those functions, or
3761 where the similar functionality exists in the other front ends. */
3764 expand_tree_builtin (tree function, tree params, tree coerced_params)
3766 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3769 switch (DECL_FUNCTION_CODE (function))
3773 case BUILT_IN_LLABS:
3774 case BUILT_IN_IMAXABS:
3776 case BUILT_IN_FABSL:
3777 case BUILT_IN_FABSF:
3778 if (coerced_params == 0)
3779 return integer_zero_node;
3780 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3783 case BUILT_IN_CONJF:
3784 case BUILT_IN_CONJL:
3785 if (coerced_params == 0)
3786 return integer_zero_node;
3787 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3789 case BUILT_IN_CREAL:
3790 case BUILT_IN_CREALF:
3791 case BUILT_IN_CREALL:
3792 if (coerced_params == 0)
3793 return integer_zero_node;
3794 return build_unary_op (REALPART_EXPR, TREE_VALUE (coerced_params), 0);
3796 case BUILT_IN_CIMAG:
3797 case BUILT_IN_CIMAGF:
3798 case BUILT_IN_CIMAGL:
3799 if (coerced_params == 0)
3800 return integer_zero_node;
3801 return build_unary_op (IMAGPART_EXPR, TREE_VALUE (coerced_params), 0);
3803 case BUILT_IN_ISGREATER:
3804 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3806 case BUILT_IN_ISGREATEREQUAL:
3807 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3809 case BUILT_IN_ISLESS:
3810 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3812 case BUILT_IN_ISLESSEQUAL:
3813 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3815 case BUILT_IN_ISLESSGREATER:
3816 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3818 case BUILT_IN_ISUNORDERED:
3819 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3828 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3829 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3830 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3831 value, the traversal is aborted, and the value returned by FUNC is
3832 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3833 the node being visited are not walked.
3835 We don't need a without_duplicates variant of this one because the
3836 statement tree is a tree, not a graph. */
3839 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3841 enum tree_code code;
3846 #define WALK_SUBTREE(NODE) \
3849 result = walk_stmt_tree (&(NODE), func, data); \
3855 /* Skip empty subtrees. */
3859 /* Skip subtrees below non-statement nodes. */
3860 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3863 /* Call the function. */
3865 result = (*func) (tp, &walk_subtrees, data);
3867 /* If we found something, return it. */
3871 /* FUNC may have modified the tree, recheck that we're looking at a
3873 code = TREE_CODE (*tp);
3874 if (!STATEMENT_CODE_P (code))
3877 /* Visit the subtrees unless FUNC decided that there was nothing
3878 interesting below this point in the tree. */
3881 /* Walk over all the sub-trees of this operand. Statement nodes
3882 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3883 len = TREE_CODE_LENGTH (code);
3885 /* Go through the subtrees. We need to do this in forward order so
3886 that the scope of a FOR_EXPR is handled properly. */
3887 for (i = 0; i < len; ++i)
3888 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3891 /* Finally visit the chain. This can be tail-recursion optimized if
3892 we write it this way. */
3893 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3898 /* Used to compare case labels. K1 and K2 are actually tree nodes
3899 representing case labels, or NULL_TREE for a `default' label.
3900 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3901 K2, and 0 if K1 and K2 are equal. */
3904 case_compare (splay_tree_key k1, splay_tree_key k2)
3906 /* Consider a NULL key (such as arises with a `default' label) to be
3907 smaller than anything else. */
3913 return tree_int_cst_compare ((tree) k1, (tree) k2);
3916 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3917 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3918 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3919 case label was declared using the usual C/C++ syntax, rather than
3920 the GNU case range extension. CASES is a tree containing all the
3921 case ranges processed so far; COND is the condition for the
3922 switch-statement itself. Returns the CASE_LABEL created, or
3923 ERROR_MARK_NODE if no CASE_LABEL is created. */
3926 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3932 splay_tree_node node;
3934 /* Create the LABEL_DECL itself. */
3935 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3936 DECL_CONTEXT (label) = current_function_decl;
3938 /* If there was an error processing the switch condition, bail now
3939 before we get more confused. */
3940 if (!cond || cond == error_mark_node)
3942 /* Add a label anyhow so that the back-end doesn't think that
3943 the beginning of the switch is unreachable. */
3945 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3946 return error_mark_node;
3949 if ((low_value && TREE_TYPE (low_value)
3950 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3951 || (high_value && TREE_TYPE (high_value)
3952 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3953 error ("pointers are not permitted as case values");
3955 /* Case ranges are a GNU extension. */
3956 if (high_value && pedantic)
3958 if (c_language == clk_cplusplus)
3959 pedwarn ("ISO C++ forbids range expressions in switch statements");
3961 pedwarn ("ISO C forbids range expressions in switch statements");
3964 type = TREE_TYPE (cond);
3967 low_value = check_case_value (low_value);
3968 low_value = convert_and_check (type, low_value);
3972 high_value = check_case_value (high_value);
3973 high_value = convert_and_check (type, high_value);
3976 /* If an error has occurred, bail out now. */
3977 if (low_value == error_mark_node || high_value == error_mark_node)
3980 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3981 return error_mark_node;
3984 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3985 really a case range, even though it was written that way. Remove
3986 the HIGH_VALUE to simplify later processing. */
3987 if (tree_int_cst_equal (low_value, high_value))
3988 high_value = NULL_TREE;
3989 if (low_value && high_value
3990 && !tree_int_cst_lt (low_value, high_value))
3991 warning ("empty range specified");
3993 /* Look up the LOW_VALUE in the table of case labels we already
3995 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3996 /* If there was not an exact match, check for overlapping ranges.
3997 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3998 that's a `default' label and the only overlap is an exact match. */
3999 if (!node && (low_value || high_value))
4001 splay_tree_node low_bound;
4002 splay_tree_node high_bound;
4004 /* Even though there wasn't an exact match, there might be an
4005 overlap between this case range and another case range.
4006 Since we've (inductively) not allowed any overlapping case
4007 ranges, we simply need to find the greatest low case label
4008 that is smaller that LOW_VALUE, and the smallest low case
4009 label that is greater than LOW_VALUE. If there is an overlap
4010 it will occur in one of these two ranges. */
4011 low_bound = splay_tree_predecessor (cases,
4012 (splay_tree_key) low_value);
4013 high_bound = splay_tree_successor (cases,
4014 (splay_tree_key) low_value);
4016 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4017 the LOW_VALUE, so there is no need to check unless the
4018 LOW_BOUND is in fact itself a case range. */
4020 && CASE_HIGH ((tree) low_bound->value)
4021 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
4024 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4025 range is bigger than the low end of the current range, so we
4026 are only interested if the current range is a real range, and
4027 not an ordinary case label. */
4030 && (tree_int_cst_compare ((tree) high_bound->key,
4035 /* If there was an overlap, issue an error. */
4038 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
4042 error ("duplicate (or overlapping) case value");
4043 error_with_decl (duplicate,
4044 "this is the first entry overlapping that value");
4048 error ("duplicate case value") ;
4049 error_with_decl (duplicate, "previously used here");
4053 error ("multiple default labels in one switch");
4054 error_with_decl (duplicate, "this is the first default label");
4057 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
4060 /* Add a CASE_LABEL to the statement-tree. */
4061 case_label = add_stmt (build_case_label (low_value, high_value, label));
4062 /* Register this case label in the splay tree. */
4063 splay_tree_insert (cases,
4064 (splay_tree_key) low_value,
4065 (splay_tree_value) case_label);
4070 /* Finish an expression taking the address of LABEL (an
4071 IDENTIFIER_NODE). Returns an expression for the address. */
4074 finish_label_address_expr (tree label)
4080 if (c_language == clk_cplusplus)
4081 pedwarn ("ISO C++ forbids taking the address of a label");
4083 pedwarn ("ISO C forbids taking the address of a label");
4086 if (label == error_mark_node)
4087 return error_mark_node;
4089 label = lookup_label (label);
4090 if (label == NULL_TREE)
4091 result = null_pointer_node;
4094 TREE_USED (label) = 1;
4095 result = build1 (ADDR_EXPR, ptr_type_node, label);
4096 TREE_CONSTANT (result) = 1;
4097 /* The current function in not necessarily uninlinable.
4098 Computed gotos are incompatible with inlining, but the value
4099 here could be used only in a diagnostic, for example. */
4105 /* Hook used by expand_expr to expand language-specific tree codes. */
4108 c_expand_expr (tree exp, rtx target, enum machine_mode tmode, int modifier)
4109 /* Actually enum_modifier. */
4111 switch (TREE_CODE (exp))
4117 bool preserve_result = false;
4118 bool return_target = false;
4120 /* Since expand_expr_stmt calls free_temp_slots after every
4121 expression statement, we must call push_temp_slots here.
4122 Otherwise, any temporaries in use now would be considered
4123 out-of-scope after the first EXPR_STMT from within the
4126 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
4128 /* If we want the result of this expression, find the last
4129 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
4130 if (target != const0_rtx
4131 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
4132 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
4134 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
4135 tree last = TREE_CHAIN (expr);
4137 while (TREE_CHAIN (last))
4140 last = TREE_CHAIN (last);
4143 if (TREE_CODE (last) == SCOPE_STMT
4144 && TREE_CODE (expr) == EXPR_STMT)
4146 if (target && TREE_CODE (EXPR_STMT_EXPR (expr)) == VAR_DECL
4147 && DECL_RTL_IF_SET (EXPR_STMT_EXPR (expr)) == target)
4148 /* If the last expression is a variable whose RTL is the
4149 same as our target, just return the target; if it
4150 isn't valid expanding the decl would produce different
4151 RTL, and store_expr would try to do a copy. */
4152 return_target = true;
4155 /* Otherwise, note that we want the value from the last
4157 TREE_ADDRESSABLE (expr) = 1;
4158 preserve_result = true;
4163 expand_stmt (STMT_EXPR_STMT (exp));
4164 expand_end_stmt_expr (rtl_expr);
4166 result = expand_expr (rtl_expr, target, tmode, modifier);
4169 else if (preserve_result && GET_CODE (result) == MEM)
4171 if (GET_MODE (result) != BLKmode)
4172 result = copy_to_reg (result);
4174 preserve_temp_slots (result);
4177 /* If the statment-expression does not have a scope, then the
4178 new temporaries we created within it must live beyond the
4179 statement-expression. */
4180 if (STMT_EXPR_NO_SCOPE (exp))
4181 preserve_temp_slots (NULL_RTX);
4190 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
4191 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4193 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4194 && (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4195 == BUILT_IN_FRONTEND))
4196 return c_expand_builtin (exp, target, tmode, modifier);
4202 case COMPOUND_LITERAL_EXPR:
4204 /* Initialize the anonymous variable declared in the compound
4205 literal, then return the variable. */
4206 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4207 emit_local_var (decl);
4208 return expand_expr (decl, target, tmode, modifier);
4219 /* Hook used by safe_from_p to handle language-specific tree codes. */
4222 c_safe_from_p (rtx target, tree exp)
4224 /* We can see statements here when processing the body of a
4225 statement-expression. For a declaration statement declaring a
4226 variable, look at the variable's initializer. */
4227 if (TREE_CODE (exp) == DECL_STMT)
4229 tree decl = DECL_STMT_DECL (exp);
4231 if (TREE_CODE (decl) == VAR_DECL
4232 && DECL_INITIAL (decl)
4233 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4237 /* For any statement, we must follow the statement-chain. */
4238 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4239 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4241 /* Assume everything else is safe. */
4245 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4248 c_common_unsafe_for_reeval (tree exp)
4250 /* Statement expressions may not be reevaluated, likewise compound
4252 if (TREE_CODE (exp) == STMT_EXPR
4253 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4256 /* Walk all other expressions. */
4260 /* Hook used by staticp to handle language-specific tree codes. */
4263 c_staticp (tree exp)
4265 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4266 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4271 #define CALLED_AS_BUILT_IN(NODE) \
4272 (!strncmp (IDENTIFIER_POINTER (DECL_NAME (NODE)), "__builtin_", 10))
4275 c_expand_builtin (tree exp, rtx target, enum machine_mode tmode,
4276 enum expand_modifier modifier)
4278 tree type = TREE_TYPE (exp);
4279 tree fndecl = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
4280 tree arglist = TREE_OPERAND (exp, 1);
4281 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
4282 enum tree_code code = TREE_CODE (exp);
4283 const int ignore = (target == const0_rtx
4284 || ((code == NON_LVALUE_EXPR || code == NOP_EXPR
4285 || code == CONVERT_EXPR || code == REFERENCE_EXPR
4286 || code == COND_EXPR)
4287 && TREE_CODE (type) == VOID_TYPE));
4289 if (! optimize && ! CALLED_AS_BUILT_IN (fndecl))
4290 return expand_call (exp, target, ignore);
4294 case BUILT_IN_PRINTF:
4295 target = c_expand_builtin_printf (arglist, target, tmode,
4296 modifier, ignore, /*unlocked=*/ 0);
4301 case BUILT_IN_PRINTF_UNLOCKED:
4302 target = c_expand_builtin_printf (arglist, target, tmode,
4303 modifier, ignore, /*unlocked=*/ 1);
4308 case BUILT_IN_FPRINTF:
4309 target = c_expand_builtin_fprintf (arglist, target, tmode,
4310 modifier, ignore, /*unlocked=*/ 0);
4315 case BUILT_IN_FPRINTF_UNLOCKED:
4316 target = c_expand_builtin_fprintf (arglist, target, tmode,
4317 modifier, ignore, /*unlocked=*/ 1);
4322 default: /* just do library call, if unknown builtin */
4323 error ("built-in function `%s' not currently supported",
4324 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
4327 /* The switch statement above can drop through to cause the function
4328 to be called normally. */
4329 return expand_call (exp, target, ignore);
4332 /* Check an arglist to *printf for problems. The arglist should start
4333 at the format specifier, with the remaining arguments immediately
4336 is_valid_printf_arglist (tree arglist)
4338 /* Save this value so we can restore it later. */
4339 const int SAVE_pedantic = pedantic;
4340 int diagnostic_occurred = 0;
4343 /* Set this to a known value so the user setting won't affect code
4346 /* Check to make sure there are no format specifier errors. */
4347 attrs = tree_cons (get_identifier ("format"),
4348 tree_cons (NULL_TREE,
4349 get_identifier ("printf"),
4350 tree_cons (NULL_TREE,
4352 tree_cons (NULL_TREE,
4356 check_function_format (&diagnostic_occurred, attrs, arglist);
4358 /* Restore the value of `pedantic'. */
4359 pedantic = SAVE_pedantic;
4361 /* If calling `check_function_format_ptr' produces a warning, we
4362 return false, otherwise we return true. */
4363 return ! diagnostic_occurred;
4366 /* If the arguments passed to printf are suitable for optimizations,
4367 we attempt to transform the call. */
4369 c_expand_builtin_printf (tree arglist, rtx target, enum machine_mode tmode,
4370 enum expand_modifier modifier, int ignore,
4373 tree fn_putchar = unlocked ?
4374 implicit_built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED] : implicit_built_in_decls[BUILT_IN_PUTCHAR];
4375 tree fn_puts = unlocked ?
4376 implicit_built_in_decls[BUILT_IN_PUTS_UNLOCKED] : implicit_built_in_decls[BUILT_IN_PUTS];
4377 tree fn, format_arg, stripped_string;
4379 /* If the return value is used, or the replacement _DECL isn't
4380 initialized, don't do the transformation. */
4381 if (!ignore || !fn_putchar || !fn_puts)
4384 /* Verify the required arguments in the original call. */
4386 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE))
4389 /* Check the specifier vs. the parameters. */
4390 if (!is_valid_printf_arglist (arglist))
4393 format_arg = TREE_VALUE (arglist);
4394 stripped_string = format_arg;
4395 STRIP_NOPS (stripped_string);
4396 if (stripped_string && TREE_CODE (stripped_string) == ADDR_EXPR)
4397 stripped_string = TREE_OPERAND (stripped_string, 0);
4399 /* If the format specifier isn't a STRING_CST, punt. */
4400 if (TREE_CODE (stripped_string) != STRING_CST)
4403 /* OK! We can attempt optimization. */
4405 /* If the format specifier was "%s\n", call __builtin_puts(arg2). */
4406 if (strcmp (TREE_STRING_POINTER (stripped_string), "%s\n") == 0)
4408 arglist = TREE_CHAIN (arglist);
4411 /* If the format specifier was "%c", call __builtin_putchar (arg2). */
4412 else if (strcmp (TREE_STRING_POINTER (stripped_string), "%c") == 0)
4414 arglist = TREE_CHAIN (arglist);
4419 /* We can't handle anything else with % args or %% ... yet. */
4420 if (strchr (TREE_STRING_POINTER (stripped_string), '%'))
4423 /* If the resulting constant string has a length of 1, call
4424 putchar. Note, TREE_STRING_LENGTH includes the terminating
4425 NULL in its count. */
4426 if (TREE_STRING_LENGTH (stripped_string) == 2)
4428 /* Given printf("c"), (where c is any one character,)
4429 convert "c"[0] to an int and pass that to the replacement
4431 arglist = build_int_2 (TREE_STRING_POINTER (stripped_string)[0], 0);
4432 arglist = build_tree_list (NULL_TREE, arglist);
4436 /* If the resulting constant was "string\n", call
4437 __builtin_puts("string"). Ensure "string" has at least one
4438 character besides the trailing \n. Note, TREE_STRING_LENGTH
4439 includes the terminating NULL in its count. */
4440 else if (TREE_STRING_LENGTH (stripped_string) > 2
4441 && TREE_STRING_POINTER (stripped_string)
4442 [TREE_STRING_LENGTH (stripped_string) - 2] == '\n')
4444 /* Create a NULL-terminated string that's one char shorter
4445 than the original, stripping off the trailing '\n'. */
4446 const int newlen = TREE_STRING_LENGTH (stripped_string) - 1;
4447 char *newstr = (char *) alloca (newlen);
4448 memcpy (newstr, TREE_STRING_POINTER (stripped_string), newlen - 1);
4449 newstr[newlen - 1] = 0;
4451 arglist = fix_string_type (build_string (newlen, newstr));
4452 arglist = build_tree_list (NULL_TREE, arglist);
4456 /* We'd like to arrange to call fputs(string) here, but we
4457 need stdout and don't have a way to get it ... yet. */
4461 return expand_expr (build_function_call (fn, arglist),
4462 (ignore ? const0_rtx : target),
4466 /* If the arguments passed to fprintf are suitable for optimizations,
4467 we attempt to transform the call. */
4469 c_expand_builtin_fprintf (tree arglist, rtx target, enum machine_mode tmode,
4470 enum expand_modifier modifier, int ignore,
4473 tree fn_fputc = unlocked ?
4474 implicit_built_in_decls[BUILT_IN_FPUTC_UNLOCKED] : implicit_built_in_decls[BUILT_IN_FPUTC];
4475 tree fn_fputs = unlocked ?
4476 implicit_built_in_decls[BUILT_IN_FPUTS_UNLOCKED] : implicit_built_in_decls[BUILT_IN_FPUTS];
4477 tree fn, format_arg, stripped_string;
4479 /* If the return value is used, or the replacement _DECL isn't
4480 initialized, don't do the transformation. */
4481 if (!ignore || !fn_fputc || !fn_fputs)
4484 /* Verify the required arguments in the original call. */
4486 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE)
4487 || (TREE_CHAIN (arglist) == 0)
4488 || (TREE_CODE (TREE_TYPE (TREE_VALUE (TREE_CHAIN (arglist)))) !=
4492 /* Check the specifier vs. the parameters. */
4493 if (!is_valid_printf_arglist (TREE_CHAIN (arglist)))
4496 format_arg = TREE_VALUE (TREE_CHAIN (arglist));
4497 stripped_string = format_arg;
4498 STRIP_NOPS (stripped_string);
4499 if (stripped_string && TREE_CODE (stripped_string) == ADDR_EXPR)
4500 stripped_string = TREE_OPERAND (stripped_string, 0);
4502 /* If the format specifier isn't a STRING_CST, punt. */
4503 if (TREE_CODE (stripped_string) != STRING_CST)
4506 /* OK! We can attempt optimization. */
4508 /* If the format specifier was "%s", call __builtin_fputs(arg3, arg1). */
4509 if (strcmp (TREE_STRING_POINTER (stripped_string), "%s") == 0)
4511 tree newarglist = build_tree_list (NULL_TREE, TREE_VALUE (arglist));
4512 arglist = tree_cons (NULL_TREE,
4513 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist))),
4517 /* If the format specifier was "%c", call __builtin_fputc (arg3, arg1). */
4518 else if (strcmp (TREE_STRING_POINTER (stripped_string), "%c") == 0)
4520 tree newarglist = build_tree_list (NULL_TREE, TREE_VALUE (arglist));
4521 arglist = tree_cons (NULL_TREE,
4522 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist))),
4528 /* We can't handle anything else with % args or %% ... yet. */
4529 if (strchr (TREE_STRING_POINTER (stripped_string), '%'))
4532 /* When "string" doesn't contain %, replace all cases of
4533 fprintf(stream,string) with fputs(string,stream). The fputs
4534 builtin will take take of special cases like length==1. */
4535 arglist = tree_cons (NULL_TREE, TREE_VALUE (TREE_CHAIN (arglist)),
4536 build_tree_list (NULL_TREE, TREE_VALUE (arglist)));
4540 return expand_expr (build_function_call (fn, arglist),
4541 (ignore ? const0_rtx : target),
4546 /* Given a boolean expression ARG, return a tree representing an increment
4547 or decrement (as indicated by CODE) of ARG. The front end must check for
4548 invalid cases (e.g., decrement in C++). */
4550 boolean_increment (enum tree_code code, tree arg)
4553 tree true_res = (c_language == clk_cplusplus
4555 : c_bool_true_node);
4556 arg = stabilize_reference (arg);
4559 case PREINCREMENT_EXPR:
4560 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4562 case POSTINCREMENT_EXPR:
4563 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4564 arg = save_expr (arg);
4565 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4566 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4568 case PREDECREMENT_EXPR:
4569 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4571 case POSTDECREMENT_EXPR:
4572 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4573 arg = save_expr (arg);
4574 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4575 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4580 TREE_SIDE_EFFECTS (val) = 1;
4584 /* Built-in macros for stddef.h, that require macros defined in this
4587 c_stddef_cpp_builtins(void)
4589 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4590 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4591 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4592 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4596 c_init_attributes (void)
4598 /* Fill in the built_in_attributes array. */
4599 #define DEF_ATTR_NULL_TREE(ENUM) \
4600 built_in_attributes[(int) ENUM] = NULL_TREE;
4601 #define DEF_ATTR_INT(ENUM, VALUE) \
4602 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4603 #define DEF_ATTR_IDENT(ENUM, STRING) \
4604 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4605 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4606 built_in_attributes[(int) ENUM] \
4607 = tree_cons (built_in_attributes[(int) PURPOSE], \
4608 built_in_attributes[(int) VALUE], \
4609 built_in_attributes[(int) CHAIN]);
4610 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No initialization needed. */
4611 #include "builtin-attrs.def"
4612 #undef DEF_ATTR_NULL_TREE
4614 #undef DEF_ATTR_IDENT
4615 #undef DEF_ATTR_TREE_LIST
4617 c_attrs_initialized = true;
4620 /* Depending on the name of DECL, apply default attributes to it. */
4623 c_common_insert_default_attributes (tree decl)
4625 tree name = DECL_NAME (decl);
4627 if (!c_attrs_initialized)
4628 c_init_attributes ();
4630 #define DEF_ATTR_NULL_TREE(ENUM) /* Nothing needed after initialization. */
4631 #define DEF_ATTR_INT(ENUM, VALUE)
4632 #define DEF_ATTR_IDENT(ENUM, STRING)
4633 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN)
4634 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) \
4635 if ((PREDICATE) && name == built_in_attributes[(int) NAME]) \
4636 decl_attributes (&decl, built_in_attributes[(int) ATTRS], \
4637 ATTR_FLAG_BUILT_IN);
4638 #include "builtin-attrs.def"
4639 #undef DEF_ATTR_NULL_TREE
4641 #undef DEF_ATTR_IDENT
4642 #undef DEF_ATTR_TREE_LIST
4646 /* Output a -Wshadow warning MSGCODE about NAME, and give the location
4647 of the previous declaration DECL. */
4649 shadow_warning (enum sw_kind msgcode, const char *name, tree decl)
4651 static const char *const msgs[] = {
4652 /* SW_PARAM */ N_("declaration of \"%s\" shadows a parameter"),
4653 /* SW_LOCAL */ N_("declaration of \"%s\" shadows a previous local"),
4654 /* SW_GLOBAL */ N_("declaration of \"%s\" shadows a global declaration")
4657 warning (msgs[msgcode], name);
4658 warning ("%Hshadowed declaration is here", &DECL_SOURCE_LOCATION (decl));
4661 /* Attribute handlers common to C front ends. */
4663 /* Handle a "packed" attribute; arguments as in
4664 struct attribute_spec.handler. */
4667 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4668 int flags, _Bool *no_add_attrs)
4673 if (TREE_CODE (*node) == TYPE_DECL)
4674 type = &TREE_TYPE (*node);
4681 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4682 *type = build_type_copy (*type);
4683 TYPE_PACKED (*type) = 1;
4685 else if (TREE_CODE (*node) == FIELD_DECL)
4686 DECL_PACKED (*node) = 1;
4687 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4688 used for DECL_REGISTER. It wouldn't mean anything anyway. */
4691 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4692 *no_add_attrs = true;
4698 /* Handle a "nocommon" attribute; arguments as in
4699 struct attribute_spec.handler. */
4702 handle_nocommon_attribute (tree *node, tree name,
4703 tree args ATTRIBUTE_UNUSED,
4704 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
4706 if (TREE_CODE (*node) == VAR_DECL)
4707 DECL_COMMON (*node) = 0;
4710 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4711 *no_add_attrs = true;
4717 /* Handle a "common" attribute; arguments as in
4718 struct attribute_spec.handler. */
4721 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4722 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
4724 if (TREE_CODE (*node) == VAR_DECL)
4725 DECL_COMMON (*node) = 1;
4728 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4729 *no_add_attrs = true;
4735 /* Handle a "noreturn" attribute; arguments as in
4736 struct attribute_spec.handler. */
4739 handle_noreturn_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 in c_common_attribute_table. */
4745 if (TREE_CODE (*node) == FUNCTION_DECL)
4746 TREE_THIS_VOLATILE (*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),
4752 TREE_READONLY (TREE_TYPE (type)), 1));
4755 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4756 *no_add_attrs = true;
4762 /* Handle a "noinline" attribute; arguments as in
4763 struct attribute_spec.handler. */
4766 handle_noinline_attribute (tree *node, tree name,
4767 tree args ATTRIBUTE_UNUSED,
4768 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
4770 if (TREE_CODE (*node) == FUNCTION_DECL)
4771 DECL_UNINLINABLE (*node) = 1;
4774 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4775 *no_add_attrs = true;
4781 /* Handle a "always_inline" attribute; arguments as in
4782 struct attribute_spec.handler. */
4785 handle_always_inline_attribute (tree *node, tree name,
4786 tree args ATTRIBUTE_UNUSED,
4787 int flags ATTRIBUTE_UNUSED,
4788 _Bool *no_add_attrs)
4790 if (TREE_CODE (*node) == FUNCTION_DECL)
4792 /* Do nothing else, just set the attribute. We'll get at
4793 it later with lookup_attribute. */
4797 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4798 *no_add_attrs = true;
4804 /* Handle a "used" attribute; arguments as in
4805 struct attribute_spec.handler. */
4808 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4809 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
4813 if (TREE_CODE (node) == FUNCTION_DECL
4814 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4815 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (node))
4816 = TREE_USED (node) = 1;
4819 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4820 *no_add_attrs = true;
4826 /* Handle a "unused" attribute; arguments as in
4827 struct attribute_spec.handler. */
4830 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4831 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
4837 if (TREE_CODE (decl) == PARM_DECL
4838 || TREE_CODE (decl) == VAR_DECL
4839 || TREE_CODE (decl) == FUNCTION_DECL
4840 || TREE_CODE (decl) == LABEL_DECL
4841 || TREE_CODE (decl) == TYPE_DECL)
4842 TREE_USED (decl) = 1;
4845 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4846 *no_add_attrs = true;
4851 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4852 *node = build_type_copy (*node);
4853 TREE_USED (*node) = 1;
4859 /* Handle a "const" attribute; arguments as in
4860 struct attribute_spec.handler. */
4863 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4864 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
4866 tree type = TREE_TYPE (*node);
4868 /* See FIXME comment on noreturn in c_common_attribute_table. */
4869 if (TREE_CODE (*node) == FUNCTION_DECL)
4870 TREE_READONLY (*node) = 1;
4871 else if (TREE_CODE (type) == POINTER_TYPE
4872 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4874 = build_pointer_type
4875 (build_type_variant (TREE_TYPE (type), 1,
4876 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4879 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4880 *no_add_attrs = true;
4886 /* Handle a "transparent_union" attribute; arguments as in
4887 struct attribute_spec.handler. */
4890 handle_transparent_union_attribute (tree *node, tree name,
4891 tree args ATTRIBUTE_UNUSED, int flags,
4892 _Bool *no_add_attrs)
4894 tree decl = NULL_TREE;
4901 type = &TREE_TYPE (decl);
4902 is_type = TREE_CODE (*node) == TYPE_DECL;
4904 else if (TYPE_P (*node))
4905 type = node, is_type = 1;
4908 && TREE_CODE (*type) == UNION_TYPE
4910 || (TYPE_FIELDS (*type) != 0
4911 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4913 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4914 *type = build_type_copy (*type);
4915 TYPE_TRANSPARENT_UNION (*type) = 1;
4917 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4918 && TREE_CODE (*type) == UNION_TYPE
4919 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4920 DECL_TRANSPARENT_UNION (decl) = 1;
4923 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4924 *no_add_attrs = true;
4930 /* Handle a "constructor" attribute; arguments as in
4931 struct attribute_spec.handler. */
4934 handle_constructor_attribute (tree *node, tree name,
4935 tree args ATTRIBUTE_UNUSED,
4936 int flags ATTRIBUTE_UNUSED,
4937 _Bool *no_add_attrs)
4940 tree type = TREE_TYPE (decl);
4942 if (TREE_CODE (decl) == FUNCTION_DECL
4943 && TREE_CODE (type) == FUNCTION_TYPE
4944 && decl_function_context (decl) == 0)
4946 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4947 TREE_USED (decl) = 1;
4951 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4952 *no_add_attrs = true;
4958 /* Handle a "destructor" attribute; arguments as in
4959 struct attribute_spec.handler. */
4962 handle_destructor_attribute (tree *node, tree name,
4963 tree args ATTRIBUTE_UNUSED,
4964 int flags ATTRIBUTE_UNUSED,
4965 _Bool *no_add_attrs)
4968 tree type = TREE_TYPE (decl);
4970 if (TREE_CODE (decl) == FUNCTION_DECL
4971 && TREE_CODE (type) == FUNCTION_TYPE
4972 && decl_function_context (decl) == 0)
4974 DECL_STATIC_DESTRUCTOR (decl) = 1;
4975 TREE_USED (decl) = 1;
4979 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4980 *no_add_attrs = true;
4986 /* Handle a "mode" attribute; arguments as in
4987 struct attribute_spec.handler. */
4990 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4991 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
4995 *no_add_attrs = true;
4997 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4998 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5002 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
5003 int len = strlen (p);
5004 enum machine_mode mode = VOIDmode;
5008 if (len > 4 && p[0] == '_' && p[1] == '_'
5009 && p[len - 1] == '_' && p[len - 2] == '_')
5011 char *newp = (char *) alloca (len - 1);
5013 strcpy (newp, &p[2]);
5014 newp[len - 4] = '\0';
5018 /* Change this type to have a type with the specified mode.
5019 First check for the special modes. */
5020 if (! strcmp (p, "byte"))
5022 else if (!strcmp (p, "word"))
5024 else if (! strcmp (p, "pointer"))
5027 for (j = 0; j < NUM_MACHINE_MODES; j++)
5028 if (!strcmp (p, GET_MODE_NAME (j)))
5029 mode = (enum machine_mode) j;
5031 if (mode == VOIDmode)
5032 error ("unknown machine mode `%s'", p);
5033 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
5034 (mode, TREE_UNSIGNED (type))))
5035 error ("no data type for mode `%s'", p);
5036 else if ((TREE_CODE (type) == POINTER_TYPE
5037 || TREE_CODE (type) == REFERENCE_TYPE)
5038 && !(*targetm.valid_pointer_mode) (mode))
5039 error ("invalid pointer mode `%s'", p);
5042 /* If this is a vector, make sure we either have hardware
5043 support, or we can emulate it. */
5044 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
5046 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5050 if (TREE_CODE (type) == POINTER_TYPE)
5052 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
5056 else if (TREE_CODE (type) == REFERENCE_TYPE)
5058 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
5064 /* No need to layout the type here. The caller should do this. */
5071 /* Handle a "section" attribute; arguments as in
5072 struct attribute_spec.handler. */
5075 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
5076 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
5080 if (targetm.have_named_sections)
5082 if ((TREE_CODE (decl) == FUNCTION_DECL
5083 || TREE_CODE (decl) == VAR_DECL)
5084 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
5086 if (TREE_CODE (decl) == VAR_DECL
5087 && current_function_decl != NULL_TREE
5088 && ! TREE_STATIC (decl))
5090 error_with_decl (decl,
5091 "section attribute cannot be specified for local variables");
5092 *no_add_attrs = true;
5095 /* The decl may have already been given a section attribute
5096 from a previous declaration. Ensure they match. */
5097 else if (DECL_SECTION_NAME (decl) != NULL_TREE
5098 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
5099 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
5101 error_with_decl (*node,
5102 "section of `%s' conflicts with previous declaration");
5103 *no_add_attrs = true;
5106 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
5110 error_with_decl (*node,
5111 "section attribute not allowed for `%s'");
5112 *no_add_attrs = true;
5117 error_with_decl (*node,
5118 "section attributes are not supported for this target");
5119 *no_add_attrs = true;
5125 /* Handle a "aligned" attribute; arguments as in
5126 struct attribute_spec.handler. */
5129 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
5130 int flags, _Bool *no_add_attrs)
5132 tree decl = NULL_TREE;
5135 tree align_expr = (args ? TREE_VALUE (args)
5136 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
5142 type = &TREE_TYPE (decl);
5143 is_type = TREE_CODE (*node) == TYPE_DECL;
5145 else if (TYPE_P (*node))
5146 type = node, is_type = 1;
5148 /* Strip any NOPs of any kind. */
5149 while (TREE_CODE (align_expr) == NOP_EXPR
5150 || TREE_CODE (align_expr) == CONVERT_EXPR
5151 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
5152 align_expr = TREE_OPERAND (align_expr, 0);
5154 if (TREE_CODE (align_expr) != INTEGER_CST)
5156 error ("requested alignment is not a constant");
5157 *no_add_attrs = true;
5159 else if ((i = tree_log2 (align_expr)) == -1)
5161 error ("requested alignment is not a power of 2");
5162 *no_add_attrs = true;
5164 else if (i > HOST_BITS_PER_INT - 2)
5166 error ("requested alignment is too large");
5167 *no_add_attrs = true;
5171 /* If we have a TYPE_DECL, then copy the type, so that we
5172 don't accidentally modify a builtin type. See pushdecl. */
5173 if (decl && TREE_TYPE (decl) != error_mark_node
5174 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
5176 tree tt = TREE_TYPE (decl);
5177 *type = build_type_copy (*type);
5178 DECL_ORIGINAL_TYPE (decl) = tt;
5179 TYPE_NAME (*type) = decl;
5180 TREE_USED (*type) = TREE_USED (decl);
5181 TREE_TYPE (decl) = *type;
5183 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5184 *type = build_type_copy (*type);
5186 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
5187 TYPE_USER_ALIGN (*type) = 1;
5189 else if (TREE_CODE (decl) != VAR_DECL
5190 && TREE_CODE (decl) != FIELD_DECL)
5192 error_with_decl (decl,
5193 "alignment may not be specified for `%s'");
5194 *no_add_attrs = true;
5198 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
5199 DECL_USER_ALIGN (decl) = 1;
5205 /* Handle a "weak" attribute; arguments as in
5206 struct attribute_spec.handler. */
5209 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5210 tree args ATTRIBUTE_UNUSED,
5211 int flags ATTRIBUTE_UNUSED,
5212 _Bool *no_add_attrs ATTRIBUTE_UNUSED)
5214 declare_weak (*node);
5219 /* Handle an "alias" attribute; arguments as in
5220 struct attribute_spec.handler. */
5223 handle_alias_attribute (tree *node, tree name, tree args,
5224 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
5228 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
5229 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
5231 error_with_decl (decl,
5232 "`%s' defined both normally and as an alias");
5233 *no_add_attrs = true;
5235 else if (decl_function_context (decl) == 0)
5239 id = TREE_VALUE (args);
5240 if (TREE_CODE (id) != STRING_CST)
5242 error ("alias arg not a string");
5243 *no_add_attrs = true;
5246 id = get_identifier (TREE_STRING_POINTER (id));
5247 /* This counts as a use of the object pointed to. */
5250 if (TREE_CODE (decl) == FUNCTION_DECL)
5251 DECL_INITIAL (decl) = error_mark_node;
5253 DECL_EXTERNAL (decl) = 0;
5257 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5258 *no_add_attrs = true;
5264 /* Handle an "visibility" attribute; arguments as in
5265 struct attribute_spec.handler. */
5268 handle_visibility_attribute (tree *node, tree name, tree args,
5269 int flags ATTRIBUTE_UNUSED,
5270 _Bool *no_add_attrs)
5274 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
5276 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5277 *no_add_attrs = true;
5283 id = TREE_VALUE (args);
5284 if (TREE_CODE (id) != STRING_CST)
5286 error ("visibility arg not a string");
5287 *no_add_attrs = true;
5290 if (strcmp (TREE_STRING_POINTER (id), "hidden")
5291 && strcmp (TREE_STRING_POINTER (id), "protected")
5292 && strcmp (TREE_STRING_POINTER (id), "internal")
5293 && strcmp (TREE_STRING_POINTER (id), "default"))
5295 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5296 *no_add_attrs = true;
5304 /* Handle an "tls_model" attribute; arguments as in
5305 struct attribute_spec.handler. */
5308 handle_tls_model_attribute (tree *node, tree name, tree args,
5309 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
5313 if (! DECL_THREAD_LOCAL (decl))
5315 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5316 *no_add_attrs = true;
5322 id = TREE_VALUE (args);
5323 if (TREE_CODE (id) != STRING_CST)
5325 error ("tls_model arg not a string");
5326 *no_add_attrs = true;
5329 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
5330 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
5331 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
5332 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
5334 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5335 *no_add_attrs = true;
5343 /* Handle a "no_instrument_function" attribute; arguments as in
5344 struct attribute_spec.handler. */
5347 handle_no_instrument_function_attribute (tree *node, tree name,
5348 tree args ATTRIBUTE_UNUSED,
5349 int flags ATTRIBUTE_UNUSED,
5350 _Bool *no_add_attrs)
5354 if (TREE_CODE (decl) != FUNCTION_DECL)
5356 error_with_decl (decl,
5357 "`%s' attribute applies only to functions",
5358 IDENTIFIER_POINTER (name));
5359 *no_add_attrs = true;
5361 else if (DECL_INITIAL (decl))
5363 error_with_decl (decl,
5364 "can't set `%s' attribute after definition",
5365 IDENTIFIER_POINTER (name));
5366 *no_add_attrs = true;
5369 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5374 /* Handle a "malloc" attribute; arguments as in
5375 struct attribute_spec.handler. */
5378 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5379 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
5381 if (TREE_CODE (*node) == FUNCTION_DECL)
5382 DECL_IS_MALLOC (*node) = 1;
5383 /* ??? TODO: Support types. */
5386 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5387 *no_add_attrs = true;
5393 /* Handle a "no_limit_stack" attribute; arguments as in
5394 struct attribute_spec.handler. */
5397 handle_no_limit_stack_attribute (tree *node, tree name,
5398 tree args ATTRIBUTE_UNUSED,
5399 int flags ATTRIBUTE_UNUSED,
5400 _Bool *no_add_attrs)
5404 if (TREE_CODE (decl) != FUNCTION_DECL)
5406 error_with_decl (decl,
5407 "`%s' attribute applies only to functions",
5408 IDENTIFIER_POINTER (name));
5409 *no_add_attrs = true;
5411 else if (DECL_INITIAL (decl))
5413 error_with_decl (decl,
5414 "can't set `%s' attribute after definition",
5415 IDENTIFIER_POINTER (name));
5416 *no_add_attrs = true;
5419 DECL_NO_LIMIT_STACK (decl) = 1;
5424 /* Handle a "pure" attribute; arguments as in
5425 struct attribute_spec.handler. */
5428 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5429 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
5431 if (TREE_CODE (*node) == FUNCTION_DECL)
5432 DECL_IS_PURE (*node) = 1;
5433 /* ??? TODO: Support types. */
5436 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5437 *no_add_attrs = true;
5443 /* Handle a "deprecated" attribute; arguments as in
5444 struct attribute_spec.handler. */
5447 handle_deprecated_attribute (tree *node, tree name,
5448 tree args ATTRIBUTE_UNUSED, int flags,
5449 _Bool *no_add_attrs)
5451 tree type = NULL_TREE;
5453 const char *what = NULL;
5458 type = TREE_TYPE (decl);
5460 if (TREE_CODE (decl) == TYPE_DECL
5461 || TREE_CODE (decl) == PARM_DECL
5462 || TREE_CODE (decl) == VAR_DECL
5463 || TREE_CODE (decl) == FUNCTION_DECL
5464 || TREE_CODE (decl) == FIELD_DECL)
5465 TREE_DEPRECATED (decl) = 1;
5469 else if (TYPE_P (*node))
5471 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5472 *node = build_type_copy (*node);
5473 TREE_DEPRECATED (*node) = 1;
5481 *no_add_attrs = true;
5482 if (type && TYPE_NAME (type))
5484 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5485 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5486 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5487 && DECL_NAME (TYPE_NAME (type)))
5488 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5491 warning ("`%s' attribute ignored for `%s'",
5492 IDENTIFIER_POINTER (name), what);
5494 warning ("`%s' attribute ignored",
5495 IDENTIFIER_POINTER (name));
5501 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5502 to prevent us from duplicating type nodes unnecessarily.
5503 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5504 since we want to distinguish types that are essentially identical (except
5505 for their debug representation), we use a local list here. */
5506 static GTY(()) tree vector_type_node_list = 0;
5508 /* Handle a "vector_size" attribute; arguments as in
5509 struct attribute_spec.handler. */
5512 handle_vector_size_attribute (tree *node, tree name, tree args,
5513 int flags ATTRIBUTE_UNUSED,
5514 _Bool *no_add_attrs)
5516 unsigned HOST_WIDE_INT vecsize, nunits;
5517 enum machine_mode mode, orig_mode, new_mode;
5518 tree type = *node, new_type = NULL_TREE;
5519 tree type_list_node;
5521 *no_add_attrs = true;
5523 if (! host_integerp (TREE_VALUE (args), 1))
5525 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5529 /* Get the vector size (in bytes). */
5530 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5532 /* We need to provide for vector pointers, vector arrays, and
5533 functions returning vectors. For example:
5535 __attribute__((vector_size(16))) short *foo;
5537 In this case, the mode is SI, but the type being modified is
5538 HI, so we need to look further. */
5540 while (POINTER_TYPE_P (type)
5541 || TREE_CODE (type) == FUNCTION_TYPE
5542 || TREE_CODE (type) == ARRAY_TYPE)
5543 type = TREE_TYPE (type);
5545 /* Get the mode of the type being modified. */
5546 orig_mode = TYPE_MODE (type);
5548 if (TREE_CODE (type) == RECORD_TYPE
5549 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5550 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5551 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5553 error ("invalid vector type for attribute `%s'",
5554 IDENTIFIER_POINTER (name));
5558 /* Calculate how many units fit in the vector. */
5559 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5561 /* Find a suitably sized vector. */
5562 new_mode = VOIDmode;
5563 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5565 : MODE_VECTOR_FLOAT);
5567 mode = GET_MODE_WIDER_MODE (mode))
5568 if (vecsize == GET_MODE_SIZE (mode)
5569 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5575 if (new_mode == VOIDmode)
5577 error ("no vector mode with the size and type specified could be found");
5581 for (type_list_node = vector_type_node_list; type_list_node;
5582 type_list_node = TREE_CHAIN (type_list_node))
5584 tree other_type = TREE_VALUE (type_list_node);
5585 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5586 tree fields = TYPE_FIELDS (record);
5587 tree field_type = TREE_TYPE (fields);
5588 tree array_type = TREE_TYPE (field_type);
5589 if (TREE_CODE (fields) != FIELD_DECL
5590 || TREE_CODE (field_type) != ARRAY_TYPE)
5593 if (TYPE_MODE (other_type) == mode && type == array_type)
5595 new_type = other_type;
5600 if (new_type == NULL_TREE)
5602 tree index, array, rt, list_node;
5604 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5605 TREE_UNSIGNED (type));
5609 error ("no vector mode with the size and type specified could be found");
5613 new_type = build_type_copy (new_type);
5615 /* If this is a vector, make sure we either have hardware
5616 support, or we can emulate it. */
5617 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5618 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5619 && !vector_mode_valid_p (mode))
5621 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5625 /* Set the debug information here, because this is the only
5626 place where we know the underlying type for a vector made
5627 with vector_size. For debugging purposes we pretend a vector
5628 is an array within a structure. */
5629 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5630 array = build_array_type (type, build_index_type (index));
5631 rt = make_node (RECORD_TYPE);
5633 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5634 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5636 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5638 list_node = build_tree_list (NULL, new_type);
5639 TREE_CHAIN (list_node) = vector_type_node_list;
5640 vector_type_node_list = list_node;
5643 /* Build back pointers if needed. */
5644 *node = vector_size_helper (*node, new_type);
5649 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5652 If we requested a pointer to a vector, build up the pointers that
5653 we stripped off while looking for the inner type. Similarly for
5654 return values from functions.
5656 The argument "type" is the top of the chain, and "bottom" is the
5657 new type which we will point to. */
5660 vector_size_helper (tree type, tree bottom)
5664 if (POINTER_TYPE_P (type))
5666 inner = vector_size_helper (TREE_TYPE (type), bottom);
5667 outer = build_pointer_type (inner);
5669 else if (TREE_CODE (type) == ARRAY_TYPE)
5671 inner = vector_size_helper (TREE_TYPE (type), bottom);
5672 outer = build_array_type (inner, TYPE_VALUES (type));
5674 else if (TREE_CODE (type) == FUNCTION_TYPE)
5676 inner = vector_size_helper (TREE_TYPE (type), bottom);
5677 outer = build_function_type (inner, TYPE_VALUES (type));
5682 TREE_READONLY (outer) = TREE_READONLY (type);
5683 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5688 /* Handle the "nonnull" attribute. */
5690 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5691 tree args, int flags ATTRIBUTE_UNUSED,
5692 _Bool *no_add_attrs)
5695 unsigned HOST_WIDE_INT attr_arg_num;
5697 /* If no arguments are specified, all pointer arguments should be
5698 non-null. Verify a full prototype is given so that the arguments
5699 will have the correct types when we actually check them later. */
5702 if (! TYPE_ARG_TYPES (type))
5704 error ("nonnull attribute without arguments on a non-prototype");
5705 *no_add_attrs = true;
5710 /* Argument list specified. Verify that each argument number references
5711 a pointer argument. */
5712 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5715 unsigned HOST_WIDE_INT arg_num, ck_num;
5717 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5719 error ("nonnull argument has invalid operand number (arg %lu)",
5720 (unsigned long) attr_arg_num);
5721 *no_add_attrs = true;
5725 argument = TYPE_ARG_TYPES (type);
5728 for (ck_num = 1; ; ck_num++)
5730 if (! argument || ck_num == arg_num)
5732 argument = TREE_CHAIN (argument);
5736 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5738 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5739 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5740 *no_add_attrs = true;
5744 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5746 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5747 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5748 *no_add_attrs = true;
5757 /* Check the argument list of a function call for null in argument slots
5758 that are marked as requiring a non-null pointer argument. */
5761 check_function_nonnull (tree attrs, tree params)
5763 tree a, args, param;
5766 for (a = attrs; a; a = TREE_CHAIN (a))
5768 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5770 args = TREE_VALUE (a);
5772 /* Walk the argument list. If we encounter an argument number we
5773 should check for non-null, do it. If the attribute has no args,
5774 then every pointer argument is checked (in which case the check
5775 for pointer type is done in check_nonnull_arg). */
5776 for (param = params, param_num = 1; ;
5777 param_num++, param = TREE_CHAIN (param))
5781 if (! args || nonnull_check_p (args, param_num))
5782 check_function_arguments_recurse (check_nonnull_arg, NULL,
5790 /* Helper for check_function_nonnull; given a list of operands which
5791 must be non-null in ARGS, determine if operand PARAM_NUM should be
5795 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5797 unsigned HOST_WIDE_INT arg_num;
5799 for (; args; args = TREE_CHAIN (args))
5801 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5804 if (arg_num == param_num)
5810 /* Check that the function argument PARAM (which is operand number
5811 PARAM_NUM) is non-null. This is called by check_function_nonnull
5812 via check_function_arguments_recurse. */
5815 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5816 unsigned HOST_WIDE_INT param_num)
5818 /* Just skip checking the argument if it's not a pointer. This can
5819 happen if the "nonnull" attribute was given without an operand
5820 list (which means to check every pointer argument). */
5822 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5825 if (integer_zerop (param))
5826 warning ("null argument where non-null required (arg %lu)",
5827 (unsigned long) param_num);
5830 /* Helper for nonnull attribute handling; fetch the operand number
5831 from the attribute argument list. */
5834 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5836 /* Strip any conversions from the arg number and verify they
5838 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5839 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5840 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5841 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5843 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5844 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5847 *valp = TREE_INT_CST_LOW (arg_num_expr);
5851 /* Handle a "nothrow" attribute; arguments as in
5852 struct attribute_spec.handler. */
5855 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5856 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
5858 if (TREE_CODE (*node) == FUNCTION_DECL)
5859 TREE_NOTHROW (*node) = 1;
5860 /* ??? TODO: Support types. */
5863 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5864 *no_add_attrs = true;
5870 /* Handle a "cleanup" attribute; arguments as in
5871 struct attribute_spec.handler. */
5874 handle_cleanup_attribute (tree *node, tree name, tree args,
5875 int flags ATTRIBUTE_UNUSED, _Bool *no_add_attrs)
5878 tree cleanup_id, cleanup_decl;
5880 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5881 for global destructors in C++. This requires infrastructure that
5882 we don't have generically at the moment. It's also not a feature
5883 we'd be missing too much, since we do have attribute constructor. */
5884 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5886 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5887 *no_add_attrs = true;
5891 /* Verify that the argument is a function in scope. */
5892 /* ??? We could support pointers to functions here as well, if
5893 that was considered desirable. */
5894 cleanup_id = TREE_VALUE (args);
5895 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5897 error ("cleanup arg not an identifier");
5898 *no_add_attrs = true;
5901 cleanup_decl = lookup_name (cleanup_id);
5902 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5904 error ("cleanup arg not a function");
5905 *no_add_attrs = true;
5909 /* That the function has proper type is checked with the
5910 eventual call to build_function_call. */
5915 /* Check for valid arguments being passed to a function. */
5917 check_function_arguments (tree attrs, tree params)
5919 /* Check for null being passed in a pointer argument that must be
5920 non-null. We also need to do this if format checking is enabled. */
5923 check_function_nonnull (attrs, params);
5925 /* Check for errors in format strings. */
5928 check_function_format (NULL, attrs, params);
5931 /* Generic argument checking recursion routine. PARAM is the argument to
5932 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5933 once the argument is resolved. CTX is context for the callback. */
5935 check_function_arguments_recurse (void (*callback)
5936 (void *, tree, unsigned HOST_WIDE_INT),
5937 void *ctx, tree param,
5938 unsigned HOST_WIDE_INT param_num)
5940 if (TREE_CODE (param) == NOP_EXPR)
5942 /* Strip coercion. */
5943 check_function_arguments_recurse (callback, ctx,
5944 TREE_OPERAND (param, 0), param_num);
5948 if (TREE_CODE (param) == CALL_EXPR)
5950 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5952 bool found_format_arg = false;
5954 /* See if this is a call to a known internationalization function
5955 that modifies a format arg. Such a function may have multiple
5956 format_arg attributes (for example, ngettext). */
5958 for (attrs = TYPE_ATTRIBUTES (type);
5960 attrs = TREE_CHAIN (attrs))
5961 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5964 tree format_num_expr;
5968 /* Extract the argument number, which was previously checked
5970 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5971 while (TREE_CODE (format_num_expr) == NOP_EXPR
5972 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5973 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5974 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5976 if (TREE_CODE (format_num_expr) != INTEGER_CST
5977 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5980 format_num = TREE_INT_CST_LOW (format_num_expr);
5982 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5984 inner_args = TREE_CHAIN (inner_args), i++)
5985 if (i == format_num)
5987 check_function_arguments_recurse (callback, ctx,
5988 TREE_VALUE (inner_args),
5990 found_format_arg = true;
5995 /* If we found a format_arg attribute and did a recursive check,
5996 we are done with checking this argument. Otherwise, we continue
5997 and this will be considered a non-literal. */
5998 if (found_format_arg)
6002 if (TREE_CODE (param) == COND_EXPR)
6004 /* Check both halves of the conditional expression. */
6005 check_function_arguments_recurse (callback, ctx,
6006 TREE_OPERAND (param, 1), param_num);
6007 check_function_arguments_recurse (callback, ctx,
6008 TREE_OPERAND (param, 2), param_num);
6012 (*callback) (ctx, param, param_num);
6015 #include "gt-c-common.h"