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 /* Switches common to the C front ends. */
193 /* Nonzero if prepreprocessing only. */
195 int flag_preprocess_only;
197 /* Nonzero means don't output line number information. */
199 char flag_no_line_commands;
201 /* Nonzero causes -E output not to be done, but directives such as
202 #define that have side effects are still obeyed. */
206 /* Nonzero means dump macros in some fashion. */
208 char flag_dump_macros;
210 /* Nonzero means pass #include lines through to the output. */
212 char flag_dump_includes;
214 /* The file name to which we should write a precompiled header, or
215 NULL if no header will be written in this compile. */
217 const char *pch_file;
219 /* Nonzero if an ISO standard was selected. It rejects macros in the
223 /* Nonzero if -undef was given. It suppresses target built-in macros
227 /* Nonzero means don't recognize the non-ANSI builtin functions. */
231 /* Nonzero means don't recognize the non-ANSI builtin functions.
234 int flag_no_nonansi_builtin;
236 /* Nonzero means give `double' the same size as `float'. */
238 int flag_short_double;
240 /* Nonzero means give `wchar_t' the same size as `short'. */
242 int flag_short_wchar;
244 /* Nonzero means allow Microsoft extensions without warnings or errors. */
245 int flag_ms_extensions;
247 /* Nonzero means don't recognize the keyword `asm'. */
251 /* Nonzero means give string constants the type `const char *', as mandated
254 int flag_const_strings;
256 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
258 int flag_signed_bitfields = 1;
259 int explicit_flag_signed_bitfields;
261 /* Nonzero means warn about pointer casts that can drop a type qualifier
262 from the pointer target type. */
266 /* Warn about functions which might be candidates for format attributes. */
268 int warn_missing_format_attribute;
270 /* Nonzero means warn about sizeof(function) or addition/subtraction
271 of function pointers. */
273 int warn_pointer_arith;
275 /* Nonzero means warn for any global function def
276 without separate previous prototype decl. */
278 int warn_missing_prototypes;
280 /* Warn if adding () is suggested. */
282 int warn_parentheses;
284 /* Warn if initializer is not completely bracketed. */
286 int warn_missing_braces;
288 /* Warn about comparison of signed and unsigned values.
289 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified
290 (in which case -Wextra gets to decide). */
292 int warn_sign_compare = -1;
294 /* Nonzero means warn about usage of long long when `-pedantic'. */
296 int warn_long_long = 1;
298 /* Nonzero means warn about deprecated conversion from string constant to
301 int warn_write_strings;
303 /* Nonzero means warn about multiple (redundant) decls for the same single
304 variable or function. */
306 int warn_redundant_decls;
308 /* Warn about testing equality of floating point numbers. */
310 int warn_float_equal;
312 /* Warn about a subscript that has type char. */
314 int warn_char_subscripts;
316 /* Warn if a type conversion is done that might have confusing results. */
320 /* Warn about #pragma directives that are not recognized. */
322 int warn_unknown_pragmas; /* Tri state variable. */
324 /* Warn about format/argument anomalies in calls to formatted I/O functions
325 (*printf, *scanf, strftime, strfmon, etc.). */
329 /* Warn about Y2K problems with strftime formats. */
333 /* Warn about excess arguments to formats. */
335 int warn_format_extra_args;
337 /* Warn about zero-length formats. */
339 int warn_format_zero_length;
341 /* Warn about non-literal format arguments. */
343 int warn_format_nonliteral;
345 /* Warn about possible security problems with calls to format functions. */
347 int warn_format_security;
350 /* C/ObjC language option variables. */
353 /* Nonzero means message about use of implicit function declarations;
354 1 means warning; 2 means error. */
356 int mesg_implicit_function_declaration = -1;
358 /* Nonzero means allow type mismatches in conditional expressions;
359 just make their values `void'. */
361 int flag_cond_mismatch;
363 /* Nonzero means enable C89 Amendment 1 features. */
367 /* Nonzero means use the ISO C99 dialect of C. */
371 /* Nonzero means that we have builtin functions, and main is an int */
375 /* Nonzero means warn when casting a function call to a type that does
376 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
377 when there is no previous declaration of sqrt or malloc. */
379 int warn_bad_function_cast;
381 /* Warn about traditional constructs whose meanings changed in ANSI C. */
383 int warn_traditional;
385 /* Nonzero means warn for a declaration found after a statement. */
387 int warn_declaration_after_statement;
389 /* Nonzero means warn for non-prototype function decls
390 or non-prototyped defs without previous prototype. */
392 int warn_strict_prototypes;
394 /* Nonzero means warn for any global function def
395 without separate previous decl. */
397 int warn_missing_declarations;
399 /* Nonzero means warn about declarations of objects not at
400 file-scope level and about *all* declarations of functions (whether
401 or static) not at file-scope level. Note that we exclude
402 implicit function declarations. To get warnings about those, use
405 int warn_nested_externs;
407 /* Warn if main is suspicious. */
411 /* Nonzero means warn about possible violations of sequence point rules. */
413 int warn_sequence_point;
415 /* Nonzero means warn about uninitialized variable when it is initialized with itself.
416 For example: int i = i;, GCC will not warn about this when warn_init_self is nonzero. */
420 /* Nonzero means to warn about compile-time division by zero. */
421 int warn_div_by_zero = 1;
423 /* Nonzero means warn about use of implicit int. */
425 int warn_implicit_int;
427 /* Warn about NULL being passed to argument slots marked as requiring
432 /* Warn about old-style parameter declaration. */
434 int warn_old_style_definition;
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 /* 0 means we want the preprocessor to not emit line directives for
572 the current working directory. 1 means we want it to do it. -1
573 means we should decide depending on whether debugging information
574 is being emitted or not. */
576 int flag_working_directory = -1;
578 /* Nonzero to use __cxa_atexit, rather than atexit, to register
579 destructors for local statics and global objects. */
581 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
583 /* Nonzero means make the default pedwarns warnings instead of errors.
584 The value of this flag is ignored if -pedantic is specified. */
588 /* Nonzero means to implement standard semantics for exception
589 specifications, calling unexpected if an exception is thrown that
590 doesn't match the specification. Zero means to treat them as
591 assertions and optimize accordingly, but not check them. */
593 int flag_enforce_eh_specs = 1;
595 /* The version of the C++ ABI in use. The following values are
598 0: The version of the ABI believed most conformant with the
599 C++ ABI specification. This ABI may change as bugs are
600 discovered and fixed. Therefore, 0 will not necessarily
601 indicate the same ABI in different versions of G++.
603 1: The version of the ABI first used in G++ 3.2.
605 Additional positive integers will be assigned as new versions of
606 the ABI become the default version of the ABI. */
608 int flag_abi_version = 1;
610 /* Nonzero means warn about things that will change when compiling
611 with an ABI-compliant compiler. */
615 /* Nonzero means warn about invalid uses of offsetof. */
617 int warn_invalid_offsetof = 1;
619 /* Nonzero means warn about implicit declarations. */
621 int warn_implicit = 1;
623 /* Nonzero means warn when all ctors or dtors are private, and the class
626 int warn_ctor_dtor_privacy = 0;
628 /* Nonzero means warn in function declared in derived class has the
629 same name as a virtual in the base class, but fails to match the
630 type signature of any virtual function in the base class. */
632 int warn_overloaded_virtual;
634 /* Nonzero means warn when declaring a class that has a non virtual
635 destructor, when it really ought to have a virtual one. */
639 /* Nonzero means warn when the compiler will reorder code. */
643 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
647 /* Nonzero means warn when we convert a pointer to member function
648 into a pointer to (void or function). */
650 int warn_pmf2ptr = 1;
652 /* Nonzero means warn about violation of some Effective C++ style rules. */
656 /* Nonzero means warn where overload resolution chooses a promotion from
657 unsigned to signed over a conversion to an unsigned of the same size. */
661 /* Nonzero means warn when an old-style cast is used. */
663 int warn_old_style_cast;
665 /* Nonzero means warn when non-templatized friend functions are
666 declared within a template */
668 int warn_nontemplate_friend = 1;
670 /* Nonzero means complain about deprecated features. */
672 int warn_deprecated = 1;
674 /* Maximum template instantiation depth. This limit is rather
675 arbitrary, but it exists to limit the time it takes to notice
676 infinite template instantiations. */
678 int max_tinst_depth = 500;
682 /* The elements of `ridpointers' are identifier nodes for the reserved
683 type names and storage classes. It is indexed by a RID_... value. */
686 tree (*make_fname_decl) (tree, int);
688 /* If non-NULL, the address of a language-specific function that takes
689 any action required right before expand_function_end is called. */
690 void (*lang_expand_function_end) (void);
692 /* Nonzero means the expression being parsed will never be evaluated.
693 This is a count, since unevaluated expressions can nest. */
696 /* Information about how a function name is generated. */
699 tree *const decl; /* pointer to the VAR_DECL. */
700 const unsigned rid; /* RID number for the identifier. */
701 const int pretty; /* How pretty is it? */
704 /* The three ways of getting then name of the current function. */
706 const struct fname_var_t fname_vars[] =
708 /* C99 compliant __func__, must be first. */
709 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
710 /* GCC __FUNCTION__ compliant. */
711 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
712 /* GCC __PRETTY_FUNCTION__ compliant. */
713 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
717 static int constant_fits_type_p (tree, tree);
719 /* Keep a stack of if statements. We record the number of compound
720 statements seen up to the if keyword, as well as the line number
721 and file of the if. If a potentially ambiguous else is seen, that
722 fact is recorded; the warning is issued when we can be sure that
723 the enclosing if statement does not have an else branch. */
732 static if_elt *if_stack;
734 /* Amount of space in the if statement stack. */
735 static int if_stack_space = 0;
738 static int if_stack_pointer = 0;
740 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
741 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
742 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
743 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
744 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
745 static tree handle_always_inline_attribute (tree *, tree, tree, int,
747 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
748 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
749 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
750 static tree handle_transparent_union_attribute (tree *, tree, tree,
752 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
753 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
754 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
755 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
756 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
757 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
758 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
759 static tree handle_visibility_attribute (tree *, tree, tree, int,
761 static tree handle_tls_model_attribute (tree *, tree, tree, int,
763 static tree handle_no_instrument_function_attribute (tree *, tree,
765 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
766 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
768 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
769 static tree handle_deprecated_attribute (tree *, tree, tree, int,
771 static tree handle_vector_size_attribute (tree *, tree, tree, int,
773 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
774 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
775 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
776 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
778 static tree vector_size_helper (tree, tree);
780 static void check_function_nonnull (tree, tree);
781 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
782 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
783 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
784 static int resort_field_decl_cmp (const void *, const void *);
786 /* Table of machine-independent attributes common to all C-like languages. */
787 const struct attribute_spec c_common_attribute_table[] =
789 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
790 { "packed", 0, 0, false, false, false,
791 handle_packed_attribute },
792 { "nocommon", 0, 0, true, false, false,
793 handle_nocommon_attribute },
794 { "common", 0, 0, true, false, false,
795 handle_common_attribute },
796 /* FIXME: logically, noreturn attributes should be listed as
797 "false, true, true" and apply to function types. But implementing this
798 would require all the places in the compiler that use TREE_THIS_VOLATILE
799 on a decl to identify non-returning functions to be located and fixed
800 to check the function type instead. */
801 { "noreturn", 0, 0, true, false, false,
802 handle_noreturn_attribute },
803 { "volatile", 0, 0, true, false, false,
804 handle_noreturn_attribute },
805 { "noinline", 0, 0, true, false, false,
806 handle_noinline_attribute },
807 { "always_inline", 0, 0, true, false, false,
808 handle_always_inline_attribute },
809 { "used", 0, 0, true, false, false,
810 handle_used_attribute },
811 { "unused", 0, 0, false, false, false,
812 handle_unused_attribute },
813 /* The same comments as for noreturn attributes apply to const ones. */
814 { "const", 0, 0, true, false, false,
815 handle_const_attribute },
816 { "transparent_union", 0, 0, false, false, false,
817 handle_transparent_union_attribute },
818 { "constructor", 0, 0, true, false, false,
819 handle_constructor_attribute },
820 { "destructor", 0, 0, true, false, false,
821 handle_destructor_attribute },
822 { "mode", 1, 1, false, true, false,
823 handle_mode_attribute },
824 { "section", 1, 1, true, false, false,
825 handle_section_attribute },
826 { "aligned", 0, 1, false, false, false,
827 handle_aligned_attribute },
828 { "weak", 0, 0, true, false, false,
829 handle_weak_attribute },
830 { "alias", 1, 1, true, false, false,
831 handle_alias_attribute },
832 { "no_instrument_function", 0, 0, true, false, false,
833 handle_no_instrument_function_attribute },
834 { "malloc", 0, 0, true, false, false,
835 handle_malloc_attribute },
836 { "no_stack_limit", 0, 0, true, false, false,
837 handle_no_limit_stack_attribute },
838 { "pure", 0, 0, true, false, false,
839 handle_pure_attribute },
840 { "deprecated", 0, 0, false, false, false,
841 handle_deprecated_attribute },
842 { "vector_size", 1, 1, false, true, false,
843 handle_vector_size_attribute },
844 { "visibility", 1, 1, true, false, false,
845 handle_visibility_attribute },
846 { "tls_model", 1, 1, true, false, false,
847 handle_tls_model_attribute },
848 { "nonnull", 0, -1, false, true, true,
849 handle_nonnull_attribute },
850 { "nothrow", 0, 0, true, false, false,
851 handle_nothrow_attribute },
852 { "may_alias", 0, 0, false, true, false, NULL },
853 { "cleanup", 1, 1, true, false, false,
854 handle_cleanup_attribute },
855 { "warn_unused_result", 0, 0, false, true, true,
856 handle_warn_unused_result_attribute },
857 { NULL, 0, 0, false, false, false, NULL }
860 /* Give the specifications for the format attributes, used by C and all
863 const struct attribute_spec c_common_format_attribute_table[] =
865 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
866 { "format", 3, 3, false, true, true,
867 handle_format_attribute },
868 { "format_arg", 1, 1, false, true, true,
869 handle_format_arg_attribute },
870 { NULL, 0, 0, false, false, false, NULL }
873 /* Record the start of an if-then, and record the start of it
874 for ambiguous else detection.
876 COND is the condition for the if-then statement.
878 IF_STMT is the statement node that has already been created for
879 this if-then statement. It is created before parsing the
880 condition to keep line number information accurate. */
883 c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
885 /* Make sure there is enough space on the stack. */
886 if (if_stack_space == 0)
889 if_stack = xmalloc (10 * sizeof (if_elt));
891 else if (if_stack_space == if_stack_pointer)
893 if_stack_space += 10;
894 if_stack = xrealloc (if_stack, if_stack_space * sizeof (if_elt));
897 IF_COND (if_stmt) = cond;
900 /* Record this if statement. */
901 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
902 if_stack[if_stack_pointer].locus = input_location;
903 if_stack[if_stack_pointer].needs_warning = 0;
904 if_stack[if_stack_pointer].if_stmt = if_stmt;
908 /* Called after the then-clause for an if-statement is processed. */
913 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
914 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
917 /* Record the end of an if-then. Optionally warn if a nested
918 if statement had an ambiguous else clause. */
921 c_expand_end_cond (void)
924 if (if_stack[if_stack_pointer].needs_warning)
925 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
926 &if_stack[if_stack_pointer].locus);
927 last_expr_type = NULL_TREE;
930 /* Called between the then-clause and the else-clause
931 of an if-then-else. */
934 c_expand_start_else (void)
936 /* An ambiguous else warning must be generated for the enclosing if
937 statement, unless we see an else branch for that one, too. */
939 && if_stack_pointer > 1
940 && (if_stack[if_stack_pointer - 1].compstmt_count
941 == if_stack[if_stack_pointer - 2].compstmt_count))
942 if_stack[if_stack_pointer - 2].needs_warning = 1;
944 /* Even if a nested if statement had an else branch, it can't be
945 ambiguous if this one also has an else. So don't warn in that
946 case. Also don't warn for any if statements nested in this else. */
947 if_stack[if_stack_pointer - 1].needs_warning = 0;
948 if_stack[if_stack_pointer - 1].compstmt_count--;
951 /* Called after the else-clause for an if-statement is processed. */
956 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
957 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
960 /* Begin an if-statement. Returns a newly created IF_STMT if
963 Unlike the C++ front-end, we do not call add_stmt here; it is
964 probably safe to do so, but I am not very familiar with this
965 code so I am being extra careful not to change its behavior
966 beyond what is strictly necessary for correctness. */
969 c_begin_if_stmt (void)
972 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
976 /* Begin a while statement. Returns a newly created WHILE_STMT if
979 Unlike the C++ front-end, we do not call add_stmt here; it is
980 probably safe to do so, but I am not very familiar with this
981 code so I am being extra careful not to change its behavior
982 beyond what is strictly necessary for correctness. */
985 c_begin_while_stmt (void)
988 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
993 c_finish_while_stmt_cond (tree cond, tree while_stmt)
995 WHILE_COND (while_stmt) = cond;
998 /* Push current bindings for the function name VAR_DECLS. */
1001 start_fname_decls (void)
1004 tree saved = NULL_TREE;
1006 for (ix = 0; fname_vars[ix].decl; ix++)
1008 tree decl = *fname_vars[ix].decl;
1012 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
1013 *fname_vars[ix].decl = NULL_TREE;
1016 if (saved || saved_function_name_decls)
1017 /* Normally they'll have been NULL, so only push if we've got a
1018 stack, or they are non-NULL. */
1019 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1020 saved_function_name_decls);
1023 /* Finish up the current bindings, adding them into the
1024 current function's statement tree. This is done by wrapping the
1025 function's body in a COMPOUND_STMT containing these decls too. This
1026 must be done _before_ finish_stmt_tree is called. If there is no
1027 current function, we must be at file scope and no statements are
1028 involved. Pop the previous bindings. */
1031 finish_fname_decls (void)
1034 tree body = NULL_TREE;
1035 tree stack = saved_function_name_decls;
1037 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1038 body = chainon (TREE_VALUE (stack), body);
1042 /* They were called into existence, so add to statement tree. Add
1043 the DECL_STMTs inside the outermost scope. */
1044 tree *p = &DECL_SAVED_TREE (current_function_decl);
1045 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1046 while (TREE_CODE (*p) != COMPOUND_STMT)
1047 p = &TREE_CHAIN (*p);
1048 p = &COMPOUND_BODY (*p);
1049 if (TREE_CODE (*p) == SCOPE_STMT)
1050 p = &TREE_CHAIN (*p);
1052 body = chainon (body, *p);
1056 for (ix = 0; fname_vars[ix].decl; ix++)
1057 *fname_vars[ix].decl = NULL_TREE;
1061 /* We had saved values, restore them. */
1064 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1066 tree decl = TREE_PURPOSE (saved);
1067 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1069 *fname_vars[ix].decl = decl;
1071 stack = TREE_CHAIN (stack);
1073 saved_function_name_decls = stack;
1076 /* Return the text name of the current function, suitably prettified
1080 fname_as_string (int pretty_p)
1082 const char *name = "top level";
1091 if (current_function_decl)
1092 name = (*lang_hooks.decl_printable_name) (current_function_decl, vrb);
1097 /* Return the VAR_DECL for a const char array naming the current
1098 function. If the VAR_DECL has not yet been created, create it
1099 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1100 ID is its name (unfortunately C and C++ hold the RID values of
1101 keywords in different places, so we can't derive RID from ID in
1102 this language independent code. */
1105 fname_decl (unsigned int rid, tree id)
1108 tree decl = NULL_TREE;
1110 for (ix = 0; fname_vars[ix].decl; ix++)
1111 if (fname_vars[ix].rid == rid)
1114 decl = *fname_vars[ix].decl;
1117 tree saved_last_tree = last_tree;
1118 /* If a tree is built here, it would normally have the lineno of
1119 the current statement. Later this tree will be moved to the
1120 beginning of the function and this line number will be wrong.
1121 To avoid this problem set the lineno to 0 here; that prevents
1122 it from appearing in the RTL. */
1123 int saved_lineno = input_line;
1126 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1127 if (last_tree != saved_last_tree)
1129 /* We created some statement tree for the decl. This belongs
1130 at the start of the function, so remove it now and reinsert
1131 it after the function is complete. */
1132 tree stmts = TREE_CHAIN (saved_last_tree);
1134 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1135 last_tree = saved_last_tree;
1136 saved_function_name_decls = tree_cons (decl, stmts,
1137 saved_function_name_decls);
1139 *fname_vars[ix].decl = decl;
1140 input_line = saved_lineno;
1142 if (!ix && !current_function_decl)
1143 pedwarn ("%J'%D' is not defined outside of function scope", decl, decl);
1148 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1151 fix_string_type (tree value)
1153 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1154 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1155 const int nchars_max = flag_isoc99 ? 4095 : 509;
1156 int length = TREE_STRING_LENGTH (value);
1159 /* Compute the number of elements, for the array type. */
1160 nchars = wide_flag ? length / wchar_bytes : length;
1162 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1163 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1164 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1166 /* Create the array type for the string constant.
1167 -Wwrite-strings says make the string constant an array of const char
1168 so that copying it to a non-const pointer will get a warning.
1169 For C++, this is the standard behavior. */
1170 if (flag_const_strings && ! flag_writable_strings)
1173 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1176 = build_array_type (elements,
1177 build_index_type (build_int_2 (nchars - 1, 0)));
1181 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1182 build_index_type (build_int_2 (nchars - 1, 0)));
1184 TREE_CONSTANT (value) = 1;
1185 TREE_READONLY (value) = ! flag_writable_strings;
1186 TREE_STATIC (value) = 1;
1190 /* Print a warning if a constant expression had overflow in folding.
1191 Invoke this function on every expression that the language
1192 requires to be a constant expression.
1193 Note the ANSI C standard says it is erroneous for a
1194 constant expression to overflow. */
1197 constant_expression_warning (tree value)
1199 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1200 || TREE_CODE (value) == VECTOR_CST
1201 || TREE_CODE (value) == COMPLEX_CST)
1202 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1203 pedwarn ("overflow in constant expression");
1206 /* Print a warning if an expression had overflow in folding.
1207 Invoke this function on every expression that
1208 (1) appears in the source code, and
1209 (2) might be a constant expression that overflowed, and
1210 (3) is not already checked by convert_and_check;
1211 however, do not invoke this function on operands of explicit casts. */
1214 overflow_warning (tree value)
1216 if ((TREE_CODE (value) == INTEGER_CST
1217 || (TREE_CODE (value) == COMPLEX_CST
1218 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1219 && TREE_OVERFLOW (value))
1221 TREE_OVERFLOW (value) = 0;
1222 if (skip_evaluation == 0)
1223 warning ("integer overflow in expression");
1225 else if ((TREE_CODE (value) == REAL_CST
1226 || (TREE_CODE (value) == COMPLEX_CST
1227 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1228 && TREE_OVERFLOW (value))
1230 TREE_OVERFLOW (value) = 0;
1231 if (skip_evaluation == 0)
1232 warning ("floating point overflow in expression");
1234 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1236 TREE_OVERFLOW (value) = 0;
1237 if (skip_evaluation == 0)
1238 warning ("vector overflow in expression");
1242 /* Print a warning if a large constant is truncated to unsigned,
1243 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1244 Invoke this function on every expression that might be implicitly
1245 converted to an unsigned type. */
1248 unsigned_conversion_warning (tree result, tree operand)
1250 tree type = TREE_TYPE (result);
1252 if (TREE_CODE (operand) == INTEGER_CST
1253 && TREE_CODE (type) == INTEGER_TYPE
1254 && TREE_UNSIGNED (type)
1255 && skip_evaluation == 0
1256 && !int_fits_type_p (operand, type))
1258 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1259 /* This detects cases like converting -129 or 256 to unsigned char. */
1260 warning ("large integer implicitly truncated to unsigned type");
1261 else if (warn_conversion)
1262 warning ("negative integer implicitly converted to unsigned type");
1266 /* Nonzero if constant C has a value that is permissible
1267 for type TYPE (an INTEGER_TYPE). */
1270 constant_fits_type_p (tree c, tree type)
1272 if (TREE_CODE (c) == INTEGER_CST)
1273 return int_fits_type_p (c, type);
1275 c = convert (type, c);
1276 return !TREE_OVERFLOW (c);
1279 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1280 Invoke this function on every expression that is converted implicitly,
1281 i.e. because of language rules and not because of an explicit cast. */
1284 convert_and_check (tree type, tree expr)
1286 tree t = convert (type, expr);
1287 if (TREE_CODE (t) == INTEGER_CST)
1289 if (TREE_OVERFLOW (t))
1291 TREE_OVERFLOW (t) = 0;
1293 /* Do not diagnose overflow in a constant expression merely
1294 because a conversion overflowed. */
1295 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1297 /* No warning for converting 0x80000000 to int. */
1298 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1299 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1300 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1301 /* If EXPR fits in the unsigned version of TYPE,
1302 don't warn unless pedantic. */
1304 || TREE_UNSIGNED (type)
1305 || ! constant_fits_type_p (expr,
1306 c_common_unsigned_type (type)))
1307 && skip_evaluation == 0)
1308 warning ("overflow in implicit constant conversion");
1311 unsigned_conversion_warning (t, expr);
1316 /* A node in a list that describes references to variables (EXPR), which are
1317 either read accesses if WRITER is zero, or write accesses, in which case
1318 WRITER is the parent of EXPR. */
1325 /* Used to implement a cache the results of a call to verify_tree. We only
1326 use this for SAVE_EXPRs. */
1329 struct tlist_cache *next;
1330 struct tlist *cache_before_sp;
1331 struct tlist *cache_after_sp;
1335 /* Obstack to use when allocating tlist structures, and corresponding
1337 static struct obstack tlist_obstack;
1338 static char *tlist_firstobj = 0;
1340 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1342 static struct tlist *warned_ids;
1343 /* SAVE_EXPRs need special treatment. We process them only once and then
1344 cache the results. */
1345 static struct tlist_cache *save_expr_cache;
1347 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1348 static void merge_tlist (struct tlist **, struct tlist *, int);
1349 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1350 static int warning_candidate_p (tree);
1351 static void warn_for_collisions (struct tlist *);
1352 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1353 static struct tlist *new_tlist (struct tlist *, tree, tree);
1354 static void verify_sequence_points (tree);
1356 /* Create a new struct tlist and fill in its fields. */
1357 static struct tlist *
1358 new_tlist (struct tlist *next, tree t, tree writer)
1361 l = obstack_alloc (&tlist_obstack, sizeof *l);
1368 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1369 is nonnull, we ignore any node we find which has a writer equal to it. */
1372 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1376 struct tlist *next = add->next;
1379 if (! exclude_writer || add->writer != exclude_writer)
1380 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1385 /* Merge the nodes of ADD into TO. This merging process is done so that for
1386 each variable that already exists in TO, no new node is added; however if
1387 there is a write access recorded in ADD, and an occurrence on TO is only
1388 a read access, then the occurrence in TO will be modified to record the
1392 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1394 struct tlist **end = to;
1397 end = &(*end)->next;
1403 struct tlist *next = add->next;
1405 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1406 if (tmp2->expr == add->expr)
1410 tmp2->writer = add->writer;
1414 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1415 end = &(*end)->next;
1422 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1423 references in list LIST conflict with it, excluding reads if ONLY writers
1427 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1432 /* Avoid duplicate warnings. */
1433 for (tmp = warned_ids; tmp; tmp = tmp->next)
1434 if (tmp->expr == written)
1439 if (list->expr == written
1440 && list->writer != writer
1441 && (! only_writes || list->writer))
1443 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1444 warning ("operation on `%s' may be undefined",
1445 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1451 /* Given a list LIST of references to variables, find whether any of these
1452 can cause conflicts due to missing sequence points. */
1455 warn_for_collisions (struct tlist *list)
1459 for (tmp = list; tmp; tmp = tmp->next)
1462 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1466 /* Return nonzero if X is a tree that can be verified by the sequence point
1469 warning_candidate_p (tree x)
1471 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1474 /* Walk the tree X, and record accesses to variables. If X is written by the
1475 parent tree, WRITER is the parent.
1476 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1477 expression or its only operand forces a sequence point, then everything up
1478 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1480 Once we return, we will have emitted warnings if any subexpression before
1481 such a sequence point could be undefined. On a higher level, however, the
1482 sequence point may not be relevant, and we'll merge the two lists.
1484 Example: (b++, a) + b;
1485 The call that processes the COMPOUND_EXPR will store the increment of B
1486 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1487 processes the PLUS_EXPR will need to merge the two lists so that
1488 eventually, all accesses end up on the same list (and we'll warn about the
1489 unordered subexpressions b++ and b.
1491 A note on merging. If we modify the former example so that our expression
1494 care must be taken not simply to add all three expressions into the final
1495 PNO_SP list. The function merge_tlist takes care of that by merging the
1496 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1497 way, so that no more than one access to B is recorded. */
1500 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1503 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1504 enum tree_code code;
1507 /* X may be NULL if it is the operand of an empty statement expression
1513 code = TREE_CODE (x);
1514 class = TREE_CODE_CLASS (code);
1516 if (warning_candidate_p (x))
1518 *pno_sp = new_tlist (*pno_sp, x, writer);
1528 case TRUTH_ANDIF_EXPR:
1529 case TRUTH_ORIF_EXPR:
1530 tmp_before = tmp_nosp = tmp_list3 = 0;
1531 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1532 warn_for_collisions (tmp_nosp);
1533 merge_tlist (pbefore_sp, tmp_before, 0);
1534 merge_tlist (pbefore_sp, tmp_nosp, 0);
1535 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1536 merge_tlist (pbefore_sp, tmp_list3, 0);
1540 tmp_before = tmp_list2 = 0;
1541 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1542 warn_for_collisions (tmp_list2);
1543 merge_tlist (pbefore_sp, tmp_before, 0);
1544 merge_tlist (pbefore_sp, tmp_list2, 1);
1546 tmp_list3 = tmp_nosp = 0;
1547 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1548 warn_for_collisions (tmp_nosp);
1549 merge_tlist (pbefore_sp, tmp_list3, 0);
1551 tmp_list3 = tmp_list2 = 0;
1552 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1553 warn_for_collisions (tmp_list2);
1554 merge_tlist (pbefore_sp, tmp_list3, 0);
1555 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1556 two first, to avoid warning for (a ? b++ : b++). */
1557 merge_tlist (&tmp_nosp, tmp_list2, 0);
1558 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1561 case PREDECREMENT_EXPR:
1562 case PREINCREMENT_EXPR:
1563 case POSTDECREMENT_EXPR:
1564 case POSTINCREMENT_EXPR:
1565 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1569 tmp_before = tmp_nosp = tmp_list3 = 0;
1570 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1571 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1572 /* Expressions inside the LHS are not ordered wrt. the sequence points
1573 in the RHS. Example:
1575 Despite the fact that the modification of "a" is in the before_sp
1576 list (tmp_before), it conflicts with the use of "a" in the LHS.
1577 We can handle this by adding the contents of tmp_list3
1578 to those of tmp_before, and redoing the collision warnings for that
1580 add_tlist (&tmp_before, tmp_list3, x, 1);
1581 warn_for_collisions (tmp_before);
1582 /* Exclude the LHS itself here; we first have to merge it into the
1583 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1584 didn't exclude the LHS, we'd get it twice, once as a read and once
1586 add_tlist (pno_sp, tmp_list3, x, 0);
1587 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1589 merge_tlist (pbefore_sp, tmp_before, 0);
1590 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1591 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1592 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1596 /* We need to warn about conflicts among arguments and conflicts between
1597 args and the function address. Side effects of the function address,
1598 however, are not ordered by the sequence point of the call. */
1599 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1600 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1601 if (TREE_OPERAND (x, 1))
1602 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1603 merge_tlist (&tmp_list3, tmp_list2, 0);
1604 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1605 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1606 warn_for_collisions (tmp_before);
1607 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1611 /* Scan all the list, e.g. indices of multi dimensional array. */
1614 tmp_before = tmp_nosp = 0;
1615 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1616 merge_tlist (&tmp_nosp, tmp_before, 0);
1617 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1624 struct tlist_cache *t;
1625 for (t = save_expr_cache; t; t = t->next)
1631 t = obstack_alloc (&tlist_obstack, sizeof *t);
1632 t->next = save_expr_cache;
1634 save_expr_cache = t;
1636 tmp_before = tmp_nosp = 0;
1637 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1638 warn_for_collisions (tmp_nosp);
1643 struct tlist *t = tmp_nosp;
1645 merge_tlist (&tmp_list3, t, 0);
1647 t->cache_before_sp = tmp_before;
1648 t->cache_after_sp = tmp_list3;
1650 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1651 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1660 if (first_rtl_op (code) == 0)
1662 x = TREE_OPERAND (x, 0);
1678 int max = first_rtl_op (TREE_CODE (x));
1679 for (lp = 0; lp < max; lp++)
1681 tmp_before = tmp_nosp = 0;
1682 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1683 merge_tlist (&tmp_nosp, tmp_before, 0);
1684 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1691 /* Try to warn for undefined behavior in EXPR due to missing sequence
1695 verify_sequence_points (tree expr)
1697 struct tlist *before_sp = 0, *after_sp = 0;
1700 save_expr_cache = 0;
1701 if (tlist_firstobj == 0)
1703 gcc_obstack_init (&tlist_obstack);
1704 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1707 verify_tree (expr, &before_sp, &after_sp, 0);
1708 warn_for_collisions (after_sp);
1709 obstack_free (&tlist_obstack, tlist_firstobj);
1713 c_expand_expr_stmt (tree expr)
1715 /* Do default conversion if safe and possibly important,
1716 in case within ({...}). */
1717 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1718 && (flag_isoc99 || lvalue_p (expr)))
1719 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1720 expr = default_conversion (expr);
1722 if (warn_sequence_point)
1723 verify_sequence_points (expr);
1725 if (TREE_TYPE (expr) != error_mark_node
1726 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1727 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1728 error ("expression statement has incomplete type");
1730 last_expr_type = TREE_TYPE (expr);
1731 return add_stmt (build_stmt (EXPR_STMT, expr));
1734 /* Validate the expression after `case' and apply default promotions. */
1737 check_case_value (tree value)
1739 if (value == NULL_TREE)
1742 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1743 STRIP_TYPE_NOPS (value);
1744 /* In C++, the following is allowed:
1747 switch (...) { case i: ... }
1749 So, we try to reduce the VALUE to a constant that way. */
1750 if (c_dialect_cxx ())
1752 value = decl_constant_value (value);
1753 STRIP_TYPE_NOPS (value);
1754 value = fold (value);
1757 if (TREE_CODE (value) != INTEGER_CST
1758 && value != error_mark_node)
1760 error ("case label does not reduce to an integer constant");
1761 value = error_mark_node;
1764 /* Promote char or short to int. */
1765 value = default_conversion (value);
1767 constant_expression_warning (value);
1772 /* Return an integer type with BITS bits of precision,
1773 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1776 c_common_type_for_size (unsigned int bits, int unsignedp)
1778 if (bits == TYPE_PRECISION (integer_type_node))
1779 return unsignedp ? unsigned_type_node : integer_type_node;
1781 if (bits == TYPE_PRECISION (signed_char_type_node))
1782 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1784 if (bits == TYPE_PRECISION (short_integer_type_node))
1785 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1787 if (bits == TYPE_PRECISION (long_integer_type_node))
1788 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1790 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1791 return (unsignedp ? long_long_unsigned_type_node
1792 : long_long_integer_type_node);
1794 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1795 return (unsignedp ? widest_unsigned_literal_type_node
1796 : widest_integer_literal_type_node);
1798 if (bits <= TYPE_PRECISION (intQI_type_node))
1799 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1801 if (bits <= TYPE_PRECISION (intHI_type_node))
1802 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1804 if (bits <= TYPE_PRECISION (intSI_type_node))
1805 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1807 if (bits <= TYPE_PRECISION (intDI_type_node))
1808 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1813 /* Return a data type that has machine mode MODE.
1814 If the mode is an integer,
1815 then UNSIGNEDP selects between signed and unsigned types. */
1818 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1820 if (mode == TYPE_MODE (integer_type_node))
1821 return unsignedp ? unsigned_type_node : integer_type_node;
1823 if (mode == TYPE_MODE (signed_char_type_node))
1824 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1826 if (mode == TYPE_MODE (short_integer_type_node))
1827 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1829 if (mode == TYPE_MODE (long_integer_type_node))
1830 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1832 if (mode == TYPE_MODE (long_long_integer_type_node))
1833 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1835 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1836 return unsignedp ? widest_unsigned_literal_type_node
1837 : widest_integer_literal_type_node;
1840 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1843 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1846 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1849 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1851 #if HOST_BITS_PER_WIDE_INT >= 64
1852 if (mode == TYPE_MODE (intTI_type_node))
1853 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1856 if (mode == TYPE_MODE (float_type_node))
1857 return float_type_node;
1859 if (mode == TYPE_MODE (double_type_node))
1860 return double_type_node;
1862 if (mode == TYPE_MODE (long_double_type_node))
1863 return long_double_type_node;
1865 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1866 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1868 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1869 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1874 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1876 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1878 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
1880 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
1882 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
1884 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
1886 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
1888 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
1890 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
1892 return V16SF_type_node;
1894 return V4SF_type_node;
1896 return V2SF_type_node;
1898 return V2DF_type_node;
1900 return V4DF_type_node;
1908 /* Return an unsigned type the same as TYPE in other respects. */
1910 c_common_unsigned_type (tree type)
1912 tree type1 = TYPE_MAIN_VARIANT (type);
1913 if (type1 == signed_char_type_node || type1 == char_type_node)
1914 return unsigned_char_type_node;
1915 if (type1 == integer_type_node)
1916 return unsigned_type_node;
1917 if (type1 == short_integer_type_node)
1918 return short_unsigned_type_node;
1919 if (type1 == long_integer_type_node)
1920 return long_unsigned_type_node;
1921 if (type1 == long_long_integer_type_node)
1922 return long_long_unsigned_type_node;
1923 if (type1 == widest_integer_literal_type_node)
1924 return widest_unsigned_literal_type_node;
1925 #if HOST_BITS_PER_WIDE_INT >= 64
1926 if (type1 == intTI_type_node)
1927 return unsigned_intTI_type_node;
1929 if (type1 == intDI_type_node)
1930 return unsigned_intDI_type_node;
1931 if (type1 == intSI_type_node)
1932 return unsigned_intSI_type_node;
1933 if (type1 == intHI_type_node)
1934 return unsigned_intHI_type_node;
1935 if (type1 == intQI_type_node)
1936 return unsigned_intQI_type_node;
1938 return c_common_signed_or_unsigned_type (1, type);
1941 /* Return a signed type the same as TYPE in other respects. */
1944 c_common_signed_type (tree type)
1946 tree type1 = TYPE_MAIN_VARIANT (type);
1947 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1948 return signed_char_type_node;
1949 if (type1 == unsigned_type_node)
1950 return integer_type_node;
1951 if (type1 == short_unsigned_type_node)
1952 return short_integer_type_node;
1953 if (type1 == long_unsigned_type_node)
1954 return long_integer_type_node;
1955 if (type1 == long_long_unsigned_type_node)
1956 return long_long_integer_type_node;
1957 if (type1 == widest_unsigned_literal_type_node)
1958 return widest_integer_literal_type_node;
1959 #if HOST_BITS_PER_WIDE_INT >= 64
1960 if (type1 == unsigned_intTI_type_node)
1961 return intTI_type_node;
1963 if (type1 == unsigned_intDI_type_node)
1964 return intDI_type_node;
1965 if (type1 == unsigned_intSI_type_node)
1966 return intSI_type_node;
1967 if (type1 == unsigned_intHI_type_node)
1968 return intHI_type_node;
1969 if (type1 == unsigned_intQI_type_node)
1970 return intQI_type_node;
1972 return c_common_signed_or_unsigned_type (0, type);
1975 /* Return a type the same as TYPE except unsigned or
1976 signed according to UNSIGNEDP. */
1979 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1981 if (! INTEGRAL_TYPE_P (type)
1982 || TREE_UNSIGNED (type) == unsignedp)
1985 /* Must check the mode of the types, not the precision. Enumeral types
1986 in C++ have precision set to match their range, but may use a wider
1987 mode to match an ABI. If we change modes, we may wind up with bad
1990 if (TYPE_MODE (type) == TYPE_MODE (signed_char_type_node))
1991 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1992 if (TYPE_MODE (type) == TYPE_MODE (integer_type_node))
1993 return unsignedp ? unsigned_type_node : integer_type_node;
1994 if (TYPE_MODE (type) == TYPE_MODE (short_integer_type_node))
1995 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1996 if (TYPE_MODE (type) == TYPE_MODE (long_integer_type_node))
1997 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1998 if (TYPE_MODE (type) == TYPE_MODE (long_long_integer_type_node))
1999 return (unsignedp ? long_long_unsigned_type_node
2000 : long_long_integer_type_node);
2001 if (TYPE_MODE (type) == TYPE_MODE (widest_integer_literal_type_node))
2002 return (unsignedp ? widest_unsigned_literal_type_node
2003 : widest_integer_literal_type_node);
2005 #if HOST_BITS_PER_WIDE_INT >= 64
2006 if (TYPE_MODE (type) == TYPE_MODE (intTI_type_node))
2007 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2009 if (TYPE_MODE (type) == TYPE_MODE (intDI_type_node))
2010 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2011 if (TYPE_MODE (type) == TYPE_MODE (intSI_type_node))
2012 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2013 if (TYPE_MODE (type) == TYPE_MODE (intHI_type_node))
2014 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2015 if (TYPE_MODE (type) == TYPE_MODE (intQI_type_node))
2016 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2021 /* The C version of the register_builtin_type langhook. */
2024 c_register_builtin_type (tree type, const char* name)
2028 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2029 DECL_ARTIFICIAL (decl) = 1;
2030 if (!TYPE_NAME (type))
2031 TYPE_NAME (type) = decl;
2036 /* Return the minimum number of bits needed to represent VALUE in a
2037 signed or unsigned type, UNSIGNEDP says which. */
2040 min_precision (tree value, int unsignedp)
2044 /* If the value is negative, compute its negative minus 1. The latter
2045 adjustment is because the absolute value of the largest negative value
2046 is one larger than the largest positive value. This is equivalent to
2047 a bit-wise negation, so use that operation instead. */
2049 if (tree_int_cst_sgn (value) < 0)
2050 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2052 /* Return the number of bits needed, taking into account the fact
2053 that we need one more bit for a signed than unsigned type. */
2055 if (integer_zerop (value))
2058 log = tree_floor_log2 (value);
2060 return log + 1 + ! unsignedp;
2063 /* Print an error message for invalid operands to arith operation
2064 CODE. NOP_EXPR is used as a special case (see
2065 c_common_truthvalue_conversion). */
2068 binary_op_error (enum tree_code code)
2075 error ("invalid truth-value expression");
2079 opname = "+"; break;
2081 opname = "-"; break;
2083 opname = "*"; break;
2085 opname = "max"; break;
2087 opname = "min"; break;
2089 opname = "=="; break;
2091 opname = "!="; break;
2093 opname = "<="; break;
2095 opname = ">="; break;
2097 opname = "<"; break;
2099 opname = ">"; break;
2101 opname = "<<"; break;
2103 opname = ">>"; break;
2104 case TRUNC_MOD_EXPR:
2105 case FLOOR_MOD_EXPR:
2106 opname = "%"; break;
2107 case TRUNC_DIV_EXPR:
2108 case FLOOR_DIV_EXPR:
2109 opname = "/"; break;
2111 opname = "&"; break;
2113 opname = "|"; break;
2114 case TRUTH_ANDIF_EXPR:
2115 opname = "&&"; break;
2116 case TRUTH_ORIF_EXPR:
2117 opname = "||"; break;
2119 opname = "^"; break;
2122 opname = "rotate"; break;
2124 opname = "unknown"; break;
2126 error ("invalid operands to binary %s", opname);
2129 /* Subroutine of build_binary_op, used for comparison operations.
2130 See if the operands have both been converted from subword integer types
2131 and, if so, perhaps change them both back to their original type.
2132 This function is also responsible for converting the two operands
2133 to the proper common type for comparison.
2135 The arguments of this function are all pointers to local variables
2136 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2137 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2139 If this function returns nonzero, it means that the comparison has
2140 a constant value. What this function returns is an expression for
2144 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2145 enum tree_code *rescode_ptr)
2148 tree op0 = *op0_ptr;
2149 tree op1 = *op1_ptr;
2150 int unsignedp0, unsignedp1;
2152 tree primop0, primop1;
2153 enum tree_code code = *rescode_ptr;
2155 /* Throw away any conversions to wider types
2156 already present in the operands. */
2158 primop0 = get_narrower (op0, &unsignedp0);
2159 primop1 = get_narrower (op1, &unsignedp1);
2161 /* Handle the case that OP0 does not *contain* a conversion
2162 but it *requires* conversion to FINAL_TYPE. */
2164 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2165 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2166 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2167 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2169 /* If one of the operands must be floated, we cannot optimize. */
2170 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2171 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2173 /* If first arg is constant, swap the args (changing operation
2174 so value is preserved), for canonicalization. Don't do this if
2175 the second arg is 0. */
2177 if (TREE_CONSTANT (primop0)
2178 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2181 int temi = unsignedp0;
2189 unsignedp0 = unsignedp1;
2212 *rescode_ptr = code;
2215 /* If comparing an integer against a constant more bits wide,
2216 maybe we can deduce a value of 1 or 0 independent of the data.
2217 Or else truncate the constant now
2218 rather than extend the variable at run time.
2220 This is only interesting if the constant is the wider arg.
2221 Also, it is not safe if the constant is unsigned and the
2222 variable arg is signed, since in this case the variable
2223 would be sign-extended and then regarded as unsigned.
2224 Our technique fails in this case because the lowest/highest
2225 possible unsigned results don't follow naturally from the
2226 lowest/highest possible values of the variable operand.
2227 For just EQ_EXPR and NE_EXPR there is another technique that
2228 could be used: see if the constant can be faithfully represented
2229 in the other operand's type, by truncating it and reextending it
2230 and see if that preserves the constant's value. */
2232 if (!real1 && !real2
2233 && TREE_CODE (primop1) == INTEGER_CST
2234 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2236 int min_gt, max_gt, min_lt, max_lt;
2237 tree maxval, minval;
2238 /* 1 if comparison is nominally unsigned. */
2239 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2242 type = c_common_signed_or_unsigned_type (unsignedp0,
2243 TREE_TYPE (primop0));
2245 /* In C, if TYPE is an enumeration, then we need to get its
2246 min/max values from it's underlying integral type, not the
2247 enumerated type itself. In C++, TYPE_MAX_VALUE and
2248 TYPE_MIN_VALUE have already been set correctly on the
2249 enumeration type. */
2250 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
2251 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2253 maxval = TYPE_MAX_VALUE (type);
2254 minval = TYPE_MIN_VALUE (type);
2256 if (unsignedp && !unsignedp0)
2257 *restype_ptr = c_common_signed_type (*restype_ptr);
2259 if (TREE_TYPE (primop1) != *restype_ptr)
2260 primop1 = convert (*restype_ptr, primop1);
2261 if (type != *restype_ptr)
2263 minval = convert (*restype_ptr, minval);
2264 maxval = convert (*restype_ptr, maxval);
2267 if (unsignedp && unsignedp0)
2269 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2270 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2271 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2272 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2276 min_gt = INT_CST_LT (primop1, minval);
2277 max_gt = INT_CST_LT (primop1, maxval);
2278 min_lt = INT_CST_LT (minval, primop1);
2279 max_lt = INT_CST_LT (maxval, primop1);
2283 /* This used to be a switch, but Genix compiler can't handle that. */
2284 if (code == NE_EXPR)
2286 if (max_lt || min_gt)
2287 val = truthvalue_true_node;
2289 else if (code == EQ_EXPR)
2291 if (max_lt || min_gt)
2292 val = truthvalue_false_node;
2294 else if (code == LT_EXPR)
2297 val = truthvalue_true_node;
2299 val = truthvalue_false_node;
2301 else if (code == GT_EXPR)
2304 val = truthvalue_true_node;
2306 val = truthvalue_false_node;
2308 else if (code == LE_EXPR)
2311 val = truthvalue_true_node;
2313 val = truthvalue_false_node;
2315 else if (code == GE_EXPR)
2318 val = truthvalue_true_node;
2320 val = truthvalue_false_node;
2323 /* If primop0 was sign-extended and unsigned comparison specd,
2324 we did a signed comparison above using the signed type bounds.
2325 But the comparison we output must be unsigned.
2327 Also, for inequalities, VAL is no good; but if the signed
2328 comparison had *any* fixed result, it follows that the
2329 unsigned comparison just tests the sign in reverse
2330 (positive values are LE, negative ones GE).
2331 So we can generate an unsigned comparison
2332 against an extreme value of the signed type. */
2334 if (unsignedp && !unsignedp0)
2341 primop1 = TYPE_MIN_VALUE (type);
2347 primop1 = TYPE_MAX_VALUE (type);
2354 type = c_common_unsigned_type (type);
2357 if (TREE_CODE (primop0) != INTEGER_CST)
2359 if (val == truthvalue_false_node)
2360 warning ("comparison is always false due to limited range of data type");
2361 if (val == truthvalue_true_node)
2362 warning ("comparison is always true due to limited range of data type");
2367 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2368 if (TREE_SIDE_EFFECTS (primop0))
2369 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2373 /* Value is not predetermined, but do the comparison
2374 in the type of the operand that is not constant.
2375 TYPE is already properly set. */
2377 else if (real1 && real2
2378 && (TYPE_PRECISION (TREE_TYPE (primop0))
2379 == TYPE_PRECISION (TREE_TYPE (primop1))))
2380 type = TREE_TYPE (primop0);
2382 /* If args' natural types are both narrower than nominal type
2383 and both extend in the same manner, compare them
2384 in the type of the wider arg.
2385 Otherwise must actually extend both to the nominal
2386 common type lest different ways of extending
2388 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2390 else if (unsignedp0 == unsignedp1 && real1 == real2
2391 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2392 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2394 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2395 type = c_common_signed_or_unsigned_type (unsignedp0
2396 || TREE_UNSIGNED (*restype_ptr),
2398 /* Make sure shorter operand is extended the right way
2399 to match the longer operand. */
2401 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2402 TREE_TYPE (primop0)),
2405 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2406 TREE_TYPE (primop1)),
2411 /* Here we must do the comparison on the nominal type
2412 using the args exactly as we received them. */
2413 type = *restype_ptr;
2417 if (!real1 && !real2 && integer_zerop (primop1)
2418 && TREE_UNSIGNED (*restype_ptr))
2424 /* All unsigned values are >= 0, so we warn if extra warnings
2425 are requested. However, if OP0 is a constant that is
2426 >= 0, the signedness of the comparison isn't an issue,
2427 so suppress the warning. */
2428 if (extra_warnings && !in_system_header
2429 && ! (TREE_CODE (primop0) == INTEGER_CST
2430 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2432 warning ("comparison of unsigned expression >= 0 is always true");
2433 value = truthvalue_true_node;
2437 if (extra_warnings && !in_system_header
2438 && ! (TREE_CODE (primop0) == INTEGER_CST
2439 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2441 warning ("comparison of unsigned expression < 0 is always false");
2442 value = truthvalue_false_node;
2451 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2452 if (TREE_SIDE_EFFECTS (primop0))
2453 return build (COMPOUND_EXPR, TREE_TYPE (value),
2460 *op0_ptr = convert (type, primop0);
2461 *op1_ptr = convert (type, primop1);
2463 *restype_ptr = truthvalue_type_node;
2468 /* Return a tree for the sum or difference (RESULTCODE says which)
2469 of pointer PTROP and integer INTOP. */
2472 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2479 /* The result is a pointer of the same type that is being added. */
2481 tree result_type = TREE_TYPE (ptrop);
2483 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2485 if (pedantic || warn_pointer_arith)
2486 pedwarn ("pointer of type `void *' used in arithmetic");
2487 size_exp = integer_one_node;
2489 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2491 if (pedantic || warn_pointer_arith)
2492 pedwarn ("pointer to a function used in arithmetic");
2493 size_exp = integer_one_node;
2495 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2497 if (pedantic || warn_pointer_arith)
2498 pedwarn ("pointer to member function used in arithmetic");
2499 size_exp = integer_one_node;
2501 else if (TREE_CODE (TREE_TYPE (result_type)) == OFFSET_TYPE)
2503 if (pedantic || warn_pointer_arith)
2504 pedwarn ("pointer to a member used in arithmetic");
2505 size_exp = integer_one_node;
2508 size_exp = size_in_bytes (TREE_TYPE (result_type));
2510 /* If what we are about to multiply by the size of the elements
2511 contains a constant term, apply distributive law
2512 and multiply that constant term separately.
2513 This helps produce common subexpressions. */
2515 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2516 && ! TREE_CONSTANT (intop)
2517 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2518 && TREE_CONSTANT (size_exp)
2519 /* If the constant comes from pointer subtraction,
2520 skip this optimization--it would cause an error. */
2521 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2522 /* If the constant is unsigned, and smaller than the pointer size,
2523 then we must skip this optimization. This is because it could cause
2524 an overflow error if the constant is negative but INTOP is not. */
2525 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2526 || (TYPE_PRECISION (TREE_TYPE (intop))
2527 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2529 enum tree_code subcode = resultcode;
2530 tree int_type = TREE_TYPE (intop);
2531 if (TREE_CODE (intop) == MINUS_EXPR)
2532 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2533 /* Convert both subexpression types to the type of intop,
2534 because weird cases involving pointer arithmetic
2535 can result in a sum or difference with different type args. */
2536 ptrop = build_binary_op (subcode, ptrop,
2537 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2538 intop = convert (int_type, TREE_OPERAND (intop, 0));
2541 /* Convert the integer argument to a type the same size as sizetype
2542 so the multiply won't overflow spuriously. */
2544 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2545 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2546 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2547 TREE_UNSIGNED (sizetype)), intop);
2549 /* Replace the integer argument with a suitable product by the object size.
2550 Do this multiplication as signed, then convert to the appropriate
2551 pointer type (actually unsigned integral). */
2553 intop = convert (result_type,
2554 build_binary_op (MULT_EXPR, intop,
2555 convert (TREE_TYPE (intop), size_exp), 1));
2557 /* Create the sum or difference. */
2559 result = build (resultcode, result_type, ptrop, intop);
2561 folded = fold (result);
2562 if (folded == result)
2563 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2567 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2568 or validate its data type for an `if' or `while' statement or ?..: exp.
2570 This preparation consists of taking the ordinary
2571 representation of an expression expr and producing a valid tree
2572 boolean expression describing whether expr is nonzero. We could
2573 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2574 but we optimize comparisons, &&, ||, and !.
2576 The resulting type should always be `truthvalue_type_node'. */
2579 c_common_truthvalue_conversion (tree expr)
2581 if (TREE_CODE (expr) == ERROR_MARK)
2584 #if 0 /* This appears to be wrong for C++. */
2585 /* These really should return error_mark_node after 2.4 is stable.
2586 But not all callers handle ERROR_MARK properly. */
2587 switch (TREE_CODE (TREE_TYPE (expr)))
2590 error ("struct type value used where scalar is required");
2591 return truthvalue_false_node;
2594 error ("union type value used where scalar is required");
2595 return truthvalue_false_node;
2598 error ("array type value used where scalar is required");
2599 return truthvalue_false_node;
2606 switch (TREE_CODE (expr))
2609 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2610 case TRUTH_ANDIF_EXPR:
2611 case TRUTH_ORIF_EXPR:
2612 case TRUTH_AND_EXPR:
2614 case TRUTH_XOR_EXPR:
2615 case TRUTH_NOT_EXPR:
2616 TREE_TYPE (expr) = truthvalue_type_node;
2623 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2626 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2629 /* If we are taking the address of an external decl, it might be zero
2630 if it is weak, so we cannot optimize. */
2631 if (DECL_P (TREE_OPERAND (expr, 0))
2632 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2635 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2636 return build (COMPOUND_EXPR, truthvalue_type_node,
2637 TREE_OPERAND (expr, 0), truthvalue_true_node);
2639 return truthvalue_true_node;
2642 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2643 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2644 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2645 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2651 /* These don't change whether an object is nonzero or zero. */
2652 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2656 /* These don't change whether an object is zero or nonzero, but
2657 we can't ignore them if their second arg has side-effects. */
2658 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2659 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2660 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2662 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2665 /* Distribute the conversion into the arms of a COND_EXPR. */
2666 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2667 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2668 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2671 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2672 since that affects how `default_conversion' will behave. */
2673 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2674 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2676 /* Fall through.... */
2678 /* If this is widening the argument, we can ignore it. */
2679 if (TYPE_PRECISION (TREE_TYPE (expr))
2680 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2681 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2685 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2686 aren't guaranteed to the be same for modes that can represent
2687 infinity, since if x and y are both +infinity, or both
2688 -infinity, then x - y is not a number.
2690 Note that this transformation is safe when x or y is NaN.
2691 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2693 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2695 /* Fall through.... */
2697 /* This and MINUS_EXPR can be changed into a comparison of the
2699 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2700 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2701 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2702 TREE_OPERAND (expr, 1), 1);
2703 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2704 fold (build1 (NOP_EXPR,
2705 TREE_TYPE (TREE_OPERAND (expr, 0)),
2706 TREE_OPERAND (expr, 1))), 1);
2709 if (integer_onep (TREE_OPERAND (expr, 1))
2710 && TREE_TYPE (expr) != truthvalue_type_node)
2711 /* Using convert here would cause infinite recursion. */
2712 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2716 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2717 warning ("suggest parentheses around assignment used as truth value");
2724 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2726 tree t = save_expr (expr);
2727 return (build_binary_op
2728 ((TREE_SIDE_EFFECTS (expr)
2729 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2730 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2731 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2735 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2738 static tree builtin_function_2 (const char *, const char *, tree, tree,
2739 int, enum built_in_class, int, int,
2742 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2743 down to the element type of an array. */
2746 c_build_qualified_type (tree type, int type_quals)
2748 /* A restrict-qualified pointer type must be a pointer to object or
2749 incomplete type. Note that the use of POINTER_TYPE_P also allows
2750 REFERENCE_TYPEs, which is appropriate for C++. Unfortunately,
2751 the C++ front-end also use POINTER_TYPE for pointer-to-member
2752 values, so even though it should be illegal to use `restrict'
2753 with such an entity we don't flag that here. Thus, special case
2754 code for that case is required in the C++ front-end. */
2755 if ((type_quals & TYPE_QUAL_RESTRICT)
2756 && (!POINTER_TYPE_P (type)
2757 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2759 error ("invalid use of `restrict'");
2760 type_quals &= ~TYPE_QUAL_RESTRICT;
2763 if (TREE_CODE (type) == ARRAY_TYPE)
2764 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2766 TYPE_DOMAIN (type));
2767 return build_qualified_type (type, type_quals);
2770 /* Apply the TYPE_QUALS to the new DECL. */
2773 c_apply_type_quals_to_decl (int type_quals, tree decl)
2775 if ((type_quals & TYPE_QUAL_CONST)
2776 || (TREE_TYPE (decl)
2777 && TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE))
2778 TREE_READONLY (decl) = 1;
2779 if (type_quals & TYPE_QUAL_VOLATILE)
2781 TREE_SIDE_EFFECTS (decl) = 1;
2782 TREE_THIS_VOLATILE (decl) = 1;
2784 if (type_quals & TYPE_QUAL_RESTRICT)
2786 if (!TREE_TYPE (decl)
2787 || !POINTER_TYPE_P (TREE_TYPE (decl))
2788 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (TREE_TYPE (decl))))
2789 error ("invalid use of `restrict'");
2790 else if (flag_strict_aliasing)
2791 /* Indicate we need to make a unique alias set for this pointer.
2792 We can't do it here because it might be pointing to an
2794 DECL_POINTER_ALIAS_SET (decl) = -2;
2798 /* Return the typed-based alias set for T, which may be an expression
2799 or a type. Return -1 if we don't do anything special. */
2802 c_common_get_alias_set (tree t)
2806 /* Permit type-punning when accessing a union, provided the access
2807 is directly through the union. For example, this code does not
2808 permit taking the address of a union member and then storing
2809 through it. Even the type-punning allowed here is a GCC
2810 extension, albeit a common and useful one; the C standard says
2811 that such accesses have implementation-defined behavior. */
2813 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2814 u = TREE_OPERAND (u, 0))
2815 if (TREE_CODE (u) == COMPONENT_REF
2816 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2819 /* That's all the expressions we handle specially. */
2823 /* The C standard guarantees that any object may be accessed via an
2824 lvalue that has character type. */
2825 if (t == char_type_node
2826 || t == signed_char_type_node
2827 || t == unsigned_char_type_node)
2830 /* If it has the may_alias attribute, it can alias anything. */
2831 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2834 /* The C standard specifically allows aliasing between signed and
2835 unsigned variants of the same type. We treat the signed
2836 variant as canonical. */
2837 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2839 tree t1 = c_common_signed_type (t);
2841 /* t1 == t can happen for boolean nodes which are always unsigned. */
2843 return get_alias_set (t1);
2845 else if (POINTER_TYPE_P (t))
2849 /* Unfortunately, there is no canonical form of a pointer type.
2850 In particular, if we have `typedef int I', then `int *', and
2851 `I *' are different types. So, we have to pick a canonical
2852 representative. We do this below.
2854 Technically, this approach is actually more conservative that
2855 it needs to be. In particular, `const int *' and `int *'
2856 should be in different alias sets, according to the C and C++
2857 standard, since their types are not the same, and so,
2858 technically, an `int **' and `const int **' cannot point at
2861 But, the standard is wrong. In particular, this code is
2866 const int* const* cipp = &ipp;
2868 And, it doesn't make sense for that to be legal unless you
2869 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2870 the pointed-to types. This issue has been reported to the
2872 t1 = build_type_no_quals (t);
2874 return get_alias_set (t1);
2880 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2881 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2882 flag controls whether we should diagnose possibly ill-formed
2883 constructs or not. */
2885 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2887 const char *op_name;
2889 enum tree_code type_code = TREE_CODE (type);
2891 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2892 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2894 if (type_code == FUNCTION_TYPE)
2896 if (op == SIZEOF_EXPR)
2898 if (complain && (pedantic || warn_pointer_arith))
2899 pedwarn ("invalid application of `sizeof' to a function type");
2900 value = size_one_node;
2903 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2905 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2907 if (type_code == VOID_TYPE
2908 && complain && (pedantic || warn_pointer_arith))
2909 pedwarn ("invalid application of `%s' to a void type", op_name);
2910 value = size_one_node;
2912 else if (!COMPLETE_TYPE_P (type))
2915 error ("invalid application of `%s' to an incomplete type", op_name);
2916 value = size_zero_node;
2920 if (op == SIZEOF_EXPR)
2921 /* Convert in case a char is more than one unit. */
2922 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2923 size_int (TYPE_PRECISION (char_type_node)
2926 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2929 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2930 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2931 never happen. However, this node should really have type
2932 `size_t', which is just a typedef for an ordinary integer type. */
2933 value = fold (build1 (NOP_EXPR, size_type_node, value));
2934 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2939 /* Implement the __alignof keyword: Return the minimum required
2940 alignment of EXPR, measured in bytes. For VAR_DECL's and
2941 FIELD_DECL's return DECL_ALIGN (which can be set from an
2942 "aligned" __attribute__ specification). */
2945 c_alignof_expr (tree expr)
2949 if (TREE_CODE (expr) == VAR_DECL)
2950 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2952 else if (TREE_CODE (expr) == COMPONENT_REF
2953 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2955 error ("`__alignof' applied to a bit-field");
2958 else if (TREE_CODE (expr) == COMPONENT_REF
2959 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2960 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
2962 else if (TREE_CODE (expr) == INDIRECT_REF)
2964 tree t = TREE_OPERAND (expr, 0);
2966 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2968 while (TREE_CODE (t) == NOP_EXPR
2969 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2973 t = TREE_OPERAND (t, 0);
2974 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2975 if (thisalign > bestalign)
2976 best = t, bestalign = thisalign;
2978 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2981 return c_alignof (TREE_TYPE (expr));
2983 return fold (build1 (NOP_EXPR, size_type_node, t));
2986 /* Handle C and C++ default attributes. */
2988 enum built_in_attribute
2990 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2991 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2992 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2993 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2994 #include "builtin-attrs.def"
2995 #undef DEF_ATTR_NULL_TREE
2997 #undef DEF_ATTR_IDENT
2998 #undef DEF_ATTR_TREE_LIST
3002 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3004 static void c_init_attributes (void);
3006 /* Build tree nodes and builtin functions common to both C and C++ language
3010 c_common_nodes_and_builtins (void)
3014 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3015 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3016 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3017 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3018 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3019 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3020 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3021 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3022 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3023 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3024 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3025 #include "builtin-types.def"
3026 #undef DEF_PRIMITIVE_TYPE
3027 #undef DEF_FUNCTION_TYPE_0
3028 #undef DEF_FUNCTION_TYPE_1
3029 #undef DEF_FUNCTION_TYPE_2
3030 #undef DEF_FUNCTION_TYPE_3
3031 #undef DEF_FUNCTION_TYPE_4
3032 #undef DEF_FUNCTION_TYPE_VAR_0
3033 #undef DEF_FUNCTION_TYPE_VAR_1
3034 #undef DEF_FUNCTION_TYPE_VAR_2
3035 #undef DEF_FUNCTION_TYPE_VAR_3
3036 #undef DEF_POINTER_TYPE
3040 typedef enum builtin_type builtin_type;
3042 tree builtin_types[(int) BT_LAST];
3043 int wchar_type_size;
3044 tree array_domain_type;
3045 tree va_list_ref_type_node;
3046 tree va_list_arg_type_node;
3048 /* Define `int' and `char' first so that dbx will output them first. */
3049 record_builtin_type (RID_INT, NULL, integer_type_node);
3050 record_builtin_type (RID_CHAR, "char", char_type_node);
3052 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3053 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3054 but not C. Are the conditionals here needed? */
3055 if (c_dialect_cxx ())
3056 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3057 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3058 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3059 record_builtin_type (RID_MAX, "long unsigned int",
3060 long_unsigned_type_node);
3061 if (c_dialect_cxx ())
3062 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3063 record_builtin_type (RID_MAX, "long long int",
3064 long_long_integer_type_node);
3065 record_builtin_type (RID_MAX, "long long unsigned int",
3066 long_long_unsigned_type_node);
3067 if (c_dialect_cxx ())
3068 record_builtin_type (RID_MAX, "long long unsigned",
3069 long_long_unsigned_type_node);
3070 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3071 record_builtin_type (RID_MAX, "short unsigned int",
3072 short_unsigned_type_node);
3073 if (c_dialect_cxx ())
3074 record_builtin_type (RID_MAX, "unsigned short",
3075 short_unsigned_type_node);
3077 /* Define both `signed char' and `unsigned char'. */
3078 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3079 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3081 /* These are types that c_common_type_for_size and
3082 c_common_type_for_mode use. */
3083 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3085 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3087 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3089 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3091 #if HOST_BITS_PER_WIDE_INT >= 64
3092 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3093 get_identifier ("__int128_t"),
3096 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3097 unsigned_intQI_type_node));
3098 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3099 unsigned_intHI_type_node));
3100 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3101 unsigned_intSI_type_node));
3102 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3103 unsigned_intDI_type_node));
3104 #if HOST_BITS_PER_WIDE_INT >= 64
3105 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3106 get_identifier ("__uint128_t"),
3107 unsigned_intTI_type_node));
3110 /* Create the widest literal types. */
3111 widest_integer_literal_type_node
3112 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3113 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3114 widest_integer_literal_type_node));
3116 widest_unsigned_literal_type_node
3117 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3118 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3119 widest_unsigned_literal_type_node));
3121 /* `unsigned long' is the standard type for sizeof.
3122 Note that stddef.h uses `unsigned long',
3123 and this must agree, even if long and int are the same size. */
3125 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3126 signed_size_type_node = c_common_signed_type (size_type_node);
3127 set_sizetype (size_type_node);
3129 build_common_tree_nodes_2 (flag_short_double);
3131 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3132 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3133 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3135 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3136 get_identifier ("complex int"),
3137 complex_integer_type_node));
3138 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3139 get_identifier ("complex float"),
3140 complex_float_type_node));
3141 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3142 get_identifier ("complex double"),
3143 complex_double_type_node));
3144 (*lang_hooks.decls.pushdecl)
3145 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3146 complex_long_double_type_node));
3148 /* Types which are common to the fortran compiler and libf2c. When
3149 changing these, you also need to be concerned with f/com.h. */
3151 if (TYPE_PRECISION (float_type_node)
3152 == TYPE_PRECISION (long_integer_type_node))
3154 g77_integer_type_node = long_integer_type_node;
3155 g77_uinteger_type_node = long_unsigned_type_node;
3157 else if (TYPE_PRECISION (float_type_node)
3158 == TYPE_PRECISION (integer_type_node))
3160 g77_integer_type_node = integer_type_node;
3161 g77_uinteger_type_node = unsigned_type_node;
3164 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3166 if (g77_integer_type_node != NULL_TREE)
3168 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3169 get_identifier ("__g77_integer"),
3170 g77_integer_type_node));
3171 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3172 get_identifier ("__g77_uinteger"),
3173 g77_uinteger_type_node));
3176 if (TYPE_PRECISION (float_type_node) * 2
3177 == TYPE_PRECISION (long_integer_type_node))
3179 g77_longint_type_node = long_integer_type_node;
3180 g77_ulongint_type_node = long_unsigned_type_node;
3182 else if (TYPE_PRECISION (float_type_node) * 2
3183 == TYPE_PRECISION (long_long_integer_type_node))
3185 g77_longint_type_node = long_long_integer_type_node;
3186 g77_ulongint_type_node = long_long_unsigned_type_node;
3189 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3191 if (g77_longint_type_node != NULL_TREE)
3193 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3194 get_identifier ("__g77_longint"),
3195 g77_longint_type_node));
3196 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3197 get_identifier ("__g77_ulongint"),
3198 g77_ulongint_type_node));
3201 record_builtin_type (RID_VOID, NULL, void_type_node);
3203 void_zero_node = build_int_2 (0, 0);
3204 TREE_TYPE (void_zero_node) = void_type_node;
3206 void_list_node = build_void_list_node ();
3208 /* Make a type to be the domain of a few array types
3209 whose domains don't really matter.
3210 200 is small enough that it always fits in size_t
3211 and large enough that it can hold most function names for the
3212 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3213 array_domain_type = build_index_type (size_int (200));
3215 /* Make a type for arrays of characters.
3216 With luck nothing will ever really depend on the length of this
3218 char_array_type_node
3219 = build_array_type (char_type_node, array_domain_type);
3221 /* Likewise for arrays of ints. */
3223 = build_array_type (integer_type_node, array_domain_type);
3225 string_type_node = build_pointer_type (char_type_node);
3226 const_string_type_node
3227 = build_pointer_type (build_qualified_type
3228 (char_type_node, TYPE_QUAL_CONST));
3230 /* This is special for C++ so functions can be overloaded. */
3231 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3232 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3233 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3234 if (c_dialect_cxx ())
3236 if (TREE_UNSIGNED (wchar_type_node))
3237 wchar_type_node = make_unsigned_type (wchar_type_size);
3239 wchar_type_node = make_signed_type (wchar_type_size);
3240 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3244 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3245 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3248 /* This is for wide string constants. */
3249 wchar_array_type_node
3250 = build_array_type (wchar_type_node, array_domain_type);
3253 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3256 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3258 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3260 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3262 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3263 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3265 (*lang_hooks.decls.pushdecl)
3266 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3267 va_list_type_node));
3269 (*lang_hooks.decls.pushdecl)
3270 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3271 ptrdiff_type_node));
3273 (*lang_hooks.decls.pushdecl)
3274 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3277 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3279 va_list_arg_type_node = va_list_ref_type_node =
3280 build_pointer_type (TREE_TYPE (va_list_type_node));
3284 va_list_arg_type_node = va_list_type_node;
3285 va_list_ref_type_node = build_reference_type (va_list_type_node);
3288 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3289 builtin_types[(int) ENUM] = VALUE;
3290 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3291 builtin_types[(int) ENUM] \
3292 = build_function_type (builtin_types[(int) RETURN], \
3294 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3295 builtin_types[(int) ENUM] \
3296 = build_function_type (builtin_types[(int) RETURN], \
3297 tree_cons (NULL_TREE, \
3298 builtin_types[(int) ARG1], \
3300 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3301 builtin_types[(int) ENUM] \
3302 = build_function_type \
3303 (builtin_types[(int) RETURN], \
3304 tree_cons (NULL_TREE, \
3305 builtin_types[(int) ARG1], \
3306 tree_cons (NULL_TREE, \
3307 builtin_types[(int) ARG2], \
3309 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3310 builtin_types[(int) ENUM] \
3311 = build_function_type \
3312 (builtin_types[(int) RETURN], \
3313 tree_cons (NULL_TREE, \
3314 builtin_types[(int) ARG1], \
3315 tree_cons (NULL_TREE, \
3316 builtin_types[(int) ARG2], \
3317 tree_cons (NULL_TREE, \
3318 builtin_types[(int) ARG3], \
3320 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
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 builtin_types[(int) ARG3], \
3331 tree_cons (NULL_TREE, \
3332 builtin_types[(int) ARG4], \
3333 void_list_node)))));
3334 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3335 builtin_types[(int) ENUM] \
3336 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3337 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3338 builtin_types[(int) ENUM] \
3339 = build_function_type (builtin_types[(int) RETURN], \
3340 tree_cons (NULL_TREE, \
3341 builtin_types[(int) ARG1], \
3344 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3345 builtin_types[(int) ENUM] \
3346 = build_function_type \
3347 (builtin_types[(int) RETURN], \
3348 tree_cons (NULL_TREE, \
3349 builtin_types[(int) ARG1], \
3350 tree_cons (NULL_TREE, \
3351 builtin_types[(int) ARG2], \
3354 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3355 builtin_types[(int) ENUM] \
3356 = build_function_type \
3357 (builtin_types[(int) RETURN], \
3358 tree_cons (NULL_TREE, \
3359 builtin_types[(int) ARG1], \
3360 tree_cons (NULL_TREE, \
3361 builtin_types[(int) ARG2], \
3362 tree_cons (NULL_TREE, \
3363 builtin_types[(int) ARG3], \
3366 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3367 builtin_types[(int) ENUM] \
3368 = build_pointer_type (builtin_types[(int) TYPE]);
3369 #include "builtin-types.def"
3370 #undef DEF_PRIMITIVE_TYPE
3371 #undef DEF_FUNCTION_TYPE_1
3372 #undef DEF_FUNCTION_TYPE_2
3373 #undef DEF_FUNCTION_TYPE_3
3374 #undef DEF_FUNCTION_TYPE_4
3375 #undef DEF_FUNCTION_TYPE_VAR_0
3376 #undef DEF_FUNCTION_TYPE_VAR_1
3377 #undef DEF_FUNCTION_TYPE_VAR_2
3378 #undef DEF_FUNCTION_TYPE_VAR_3
3379 #undef DEF_POINTER_TYPE
3381 c_init_attributes ();
3383 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3384 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3389 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3393 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3396 ? (NAME + strlen ("__builtin_")) \
3398 built_in_attributes[(int) ATTRS]); \
3400 decl = builtin_function_2 (NAME, \
3401 NAME + strlen ("__builtin_"), \
3402 builtin_types[TYPE], \
3403 builtin_types[LIBTYPE], \
3408 built_in_attributes[(int) ATTRS]); \
3410 built_in_decls[(int) ENUM] = decl; \
3412 implicit_built_in_decls[(int) ENUM] = decl; \
3414 #include "builtins.def"
3417 (*targetm.init_builtins) ();
3419 main_identifier_node = get_identifier ("main");
3423 build_va_arg (tree expr, tree type)
3425 return build1 (VA_ARG_EXPR, type, expr);
3429 /* Linked list of disabled built-in functions. */
3431 typedef struct disabled_builtin
3434 struct disabled_builtin *next;
3436 static disabled_builtin *disabled_builtins = NULL;
3438 static bool builtin_function_disabled_p (const char *);
3440 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3441 begins with "__builtin_", give an error. */
3444 disable_builtin_function (const char *name)
3446 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3447 error ("cannot disable built-in function `%s'", name);
3450 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3452 new->next = disabled_builtins;
3453 disabled_builtins = new;
3458 /* Return true if the built-in function NAME has been disabled, false
3462 builtin_function_disabled_p (const char *name)
3464 disabled_builtin *p;
3465 for (p = disabled_builtins; p != NULL; p = p->next)
3467 if (strcmp (name, p->name) == 0)
3474 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3475 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3476 of these may be NULL (though both being NULL is useless).
3477 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3478 TYPE is the type of the function with the ordinary name. These
3479 may differ if the ordinary name is declared with a looser type to avoid
3480 conflicts with headers. FUNCTION_CODE and CLASS are as for
3481 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3482 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3483 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3484 ATTRS is the tree list representing the builtin's function attributes.
3485 Returns the declaration of BUILTIN_NAME, if any, otherwise
3486 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3487 or if NONANSI_P and flag_no_nonansi_builtin. */
3490 builtin_function_2 (const char *builtin_name, const char *name,
3491 tree builtin_type, tree type, int function_code,
3492 enum built_in_class class, int library_name_p,
3493 int nonansi_p, tree attrs)
3495 tree bdecl = NULL_TREE;
3496 tree decl = NULL_TREE;
3498 if (builtin_name != 0)
3499 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3500 class, library_name_p ? name : NULL, attrs);
3502 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3503 && !(nonansi_p && flag_no_nonansi_builtin))
3504 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3506 return (bdecl != 0 ? bdecl : decl);
3509 /* Nonzero if the type T promotes to int. This is (nearly) the
3510 integral promotions defined in ISO C99 6.3.1.1/2. */
3513 c_promoting_integer_type_p (tree t)
3515 switch (TREE_CODE (t))
3518 return (TYPE_MAIN_VARIANT (t) == char_type_node
3519 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3520 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3521 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3522 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3523 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3526 /* ??? Technically all enumerations not larger than an int
3527 promote to an int. But this is used along code paths
3528 that only want to notice a size change. */
3529 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3539 /* Return 1 if PARMS specifies a fixed number of parameters
3540 and none of their types is affected by default promotions. */
3543 self_promoting_args_p (tree parms)
3546 for (t = parms; t; t = TREE_CHAIN (t))
3548 tree type = TREE_VALUE (t);
3550 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3556 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3559 if (c_promoting_integer_type_p (type))
3565 /* Recursively examines the array elements of TYPE, until a non-array
3566 element type is found. */
3569 strip_array_types (tree type)
3571 while (TREE_CODE (type) == ARRAY_TYPE)
3572 type = TREE_TYPE (type);
3577 /* Recursively remove any '*' or '&' operator from TYPE. */
3579 strip_pointer_operator (tree t)
3581 while (POINTER_TYPE_P (t))
3586 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3588 /* Expand a call to an unordered comparison function such as
3589 __builtin_isgreater(). FUNCTION is the function's declaration and
3590 PARAMS a list of the values passed. For __builtin_isunordered(),
3591 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3592 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3593 that give the opposite of the desired result. UNORDERED_CODE is
3594 used for modes that can hold NaNs and ORDERED_CODE is used for the
3598 expand_unordered_cmp (tree function, tree params,
3599 enum tree_code unordered_code,
3600 enum tree_code ordered_code)
3602 tree arg0, arg1, type;
3603 enum tree_code code0, code1;
3605 /* Check that we have exactly two arguments. */
3606 if (params == 0 || TREE_CHAIN (params) == 0)
3608 error ("too few arguments to function `%s'",
3609 IDENTIFIER_POINTER (DECL_NAME (function)));
3610 return error_mark_node;
3612 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3614 error ("too many arguments to function `%s'",
3615 IDENTIFIER_POINTER (DECL_NAME (function)));
3616 return error_mark_node;
3619 arg0 = TREE_VALUE (params);
3620 arg1 = TREE_VALUE (TREE_CHAIN (params));
3622 code0 = TREE_CODE (TREE_TYPE (arg0));
3623 code1 = TREE_CODE (TREE_TYPE (arg1));
3625 /* Make sure that the arguments have a common type of REAL. */
3627 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3628 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3629 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3631 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3633 error ("non-floating-point argument to function `%s'",
3634 IDENTIFIER_POINTER (DECL_NAME (function)));
3635 return error_mark_node;
3638 if (unordered_code == UNORDERED_EXPR)
3640 if (MODE_HAS_NANS (TYPE_MODE (type)))
3641 return build_binary_op (unordered_code,
3642 convert (type, arg0),
3643 convert (type, arg1),
3646 return integer_zero_node;
3649 return build_unary_op (TRUTH_NOT_EXPR,
3650 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3653 convert (type, arg0),
3654 convert (type, arg1),
3660 /* Recognize certain built-in functions so we can make tree-codes
3661 other than CALL_EXPR. We do this when it enables fold-const.c
3662 to do something useful. */
3663 /* ??? By rights this should go in builtins.c, but only C and C++
3664 implement build_{binary,unary}_op. Not exactly sure what bits
3665 of functionality are actually needed from those functions, or
3666 where the similar functionality exists in the other front ends. */
3669 expand_tree_builtin (tree function, tree params, tree coerced_params)
3671 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3674 switch (DECL_FUNCTION_CODE (function))
3678 case BUILT_IN_LLABS:
3679 case BUILT_IN_IMAXABS:
3681 case BUILT_IN_FABSL:
3682 case BUILT_IN_FABSF:
3683 if (coerced_params == 0)
3684 return integer_zero_node;
3685 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3688 case BUILT_IN_CONJF:
3689 case BUILT_IN_CONJL:
3690 if (coerced_params == 0)
3691 return integer_zero_node;
3692 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3694 case BUILT_IN_CREAL:
3695 case BUILT_IN_CREALF:
3696 case BUILT_IN_CREALL:
3697 if (coerced_params == 0)
3698 return integer_zero_node;
3699 return build_unary_op (REALPART_EXPR, TREE_VALUE (coerced_params), 0);
3701 case BUILT_IN_CIMAG:
3702 case BUILT_IN_CIMAGF:
3703 case BUILT_IN_CIMAGL:
3704 if (coerced_params == 0)
3705 return integer_zero_node;
3706 return build_unary_op (IMAGPART_EXPR, TREE_VALUE (coerced_params), 0);
3708 case BUILT_IN_ISGREATER:
3709 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3711 case BUILT_IN_ISGREATEREQUAL:
3712 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3714 case BUILT_IN_ISLESS:
3715 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3717 case BUILT_IN_ISLESSEQUAL:
3718 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3720 case BUILT_IN_ISLESSGREATER:
3721 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3723 case BUILT_IN_ISUNORDERED:
3724 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3733 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3734 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3735 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3736 value, the traversal is aborted, and the value returned by FUNC is
3737 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3738 the node being visited are not walked.
3740 We don't need a without_duplicates variant of this one because the
3741 statement tree is a tree, not a graph. */
3744 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3746 enum tree_code code;
3751 #define WALK_SUBTREE(NODE) \
3754 result = walk_stmt_tree (&(NODE), func, data); \
3760 /* Skip empty subtrees. */
3764 /* Skip subtrees below non-statement nodes. */
3765 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3768 /* Call the function. */
3770 result = (*func) (tp, &walk_subtrees, data);
3772 /* If we found something, return it. */
3776 /* FUNC may have modified the tree, recheck that we're looking at a
3778 code = TREE_CODE (*tp);
3779 if (!STATEMENT_CODE_P (code))
3782 /* Visit the subtrees unless FUNC decided that there was nothing
3783 interesting below this point in the tree. */
3786 /* Walk over all the sub-trees of this operand. Statement nodes
3787 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3788 len = TREE_CODE_LENGTH (code);
3790 /* Go through the subtrees. We need to do this in forward order so
3791 that the scope of a FOR_EXPR is handled properly. */
3792 for (i = 0; i < len; ++i)
3793 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3796 /* Finally visit the chain. This can be tail-recursion optimized if
3797 we write it this way. */
3798 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3803 /* Used to compare case labels. K1 and K2 are actually tree nodes
3804 representing case labels, or NULL_TREE for a `default' label.
3805 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3806 K2, and 0 if K1 and K2 are equal. */
3809 case_compare (splay_tree_key k1, splay_tree_key k2)
3811 /* Consider a NULL key (such as arises with a `default' label) to be
3812 smaller than anything else. */
3818 return tree_int_cst_compare ((tree) k1, (tree) k2);
3821 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3822 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3823 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3824 case label was declared using the usual C/C++ syntax, rather than
3825 the GNU case range extension. CASES is a tree containing all the
3826 case ranges processed so far; COND is the condition for the
3827 switch-statement itself. Returns the CASE_LABEL created, or
3828 ERROR_MARK_NODE if no CASE_LABEL is created. */
3831 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3837 splay_tree_node node;
3839 /* Create the LABEL_DECL itself. */
3840 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3841 DECL_CONTEXT (label) = current_function_decl;
3843 /* If there was an error processing the switch condition, bail now
3844 before we get more confused. */
3845 if (!cond || cond == error_mark_node)
3847 /* Add a label anyhow so that the back-end doesn't think that
3848 the beginning of the switch is unreachable. */
3850 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3851 return error_mark_node;
3854 if ((low_value && TREE_TYPE (low_value)
3855 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3856 || (high_value && TREE_TYPE (high_value)
3857 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3858 error ("pointers are not permitted as case values");
3860 /* Case ranges are a GNU extension. */
3861 if (high_value && pedantic)
3862 pedwarn ("range expressions in switch statements are non-standard");
3864 type = TREE_TYPE (cond);
3867 low_value = check_case_value (low_value);
3868 low_value = convert_and_check (type, low_value);
3872 high_value = check_case_value (high_value);
3873 high_value = convert_and_check (type, high_value);
3876 /* If an error has occurred, bail out now. */
3877 if (low_value == error_mark_node || high_value == error_mark_node)
3880 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3881 return error_mark_node;
3884 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3885 really a case range, even though it was written that way. Remove
3886 the HIGH_VALUE to simplify later processing. */
3887 if (tree_int_cst_equal (low_value, high_value))
3888 high_value = NULL_TREE;
3889 if (low_value && high_value
3890 && !tree_int_cst_lt (low_value, high_value))
3891 warning ("empty range specified");
3893 /* Look up the LOW_VALUE in the table of case labels we already
3895 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3896 /* If there was not an exact match, check for overlapping ranges.
3897 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3898 that's a `default' label and the only overlap is an exact match. */
3899 if (!node && (low_value || high_value))
3901 splay_tree_node low_bound;
3902 splay_tree_node high_bound;
3904 /* Even though there wasn't an exact match, there might be an
3905 overlap between this case range and another case range.
3906 Since we've (inductively) not allowed any overlapping case
3907 ranges, we simply need to find the greatest low case label
3908 that is smaller that LOW_VALUE, and the smallest low case
3909 label that is greater than LOW_VALUE. If there is an overlap
3910 it will occur in one of these two ranges. */
3911 low_bound = splay_tree_predecessor (cases,
3912 (splay_tree_key) low_value);
3913 high_bound = splay_tree_successor (cases,
3914 (splay_tree_key) low_value);
3916 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3917 the LOW_VALUE, so there is no need to check unless the
3918 LOW_BOUND is in fact itself a case range. */
3920 && CASE_HIGH ((tree) low_bound->value)
3921 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3924 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3925 range is bigger than the low end of the current range, so we
3926 are only interested if the current range is a real range, and
3927 not an ordinary case label. */
3930 && (tree_int_cst_compare ((tree) high_bound->key,
3935 /* If there was an overlap, issue an error. */
3938 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3942 error ("duplicate (or overlapping) case value");
3943 error ("%Jthis is the first entry overlapping that value", duplicate);
3947 error ("duplicate case value") ;
3948 error ("%Jpreviously used here", duplicate);
3952 error ("multiple default labels in one switch");
3953 error ("%Jthis is the first default label", duplicate);
3956 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3959 /* Add a CASE_LABEL to the statement-tree. */
3960 case_label = add_stmt (build_case_label (low_value, high_value, label));
3961 /* Register this case label in the splay tree. */
3962 splay_tree_insert (cases,
3963 (splay_tree_key) low_value,
3964 (splay_tree_value) case_label);
3969 /* Finish an expression taking the address of LABEL (an
3970 IDENTIFIER_NODE). Returns an expression for the address. */
3973 finish_label_address_expr (tree label)
3978 pedwarn ("taking the address of a label is non-standard");
3980 if (label == error_mark_node)
3981 return error_mark_node;
3983 label = lookup_label (label);
3984 if (label == NULL_TREE)
3985 result = null_pointer_node;
3988 TREE_USED (label) = 1;
3989 result = build1 (ADDR_EXPR, ptr_type_node, label);
3990 TREE_CONSTANT (result) = 1;
3991 /* The current function in not necessarily uninlinable.
3992 Computed gotos are incompatible with inlining, but the value
3993 here could be used only in a diagnostic, for example. */
3999 /* Hook used by expand_expr to expand language-specific tree codes. */
4002 c_expand_expr (tree exp, rtx target, enum machine_mode tmode, int modifier)
4003 /* Actually enum_modifier. */
4005 switch (TREE_CODE (exp))
4011 bool preserve_result = false;
4012 bool return_target = false;
4014 if (STMT_EXPR_WARN_UNUSED_RESULT (exp) && target == const0_rtx)
4016 tree stmt = STMT_EXPR_STMT (exp);
4019 for (scope = COMPOUND_BODY (stmt);
4020 scope && TREE_CODE (scope) != SCOPE_STMT;
4021 scope = TREE_CHAIN (scope));
4023 if (scope && SCOPE_STMT_BLOCK (scope))
4024 warning ("%Hignoring return value of `%D', "
4025 "declared with attribute warn_unused_result",
4026 &expr_wfl_stack->location,
4027 BLOCK_ABSTRACT_ORIGIN (SCOPE_STMT_BLOCK (scope)));
4029 warning ("%Hignoring return value of function "
4030 "declared with attribute warn_unused_result",
4031 &expr_wfl_stack->location);
4034 /* Since expand_expr_stmt calls free_temp_slots after every
4035 expression statement, we must call push_temp_slots here.
4036 Otherwise, any temporaries in use now would be considered
4037 out-of-scope after the first EXPR_STMT from within the
4040 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
4042 /* If we want the result of this expression, find the last
4043 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
4044 if (target != const0_rtx
4045 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
4046 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
4048 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
4049 tree last = TREE_CHAIN (expr);
4051 while (TREE_CHAIN (last))
4054 last = TREE_CHAIN (last);
4057 if (TREE_CODE (last) == SCOPE_STMT
4058 && TREE_CODE (expr) == EXPR_STMT)
4060 if (target && TREE_CODE (EXPR_STMT_EXPR (expr)) == VAR_DECL
4061 && DECL_RTL_IF_SET (EXPR_STMT_EXPR (expr)) == target)
4062 /* If the last expression is a variable whose RTL is the
4063 same as our target, just return the target; if it
4064 isn't valid expanding the decl would produce different
4065 RTL, and store_expr would try to do a copy. */
4066 return_target = true;
4069 /* Otherwise, note that we want the value from the last
4071 TREE_ADDRESSABLE (expr) = 1;
4072 preserve_result = true;
4077 expand_stmt (STMT_EXPR_STMT (exp));
4078 expand_end_stmt_expr (rtl_expr);
4080 result = expand_expr (rtl_expr, target, tmode, modifier);
4083 else if (preserve_result && GET_CODE (result) == MEM)
4085 if (GET_MODE (result) != BLKmode)
4086 result = copy_to_reg (result);
4088 preserve_temp_slots (result);
4091 /* If the statment-expression does not have a scope, then the
4092 new temporaries we created within it must live beyond the
4093 statement-expression. */
4094 if (STMT_EXPR_NO_SCOPE (exp))
4095 preserve_temp_slots (NULL_RTX);
4102 case COMPOUND_LITERAL_EXPR:
4104 /* Initialize the anonymous variable declared in the compound
4105 literal, then return the variable. */
4106 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4107 emit_local_var (decl);
4108 return expand_expr (decl, target, tmode, modifier);
4119 /* Hook used by safe_from_p to handle language-specific tree codes. */
4122 c_safe_from_p (rtx target, tree exp)
4124 /* We can see statements here when processing the body of a
4125 statement-expression. For a declaration statement declaring a
4126 variable, look at the variable's initializer. */
4127 if (TREE_CODE (exp) == DECL_STMT)
4129 tree decl = DECL_STMT_DECL (exp);
4131 if (TREE_CODE (decl) == VAR_DECL
4132 && DECL_INITIAL (decl)
4133 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4137 /* For any statement, we must follow the statement-chain. */
4138 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4139 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4141 /* Assume everything else is safe. */
4145 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4148 c_common_unsafe_for_reeval (tree exp)
4150 /* Statement expressions may not be reevaluated, likewise compound
4152 if (TREE_CODE (exp) == STMT_EXPR
4153 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4156 /* Walk all other expressions. */
4160 /* Hook used by staticp to handle language-specific tree codes. */
4163 c_staticp (tree exp)
4165 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4166 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4172 /* Given a boolean expression ARG, return a tree representing an increment
4173 or decrement (as indicated by CODE) of ARG. The front end must check for
4174 invalid cases (e.g., decrement in C++). */
4176 boolean_increment (enum tree_code code, tree arg)
4179 tree true_res = boolean_true_node;
4181 arg = stabilize_reference (arg);
4184 case PREINCREMENT_EXPR:
4185 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4187 case POSTINCREMENT_EXPR:
4188 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4189 arg = save_expr (arg);
4190 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4191 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4193 case PREDECREMENT_EXPR:
4194 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4196 case POSTDECREMENT_EXPR:
4197 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4198 arg = save_expr (arg);
4199 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4200 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4205 TREE_SIDE_EFFECTS (val) = 1;
4209 /* Built-in macros for stddef.h, that require macros defined in this
4212 c_stddef_cpp_builtins(void)
4214 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4215 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4216 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4217 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4221 c_init_attributes (void)
4223 /* Fill in the built_in_attributes array. */
4224 #define DEF_ATTR_NULL_TREE(ENUM) \
4225 built_in_attributes[(int) ENUM] = NULL_TREE;
4226 #define DEF_ATTR_INT(ENUM, VALUE) \
4227 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4228 #define DEF_ATTR_IDENT(ENUM, STRING) \
4229 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4230 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4231 built_in_attributes[(int) ENUM] \
4232 = tree_cons (built_in_attributes[(int) PURPOSE], \
4233 built_in_attributes[(int) VALUE], \
4234 built_in_attributes[(int) CHAIN]);
4235 #include "builtin-attrs.def"
4236 #undef DEF_ATTR_NULL_TREE
4238 #undef DEF_ATTR_IDENT
4239 #undef DEF_ATTR_TREE_LIST
4242 /* Output a -Wshadow warning MSGCODE about NAME, and give the location
4243 of the previous declaration DECL. */
4245 shadow_warning (enum sw_kind msgcode, const char *name, tree decl)
4247 static const char *const msgs[] = {
4248 /* SW_PARAM */ N_("declaration of \"%s\" shadows a parameter"),
4249 /* SW_LOCAL */ N_("declaration of \"%s\" shadows a previous local"),
4250 /* SW_GLOBAL */ N_("declaration of \"%s\" shadows a global declaration")
4253 warning (msgs[msgcode], name);
4254 warning ("%Jshadowed declaration is here", decl);
4257 /* Attribute handlers common to C front ends. */
4259 /* Handle a "packed" attribute; arguments as in
4260 struct attribute_spec.handler. */
4263 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4264 int flags, bool *no_add_attrs)
4268 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4269 *node = build_type_copy (*node);
4270 TYPE_PACKED (*node) = 1;
4271 if (TYPE_MAIN_VARIANT (*node) == *node)
4273 /* If it is the main variant, then pack the other variants
4274 too. This happens in,
4277 struct Foo const *ptr; // creates a variant w/o packed flag
4278 } __ attribute__((packed)); // packs it now.
4282 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4283 TYPE_PACKED (probe) = 1;
4287 else if (TREE_CODE (*node) == FIELD_DECL)
4288 DECL_PACKED (*node) = 1;
4289 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4290 used for DECL_REGISTER. It wouldn't mean anything anyway.
4291 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4292 that changes what the typedef is typing. */
4295 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4296 *no_add_attrs = true;
4302 /* Handle a "nocommon" attribute; arguments as in
4303 struct attribute_spec.handler. */
4306 handle_nocommon_attribute (tree *node, tree name,
4307 tree args ATTRIBUTE_UNUSED,
4308 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4310 if (TREE_CODE (*node) == VAR_DECL)
4311 DECL_COMMON (*node) = 0;
4314 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4315 *no_add_attrs = true;
4321 /* Handle a "common" attribute; arguments as in
4322 struct attribute_spec.handler. */
4325 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4326 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4328 if (TREE_CODE (*node) == VAR_DECL)
4329 DECL_COMMON (*node) = 1;
4332 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4333 *no_add_attrs = true;
4339 /* Handle a "noreturn" attribute; arguments as in
4340 struct attribute_spec.handler. */
4343 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4344 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4346 tree type = TREE_TYPE (*node);
4348 /* See FIXME comment in c_common_attribute_table. */
4349 if (TREE_CODE (*node) == FUNCTION_DECL)
4350 TREE_THIS_VOLATILE (*node) = 1;
4351 else if (TREE_CODE (type) == POINTER_TYPE
4352 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4354 = build_pointer_type
4355 (build_type_variant (TREE_TYPE (type),
4356 TREE_READONLY (TREE_TYPE (type)), 1));
4359 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4360 *no_add_attrs = true;
4366 /* Handle a "noinline" attribute; arguments as in
4367 struct attribute_spec.handler. */
4370 handle_noinline_attribute (tree *node, tree name,
4371 tree args ATTRIBUTE_UNUSED,
4372 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4374 if (TREE_CODE (*node) == FUNCTION_DECL)
4375 DECL_UNINLINABLE (*node) = 1;
4378 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4379 *no_add_attrs = true;
4385 /* Handle a "always_inline" attribute; arguments as in
4386 struct attribute_spec.handler. */
4389 handle_always_inline_attribute (tree *node, tree name,
4390 tree args ATTRIBUTE_UNUSED,
4391 int flags ATTRIBUTE_UNUSED,
4394 if (TREE_CODE (*node) == FUNCTION_DECL)
4396 /* Do nothing else, just set the attribute. We'll get at
4397 it later with lookup_attribute. */
4401 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4402 *no_add_attrs = true;
4408 /* Handle a "used" attribute; arguments as in
4409 struct attribute_spec.handler. */
4412 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4413 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4417 if (TREE_CODE (node) == FUNCTION_DECL
4418 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4420 TREE_USED (node) = 1;
4424 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4425 *no_add_attrs = true;
4431 /* Handle a "unused" attribute; arguments as in
4432 struct attribute_spec.handler. */
4435 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4436 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4442 if (TREE_CODE (decl) == PARM_DECL
4443 || TREE_CODE (decl) == VAR_DECL
4444 || TREE_CODE (decl) == FUNCTION_DECL
4445 || TREE_CODE (decl) == LABEL_DECL
4446 || TREE_CODE (decl) == TYPE_DECL)
4447 TREE_USED (decl) = 1;
4450 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4451 *no_add_attrs = true;
4456 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4457 *node = build_type_copy (*node);
4458 TREE_USED (*node) = 1;
4464 /* Handle a "const" attribute; arguments as in
4465 struct attribute_spec.handler. */
4468 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4469 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4471 tree type = TREE_TYPE (*node);
4473 /* See FIXME comment on noreturn in c_common_attribute_table. */
4474 if (TREE_CODE (*node) == FUNCTION_DECL)
4475 TREE_READONLY (*node) = 1;
4476 else if (TREE_CODE (type) == POINTER_TYPE
4477 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4479 = build_pointer_type
4480 (build_type_variant (TREE_TYPE (type), 1,
4481 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4484 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4485 *no_add_attrs = true;
4491 /* Handle a "transparent_union" attribute; arguments as in
4492 struct attribute_spec.handler. */
4495 handle_transparent_union_attribute (tree *node, tree name,
4496 tree args ATTRIBUTE_UNUSED, int flags,
4499 tree decl = NULL_TREE;
4506 type = &TREE_TYPE (decl);
4507 is_type = TREE_CODE (*node) == TYPE_DECL;
4509 else if (TYPE_P (*node))
4510 type = node, is_type = 1;
4513 && TREE_CODE (*type) == UNION_TYPE
4515 || (TYPE_FIELDS (*type) != 0
4516 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4518 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4519 *type = build_type_copy (*type);
4520 TYPE_TRANSPARENT_UNION (*type) = 1;
4522 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4523 && TREE_CODE (*type) == UNION_TYPE
4524 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4525 DECL_TRANSPARENT_UNION (decl) = 1;
4528 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4529 *no_add_attrs = true;
4535 /* Handle a "constructor" attribute; arguments as in
4536 struct attribute_spec.handler. */
4539 handle_constructor_attribute (tree *node, tree name,
4540 tree args ATTRIBUTE_UNUSED,
4541 int flags ATTRIBUTE_UNUSED,
4545 tree type = TREE_TYPE (decl);
4547 if (TREE_CODE (decl) == FUNCTION_DECL
4548 && TREE_CODE (type) == FUNCTION_TYPE
4549 && decl_function_context (decl) == 0)
4551 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4552 TREE_USED (decl) = 1;
4556 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4557 *no_add_attrs = true;
4563 /* Handle a "destructor" attribute; arguments as in
4564 struct attribute_spec.handler. */
4567 handle_destructor_attribute (tree *node, tree name,
4568 tree args ATTRIBUTE_UNUSED,
4569 int flags ATTRIBUTE_UNUSED,
4573 tree type = TREE_TYPE (decl);
4575 if (TREE_CODE (decl) == FUNCTION_DECL
4576 && TREE_CODE (type) == FUNCTION_TYPE
4577 && decl_function_context (decl) == 0)
4579 DECL_STATIC_DESTRUCTOR (decl) = 1;
4580 TREE_USED (decl) = 1;
4584 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4585 *no_add_attrs = true;
4591 /* Handle a "mode" attribute; arguments as in
4592 struct attribute_spec.handler. */
4595 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4596 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4600 *no_add_attrs = true;
4602 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4603 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4607 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4608 int len = strlen (p);
4609 enum machine_mode mode = VOIDmode;
4613 if (len > 4 && p[0] == '_' && p[1] == '_'
4614 && p[len - 1] == '_' && p[len - 2] == '_')
4616 char *newp = alloca (len - 1);
4618 strcpy (newp, &p[2]);
4619 newp[len - 4] = '\0';
4623 /* Change this type to have a type with the specified mode.
4624 First check for the special modes. */
4625 if (! strcmp (p, "byte"))
4627 else if (!strcmp (p, "word"))
4629 else if (! strcmp (p, "pointer"))
4632 for (j = 0; j < NUM_MACHINE_MODES; j++)
4633 if (!strcmp (p, GET_MODE_NAME (j)))
4634 mode = (enum machine_mode) j;
4636 if (mode == VOIDmode)
4637 error ("unknown machine mode `%s'", p);
4638 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
4639 (mode, TREE_UNSIGNED (type))))
4640 error ("no data type for mode `%s'", p);
4641 else if ((TREE_CODE (type) == POINTER_TYPE
4642 || TREE_CODE (type) == REFERENCE_TYPE)
4643 && !(*targetm.valid_pointer_mode) (mode))
4644 error ("invalid pointer mode `%s'", p);
4647 /* If this is a vector, make sure we either have hardware
4648 support, or we can emulate it. */
4649 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4651 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4655 if (TREE_CODE (type) == POINTER_TYPE)
4657 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4661 else if (TREE_CODE (type) == REFERENCE_TYPE)
4663 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4669 /* No need to layout the type here. The caller should do this. */
4676 /* Handle a "section" attribute; arguments as in
4677 struct attribute_spec.handler. */
4680 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4681 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4685 if (targetm.have_named_sections)
4687 if ((TREE_CODE (decl) == FUNCTION_DECL
4688 || TREE_CODE (decl) == VAR_DECL)
4689 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4691 if (TREE_CODE (decl) == VAR_DECL
4692 && current_function_decl != NULL_TREE
4693 && ! TREE_STATIC (decl))
4695 error ("%Jsection attribute cannot be specified for "
4696 "local variables", decl);
4697 *no_add_attrs = true;
4700 /* The decl may have already been given a section attribute
4701 from a previous declaration. Ensure they match. */
4702 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4703 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4704 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4706 error ("%Jsection of '%D' conflicts with previous declaration",
4708 *no_add_attrs = true;
4711 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4715 error ("%Jsection attribute not allowed for '%D'", *node, *node);
4716 *no_add_attrs = true;
4721 error ("%Jsection attributes are not supported for this target", *node);
4722 *no_add_attrs = true;
4728 /* Handle a "aligned" attribute; arguments as in
4729 struct attribute_spec.handler. */
4732 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4733 int flags, bool *no_add_attrs)
4735 tree decl = NULL_TREE;
4738 tree align_expr = (args ? TREE_VALUE (args)
4739 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4745 type = &TREE_TYPE (decl);
4746 is_type = TREE_CODE (*node) == TYPE_DECL;
4748 else if (TYPE_P (*node))
4749 type = node, is_type = 1;
4751 /* Strip any NOPs of any kind. */
4752 while (TREE_CODE (align_expr) == NOP_EXPR
4753 || TREE_CODE (align_expr) == CONVERT_EXPR
4754 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4755 align_expr = TREE_OPERAND (align_expr, 0);
4757 if (TREE_CODE (align_expr) != INTEGER_CST)
4759 error ("requested alignment is not a constant");
4760 *no_add_attrs = true;
4762 else if ((i = tree_log2 (align_expr)) == -1)
4764 error ("requested alignment is not a power of 2");
4765 *no_add_attrs = true;
4767 else if (i > HOST_BITS_PER_INT - 2)
4769 error ("requested alignment is too large");
4770 *no_add_attrs = true;
4774 /* If we have a TYPE_DECL, then copy the type, so that we
4775 don't accidentally modify a builtin type. See pushdecl. */
4776 if (decl && TREE_TYPE (decl) != error_mark_node
4777 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4779 tree tt = TREE_TYPE (decl);
4780 *type = build_type_copy (*type);
4781 DECL_ORIGINAL_TYPE (decl) = tt;
4782 TYPE_NAME (*type) = decl;
4783 TREE_USED (*type) = TREE_USED (decl);
4784 TREE_TYPE (decl) = *type;
4786 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4787 *type = build_type_copy (*type);
4789 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4790 TYPE_USER_ALIGN (*type) = 1;
4792 else if (TREE_CODE (decl) != VAR_DECL
4793 && TREE_CODE (decl) != FIELD_DECL)
4795 error ("%Jalignment may not be specified for '%D'", decl, decl);
4796 *no_add_attrs = true;
4800 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4801 DECL_USER_ALIGN (decl) = 1;
4807 /* Handle a "weak" attribute; arguments as in
4808 struct attribute_spec.handler. */
4811 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4812 tree args ATTRIBUTE_UNUSED,
4813 int flags ATTRIBUTE_UNUSED,
4814 bool *no_add_attrs ATTRIBUTE_UNUSED)
4816 declare_weak (*node);
4821 /* Handle an "alias" attribute; arguments as in
4822 struct attribute_spec.handler. */
4825 handle_alias_attribute (tree *node, tree name, tree args,
4826 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4830 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4831 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4833 error ("%J'%D' defined both normally and as an alias", decl, decl);
4834 *no_add_attrs = true;
4836 else if (decl_function_context (decl) == 0)
4840 id = TREE_VALUE (args);
4841 if (TREE_CODE (id) != STRING_CST)
4843 error ("alias arg not a string");
4844 *no_add_attrs = true;
4847 id = get_identifier (TREE_STRING_POINTER (id));
4848 /* This counts as a use of the object pointed to. */
4851 if (TREE_CODE (decl) == FUNCTION_DECL)
4852 DECL_INITIAL (decl) = error_mark_node;
4854 DECL_EXTERNAL (decl) = 0;
4858 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4859 *no_add_attrs = true;
4865 /* Handle an "visibility" attribute; arguments as in
4866 struct attribute_spec.handler. */
4869 handle_visibility_attribute (tree *node, tree name, tree args,
4870 int flags ATTRIBUTE_UNUSED,
4875 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
4877 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4878 *no_add_attrs = true;
4884 id = TREE_VALUE (args);
4885 if (TREE_CODE (id) != STRING_CST)
4887 error ("visibility arg not a string");
4888 *no_add_attrs = true;
4891 if (strcmp (TREE_STRING_POINTER (id), "hidden")
4892 && strcmp (TREE_STRING_POINTER (id), "protected")
4893 && strcmp (TREE_STRING_POINTER (id), "internal")
4894 && strcmp (TREE_STRING_POINTER (id), "default"))
4896 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4897 *no_add_attrs = true;
4905 /* Handle an "tls_model" attribute; arguments as in
4906 struct attribute_spec.handler. */
4909 handle_tls_model_attribute (tree *node, tree name, tree args,
4910 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4914 if (! DECL_THREAD_LOCAL (decl))
4916 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4917 *no_add_attrs = true;
4923 id = TREE_VALUE (args);
4924 if (TREE_CODE (id) != STRING_CST)
4926 error ("tls_model arg not a string");
4927 *no_add_attrs = true;
4930 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4931 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4932 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4933 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4935 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4936 *no_add_attrs = true;
4944 /* Handle a "no_instrument_function" attribute; arguments as in
4945 struct attribute_spec.handler. */
4948 handle_no_instrument_function_attribute (tree *node, tree name,
4949 tree args ATTRIBUTE_UNUSED,
4950 int flags ATTRIBUTE_UNUSED,
4955 if (TREE_CODE (decl) != FUNCTION_DECL)
4957 error ("%J'%E' attribute applies only to functions", decl, name);
4958 *no_add_attrs = true;
4960 else if (DECL_INITIAL (decl))
4962 error ("%Jcan't set '%E' attribute after definition", decl, name);
4963 *no_add_attrs = true;
4966 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
4971 /* Handle a "malloc" attribute; arguments as in
4972 struct attribute_spec.handler. */
4975 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4976 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4978 if (TREE_CODE (*node) == FUNCTION_DECL)
4979 DECL_IS_MALLOC (*node) = 1;
4980 /* ??? TODO: Support types. */
4983 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4984 *no_add_attrs = true;
4990 /* Handle a "no_limit_stack" attribute; arguments as in
4991 struct attribute_spec.handler. */
4994 handle_no_limit_stack_attribute (tree *node, tree name,
4995 tree args ATTRIBUTE_UNUSED,
4996 int flags ATTRIBUTE_UNUSED,
5001 if (TREE_CODE (decl) != FUNCTION_DECL)
5003 error ("%J'%E' attribute applies only to functions", decl, name);
5004 *no_add_attrs = true;
5006 else if (DECL_INITIAL (decl))
5008 error ("%Jcan't set '%E' attribute after definition", decl, name);
5009 *no_add_attrs = true;
5012 DECL_NO_LIMIT_STACK (decl) = 1;
5017 /* Handle a "pure" attribute; arguments as in
5018 struct attribute_spec.handler. */
5021 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5022 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5024 if (TREE_CODE (*node) == FUNCTION_DECL)
5025 DECL_IS_PURE (*node) = 1;
5026 /* ??? TODO: Support types. */
5029 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5030 *no_add_attrs = true;
5036 /* Handle a "deprecated" attribute; arguments as in
5037 struct attribute_spec.handler. */
5040 handle_deprecated_attribute (tree *node, tree name,
5041 tree args ATTRIBUTE_UNUSED, int flags,
5044 tree type = NULL_TREE;
5046 const char *what = NULL;
5051 type = TREE_TYPE (decl);
5053 if (TREE_CODE (decl) == TYPE_DECL
5054 || TREE_CODE (decl) == PARM_DECL
5055 || TREE_CODE (decl) == VAR_DECL
5056 || TREE_CODE (decl) == FUNCTION_DECL
5057 || TREE_CODE (decl) == FIELD_DECL)
5058 TREE_DEPRECATED (decl) = 1;
5062 else if (TYPE_P (*node))
5064 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5065 *node = build_type_copy (*node);
5066 TREE_DEPRECATED (*node) = 1;
5074 *no_add_attrs = true;
5075 if (type && TYPE_NAME (type))
5077 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5078 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5079 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5080 && DECL_NAME (TYPE_NAME (type)))
5081 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5084 warning ("`%s' attribute ignored for `%s'",
5085 IDENTIFIER_POINTER (name), what);
5087 warning ("`%s' attribute ignored",
5088 IDENTIFIER_POINTER (name));
5094 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5095 to prevent us from duplicating type nodes unnecessarily.
5096 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5097 since we want to distinguish types that are essentially identical (except
5098 for their debug representation), we use a local list here. */
5099 static GTY(()) tree vector_type_node_list = 0;
5101 /* Handle a "vector_size" attribute; arguments as in
5102 struct attribute_spec.handler. */
5105 handle_vector_size_attribute (tree *node, tree name, tree args,
5106 int flags ATTRIBUTE_UNUSED,
5109 unsigned HOST_WIDE_INT vecsize, nunits;
5110 enum machine_mode mode, orig_mode, new_mode;
5111 tree type = *node, new_type = NULL_TREE;
5112 tree type_list_node;
5114 *no_add_attrs = true;
5116 if (! host_integerp (TREE_VALUE (args), 1))
5118 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5122 /* Get the vector size (in bytes). */
5123 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5125 /* We need to provide for vector pointers, vector arrays, and
5126 functions returning vectors. For example:
5128 __attribute__((vector_size(16))) short *foo;
5130 In this case, the mode is SI, but the type being modified is
5131 HI, so we need to look further. */
5133 while (POINTER_TYPE_P (type)
5134 || TREE_CODE (type) == FUNCTION_TYPE
5135 || TREE_CODE (type) == METHOD_TYPE
5136 || TREE_CODE (type) == ARRAY_TYPE)
5137 type = TREE_TYPE (type);
5139 /* Get the mode of the type being modified. */
5140 orig_mode = TYPE_MODE (type);
5142 if (TREE_CODE (type) == RECORD_TYPE
5143 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5144 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5145 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5147 error ("invalid vector type for attribute `%s'",
5148 IDENTIFIER_POINTER (name));
5152 /* Calculate how many units fit in the vector. */
5153 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5155 /* Find a suitably sized vector. */
5156 new_mode = VOIDmode;
5157 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5159 : MODE_VECTOR_FLOAT);
5161 mode = GET_MODE_WIDER_MODE (mode))
5162 if (vecsize == GET_MODE_SIZE (mode)
5163 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5169 if (new_mode == VOIDmode)
5171 error ("no vector mode with the size and type specified could be found");
5175 for (type_list_node = vector_type_node_list; type_list_node;
5176 type_list_node = TREE_CHAIN (type_list_node))
5178 tree other_type = TREE_VALUE (type_list_node);
5179 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5180 tree fields = TYPE_FIELDS (record);
5181 tree field_type = TREE_TYPE (fields);
5182 tree array_type = TREE_TYPE (field_type);
5183 if (TREE_CODE (fields) != FIELD_DECL
5184 || TREE_CODE (field_type) != ARRAY_TYPE)
5187 if (TYPE_MODE (other_type) == mode && type == array_type)
5189 new_type = other_type;
5194 if (new_type == NULL_TREE)
5196 tree index, array, rt, list_node;
5198 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5199 TREE_UNSIGNED (type));
5203 error ("no vector mode with the size and type specified could be found");
5207 new_type = build_type_copy (new_type);
5209 /* If this is a vector, make sure we either have hardware
5210 support, or we can emulate it. */
5211 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5212 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5213 && !vector_mode_valid_p (mode))
5215 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5219 /* Set the debug information here, because this is the only
5220 place where we know the underlying type for a vector made
5221 with vector_size. For debugging purposes we pretend a vector
5222 is an array within a structure. */
5223 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5224 array = build_array_type (type, build_index_type (index));
5225 rt = make_node (RECORD_TYPE);
5227 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5228 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5230 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5232 list_node = build_tree_list (NULL, new_type);
5233 TREE_CHAIN (list_node) = vector_type_node_list;
5234 vector_type_node_list = list_node;
5237 /* Build back pointers if needed. */
5238 *node = vector_size_helper (*node, new_type);
5243 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5246 If we requested a pointer to a vector, build up the pointers that
5247 we stripped off while looking for the inner type. Similarly for
5248 return values from functions.
5250 The argument "type" is the top of the chain, and "bottom" is the
5251 new type which we will point to. */
5254 vector_size_helper (tree type, tree bottom)
5258 if (POINTER_TYPE_P (type))
5260 inner = vector_size_helper (TREE_TYPE (type), bottom);
5261 outer = build_pointer_type (inner);
5263 else if (TREE_CODE (type) == ARRAY_TYPE)
5265 inner = vector_size_helper (TREE_TYPE (type), bottom);
5266 outer = build_array_type (inner, TYPE_DOMAIN (type));
5268 else if (TREE_CODE (type) == FUNCTION_TYPE)
5270 inner = vector_size_helper (TREE_TYPE (type), bottom);
5271 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5273 else if (TREE_CODE (type) == METHOD_TYPE)
5275 inner = vector_size_helper (TREE_TYPE (type), bottom);
5276 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5278 TYPE_ARG_TYPES (type));
5283 TREE_READONLY (outer) = TREE_READONLY (type);
5284 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5289 /* Handle the "nonnull" attribute. */
5291 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5292 tree args, int flags ATTRIBUTE_UNUSED,
5296 unsigned HOST_WIDE_INT attr_arg_num;
5298 /* If no arguments are specified, all pointer arguments should be
5299 non-null. Verify a full prototype is given so that the arguments
5300 will have the correct types when we actually check them later. */
5303 if (! TYPE_ARG_TYPES (type))
5305 error ("nonnull attribute without arguments on a non-prototype");
5306 *no_add_attrs = true;
5311 /* Argument list specified. Verify that each argument number references
5312 a pointer argument. */
5313 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5316 unsigned HOST_WIDE_INT arg_num, ck_num;
5318 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5320 error ("nonnull argument has invalid operand number (arg %lu)",
5321 (unsigned long) attr_arg_num);
5322 *no_add_attrs = true;
5326 argument = TYPE_ARG_TYPES (type);
5329 for (ck_num = 1; ; ck_num++)
5331 if (! argument || ck_num == arg_num)
5333 argument = TREE_CHAIN (argument);
5337 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5339 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5340 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5341 *no_add_attrs = true;
5345 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5347 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5348 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5349 *no_add_attrs = true;
5358 /* Check the argument list of a function call for null in argument slots
5359 that are marked as requiring a non-null pointer argument. */
5362 check_function_nonnull (tree attrs, tree params)
5364 tree a, args, param;
5367 for (a = attrs; a; a = TREE_CHAIN (a))
5369 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5371 args = TREE_VALUE (a);
5373 /* Walk the argument list. If we encounter an argument number we
5374 should check for non-null, do it. If the attribute has no args,
5375 then every pointer argument is checked (in which case the check
5376 for pointer type is done in check_nonnull_arg). */
5377 for (param = params, param_num = 1; ;
5378 param_num++, param = TREE_CHAIN (param))
5382 if (! args || nonnull_check_p (args, param_num))
5383 check_function_arguments_recurse (check_nonnull_arg, NULL,
5391 /* Helper for check_function_nonnull; given a list of operands which
5392 must be non-null in ARGS, determine if operand PARAM_NUM should be
5396 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5398 unsigned HOST_WIDE_INT arg_num;
5400 for (; args; args = TREE_CHAIN (args))
5402 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5405 if (arg_num == param_num)
5411 /* Check that the function argument PARAM (which is operand number
5412 PARAM_NUM) is non-null. This is called by check_function_nonnull
5413 via check_function_arguments_recurse. */
5416 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5417 unsigned HOST_WIDE_INT param_num)
5419 /* Just skip checking the argument if it's not a pointer. This can
5420 happen if the "nonnull" attribute was given without an operand
5421 list (which means to check every pointer argument). */
5423 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5426 if (integer_zerop (param))
5427 warning ("null argument where non-null required (arg %lu)",
5428 (unsigned long) param_num);
5431 /* Helper for nonnull attribute handling; fetch the operand number
5432 from the attribute argument list. */
5435 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5437 /* Strip any conversions from the arg number and verify they
5439 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5440 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5441 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5442 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5444 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5445 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5448 *valp = TREE_INT_CST_LOW (arg_num_expr);
5452 /* Handle a "nothrow" attribute; arguments as in
5453 struct attribute_spec.handler. */
5456 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5457 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5459 if (TREE_CODE (*node) == FUNCTION_DECL)
5460 TREE_NOTHROW (*node) = 1;
5461 /* ??? TODO: Support types. */
5464 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5465 *no_add_attrs = true;
5471 /* Handle a "cleanup" attribute; arguments as in
5472 struct attribute_spec.handler. */
5475 handle_cleanup_attribute (tree *node, tree name, tree args,
5476 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5479 tree cleanup_id, cleanup_decl;
5481 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5482 for global destructors in C++. This requires infrastructure that
5483 we don't have generically at the moment. It's also not a feature
5484 we'd be missing too much, since we do have attribute constructor. */
5485 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5487 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5488 *no_add_attrs = true;
5492 /* Verify that the argument is a function in scope. */
5493 /* ??? We could support pointers to functions here as well, if
5494 that was considered desirable. */
5495 cleanup_id = TREE_VALUE (args);
5496 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5498 error ("cleanup arg not an identifier");
5499 *no_add_attrs = true;
5502 cleanup_decl = lookup_name (cleanup_id);
5503 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5505 error ("cleanup arg not a function");
5506 *no_add_attrs = true;
5510 /* That the function has proper type is checked with the
5511 eventual call to build_function_call. */
5516 /* Handle a "warn_unused_result" attribute. No special handling. */
5519 handle_warn_unused_result_attribute (tree *node, tree name,
5520 tree args ATTRIBUTE_UNUSED,
5521 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5523 /* Ignore the attribute for functions not returning any value. */
5524 if (VOID_TYPE_P (TREE_TYPE (*node)))
5526 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5527 *no_add_attrs = true;
5533 /* Check for valid arguments being passed to a function. */
5535 check_function_arguments (tree attrs, tree params)
5537 /* Check for null being passed in a pointer argument that must be
5538 non-null. We also need to do this if format checking is enabled. */
5541 check_function_nonnull (attrs, params);
5543 /* Check for errors in format strings. */
5546 check_function_format (NULL, attrs, params);
5549 /* Generic argument checking recursion routine. PARAM is the argument to
5550 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5551 once the argument is resolved. CTX is context for the callback. */
5553 check_function_arguments_recurse (void (*callback)
5554 (void *, tree, unsigned HOST_WIDE_INT),
5555 void *ctx, tree param,
5556 unsigned HOST_WIDE_INT param_num)
5558 if (TREE_CODE (param) == NOP_EXPR)
5560 /* Strip coercion. */
5561 check_function_arguments_recurse (callback, ctx,
5562 TREE_OPERAND (param, 0), param_num);
5566 if (TREE_CODE (param) == CALL_EXPR)
5568 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5570 bool found_format_arg = false;
5572 /* See if this is a call to a known internationalization function
5573 that modifies a format arg. Such a function may have multiple
5574 format_arg attributes (for example, ngettext). */
5576 for (attrs = TYPE_ATTRIBUTES (type);
5578 attrs = TREE_CHAIN (attrs))
5579 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5582 tree format_num_expr;
5586 /* Extract the argument number, which was previously checked
5588 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5589 while (TREE_CODE (format_num_expr) == NOP_EXPR
5590 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5591 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5592 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5594 if (TREE_CODE (format_num_expr) != INTEGER_CST
5595 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5598 format_num = TREE_INT_CST_LOW (format_num_expr);
5600 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5602 inner_args = TREE_CHAIN (inner_args), i++)
5603 if (i == format_num)
5605 check_function_arguments_recurse (callback, ctx,
5606 TREE_VALUE (inner_args),
5608 found_format_arg = true;
5613 /* If we found a format_arg attribute and did a recursive check,
5614 we are done with checking this argument. Otherwise, we continue
5615 and this will be considered a non-literal. */
5616 if (found_format_arg)
5620 if (TREE_CODE (param) == COND_EXPR)
5622 /* Check both halves of the conditional expression. */
5623 check_function_arguments_recurse (callback, ctx,
5624 TREE_OPERAND (param, 1), param_num);
5625 check_function_arguments_recurse (callback, ctx,
5626 TREE_OPERAND (param, 2), param_num);
5630 (*callback) (ctx, param, param_num);
5633 /* Function to help qsort sort FIELD_DECLs by name order. */
5636 field_decl_cmp (const void *x_p, const void *y_p)
5638 const tree *const x = x_p;
5639 const tree *const y = y_p;
5640 if (DECL_NAME (*x) == DECL_NAME (*y))
5641 /* A nontype is "greater" than a type. */
5642 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5643 if (DECL_NAME (*x) == NULL_TREE)
5645 if (DECL_NAME (*y) == NULL_TREE)
5647 if (DECL_NAME (*x) < DECL_NAME (*y))
5653 gt_pointer_operator new_value;
5657 /* This routine compares two fields like field_decl_cmp but using the
5658 pointer operator in resort_data. */
5661 resort_field_decl_cmp (const void *x_p, const void *y_p)
5663 const tree *const x = x_p;
5664 const tree *const y = y_p;
5666 if (DECL_NAME (*x) == DECL_NAME (*y))
5667 /* A nontype is "greater" than a type. */
5668 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5669 if (DECL_NAME (*x) == NULL_TREE)
5671 if (DECL_NAME (*y) == NULL_TREE)
5674 tree d1 = DECL_NAME (*x);
5675 tree d2 = DECL_NAME (*y);
5676 resort_data.new_value (&d1, resort_data.cookie);
5677 resort_data.new_value (&d2, resort_data.cookie);
5684 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5687 resort_sorted_fields (void *obj,
5688 void *orig_obj ATTRIBUTE_UNUSED ,
5689 gt_pointer_operator new_value,
5692 struct sorted_fields_type *sf = obj;
5693 resort_data.new_value = new_value;
5694 resort_data.cookie = cookie;
5695 qsort (&sf->elts[0], sf->len, sizeof (tree),
5696 resort_field_decl_cmp);
5699 /* Used by estimate_num_insns. Estimate number of instructions seen
5700 by given statement. */
5702 c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
5707 if (TYPE_P (x) || DECL_P (x))
5712 /* Assume that constants and references counts nothing. These should
5713 be majorized by amount of operations among them we count later
5714 and are common target of CSE and similar optimizations. */
5715 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
5716 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
5718 switch (TREE_CODE (x))
5720 /* Reconginze assignments of large structures and constructors of
5725 int size = int_size_in_bytes (TREE_TYPE (x));
5727 if (!size || size > MOVE_MAX_PIECES)
5730 *count += 2 * (size + MOVE_MAX - 1) / MOVE_MAX;
5734 /* Few special cases of expensive operations. This is usefull
5735 to avoid inlining on functions having too many of these. */
5736 case TRUNC_DIV_EXPR:
5738 case FLOOR_DIV_EXPR:
5739 case ROUND_DIV_EXPR:
5740 case TRUNC_MOD_EXPR:
5742 case FLOOR_MOD_EXPR:
5743 case ROUND_MOD_EXPR:
5748 /* Various containers that will produce no code themselves. */
5755 case IDENTIFIER_NODE:
5756 case PLACEHOLDER_EXPR:
5757 case WITH_CLEANUP_EXPR:
5758 case CLEANUP_POINT_EXPR:
5760 case VIEW_CONVERT_EXPR:
5766 case TRY_CATCH_EXPR:
5767 case TRY_FINALLY_EXPR:
5770 case LABELED_BLOCK_EXPR:
5771 case EXIT_BLOCK_EXPR:
5772 case EXPR_WITH_FILE_LOCATION:
5789 /* Do not account static initializers. */
5790 if (TREE_STATIC (TREE_OPERAND (x, 0)))
5799 /* Estimate number of instructions that will be created by expanding the body. */
5801 c_estimate_num_insns (tree decl)
5804 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl), c_estimate_num_insns_1, &num);
5808 /* Used by c_decl_uninit to find where expressions like x = x + 1; */
5811 c_decl_uninit_1 (tree *t, int *walk_sub_trees, void *x)
5813 /* If x = EXP(&x)EXP, then do not warn about the use of x. */
5814 if (TREE_CODE (*t) == ADDR_EXPR && TREE_OPERAND (*t, 0) == x)
5816 *walk_sub_trees = 0;
5824 /* Find out if a variable is uninitialized based on DECL_INITIAL. */
5827 c_decl_uninit (tree t)
5829 /* int x = x; is GCC extension to turn off this warning, only if warn_init_self is zero. */
5830 if (DECL_INITIAL (t) == t)
5831 return warn_init_self ? true : false;
5833 /* Walk the trees looking for the variable itself. */
5834 if (walk_tree_without_duplicates (&DECL_INITIAL (t), c_decl_uninit_1, t))
5839 #include "gt-c-common.h"