1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
36 #include "diagnostic.h"
41 #include "langhooks.h"
42 #include "tree-inline.h"
46 cpp_reader *parse_in; /* Declared in c-pragma.h. */
48 /* We let tm.h override the types used here, to handle trivial differences
49 such as the choice of unsigned int or long unsigned int for size_t.
50 When machines start needing nontrivial differences in the size type,
51 it would be best to do something here to figure out automatically
52 from other information what type to use. */
55 #define SIZE_TYPE "long unsigned int"
59 #define WCHAR_TYPE "int"
62 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
63 #define MODIFIED_WCHAR_TYPE \
64 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
67 #define PTRDIFF_TYPE "long int"
71 #define WINT_TYPE "unsigned int"
75 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
77 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
83 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
85 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
86 ? "long unsigned int" \
87 : "long long unsigned int"))
90 /* The following symbols are subsumed in the c_global_trees array, and
91 listed here individually for documentation purposes.
93 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
95 tree short_integer_type_node;
96 tree long_integer_type_node;
97 tree long_long_integer_type_node;
99 tree short_unsigned_type_node;
100 tree long_unsigned_type_node;
101 tree long_long_unsigned_type_node;
103 tree truthvalue_type_node;
104 tree truthvalue_false_node;
105 tree truthvalue_true_node;
107 tree ptrdiff_type_node;
109 tree unsigned_char_type_node;
110 tree signed_char_type_node;
111 tree wchar_type_node;
112 tree signed_wchar_type_node;
113 tree unsigned_wchar_type_node;
115 tree float_type_node;
116 tree double_type_node;
117 tree long_double_type_node;
119 tree complex_integer_type_node;
120 tree complex_float_type_node;
121 tree complex_double_type_node;
122 tree complex_long_double_type_node;
124 tree intQI_type_node;
125 tree intHI_type_node;
126 tree intSI_type_node;
127 tree intDI_type_node;
128 tree intTI_type_node;
130 tree unsigned_intQI_type_node;
131 tree unsigned_intHI_type_node;
132 tree unsigned_intSI_type_node;
133 tree unsigned_intDI_type_node;
134 tree unsigned_intTI_type_node;
136 tree widest_integer_literal_type_node;
137 tree widest_unsigned_literal_type_node;
139 Nodes for types `void *' and `const void *'.
141 tree ptr_type_node, const_ptr_type_node;
143 Nodes for types `char *' and `const char *'.
145 tree string_type_node, const_string_type_node;
147 Type `char[SOMENUMBER]'.
148 Used when an array of char is needed and the size is irrelevant.
150 tree char_array_type_node;
152 Type `int[SOMENUMBER]' or something like it.
153 Used when an array of int needed and the size is irrelevant.
155 tree int_array_type_node;
157 Type `wchar_t[SOMENUMBER]' or something like it.
158 Used when a wide string literal is created.
160 tree wchar_array_type_node;
162 Type `int ()' -- used for implicit declaration of functions.
164 tree default_function_type;
166 A VOID_TYPE node, packaged in a TREE_LIST.
170 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
171 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
172 VAR_DECLS, but C++ does.)
174 tree function_name_decl_node;
175 tree pretty_function_name_decl_node;
176 tree c99_function_name_decl_node;
178 Stack of nested function name VAR_DECLs.
180 tree saved_function_name_decls;
184 tree c_global_trees[CTI_MAX];
186 /* TRUE if a code represents a statement. The front end init
187 langhook should take care of initialization of this array. */
189 bool statement_code_p[MAX_TREE_CODES];
191 /* Nonzero if we can read a PCH file now. */
195 /* Switches common to the C front ends. */
197 /* Nonzero if prepreprocessing only. */
199 int flag_preprocess_only;
201 /* Nonzero means don't output line number information. */
203 char flag_no_line_commands;
205 /* Nonzero causes -E output not to be done, but directives such as
206 #define that have side effects are still obeyed. */
210 /* Nonzero means dump macros in some fashion. */
212 char flag_dump_macros;
214 /* Nonzero means pass #include lines through to the output. */
216 char flag_dump_includes;
218 /* The file name to which we should write a precompiled header, or
219 NULL if no header will be written in this compile. */
221 const char *pch_file;
223 /* Nonzero if an ISO standard was selected. It rejects macros in the
227 /* Nonzero if -undef was given. It suppresses target built-in macros
231 /* Nonzero means don't recognize the non-ANSI builtin functions. */
235 /* Nonzero means don't recognize the non-ANSI builtin functions.
238 int flag_no_nonansi_builtin;
240 /* Nonzero means give `double' the same size as `float'. */
242 int flag_short_double;
244 /* Nonzero means give `wchar_t' the same size as `short'. */
246 int flag_short_wchar;
248 /* Nonzero means allow Microsoft extensions without warnings or errors. */
249 int flag_ms_extensions;
251 /* Nonzero means don't recognize the keyword `asm'. */
255 /* Nonzero means give string constants the type `const char *', as mandated
258 int flag_const_strings;
260 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
262 int flag_signed_bitfields = 1;
263 int explicit_flag_signed_bitfields;
265 /* Nonzero means warn about pointer casts that can drop a type qualifier
266 from the pointer target type. */
270 /* Warn about functions which might be candidates for format attributes. */
272 int warn_missing_format_attribute;
274 /* Nonzero means warn about sizeof(function) or addition/subtraction
275 of function pointers. */
277 int warn_pointer_arith;
279 /* Nonzero means warn for any global function def
280 without separate previous prototype decl. */
282 int warn_missing_prototypes;
284 /* Warn if adding () is suggested. */
286 int warn_parentheses;
288 /* Warn if initializer is not completely bracketed. */
290 int warn_missing_braces;
292 /* Warn about comparison of signed and unsigned values.
293 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified
294 (in which case -Wextra gets to decide). */
296 int warn_sign_compare = -1;
298 /* Nonzero means warn about usage of long long when `-pedantic'. */
300 int warn_long_long = 1;
302 /* Nonzero means warn about deprecated conversion from string constant to
305 int warn_write_strings;
307 /* Nonzero means warn about multiple (redundant) decls for the same single
308 variable or function. */
310 int warn_redundant_decls;
312 /* Warn about testing equality of floating point numbers. */
314 int warn_float_equal;
316 /* Warn about a subscript that has type char. */
318 int warn_char_subscripts;
320 /* Warn if a type conversion is done that might have confusing results. */
324 /* Warn about #pragma directives that are not recognized. */
326 int warn_unknown_pragmas; /* Tri state variable. */
328 /* Warn about format/argument anomalies in calls to formatted I/O functions
329 (*printf, *scanf, strftime, strfmon, etc.). */
333 /* Warn about Y2K problems with strftime formats. */
337 /* Warn about excess arguments to formats. */
339 int warn_format_extra_args;
341 /* Warn about zero-length formats. */
343 int warn_format_zero_length;
345 /* Warn about non-literal format arguments. */
347 int warn_format_nonliteral;
349 /* Warn about possible security problems with calls to format functions. */
351 int warn_format_security;
354 /* C/ObjC language option variables. */
357 /* Nonzero means message about use of implicit function declarations;
358 1 means warning; 2 means error. */
360 int mesg_implicit_function_declaration = -1;
362 /* Nonzero means allow type mismatches in conditional expressions;
363 just make their values `void'. */
365 int flag_cond_mismatch;
367 /* Nonzero means enable C89 Amendment 1 features. */
371 /* Nonzero means use the ISO C99 dialect of C. */
375 /* Nonzero means that we have builtin functions, and main is an int */
379 /* Nonzero means add default format_arg attributes for functions not
382 int flag_noniso_default_format_attributes = 1;
384 /* Nonzero means warn when casting a function call to a type that does
385 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
386 when there is no previous declaration of sqrt or malloc. */
388 int warn_bad_function_cast;
390 /* Warn about traditional constructs whose meanings changed in ANSI C. */
392 int warn_traditional;
394 /* Nonzero means warn for a declaration found after a statement. */
396 int warn_declaration_after_statement;
398 /* Nonzero means warn for non-prototype function decls
399 or non-prototyped defs without previous prototype. */
401 int warn_strict_prototypes;
403 /* Nonzero means warn for any global function def
404 without separate previous decl. */
406 int warn_missing_declarations;
408 /* Nonzero means warn about declarations of objects not at
409 file-scope level and about *all* declarations of functions (whether
410 or static) not at file-scope level. Note that we exclude
411 implicit function declarations. To get warnings about those, use
414 int warn_nested_externs;
416 /* Warn if main is suspicious. */
420 /* Nonzero means warn about possible violations of sequence point rules. */
422 int warn_sequence_point;
424 /* Nonzero means to warn about compile-time division by zero. */
425 int warn_div_by_zero = 1;
427 /* Nonzero means warn about use of implicit int. */
429 int warn_implicit_int;
431 /* Warn about NULL being passed to argument slots marked as requiring
437 /* ObjC language option variables. */
440 /* Open and close the file for outputting class declarations, if
443 int flag_gen_declaration;
445 /* Generate code for GNU or NeXT runtime environment. */
447 #ifdef NEXT_OBJC_RUNTIME
448 int flag_next_runtime = 1;
450 int flag_next_runtime = 0;
453 /* Tells the compiler that this is a special run. Do not perform any
454 compiling, instead we are to test some platform dependent features
455 and output a C header file with appropriate definitions. */
457 int print_struct_values;
459 /* ???. Undocumented. */
461 const char *constant_string_class_name;
463 /* Warn if multiple methods are seen for the same selector, but with
464 different argument types. Performs the check on the whole selector
465 table at the end of compilation. */
469 /* Warn if a @selector() is found, and no method with that selector
470 has been previously declared. The check is done on each
471 @selector() as soon as it is found - so it warns about forward
474 int warn_undeclared_selector;
476 /* Warn if methods required by a protocol are not implemented in the
477 class adopting it. When turned off, methods inherited to that
478 class are also considered implemented. */
480 int warn_protocol = 1;
483 /* C++ language option variables. */
486 /* Nonzero means don't recognize any extension keywords. */
488 int flag_no_gnu_keywords;
490 /* Nonzero means do emit exported implementations of functions even if
491 they can be inlined. */
493 int flag_implement_inlines = 1;
495 /* Nonzero means do emit exported implementations of templates, instead of
496 multiple static copies in each file that needs a definition. */
498 int flag_external_templates;
500 /* Nonzero means that the decision to emit or not emit the implementation of a
501 template depends on where the template is instantiated, rather than where
504 int flag_alt_external_templates;
506 /* Nonzero means that implicit instantiations will be emitted if needed. */
508 int flag_implicit_templates = 1;
510 /* Nonzero means that implicit instantiations of inline templates will be
511 emitted if needed, even if instantiations of non-inline templates
514 int flag_implicit_inline_templates = 1;
516 /* Nonzero means generate separate instantiation control files and
517 juggle them at link time. */
519 int flag_use_repository;
521 /* Nonzero if we want to issue diagnostics that the standard says are not
524 int flag_optional_diags = 1;
526 /* Nonzero means we should attempt to elide constructors when possible. */
528 int flag_elide_constructors = 1;
530 /* Nonzero means that member functions defined in class scope are
531 inline by default. */
533 int flag_default_inline = 1;
535 /* Controls whether compiler generates 'type descriptor' that give
536 run-time type information. */
540 /* Nonzero if we want to conserve space in the .o files. We do this
541 by putting uninitialized data and runtime initialized data into
542 .common instead of .data at the expense of not flagging multiple
545 int flag_conserve_space;
547 /* Nonzero if we want to obey access control semantics. */
549 int flag_access_control = 1;
551 /* Nonzero if we want to check the return value of new and avoid calling
552 constructors if it is a null pointer. */
556 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
557 initialization variables.
558 0: Old rules, set by -fno-for-scope.
559 2: New ISO rules, set by -ffor-scope.
560 1: Try to implement new ISO rules, but with backup compatibility
561 (and warnings). This is the default, for now. */
563 int flag_new_for_scope = 1;
565 /* Nonzero if we want to emit defined symbols with common-like linkage as
566 weak symbols where possible, in order to conform to C++ semantics.
567 Otherwise, emit them as local symbols. */
571 /* Nonzero to use __cxa_atexit, rather than atexit, to register
572 destructors for local statics and global objects. */
574 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
576 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
580 /* Nonzero means make the default pedwarns warnings instead of errors.
581 The value of this flag is ignored if -pedantic is specified. */
585 /* Nonzero means to implement standard semantics for exception
586 specifications, calling unexpected if an exception is thrown that
587 doesn't match the specification. Zero means to treat them as
588 assertions and optimize accordingly, but not check them. */
590 int flag_enforce_eh_specs = 1;
592 /* The version of the C++ ABI in use. The following values are
595 0: The version of the ABI believed most conformant with the
596 C++ ABI specification. This ABI may change as bugs are
597 discovered and fixed. Therefore, 0 will not necessarily
598 indicate the same ABI in different versions of G++.
600 1: The version of the ABI first used in G++ 3.2.
602 Additional positive integers will be assigned as new versions of
603 the ABI become the default version of the ABI. */
605 int flag_abi_version = 1;
607 /* Nonzero means warn about things that will change when compiling
608 with an ABI-compliant compiler. */
612 /* Nonzero means warn about invalid uses of offsetof. */
614 int warn_invalid_offsetof = 1;
616 /* Nonzero means warn about implicit declarations. */
618 int warn_implicit = 1;
620 /* Nonzero means warn when all ctors or dtors are private, and the class
623 int warn_ctor_dtor_privacy = 0;
625 /* Nonzero means warn in function declared in derived class has the
626 same name as a virtual in the base class, but fails to match the
627 type signature of any virtual function in the base class. */
629 int warn_overloaded_virtual;
631 /* Nonzero means warn when declaring a class that has a non virtual
632 destructor, when it really ought to have a virtual one. */
636 /* Nonzero means warn when the compiler will reorder code. */
640 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
644 /* Nonzero means warn when we convert a pointer to member function
645 into a pointer to (void or function). */
647 int warn_pmf2ptr = 1;
649 /* Nonzero means warn about violation of some Effective C++ style rules. */
653 /* Nonzero means warn where overload resolution chooses a promotion from
654 unsigned to signed over a conversion to an unsigned of the same size. */
658 /* Nonzero means warn when an old-style cast is used. */
660 int warn_old_style_cast;
662 /* Nonzero means warn when non-templatized friend functions are
663 declared within a template */
665 int warn_nontemplate_friend = 1;
667 /* Nonzero means complain about deprecated features. */
669 int warn_deprecated = 1;
671 /* Maximum template instantiation depth. This limit is rather
672 arbitrary, but it exists to limit the time it takes to notice
673 infinite template instantiations. */
675 int max_tinst_depth = 500;
679 /* The elements of `ridpointers' are identifier nodes for the reserved
680 type names and storage classes. It is indexed by a RID_... value. */
683 tree (*make_fname_decl) (tree, int);
685 /* If non-NULL, the address of a language-specific function that takes
686 any action required right before expand_function_end is called. */
687 void (*lang_expand_function_end) (void);
689 /* Nonzero means the expression being parsed will never be evaluated.
690 This is a count, since unevaluated expressions can nest. */
693 /* Information about how a function name is generated. */
696 tree *const decl; /* pointer to the VAR_DECL. */
697 const unsigned rid; /* RID number for the identifier. */
698 const int pretty; /* How pretty is it? */
701 /* The three ways of getting then name of the current function. */
703 const struct fname_var_t fname_vars[] =
705 /* C99 compliant __func__, must be first. */
706 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
707 /* GCC __FUNCTION__ compliant. */
708 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
709 /* GCC __PRETTY_FUNCTION__ compliant. */
710 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
714 static int constant_fits_type_p (tree, tree);
716 /* Keep a stack of if statements. We record the number of compound
717 statements seen up to the if keyword, as well as the line number
718 and file of the if. If a potentially ambiguous else is seen, that
719 fact is recorded; the warning is issued when we can be sure that
720 the enclosing if statement does not have an else branch. */
729 static if_elt *if_stack;
731 /* Amount of space in the if statement stack. */
732 static int if_stack_space = 0;
735 static int if_stack_pointer = 0;
737 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
738 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
739 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
740 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
741 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
742 static tree handle_always_inline_attribute (tree *, tree, tree, int,
744 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
745 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
746 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
747 static tree handle_transparent_union_attribute (tree *, tree, tree,
749 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
750 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
751 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
752 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
753 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
754 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
755 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
756 static tree handle_visibility_attribute (tree *, tree, tree, int,
758 static tree handle_tls_model_attribute (tree *, tree, tree, int,
760 static tree handle_no_instrument_function_attribute (tree *, tree,
762 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
763 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
765 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
766 static tree handle_deprecated_attribute (tree *, tree, tree, int,
768 static tree handle_vector_size_attribute (tree *, tree, tree, int,
770 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
771 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
772 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
773 static tree vector_size_helper (tree, tree);
775 static void check_function_nonnull (tree, tree);
776 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
777 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
778 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
779 static int resort_field_decl_cmp (const void *, const void *);
781 /* Table of machine-independent attributes common to all C-like languages. */
782 const struct attribute_spec c_common_attribute_table[] =
784 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
785 { "packed", 0, 0, false, false, false,
786 handle_packed_attribute },
787 { "nocommon", 0, 0, true, false, false,
788 handle_nocommon_attribute },
789 { "common", 0, 0, true, false, false,
790 handle_common_attribute },
791 /* FIXME: logically, noreturn attributes should be listed as
792 "false, true, true" and apply to function types. But implementing this
793 would require all the places in the compiler that use TREE_THIS_VOLATILE
794 on a decl to identify non-returning functions to be located and fixed
795 to check the function type instead. */
796 { "noreturn", 0, 0, true, false, false,
797 handle_noreturn_attribute },
798 { "volatile", 0, 0, true, false, false,
799 handle_noreturn_attribute },
800 { "noinline", 0, 0, true, false, false,
801 handle_noinline_attribute },
802 { "always_inline", 0, 0, true, false, false,
803 handle_always_inline_attribute },
804 { "used", 0, 0, true, false, false,
805 handle_used_attribute },
806 { "unused", 0, 0, false, false, false,
807 handle_unused_attribute },
808 /* The same comments as for noreturn attributes apply to const ones. */
809 { "const", 0, 0, true, false, false,
810 handle_const_attribute },
811 { "transparent_union", 0, 0, false, false, false,
812 handle_transparent_union_attribute },
813 { "constructor", 0, 0, true, false, false,
814 handle_constructor_attribute },
815 { "destructor", 0, 0, true, false, false,
816 handle_destructor_attribute },
817 { "mode", 1, 1, false, true, false,
818 handle_mode_attribute },
819 { "section", 1, 1, true, false, false,
820 handle_section_attribute },
821 { "aligned", 0, 1, false, false, false,
822 handle_aligned_attribute },
823 { "weak", 0, 0, true, false, false,
824 handle_weak_attribute },
825 { "alias", 1, 1, true, false, false,
826 handle_alias_attribute },
827 { "no_instrument_function", 0, 0, true, false, false,
828 handle_no_instrument_function_attribute },
829 { "malloc", 0, 0, true, false, false,
830 handle_malloc_attribute },
831 { "no_stack_limit", 0, 0, true, false, false,
832 handle_no_limit_stack_attribute },
833 { "pure", 0, 0, true, false, false,
834 handle_pure_attribute },
835 { "deprecated", 0, 0, false, false, false,
836 handle_deprecated_attribute },
837 { "vector_size", 1, 1, false, true, false,
838 handle_vector_size_attribute },
839 { "visibility", 1, 1, true, false, false,
840 handle_visibility_attribute },
841 { "tls_model", 1, 1, true, false, false,
842 handle_tls_model_attribute },
843 { "nonnull", 0, -1, false, true, true,
844 handle_nonnull_attribute },
845 { "nothrow", 0, 0, true, false, false,
846 handle_nothrow_attribute },
847 { "may_alias", 0, 0, false, true, false, NULL },
848 { "cleanup", 1, 1, true, false, false,
849 handle_cleanup_attribute },
850 { NULL, 0, 0, false, false, false, NULL }
853 /* Give the specifications for the format attributes, used by C and all
856 const struct attribute_spec c_common_format_attribute_table[] =
858 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
859 { "format", 3, 3, false, true, true,
860 handle_format_attribute },
861 { "format_arg", 1, 1, false, true, true,
862 handle_format_arg_attribute },
863 { NULL, 0, 0, false, false, false, NULL }
866 /* Record the start of an if-then, and record the start of it
867 for ambiguous else detection.
869 COND is the condition for the if-then statement.
871 IF_STMT is the statement node that has already been created for
872 this if-then statement. It is created before parsing the
873 condition to keep line number information accurate. */
876 c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
878 /* Make sure there is enough space on the stack. */
879 if (if_stack_space == 0)
882 if_stack = xmalloc (10 * sizeof (if_elt));
884 else if (if_stack_space == if_stack_pointer)
886 if_stack_space += 10;
887 if_stack = xrealloc (if_stack, if_stack_space * sizeof (if_elt));
890 IF_COND (if_stmt) = cond;
893 /* Record this if statement. */
894 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
895 if_stack[if_stack_pointer].locus = input_location;
896 if_stack[if_stack_pointer].needs_warning = 0;
897 if_stack[if_stack_pointer].if_stmt = if_stmt;
901 /* Called after the then-clause for an if-statement is processed. */
906 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
907 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
910 /* Record the end of an if-then. Optionally warn if a nested
911 if statement had an ambiguous else clause. */
914 c_expand_end_cond (void)
917 if (if_stack[if_stack_pointer].needs_warning)
918 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
919 &if_stack[if_stack_pointer].locus);
920 last_expr_type = NULL_TREE;
923 /* Called between the then-clause and the else-clause
924 of an if-then-else. */
927 c_expand_start_else (void)
929 /* An ambiguous else warning must be generated for the enclosing if
930 statement, unless we see an else branch for that one, too. */
932 && if_stack_pointer > 1
933 && (if_stack[if_stack_pointer - 1].compstmt_count
934 == if_stack[if_stack_pointer - 2].compstmt_count))
935 if_stack[if_stack_pointer - 2].needs_warning = 1;
937 /* Even if a nested if statement had an else branch, it can't be
938 ambiguous if this one also has an else. So don't warn in that
939 case. Also don't warn for any if statements nested in this else. */
940 if_stack[if_stack_pointer - 1].needs_warning = 0;
941 if_stack[if_stack_pointer - 1].compstmt_count--;
944 /* Called after the else-clause for an if-statement is processed. */
949 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
950 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
953 /* Begin an if-statement. Returns a newly created IF_STMT if
956 Unlike the C++ front-end, we do not call add_stmt here; it is
957 probably safe to do so, but I am not very familiar with this
958 code so I am being extra careful not to change its behavior
959 beyond what is strictly necessary for correctness. */
962 c_begin_if_stmt (void)
965 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
969 /* Begin a while statement. Returns a newly created WHILE_STMT if
972 Unlike the C++ front-end, we do not call add_stmt here; it is
973 probably safe to do so, but I am not very familiar with this
974 code so I am being extra careful not to change its behavior
975 beyond what is strictly necessary for correctness. */
978 c_begin_while_stmt (void)
981 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
986 c_finish_while_stmt_cond (tree cond, tree while_stmt)
988 WHILE_COND (while_stmt) = cond;
991 /* Push current bindings for the function name VAR_DECLS. */
994 start_fname_decls (void)
997 tree saved = NULL_TREE;
999 for (ix = 0; fname_vars[ix].decl; ix++)
1001 tree decl = *fname_vars[ix].decl;
1005 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
1006 *fname_vars[ix].decl = NULL_TREE;
1009 if (saved || saved_function_name_decls)
1010 /* Normally they'll have been NULL, so only push if we've got a
1011 stack, or they are non-NULL. */
1012 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1013 saved_function_name_decls);
1016 /* Finish up the current bindings, adding them into the
1017 current function's statement tree. This is done by wrapping the
1018 function's body in a COMPOUND_STMT containing these decls too. This
1019 must be done _before_ finish_stmt_tree is called. If there is no
1020 current function, we must be at file scope and no statements are
1021 involved. Pop the previous bindings. */
1024 finish_fname_decls (void)
1027 tree body = NULL_TREE;
1028 tree stack = saved_function_name_decls;
1030 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1031 body = chainon (TREE_VALUE (stack), body);
1035 /* They were called into existence, so add to statement tree. Add
1036 the DECL_STMTs inside the outermost scope. */
1037 tree *p = &DECL_SAVED_TREE (current_function_decl);
1038 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1039 while (TREE_CODE (*p) != COMPOUND_STMT)
1040 p = &TREE_CHAIN (*p);
1041 p = &COMPOUND_BODY (*p);
1042 if (TREE_CODE (*p) == SCOPE_STMT)
1043 p = &TREE_CHAIN (*p);
1045 body = chainon (body, *p);
1049 for (ix = 0; fname_vars[ix].decl; ix++)
1050 *fname_vars[ix].decl = NULL_TREE;
1054 /* We had saved values, restore them. */
1057 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1059 tree decl = TREE_PURPOSE (saved);
1060 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1062 *fname_vars[ix].decl = decl;
1064 stack = TREE_CHAIN (stack);
1066 saved_function_name_decls = stack;
1069 /* Return the text name of the current function, suitably prettified
1073 fname_as_string (int pretty_p)
1075 const char *name = NULL;
1078 name = (current_function_decl
1079 ? (*lang_hooks.decl_printable_name) (current_function_decl, 2)
1081 else if (current_function_decl && DECL_NAME (current_function_decl))
1082 name = IDENTIFIER_POINTER (DECL_NAME (current_function_decl));
1088 /* Return the VAR_DECL for a const char array naming the current
1089 function. If the VAR_DECL has not yet been created, create it
1090 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1091 ID is its name (unfortunately C and C++ hold the RID values of
1092 keywords in different places, so we can't derive RID from ID in
1093 this language independent code. */
1096 fname_decl (unsigned int rid, tree id)
1099 tree decl = NULL_TREE;
1101 for (ix = 0; fname_vars[ix].decl; ix++)
1102 if (fname_vars[ix].rid == rid)
1105 decl = *fname_vars[ix].decl;
1108 tree saved_last_tree = last_tree;
1109 /* If a tree is built here, it would normally have the lineno of
1110 the current statement. Later this tree will be moved to the
1111 beginning of the function and this line number will be wrong.
1112 To avoid this problem set the lineno to 0 here; that prevents
1113 it from appearing in the RTL. */
1114 int saved_lineno = input_line;
1117 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1118 if (last_tree != saved_last_tree)
1120 /* We created some statement tree for the decl. This belongs
1121 at the start of the function, so remove it now and reinsert
1122 it after the function is complete. */
1123 tree stmts = TREE_CHAIN (saved_last_tree);
1125 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1126 last_tree = saved_last_tree;
1127 saved_function_name_decls = tree_cons (decl, stmts,
1128 saved_function_name_decls);
1130 *fname_vars[ix].decl = decl;
1131 input_line = saved_lineno;
1133 if (!ix && !current_function_decl)
1134 pedwarn ("%H'%D' is not defined outside of function scope",
1135 &DECL_SOURCE_LOCATION (decl), decl);
1140 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1143 fix_string_type (tree value)
1145 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1146 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1147 const int nchars_max = flag_isoc99 ? 4095 : 509;
1148 int length = TREE_STRING_LENGTH (value);
1151 /* Compute the number of elements, for the array type. */
1152 nchars = wide_flag ? length / wchar_bytes : length;
1154 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1155 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1156 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1158 /* Create the array type for the string constant.
1159 -Wwrite-strings says make the string constant an array of const char
1160 so that copying it to a non-const pointer will get a warning.
1161 For C++, this is the standard behavior. */
1162 if (flag_const_strings && ! flag_writable_strings)
1165 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1168 = build_array_type (elements,
1169 build_index_type (build_int_2 (nchars - 1, 0)));
1173 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1174 build_index_type (build_int_2 (nchars - 1, 0)));
1176 TREE_CONSTANT (value) = 1;
1177 TREE_READONLY (value) = ! flag_writable_strings;
1178 TREE_STATIC (value) = 1;
1182 /* Print a warning if a constant expression had overflow in folding.
1183 Invoke this function on every expression that the language
1184 requires to be a constant expression.
1185 Note the ANSI C standard says it is erroneous for a
1186 constant expression to overflow. */
1189 constant_expression_warning (tree value)
1191 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1192 || TREE_CODE (value) == VECTOR_CST
1193 || TREE_CODE (value) == COMPLEX_CST)
1194 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1195 pedwarn ("overflow in constant expression");
1198 /* Print a warning if an expression had overflow in folding.
1199 Invoke this function on every expression that
1200 (1) appears in the source code, and
1201 (2) might be a constant expression that overflowed, and
1202 (3) is not already checked by convert_and_check;
1203 however, do not invoke this function on operands of explicit casts. */
1206 overflow_warning (tree value)
1208 if ((TREE_CODE (value) == INTEGER_CST
1209 || (TREE_CODE (value) == COMPLEX_CST
1210 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1211 && TREE_OVERFLOW (value))
1213 TREE_OVERFLOW (value) = 0;
1214 if (skip_evaluation == 0)
1215 warning ("integer overflow in expression");
1217 else if ((TREE_CODE (value) == REAL_CST
1218 || (TREE_CODE (value) == COMPLEX_CST
1219 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1220 && TREE_OVERFLOW (value))
1222 TREE_OVERFLOW (value) = 0;
1223 if (skip_evaluation == 0)
1224 warning ("floating point overflow in expression");
1226 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1228 TREE_OVERFLOW (value) = 0;
1229 if (skip_evaluation == 0)
1230 warning ("vector overflow in expression");
1234 /* Print a warning if a large constant is truncated to unsigned,
1235 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1236 Invoke this function on every expression that might be implicitly
1237 converted to an unsigned type. */
1240 unsigned_conversion_warning (tree result, tree operand)
1242 tree type = TREE_TYPE (result);
1244 if (TREE_CODE (operand) == INTEGER_CST
1245 && TREE_CODE (type) == INTEGER_TYPE
1246 && TREE_UNSIGNED (type)
1247 && skip_evaluation == 0
1248 && !int_fits_type_p (operand, type))
1250 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1251 /* This detects cases like converting -129 or 256 to unsigned char. */
1252 warning ("large integer implicitly truncated to unsigned type");
1253 else if (warn_conversion)
1254 warning ("negative integer implicitly converted to unsigned type");
1258 /* Nonzero if constant C has a value that is permissible
1259 for type TYPE (an INTEGER_TYPE). */
1262 constant_fits_type_p (tree c, tree type)
1264 if (TREE_CODE (c) == INTEGER_CST)
1265 return int_fits_type_p (c, type);
1267 c = convert (type, c);
1268 return !TREE_OVERFLOW (c);
1271 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1272 Invoke this function on every expression that is converted implicitly,
1273 i.e. because of language rules and not because of an explicit cast. */
1276 convert_and_check (tree type, tree expr)
1278 tree t = convert (type, expr);
1279 if (TREE_CODE (t) == INTEGER_CST)
1281 if (TREE_OVERFLOW (t))
1283 TREE_OVERFLOW (t) = 0;
1285 /* Do not diagnose overflow in a constant expression merely
1286 because a conversion overflowed. */
1287 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1289 /* No warning for converting 0x80000000 to int. */
1290 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1291 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1292 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1293 /* If EXPR fits in the unsigned version of TYPE,
1294 don't warn unless pedantic. */
1296 || TREE_UNSIGNED (type)
1297 || ! constant_fits_type_p (expr,
1298 c_common_unsigned_type (type)))
1299 && skip_evaluation == 0)
1300 warning ("overflow in implicit constant conversion");
1303 unsigned_conversion_warning (t, expr);
1308 /* A node in a list that describes references to variables (EXPR), which are
1309 either read accesses if WRITER is zero, or write accesses, in which case
1310 WRITER is the parent of EXPR. */
1317 /* Used to implement a cache the results of a call to verify_tree. We only
1318 use this for SAVE_EXPRs. */
1321 struct tlist_cache *next;
1322 struct tlist *cache_before_sp;
1323 struct tlist *cache_after_sp;
1327 /* Obstack to use when allocating tlist structures, and corresponding
1329 static struct obstack tlist_obstack;
1330 static char *tlist_firstobj = 0;
1332 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1334 static struct tlist *warned_ids;
1335 /* SAVE_EXPRs need special treatment. We process them only once and then
1336 cache the results. */
1337 static struct tlist_cache *save_expr_cache;
1339 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1340 static void merge_tlist (struct tlist **, struct tlist *, int);
1341 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1342 static int warning_candidate_p (tree);
1343 static void warn_for_collisions (struct tlist *);
1344 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1345 static struct tlist *new_tlist (struct tlist *, tree, tree);
1346 static void verify_sequence_points (tree);
1348 /* Create a new struct tlist and fill in its fields. */
1349 static struct tlist *
1350 new_tlist (struct tlist *next, tree t, tree writer)
1353 l = obstack_alloc (&tlist_obstack, sizeof *l);
1360 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1361 is nonnull, we ignore any node we find which has a writer equal to it. */
1364 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1368 struct tlist *next = add->next;
1371 if (! exclude_writer || add->writer != exclude_writer)
1372 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1377 /* Merge the nodes of ADD into TO. This merging process is done so that for
1378 each variable that already exists in TO, no new node is added; however if
1379 there is a write access recorded in ADD, and an occurrence on TO is only
1380 a read access, then the occurrence in TO will be modified to record the
1384 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1386 struct tlist **end = to;
1389 end = &(*end)->next;
1395 struct tlist *next = add->next;
1397 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1398 if (tmp2->expr == add->expr)
1402 tmp2->writer = add->writer;
1406 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1407 end = &(*end)->next;
1414 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1415 references in list LIST conflict with it, excluding reads if ONLY writers
1419 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1424 /* Avoid duplicate warnings. */
1425 for (tmp = warned_ids; tmp; tmp = tmp->next)
1426 if (tmp->expr == written)
1431 if (list->expr == written
1432 && list->writer != writer
1433 && (! only_writes || list->writer))
1435 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1436 warning ("operation on `%s' may be undefined",
1437 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1443 /* Given a list LIST of references to variables, find whether any of these
1444 can cause conflicts due to missing sequence points. */
1447 warn_for_collisions (struct tlist *list)
1451 for (tmp = list; tmp; tmp = tmp->next)
1454 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1458 /* Return nonzero if X is a tree that can be verified by the sequence point
1461 warning_candidate_p (tree x)
1463 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1466 /* Walk the tree X, and record accesses to variables. If X is written by the
1467 parent tree, WRITER is the parent.
1468 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1469 expression or its only operand forces a sequence point, then everything up
1470 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1472 Once we return, we will have emitted warnings if any subexpression before
1473 such a sequence point could be undefined. On a higher level, however, the
1474 sequence point may not be relevant, and we'll merge the two lists.
1476 Example: (b++, a) + b;
1477 The call that processes the COMPOUND_EXPR will store the increment of B
1478 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1479 processes the PLUS_EXPR will need to merge the two lists so that
1480 eventually, all accesses end up on the same list (and we'll warn about the
1481 unordered subexpressions b++ and b.
1483 A note on merging. If we modify the former example so that our expression
1486 care must be taken not simply to add all three expressions into the final
1487 PNO_SP list. The function merge_tlist takes care of that by merging the
1488 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1489 way, so that no more than one access to B is recorded. */
1492 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1495 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1496 enum tree_code code;
1499 /* X may be NULL if it is the operand of an empty statement expression
1505 code = TREE_CODE (x);
1506 class = TREE_CODE_CLASS (code);
1508 if (warning_candidate_p (x))
1510 *pno_sp = new_tlist (*pno_sp, x, writer);
1520 case TRUTH_ANDIF_EXPR:
1521 case TRUTH_ORIF_EXPR:
1522 tmp_before = tmp_nosp = tmp_list3 = 0;
1523 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1524 warn_for_collisions (tmp_nosp);
1525 merge_tlist (pbefore_sp, tmp_before, 0);
1526 merge_tlist (pbefore_sp, tmp_nosp, 0);
1527 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1528 merge_tlist (pbefore_sp, tmp_list3, 0);
1532 tmp_before = tmp_list2 = 0;
1533 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1534 warn_for_collisions (tmp_list2);
1535 merge_tlist (pbefore_sp, tmp_before, 0);
1536 merge_tlist (pbefore_sp, tmp_list2, 1);
1538 tmp_list3 = tmp_nosp = 0;
1539 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1540 warn_for_collisions (tmp_nosp);
1541 merge_tlist (pbefore_sp, tmp_list3, 0);
1543 tmp_list3 = tmp_list2 = 0;
1544 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1545 warn_for_collisions (tmp_list2);
1546 merge_tlist (pbefore_sp, tmp_list3, 0);
1547 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1548 two first, to avoid warning for (a ? b++ : b++). */
1549 merge_tlist (&tmp_nosp, tmp_list2, 0);
1550 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1553 case PREDECREMENT_EXPR:
1554 case PREINCREMENT_EXPR:
1555 case POSTDECREMENT_EXPR:
1556 case POSTINCREMENT_EXPR:
1557 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1561 tmp_before = tmp_nosp = tmp_list3 = 0;
1562 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1563 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1564 /* Expressions inside the LHS are not ordered wrt. the sequence points
1565 in the RHS. Example:
1567 Despite the fact that the modification of "a" is in the before_sp
1568 list (tmp_before), it conflicts with the use of "a" in the LHS.
1569 We can handle this by adding the contents of tmp_list3
1570 to those of tmp_before, and redoing the collision warnings for that
1572 add_tlist (&tmp_before, tmp_list3, x, 1);
1573 warn_for_collisions (tmp_before);
1574 /* Exclude the LHS itself here; we first have to merge it into the
1575 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1576 didn't exclude the LHS, we'd get it twice, once as a read and once
1578 add_tlist (pno_sp, tmp_list3, x, 0);
1579 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1581 merge_tlist (pbefore_sp, tmp_before, 0);
1582 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1583 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1584 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1588 /* We need to warn about conflicts among arguments and conflicts between
1589 args and the function address. Side effects of the function address,
1590 however, are not ordered by the sequence point of the call. */
1591 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1592 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1593 if (TREE_OPERAND (x, 1))
1594 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1595 merge_tlist (&tmp_list3, tmp_list2, 0);
1596 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1597 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1598 warn_for_collisions (tmp_before);
1599 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1603 /* Scan all the list, e.g. indices of multi dimensional array. */
1606 tmp_before = tmp_nosp = 0;
1607 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1608 merge_tlist (&tmp_nosp, tmp_before, 0);
1609 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1616 struct tlist_cache *t;
1617 for (t = save_expr_cache; t; t = t->next)
1623 t = obstack_alloc (&tlist_obstack, sizeof *t);
1624 t->next = save_expr_cache;
1626 save_expr_cache = t;
1628 tmp_before = tmp_nosp = 0;
1629 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1630 warn_for_collisions (tmp_nosp);
1635 struct tlist *t = tmp_nosp;
1637 merge_tlist (&tmp_list3, t, 0);
1639 t->cache_before_sp = tmp_before;
1640 t->cache_after_sp = tmp_list3;
1642 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1643 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1652 if (first_rtl_op (code) == 0)
1654 x = TREE_OPERAND (x, 0);
1670 int max = first_rtl_op (TREE_CODE (x));
1671 for (lp = 0; lp < max; lp++)
1673 tmp_before = tmp_nosp = 0;
1674 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1675 merge_tlist (&tmp_nosp, tmp_before, 0);
1676 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1683 /* Try to warn for undefined behavior in EXPR due to missing sequence
1687 verify_sequence_points (tree expr)
1689 struct tlist *before_sp = 0, *after_sp = 0;
1692 save_expr_cache = 0;
1693 if (tlist_firstobj == 0)
1695 gcc_obstack_init (&tlist_obstack);
1696 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1699 verify_tree (expr, &before_sp, &after_sp, 0);
1700 warn_for_collisions (after_sp);
1701 obstack_free (&tlist_obstack, tlist_firstobj);
1705 c_expand_expr_stmt (tree expr)
1707 /* Do default conversion if safe and possibly important,
1708 in case within ({...}). */
1709 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1710 && (flag_isoc99 || lvalue_p (expr)))
1711 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1712 expr = default_conversion (expr);
1714 if (warn_sequence_point)
1715 verify_sequence_points (expr);
1717 if (TREE_TYPE (expr) != error_mark_node
1718 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1719 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1720 error ("expression statement has incomplete type");
1722 last_expr_type = TREE_TYPE (expr);
1723 return add_stmt (build_stmt (EXPR_STMT, expr));
1726 /* Validate the expression after `case' and apply default promotions. */
1729 check_case_value (tree value)
1731 if (value == NULL_TREE)
1734 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1735 STRIP_TYPE_NOPS (value);
1736 /* In C++, the following is allowed:
1739 switch (...) { case i: ... }
1741 So, we try to reduce the VALUE to a constant that way. */
1742 if (c_dialect_cxx ())
1744 value = decl_constant_value (value);
1745 STRIP_TYPE_NOPS (value);
1746 value = fold (value);
1749 if (TREE_CODE (value) != INTEGER_CST
1750 && value != error_mark_node)
1752 error ("case label does not reduce to an integer constant");
1753 value = error_mark_node;
1756 /* Promote char or short to int. */
1757 value = default_conversion (value);
1759 constant_expression_warning (value);
1764 /* Return an integer type with BITS bits of precision,
1765 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1768 c_common_type_for_size (unsigned int bits, int unsignedp)
1770 if (bits == TYPE_PRECISION (integer_type_node))
1771 return unsignedp ? unsigned_type_node : integer_type_node;
1773 if (bits == TYPE_PRECISION (signed_char_type_node))
1774 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1776 if (bits == TYPE_PRECISION (short_integer_type_node))
1777 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1779 if (bits == TYPE_PRECISION (long_integer_type_node))
1780 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1782 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1783 return (unsignedp ? long_long_unsigned_type_node
1784 : long_long_integer_type_node);
1786 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1787 return (unsignedp ? widest_unsigned_literal_type_node
1788 : widest_integer_literal_type_node);
1790 if (bits <= TYPE_PRECISION (intQI_type_node))
1791 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1793 if (bits <= TYPE_PRECISION (intHI_type_node))
1794 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1796 if (bits <= TYPE_PRECISION (intSI_type_node))
1797 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1799 if (bits <= TYPE_PRECISION (intDI_type_node))
1800 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1805 /* Return a data type that has machine mode MODE.
1806 If the mode is an integer,
1807 then UNSIGNEDP selects between signed and unsigned types. */
1810 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1812 if (mode == TYPE_MODE (integer_type_node))
1813 return unsignedp ? unsigned_type_node : integer_type_node;
1815 if (mode == TYPE_MODE (signed_char_type_node))
1816 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1818 if (mode == TYPE_MODE (short_integer_type_node))
1819 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1821 if (mode == TYPE_MODE (long_integer_type_node))
1822 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1824 if (mode == TYPE_MODE (long_long_integer_type_node))
1825 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1827 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1828 return unsignedp ? widest_unsigned_literal_type_node
1829 : widest_integer_literal_type_node;
1832 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1835 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1838 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1841 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1843 #if HOST_BITS_PER_WIDE_INT >= 64
1844 if (mode == TYPE_MODE (intTI_type_node))
1845 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1848 if (mode == TYPE_MODE (float_type_node))
1849 return float_type_node;
1851 if (mode == TYPE_MODE (double_type_node))
1852 return double_type_node;
1854 if (mode == TYPE_MODE (long_double_type_node))
1855 return long_double_type_node;
1857 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1858 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1860 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1861 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1866 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1868 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1870 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
1872 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
1874 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
1876 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
1878 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
1880 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
1882 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
1884 return V16SF_type_node;
1886 return V4SF_type_node;
1888 return V2SF_type_node;
1890 return V2DF_type_node;
1892 return V4DF_type_node;
1900 /* Return an unsigned type the same as TYPE in other respects. */
1902 c_common_unsigned_type (tree type)
1904 tree type1 = TYPE_MAIN_VARIANT (type);
1905 if (type1 == signed_char_type_node || type1 == char_type_node)
1906 return unsigned_char_type_node;
1907 if (type1 == integer_type_node)
1908 return unsigned_type_node;
1909 if (type1 == short_integer_type_node)
1910 return short_unsigned_type_node;
1911 if (type1 == long_integer_type_node)
1912 return long_unsigned_type_node;
1913 if (type1 == long_long_integer_type_node)
1914 return long_long_unsigned_type_node;
1915 if (type1 == widest_integer_literal_type_node)
1916 return widest_unsigned_literal_type_node;
1917 #if HOST_BITS_PER_WIDE_INT >= 64
1918 if (type1 == intTI_type_node)
1919 return unsigned_intTI_type_node;
1921 if (type1 == intDI_type_node)
1922 return unsigned_intDI_type_node;
1923 if (type1 == intSI_type_node)
1924 return unsigned_intSI_type_node;
1925 if (type1 == intHI_type_node)
1926 return unsigned_intHI_type_node;
1927 if (type1 == intQI_type_node)
1928 return unsigned_intQI_type_node;
1930 return c_common_signed_or_unsigned_type (1, type);
1933 /* Return a signed type the same as TYPE in other respects. */
1936 c_common_signed_type (tree type)
1938 tree type1 = TYPE_MAIN_VARIANT (type);
1939 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1940 return signed_char_type_node;
1941 if (type1 == unsigned_type_node)
1942 return integer_type_node;
1943 if (type1 == short_unsigned_type_node)
1944 return short_integer_type_node;
1945 if (type1 == long_unsigned_type_node)
1946 return long_integer_type_node;
1947 if (type1 == long_long_unsigned_type_node)
1948 return long_long_integer_type_node;
1949 if (type1 == widest_unsigned_literal_type_node)
1950 return widest_integer_literal_type_node;
1951 #if HOST_BITS_PER_WIDE_INT >= 64
1952 if (type1 == unsigned_intTI_type_node)
1953 return intTI_type_node;
1955 if (type1 == unsigned_intDI_type_node)
1956 return intDI_type_node;
1957 if (type1 == unsigned_intSI_type_node)
1958 return intSI_type_node;
1959 if (type1 == unsigned_intHI_type_node)
1960 return intHI_type_node;
1961 if (type1 == unsigned_intQI_type_node)
1962 return intQI_type_node;
1964 return c_common_signed_or_unsigned_type (0, type);
1967 /* Return a type the same as TYPE except unsigned or
1968 signed according to UNSIGNEDP. */
1971 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1973 if (! INTEGRAL_TYPE_P (type)
1974 || TREE_UNSIGNED (type) == unsignedp)
1977 if (TYPE_PRECISION (type) == TYPE_PRECISION (signed_char_type_node))
1978 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1979 if (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1980 return unsignedp ? unsigned_type_node : integer_type_node;
1981 if (TYPE_PRECISION (type) == TYPE_PRECISION (short_integer_type_node))
1982 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1983 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_integer_type_node))
1984 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1985 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_long_integer_type_node))
1986 return (unsignedp ? long_long_unsigned_type_node
1987 : long_long_integer_type_node);
1988 if (TYPE_PRECISION (type) == TYPE_PRECISION (widest_integer_literal_type_node))
1989 return (unsignedp ? widest_unsigned_literal_type_node
1990 : widest_integer_literal_type_node);
1992 #if HOST_BITS_PER_WIDE_INT >= 64
1993 if (TYPE_PRECISION (type) == TYPE_PRECISION (intTI_type_node))
1994 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1996 if (TYPE_PRECISION (type) == TYPE_PRECISION (intDI_type_node))
1997 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1998 if (TYPE_PRECISION (type) == TYPE_PRECISION (intSI_type_node))
1999 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2000 if (TYPE_PRECISION (type) == TYPE_PRECISION (intHI_type_node))
2001 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2002 if (TYPE_PRECISION (type) == TYPE_PRECISION (intQI_type_node))
2003 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2008 /* Return the minimum number of bits needed to represent VALUE in a
2009 signed or unsigned type, UNSIGNEDP says which. */
2012 min_precision (tree value, int unsignedp)
2016 /* If the value is negative, compute its negative minus 1. The latter
2017 adjustment is because the absolute value of the largest negative value
2018 is one larger than the largest positive value. This is equivalent to
2019 a bit-wise negation, so use that operation instead. */
2021 if (tree_int_cst_sgn (value) < 0)
2022 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2024 /* Return the number of bits needed, taking into account the fact
2025 that we need one more bit for a signed than unsigned type. */
2027 if (integer_zerop (value))
2030 log = tree_floor_log2 (value);
2032 return log + 1 + ! unsignedp;
2035 /* Print an error message for invalid operands to arith operation
2036 CODE. NOP_EXPR is used as a special case (see
2037 c_common_truthvalue_conversion). */
2040 binary_op_error (enum tree_code code)
2047 error ("invalid truth-value expression");
2051 opname = "+"; break;
2053 opname = "-"; break;
2055 opname = "*"; break;
2057 opname = "max"; break;
2059 opname = "min"; break;
2061 opname = "=="; break;
2063 opname = "!="; break;
2065 opname = "<="; break;
2067 opname = ">="; break;
2069 opname = "<"; break;
2071 opname = ">"; break;
2073 opname = "<<"; break;
2075 opname = ">>"; break;
2076 case TRUNC_MOD_EXPR:
2077 case FLOOR_MOD_EXPR:
2078 opname = "%"; break;
2079 case TRUNC_DIV_EXPR:
2080 case FLOOR_DIV_EXPR:
2081 opname = "/"; break;
2083 opname = "&"; break;
2085 opname = "|"; break;
2086 case TRUTH_ANDIF_EXPR:
2087 opname = "&&"; break;
2088 case TRUTH_ORIF_EXPR:
2089 opname = "||"; break;
2091 opname = "^"; break;
2094 opname = "rotate"; break;
2096 opname = "unknown"; break;
2098 error ("invalid operands to binary %s", opname);
2101 /* Subroutine of build_binary_op, used for comparison operations.
2102 See if the operands have both been converted from subword integer types
2103 and, if so, perhaps change them both back to their original type.
2104 This function is also responsible for converting the two operands
2105 to the proper common type for comparison.
2107 The arguments of this function are all pointers to local variables
2108 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2109 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2111 If this function returns nonzero, it means that the comparison has
2112 a constant value. What this function returns is an expression for
2116 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2117 enum tree_code *rescode_ptr)
2120 tree op0 = *op0_ptr;
2121 tree op1 = *op1_ptr;
2122 int unsignedp0, unsignedp1;
2124 tree primop0, primop1;
2125 enum tree_code code = *rescode_ptr;
2127 /* Throw away any conversions to wider types
2128 already present in the operands. */
2130 primop0 = get_narrower (op0, &unsignedp0);
2131 primop1 = get_narrower (op1, &unsignedp1);
2133 /* Handle the case that OP0 does not *contain* a conversion
2134 but it *requires* conversion to FINAL_TYPE. */
2136 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2137 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2138 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2139 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2141 /* If one of the operands must be floated, we cannot optimize. */
2142 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2143 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2145 /* If first arg is constant, swap the args (changing operation
2146 so value is preserved), for canonicalization. Don't do this if
2147 the second arg is 0. */
2149 if (TREE_CONSTANT (primop0)
2150 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2153 int temi = unsignedp0;
2161 unsignedp0 = unsignedp1;
2184 *rescode_ptr = code;
2187 /* If comparing an integer against a constant more bits wide,
2188 maybe we can deduce a value of 1 or 0 independent of the data.
2189 Or else truncate the constant now
2190 rather than extend the variable at run time.
2192 This is only interesting if the constant is the wider arg.
2193 Also, it is not safe if the constant is unsigned and the
2194 variable arg is signed, since in this case the variable
2195 would be sign-extended and then regarded as unsigned.
2196 Our technique fails in this case because the lowest/highest
2197 possible unsigned results don't follow naturally from the
2198 lowest/highest possible values of the variable operand.
2199 For just EQ_EXPR and NE_EXPR there is another technique that
2200 could be used: see if the constant can be faithfully represented
2201 in the other operand's type, by truncating it and reextending it
2202 and see if that preserves the constant's value. */
2204 if (!real1 && !real2
2205 && TREE_CODE (primop1) == INTEGER_CST
2206 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2208 int min_gt, max_gt, min_lt, max_lt;
2209 tree maxval, minval;
2210 /* 1 if comparison is nominally unsigned. */
2211 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2214 type = c_common_signed_or_unsigned_type (unsignedp0,
2215 TREE_TYPE (primop0));
2217 /* If TYPE is an enumeration, then we need to get its min/max
2218 values from it's underlying integral type, not the enumerated
2220 if (TREE_CODE (type) == ENUMERAL_TYPE)
2221 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2223 maxval = TYPE_MAX_VALUE (type);
2224 minval = TYPE_MIN_VALUE (type);
2226 if (unsignedp && !unsignedp0)
2227 *restype_ptr = c_common_signed_type (*restype_ptr);
2229 if (TREE_TYPE (primop1) != *restype_ptr)
2230 primop1 = convert (*restype_ptr, primop1);
2231 if (type != *restype_ptr)
2233 minval = convert (*restype_ptr, minval);
2234 maxval = convert (*restype_ptr, maxval);
2237 if (unsignedp && unsignedp0)
2239 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2240 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2241 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2242 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2246 min_gt = INT_CST_LT (primop1, minval);
2247 max_gt = INT_CST_LT (primop1, maxval);
2248 min_lt = INT_CST_LT (minval, primop1);
2249 max_lt = INT_CST_LT (maxval, primop1);
2253 /* This used to be a switch, but Genix compiler can't handle that. */
2254 if (code == NE_EXPR)
2256 if (max_lt || min_gt)
2257 val = truthvalue_true_node;
2259 else if (code == EQ_EXPR)
2261 if (max_lt || min_gt)
2262 val = truthvalue_false_node;
2264 else if (code == LT_EXPR)
2267 val = truthvalue_true_node;
2269 val = truthvalue_false_node;
2271 else if (code == GT_EXPR)
2274 val = truthvalue_true_node;
2276 val = truthvalue_false_node;
2278 else if (code == LE_EXPR)
2281 val = truthvalue_true_node;
2283 val = truthvalue_false_node;
2285 else if (code == GE_EXPR)
2288 val = truthvalue_true_node;
2290 val = truthvalue_false_node;
2293 /* If primop0 was sign-extended and unsigned comparison specd,
2294 we did a signed comparison above using the signed type bounds.
2295 But the comparison we output must be unsigned.
2297 Also, for inequalities, VAL is no good; but if the signed
2298 comparison had *any* fixed result, it follows that the
2299 unsigned comparison just tests the sign in reverse
2300 (positive values are LE, negative ones GE).
2301 So we can generate an unsigned comparison
2302 against an extreme value of the signed type. */
2304 if (unsignedp && !unsignedp0)
2311 primop1 = TYPE_MIN_VALUE (type);
2317 primop1 = TYPE_MAX_VALUE (type);
2324 type = c_common_unsigned_type (type);
2327 if (TREE_CODE (primop0) != INTEGER_CST)
2329 if (val == truthvalue_false_node)
2330 warning ("comparison is always false due to limited range of data type");
2331 if (val == truthvalue_true_node)
2332 warning ("comparison is always true due to limited range of data type");
2337 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2338 if (TREE_SIDE_EFFECTS (primop0))
2339 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2343 /* Value is not predetermined, but do the comparison
2344 in the type of the operand that is not constant.
2345 TYPE is already properly set. */
2347 else if (real1 && real2
2348 && (TYPE_PRECISION (TREE_TYPE (primop0))
2349 == TYPE_PRECISION (TREE_TYPE (primop1))))
2350 type = TREE_TYPE (primop0);
2352 /* If args' natural types are both narrower than nominal type
2353 and both extend in the same manner, compare them
2354 in the type of the wider arg.
2355 Otherwise must actually extend both to the nominal
2356 common type lest different ways of extending
2358 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2360 else if (unsignedp0 == unsignedp1 && real1 == real2
2361 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2362 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2364 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2365 type = c_common_signed_or_unsigned_type (unsignedp0
2366 || TREE_UNSIGNED (*restype_ptr),
2368 /* Make sure shorter operand is extended the right way
2369 to match the longer operand. */
2371 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2372 TREE_TYPE (primop0)),
2375 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2376 TREE_TYPE (primop1)),
2381 /* Here we must do the comparison on the nominal type
2382 using the args exactly as we received them. */
2383 type = *restype_ptr;
2387 if (!real1 && !real2 && integer_zerop (primop1)
2388 && TREE_UNSIGNED (*restype_ptr))
2394 /* All unsigned values are >= 0, so we warn if extra warnings
2395 are requested. However, if OP0 is a constant that is
2396 >= 0, the signedness of the comparison isn't an issue,
2397 so suppress the warning. */
2398 if (extra_warnings && !in_system_header
2399 && ! (TREE_CODE (primop0) == INTEGER_CST
2400 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2402 warning ("comparison of unsigned expression >= 0 is always true");
2403 value = truthvalue_true_node;
2407 if (extra_warnings && !in_system_header
2408 && ! (TREE_CODE (primop0) == INTEGER_CST
2409 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2411 warning ("comparison of unsigned expression < 0 is always false");
2412 value = truthvalue_false_node;
2421 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2422 if (TREE_SIDE_EFFECTS (primop0))
2423 return build (COMPOUND_EXPR, TREE_TYPE (value),
2430 *op0_ptr = convert (type, primop0);
2431 *op1_ptr = convert (type, primop1);
2433 *restype_ptr = truthvalue_type_node;
2438 /* Return a tree for the sum or difference (RESULTCODE says which)
2439 of pointer PTROP and integer INTOP. */
2442 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2449 /* The result is a pointer of the same type that is being added. */
2451 tree result_type = TREE_TYPE (ptrop);
2453 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2455 if (pedantic || warn_pointer_arith)
2456 pedwarn ("pointer of type `void *' used in arithmetic");
2457 size_exp = integer_one_node;
2459 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2461 if (pedantic || warn_pointer_arith)
2462 pedwarn ("pointer to a function used in arithmetic");
2463 size_exp = integer_one_node;
2465 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2467 if (pedantic || warn_pointer_arith)
2468 pedwarn ("pointer to member function used in arithmetic");
2469 size_exp = integer_one_node;
2471 else if (TREE_CODE (TREE_TYPE (result_type)) == OFFSET_TYPE)
2473 if (pedantic || warn_pointer_arith)
2474 pedwarn ("pointer to a member used in arithmetic");
2475 size_exp = integer_one_node;
2478 size_exp = size_in_bytes (TREE_TYPE (result_type));
2480 /* If what we are about to multiply by the size of the elements
2481 contains a constant term, apply distributive law
2482 and multiply that constant term separately.
2483 This helps produce common subexpressions. */
2485 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2486 && ! TREE_CONSTANT (intop)
2487 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2488 && TREE_CONSTANT (size_exp)
2489 /* If the constant comes from pointer subtraction,
2490 skip this optimization--it would cause an error. */
2491 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2492 /* If the constant is unsigned, and smaller than the pointer size,
2493 then we must skip this optimization. This is because it could cause
2494 an overflow error if the constant is negative but INTOP is not. */
2495 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2496 || (TYPE_PRECISION (TREE_TYPE (intop))
2497 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2499 enum tree_code subcode = resultcode;
2500 tree int_type = TREE_TYPE (intop);
2501 if (TREE_CODE (intop) == MINUS_EXPR)
2502 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2503 /* Convert both subexpression types to the type of intop,
2504 because weird cases involving pointer arithmetic
2505 can result in a sum or difference with different type args. */
2506 ptrop = build_binary_op (subcode, ptrop,
2507 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2508 intop = convert (int_type, TREE_OPERAND (intop, 0));
2511 /* Convert the integer argument to a type the same size as sizetype
2512 so the multiply won't overflow spuriously. */
2514 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2515 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2516 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2517 TREE_UNSIGNED (sizetype)), intop);
2519 /* Replace the integer argument with a suitable product by the object size.
2520 Do this multiplication as signed, then convert to the appropriate
2521 pointer type (actually unsigned integral). */
2523 intop = convert (result_type,
2524 build_binary_op (MULT_EXPR, intop,
2525 convert (TREE_TYPE (intop), size_exp), 1));
2527 /* Create the sum or difference. */
2529 result = build (resultcode, result_type, ptrop, intop);
2531 folded = fold (result);
2532 if (folded == result)
2533 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2537 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2538 or validate its data type for an `if' or `while' statement or ?..: exp.
2540 This preparation consists of taking the ordinary
2541 representation of an expression expr and producing a valid tree
2542 boolean expression describing whether expr is nonzero. We could
2543 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2544 but we optimize comparisons, &&, ||, and !.
2546 The resulting type should always be `truthvalue_type_node'. */
2549 c_common_truthvalue_conversion (tree expr)
2551 if (TREE_CODE (expr) == ERROR_MARK)
2554 #if 0 /* This appears to be wrong for C++. */
2555 /* These really should return error_mark_node after 2.4 is stable.
2556 But not all callers handle ERROR_MARK properly. */
2557 switch (TREE_CODE (TREE_TYPE (expr)))
2560 error ("struct type value used where scalar is required");
2561 return truthvalue_false_node;
2564 error ("union type value used where scalar is required");
2565 return truthvalue_false_node;
2568 error ("array type value used where scalar is required");
2569 return truthvalue_false_node;
2576 switch (TREE_CODE (expr))
2579 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2580 case TRUTH_ANDIF_EXPR:
2581 case TRUTH_ORIF_EXPR:
2582 case TRUTH_AND_EXPR:
2584 case TRUTH_XOR_EXPR:
2585 case TRUTH_NOT_EXPR:
2586 TREE_TYPE (expr) = truthvalue_type_node;
2593 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2596 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2599 /* If we are taking the address of an external decl, it might be zero
2600 if it is weak, so we cannot optimize. */
2601 if (DECL_P (TREE_OPERAND (expr, 0))
2602 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2605 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2606 return build (COMPOUND_EXPR, truthvalue_type_node,
2607 TREE_OPERAND (expr, 0), truthvalue_true_node);
2609 return truthvalue_true_node;
2612 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2613 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2614 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2615 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2623 /* These don't change whether an object is nonzero or zero. */
2624 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2628 /* These don't change whether an object is zero or nonzero, but
2629 we can't ignore them if their second arg has side-effects. */
2630 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2631 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2632 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2634 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2637 /* Distribute the conversion into the arms of a COND_EXPR. */
2638 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2639 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2640 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2643 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2644 since that affects how `default_conversion' will behave. */
2645 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2646 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2648 /* Fall through.... */
2650 /* If this is widening the argument, we can ignore it. */
2651 if (TYPE_PRECISION (TREE_TYPE (expr))
2652 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2653 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2657 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2658 aren't guaranteed to the be same for modes that can represent
2659 infinity, since if x and y are both +infinity, or both
2660 -infinity, then x - y is not a number.
2662 Note that this transformation is safe when x or y is NaN.
2663 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2665 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2667 /* Fall through.... */
2669 /* This and MINUS_EXPR can be changed into a comparison of the
2671 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2672 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2673 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2674 TREE_OPERAND (expr, 1), 1);
2675 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2676 fold (build1 (NOP_EXPR,
2677 TREE_TYPE (TREE_OPERAND (expr, 0)),
2678 TREE_OPERAND (expr, 1))), 1);
2681 if (integer_onep (TREE_OPERAND (expr, 1))
2682 && TREE_TYPE (expr) != truthvalue_type_node)
2683 /* Using convert here would cause infinite recursion. */
2684 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2688 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2689 warning ("suggest parentheses around assignment used as truth value");
2696 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2698 tree t = save_expr (expr);
2699 return (build_binary_op
2700 ((TREE_SIDE_EFFECTS (expr)
2701 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2702 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2703 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2707 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2710 static tree builtin_function_2 (const char *, const char *, tree, tree,
2711 int, enum built_in_class, int, int,
2714 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2715 down to the element type of an array. */
2718 c_build_qualified_type (tree type, int type_quals)
2720 /* A restrict-qualified pointer type must be a pointer to object or
2721 incomplete type. Note that the use of POINTER_TYPE_P also allows
2722 REFERENCE_TYPEs, which is appropriate for C++. Unfortunately,
2723 the C++ front-end also use POINTER_TYPE for pointer-to-member
2724 values, so even though it should be illegal to use `restrict'
2725 with such an entity we don't flag that here. Thus, special case
2726 code for that case is required in the C++ front-end. */
2727 if ((type_quals & TYPE_QUAL_RESTRICT)
2728 && (!POINTER_TYPE_P (type)
2729 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2731 error ("invalid use of `restrict'");
2732 type_quals &= ~TYPE_QUAL_RESTRICT;
2735 if (TREE_CODE (type) == ARRAY_TYPE)
2736 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2738 TYPE_DOMAIN (type));
2739 return build_qualified_type (type, type_quals);
2742 /* Apply the TYPE_QUALS to the new DECL. */
2745 c_apply_type_quals_to_decl (int type_quals, tree decl)
2747 if ((type_quals & TYPE_QUAL_CONST)
2748 || (TREE_TYPE (decl)
2749 && TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE))
2750 TREE_READONLY (decl) = 1;
2751 if (type_quals & TYPE_QUAL_VOLATILE)
2753 TREE_SIDE_EFFECTS (decl) = 1;
2754 TREE_THIS_VOLATILE (decl) = 1;
2756 if (type_quals & TYPE_QUAL_RESTRICT)
2758 if (!TREE_TYPE (decl)
2759 || !POINTER_TYPE_P (TREE_TYPE (decl))
2760 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (TREE_TYPE (decl))))
2761 error ("invalid use of `restrict'");
2762 else if (flag_strict_aliasing)
2763 /* Indicate we need to make a unique alias set for this pointer.
2764 We can't do it here because it might be pointing to an
2766 DECL_POINTER_ALIAS_SET (decl) = -2;
2770 /* Return the typed-based alias set for T, which may be an expression
2771 or a type. Return -1 if we don't do anything special. */
2774 c_common_get_alias_set (tree t)
2778 /* Permit type-punning when accessing a union, provided the access
2779 is directly through the union. For example, this code does not
2780 permit taking the address of a union member and then storing
2781 through it. Even the type-punning allowed here is a GCC
2782 extension, albeit a common and useful one; the C standard says
2783 that such accesses have implementation-defined behavior. */
2785 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2786 u = TREE_OPERAND (u, 0))
2787 if (TREE_CODE (u) == COMPONENT_REF
2788 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2791 /* That's all the expressions we handle specially. */
2795 /* The C standard guarantees that any object may be accessed via an
2796 lvalue that has character type. */
2797 if (t == char_type_node
2798 || t == signed_char_type_node
2799 || t == unsigned_char_type_node)
2802 /* If it has the may_alias attribute, it can alias anything. */
2803 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2806 /* The C standard specifically allows aliasing between signed and
2807 unsigned variants of the same type. We treat the signed
2808 variant as canonical. */
2809 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2811 tree t1 = c_common_signed_type (t);
2813 /* t1 == t can happen for boolean nodes which are always unsigned. */
2815 return get_alias_set (t1);
2817 else if (POINTER_TYPE_P (t))
2821 /* Unfortunately, there is no canonical form of a pointer type.
2822 In particular, if we have `typedef int I', then `int *', and
2823 `I *' are different types. So, we have to pick a canonical
2824 representative. We do this below.
2826 Technically, this approach is actually more conservative that
2827 it needs to be. In particular, `const int *' and `int *'
2828 should be in different alias sets, according to the C and C++
2829 standard, since their types are not the same, and so,
2830 technically, an `int **' and `const int **' cannot point at
2833 But, the standard is wrong. In particular, this code is
2838 const int* const* cipp = &ipp;
2840 And, it doesn't make sense for that to be legal unless you
2841 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2842 the pointed-to types. This issue has been reported to the
2844 t1 = build_type_no_quals (t);
2846 return get_alias_set (t1);
2852 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2853 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2854 flag controls whether we should diagnose possibly ill-formed
2855 constructs or not. */
2857 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2859 const char *op_name;
2861 enum tree_code type_code = TREE_CODE (type);
2863 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2864 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2866 if (type_code == FUNCTION_TYPE)
2868 if (op == SIZEOF_EXPR)
2870 if (complain && (pedantic || warn_pointer_arith))
2871 pedwarn ("invalid application of `sizeof' to a function type");
2872 value = size_one_node;
2875 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2877 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2879 if (type_code == VOID_TYPE
2880 && complain && (pedantic || warn_pointer_arith))
2881 pedwarn ("invalid application of `%s' to a void type", op_name);
2882 value = size_one_node;
2884 else if (!COMPLETE_TYPE_P (type))
2887 error ("invalid application of `%s' to an incomplete type", op_name);
2888 value = size_zero_node;
2892 if (op == SIZEOF_EXPR)
2893 /* Convert in case a char is more than one unit. */
2894 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2895 size_int (TYPE_PRECISION (char_type_node)
2898 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2901 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2902 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2903 never happen. However, this node should really have type
2904 `size_t', which is just a typedef for an ordinary integer type. */
2905 value = fold (build1 (NOP_EXPR, size_type_node, value));
2906 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2911 /* Implement the __alignof keyword: Return the minimum required
2912 alignment of EXPR, measured in bytes. For VAR_DECL's and
2913 FIELD_DECL's return DECL_ALIGN (which can be set from an
2914 "aligned" __attribute__ specification). */
2917 c_alignof_expr (tree expr)
2921 if (TREE_CODE (expr) == VAR_DECL)
2922 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2924 else if (TREE_CODE (expr) == COMPONENT_REF
2925 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2927 error ("`__alignof' applied to a bit-field");
2930 else if (TREE_CODE (expr) == COMPONENT_REF
2931 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2932 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
2934 else if (TREE_CODE (expr) == INDIRECT_REF)
2936 tree t = TREE_OPERAND (expr, 0);
2938 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2940 while (TREE_CODE (t) == NOP_EXPR
2941 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2945 t = TREE_OPERAND (t, 0);
2946 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2947 if (thisalign > bestalign)
2948 best = t, bestalign = thisalign;
2950 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2953 return c_alignof (TREE_TYPE (expr));
2955 return fold (build1 (NOP_EXPR, size_type_node, t));
2958 /* Handle C and C++ default attributes. */
2960 enum built_in_attribute
2962 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2963 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2964 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2965 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2966 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No entry needed in enum. */
2967 #include "builtin-attrs.def"
2968 #undef DEF_ATTR_NULL_TREE
2970 #undef DEF_ATTR_IDENT
2971 #undef DEF_ATTR_TREE_LIST
2976 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
2978 static bool c_attrs_initialized = false;
2980 static void c_init_attributes (void);
2982 /* Build tree nodes and builtin functions common to both C and C++ language
2986 c_common_nodes_and_builtins (void)
2990 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2991 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2992 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2993 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2994 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2995 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2996 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2997 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2998 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2999 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3000 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3001 #include "builtin-types.def"
3002 #undef DEF_PRIMITIVE_TYPE
3003 #undef DEF_FUNCTION_TYPE_0
3004 #undef DEF_FUNCTION_TYPE_1
3005 #undef DEF_FUNCTION_TYPE_2
3006 #undef DEF_FUNCTION_TYPE_3
3007 #undef DEF_FUNCTION_TYPE_4
3008 #undef DEF_FUNCTION_TYPE_VAR_0
3009 #undef DEF_FUNCTION_TYPE_VAR_1
3010 #undef DEF_FUNCTION_TYPE_VAR_2
3011 #undef DEF_FUNCTION_TYPE_VAR_3
3012 #undef DEF_POINTER_TYPE
3016 typedef enum builtin_type builtin_type;
3018 tree builtin_types[(int) BT_LAST];
3019 int wchar_type_size;
3020 tree array_domain_type;
3021 tree va_list_ref_type_node;
3022 tree va_list_arg_type_node;
3024 /* Define `int' and `char' first so that dbx will output them first. */
3025 record_builtin_type (RID_INT, NULL, integer_type_node);
3026 record_builtin_type (RID_CHAR, "char", char_type_node);
3028 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3029 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3030 but not C. Are the conditionals here needed? */
3031 if (c_dialect_cxx ())
3032 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3033 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3034 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3035 record_builtin_type (RID_MAX, "long unsigned int",
3036 long_unsigned_type_node);
3037 if (c_dialect_cxx ())
3038 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3039 record_builtin_type (RID_MAX, "long long int",
3040 long_long_integer_type_node);
3041 record_builtin_type (RID_MAX, "long long unsigned int",
3042 long_long_unsigned_type_node);
3043 if (c_dialect_cxx ())
3044 record_builtin_type (RID_MAX, "long long unsigned",
3045 long_long_unsigned_type_node);
3046 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3047 record_builtin_type (RID_MAX, "short unsigned int",
3048 short_unsigned_type_node);
3049 if (c_dialect_cxx ())
3050 record_builtin_type (RID_MAX, "unsigned short",
3051 short_unsigned_type_node);
3053 /* Define both `signed char' and `unsigned char'. */
3054 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3055 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3057 /* These are types that c_common_type_for_size and
3058 c_common_type_for_mode use. */
3059 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3061 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3063 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3065 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3067 #if HOST_BITS_PER_WIDE_INT >= 64
3068 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3069 get_identifier ("__int128_t"),
3072 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3073 unsigned_intQI_type_node));
3074 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3075 unsigned_intHI_type_node));
3076 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3077 unsigned_intSI_type_node));
3078 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3079 unsigned_intDI_type_node));
3080 #if HOST_BITS_PER_WIDE_INT >= 64
3081 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3082 get_identifier ("__uint128_t"),
3083 unsigned_intTI_type_node));
3086 /* Create the widest literal types. */
3087 widest_integer_literal_type_node
3088 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3089 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3090 widest_integer_literal_type_node));
3092 widest_unsigned_literal_type_node
3093 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3094 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3095 widest_unsigned_literal_type_node));
3097 /* `unsigned long' is the standard type for sizeof.
3098 Note that stddef.h uses `unsigned long',
3099 and this must agree, even if long and int are the same size. */
3101 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3102 signed_size_type_node = c_common_signed_type (size_type_node);
3103 set_sizetype (size_type_node);
3105 build_common_tree_nodes_2 (flag_short_double);
3107 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3108 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3109 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3111 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3112 get_identifier ("complex int"),
3113 complex_integer_type_node));
3114 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3115 get_identifier ("complex float"),
3116 complex_float_type_node));
3117 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3118 get_identifier ("complex double"),
3119 complex_double_type_node));
3120 (*lang_hooks.decls.pushdecl)
3121 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3122 complex_long_double_type_node));
3124 /* Types which are common to the fortran compiler and libf2c. When
3125 changing these, you also need to be concerned with f/com.h. */
3127 if (TYPE_PRECISION (float_type_node)
3128 == TYPE_PRECISION (long_integer_type_node))
3130 g77_integer_type_node = long_integer_type_node;
3131 g77_uinteger_type_node = long_unsigned_type_node;
3133 else if (TYPE_PRECISION (float_type_node)
3134 == TYPE_PRECISION (integer_type_node))
3136 g77_integer_type_node = integer_type_node;
3137 g77_uinteger_type_node = unsigned_type_node;
3140 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3142 if (g77_integer_type_node != NULL_TREE)
3144 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3145 get_identifier ("__g77_integer"),
3146 g77_integer_type_node));
3147 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3148 get_identifier ("__g77_uinteger"),
3149 g77_uinteger_type_node));
3152 if (TYPE_PRECISION (float_type_node) * 2
3153 == TYPE_PRECISION (long_integer_type_node))
3155 g77_longint_type_node = long_integer_type_node;
3156 g77_ulongint_type_node = long_unsigned_type_node;
3158 else if (TYPE_PRECISION (float_type_node) * 2
3159 == TYPE_PRECISION (long_long_integer_type_node))
3161 g77_longint_type_node = long_long_integer_type_node;
3162 g77_ulongint_type_node = long_long_unsigned_type_node;
3165 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3167 if (g77_longint_type_node != NULL_TREE)
3169 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3170 get_identifier ("__g77_longint"),
3171 g77_longint_type_node));
3172 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3173 get_identifier ("__g77_ulongint"),
3174 g77_ulongint_type_node));
3177 record_builtin_type (RID_VOID, NULL, void_type_node);
3179 void_zero_node = build_int_2 (0, 0);
3180 TREE_TYPE (void_zero_node) = void_type_node;
3182 void_list_node = build_void_list_node ();
3184 /* Make a type to be the domain of a few array types
3185 whose domains don't really matter.
3186 200 is small enough that it always fits in size_t
3187 and large enough that it can hold most function names for the
3188 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3189 array_domain_type = build_index_type (size_int (200));
3191 /* Make a type for arrays of characters.
3192 With luck nothing will ever really depend on the length of this
3194 char_array_type_node
3195 = build_array_type (char_type_node, array_domain_type);
3197 /* Likewise for arrays of ints. */
3199 = build_array_type (integer_type_node, array_domain_type);
3201 string_type_node = build_pointer_type (char_type_node);
3202 const_string_type_node
3203 = build_pointer_type (build_qualified_type
3204 (char_type_node, TYPE_QUAL_CONST));
3206 /* This is special for C++ so functions can be overloaded. */
3207 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3208 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3209 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3210 if (c_dialect_cxx ())
3212 if (TREE_UNSIGNED (wchar_type_node))
3213 wchar_type_node = make_unsigned_type (wchar_type_size);
3215 wchar_type_node = make_signed_type (wchar_type_size);
3216 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3220 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3221 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3224 /* This is for wide string constants. */
3225 wchar_array_type_node
3226 = build_array_type (wchar_type_node, array_domain_type);
3229 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3232 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3234 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3236 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3238 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3239 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3241 (*lang_hooks.decls.pushdecl)
3242 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3243 va_list_type_node));
3245 (*lang_hooks.decls.pushdecl)
3246 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3247 ptrdiff_type_node));
3249 (*lang_hooks.decls.pushdecl)
3250 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3253 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3255 va_list_arg_type_node = va_list_ref_type_node =
3256 build_pointer_type (TREE_TYPE (va_list_type_node));
3260 va_list_arg_type_node = va_list_type_node;
3261 va_list_ref_type_node = build_reference_type (va_list_type_node);
3264 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3265 builtin_types[(int) ENUM] = VALUE;
3266 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3267 builtin_types[(int) ENUM] \
3268 = build_function_type (builtin_types[(int) RETURN], \
3270 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3271 builtin_types[(int) ENUM] \
3272 = build_function_type (builtin_types[(int) RETURN], \
3273 tree_cons (NULL_TREE, \
3274 builtin_types[(int) ARG1], \
3276 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3277 builtin_types[(int) ENUM] \
3278 = build_function_type \
3279 (builtin_types[(int) RETURN], \
3280 tree_cons (NULL_TREE, \
3281 builtin_types[(int) ARG1], \
3282 tree_cons (NULL_TREE, \
3283 builtin_types[(int) ARG2], \
3285 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3286 builtin_types[(int) ENUM] \
3287 = build_function_type \
3288 (builtin_types[(int) RETURN], \
3289 tree_cons (NULL_TREE, \
3290 builtin_types[(int) ARG1], \
3291 tree_cons (NULL_TREE, \
3292 builtin_types[(int) ARG2], \
3293 tree_cons (NULL_TREE, \
3294 builtin_types[(int) ARG3], \
3296 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3297 builtin_types[(int) ENUM] \
3298 = build_function_type \
3299 (builtin_types[(int) RETURN], \
3300 tree_cons (NULL_TREE, \
3301 builtin_types[(int) ARG1], \
3302 tree_cons (NULL_TREE, \
3303 builtin_types[(int) ARG2], \
3306 builtin_types[(int) ARG3], \
3307 tree_cons (NULL_TREE, \
3308 builtin_types[(int) ARG4], \
3309 void_list_node)))));
3310 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3311 builtin_types[(int) ENUM] \
3312 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3313 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3314 builtin_types[(int) ENUM] \
3315 = build_function_type (builtin_types[(int) RETURN], \
3316 tree_cons (NULL_TREE, \
3317 builtin_types[(int) ARG1], \
3320 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3321 builtin_types[(int) ENUM] \
3322 = build_function_type \
3323 (builtin_types[(int) RETURN], \
3324 tree_cons (NULL_TREE, \
3325 builtin_types[(int) ARG1], \
3326 tree_cons (NULL_TREE, \
3327 builtin_types[(int) ARG2], \
3330 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3331 builtin_types[(int) ENUM] \
3332 = build_function_type \
3333 (builtin_types[(int) RETURN], \
3334 tree_cons (NULL_TREE, \
3335 builtin_types[(int) ARG1], \
3336 tree_cons (NULL_TREE, \
3337 builtin_types[(int) ARG2], \
3338 tree_cons (NULL_TREE, \
3339 builtin_types[(int) ARG3], \
3342 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3343 builtin_types[(int) ENUM] \
3344 = build_pointer_type (builtin_types[(int) TYPE]);
3345 #include "builtin-types.def"
3346 #undef DEF_PRIMITIVE_TYPE
3347 #undef DEF_FUNCTION_TYPE_1
3348 #undef DEF_FUNCTION_TYPE_2
3349 #undef DEF_FUNCTION_TYPE_3
3350 #undef DEF_FUNCTION_TYPE_4
3351 #undef DEF_FUNCTION_TYPE_VAR_0
3352 #undef DEF_FUNCTION_TYPE_VAR_1
3353 #undef DEF_FUNCTION_TYPE_VAR_2
3354 #undef DEF_FUNCTION_TYPE_VAR_3
3355 #undef DEF_POINTER_TYPE
3357 if (!c_attrs_initialized)
3358 c_init_attributes ();
3360 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3361 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3366 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3370 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3373 ? (NAME + strlen ("__builtin_")) \
3375 built_in_attributes[(int) ATTRS]); \
3377 decl = builtin_function_2 (NAME, \
3378 NAME + strlen ("__builtin_"), \
3379 builtin_types[TYPE], \
3380 builtin_types[LIBTYPE], \
3385 built_in_attributes[(int) ATTRS]); \
3387 built_in_decls[(int) ENUM] = decl; \
3389 implicit_built_in_decls[(int) ENUM] = decl; \
3391 #include "builtins.def"
3394 (*targetm.init_builtins) ();
3396 main_identifier_node = get_identifier ("main");
3400 build_va_arg (tree expr, tree type)
3402 return build1 (VA_ARG_EXPR, type, expr);
3406 /* Linked list of disabled built-in functions. */
3408 typedef struct disabled_builtin
3411 struct disabled_builtin *next;
3413 static disabled_builtin *disabled_builtins = NULL;
3415 static bool builtin_function_disabled_p (const char *);
3417 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3418 begins with "__builtin_", give an error. */
3421 disable_builtin_function (const char *name)
3423 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3424 error ("cannot disable built-in function `%s'", name);
3427 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3429 new->next = disabled_builtins;
3430 disabled_builtins = new;
3435 /* Return true if the built-in function NAME has been disabled, false
3439 builtin_function_disabled_p (const char *name)
3441 disabled_builtin *p;
3442 for (p = disabled_builtins; p != NULL; p = p->next)
3444 if (strcmp (name, p->name) == 0)
3451 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3452 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3453 of these may be NULL (though both being NULL is useless).
3454 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3455 TYPE is the type of the function with the ordinary name. These
3456 may differ if the ordinary name is declared with a looser type to avoid
3457 conflicts with headers. FUNCTION_CODE and CLASS are as for
3458 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3459 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3460 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3461 ATTRS is the tree list representing the builtin's function attributes.
3462 Returns the declaration of BUILTIN_NAME, if any, otherwise
3463 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3464 or if NONANSI_P and flag_no_nonansi_builtin. */
3467 builtin_function_2 (const char *builtin_name, const char *name,
3468 tree builtin_type, tree type, int function_code,
3469 enum built_in_class class, int library_name_p,
3470 int nonansi_p, tree attrs)
3472 tree bdecl = NULL_TREE;
3473 tree decl = NULL_TREE;
3475 if (builtin_name != 0)
3476 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3477 class, library_name_p ? name : NULL, attrs);
3479 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3480 && !(nonansi_p && flag_no_nonansi_builtin))
3481 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3483 return (bdecl != 0 ? bdecl : decl);
3486 /* Nonzero if the type T promotes to int. This is (nearly) the
3487 integral promotions defined in ISO C99 6.3.1.1/2. */
3490 c_promoting_integer_type_p (tree t)
3492 switch (TREE_CODE (t))
3495 return (TYPE_MAIN_VARIANT (t) == char_type_node
3496 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3497 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3498 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3499 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3500 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3503 /* ??? Technically all enumerations not larger than an int
3504 promote to an int. But this is used along code paths
3505 that only want to notice a size change. */
3506 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3516 /* Return 1 if PARMS specifies a fixed number of parameters
3517 and none of their types is affected by default promotions. */
3520 self_promoting_args_p (tree parms)
3523 for (t = parms; t; t = TREE_CHAIN (t))
3525 tree type = TREE_VALUE (t);
3527 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3533 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3536 if (c_promoting_integer_type_p (type))
3542 /* Recursively examines the array elements of TYPE, until a non-array
3543 element type is found. */
3546 strip_array_types (tree type)
3548 while (TREE_CODE (type) == ARRAY_TYPE)
3549 type = TREE_TYPE (type);
3554 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3556 /* Expand a call to an unordered comparison function such as
3557 __builtin_isgreater(). FUNCTION is the function's declaration and
3558 PARAMS a list of the values passed. For __builtin_isunordered(),
3559 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3560 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3561 that give the opposite of the desired result. UNORDERED_CODE is
3562 used for modes that can hold NaNs and ORDERED_CODE is used for the
3566 expand_unordered_cmp (tree function, tree params,
3567 enum tree_code unordered_code,
3568 enum tree_code ordered_code)
3570 tree arg0, arg1, type;
3571 enum tree_code code0, code1;
3573 /* Check that we have exactly two arguments. */
3574 if (params == 0 || TREE_CHAIN (params) == 0)
3576 error ("too few arguments to function `%s'",
3577 IDENTIFIER_POINTER (DECL_NAME (function)));
3578 return error_mark_node;
3580 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3582 error ("too many arguments to function `%s'",
3583 IDENTIFIER_POINTER (DECL_NAME (function)));
3584 return error_mark_node;
3587 arg0 = TREE_VALUE (params);
3588 arg1 = TREE_VALUE (TREE_CHAIN (params));
3590 code0 = TREE_CODE (TREE_TYPE (arg0));
3591 code1 = TREE_CODE (TREE_TYPE (arg1));
3593 /* Make sure that the arguments have a common type of REAL. */
3595 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3596 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3597 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3599 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3601 error ("non-floating-point argument to function `%s'",
3602 IDENTIFIER_POINTER (DECL_NAME (function)));
3603 return error_mark_node;
3606 if (unordered_code == UNORDERED_EXPR)
3608 if (MODE_HAS_NANS (TYPE_MODE (type)))
3609 return build_binary_op (unordered_code,
3610 convert (type, arg0),
3611 convert (type, arg1),
3614 return integer_zero_node;
3617 return build_unary_op (TRUTH_NOT_EXPR,
3618 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3621 convert (type, arg0),
3622 convert (type, arg1),
3628 /* Recognize certain built-in functions so we can make tree-codes
3629 other than CALL_EXPR. We do this when it enables fold-const.c
3630 to do something useful. */
3631 /* ??? By rights this should go in builtins.c, but only C and C++
3632 implement build_{binary,unary}_op. Not exactly sure what bits
3633 of functionality are actually needed from those functions, or
3634 where the similar functionality exists in the other front ends. */
3637 expand_tree_builtin (tree function, tree params, tree coerced_params)
3639 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3642 switch (DECL_FUNCTION_CODE (function))
3646 case BUILT_IN_LLABS:
3647 case BUILT_IN_IMAXABS:
3649 case BUILT_IN_FABSL:
3650 case BUILT_IN_FABSF:
3651 if (coerced_params == 0)
3652 return integer_zero_node;
3653 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3656 case BUILT_IN_CONJF:
3657 case BUILT_IN_CONJL:
3658 if (coerced_params == 0)
3659 return integer_zero_node;
3660 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3662 case BUILT_IN_CREAL:
3663 case BUILT_IN_CREALF:
3664 case BUILT_IN_CREALL:
3665 if (coerced_params == 0)
3666 return integer_zero_node;
3667 return build_unary_op (REALPART_EXPR, TREE_VALUE (coerced_params), 0);
3669 case BUILT_IN_CIMAG:
3670 case BUILT_IN_CIMAGF:
3671 case BUILT_IN_CIMAGL:
3672 if (coerced_params == 0)
3673 return integer_zero_node;
3674 return build_unary_op (IMAGPART_EXPR, TREE_VALUE (coerced_params), 0);
3676 case BUILT_IN_ISGREATER:
3677 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3679 case BUILT_IN_ISGREATEREQUAL:
3680 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3682 case BUILT_IN_ISLESS:
3683 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3685 case BUILT_IN_ISLESSEQUAL:
3686 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3688 case BUILT_IN_ISLESSGREATER:
3689 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3691 case BUILT_IN_ISUNORDERED:
3692 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3701 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3702 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3703 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3704 value, the traversal is aborted, and the value returned by FUNC is
3705 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3706 the node being visited are not walked.
3708 We don't need a without_duplicates variant of this one because the
3709 statement tree is a tree, not a graph. */
3712 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3714 enum tree_code code;
3719 #define WALK_SUBTREE(NODE) \
3722 result = walk_stmt_tree (&(NODE), func, data); \
3728 /* Skip empty subtrees. */
3732 /* Skip subtrees below non-statement nodes. */
3733 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3736 /* Call the function. */
3738 result = (*func) (tp, &walk_subtrees, data);
3740 /* If we found something, return it. */
3744 /* FUNC may have modified the tree, recheck that we're looking at a
3746 code = TREE_CODE (*tp);
3747 if (!STATEMENT_CODE_P (code))
3750 /* Visit the subtrees unless FUNC decided that there was nothing
3751 interesting below this point in the tree. */
3754 /* Walk over all the sub-trees of this operand. Statement nodes
3755 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3756 len = TREE_CODE_LENGTH (code);
3758 /* Go through the subtrees. We need to do this in forward order so
3759 that the scope of a FOR_EXPR is handled properly. */
3760 for (i = 0; i < len; ++i)
3761 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3764 /* Finally visit the chain. This can be tail-recursion optimized if
3765 we write it this way. */
3766 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3771 /* Used to compare case labels. K1 and K2 are actually tree nodes
3772 representing case labels, or NULL_TREE for a `default' label.
3773 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3774 K2, and 0 if K1 and K2 are equal. */
3777 case_compare (splay_tree_key k1, splay_tree_key k2)
3779 /* Consider a NULL key (such as arises with a `default' label) to be
3780 smaller than anything else. */
3786 return tree_int_cst_compare ((tree) k1, (tree) k2);
3789 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3790 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3791 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3792 case label was declared using the usual C/C++ syntax, rather than
3793 the GNU case range extension. CASES is a tree containing all the
3794 case ranges processed so far; COND is the condition for the
3795 switch-statement itself. Returns the CASE_LABEL created, or
3796 ERROR_MARK_NODE if no CASE_LABEL is created. */
3799 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3805 splay_tree_node node;
3807 /* Create the LABEL_DECL itself. */
3808 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3809 DECL_CONTEXT (label) = current_function_decl;
3811 /* If there was an error processing the switch condition, bail now
3812 before we get more confused. */
3813 if (!cond || cond == error_mark_node)
3815 /* Add a label anyhow so that the back-end doesn't think that
3816 the beginning of the switch is unreachable. */
3818 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3819 return error_mark_node;
3822 if ((low_value && TREE_TYPE (low_value)
3823 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3824 || (high_value && TREE_TYPE (high_value)
3825 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3826 error ("pointers are not permitted as case values");
3828 /* Case ranges are a GNU extension. */
3829 if (high_value && pedantic)
3830 pedwarn ("range expressions in switch statements are non-standard");
3832 type = TREE_TYPE (cond);
3835 low_value = check_case_value (low_value);
3836 low_value = convert_and_check (type, low_value);
3840 high_value = check_case_value (high_value);
3841 high_value = convert_and_check (type, high_value);
3844 /* If an error has occurred, bail out now. */
3845 if (low_value == error_mark_node || high_value == error_mark_node)
3848 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3849 return error_mark_node;
3852 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3853 really a case range, even though it was written that way. Remove
3854 the HIGH_VALUE to simplify later processing. */
3855 if (tree_int_cst_equal (low_value, high_value))
3856 high_value = NULL_TREE;
3857 if (low_value && high_value
3858 && !tree_int_cst_lt (low_value, high_value))
3859 warning ("empty range specified");
3861 /* Look up the LOW_VALUE in the table of case labels we already
3863 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3864 /* If there was not an exact match, check for overlapping ranges.
3865 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3866 that's a `default' label and the only overlap is an exact match. */
3867 if (!node && (low_value || high_value))
3869 splay_tree_node low_bound;
3870 splay_tree_node high_bound;
3872 /* Even though there wasn't an exact match, there might be an
3873 overlap between this case range and another case range.
3874 Since we've (inductively) not allowed any overlapping case
3875 ranges, we simply need to find the greatest low case label
3876 that is smaller that LOW_VALUE, and the smallest low case
3877 label that is greater than LOW_VALUE. If there is an overlap
3878 it will occur in one of these two ranges. */
3879 low_bound = splay_tree_predecessor (cases,
3880 (splay_tree_key) low_value);
3881 high_bound = splay_tree_successor (cases,
3882 (splay_tree_key) low_value);
3884 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3885 the LOW_VALUE, so there is no need to check unless the
3886 LOW_BOUND is in fact itself a case range. */
3888 && CASE_HIGH ((tree) low_bound->value)
3889 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3892 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3893 range is bigger than the low end of the current range, so we
3894 are only interested if the current range is a real range, and
3895 not an ordinary case label. */
3898 && (tree_int_cst_compare ((tree) high_bound->key,
3903 /* If there was an overlap, issue an error. */
3906 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3910 error ("duplicate (or overlapping) case value");
3911 error ("%Hthis is the first entry overlapping that value",
3912 &DECL_SOURCE_LOCATION (duplicate));
3916 error ("duplicate case value") ;
3917 error ("%Hpreviously used here", &DECL_SOURCE_LOCATION (duplicate));
3921 error ("multiple default labels in one switch");
3922 error ("%Hthis is the first default label",
3923 &DECL_SOURCE_LOCATION (duplicate));
3926 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3929 /* Add a CASE_LABEL to the statement-tree. */
3930 case_label = add_stmt (build_case_label (low_value, high_value, label));
3931 /* Register this case label in the splay tree. */
3932 splay_tree_insert (cases,
3933 (splay_tree_key) low_value,
3934 (splay_tree_value) case_label);
3939 /* Finish an expression taking the address of LABEL (an
3940 IDENTIFIER_NODE). Returns an expression for the address. */
3943 finish_label_address_expr (tree label)
3948 pedwarn ("taking the address of a label is non-standard");
3950 if (label == error_mark_node)
3951 return error_mark_node;
3953 label = lookup_label (label);
3954 if (label == NULL_TREE)
3955 result = null_pointer_node;
3958 TREE_USED (label) = 1;
3959 result = build1 (ADDR_EXPR, ptr_type_node, label);
3960 TREE_CONSTANT (result) = 1;
3961 /* The current function in not necessarily uninlinable.
3962 Computed gotos are incompatible with inlining, but the value
3963 here could be used only in a diagnostic, for example. */
3969 /* Hook used by expand_expr to expand language-specific tree codes. */
3972 c_expand_expr (tree exp, rtx target, enum machine_mode tmode, int modifier)
3973 /* Actually enum_modifier. */
3975 switch (TREE_CODE (exp))
3981 bool preserve_result = false;
3982 bool return_target = false;
3984 /* Since expand_expr_stmt calls free_temp_slots after every
3985 expression statement, we must call push_temp_slots here.
3986 Otherwise, any temporaries in use now would be considered
3987 out-of-scope after the first EXPR_STMT from within the
3990 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
3992 /* If we want the result of this expression, find the last
3993 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
3994 if (target != const0_rtx
3995 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
3996 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
3998 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
3999 tree last = TREE_CHAIN (expr);
4001 while (TREE_CHAIN (last))
4004 last = TREE_CHAIN (last);
4007 if (TREE_CODE (last) == SCOPE_STMT
4008 && TREE_CODE (expr) == EXPR_STMT)
4010 if (target && TREE_CODE (EXPR_STMT_EXPR (expr)) == VAR_DECL
4011 && DECL_RTL_IF_SET (EXPR_STMT_EXPR (expr)) == target)
4012 /* If the last expression is a variable whose RTL is the
4013 same as our target, just return the target; if it
4014 isn't valid expanding the decl would produce different
4015 RTL, and store_expr would try to do a copy. */
4016 return_target = true;
4019 /* Otherwise, note that we want the value from the last
4021 TREE_ADDRESSABLE (expr) = 1;
4022 preserve_result = true;
4027 expand_stmt (STMT_EXPR_STMT (exp));
4028 expand_end_stmt_expr (rtl_expr);
4030 result = expand_expr (rtl_expr, target, tmode, modifier);
4033 else if (preserve_result && GET_CODE (result) == MEM)
4035 if (GET_MODE (result) != BLKmode)
4036 result = copy_to_reg (result);
4038 preserve_temp_slots (result);
4041 /* If the statment-expression does not have a scope, then the
4042 new temporaries we created within it must live beyond the
4043 statement-expression. */
4044 if (STMT_EXPR_NO_SCOPE (exp))
4045 preserve_temp_slots (NULL_RTX);
4052 case COMPOUND_LITERAL_EXPR:
4054 /* Initialize the anonymous variable declared in the compound
4055 literal, then return the variable. */
4056 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4057 emit_local_var (decl);
4058 return expand_expr (decl, target, tmode, modifier);
4069 /* Hook used by safe_from_p to handle language-specific tree codes. */
4072 c_safe_from_p (rtx target, tree exp)
4074 /* We can see statements here when processing the body of a
4075 statement-expression. For a declaration statement declaring a
4076 variable, look at the variable's initializer. */
4077 if (TREE_CODE (exp) == DECL_STMT)
4079 tree decl = DECL_STMT_DECL (exp);
4081 if (TREE_CODE (decl) == VAR_DECL
4082 && DECL_INITIAL (decl)
4083 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4087 /* For any statement, we must follow the statement-chain. */
4088 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4089 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4091 /* Assume everything else is safe. */
4095 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4098 c_common_unsafe_for_reeval (tree exp)
4100 /* Statement expressions may not be reevaluated, likewise compound
4102 if (TREE_CODE (exp) == STMT_EXPR
4103 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4106 /* Walk all other expressions. */
4110 /* Hook used by staticp to handle language-specific tree codes. */
4113 c_staticp (tree exp)
4115 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4116 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4122 /* Given a boolean expression ARG, return a tree representing an increment
4123 or decrement (as indicated by CODE) of ARG. The front end must check for
4124 invalid cases (e.g., decrement in C++). */
4126 boolean_increment (enum tree_code code, tree arg)
4129 tree true_res = boolean_true_node;
4131 arg = stabilize_reference (arg);
4134 case PREINCREMENT_EXPR:
4135 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4137 case POSTINCREMENT_EXPR:
4138 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4139 arg = save_expr (arg);
4140 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4141 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4143 case PREDECREMENT_EXPR:
4144 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4146 case POSTDECREMENT_EXPR:
4147 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4148 arg = save_expr (arg);
4149 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4150 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4155 TREE_SIDE_EFFECTS (val) = 1;
4159 /* Built-in macros for stddef.h, that require macros defined in this
4162 c_stddef_cpp_builtins(void)
4164 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4165 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4166 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4167 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4171 c_init_attributes (void)
4173 /* Fill in the built_in_attributes array. */
4174 #define DEF_ATTR_NULL_TREE(ENUM) \
4175 built_in_attributes[(int) ENUM] = NULL_TREE;
4176 #define DEF_ATTR_INT(ENUM, VALUE) \
4177 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4178 #define DEF_ATTR_IDENT(ENUM, STRING) \
4179 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4180 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4181 built_in_attributes[(int) ENUM] \
4182 = tree_cons (built_in_attributes[(int) PURPOSE], \
4183 built_in_attributes[(int) VALUE], \
4184 built_in_attributes[(int) CHAIN]);
4185 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No initialization needed. */
4186 #include "builtin-attrs.def"
4187 #undef DEF_ATTR_NULL_TREE
4189 #undef DEF_ATTR_IDENT
4190 #undef DEF_ATTR_TREE_LIST
4192 c_attrs_initialized = true;
4195 /* Depending on the name of DECL, apply default attributes to it. */
4198 c_common_insert_default_attributes (tree decl)
4200 tree name = DECL_NAME (decl);
4202 if (!c_attrs_initialized)
4203 c_init_attributes ();
4205 #define DEF_ATTR_NULL_TREE(ENUM) /* Nothing needed after initialization. */
4206 #define DEF_ATTR_INT(ENUM, VALUE)
4207 #define DEF_ATTR_IDENT(ENUM, STRING)
4208 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN)
4209 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) \
4210 if ((PREDICATE) && name == built_in_attributes[(int) NAME]) \
4211 decl_attributes (&decl, built_in_attributes[(int) ATTRS], \
4212 ATTR_FLAG_BUILT_IN);
4213 #include "builtin-attrs.def"
4214 #undef DEF_ATTR_NULL_TREE
4216 #undef DEF_ATTR_IDENT
4217 #undef DEF_ATTR_TREE_LIST
4221 /* Output a -Wshadow warning MSGCODE about NAME, and give the location
4222 of the previous declaration DECL. */
4224 shadow_warning (enum sw_kind msgcode, const char *name, tree decl)
4226 static const char *const msgs[] = {
4227 /* SW_PARAM */ N_("declaration of \"%s\" shadows a parameter"),
4228 /* SW_LOCAL */ N_("declaration of \"%s\" shadows a previous local"),
4229 /* SW_GLOBAL */ N_("declaration of \"%s\" shadows a global declaration")
4232 warning (msgs[msgcode], name);
4233 warning ("%Hshadowed declaration is here", &DECL_SOURCE_LOCATION (decl));
4236 /* Attribute handlers common to C front ends. */
4238 /* Handle a "packed" attribute; arguments as in
4239 struct attribute_spec.handler. */
4242 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4243 int flags, bool *no_add_attrs)
4247 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4248 *node = build_type_copy (*node);
4249 TYPE_PACKED (*node) = 1;
4250 if (TYPE_MAIN_VARIANT (*node) == *node)
4252 /* If it is the main variant, then pack the other variants
4253 too. This happens in,
4256 struct Foo const *ptr; // creates a variant w/o packed flag
4257 } __ attribute__((packed)); // packs it now.
4261 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4262 TYPE_PACKED (probe) = 1;
4266 else if (TREE_CODE (*node) == FIELD_DECL)
4267 DECL_PACKED (*node) = 1;
4268 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4269 used for DECL_REGISTER. It wouldn't mean anything anyway.
4270 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4271 that changes what the typedef is typing. */
4274 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4275 *no_add_attrs = true;
4281 /* Handle a "nocommon" attribute; arguments as in
4282 struct attribute_spec.handler. */
4285 handle_nocommon_attribute (tree *node, tree name,
4286 tree args ATTRIBUTE_UNUSED,
4287 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4289 if (TREE_CODE (*node) == VAR_DECL)
4290 DECL_COMMON (*node) = 0;
4293 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4294 *no_add_attrs = true;
4300 /* Handle a "common" attribute; arguments as in
4301 struct attribute_spec.handler. */
4304 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4305 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4307 if (TREE_CODE (*node) == VAR_DECL)
4308 DECL_COMMON (*node) = 1;
4311 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4312 *no_add_attrs = true;
4318 /* Handle a "noreturn" attribute; arguments as in
4319 struct attribute_spec.handler. */
4322 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4323 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4325 tree type = TREE_TYPE (*node);
4327 /* See FIXME comment in c_common_attribute_table. */
4328 if (TREE_CODE (*node) == FUNCTION_DECL)
4329 TREE_THIS_VOLATILE (*node) = 1;
4330 else if (TREE_CODE (type) == POINTER_TYPE
4331 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4333 = build_pointer_type
4334 (build_type_variant (TREE_TYPE (type),
4335 TREE_READONLY (TREE_TYPE (type)), 1));
4338 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4339 *no_add_attrs = true;
4345 /* Handle a "noinline" attribute; arguments as in
4346 struct attribute_spec.handler. */
4349 handle_noinline_attribute (tree *node, tree name,
4350 tree args ATTRIBUTE_UNUSED,
4351 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4353 if (TREE_CODE (*node) == FUNCTION_DECL)
4354 DECL_UNINLINABLE (*node) = 1;
4357 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4358 *no_add_attrs = true;
4364 /* Handle a "always_inline" attribute; arguments as in
4365 struct attribute_spec.handler. */
4368 handle_always_inline_attribute (tree *node, tree name,
4369 tree args ATTRIBUTE_UNUSED,
4370 int flags ATTRIBUTE_UNUSED,
4373 if (TREE_CODE (*node) == FUNCTION_DECL)
4375 /* Do nothing else, just set the attribute. We'll get at
4376 it later with lookup_attribute. */
4380 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4381 *no_add_attrs = true;
4387 /* Handle a "used" attribute; arguments as in
4388 struct attribute_spec.handler. */
4391 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4392 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4396 if (TREE_CODE (node) == FUNCTION_DECL
4397 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4399 TREE_USED (node) = 1;
4403 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4404 *no_add_attrs = true;
4410 /* Handle a "unused" attribute; arguments as in
4411 struct attribute_spec.handler. */
4414 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4415 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4421 if (TREE_CODE (decl) == PARM_DECL
4422 || TREE_CODE (decl) == VAR_DECL
4423 || TREE_CODE (decl) == FUNCTION_DECL
4424 || TREE_CODE (decl) == LABEL_DECL
4425 || TREE_CODE (decl) == TYPE_DECL)
4426 TREE_USED (decl) = 1;
4429 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4430 *no_add_attrs = true;
4435 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4436 *node = build_type_copy (*node);
4437 TREE_USED (*node) = 1;
4443 /* Handle a "const" attribute; arguments as in
4444 struct attribute_spec.handler. */
4447 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4448 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4450 tree type = TREE_TYPE (*node);
4452 /* See FIXME comment on noreturn in c_common_attribute_table. */
4453 if (TREE_CODE (*node) == FUNCTION_DECL)
4454 TREE_READONLY (*node) = 1;
4455 else if (TREE_CODE (type) == POINTER_TYPE
4456 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4458 = build_pointer_type
4459 (build_type_variant (TREE_TYPE (type), 1,
4460 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4463 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4464 *no_add_attrs = true;
4470 /* Handle a "transparent_union" attribute; arguments as in
4471 struct attribute_spec.handler. */
4474 handle_transparent_union_attribute (tree *node, tree name,
4475 tree args ATTRIBUTE_UNUSED, int flags,
4478 tree decl = NULL_TREE;
4485 type = &TREE_TYPE (decl);
4486 is_type = TREE_CODE (*node) == TYPE_DECL;
4488 else if (TYPE_P (*node))
4489 type = node, is_type = 1;
4492 && TREE_CODE (*type) == UNION_TYPE
4494 || (TYPE_FIELDS (*type) != 0
4495 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4497 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4498 *type = build_type_copy (*type);
4499 TYPE_TRANSPARENT_UNION (*type) = 1;
4501 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4502 && TREE_CODE (*type) == UNION_TYPE
4503 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4504 DECL_TRANSPARENT_UNION (decl) = 1;
4507 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4508 *no_add_attrs = true;
4514 /* Handle a "constructor" attribute; arguments as in
4515 struct attribute_spec.handler. */
4518 handle_constructor_attribute (tree *node, tree name,
4519 tree args ATTRIBUTE_UNUSED,
4520 int flags ATTRIBUTE_UNUSED,
4524 tree type = TREE_TYPE (decl);
4526 if (TREE_CODE (decl) == FUNCTION_DECL
4527 && TREE_CODE (type) == FUNCTION_TYPE
4528 && decl_function_context (decl) == 0)
4530 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4531 TREE_USED (decl) = 1;
4535 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4536 *no_add_attrs = true;
4542 /* Handle a "destructor" attribute; arguments as in
4543 struct attribute_spec.handler. */
4546 handle_destructor_attribute (tree *node, tree name,
4547 tree args ATTRIBUTE_UNUSED,
4548 int flags ATTRIBUTE_UNUSED,
4552 tree type = TREE_TYPE (decl);
4554 if (TREE_CODE (decl) == FUNCTION_DECL
4555 && TREE_CODE (type) == FUNCTION_TYPE
4556 && decl_function_context (decl) == 0)
4558 DECL_STATIC_DESTRUCTOR (decl) = 1;
4559 TREE_USED (decl) = 1;
4563 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4564 *no_add_attrs = true;
4570 /* Handle a "mode" attribute; arguments as in
4571 struct attribute_spec.handler. */
4574 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4575 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4579 *no_add_attrs = true;
4581 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4582 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4586 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4587 int len = strlen (p);
4588 enum machine_mode mode = VOIDmode;
4592 if (len > 4 && p[0] == '_' && p[1] == '_'
4593 && p[len - 1] == '_' && p[len - 2] == '_')
4595 char *newp = alloca (len - 1);
4597 strcpy (newp, &p[2]);
4598 newp[len - 4] = '\0';
4602 /* Change this type to have a type with the specified mode.
4603 First check for the special modes. */
4604 if (! strcmp (p, "byte"))
4606 else if (!strcmp (p, "word"))
4608 else if (! strcmp (p, "pointer"))
4611 for (j = 0; j < NUM_MACHINE_MODES; j++)
4612 if (!strcmp (p, GET_MODE_NAME (j)))
4613 mode = (enum machine_mode) j;
4615 if (mode == VOIDmode)
4616 error ("unknown machine mode `%s'", p);
4617 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
4618 (mode, TREE_UNSIGNED (type))))
4619 error ("no data type for mode `%s'", p);
4620 else if ((TREE_CODE (type) == POINTER_TYPE
4621 || TREE_CODE (type) == REFERENCE_TYPE)
4622 && !(*targetm.valid_pointer_mode) (mode))
4623 error ("invalid pointer mode `%s'", p);
4626 /* If this is a vector, make sure we either have hardware
4627 support, or we can emulate it. */
4628 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4630 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4634 if (TREE_CODE (type) == POINTER_TYPE)
4636 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4640 else if (TREE_CODE (type) == REFERENCE_TYPE)
4642 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4648 /* No need to layout the type here. The caller should do this. */
4655 /* Handle a "section" attribute; arguments as in
4656 struct attribute_spec.handler. */
4659 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4660 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4664 if (targetm.have_named_sections)
4666 if ((TREE_CODE (decl) == FUNCTION_DECL
4667 || TREE_CODE (decl) == VAR_DECL)
4668 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4670 if (TREE_CODE (decl) == VAR_DECL
4671 && current_function_decl != NULL_TREE
4672 && ! TREE_STATIC (decl))
4674 error ("%Hsection attribute cannot be specified for "
4675 "local variables", &DECL_SOURCE_LOCATION (decl));
4676 *no_add_attrs = true;
4679 /* The decl may have already been given a section attribute
4680 from a previous declaration. Ensure they match. */
4681 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4682 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4683 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4685 error ("%Hsection of '%D' conflicts with previous declaration",
4686 &DECL_SOURCE_LOCATION (*node), *node);
4687 *no_add_attrs = true;
4690 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4694 error ("%Hsection attribute not allowed for '%D'",
4695 &DECL_SOURCE_LOCATION (*node), *node);
4696 *no_add_attrs = true;
4701 error ("%Hsection attributes are not supported for this target",
4702 &DECL_SOURCE_LOCATION (*node));
4703 *no_add_attrs = true;
4709 /* Handle a "aligned" attribute; arguments as in
4710 struct attribute_spec.handler. */
4713 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4714 int flags, bool *no_add_attrs)
4716 tree decl = NULL_TREE;
4719 tree align_expr = (args ? TREE_VALUE (args)
4720 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4726 type = &TREE_TYPE (decl);
4727 is_type = TREE_CODE (*node) == TYPE_DECL;
4729 else if (TYPE_P (*node))
4730 type = node, is_type = 1;
4732 /* Strip any NOPs of any kind. */
4733 while (TREE_CODE (align_expr) == NOP_EXPR
4734 || TREE_CODE (align_expr) == CONVERT_EXPR
4735 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4736 align_expr = TREE_OPERAND (align_expr, 0);
4738 if (TREE_CODE (align_expr) != INTEGER_CST)
4740 error ("requested alignment is not a constant");
4741 *no_add_attrs = true;
4743 else if ((i = tree_log2 (align_expr)) == -1)
4745 error ("requested alignment is not a power of 2");
4746 *no_add_attrs = true;
4748 else if (i > HOST_BITS_PER_INT - 2)
4750 error ("requested alignment is too large");
4751 *no_add_attrs = true;
4755 /* If we have a TYPE_DECL, then copy the type, so that we
4756 don't accidentally modify a builtin type. See pushdecl. */
4757 if (decl && TREE_TYPE (decl) != error_mark_node
4758 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4760 tree tt = TREE_TYPE (decl);
4761 *type = build_type_copy (*type);
4762 DECL_ORIGINAL_TYPE (decl) = tt;
4763 TYPE_NAME (*type) = decl;
4764 TREE_USED (*type) = TREE_USED (decl);
4765 TREE_TYPE (decl) = *type;
4767 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4768 *type = build_type_copy (*type);
4770 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4771 TYPE_USER_ALIGN (*type) = 1;
4773 else if (TREE_CODE (decl) != VAR_DECL
4774 && TREE_CODE (decl) != FIELD_DECL)
4776 error ("%Halignment may not be specified for '%D'",
4777 &DECL_SOURCE_LOCATION (decl), decl);
4778 *no_add_attrs = true;
4782 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4783 DECL_USER_ALIGN (decl) = 1;
4789 /* Handle a "weak" attribute; arguments as in
4790 struct attribute_spec.handler. */
4793 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4794 tree args ATTRIBUTE_UNUSED,
4795 int flags ATTRIBUTE_UNUSED,
4796 bool *no_add_attrs ATTRIBUTE_UNUSED)
4798 declare_weak (*node);
4803 /* Handle an "alias" attribute; arguments as in
4804 struct attribute_spec.handler. */
4807 handle_alias_attribute (tree *node, tree name, tree args,
4808 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4812 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4813 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4815 error ("%H'%D' defined both normally and as an alias",
4816 &DECL_SOURCE_LOCATION (decl), decl);
4817 *no_add_attrs = true;
4819 else if (decl_function_context (decl) == 0)
4823 id = TREE_VALUE (args);
4824 if (TREE_CODE (id) != STRING_CST)
4826 error ("alias arg not a string");
4827 *no_add_attrs = true;
4830 id = get_identifier (TREE_STRING_POINTER (id));
4831 /* This counts as a use of the object pointed to. */
4834 if (TREE_CODE (decl) == FUNCTION_DECL)
4835 DECL_INITIAL (decl) = error_mark_node;
4837 DECL_EXTERNAL (decl) = 0;
4841 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4842 *no_add_attrs = true;
4848 /* Handle an "visibility" attribute; arguments as in
4849 struct attribute_spec.handler. */
4852 handle_visibility_attribute (tree *node, tree name, tree args,
4853 int flags ATTRIBUTE_UNUSED,
4858 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
4860 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4861 *no_add_attrs = true;
4867 id = TREE_VALUE (args);
4868 if (TREE_CODE (id) != STRING_CST)
4870 error ("visibility arg not a string");
4871 *no_add_attrs = true;
4874 if (strcmp (TREE_STRING_POINTER (id), "hidden")
4875 && strcmp (TREE_STRING_POINTER (id), "protected")
4876 && strcmp (TREE_STRING_POINTER (id), "internal")
4877 && strcmp (TREE_STRING_POINTER (id), "default"))
4879 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4880 *no_add_attrs = true;
4888 /* Handle an "tls_model" attribute; arguments as in
4889 struct attribute_spec.handler. */
4892 handle_tls_model_attribute (tree *node, tree name, tree args,
4893 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4897 if (! DECL_THREAD_LOCAL (decl))
4899 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4900 *no_add_attrs = true;
4906 id = TREE_VALUE (args);
4907 if (TREE_CODE (id) != STRING_CST)
4909 error ("tls_model arg not a string");
4910 *no_add_attrs = true;
4913 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4914 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4915 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4916 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4918 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4919 *no_add_attrs = true;
4927 /* Handle a "no_instrument_function" attribute; arguments as in
4928 struct attribute_spec.handler. */
4931 handle_no_instrument_function_attribute (tree *node, tree name,
4932 tree args ATTRIBUTE_UNUSED,
4933 int flags ATTRIBUTE_UNUSED,
4938 if (TREE_CODE (decl) != FUNCTION_DECL)
4940 error ("%H'%E' attribute applies only to functions",
4941 &DECL_SOURCE_LOCATION (decl), name);
4942 *no_add_attrs = true;
4944 else if (DECL_INITIAL (decl))
4946 error ("%Hcan't set '%E' attribute after definition",
4947 &DECL_SOURCE_LOCATION (decl), name);
4948 *no_add_attrs = true;
4951 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
4956 /* Handle a "malloc" attribute; arguments as in
4957 struct attribute_spec.handler. */
4960 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4961 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4963 if (TREE_CODE (*node) == FUNCTION_DECL)
4964 DECL_IS_MALLOC (*node) = 1;
4965 /* ??? TODO: Support types. */
4968 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4969 *no_add_attrs = true;
4975 /* Handle a "no_limit_stack" attribute; arguments as in
4976 struct attribute_spec.handler. */
4979 handle_no_limit_stack_attribute (tree *node, tree name,
4980 tree args ATTRIBUTE_UNUSED,
4981 int flags ATTRIBUTE_UNUSED,
4986 if (TREE_CODE (decl) != FUNCTION_DECL)
4988 error ("%H'%E' attribute applies only to functions",
4989 &DECL_SOURCE_LOCATION (decl), name);
4990 *no_add_attrs = true;
4992 else if (DECL_INITIAL (decl))
4994 error ("%Hcan't set '%E' attribute after definition",
4995 &DECL_SOURCE_LOCATION (decl), name);
4996 *no_add_attrs = true;
4999 DECL_NO_LIMIT_STACK (decl) = 1;
5004 /* Handle a "pure" attribute; arguments as in
5005 struct attribute_spec.handler. */
5008 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5009 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5011 if (TREE_CODE (*node) == FUNCTION_DECL)
5012 DECL_IS_PURE (*node) = 1;
5013 /* ??? TODO: Support types. */
5016 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5017 *no_add_attrs = true;
5023 /* Handle a "deprecated" attribute; arguments as in
5024 struct attribute_spec.handler. */
5027 handle_deprecated_attribute (tree *node, tree name,
5028 tree args ATTRIBUTE_UNUSED, int flags,
5031 tree type = NULL_TREE;
5033 const char *what = NULL;
5038 type = TREE_TYPE (decl);
5040 if (TREE_CODE (decl) == TYPE_DECL
5041 || TREE_CODE (decl) == PARM_DECL
5042 || TREE_CODE (decl) == VAR_DECL
5043 || TREE_CODE (decl) == FUNCTION_DECL
5044 || TREE_CODE (decl) == FIELD_DECL)
5045 TREE_DEPRECATED (decl) = 1;
5049 else if (TYPE_P (*node))
5051 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5052 *node = build_type_copy (*node);
5053 TREE_DEPRECATED (*node) = 1;
5061 *no_add_attrs = true;
5062 if (type && TYPE_NAME (type))
5064 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5065 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5066 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5067 && DECL_NAME (TYPE_NAME (type)))
5068 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5071 warning ("`%s' attribute ignored for `%s'",
5072 IDENTIFIER_POINTER (name), what);
5074 warning ("`%s' attribute ignored",
5075 IDENTIFIER_POINTER (name));
5081 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5082 to prevent us from duplicating type nodes unnecessarily.
5083 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5084 since we want to distinguish types that are essentially identical (except
5085 for their debug representation), we use a local list here. */
5086 static GTY(()) tree vector_type_node_list = 0;
5088 /* Handle a "vector_size" attribute; arguments as in
5089 struct attribute_spec.handler. */
5092 handle_vector_size_attribute (tree *node, tree name, tree args,
5093 int flags ATTRIBUTE_UNUSED,
5096 unsigned HOST_WIDE_INT vecsize, nunits;
5097 enum machine_mode mode, orig_mode, new_mode;
5098 tree type = *node, new_type = NULL_TREE;
5099 tree type_list_node;
5101 *no_add_attrs = true;
5103 if (! host_integerp (TREE_VALUE (args), 1))
5105 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5109 /* Get the vector size (in bytes). */
5110 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5112 /* We need to provide for vector pointers, vector arrays, and
5113 functions returning vectors. For example:
5115 __attribute__((vector_size(16))) short *foo;
5117 In this case, the mode is SI, but the type being modified is
5118 HI, so we need to look further. */
5120 while (POINTER_TYPE_P (type)
5121 || TREE_CODE (type) == FUNCTION_TYPE
5122 || TREE_CODE (type) == ARRAY_TYPE)
5123 type = TREE_TYPE (type);
5125 /* Get the mode of the type being modified. */
5126 orig_mode = TYPE_MODE (type);
5128 if (TREE_CODE (type) == RECORD_TYPE
5129 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5130 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5131 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5133 error ("invalid vector type for attribute `%s'",
5134 IDENTIFIER_POINTER (name));
5138 /* Calculate how many units fit in the vector. */
5139 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5141 /* Find a suitably sized vector. */
5142 new_mode = VOIDmode;
5143 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5145 : MODE_VECTOR_FLOAT);
5147 mode = GET_MODE_WIDER_MODE (mode))
5148 if (vecsize == GET_MODE_SIZE (mode)
5149 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5155 if (new_mode == VOIDmode)
5157 error ("no vector mode with the size and type specified could be found");
5161 for (type_list_node = vector_type_node_list; type_list_node;
5162 type_list_node = TREE_CHAIN (type_list_node))
5164 tree other_type = TREE_VALUE (type_list_node);
5165 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5166 tree fields = TYPE_FIELDS (record);
5167 tree field_type = TREE_TYPE (fields);
5168 tree array_type = TREE_TYPE (field_type);
5169 if (TREE_CODE (fields) != FIELD_DECL
5170 || TREE_CODE (field_type) != ARRAY_TYPE)
5173 if (TYPE_MODE (other_type) == mode && type == array_type)
5175 new_type = other_type;
5180 if (new_type == NULL_TREE)
5182 tree index, array, rt, list_node;
5184 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5185 TREE_UNSIGNED (type));
5189 error ("no vector mode with the size and type specified could be found");
5193 new_type = build_type_copy (new_type);
5195 /* If this is a vector, make sure we either have hardware
5196 support, or we can emulate it. */
5197 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5198 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5199 && !vector_mode_valid_p (mode))
5201 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5205 /* Set the debug information here, because this is the only
5206 place where we know the underlying type for a vector made
5207 with vector_size. For debugging purposes we pretend a vector
5208 is an array within a structure. */
5209 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5210 array = build_array_type (type, build_index_type (index));
5211 rt = make_node (RECORD_TYPE);
5213 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5214 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5216 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5218 list_node = build_tree_list (NULL, new_type);
5219 TREE_CHAIN (list_node) = vector_type_node_list;
5220 vector_type_node_list = list_node;
5223 /* Build back pointers if needed. */
5224 *node = vector_size_helper (*node, new_type);
5229 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5232 If we requested a pointer to a vector, build up the pointers that
5233 we stripped off while looking for the inner type. Similarly for
5234 return values from functions.
5236 The argument "type" is the top of the chain, and "bottom" is the
5237 new type which we will point to. */
5240 vector_size_helper (tree type, tree bottom)
5244 if (POINTER_TYPE_P (type))
5246 inner = vector_size_helper (TREE_TYPE (type), bottom);
5247 outer = build_pointer_type (inner);
5249 else if (TREE_CODE (type) == ARRAY_TYPE)
5251 inner = vector_size_helper (TREE_TYPE (type), bottom);
5252 outer = build_array_type (inner, TYPE_VALUES (type));
5254 else if (TREE_CODE (type) == FUNCTION_TYPE)
5256 inner = vector_size_helper (TREE_TYPE (type), bottom);
5257 outer = build_function_type (inner, TYPE_VALUES (type));
5262 TREE_READONLY (outer) = TREE_READONLY (type);
5263 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5268 /* Handle the "nonnull" attribute. */
5270 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5271 tree args, int flags ATTRIBUTE_UNUSED,
5275 unsigned HOST_WIDE_INT attr_arg_num;
5277 /* If no arguments are specified, all pointer arguments should be
5278 non-null. Verify a full prototype is given so that the arguments
5279 will have the correct types when we actually check them later. */
5282 if (! TYPE_ARG_TYPES (type))
5284 error ("nonnull attribute without arguments on a non-prototype");
5285 *no_add_attrs = true;
5290 /* Argument list specified. Verify that each argument number references
5291 a pointer argument. */
5292 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5295 unsigned HOST_WIDE_INT arg_num, ck_num;
5297 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5299 error ("nonnull argument has invalid operand number (arg %lu)",
5300 (unsigned long) attr_arg_num);
5301 *no_add_attrs = true;
5305 argument = TYPE_ARG_TYPES (type);
5308 for (ck_num = 1; ; ck_num++)
5310 if (! argument || ck_num == arg_num)
5312 argument = TREE_CHAIN (argument);
5316 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5318 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5319 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5320 *no_add_attrs = true;
5324 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5326 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5327 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5328 *no_add_attrs = true;
5337 /* Check the argument list of a function call for null in argument slots
5338 that are marked as requiring a non-null pointer argument. */
5341 check_function_nonnull (tree attrs, tree params)
5343 tree a, args, param;
5346 for (a = attrs; a; a = TREE_CHAIN (a))
5348 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5350 args = TREE_VALUE (a);
5352 /* Walk the argument list. If we encounter an argument number we
5353 should check for non-null, do it. If the attribute has no args,
5354 then every pointer argument is checked (in which case the check
5355 for pointer type is done in check_nonnull_arg). */
5356 for (param = params, param_num = 1; ;
5357 param_num++, param = TREE_CHAIN (param))
5361 if (! args || nonnull_check_p (args, param_num))
5362 check_function_arguments_recurse (check_nonnull_arg, NULL,
5370 /* Helper for check_function_nonnull; given a list of operands which
5371 must be non-null in ARGS, determine if operand PARAM_NUM should be
5375 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5377 unsigned HOST_WIDE_INT arg_num;
5379 for (; args; args = TREE_CHAIN (args))
5381 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5384 if (arg_num == param_num)
5390 /* Check that the function argument PARAM (which is operand number
5391 PARAM_NUM) is non-null. This is called by check_function_nonnull
5392 via check_function_arguments_recurse. */
5395 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5396 unsigned HOST_WIDE_INT param_num)
5398 /* Just skip checking the argument if it's not a pointer. This can
5399 happen if the "nonnull" attribute was given without an operand
5400 list (which means to check every pointer argument). */
5402 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5405 if (integer_zerop (param))
5406 warning ("null argument where non-null required (arg %lu)",
5407 (unsigned long) param_num);
5410 /* Helper for nonnull attribute handling; fetch the operand number
5411 from the attribute argument list. */
5414 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5416 /* Strip any conversions from the arg number and verify they
5418 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5419 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5420 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5421 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5423 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5424 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5427 *valp = TREE_INT_CST_LOW (arg_num_expr);
5431 /* Handle a "nothrow" attribute; arguments as in
5432 struct attribute_spec.handler. */
5435 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5436 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5438 if (TREE_CODE (*node) == FUNCTION_DECL)
5439 TREE_NOTHROW (*node) = 1;
5440 /* ??? TODO: Support types. */
5443 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5444 *no_add_attrs = true;
5450 /* Handle a "cleanup" attribute; arguments as in
5451 struct attribute_spec.handler. */
5454 handle_cleanup_attribute (tree *node, tree name, tree args,
5455 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5458 tree cleanup_id, cleanup_decl;
5460 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5461 for global destructors in C++. This requires infrastructure that
5462 we don't have generically at the moment. It's also not a feature
5463 we'd be missing too much, since we do have attribute constructor. */
5464 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5466 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5467 *no_add_attrs = true;
5471 /* Verify that the argument is a function in scope. */
5472 /* ??? We could support pointers to functions here as well, if
5473 that was considered desirable. */
5474 cleanup_id = TREE_VALUE (args);
5475 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5477 error ("cleanup arg not an identifier");
5478 *no_add_attrs = true;
5481 cleanup_decl = lookup_name (cleanup_id);
5482 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5484 error ("cleanup arg not a function");
5485 *no_add_attrs = true;
5489 /* That the function has proper type is checked with the
5490 eventual call to build_function_call. */
5495 /* Check for valid arguments being passed to a function. */
5497 check_function_arguments (tree attrs, tree params)
5499 /* Check for null being passed in a pointer argument that must be
5500 non-null. We also need to do this if format checking is enabled. */
5503 check_function_nonnull (attrs, params);
5505 /* Check for errors in format strings. */
5508 check_function_format (NULL, attrs, params);
5511 /* Generic argument checking recursion routine. PARAM is the argument to
5512 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5513 once the argument is resolved. CTX is context for the callback. */
5515 check_function_arguments_recurse (void (*callback)
5516 (void *, tree, unsigned HOST_WIDE_INT),
5517 void *ctx, tree param,
5518 unsigned HOST_WIDE_INT param_num)
5520 if (TREE_CODE (param) == NOP_EXPR)
5522 /* Strip coercion. */
5523 check_function_arguments_recurse (callback, ctx,
5524 TREE_OPERAND (param, 0), param_num);
5528 if (TREE_CODE (param) == CALL_EXPR)
5530 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5532 bool found_format_arg = false;
5534 /* See if this is a call to a known internationalization function
5535 that modifies a format arg. Such a function may have multiple
5536 format_arg attributes (for example, ngettext). */
5538 for (attrs = TYPE_ATTRIBUTES (type);
5540 attrs = TREE_CHAIN (attrs))
5541 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5544 tree format_num_expr;
5548 /* Extract the argument number, which was previously checked
5550 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5551 while (TREE_CODE (format_num_expr) == NOP_EXPR
5552 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5553 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5554 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5556 if (TREE_CODE (format_num_expr) != INTEGER_CST
5557 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5560 format_num = TREE_INT_CST_LOW (format_num_expr);
5562 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5564 inner_args = TREE_CHAIN (inner_args), i++)
5565 if (i == format_num)
5567 check_function_arguments_recurse (callback, ctx,
5568 TREE_VALUE (inner_args),
5570 found_format_arg = true;
5575 /* If we found a format_arg attribute and did a recursive check,
5576 we are done with checking this argument. Otherwise, we continue
5577 and this will be considered a non-literal. */
5578 if (found_format_arg)
5582 if (TREE_CODE (param) == COND_EXPR)
5584 /* Check both halves of the conditional expression. */
5585 check_function_arguments_recurse (callback, ctx,
5586 TREE_OPERAND (param, 1), param_num);
5587 check_function_arguments_recurse (callback, ctx,
5588 TREE_OPERAND (param, 2), param_num);
5592 (*callback) (ctx, param, param_num);
5595 /* Function to help qsort sort FIELD_DECLs by name order. */
5598 field_decl_cmp (const void *x_p, const void *y_p)
5600 const tree *const x = x_p;
5601 const tree *const y = y_p;
5602 if (DECL_NAME (*x) == DECL_NAME (*y))
5603 /* A nontype is "greater" than a type. */
5604 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5605 if (DECL_NAME (*x) == NULL_TREE)
5607 if (DECL_NAME (*y) == NULL_TREE)
5609 if (DECL_NAME (*x) < DECL_NAME (*y))
5615 gt_pointer_operator new_value;
5619 /* This routine compares two fields like field_decl_cmp but using the
5620 pointer operator in resort_data. */
5623 resort_field_decl_cmp (const void *x_p, const void *y_p)
5625 const tree *const x = x_p;
5626 const tree *const y = y_p;
5628 if (DECL_NAME (*x) == DECL_NAME (*y))
5629 /* A nontype is "greater" than a type. */
5630 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5631 if (DECL_NAME (*x) == NULL_TREE)
5633 if (DECL_NAME (*y) == NULL_TREE)
5636 tree d1 = DECL_NAME (*x);
5637 tree d2 = DECL_NAME (*y);
5638 resort_data.new_value (&d1, resort_data.cookie);
5639 resort_data.new_value (&d2, resort_data.cookie);
5646 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5649 resort_sorted_fields (void *obj,
5650 void *orig_obj ATTRIBUTE_UNUSED ,
5651 gt_pointer_operator new_value,
5654 struct sorted_fields_type *sf = obj;
5655 resort_data.new_value = new_value;
5656 resort_data.cookie = cookie;
5657 qsort (&sf->elts[0], sf->len, sizeof (tree),
5658 resort_field_decl_cmp);
5661 /* Used by estimate_num_insns. Estimate number of instructions seen
5662 by given statement. */
5664 c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
5669 if (TYPE_P (x) || DECL_P (x))
5674 /* Assume that constants and references counts nothing. These should
5675 be majorized by amount of operations amoung them we count later
5676 and are common target of CSE and similar optimizations. */
5677 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
5678 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
5680 switch (TREE_CODE (x))
5682 /* Reconginze assignments of large structures and constructors of
5687 int size = int_size_in_bytes (TREE_TYPE (x));
5689 if (!size || size > MOVE_MAX_PIECES)
5692 *count += 2 * (size + MOVE_MAX - 1) / MOVE_MAX;
5696 /* Few special cases of expensive operations. This is usefull
5697 to avoid inlining on functions having too many of these. */
5698 case TRUNC_DIV_EXPR:
5700 case FLOOR_DIV_EXPR:
5701 case ROUND_DIV_EXPR:
5702 case TRUNC_MOD_EXPR:
5704 case FLOOR_MOD_EXPR:
5705 case ROUND_MOD_EXPR:
5710 /* Various containers that will produce no code themselves. */
5717 case IDENTIFIER_NODE:
5718 case PLACEHOLDER_EXPR:
5719 case WITH_CLEANUP_EXPR:
5720 case CLEANUP_POINT_EXPR:
5722 case VIEW_CONVERT_EXPR:
5728 case TRY_CATCH_EXPR:
5729 case TRY_FINALLY_EXPR:
5732 case LABELED_BLOCK_EXPR:
5733 case EXIT_BLOCK_EXPR:
5734 case EXPR_WITH_FILE_LOCATION:
5751 /* Do not account static initializers. */
5752 if (TREE_STATIC (TREE_OPERAND (x, 0)))
5761 /* Estimate number of instructions that will be created by expanding the body. */
5763 c_estimate_num_insns (tree decl)
5766 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl), c_estimate_num_insns_1, &num);
5770 #include "gt-c-common.h"