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 add default format_arg attributes for functions not
378 int flag_noniso_default_format_attributes = 1;
380 /* Nonzero means warn when casting a function call to a type that does
381 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
382 when there is no previous declaration of sqrt or malloc. */
384 int warn_bad_function_cast;
386 /* Warn about traditional constructs whose meanings changed in ANSI C. */
388 int warn_traditional;
390 /* Nonzero means warn for a declaration found after a statement. */
392 int warn_declaration_after_statement;
394 /* Nonzero means warn for non-prototype function decls
395 or non-prototyped defs without previous prototype. */
397 int warn_strict_prototypes;
399 /* Nonzero means warn for any global function def
400 without separate previous decl. */
402 int warn_missing_declarations;
404 /* Nonzero means warn about declarations of objects not at
405 file-scope level and about *all* declarations of functions (whether
406 or static) not at file-scope level. Note that we exclude
407 implicit function declarations. To get warnings about those, use
410 int warn_nested_externs;
412 /* Warn if main is suspicious. */
416 /* Nonzero means warn about possible violations of sequence point rules. */
418 int warn_sequence_point;
420 /* Nonzero means to warn about compile-time division by zero. */
421 int warn_div_by_zero = 1;
423 /* Nonzero means warn about use of implicit int. */
425 int warn_implicit_int;
427 /* Warn about NULL being passed to argument slots marked as requiring
433 /* ObjC language option variables. */
436 /* Open and close the file for outputting class declarations, if
439 int flag_gen_declaration;
441 /* Generate code for GNU or NeXT runtime environment. */
443 #ifdef NEXT_OBJC_RUNTIME
444 int flag_next_runtime = 1;
446 int flag_next_runtime = 0;
449 /* Tells the compiler that this is a special run. Do not perform any
450 compiling, instead we are to test some platform dependent features
451 and output a C header file with appropriate definitions. */
453 int print_struct_values;
455 /* ???. Undocumented. */
457 const char *constant_string_class_name;
459 /* Warn if multiple methods are seen for the same selector, but with
460 different argument types. Performs the check on the whole selector
461 table at the end of compilation. */
465 /* Warn if a @selector() is found, and no method with that selector
466 has been previously declared. The check is done on each
467 @selector() as soon as it is found - so it warns about forward
470 int warn_undeclared_selector;
472 /* Warn if methods required by a protocol are not implemented in the
473 class adopting it. When turned off, methods inherited to that
474 class are also considered implemented. */
476 int warn_protocol = 1;
479 /* C++ language option variables. */
482 /* Nonzero means don't recognize any extension keywords. */
484 int flag_no_gnu_keywords;
486 /* Nonzero means do emit exported implementations of functions even if
487 they can be inlined. */
489 int flag_implement_inlines = 1;
491 /* Nonzero means do emit exported implementations of templates, instead of
492 multiple static copies in each file that needs a definition. */
494 int flag_external_templates;
496 /* Nonzero means that the decision to emit or not emit the implementation of a
497 template depends on where the template is instantiated, rather than where
500 int flag_alt_external_templates;
502 /* Nonzero means that implicit instantiations will be emitted if needed. */
504 int flag_implicit_templates = 1;
506 /* Nonzero means that implicit instantiations of inline templates will be
507 emitted if needed, even if instantiations of non-inline templates
510 int flag_implicit_inline_templates = 1;
512 /* Nonzero means generate separate instantiation control files and
513 juggle them at link time. */
515 int flag_use_repository;
517 /* Nonzero if we want to issue diagnostics that the standard says are not
520 int flag_optional_diags = 1;
522 /* Nonzero means we should attempt to elide constructors when possible. */
524 int flag_elide_constructors = 1;
526 /* Nonzero means that member functions defined in class scope are
527 inline by default. */
529 int flag_default_inline = 1;
531 /* Controls whether compiler generates 'type descriptor' that give
532 run-time type information. */
536 /* Nonzero if we want to conserve space in the .o files. We do this
537 by putting uninitialized data and runtime initialized data into
538 .common instead of .data at the expense of not flagging multiple
541 int flag_conserve_space;
543 /* Nonzero if we want to obey access control semantics. */
545 int flag_access_control = 1;
547 /* Nonzero if we want to check the return value of new and avoid calling
548 constructors if it is a null pointer. */
552 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
553 initialization variables.
554 0: Old rules, set by -fno-for-scope.
555 2: New ISO rules, set by -ffor-scope.
556 1: Try to implement new ISO rules, but with backup compatibility
557 (and warnings). This is the default, for now. */
559 int flag_new_for_scope = 1;
561 /* Nonzero if we want to emit defined symbols with common-like linkage as
562 weak symbols where possible, in order to conform to C++ semantics.
563 Otherwise, emit them as local symbols. */
567 /* Nonzero to use __cxa_atexit, rather than atexit, to register
568 destructors for local statics and global objects. */
570 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
572 /* Nonzero means make the default pedwarns warnings instead of errors.
573 The value of this flag is ignored if -pedantic is specified. */
577 /* Nonzero means to implement standard semantics for exception
578 specifications, calling unexpected if an exception is thrown that
579 doesn't match the specification. Zero means to treat them as
580 assertions and optimize accordingly, but not check them. */
582 int flag_enforce_eh_specs = 1;
584 /* The version of the C++ ABI in use. The following values are
587 0: The version of the ABI believed most conformant with the
588 C++ ABI specification. This ABI may change as bugs are
589 discovered and fixed. Therefore, 0 will not necessarily
590 indicate the same ABI in different versions of G++.
592 1: The version of the ABI first used in G++ 3.2.
594 Additional positive integers will be assigned as new versions of
595 the ABI become the default version of the ABI. */
597 int flag_abi_version = 1;
599 /* Nonzero means warn about things that will change when compiling
600 with an ABI-compliant compiler. */
604 /* Nonzero means warn about invalid uses of offsetof. */
606 int warn_invalid_offsetof = 1;
608 /* Nonzero means warn about implicit declarations. */
610 int warn_implicit = 1;
612 /* Nonzero means warn when all ctors or dtors are private, and the class
615 int warn_ctor_dtor_privacy = 0;
617 /* Nonzero means warn in function declared in derived class has the
618 same name as a virtual in the base class, but fails to match the
619 type signature of any virtual function in the base class. */
621 int warn_overloaded_virtual;
623 /* Nonzero means warn when declaring a class that has a non virtual
624 destructor, when it really ought to have a virtual one. */
628 /* Nonzero means warn when the compiler will reorder code. */
632 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
636 /* Nonzero means warn when we convert a pointer to member function
637 into a pointer to (void or function). */
639 int warn_pmf2ptr = 1;
641 /* Nonzero means warn about violation of some Effective C++ style rules. */
645 /* Nonzero means warn where overload resolution chooses a promotion from
646 unsigned to signed over a conversion to an unsigned of the same size. */
650 /* Nonzero means warn when an old-style cast is used. */
652 int warn_old_style_cast;
654 /* Nonzero means warn when non-templatized friend functions are
655 declared within a template */
657 int warn_nontemplate_friend = 1;
659 /* Nonzero means complain about deprecated features. */
661 int warn_deprecated = 1;
663 /* Maximum template instantiation depth. This limit is rather
664 arbitrary, but it exists to limit the time it takes to notice
665 infinite template instantiations. */
667 int max_tinst_depth = 500;
671 /* The elements of `ridpointers' are identifier nodes for the reserved
672 type names and storage classes. It is indexed by a RID_... value. */
675 tree (*make_fname_decl) (tree, int);
677 /* If non-NULL, the address of a language-specific function that takes
678 any action required right before expand_function_end is called. */
679 void (*lang_expand_function_end) (void);
681 /* Nonzero means the expression being parsed will never be evaluated.
682 This is a count, since unevaluated expressions can nest. */
685 /* Information about how a function name is generated. */
688 tree *const decl; /* pointer to the VAR_DECL. */
689 const unsigned rid; /* RID number for the identifier. */
690 const int pretty; /* How pretty is it? */
693 /* The three ways of getting then name of the current function. */
695 const struct fname_var_t fname_vars[] =
697 /* C99 compliant __func__, must be first. */
698 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
699 /* GCC __FUNCTION__ compliant. */
700 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
701 /* GCC __PRETTY_FUNCTION__ compliant. */
702 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
706 static int constant_fits_type_p (tree, tree);
708 /* Keep a stack of if statements. We record the number of compound
709 statements seen up to the if keyword, as well as the line number
710 and file of the if. If a potentially ambiguous else is seen, that
711 fact is recorded; the warning is issued when we can be sure that
712 the enclosing if statement does not have an else branch. */
721 static if_elt *if_stack;
723 /* Amount of space in the if statement stack. */
724 static int if_stack_space = 0;
727 static int if_stack_pointer = 0;
729 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
730 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
731 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
732 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
733 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
734 static tree handle_always_inline_attribute (tree *, tree, tree, int,
736 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
737 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
738 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
739 static tree handle_transparent_union_attribute (tree *, tree, tree,
741 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
742 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
743 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
744 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
745 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
746 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
747 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
748 static tree handle_visibility_attribute (tree *, tree, tree, int,
750 static tree handle_tls_model_attribute (tree *, tree, tree, int,
752 static tree handle_no_instrument_function_attribute (tree *, tree,
754 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
755 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
757 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
758 static tree handle_deprecated_attribute (tree *, tree, tree, int,
760 static tree handle_vector_size_attribute (tree *, tree, tree, int,
762 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
763 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
764 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
765 static tree vector_size_helper (tree, tree);
767 static void check_function_nonnull (tree, tree);
768 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
769 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
770 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
771 static int resort_field_decl_cmp (const void *, const void *);
773 /* Table of machine-independent attributes common to all C-like languages. */
774 const struct attribute_spec c_common_attribute_table[] =
776 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
777 { "packed", 0, 0, false, false, false,
778 handle_packed_attribute },
779 { "nocommon", 0, 0, true, false, false,
780 handle_nocommon_attribute },
781 { "common", 0, 0, true, false, false,
782 handle_common_attribute },
783 /* FIXME: logically, noreturn attributes should be listed as
784 "false, true, true" and apply to function types. But implementing this
785 would require all the places in the compiler that use TREE_THIS_VOLATILE
786 on a decl to identify non-returning functions to be located and fixed
787 to check the function type instead. */
788 { "noreturn", 0, 0, true, false, false,
789 handle_noreturn_attribute },
790 { "volatile", 0, 0, true, false, false,
791 handle_noreturn_attribute },
792 { "noinline", 0, 0, true, false, false,
793 handle_noinline_attribute },
794 { "always_inline", 0, 0, true, false, false,
795 handle_always_inline_attribute },
796 { "used", 0, 0, true, false, false,
797 handle_used_attribute },
798 { "unused", 0, 0, false, false, false,
799 handle_unused_attribute },
800 /* The same comments as for noreturn attributes apply to const ones. */
801 { "const", 0, 0, true, false, false,
802 handle_const_attribute },
803 { "transparent_union", 0, 0, false, false, false,
804 handle_transparent_union_attribute },
805 { "constructor", 0, 0, true, false, false,
806 handle_constructor_attribute },
807 { "destructor", 0, 0, true, false, false,
808 handle_destructor_attribute },
809 { "mode", 1, 1, false, true, false,
810 handle_mode_attribute },
811 { "section", 1, 1, true, false, false,
812 handle_section_attribute },
813 { "aligned", 0, 1, false, false, false,
814 handle_aligned_attribute },
815 { "weak", 0, 0, true, false, false,
816 handle_weak_attribute },
817 { "alias", 1, 1, true, false, false,
818 handle_alias_attribute },
819 { "no_instrument_function", 0, 0, true, false, false,
820 handle_no_instrument_function_attribute },
821 { "malloc", 0, 0, true, false, false,
822 handle_malloc_attribute },
823 { "no_stack_limit", 0, 0, true, false, false,
824 handle_no_limit_stack_attribute },
825 { "pure", 0, 0, true, false, false,
826 handle_pure_attribute },
827 { "deprecated", 0, 0, false, false, false,
828 handle_deprecated_attribute },
829 { "vector_size", 1, 1, false, true, false,
830 handle_vector_size_attribute },
831 { "visibility", 1, 1, true, false, false,
832 handle_visibility_attribute },
833 { "tls_model", 1, 1, true, false, false,
834 handle_tls_model_attribute },
835 { "nonnull", 0, -1, false, true, true,
836 handle_nonnull_attribute },
837 { "nothrow", 0, 0, true, false, false,
838 handle_nothrow_attribute },
839 { "may_alias", 0, 0, false, true, false, NULL },
840 { "cleanup", 1, 1, true, false, false,
841 handle_cleanup_attribute },
842 { NULL, 0, 0, false, false, false, NULL }
845 /* Give the specifications for the format attributes, used by C and all
848 const struct attribute_spec c_common_format_attribute_table[] =
850 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
851 { "format", 3, 3, false, true, true,
852 handle_format_attribute },
853 { "format_arg", 1, 1, false, true, true,
854 handle_format_arg_attribute },
855 { NULL, 0, 0, false, false, false, NULL }
858 /* Record the start of an if-then, and record the start of it
859 for ambiguous else detection.
861 COND is the condition for the if-then statement.
863 IF_STMT is the statement node that has already been created for
864 this if-then statement. It is created before parsing the
865 condition to keep line number information accurate. */
868 c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
870 /* Make sure there is enough space on the stack. */
871 if (if_stack_space == 0)
874 if_stack = xmalloc (10 * sizeof (if_elt));
876 else if (if_stack_space == if_stack_pointer)
878 if_stack_space += 10;
879 if_stack = xrealloc (if_stack, if_stack_space * sizeof (if_elt));
882 IF_COND (if_stmt) = cond;
885 /* Record this if statement. */
886 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
887 if_stack[if_stack_pointer].locus = input_location;
888 if_stack[if_stack_pointer].needs_warning = 0;
889 if_stack[if_stack_pointer].if_stmt = if_stmt;
893 /* Called after the then-clause for an if-statement is processed. */
898 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
899 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
902 /* Record the end of an if-then. Optionally warn if a nested
903 if statement had an ambiguous else clause. */
906 c_expand_end_cond (void)
909 if (if_stack[if_stack_pointer].needs_warning)
910 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
911 &if_stack[if_stack_pointer].locus);
912 last_expr_type = NULL_TREE;
915 /* Called between the then-clause and the else-clause
916 of an if-then-else. */
919 c_expand_start_else (void)
921 /* An ambiguous else warning must be generated for the enclosing if
922 statement, unless we see an else branch for that one, too. */
924 && if_stack_pointer > 1
925 && (if_stack[if_stack_pointer - 1].compstmt_count
926 == if_stack[if_stack_pointer - 2].compstmt_count))
927 if_stack[if_stack_pointer - 2].needs_warning = 1;
929 /* Even if a nested if statement had an else branch, it can't be
930 ambiguous if this one also has an else. So don't warn in that
931 case. Also don't warn for any if statements nested in this else. */
932 if_stack[if_stack_pointer - 1].needs_warning = 0;
933 if_stack[if_stack_pointer - 1].compstmt_count--;
936 /* Called after the else-clause for an if-statement is processed. */
941 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
942 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
945 /* Begin an if-statement. Returns a newly created IF_STMT if
948 Unlike the C++ front-end, we do not call add_stmt here; it is
949 probably safe to do so, but I am not very familiar with this
950 code so I am being extra careful not to change its behavior
951 beyond what is strictly necessary for correctness. */
954 c_begin_if_stmt (void)
957 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
961 /* Begin a while statement. Returns a newly created WHILE_STMT if
964 Unlike the C++ front-end, we do not call add_stmt here; it is
965 probably safe to do so, but I am not very familiar with this
966 code so I am being extra careful not to change its behavior
967 beyond what is strictly necessary for correctness. */
970 c_begin_while_stmt (void)
973 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
978 c_finish_while_stmt_cond (tree cond, tree while_stmt)
980 WHILE_COND (while_stmt) = cond;
983 /* Push current bindings for the function name VAR_DECLS. */
986 start_fname_decls (void)
989 tree saved = NULL_TREE;
991 for (ix = 0; fname_vars[ix].decl; ix++)
993 tree decl = *fname_vars[ix].decl;
997 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
998 *fname_vars[ix].decl = NULL_TREE;
1001 if (saved || saved_function_name_decls)
1002 /* Normally they'll have been NULL, so only push if we've got a
1003 stack, or they are non-NULL. */
1004 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1005 saved_function_name_decls);
1008 /* Finish up the current bindings, adding them into the
1009 current function's statement tree. This is done by wrapping the
1010 function's body in a COMPOUND_STMT containing these decls too. This
1011 must be done _before_ finish_stmt_tree is called. If there is no
1012 current function, we must be at file scope and no statements are
1013 involved. Pop the previous bindings. */
1016 finish_fname_decls (void)
1019 tree body = NULL_TREE;
1020 tree stack = saved_function_name_decls;
1022 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1023 body = chainon (TREE_VALUE (stack), body);
1027 /* They were called into existence, so add to statement tree. Add
1028 the DECL_STMTs inside the outermost scope. */
1029 tree *p = &DECL_SAVED_TREE (current_function_decl);
1030 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1031 while (TREE_CODE (*p) != COMPOUND_STMT)
1032 p = &TREE_CHAIN (*p);
1033 p = &COMPOUND_BODY (*p);
1034 if (TREE_CODE (*p) == SCOPE_STMT)
1035 p = &TREE_CHAIN (*p);
1037 body = chainon (body, *p);
1041 for (ix = 0; fname_vars[ix].decl; ix++)
1042 *fname_vars[ix].decl = NULL_TREE;
1046 /* We had saved values, restore them. */
1049 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1051 tree decl = TREE_PURPOSE (saved);
1052 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1054 *fname_vars[ix].decl = decl;
1056 stack = TREE_CHAIN (stack);
1058 saved_function_name_decls = stack;
1061 /* Return the text name of the current function, suitably prettified
1065 fname_as_string (int pretty_p)
1067 const char *name = NULL;
1070 name = (current_function_decl
1071 ? (*lang_hooks.decl_printable_name) (current_function_decl, 2)
1073 else if (current_function_decl && DECL_NAME (current_function_decl))
1074 name = IDENTIFIER_POINTER (DECL_NAME (current_function_decl));
1080 /* Return the VAR_DECL for a const char array naming the current
1081 function. If the VAR_DECL has not yet been created, create it
1082 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1083 ID is its name (unfortunately C and C++ hold the RID values of
1084 keywords in different places, so we can't derive RID from ID in
1085 this language independent code. */
1088 fname_decl (unsigned int rid, tree id)
1091 tree decl = NULL_TREE;
1093 for (ix = 0; fname_vars[ix].decl; ix++)
1094 if (fname_vars[ix].rid == rid)
1097 decl = *fname_vars[ix].decl;
1100 tree saved_last_tree = last_tree;
1101 /* If a tree is built here, it would normally have the lineno of
1102 the current statement. Later this tree will be moved to the
1103 beginning of the function and this line number will be wrong.
1104 To avoid this problem set the lineno to 0 here; that prevents
1105 it from appearing in the RTL. */
1106 int saved_lineno = input_line;
1109 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1110 if (last_tree != saved_last_tree)
1112 /* We created some statement tree for the decl. This belongs
1113 at the start of the function, so remove it now and reinsert
1114 it after the function is complete. */
1115 tree stmts = TREE_CHAIN (saved_last_tree);
1117 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1118 last_tree = saved_last_tree;
1119 saved_function_name_decls = tree_cons (decl, stmts,
1120 saved_function_name_decls);
1122 *fname_vars[ix].decl = decl;
1123 input_line = saved_lineno;
1125 if (!ix && !current_function_decl)
1126 pedwarn ("%H'%D' is not defined outside of function scope",
1127 &DECL_SOURCE_LOCATION (decl), decl);
1132 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1135 fix_string_type (tree value)
1137 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1138 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1139 const int nchars_max = flag_isoc99 ? 4095 : 509;
1140 int length = TREE_STRING_LENGTH (value);
1143 /* Compute the number of elements, for the array type. */
1144 nchars = wide_flag ? length / wchar_bytes : length;
1146 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1147 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1148 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1150 /* Create the array type for the string constant.
1151 -Wwrite-strings says make the string constant an array of const char
1152 so that copying it to a non-const pointer will get a warning.
1153 For C++, this is the standard behavior. */
1154 if (flag_const_strings && ! flag_writable_strings)
1157 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1160 = build_array_type (elements,
1161 build_index_type (build_int_2 (nchars - 1, 0)));
1165 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1166 build_index_type (build_int_2 (nchars - 1, 0)));
1168 TREE_CONSTANT (value) = 1;
1169 TREE_READONLY (value) = ! flag_writable_strings;
1170 TREE_STATIC (value) = 1;
1174 /* Print a warning if a constant expression had overflow in folding.
1175 Invoke this function on every expression that the language
1176 requires to be a constant expression.
1177 Note the ANSI C standard says it is erroneous for a
1178 constant expression to overflow. */
1181 constant_expression_warning (tree value)
1183 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1184 || TREE_CODE (value) == VECTOR_CST
1185 || TREE_CODE (value) == COMPLEX_CST)
1186 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1187 pedwarn ("overflow in constant expression");
1190 /* Print a warning if an expression had overflow in folding.
1191 Invoke this function on every expression that
1192 (1) appears in the source code, and
1193 (2) might be a constant expression that overflowed, and
1194 (3) is not already checked by convert_and_check;
1195 however, do not invoke this function on operands of explicit casts. */
1198 overflow_warning (tree value)
1200 if ((TREE_CODE (value) == INTEGER_CST
1201 || (TREE_CODE (value) == COMPLEX_CST
1202 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1203 && TREE_OVERFLOW (value))
1205 TREE_OVERFLOW (value) = 0;
1206 if (skip_evaluation == 0)
1207 warning ("integer overflow in expression");
1209 else if ((TREE_CODE (value) == REAL_CST
1210 || (TREE_CODE (value) == COMPLEX_CST
1211 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1212 && TREE_OVERFLOW (value))
1214 TREE_OVERFLOW (value) = 0;
1215 if (skip_evaluation == 0)
1216 warning ("floating point overflow in expression");
1218 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1220 TREE_OVERFLOW (value) = 0;
1221 if (skip_evaluation == 0)
1222 warning ("vector overflow in expression");
1226 /* Print a warning if a large constant is truncated to unsigned,
1227 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1228 Invoke this function on every expression that might be implicitly
1229 converted to an unsigned type. */
1232 unsigned_conversion_warning (tree result, tree operand)
1234 tree type = TREE_TYPE (result);
1236 if (TREE_CODE (operand) == INTEGER_CST
1237 && TREE_CODE (type) == INTEGER_TYPE
1238 && TREE_UNSIGNED (type)
1239 && skip_evaluation == 0
1240 && !int_fits_type_p (operand, type))
1242 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1243 /* This detects cases like converting -129 or 256 to unsigned char. */
1244 warning ("large integer implicitly truncated to unsigned type");
1245 else if (warn_conversion)
1246 warning ("negative integer implicitly converted to unsigned type");
1250 /* Nonzero if constant C has a value that is permissible
1251 for type TYPE (an INTEGER_TYPE). */
1254 constant_fits_type_p (tree c, tree type)
1256 if (TREE_CODE (c) == INTEGER_CST)
1257 return int_fits_type_p (c, type);
1259 c = convert (type, c);
1260 return !TREE_OVERFLOW (c);
1263 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1264 Invoke this function on every expression that is converted implicitly,
1265 i.e. because of language rules and not because of an explicit cast. */
1268 convert_and_check (tree type, tree expr)
1270 tree t = convert (type, expr);
1271 if (TREE_CODE (t) == INTEGER_CST)
1273 if (TREE_OVERFLOW (t))
1275 TREE_OVERFLOW (t) = 0;
1277 /* Do not diagnose overflow in a constant expression merely
1278 because a conversion overflowed. */
1279 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1281 /* No warning for converting 0x80000000 to int. */
1282 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1283 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1284 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1285 /* If EXPR fits in the unsigned version of TYPE,
1286 don't warn unless pedantic. */
1288 || TREE_UNSIGNED (type)
1289 || ! constant_fits_type_p (expr,
1290 c_common_unsigned_type (type)))
1291 && skip_evaluation == 0)
1292 warning ("overflow in implicit constant conversion");
1295 unsigned_conversion_warning (t, expr);
1300 /* A node in a list that describes references to variables (EXPR), which are
1301 either read accesses if WRITER is zero, or write accesses, in which case
1302 WRITER is the parent of EXPR. */
1309 /* Used to implement a cache the results of a call to verify_tree. We only
1310 use this for SAVE_EXPRs. */
1313 struct tlist_cache *next;
1314 struct tlist *cache_before_sp;
1315 struct tlist *cache_after_sp;
1319 /* Obstack to use when allocating tlist structures, and corresponding
1321 static struct obstack tlist_obstack;
1322 static char *tlist_firstobj = 0;
1324 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1326 static struct tlist *warned_ids;
1327 /* SAVE_EXPRs need special treatment. We process them only once and then
1328 cache the results. */
1329 static struct tlist_cache *save_expr_cache;
1331 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1332 static void merge_tlist (struct tlist **, struct tlist *, int);
1333 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1334 static int warning_candidate_p (tree);
1335 static void warn_for_collisions (struct tlist *);
1336 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1337 static struct tlist *new_tlist (struct tlist *, tree, tree);
1338 static void verify_sequence_points (tree);
1340 /* Create a new struct tlist and fill in its fields. */
1341 static struct tlist *
1342 new_tlist (struct tlist *next, tree t, tree writer)
1345 l = obstack_alloc (&tlist_obstack, sizeof *l);
1352 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1353 is nonnull, we ignore any node we find which has a writer equal to it. */
1356 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1360 struct tlist *next = add->next;
1363 if (! exclude_writer || add->writer != exclude_writer)
1364 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1369 /* Merge the nodes of ADD into TO. This merging process is done so that for
1370 each variable that already exists in TO, no new node is added; however if
1371 there is a write access recorded in ADD, and an occurrence on TO is only
1372 a read access, then the occurrence in TO will be modified to record the
1376 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1378 struct tlist **end = to;
1381 end = &(*end)->next;
1387 struct tlist *next = add->next;
1389 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1390 if (tmp2->expr == add->expr)
1394 tmp2->writer = add->writer;
1398 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1399 end = &(*end)->next;
1406 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1407 references in list LIST conflict with it, excluding reads if ONLY writers
1411 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1416 /* Avoid duplicate warnings. */
1417 for (tmp = warned_ids; tmp; tmp = tmp->next)
1418 if (tmp->expr == written)
1423 if (list->expr == written
1424 && list->writer != writer
1425 && (! only_writes || list->writer))
1427 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1428 warning ("operation on `%s' may be undefined",
1429 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1435 /* Given a list LIST of references to variables, find whether any of these
1436 can cause conflicts due to missing sequence points. */
1439 warn_for_collisions (struct tlist *list)
1443 for (tmp = list; tmp; tmp = tmp->next)
1446 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1450 /* Return nonzero if X is a tree that can be verified by the sequence point
1453 warning_candidate_p (tree x)
1455 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1458 /* Walk the tree X, and record accesses to variables. If X is written by the
1459 parent tree, WRITER is the parent.
1460 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1461 expression or its only operand forces a sequence point, then everything up
1462 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1464 Once we return, we will have emitted warnings if any subexpression before
1465 such a sequence point could be undefined. On a higher level, however, the
1466 sequence point may not be relevant, and we'll merge the two lists.
1468 Example: (b++, a) + b;
1469 The call that processes the COMPOUND_EXPR will store the increment of B
1470 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1471 processes the PLUS_EXPR will need to merge the two lists so that
1472 eventually, all accesses end up on the same list (and we'll warn about the
1473 unordered subexpressions b++ and b.
1475 A note on merging. If we modify the former example so that our expression
1478 care must be taken not simply to add all three expressions into the final
1479 PNO_SP list. The function merge_tlist takes care of that by merging the
1480 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1481 way, so that no more than one access to B is recorded. */
1484 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1487 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1488 enum tree_code code;
1491 /* X may be NULL if it is the operand of an empty statement expression
1497 code = TREE_CODE (x);
1498 class = TREE_CODE_CLASS (code);
1500 if (warning_candidate_p (x))
1502 *pno_sp = new_tlist (*pno_sp, x, writer);
1512 case TRUTH_ANDIF_EXPR:
1513 case TRUTH_ORIF_EXPR:
1514 tmp_before = tmp_nosp = tmp_list3 = 0;
1515 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1516 warn_for_collisions (tmp_nosp);
1517 merge_tlist (pbefore_sp, tmp_before, 0);
1518 merge_tlist (pbefore_sp, tmp_nosp, 0);
1519 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1520 merge_tlist (pbefore_sp, tmp_list3, 0);
1524 tmp_before = tmp_list2 = 0;
1525 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1526 warn_for_collisions (tmp_list2);
1527 merge_tlist (pbefore_sp, tmp_before, 0);
1528 merge_tlist (pbefore_sp, tmp_list2, 1);
1530 tmp_list3 = tmp_nosp = 0;
1531 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1532 warn_for_collisions (tmp_nosp);
1533 merge_tlist (pbefore_sp, tmp_list3, 0);
1535 tmp_list3 = tmp_list2 = 0;
1536 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1537 warn_for_collisions (tmp_list2);
1538 merge_tlist (pbefore_sp, tmp_list3, 0);
1539 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1540 two first, to avoid warning for (a ? b++ : b++). */
1541 merge_tlist (&tmp_nosp, tmp_list2, 0);
1542 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1545 case PREDECREMENT_EXPR:
1546 case PREINCREMENT_EXPR:
1547 case POSTDECREMENT_EXPR:
1548 case POSTINCREMENT_EXPR:
1549 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1553 tmp_before = tmp_nosp = tmp_list3 = 0;
1554 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1555 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1556 /* Expressions inside the LHS are not ordered wrt. the sequence points
1557 in the RHS. Example:
1559 Despite the fact that the modification of "a" is in the before_sp
1560 list (tmp_before), it conflicts with the use of "a" in the LHS.
1561 We can handle this by adding the contents of tmp_list3
1562 to those of tmp_before, and redoing the collision warnings for that
1564 add_tlist (&tmp_before, tmp_list3, x, 1);
1565 warn_for_collisions (tmp_before);
1566 /* Exclude the LHS itself here; we first have to merge it into the
1567 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1568 didn't exclude the LHS, we'd get it twice, once as a read and once
1570 add_tlist (pno_sp, tmp_list3, x, 0);
1571 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1573 merge_tlist (pbefore_sp, tmp_before, 0);
1574 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1575 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1576 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1580 /* We need to warn about conflicts among arguments and conflicts between
1581 args and the function address. Side effects of the function address,
1582 however, are not ordered by the sequence point of the call. */
1583 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1584 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1585 if (TREE_OPERAND (x, 1))
1586 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1587 merge_tlist (&tmp_list3, tmp_list2, 0);
1588 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1589 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1590 warn_for_collisions (tmp_before);
1591 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1595 /* Scan all the list, e.g. indices of multi dimensional array. */
1598 tmp_before = tmp_nosp = 0;
1599 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1600 merge_tlist (&tmp_nosp, tmp_before, 0);
1601 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1608 struct tlist_cache *t;
1609 for (t = save_expr_cache; t; t = t->next)
1615 t = obstack_alloc (&tlist_obstack, sizeof *t);
1616 t->next = save_expr_cache;
1618 save_expr_cache = t;
1620 tmp_before = tmp_nosp = 0;
1621 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1622 warn_for_collisions (tmp_nosp);
1627 struct tlist *t = tmp_nosp;
1629 merge_tlist (&tmp_list3, t, 0);
1631 t->cache_before_sp = tmp_before;
1632 t->cache_after_sp = tmp_list3;
1634 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1635 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1644 if (first_rtl_op (code) == 0)
1646 x = TREE_OPERAND (x, 0);
1662 int max = first_rtl_op (TREE_CODE (x));
1663 for (lp = 0; lp < max; lp++)
1665 tmp_before = tmp_nosp = 0;
1666 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1667 merge_tlist (&tmp_nosp, tmp_before, 0);
1668 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1675 /* Try to warn for undefined behavior in EXPR due to missing sequence
1679 verify_sequence_points (tree expr)
1681 struct tlist *before_sp = 0, *after_sp = 0;
1684 save_expr_cache = 0;
1685 if (tlist_firstobj == 0)
1687 gcc_obstack_init (&tlist_obstack);
1688 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1691 verify_tree (expr, &before_sp, &after_sp, 0);
1692 warn_for_collisions (after_sp);
1693 obstack_free (&tlist_obstack, tlist_firstobj);
1697 c_expand_expr_stmt (tree expr)
1699 /* Do default conversion if safe and possibly important,
1700 in case within ({...}). */
1701 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1702 && (flag_isoc99 || lvalue_p (expr)))
1703 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1704 expr = default_conversion (expr);
1706 if (warn_sequence_point)
1707 verify_sequence_points (expr);
1709 if (TREE_TYPE (expr) != error_mark_node
1710 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1711 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1712 error ("expression statement has incomplete type");
1714 last_expr_type = TREE_TYPE (expr);
1715 return add_stmt (build_stmt (EXPR_STMT, expr));
1718 /* Validate the expression after `case' and apply default promotions. */
1721 check_case_value (tree value)
1723 if (value == NULL_TREE)
1726 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1727 STRIP_TYPE_NOPS (value);
1728 /* In C++, the following is allowed:
1731 switch (...) { case i: ... }
1733 So, we try to reduce the VALUE to a constant that way. */
1734 if (c_dialect_cxx ())
1736 value = decl_constant_value (value);
1737 STRIP_TYPE_NOPS (value);
1738 value = fold (value);
1741 if (TREE_CODE (value) != INTEGER_CST
1742 && value != error_mark_node)
1744 error ("case label does not reduce to an integer constant");
1745 value = error_mark_node;
1748 /* Promote char or short to int. */
1749 value = default_conversion (value);
1751 constant_expression_warning (value);
1756 /* Return an integer type with BITS bits of precision,
1757 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1760 c_common_type_for_size (unsigned int bits, int unsignedp)
1762 if (bits == TYPE_PRECISION (integer_type_node))
1763 return unsignedp ? unsigned_type_node : integer_type_node;
1765 if (bits == TYPE_PRECISION (signed_char_type_node))
1766 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1768 if (bits == TYPE_PRECISION (short_integer_type_node))
1769 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1771 if (bits == TYPE_PRECISION (long_integer_type_node))
1772 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1774 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1775 return (unsignedp ? long_long_unsigned_type_node
1776 : long_long_integer_type_node);
1778 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1779 return (unsignedp ? widest_unsigned_literal_type_node
1780 : widest_integer_literal_type_node);
1782 if (bits <= TYPE_PRECISION (intQI_type_node))
1783 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1785 if (bits <= TYPE_PRECISION (intHI_type_node))
1786 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1788 if (bits <= TYPE_PRECISION (intSI_type_node))
1789 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1791 if (bits <= TYPE_PRECISION (intDI_type_node))
1792 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1797 /* Return a data type that has machine mode MODE.
1798 If the mode is an integer,
1799 then UNSIGNEDP selects between signed and unsigned types. */
1802 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1804 if (mode == TYPE_MODE (integer_type_node))
1805 return unsignedp ? unsigned_type_node : integer_type_node;
1807 if (mode == TYPE_MODE (signed_char_type_node))
1808 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1810 if (mode == TYPE_MODE (short_integer_type_node))
1811 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1813 if (mode == TYPE_MODE (long_integer_type_node))
1814 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1816 if (mode == TYPE_MODE (long_long_integer_type_node))
1817 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1819 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1820 return unsignedp ? widest_unsigned_literal_type_node
1821 : widest_integer_literal_type_node;
1824 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1827 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1830 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1833 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1835 #if HOST_BITS_PER_WIDE_INT >= 64
1836 if (mode == TYPE_MODE (intTI_type_node))
1837 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1840 if (mode == TYPE_MODE (float_type_node))
1841 return float_type_node;
1843 if (mode == TYPE_MODE (double_type_node))
1844 return double_type_node;
1846 if (mode == TYPE_MODE (long_double_type_node))
1847 return long_double_type_node;
1849 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1850 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1852 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1853 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1858 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1860 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1862 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
1864 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
1866 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
1868 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
1870 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
1872 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
1874 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
1876 return V16SF_type_node;
1878 return V4SF_type_node;
1880 return V2SF_type_node;
1882 return V2DF_type_node;
1884 return V4DF_type_node;
1892 /* Return an unsigned type the same as TYPE in other respects. */
1894 c_common_unsigned_type (tree type)
1896 tree type1 = TYPE_MAIN_VARIANT (type);
1897 if (type1 == signed_char_type_node || type1 == char_type_node)
1898 return unsigned_char_type_node;
1899 if (type1 == integer_type_node)
1900 return unsigned_type_node;
1901 if (type1 == short_integer_type_node)
1902 return short_unsigned_type_node;
1903 if (type1 == long_integer_type_node)
1904 return long_unsigned_type_node;
1905 if (type1 == long_long_integer_type_node)
1906 return long_long_unsigned_type_node;
1907 if (type1 == widest_integer_literal_type_node)
1908 return widest_unsigned_literal_type_node;
1909 #if HOST_BITS_PER_WIDE_INT >= 64
1910 if (type1 == intTI_type_node)
1911 return unsigned_intTI_type_node;
1913 if (type1 == intDI_type_node)
1914 return unsigned_intDI_type_node;
1915 if (type1 == intSI_type_node)
1916 return unsigned_intSI_type_node;
1917 if (type1 == intHI_type_node)
1918 return unsigned_intHI_type_node;
1919 if (type1 == intQI_type_node)
1920 return unsigned_intQI_type_node;
1922 return c_common_signed_or_unsigned_type (1, type);
1925 /* Return a signed type the same as TYPE in other respects. */
1928 c_common_signed_type (tree type)
1930 tree type1 = TYPE_MAIN_VARIANT (type);
1931 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1932 return signed_char_type_node;
1933 if (type1 == unsigned_type_node)
1934 return integer_type_node;
1935 if (type1 == short_unsigned_type_node)
1936 return short_integer_type_node;
1937 if (type1 == long_unsigned_type_node)
1938 return long_integer_type_node;
1939 if (type1 == long_long_unsigned_type_node)
1940 return long_long_integer_type_node;
1941 if (type1 == widest_unsigned_literal_type_node)
1942 return widest_integer_literal_type_node;
1943 #if HOST_BITS_PER_WIDE_INT >= 64
1944 if (type1 == unsigned_intTI_type_node)
1945 return intTI_type_node;
1947 if (type1 == unsigned_intDI_type_node)
1948 return intDI_type_node;
1949 if (type1 == unsigned_intSI_type_node)
1950 return intSI_type_node;
1951 if (type1 == unsigned_intHI_type_node)
1952 return intHI_type_node;
1953 if (type1 == unsigned_intQI_type_node)
1954 return intQI_type_node;
1956 return c_common_signed_or_unsigned_type (0, type);
1959 /* Return a type the same as TYPE except unsigned or
1960 signed according to UNSIGNEDP. */
1963 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1965 if (! INTEGRAL_TYPE_P (type)
1966 || TREE_UNSIGNED (type) == unsignedp)
1969 if (TYPE_PRECISION (type) == TYPE_PRECISION (signed_char_type_node))
1970 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1971 if (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1972 return unsignedp ? unsigned_type_node : integer_type_node;
1973 if (TYPE_PRECISION (type) == TYPE_PRECISION (short_integer_type_node))
1974 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1975 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_integer_type_node))
1976 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1977 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_long_integer_type_node))
1978 return (unsignedp ? long_long_unsigned_type_node
1979 : long_long_integer_type_node);
1980 if (TYPE_PRECISION (type) == TYPE_PRECISION (widest_integer_literal_type_node))
1981 return (unsignedp ? widest_unsigned_literal_type_node
1982 : widest_integer_literal_type_node);
1984 #if HOST_BITS_PER_WIDE_INT >= 64
1985 if (TYPE_PRECISION (type) == TYPE_PRECISION (intTI_type_node))
1986 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1988 if (TYPE_PRECISION (type) == TYPE_PRECISION (intDI_type_node))
1989 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1990 if (TYPE_PRECISION (type) == TYPE_PRECISION (intSI_type_node))
1991 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1992 if (TYPE_PRECISION (type) == TYPE_PRECISION (intHI_type_node))
1993 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1994 if (TYPE_PRECISION (type) == TYPE_PRECISION (intQI_type_node))
1995 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2000 /* Return the minimum number of bits needed to represent VALUE in a
2001 signed or unsigned type, UNSIGNEDP says which. */
2004 min_precision (tree value, int unsignedp)
2008 /* If the value is negative, compute its negative minus 1. The latter
2009 adjustment is because the absolute value of the largest negative value
2010 is one larger than the largest positive value. This is equivalent to
2011 a bit-wise negation, so use that operation instead. */
2013 if (tree_int_cst_sgn (value) < 0)
2014 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2016 /* Return the number of bits needed, taking into account the fact
2017 that we need one more bit for a signed than unsigned type. */
2019 if (integer_zerop (value))
2022 log = tree_floor_log2 (value);
2024 return log + 1 + ! unsignedp;
2027 /* Print an error message for invalid operands to arith operation
2028 CODE. NOP_EXPR is used as a special case (see
2029 c_common_truthvalue_conversion). */
2032 binary_op_error (enum tree_code code)
2039 error ("invalid truth-value expression");
2043 opname = "+"; break;
2045 opname = "-"; break;
2047 opname = "*"; break;
2049 opname = "max"; break;
2051 opname = "min"; break;
2053 opname = "=="; break;
2055 opname = "!="; break;
2057 opname = "<="; break;
2059 opname = ">="; break;
2061 opname = "<"; break;
2063 opname = ">"; break;
2065 opname = "<<"; break;
2067 opname = ">>"; break;
2068 case TRUNC_MOD_EXPR:
2069 case FLOOR_MOD_EXPR:
2070 opname = "%"; break;
2071 case TRUNC_DIV_EXPR:
2072 case FLOOR_DIV_EXPR:
2073 opname = "/"; break;
2075 opname = "&"; break;
2077 opname = "|"; break;
2078 case TRUTH_ANDIF_EXPR:
2079 opname = "&&"; break;
2080 case TRUTH_ORIF_EXPR:
2081 opname = "||"; break;
2083 opname = "^"; break;
2086 opname = "rotate"; break;
2088 opname = "unknown"; break;
2090 error ("invalid operands to binary %s", opname);
2093 /* Subroutine of build_binary_op, used for comparison operations.
2094 See if the operands have both been converted from subword integer types
2095 and, if so, perhaps change them both back to their original type.
2096 This function is also responsible for converting the two operands
2097 to the proper common type for comparison.
2099 The arguments of this function are all pointers to local variables
2100 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2101 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2103 If this function returns nonzero, it means that the comparison has
2104 a constant value. What this function returns is an expression for
2108 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2109 enum tree_code *rescode_ptr)
2112 tree op0 = *op0_ptr;
2113 tree op1 = *op1_ptr;
2114 int unsignedp0, unsignedp1;
2116 tree primop0, primop1;
2117 enum tree_code code = *rescode_ptr;
2119 /* Throw away any conversions to wider types
2120 already present in the operands. */
2122 primop0 = get_narrower (op0, &unsignedp0);
2123 primop1 = get_narrower (op1, &unsignedp1);
2125 /* Handle the case that OP0 does not *contain* a conversion
2126 but it *requires* conversion to FINAL_TYPE. */
2128 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2129 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2130 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2131 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2133 /* If one of the operands must be floated, we cannot optimize. */
2134 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2135 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2137 /* If first arg is constant, swap the args (changing operation
2138 so value is preserved), for canonicalization. Don't do this if
2139 the second arg is 0. */
2141 if (TREE_CONSTANT (primop0)
2142 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2145 int temi = unsignedp0;
2153 unsignedp0 = unsignedp1;
2176 *rescode_ptr = code;
2179 /* If comparing an integer against a constant more bits wide,
2180 maybe we can deduce a value of 1 or 0 independent of the data.
2181 Or else truncate the constant now
2182 rather than extend the variable at run time.
2184 This is only interesting if the constant is the wider arg.
2185 Also, it is not safe if the constant is unsigned and the
2186 variable arg is signed, since in this case the variable
2187 would be sign-extended and then regarded as unsigned.
2188 Our technique fails in this case because the lowest/highest
2189 possible unsigned results don't follow naturally from the
2190 lowest/highest possible values of the variable operand.
2191 For just EQ_EXPR and NE_EXPR there is another technique that
2192 could be used: see if the constant can be faithfully represented
2193 in the other operand's type, by truncating it and reextending it
2194 and see if that preserves the constant's value. */
2196 if (!real1 && !real2
2197 && TREE_CODE (primop1) == INTEGER_CST
2198 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2200 int min_gt, max_gt, min_lt, max_lt;
2201 tree maxval, minval;
2202 /* 1 if comparison is nominally unsigned. */
2203 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2206 type = c_common_signed_or_unsigned_type (unsignedp0,
2207 TREE_TYPE (primop0));
2209 /* In C, if TYPE is an enumeration, then we need to get its
2210 min/max values from it's underlying integral type, not the
2211 enumerated type itself. In C++, TYPE_MAX_VALUE and
2212 TYPE_MIN_VALUE have already been set correctly on the
2213 enumeration type. */
2214 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
2215 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2217 maxval = TYPE_MAX_VALUE (type);
2218 minval = TYPE_MIN_VALUE (type);
2220 if (unsignedp && !unsignedp0)
2221 *restype_ptr = c_common_signed_type (*restype_ptr);
2223 if (TREE_TYPE (primop1) != *restype_ptr)
2224 primop1 = convert (*restype_ptr, primop1);
2225 if (type != *restype_ptr)
2227 minval = convert (*restype_ptr, minval);
2228 maxval = convert (*restype_ptr, maxval);
2231 if (unsignedp && unsignedp0)
2233 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2234 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2235 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2236 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2240 min_gt = INT_CST_LT (primop1, minval);
2241 max_gt = INT_CST_LT (primop1, maxval);
2242 min_lt = INT_CST_LT (minval, primop1);
2243 max_lt = INT_CST_LT (maxval, primop1);
2247 /* This used to be a switch, but Genix compiler can't handle that. */
2248 if (code == NE_EXPR)
2250 if (max_lt || min_gt)
2251 val = truthvalue_true_node;
2253 else if (code == EQ_EXPR)
2255 if (max_lt || min_gt)
2256 val = truthvalue_false_node;
2258 else if (code == LT_EXPR)
2261 val = truthvalue_true_node;
2263 val = truthvalue_false_node;
2265 else if (code == GT_EXPR)
2268 val = truthvalue_true_node;
2270 val = truthvalue_false_node;
2272 else if (code == LE_EXPR)
2275 val = truthvalue_true_node;
2277 val = truthvalue_false_node;
2279 else if (code == GE_EXPR)
2282 val = truthvalue_true_node;
2284 val = truthvalue_false_node;
2287 /* If primop0 was sign-extended and unsigned comparison specd,
2288 we did a signed comparison above using the signed type bounds.
2289 But the comparison we output must be unsigned.
2291 Also, for inequalities, VAL is no good; but if the signed
2292 comparison had *any* fixed result, it follows that the
2293 unsigned comparison just tests the sign in reverse
2294 (positive values are LE, negative ones GE).
2295 So we can generate an unsigned comparison
2296 against an extreme value of the signed type. */
2298 if (unsignedp && !unsignedp0)
2305 primop1 = TYPE_MIN_VALUE (type);
2311 primop1 = TYPE_MAX_VALUE (type);
2318 type = c_common_unsigned_type (type);
2321 if (TREE_CODE (primop0) != INTEGER_CST)
2323 if (val == truthvalue_false_node)
2324 warning ("comparison is always false due to limited range of data type");
2325 if (val == truthvalue_true_node)
2326 warning ("comparison is always true due to limited range of data type");
2331 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2332 if (TREE_SIDE_EFFECTS (primop0))
2333 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2337 /* Value is not predetermined, but do the comparison
2338 in the type of the operand that is not constant.
2339 TYPE is already properly set. */
2341 else if (real1 && real2
2342 && (TYPE_PRECISION (TREE_TYPE (primop0))
2343 == TYPE_PRECISION (TREE_TYPE (primop1))))
2344 type = TREE_TYPE (primop0);
2346 /* If args' natural types are both narrower than nominal type
2347 and both extend in the same manner, compare them
2348 in the type of the wider arg.
2349 Otherwise must actually extend both to the nominal
2350 common type lest different ways of extending
2352 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2354 else if (unsignedp0 == unsignedp1 && real1 == real2
2355 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2356 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2358 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2359 type = c_common_signed_or_unsigned_type (unsignedp0
2360 || TREE_UNSIGNED (*restype_ptr),
2362 /* Make sure shorter operand is extended the right way
2363 to match the longer operand. */
2365 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2366 TREE_TYPE (primop0)),
2369 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2370 TREE_TYPE (primop1)),
2375 /* Here we must do the comparison on the nominal type
2376 using the args exactly as we received them. */
2377 type = *restype_ptr;
2381 if (!real1 && !real2 && integer_zerop (primop1)
2382 && TREE_UNSIGNED (*restype_ptr))
2388 /* All unsigned values are >= 0, so we warn if extra warnings
2389 are requested. However, if OP0 is a constant that is
2390 >= 0, the signedness of the comparison isn't an issue,
2391 so suppress the warning. */
2392 if (extra_warnings && !in_system_header
2393 && ! (TREE_CODE (primop0) == INTEGER_CST
2394 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2396 warning ("comparison of unsigned expression >= 0 is always true");
2397 value = truthvalue_true_node;
2401 if (extra_warnings && !in_system_header
2402 && ! (TREE_CODE (primop0) == INTEGER_CST
2403 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2405 warning ("comparison of unsigned expression < 0 is always false");
2406 value = truthvalue_false_node;
2415 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2416 if (TREE_SIDE_EFFECTS (primop0))
2417 return build (COMPOUND_EXPR, TREE_TYPE (value),
2424 *op0_ptr = convert (type, primop0);
2425 *op1_ptr = convert (type, primop1);
2427 *restype_ptr = truthvalue_type_node;
2432 /* Return a tree for the sum or difference (RESULTCODE says which)
2433 of pointer PTROP and integer INTOP. */
2436 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2443 /* The result is a pointer of the same type that is being added. */
2445 tree result_type = TREE_TYPE (ptrop);
2447 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2449 if (pedantic || warn_pointer_arith)
2450 pedwarn ("pointer of type `void *' used in arithmetic");
2451 size_exp = integer_one_node;
2453 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2455 if (pedantic || warn_pointer_arith)
2456 pedwarn ("pointer to a function used in arithmetic");
2457 size_exp = integer_one_node;
2459 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2461 if (pedantic || warn_pointer_arith)
2462 pedwarn ("pointer to member function used in arithmetic");
2463 size_exp = integer_one_node;
2465 else if (TREE_CODE (TREE_TYPE (result_type)) == OFFSET_TYPE)
2467 if (pedantic || warn_pointer_arith)
2468 pedwarn ("pointer to a member used in arithmetic");
2469 size_exp = integer_one_node;
2472 size_exp = size_in_bytes (TREE_TYPE (result_type));
2474 /* If what we are about to multiply by the size of the elements
2475 contains a constant term, apply distributive law
2476 and multiply that constant term separately.
2477 This helps produce common subexpressions. */
2479 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2480 && ! TREE_CONSTANT (intop)
2481 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2482 && TREE_CONSTANT (size_exp)
2483 /* If the constant comes from pointer subtraction,
2484 skip this optimization--it would cause an error. */
2485 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2486 /* If the constant is unsigned, and smaller than the pointer size,
2487 then we must skip this optimization. This is because it could cause
2488 an overflow error if the constant is negative but INTOP is not. */
2489 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2490 || (TYPE_PRECISION (TREE_TYPE (intop))
2491 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2493 enum tree_code subcode = resultcode;
2494 tree int_type = TREE_TYPE (intop);
2495 if (TREE_CODE (intop) == MINUS_EXPR)
2496 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2497 /* Convert both subexpression types to the type of intop,
2498 because weird cases involving pointer arithmetic
2499 can result in a sum or difference with different type args. */
2500 ptrop = build_binary_op (subcode, ptrop,
2501 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2502 intop = convert (int_type, TREE_OPERAND (intop, 0));
2505 /* Convert the integer argument to a type the same size as sizetype
2506 so the multiply won't overflow spuriously. */
2508 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2509 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2510 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2511 TREE_UNSIGNED (sizetype)), intop);
2513 /* Replace the integer argument with a suitable product by the object size.
2514 Do this multiplication as signed, then convert to the appropriate
2515 pointer type (actually unsigned integral). */
2517 intop = convert (result_type,
2518 build_binary_op (MULT_EXPR, intop,
2519 convert (TREE_TYPE (intop), size_exp), 1));
2521 /* Create the sum or difference. */
2523 result = build (resultcode, result_type, ptrop, intop);
2525 folded = fold (result);
2526 if (folded == result)
2527 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2531 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2532 or validate its data type for an `if' or `while' statement or ?..: exp.
2534 This preparation consists of taking the ordinary
2535 representation of an expression expr and producing a valid tree
2536 boolean expression describing whether expr is nonzero. We could
2537 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2538 but we optimize comparisons, &&, ||, and !.
2540 The resulting type should always be `truthvalue_type_node'. */
2543 c_common_truthvalue_conversion (tree expr)
2545 if (TREE_CODE (expr) == ERROR_MARK)
2548 #if 0 /* This appears to be wrong for C++. */
2549 /* These really should return error_mark_node after 2.4 is stable.
2550 But not all callers handle ERROR_MARK properly. */
2551 switch (TREE_CODE (TREE_TYPE (expr)))
2554 error ("struct type value used where scalar is required");
2555 return truthvalue_false_node;
2558 error ("union type value used where scalar is required");
2559 return truthvalue_false_node;
2562 error ("array type value used where scalar is required");
2563 return truthvalue_false_node;
2570 switch (TREE_CODE (expr))
2573 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2574 case TRUTH_ANDIF_EXPR:
2575 case TRUTH_ORIF_EXPR:
2576 case TRUTH_AND_EXPR:
2578 case TRUTH_XOR_EXPR:
2579 case TRUTH_NOT_EXPR:
2580 TREE_TYPE (expr) = truthvalue_type_node;
2587 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2590 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2593 /* If we are taking the address of an external decl, it might be zero
2594 if it is weak, so we cannot optimize. */
2595 if (DECL_P (TREE_OPERAND (expr, 0))
2596 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2599 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2600 return build (COMPOUND_EXPR, truthvalue_type_node,
2601 TREE_OPERAND (expr, 0), truthvalue_true_node);
2603 return truthvalue_true_node;
2606 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2607 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2608 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2609 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2617 /* These don't change whether an object is nonzero or zero. */
2618 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2622 /* These don't change whether an object is zero or nonzero, but
2623 we can't ignore them if their second arg has side-effects. */
2624 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2625 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2626 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2628 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2631 /* Distribute the conversion into the arms of a COND_EXPR. */
2632 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2633 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2634 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2637 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2638 since that affects how `default_conversion' will behave. */
2639 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2640 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2642 /* Fall through.... */
2644 /* If this is widening the argument, we can ignore it. */
2645 if (TYPE_PRECISION (TREE_TYPE (expr))
2646 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2647 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2651 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2652 aren't guaranteed to the be same for modes that can represent
2653 infinity, since if x and y are both +infinity, or both
2654 -infinity, then x - y is not a number.
2656 Note that this transformation is safe when x or y is NaN.
2657 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2659 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2661 /* Fall through.... */
2663 /* This and MINUS_EXPR can be changed into a comparison of the
2665 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2666 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2667 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2668 TREE_OPERAND (expr, 1), 1);
2669 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2670 fold (build1 (NOP_EXPR,
2671 TREE_TYPE (TREE_OPERAND (expr, 0)),
2672 TREE_OPERAND (expr, 1))), 1);
2675 if (integer_onep (TREE_OPERAND (expr, 1))
2676 && TREE_TYPE (expr) != truthvalue_type_node)
2677 /* Using convert here would cause infinite recursion. */
2678 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2682 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2683 warning ("suggest parentheses around assignment used as truth value");
2690 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2692 tree t = save_expr (expr);
2693 return (build_binary_op
2694 ((TREE_SIDE_EFFECTS (expr)
2695 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2696 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2697 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2701 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2704 static tree builtin_function_2 (const char *, const char *, tree, tree,
2705 int, enum built_in_class, int, int,
2708 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2709 down to the element type of an array. */
2712 c_build_qualified_type (tree type, int type_quals)
2714 /* A restrict-qualified pointer type must be a pointer to object or
2715 incomplete type. Note that the use of POINTER_TYPE_P also allows
2716 REFERENCE_TYPEs, which is appropriate for C++. Unfortunately,
2717 the C++ front-end also use POINTER_TYPE for pointer-to-member
2718 values, so even though it should be illegal to use `restrict'
2719 with such an entity we don't flag that here. Thus, special case
2720 code for that case is required in the C++ front-end. */
2721 if ((type_quals & TYPE_QUAL_RESTRICT)
2722 && (!POINTER_TYPE_P (type)
2723 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2725 error ("invalid use of `restrict'");
2726 type_quals &= ~TYPE_QUAL_RESTRICT;
2729 if (TREE_CODE (type) == ARRAY_TYPE)
2730 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2732 TYPE_DOMAIN (type));
2733 return build_qualified_type (type, type_quals);
2736 /* Apply the TYPE_QUALS to the new DECL. */
2739 c_apply_type_quals_to_decl (int type_quals, tree decl)
2741 if ((type_quals & TYPE_QUAL_CONST)
2742 || (TREE_TYPE (decl)
2743 && TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE))
2744 TREE_READONLY (decl) = 1;
2745 if (type_quals & TYPE_QUAL_VOLATILE)
2747 TREE_SIDE_EFFECTS (decl) = 1;
2748 TREE_THIS_VOLATILE (decl) = 1;
2750 if (type_quals & TYPE_QUAL_RESTRICT)
2752 if (!TREE_TYPE (decl)
2753 || !POINTER_TYPE_P (TREE_TYPE (decl))
2754 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (TREE_TYPE (decl))))
2755 error ("invalid use of `restrict'");
2756 else if (flag_strict_aliasing)
2757 /* Indicate we need to make a unique alias set for this pointer.
2758 We can't do it here because it might be pointing to an
2760 DECL_POINTER_ALIAS_SET (decl) = -2;
2764 /* Return the typed-based alias set for T, which may be an expression
2765 or a type. Return -1 if we don't do anything special. */
2768 c_common_get_alias_set (tree t)
2772 /* Permit type-punning when accessing a union, provided the access
2773 is directly through the union. For example, this code does not
2774 permit taking the address of a union member and then storing
2775 through it. Even the type-punning allowed here is a GCC
2776 extension, albeit a common and useful one; the C standard says
2777 that such accesses have implementation-defined behavior. */
2779 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2780 u = TREE_OPERAND (u, 0))
2781 if (TREE_CODE (u) == COMPONENT_REF
2782 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2785 /* That's all the expressions we handle specially. */
2789 /* The C standard guarantees that any object may be accessed via an
2790 lvalue that has character type. */
2791 if (t == char_type_node
2792 || t == signed_char_type_node
2793 || t == unsigned_char_type_node)
2796 /* If it has the may_alias attribute, it can alias anything. */
2797 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2800 /* The C standard specifically allows aliasing between signed and
2801 unsigned variants of the same type. We treat the signed
2802 variant as canonical. */
2803 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2805 tree t1 = c_common_signed_type (t);
2807 /* t1 == t can happen for boolean nodes which are always unsigned. */
2809 return get_alias_set (t1);
2811 else if (POINTER_TYPE_P (t))
2815 /* Unfortunately, there is no canonical form of a pointer type.
2816 In particular, if we have `typedef int I', then `int *', and
2817 `I *' are different types. So, we have to pick a canonical
2818 representative. We do this below.
2820 Technically, this approach is actually more conservative that
2821 it needs to be. In particular, `const int *' and `int *'
2822 should be in different alias sets, according to the C and C++
2823 standard, since their types are not the same, and so,
2824 technically, an `int **' and `const int **' cannot point at
2827 But, the standard is wrong. In particular, this code is
2832 const int* const* cipp = &ipp;
2834 And, it doesn't make sense for that to be legal unless you
2835 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2836 the pointed-to types. This issue has been reported to the
2838 t1 = build_type_no_quals (t);
2840 return get_alias_set (t1);
2846 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2847 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2848 flag controls whether we should diagnose possibly ill-formed
2849 constructs or not. */
2851 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2853 const char *op_name;
2855 enum tree_code type_code = TREE_CODE (type);
2857 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2858 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2860 if (type_code == FUNCTION_TYPE)
2862 if (op == SIZEOF_EXPR)
2864 if (complain && (pedantic || warn_pointer_arith))
2865 pedwarn ("invalid application of `sizeof' to a function type");
2866 value = size_one_node;
2869 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2871 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2873 if (type_code == VOID_TYPE
2874 && complain && (pedantic || warn_pointer_arith))
2875 pedwarn ("invalid application of `%s' to a void type", op_name);
2876 value = size_one_node;
2878 else if (!COMPLETE_TYPE_P (type))
2881 error ("invalid application of `%s' to an incomplete type", op_name);
2882 value = size_zero_node;
2886 if (op == SIZEOF_EXPR)
2887 /* Convert in case a char is more than one unit. */
2888 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2889 size_int (TYPE_PRECISION (char_type_node)
2892 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2895 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2896 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2897 never happen. However, this node should really have type
2898 `size_t', which is just a typedef for an ordinary integer type. */
2899 value = fold (build1 (NOP_EXPR, size_type_node, value));
2900 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2905 /* Implement the __alignof keyword: Return the minimum required
2906 alignment of EXPR, measured in bytes. For VAR_DECL's and
2907 FIELD_DECL's return DECL_ALIGN (which can be set from an
2908 "aligned" __attribute__ specification). */
2911 c_alignof_expr (tree expr)
2915 if (TREE_CODE (expr) == VAR_DECL)
2916 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2918 else if (TREE_CODE (expr) == COMPONENT_REF
2919 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2921 error ("`__alignof' applied to a bit-field");
2924 else if (TREE_CODE (expr) == COMPONENT_REF
2925 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2926 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
2928 else if (TREE_CODE (expr) == INDIRECT_REF)
2930 tree t = TREE_OPERAND (expr, 0);
2932 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2934 while (TREE_CODE (t) == NOP_EXPR
2935 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2939 t = TREE_OPERAND (t, 0);
2940 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2941 if (thisalign > bestalign)
2942 best = t, bestalign = thisalign;
2944 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2947 return c_alignof (TREE_TYPE (expr));
2949 return fold (build1 (NOP_EXPR, size_type_node, t));
2952 /* Handle C and C++ default attributes. */
2954 enum built_in_attribute
2956 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2957 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2958 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2959 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2960 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No entry needed in enum. */
2961 #include "builtin-attrs.def"
2962 #undef DEF_ATTR_NULL_TREE
2964 #undef DEF_ATTR_IDENT
2965 #undef DEF_ATTR_TREE_LIST
2970 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
2972 static bool c_attrs_initialized = false;
2974 static void c_init_attributes (void);
2976 /* Build tree nodes and builtin functions common to both C and C++ language
2980 c_common_nodes_and_builtins (void)
2984 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2985 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2986 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2987 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2988 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2989 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2990 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2991 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2992 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2993 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2994 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
2995 #include "builtin-types.def"
2996 #undef DEF_PRIMITIVE_TYPE
2997 #undef DEF_FUNCTION_TYPE_0
2998 #undef DEF_FUNCTION_TYPE_1
2999 #undef DEF_FUNCTION_TYPE_2
3000 #undef DEF_FUNCTION_TYPE_3
3001 #undef DEF_FUNCTION_TYPE_4
3002 #undef DEF_FUNCTION_TYPE_VAR_0
3003 #undef DEF_FUNCTION_TYPE_VAR_1
3004 #undef DEF_FUNCTION_TYPE_VAR_2
3005 #undef DEF_FUNCTION_TYPE_VAR_3
3006 #undef DEF_POINTER_TYPE
3010 typedef enum builtin_type builtin_type;
3012 tree builtin_types[(int) BT_LAST];
3013 int wchar_type_size;
3014 tree array_domain_type;
3015 tree va_list_ref_type_node;
3016 tree va_list_arg_type_node;
3018 /* Define `int' and `char' first so that dbx will output them first. */
3019 record_builtin_type (RID_INT, NULL, integer_type_node);
3020 record_builtin_type (RID_CHAR, "char", char_type_node);
3022 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3023 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3024 but not C. Are the conditionals here needed? */
3025 if (c_dialect_cxx ())
3026 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3027 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3028 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3029 record_builtin_type (RID_MAX, "long unsigned int",
3030 long_unsigned_type_node);
3031 if (c_dialect_cxx ())
3032 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3033 record_builtin_type (RID_MAX, "long long int",
3034 long_long_integer_type_node);
3035 record_builtin_type (RID_MAX, "long long unsigned int",
3036 long_long_unsigned_type_node);
3037 if (c_dialect_cxx ())
3038 record_builtin_type (RID_MAX, "long long unsigned",
3039 long_long_unsigned_type_node);
3040 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3041 record_builtin_type (RID_MAX, "short unsigned int",
3042 short_unsigned_type_node);
3043 if (c_dialect_cxx ())
3044 record_builtin_type (RID_MAX, "unsigned short",
3045 short_unsigned_type_node);
3047 /* Define both `signed char' and `unsigned char'. */
3048 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3049 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3051 /* These are types that c_common_type_for_size and
3052 c_common_type_for_mode use. */
3053 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3055 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3057 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3059 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3061 #if HOST_BITS_PER_WIDE_INT >= 64
3062 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3063 get_identifier ("__int128_t"),
3066 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3067 unsigned_intQI_type_node));
3068 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3069 unsigned_intHI_type_node));
3070 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3071 unsigned_intSI_type_node));
3072 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3073 unsigned_intDI_type_node));
3074 #if HOST_BITS_PER_WIDE_INT >= 64
3075 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3076 get_identifier ("__uint128_t"),
3077 unsigned_intTI_type_node));
3080 /* Create the widest literal types. */
3081 widest_integer_literal_type_node
3082 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3083 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3084 widest_integer_literal_type_node));
3086 widest_unsigned_literal_type_node
3087 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3088 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3089 widest_unsigned_literal_type_node));
3091 /* `unsigned long' is the standard type for sizeof.
3092 Note that stddef.h uses `unsigned long',
3093 and this must agree, even if long and int are the same size. */
3095 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3096 signed_size_type_node = c_common_signed_type (size_type_node);
3097 set_sizetype (size_type_node);
3099 build_common_tree_nodes_2 (flag_short_double);
3101 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3102 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3103 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3105 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3106 get_identifier ("complex int"),
3107 complex_integer_type_node));
3108 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3109 get_identifier ("complex float"),
3110 complex_float_type_node));
3111 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3112 get_identifier ("complex double"),
3113 complex_double_type_node));
3114 (*lang_hooks.decls.pushdecl)
3115 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3116 complex_long_double_type_node));
3118 /* Types which are common to the fortran compiler and libf2c. When
3119 changing these, you also need to be concerned with f/com.h. */
3121 if (TYPE_PRECISION (float_type_node)
3122 == TYPE_PRECISION (long_integer_type_node))
3124 g77_integer_type_node = long_integer_type_node;
3125 g77_uinteger_type_node = long_unsigned_type_node;
3127 else if (TYPE_PRECISION (float_type_node)
3128 == TYPE_PRECISION (integer_type_node))
3130 g77_integer_type_node = integer_type_node;
3131 g77_uinteger_type_node = unsigned_type_node;
3134 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3136 if (g77_integer_type_node != NULL_TREE)
3138 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3139 get_identifier ("__g77_integer"),
3140 g77_integer_type_node));
3141 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3142 get_identifier ("__g77_uinteger"),
3143 g77_uinteger_type_node));
3146 if (TYPE_PRECISION (float_type_node) * 2
3147 == TYPE_PRECISION (long_integer_type_node))
3149 g77_longint_type_node = long_integer_type_node;
3150 g77_ulongint_type_node = long_unsigned_type_node;
3152 else if (TYPE_PRECISION (float_type_node) * 2
3153 == TYPE_PRECISION (long_long_integer_type_node))
3155 g77_longint_type_node = long_long_integer_type_node;
3156 g77_ulongint_type_node = long_long_unsigned_type_node;
3159 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3161 if (g77_longint_type_node != NULL_TREE)
3163 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3164 get_identifier ("__g77_longint"),
3165 g77_longint_type_node));
3166 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3167 get_identifier ("__g77_ulongint"),
3168 g77_ulongint_type_node));
3171 record_builtin_type (RID_VOID, NULL, void_type_node);
3173 void_zero_node = build_int_2 (0, 0);
3174 TREE_TYPE (void_zero_node) = void_type_node;
3176 void_list_node = build_void_list_node ();
3178 /* Make a type to be the domain of a few array types
3179 whose domains don't really matter.
3180 200 is small enough that it always fits in size_t
3181 and large enough that it can hold most function names for the
3182 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3183 array_domain_type = build_index_type (size_int (200));
3185 /* Make a type for arrays of characters.
3186 With luck nothing will ever really depend on the length of this
3188 char_array_type_node
3189 = build_array_type (char_type_node, array_domain_type);
3191 /* Likewise for arrays of ints. */
3193 = build_array_type (integer_type_node, array_domain_type);
3195 string_type_node = build_pointer_type (char_type_node);
3196 const_string_type_node
3197 = build_pointer_type (build_qualified_type
3198 (char_type_node, TYPE_QUAL_CONST));
3200 /* This is special for C++ so functions can be overloaded. */
3201 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3202 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3203 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3204 if (c_dialect_cxx ())
3206 if (TREE_UNSIGNED (wchar_type_node))
3207 wchar_type_node = make_unsigned_type (wchar_type_size);
3209 wchar_type_node = make_signed_type (wchar_type_size);
3210 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3214 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3215 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3218 /* This is for wide string constants. */
3219 wchar_array_type_node
3220 = build_array_type (wchar_type_node, array_domain_type);
3223 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3226 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3228 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3230 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3232 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3233 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3235 (*lang_hooks.decls.pushdecl)
3236 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3237 va_list_type_node));
3239 (*lang_hooks.decls.pushdecl)
3240 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3241 ptrdiff_type_node));
3243 (*lang_hooks.decls.pushdecl)
3244 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3247 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3249 va_list_arg_type_node = va_list_ref_type_node =
3250 build_pointer_type (TREE_TYPE (va_list_type_node));
3254 va_list_arg_type_node = va_list_type_node;
3255 va_list_ref_type_node = build_reference_type (va_list_type_node);
3258 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3259 builtin_types[(int) ENUM] = VALUE;
3260 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3261 builtin_types[(int) ENUM] \
3262 = build_function_type (builtin_types[(int) RETURN], \
3264 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3265 builtin_types[(int) ENUM] \
3266 = build_function_type (builtin_types[(int) RETURN], \
3267 tree_cons (NULL_TREE, \
3268 builtin_types[(int) ARG1], \
3270 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3271 builtin_types[(int) ENUM] \
3272 = build_function_type \
3273 (builtin_types[(int) RETURN], \
3274 tree_cons (NULL_TREE, \
3275 builtin_types[(int) ARG1], \
3276 tree_cons (NULL_TREE, \
3277 builtin_types[(int) ARG2], \
3279 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3280 builtin_types[(int) ENUM] \
3281 = build_function_type \
3282 (builtin_types[(int) RETURN], \
3283 tree_cons (NULL_TREE, \
3284 builtin_types[(int) ARG1], \
3285 tree_cons (NULL_TREE, \
3286 builtin_types[(int) ARG2], \
3287 tree_cons (NULL_TREE, \
3288 builtin_types[(int) ARG3], \
3290 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3291 builtin_types[(int) ENUM] \
3292 = build_function_type \
3293 (builtin_types[(int) RETURN], \
3294 tree_cons (NULL_TREE, \
3295 builtin_types[(int) ARG1], \
3296 tree_cons (NULL_TREE, \
3297 builtin_types[(int) ARG2], \
3300 builtin_types[(int) ARG3], \
3301 tree_cons (NULL_TREE, \
3302 builtin_types[(int) ARG4], \
3303 void_list_node)))));
3304 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3305 builtin_types[(int) ENUM] \
3306 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3307 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3308 builtin_types[(int) ENUM] \
3309 = build_function_type (builtin_types[(int) RETURN], \
3310 tree_cons (NULL_TREE, \
3311 builtin_types[(int) ARG1], \
3314 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3315 builtin_types[(int) ENUM] \
3316 = build_function_type \
3317 (builtin_types[(int) RETURN], \
3318 tree_cons (NULL_TREE, \
3319 builtin_types[(int) ARG1], \
3320 tree_cons (NULL_TREE, \
3321 builtin_types[(int) ARG2], \
3324 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3325 builtin_types[(int) ENUM] \
3326 = build_function_type \
3327 (builtin_types[(int) RETURN], \
3328 tree_cons (NULL_TREE, \
3329 builtin_types[(int) ARG1], \
3330 tree_cons (NULL_TREE, \
3331 builtin_types[(int) ARG2], \
3332 tree_cons (NULL_TREE, \
3333 builtin_types[(int) ARG3], \
3336 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3337 builtin_types[(int) ENUM] \
3338 = build_pointer_type (builtin_types[(int) TYPE]);
3339 #include "builtin-types.def"
3340 #undef DEF_PRIMITIVE_TYPE
3341 #undef DEF_FUNCTION_TYPE_1
3342 #undef DEF_FUNCTION_TYPE_2
3343 #undef DEF_FUNCTION_TYPE_3
3344 #undef DEF_FUNCTION_TYPE_4
3345 #undef DEF_FUNCTION_TYPE_VAR_0
3346 #undef DEF_FUNCTION_TYPE_VAR_1
3347 #undef DEF_FUNCTION_TYPE_VAR_2
3348 #undef DEF_FUNCTION_TYPE_VAR_3
3349 #undef DEF_POINTER_TYPE
3351 if (!c_attrs_initialized)
3352 c_init_attributes ();
3354 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3355 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3360 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3364 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3367 ? (NAME + strlen ("__builtin_")) \
3369 built_in_attributes[(int) ATTRS]); \
3371 decl = builtin_function_2 (NAME, \
3372 NAME + strlen ("__builtin_"), \
3373 builtin_types[TYPE], \
3374 builtin_types[LIBTYPE], \
3379 built_in_attributes[(int) ATTRS]); \
3381 built_in_decls[(int) ENUM] = decl; \
3383 implicit_built_in_decls[(int) ENUM] = decl; \
3385 #include "builtins.def"
3388 (*targetm.init_builtins) ();
3390 main_identifier_node = get_identifier ("main");
3394 build_va_arg (tree expr, tree type)
3396 return build1 (VA_ARG_EXPR, type, expr);
3400 /* Linked list of disabled built-in functions. */
3402 typedef struct disabled_builtin
3405 struct disabled_builtin *next;
3407 static disabled_builtin *disabled_builtins = NULL;
3409 static bool builtin_function_disabled_p (const char *);
3411 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3412 begins with "__builtin_", give an error. */
3415 disable_builtin_function (const char *name)
3417 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3418 error ("cannot disable built-in function `%s'", name);
3421 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3423 new->next = disabled_builtins;
3424 disabled_builtins = new;
3429 /* Return true if the built-in function NAME has been disabled, false
3433 builtin_function_disabled_p (const char *name)
3435 disabled_builtin *p;
3436 for (p = disabled_builtins; p != NULL; p = p->next)
3438 if (strcmp (name, p->name) == 0)
3445 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3446 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3447 of these may be NULL (though both being NULL is useless).
3448 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3449 TYPE is the type of the function with the ordinary name. These
3450 may differ if the ordinary name is declared with a looser type to avoid
3451 conflicts with headers. FUNCTION_CODE and CLASS are as for
3452 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3453 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3454 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3455 ATTRS is the tree list representing the builtin's function attributes.
3456 Returns the declaration of BUILTIN_NAME, if any, otherwise
3457 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3458 or if NONANSI_P and flag_no_nonansi_builtin. */
3461 builtin_function_2 (const char *builtin_name, const char *name,
3462 tree builtin_type, tree type, int function_code,
3463 enum built_in_class class, int library_name_p,
3464 int nonansi_p, tree attrs)
3466 tree bdecl = NULL_TREE;
3467 tree decl = NULL_TREE;
3469 if (builtin_name != 0)
3470 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3471 class, library_name_p ? name : NULL, attrs);
3473 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3474 && !(nonansi_p && flag_no_nonansi_builtin))
3475 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3477 return (bdecl != 0 ? bdecl : decl);
3480 /* Nonzero if the type T promotes to int. This is (nearly) the
3481 integral promotions defined in ISO C99 6.3.1.1/2. */
3484 c_promoting_integer_type_p (tree t)
3486 switch (TREE_CODE (t))
3489 return (TYPE_MAIN_VARIANT (t) == char_type_node
3490 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3491 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3492 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3493 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3494 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3497 /* ??? Technically all enumerations not larger than an int
3498 promote to an int. But this is used along code paths
3499 that only want to notice a size change. */
3500 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3510 /* Return 1 if PARMS specifies a fixed number of parameters
3511 and none of their types is affected by default promotions. */
3514 self_promoting_args_p (tree parms)
3517 for (t = parms; t; t = TREE_CHAIN (t))
3519 tree type = TREE_VALUE (t);
3521 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3527 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3530 if (c_promoting_integer_type_p (type))
3536 /* Recursively examines the array elements of TYPE, until a non-array
3537 element type is found. */
3540 strip_array_types (tree type)
3542 while (TREE_CODE (type) == ARRAY_TYPE)
3543 type = TREE_TYPE (type);
3548 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3550 /* Expand a call to an unordered comparison function such as
3551 __builtin_isgreater(). FUNCTION is the function's declaration and
3552 PARAMS a list of the values passed. For __builtin_isunordered(),
3553 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3554 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3555 that give the opposite of the desired result. UNORDERED_CODE is
3556 used for modes that can hold NaNs and ORDERED_CODE is used for the
3560 expand_unordered_cmp (tree function, tree params,
3561 enum tree_code unordered_code,
3562 enum tree_code ordered_code)
3564 tree arg0, arg1, type;
3565 enum tree_code code0, code1;
3567 /* Check that we have exactly two arguments. */
3568 if (params == 0 || TREE_CHAIN (params) == 0)
3570 error ("too few arguments to function `%s'",
3571 IDENTIFIER_POINTER (DECL_NAME (function)));
3572 return error_mark_node;
3574 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3576 error ("too many arguments to function `%s'",
3577 IDENTIFIER_POINTER (DECL_NAME (function)));
3578 return error_mark_node;
3581 arg0 = TREE_VALUE (params);
3582 arg1 = TREE_VALUE (TREE_CHAIN (params));
3584 code0 = TREE_CODE (TREE_TYPE (arg0));
3585 code1 = TREE_CODE (TREE_TYPE (arg1));
3587 /* Make sure that the arguments have a common type of REAL. */
3589 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3590 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3591 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3593 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3595 error ("non-floating-point argument to function `%s'",
3596 IDENTIFIER_POINTER (DECL_NAME (function)));
3597 return error_mark_node;
3600 if (unordered_code == UNORDERED_EXPR)
3602 if (MODE_HAS_NANS (TYPE_MODE (type)))
3603 return build_binary_op (unordered_code,
3604 convert (type, arg0),
3605 convert (type, arg1),
3608 return integer_zero_node;
3611 return build_unary_op (TRUTH_NOT_EXPR,
3612 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3615 convert (type, arg0),
3616 convert (type, arg1),
3622 /* Recognize certain built-in functions so we can make tree-codes
3623 other than CALL_EXPR. We do this when it enables fold-const.c
3624 to do something useful. */
3625 /* ??? By rights this should go in builtins.c, but only C and C++
3626 implement build_{binary,unary}_op. Not exactly sure what bits
3627 of functionality are actually needed from those functions, or
3628 where the similar functionality exists in the other front ends. */
3631 expand_tree_builtin (tree function, tree params, tree coerced_params)
3633 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3636 switch (DECL_FUNCTION_CODE (function))
3640 case BUILT_IN_LLABS:
3641 case BUILT_IN_IMAXABS:
3643 case BUILT_IN_FABSL:
3644 case BUILT_IN_FABSF:
3645 if (coerced_params == 0)
3646 return integer_zero_node;
3647 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3650 case BUILT_IN_CONJF:
3651 case BUILT_IN_CONJL:
3652 if (coerced_params == 0)
3653 return integer_zero_node;
3654 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3656 case BUILT_IN_CREAL:
3657 case BUILT_IN_CREALF:
3658 case BUILT_IN_CREALL:
3659 if (coerced_params == 0)
3660 return integer_zero_node;
3661 return build_unary_op (REALPART_EXPR, TREE_VALUE (coerced_params), 0);
3663 case BUILT_IN_CIMAG:
3664 case BUILT_IN_CIMAGF:
3665 case BUILT_IN_CIMAGL:
3666 if (coerced_params == 0)
3667 return integer_zero_node;
3668 return build_unary_op (IMAGPART_EXPR, TREE_VALUE (coerced_params), 0);
3670 case BUILT_IN_ISGREATER:
3671 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3673 case BUILT_IN_ISGREATEREQUAL:
3674 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3676 case BUILT_IN_ISLESS:
3677 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3679 case BUILT_IN_ISLESSEQUAL:
3680 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3682 case BUILT_IN_ISLESSGREATER:
3683 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3685 case BUILT_IN_ISUNORDERED:
3686 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3695 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3696 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3697 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3698 value, the traversal is aborted, and the value returned by FUNC is
3699 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3700 the node being visited are not walked.
3702 We don't need a without_duplicates variant of this one because the
3703 statement tree is a tree, not a graph. */
3706 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3708 enum tree_code code;
3713 #define WALK_SUBTREE(NODE) \
3716 result = walk_stmt_tree (&(NODE), func, data); \
3722 /* Skip empty subtrees. */
3726 /* Skip subtrees below non-statement nodes. */
3727 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3730 /* Call the function. */
3732 result = (*func) (tp, &walk_subtrees, data);
3734 /* If we found something, return it. */
3738 /* FUNC may have modified the tree, recheck that we're looking at a
3740 code = TREE_CODE (*tp);
3741 if (!STATEMENT_CODE_P (code))
3744 /* Visit the subtrees unless FUNC decided that there was nothing
3745 interesting below this point in the tree. */
3748 /* Walk over all the sub-trees of this operand. Statement nodes
3749 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3750 len = TREE_CODE_LENGTH (code);
3752 /* Go through the subtrees. We need to do this in forward order so
3753 that the scope of a FOR_EXPR is handled properly. */
3754 for (i = 0; i < len; ++i)
3755 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3758 /* Finally visit the chain. This can be tail-recursion optimized if
3759 we write it this way. */
3760 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3765 /* Used to compare case labels. K1 and K2 are actually tree nodes
3766 representing case labels, or NULL_TREE for a `default' label.
3767 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3768 K2, and 0 if K1 and K2 are equal. */
3771 case_compare (splay_tree_key k1, splay_tree_key k2)
3773 /* Consider a NULL key (such as arises with a `default' label) to be
3774 smaller than anything else. */
3780 return tree_int_cst_compare ((tree) k1, (tree) k2);
3783 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3784 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3785 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3786 case label was declared using the usual C/C++ syntax, rather than
3787 the GNU case range extension. CASES is a tree containing all the
3788 case ranges processed so far; COND is the condition for the
3789 switch-statement itself. Returns the CASE_LABEL created, or
3790 ERROR_MARK_NODE if no CASE_LABEL is created. */
3793 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3799 splay_tree_node node;
3801 /* Create the LABEL_DECL itself. */
3802 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3803 DECL_CONTEXT (label) = current_function_decl;
3805 /* If there was an error processing the switch condition, bail now
3806 before we get more confused. */
3807 if (!cond || cond == error_mark_node)
3809 /* Add a label anyhow so that the back-end doesn't think that
3810 the beginning of the switch is unreachable. */
3812 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3813 return error_mark_node;
3816 if ((low_value && TREE_TYPE (low_value)
3817 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3818 || (high_value && TREE_TYPE (high_value)
3819 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3820 error ("pointers are not permitted as case values");
3822 /* Case ranges are a GNU extension. */
3823 if (high_value && pedantic)
3824 pedwarn ("range expressions in switch statements are non-standard");
3826 type = TREE_TYPE (cond);
3829 low_value = check_case_value (low_value);
3830 low_value = convert_and_check (type, low_value);
3834 high_value = check_case_value (high_value);
3835 high_value = convert_and_check (type, high_value);
3838 /* If an error has occurred, bail out now. */
3839 if (low_value == error_mark_node || high_value == error_mark_node)
3842 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3843 return error_mark_node;
3846 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3847 really a case range, even though it was written that way. Remove
3848 the HIGH_VALUE to simplify later processing. */
3849 if (tree_int_cst_equal (low_value, high_value))
3850 high_value = NULL_TREE;
3851 if (low_value && high_value
3852 && !tree_int_cst_lt (low_value, high_value))
3853 warning ("empty range specified");
3855 /* Look up the LOW_VALUE in the table of case labels we already
3857 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3858 /* If there was not an exact match, check for overlapping ranges.
3859 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3860 that's a `default' label and the only overlap is an exact match. */
3861 if (!node && (low_value || high_value))
3863 splay_tree_node low_bound;
3864 splay_tree_node high_bound;
3866 /* Even though there wasn't an exact match, there might be an
3867 overlap between this case range and another case range.
3868 Since we've (inductively) not allowed any overlapping case
3869 ranges, we simply need to find the greatest low case label
3870 that is smaller that LOW_VALUE, and the smallest low case
3871 label that is greater than LOW_VALUE. If there is an overlap
3872 it will occur in one of these two ranges. */
3873 low_bound = splay_tree_predecessor (cases,
3874 (splay_tree_key) low_value);
3875 high_bound = splay_tree_successor (cases,
3876 (splay_tree_key) low_value);
3878 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3879 the LOW_VALUE, so there is no need to check unless the
3880 LOW_BOUND is in fact itself a case range. */
3882 && CASE_HIGH ((tree) low_bound->value)
3883 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3886 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3887 range is bigger than the low end of the current range, so we
3888 are only interested if the current range is a real range, and
3889 not an ordinary case label. */
3892 && (tree_int_cst_compare ((tree) high_bound->key,
3897 /* If there was an overlap, issue an error. */
3900 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3904 error ("duplicate (or overlapping) case value");
3905 error ("%Hthis is the first entry overlapping that value",
3906 &DECL_SOURCE_LOCATION (duplicate));
3910 error ("duplicate case value") ;
3911 error ("%Hpreviously used here", &DECL_SOURCE_LOCATION (duplicate));
3915 error ("multiple default labels in one switch");
3916 error ("%Hthis is the first default label",
3917 &DECL_SOURCE_LOCATION (duplicate));
3920 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3923 /* Add a CASE_LABEL to the statement-tree. */
3924 case_label = add_stmt (build_case_label (low_value, high_value, label));
3925 /* Register this case label in the splay tree. */
3926 splay_tree_insert (cases,
3927 (splay_tree_key) low_value,
3928 (splay_tree_value) case_label);
3933 /* Finish an expression taking the address of LABEL (an
3934 IDENTIFIER_NODE). Returns an expression for the address. */
3937 finish_label_address_expr (tree label)
3942 pedwarn ("taking the address of a label is non-standard");
3944 if (label == error_mark_node)
3945 return error_mark_node;
3947 label = lookup_label (label);
3948 if (label == NULL_TREE)
3949 result = null_pointer_node;
3952 TREE_USED (label) = 1;
3953 result = build1 (ADDR_EXPR, ptr_type_node, label);
3954 TREE_CONSTANT (result) = 1;
3955 /* The current function in not necessarily uninlinable.
3956 Computed gotos are incompatible with inlining, but the value
3957 here could be used only in a diagnostic, for example. */
3963 /* Hook used by expand_expr to expand language-specific tree codes. */
3966 c_expand_expr (tree exp, rtx target, enum machine_mode tmode, int modifier)
3967 /* Actually enum_modifier. */
3969 switch (TREE_CODE (exp))
3975 bool preserve_result = false;
3976 bool return_target = false;
3978 /* Since expand_expr_stmt calls free_temp_slots after every
3979 expression statement, we must call push_temp_slots here.
3980 Otherwise, any temporaries in use now would be considered
3981 out-of-scope after the first EXPR_STMT from within the
3984 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
3986 /* If we want the result of this expression, find the last
3987 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
3988 if (target != const0_rtx
3989 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
3990 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
3992 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
3993 tree last = TREE_CHAIN (expr);
3995 while (TREE_CHAIN (last))
3998 last = TREE_CHAIN (last);
4001 if (TREE_CODE (last) == SCOPE_STMT
4002 && TREE_CODE (expr) == EXPR_STMT)
4004 if (target && TREE_CODE (EXPR_STMT_EXPR (expr)) == VAR_DECL
4005 && DECL_RTL_IF_SET (EXPR_STMT_EXPR (expr)) == target)
4006 /* If the last expression is a variable whose RTL is the
4007 same as our target, just return the target; if it
4008 isn't valid expanding the decl would produce different
4009 RTL, and store_expr would try to do a copy. */
4010 return_target = true;
4013 /* Otherwise, note that we want the value from the last
4015 TREE_ADDRESSABLE (expr) = 1;
4016 preserve_result = true;
4021 expand_stmt (STMT_EXPR_STMT (exp));
4022 expand_end_stmt_expr (rtl_expr);
4024 result = expand_expr (rtl_expr, target, tmode, modifier);
4027 else if (preserve_result && GET_CODE (result) == MEM)
4029 if (GET_MODE (result) != BLKmode)
4030 result = copy_to_reg (result);
4032 preserve_temp_slots (result);
4035 /* If the statment-expression does not have a scope, then the
4036 new temporaries we created within it must live beyond the
4037 statement-expression. */
4038 if (STMT_EXPR_NO_SCOPE (exp))
4039 preserve_temp_slots (NULL_RTX);
4046 case COMPOUND_LITERAL_EXPR:
4048 /* Initialize the anonymous variable declared in the compound
4049 literal, then return the variable. */
4050 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4051 emit_local_var (decl);
4052 return expand_expr (decl, target, tmode, modifier);
4063 /* Hook used by safe_from_p to handle language-specific tree codes. */
4066 c_safe_from_p (rtx target, tree exp)
4068 /* We can see statements here when processing the body of a
4069 statement-expression. For a declaration statement declaring a
4070 variable, look at the variable's initializer. */
4071 if (TREE_CODE (exp) == DECL_STMT)
4073 tree decl = DECL_STMT_DECL (exp);
4075 if (TREE_CODE (decl) == VAR_DECL
4076 && DECL_INITIAL (decl)
4077 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4081 /* For any statement, we must follow the statement-chain. */
4082 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4083 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4085 /* Assume everything else is safe. */
4089 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4092 c_common_unsafe_for_reeval (tree exp)
4094 /* Statement expressions may not be reevaluated, likewise compound
4096 if (TREE_CODE (exp) == STMT_EXPR
4097 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4100 /* Walk all other expressions. */
4104 /* Hook used by staticp to handle language-specific tree codes. */
4107 c_staticp (tree exp)
4109 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4110 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4116 /* Given a boolean expression ARG, return a tree representing an increment
4117 or decrement (as indicated by CODE) of ARG. The front end must check for
4118 invalid cases (e.g., decrement in C++). */
4120 boolean_increment (enum tree_code code, tree arg)
4123 tree true_res = boolean_true_node;
4125 arg = stabilize_reference (arg);
4128 case PREINCREMENT_EXPR:
4129 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4131 case POSTINCREMENT_EXPR:
4132 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4133 arg = save_expr (arg);
4134 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4135 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4137 case PREDECREMENT_EXPR:
4138 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4140 case POSTDECREMENT_EXPR:
4141 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4142 arg = save_expr (arg);
4143 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4144 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4149 TREE_SIDE_EFFECTS (val) = 1;
4153 /* Built-in macros for stddef.h, that require macros defined in this
4156 c_stddef_cpp_builtins(void)
4158 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4159 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4160 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4161 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4165 c_init_attributes (void)
4167 /* Fill in the built_in_attributes array. */
4168 #define DEF_ATTR_NULL_TREE(ENUM) \
4169 built_in_attributes[(int) ENUM] = NULL_TREE;
4170 #define DEF_ATTR_INT(ENUM, VALUE) \
4171 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4172 #define DEF_ATTR_IDENT(ENUM, STRING) \
4173 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4174 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4175 built_in_attributes[(int) ENUM] \
4176 = tree_cons (built_in_attributes[(int) PURPOSE], \
4177 built_in_attributes[(int) VALUE], \
4178 built_in_attributes[(int) CHAIN]);
4179 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No initialization needed. */
4180 #include "builtin-attrs.def"
4181 #undef DEF_ATTR_NULL_TREE
4183 #undef DEF_ATTR_IDENT
4184 #undef DEF_ATTR_TREE_LIST
4186 c_attrs_initialized = true;
4189 /* Depending on the name of DECL, apply default attributes to it. */
4192 c_common_insert_default_attributes (tree decl ATTRIBUTE_UNUSED)
4196 /* Output a -Wshadow warning MSGCODE about NAME, and give the location
4197 of the previous declaration DECL. */
4199 shadow_warning (enum sw_kind msgcode, const char *name, tree decl)
4201 static const char *const msgs[] = {
4202 /* SW_PARAM */ N_("declaration of \"%s\" shadows a parameter"),
4203 /* SW_LOCAL */ N_("declaration of \"%s\" shadows a previous local"),
4204 /* SW_GLOBAL */ N_("declaration of \"%s\" shadows a global declaration")
4207 warning (msgs[msgcode], name);
4208 warning ("%Hshadowed declaration is here", &DECL_SOURCE_LOCATION (decl));
4211 /* Attribute handlers common to C front ends. */
4213 /* Handle a "packed" attribute; arguments as in
4214 struct attribute_spec.handler. */
4217 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4218 int flags, bool *no_add_attrs)
4222 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4223 *node = build_type_copy (*node);
4224 TYPE_PACKED (*node) = 1;
4225 if (TYPE_MAIN_VARIANT (*node) == *node)
4227 /* If it is the main variant, then pack the other variants
4228 too. This happens in,
4231 struct Foo const *ptr; // creates a variant w/o packed flag
4232 } __ attribute__((packed)); // packs it now.
4236 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4237 TYPE_PACKED (probe) = 1;
4241 else if (TREE_CODE (*node) == FIELD_DECL)
4242 DECL_PACKED (*node) = 1;
4243 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4244 used for DECL_REGISTER. It wouldn't mean anything anyway.
4245 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4246 that changes what the typedef is typing. */
4249 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4250 *no_add_attrs = true;
4256 /* Handle a "nocommon" attribute; arguments as in
4257 struct attribute_spec.handler. */
4260 handle_nocommon_attribute (tree *node, tree name,
4261 tree args ATTRIBUTE_UNUSED,
4262 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4264 if (TREE_CODE (*node) == VAR_DECL)
4265 DECL_COMMON (*node) = 0;
4268 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4269 *no_add_attrs = true;
4275 /* Handle a "common" attribute; arguments as in
4276 struct attribute_spec.handler. */
4279 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4280 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4282 if (TREE_CODE (*node) == VAR_DECL)
4283 DECL_COMMON (*node) = 1;
4286 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4287 *no_add_attrs = true;
4293 /* Handle a "noreturn" attribute; arguments as in
4294 struct attribute_spec.handler. */
4297 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4298 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4300 tree type = TREE_TYPE (*node);
4302 /* See FIXME comment in c_common_attribute_table. */
4303 if (TREE_CODE (*node) == FUNCTION_DECL)
4304 TREE_THIS_VOLATILE (*node) = 1;
4305 else if (TREE_CODE (type) == POINTER_TYPE
4306 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4308 = build_pointer_type
4309 (build_type_variant (TREE_TYPE (type),
4310 TREE_READONLY (TREE_TYPE (type)), 1));
4313 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4314 *no_add_attrs = true;
4320 /* Handle a "noinline" attribute; arguments as in
4321 struct attribute_spec.handler. */
4324 handle_noinline_attribute (tree *node, tree name,
4325 tree args ATTRIBUTE_UNUSED,
4326 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4328 if (TREE_CODE (*node) == FUNCTION_DECL)
4329 DECL_UNINLINABLE (*node) = 1;
4332 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4333 *no_add_attrs = true;
4339 /* Handle a "always_inline" attribute; arguments as in
4340 struct attribute_spec.handler. */
4343 handle_always_inline_attribute (tree *node, tree name,
4344 tree args ATTRIBUTE_UNUSED,
4345 int flags ATTRIBUTE_UNUSED,
4348 if (TREE_CODE (*node) == FUNCTION_DECL)
4350 /* Do nothing else, just set the attribute. We'll get at
4351 it later with lookup_attribute. */
4355 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4356 *no_add_attrs = true;
4362 /* Handle a "used" attribute; arguments as in
4363 struct attribute_spec.handler. */
4366 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4367 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4371 if (TREE_CODE (node) == FUNCTION_DECL
4372 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4374 TREE_USED (node) = 1;
4378 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4379 *no_add_attrs = true;
4385 /* Handle a "unused" attribute; arguments as in
4386 struct attribute_spec.handler. */
4389 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4390 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4396 if (TREE_CODE (decl) == PARM_DECL
4397 || TREE_CODE (decl) == VAR_DECL
4398 || TREE_CODE (decl) == FUNCTION_DECL
4399 || TREE_CODE (decl) == LABEL_DECL
4400 || TREE_CODE (decl) == TYPE_DECL)
4401 TREE_USED (decl) = 1;
4404 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4405 *no_add_attrs = true;
4410 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4411 *node = build_type_copy (*node);
4412 TREE_USED (*node) = 1;
4418 /* Handle a "const" attribute; arguments as in
4419 struct attribute_spec.handler. */
4422 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4423 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4425 tree type = TREE_TYPE (*node);
4427 /* See FIXME comment on noreturn in c_common_attribute_table. */
4428 if (TREE_CODE (*node) == FUNCTION_DECL)
4429 TREE_READONLY (*node) = 1;
4430 else if (TREE_CODE (type) == POINTER_TYPE
4431 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4433 = build_pointer_type
4434 (build_type_variant (TREE_TYPE (type), 1,
4435 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4438 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4439 *no_add_attrs = true;
4445 /* Handle a "transparent_union" attribute; arguments as in
4446 struct attribute_spec.handler. */
4449 handle_transparent_union_attribute (tree *node, tree name,
4450 tree args ATTRIBUTE_UNUSED, int flags,
4453 tree decl = NULL_TREE;
4460 type = &TREE_TYPE (decl);
4461 is_type = TREE_CODE (*node) == TYPE_DECL;
4463 else if (TYPE_P (*node))
4464 type = node, is_type = 1;
4467 && TREE_CODE (*type) == UNION_TYPE
4469 || (TYPE_FIELDS (*type) != 0
4470 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4472 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4473 *type = build_type_copy (*type);
4474 TYPE_TRANSPARENT_UNION (*type) = 1;
4476 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4477 && TREE_CODE (*type) == UNION_TYPE
4478 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4479 DECL_TRANSPARENT_UNION (decl) = 1;
4482 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4483 *no_add_attrs = true;
4489 /* Handle a "constructor" attribute; arguments as in
4490 struct attribute_spec.handler. */
4493 handle_constructor_attribute (tree *node, tree name,
4494 tree args ATTRIBUTE_UNUSED,
4495 int flags ATTRIBUTE_UNUSED,
4499 tree type = TREE_TYPE (decl);
4501 if (TREE_CODE (decl) == FUNCTION_DECL
4502 && TREE_CODE (type) == FUNCTION_TYPE
4503 && decl_function_context (decl) == 0)
4505 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4506 TREE_USED (decl) = 1;
4510 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4511 *no_add_attrs = true;
4517 /* Handle a "destructor" attribute; arguments as in
4518 struct attribute_spec.handler. */
4521 handle_destructor_attribute (tree *node, tree name,
4522 tree args ATTRIBUTE_UNUSED,
4523 int flags ATTRIBUTE_UNUSED,
4527 tree type = TREE_TYPE (decl);
4529 if (TREE_CODE (decl) == FUNCTION_DECL
4530 && TREE_CODE (type) == FUNCTION_TYPE
4531 && decl_function_context (decl) == 0)
4533 DECL_STATIC_DESTRUCTOR (decl) = 1;
4534 TREE_USED (decl) = 1;
4538 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4539 *no_add_attrs = true;
4545 /* Handle a "mode" attribute; arguments as in
4546 struct attribute_spec.handler. */
4549 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4550 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4554 *no_add_attrs = true;
4556 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4557 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4561 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4562 int len = strlen (p);
4563 enum machine_mode mode = VOIDmode;
4567 if (len > 4 && p[0] == '_' && p[1] == '_'
4568 && p[len - 1] == '_' && p[len - 2] == '_')
4570 char *newp = alloca (len - 1);
4572 strcpy (newp, &p[2]);
4573 newp[len - 4] = '\0';
4577 /* Change this type to have a type with the specified mode.
4578 First check for the special modes. */
4579 if (! strcmp (p, "byte"))
4581 else if (!strcmp (p, "word"))
4583 else if (! strcmp (p, "pointer"))
4586 for (j = 0; j < NUM_MACHINE_MODES; j++)
4587 if (!strcmp (p, GET_MODE_NAME (j)))
4588 mode = (enum machine_mode) j;
4590 if (mode == VOIDmode)
4591 error ("unknown machine mode `%s'", p);
4592 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
4593 (mode, TREE_UNSIGNED (type))))
4594 error ("no data type for mode `%s'", p);
4595 else if ((TREE_CODE (type) == POINTER_TYPE
4596 || TREE_CODE (type) == REFERENCE_TYPE)
4597 && !(*targetm.valid_pointer_mode) (mode))
4598 error ("invalid pointer mode `%s'", p);
4601 /* If this is a vector, make sure we either have hardware
4602 support, or we can emulate it. */
4603 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4605 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4609 if (TREE_CODE (type) == POINTER_TYPE)
4611 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4615 else if (TREE_CODE (type) == REFERENCE_TYPE)
4617 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4623 /* No need to layout the type here. The caller should do this. */
4630 /* Handle a "section" attribute; arguments as in
4631 struct attribute_spec.handler. */
4634 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4635 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4639 if (targetm.have_named_sections)
4641 if ((TREE_CODE (decl) == FUNCTION_DECL
4642 || TREE_CODE (decl) == VAR_DECL)
4643 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4645 if (TREE_CODE (decl) == VAR_DECL
4646 && current_function_decl != NULL_TREE
4647 && ! TREE_STATIC (decl))
4649 error ("%Hsection attribute cannot be specified for "
4650 "local variables", &DECL_SOURCE_LOCATION (decl));
4651 *no_add_attrs = true;
4654 /* The decl may have already been given a section attribute
4655 from a previous declaration. Ensure they match. */
4656 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4657 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4658 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4660 error ("%Hsection of '%D' conflicts with previous declaration",
4661 &DECL_SOURCE_LOCATION (*node), *node);
4662 *no_add_attrs = true;
4665 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4669 error ("%Hsection attribute not allowed for '%D'",
4670 &DECL_SOURCE_LOCATION (*node), *node);
4671 *no_add_attrs = true;
4676 error ("%Hsection attributes are not supported for this target",
4677 &DECL_SOURCE_LOCATION (*node));
4678 *no_add_attrs = true;
4684 /* Handle a "aligned" attribute; arguments as in
4685 struct attribute_spec.handler. */
4688 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4689 int flags, bool *no_add_attrs)
4691 tree decl = NULL_TREE;
4694 tree align_expr = (args ? TREE_VALUE (args)
4695 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4701 type = &TREE_TYPE (decl);
4702 is_type = TREE_CODE (*node) == TYPE_DECL;
4704 else if (TYPE_P (*node))
4705 type = node, is_type = 1;
4707 /* Strip any NOPs of any kind. */
4708 while (TREE_CODE (align_expr) == NOP_EXPR
4709 || TREE_CODE (align_expr) == CONVERT_EXPR
4710 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4711 align_expr = TREE_OPERAND (align_expr, 0);
4713 if (TREE_CODE (align_expr) != INTEGER_CST)
4715 error ("requested alignment is not a constant");
4716 *no_add_attrs = true;
4718 else if ((i = tree_log2 (align_expr)) == -1)
4720 error ("requested alignment is not a power of 2");
4721 *no_add_attrs = true;
4723 else if (i > HOST_BITS_PER_INT - 2)
4725 error ("requested alignment is too large");
4726 *no_add_attrs = true;
4730 /* If we have a TYPE_DECL, then copy the type, so that we
4731 don't accidentally modify a builtin type. See pushdecl. */
4732 if (decl && TREE_TYPE (decl) != error_mark_node
4733 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4735 tree tt = TREE_TYPE (decl);
4736 *type = build_type_copy (*type);
4737 DECL_ORIGINAL_TYPE (decl) = tt;
4738 TYPE_NAME (*type) = decl;
4739 TREE_USED (*type) = TREE_USED (decl);
4740 TREE_TYPE (decl) = *type;
4742 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4743 *type = build_type_copy (*type);
4745 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4746 TYPE_USER_ALIGN (*type) = 1;
4748 else if (TREE_CODE (decl) != VAR_DECL
4749 && TREE_CODE (decl) != FIELD_DECL)
4751 error ("%Halignment may not be specified for '%D'",
4752 &DECL_SOURCE_LOCATION (decl), decl);
4753 *no_add_attrs = true;
4757 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4758 DECL_USER_ALIGN (decl) = 1;
4764 /* Handle a "weak" attribute; arguments as in
4765 struct attribute_spec.handler. */
4768 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4769 tree args ATTRIBUTE_UNUSED,
4770 int flags ATTRIBUTE_UNUSED,
4771 bool *no_add_attrs ATTRIBUTE_UNUSED)
4773 declare_weak (*node);
4778 /* Handle an "alias" attribute; arguments as in
4779 struct attribute_spec.handler. */
4782 handle_alias_attribute (tree *node, tree name, tree args,
4783 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4787 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4788 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4790 error ("%H'%D' defined both normally and as an alias",
4791 &DECL_SOURCE_LOCATION (decl), decl);
4792 *no_add_attrs = true;
4794 else if (decl_function_context (decl) == 0)
4798 id = TREE_VALUE (args);
4799 if (TREE_CODE (id) != STRING_CST)
4801 error ("alias arg not a string");
4802 *no_add_attrs = true;
4805 id = get_identifier (TREE_STRING_POINTER (id));
4806 /* This counts as a use of the object pointed to. */
4809 if (TREE_CODE (decl) == FUNCTION_DECL)
4810 DECL_INITIAL (decl) = error_mark_node;
4812 DECL_EXTERNAL (decl) = 0;
4816 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4817 *no_add_attrs = true;
4823 /* Handle an "visibility" attribute; arguments as in
4824 struct attribute_spec.handler. */
4827 handle_visibility_attribute (tree *node, tree name, tree args,
4828 int flags ATTRIBUTE_UNUSED,
4833 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
4835 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4836 *no_add_attrs = true;
4842 id = TREE_VALUE (args);
4843 if (TREE_CODE (id) != STRING_CST)
4845 error ("visibility arg not a string");
4846 *no_add_attrs = true;
4849 if (strcmp (TREE_STRING_POINTER (id), "hidden")
4850 && strcmp (TREE_STRING_POINTER (id), "protected")
4851 && strcmp (TREE_STRING_POINTER (id), "internal")
4852 && strcmp (TREE_STRING_POINTER (id), "default"))
4854 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4855 *no_add_attrs = true;
4863 /* Handle an "tls_model" attribute; arguments as in
4864 struct attribute_spec.handler. */
4867 handle_tls_model_attribute (tree *node, tree name, tree args,
4868 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4872 if (! DECL_THREAD_LOCAL (decl))
4874 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4875 *no_add_attrs = true;
4881 id = TREE_VALUE (args);
4882 if (TREE_CODE (id) != STRING_CST)
4884 error ("tls_model arg not a string");
4885 *no_add_attrs = true;
4888 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4889 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4890 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4891 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4893 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4894 *no_add_attrs = true;
4902 /* Handle a "no_instrument_function" attribute; arguments as in
4903 struct attribute_spec.handler. */
4906 handle_no_instrument_function_attribute (tree *node, tree name,
4907 tree args ATTRIBUTE_UNUSED,
4908 int flags ATTRIBUTE_UNUSED,
4913 if (TREE_CODE (decl) != FUNCTION_DECL)
4915 error ("%H'%E' attribute applies only to functions",
4916 &DECL_SOURCE_LOCATION (decl), name);
4917 *no_add_attrs = true;
4919 else if (DECL_INITIAL (decl))
4921 error ("%Hcan't set '%E' attribute after definition",
4922 &DECL_SOURCE_LOCATION (decl), name);
4923 *no_add_attrs = true;
4926 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
4931 /* Handle a "malloc" attribute; arguments as in
4932 struct attribute_spec.handler. */
4935 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4936 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4938 if (TREE_CODE (*node) == FUNCTION_DECL)
4939 DECL_IS_MALLOC (*node) = 1;
4940 /* ??? TODO: Support types. */
4943 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4944 *no_add_attrs = true;
4950 /* Handle a "no_limit_stack" attribute; arguments as in
4951 struct attribute_spec.handler. */
4954 handle_no_limit_stack_attribute (tree *node, tree name,
4955 tree args ATTRIBUTE_UNUSED,
4956 int flags ATTRIBUTE_UNUSED,
4961 if (TREE_CODE (decl) != FUNCTION_DECL)
4963 error ("%H'%E' attribute applies only to functions",
4964 &DECL_SOURCE_LOCATION (decl), name);
4965 *no_add_attrs = true;
4967 else if (DECL_INITIAL (decl))
4969 error ("%Hcan't set '%E' attribute after definition",
4970 &DECL_SOURCE_LOCATION (decl), name);
4971 *no_add_attrs = true;
4974 DECL_NO_LIMIT_STACK (decl) = 1;
4979 /* Handle a "pure" attribute; arguments as in
4980 struct attribute_spec.handler. */
4983 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4984 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4986 if (TREE_CODE (*node) == FUNCTION_DECL)
4987 DECL_IS_PURE (*node) = 1;
4988 /* ??? TODO: Support types. */
4991 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4992 *no_add_attrs = true;
4998 /* Handle a "deprecated" attribute; arguments as in
4999 struct attribute_spec.handler. */
5002 handle_deprecated_attribute (tree *node, tree name,
5003 tree args ATTRIBUTE_UNUSED, int flags,
5006 tree type = NULL_TREE;
5008 const char *what = NULL;
5013 type = TREE_TYPE (decl);
5015 if (TREE_CODE (decl) == TYPE_DECL
5016 || TREE_CODE (decl) == PARM_DECL
5017 || TREE_CODE (decl) == VAR_DECL
5018 || TREE_CODE (decl) == FUNCTION_DECL
5019 || TREE_CODE (decl) == FIELD_DECL)
5020 TREE_DEPRECATED (decl) = 1;
5024 else if (TYPE_P (*node))
5026 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5027 *node = build_type_copy (*node);
5028 TREE_DEPRECATED (*node) = 1;
5036 *no_add_attrs = true;
5037 if (type && TYPE_NAME (type))
5039 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5040 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5041 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5042 && DECL_NAME (TYPE_NAME (type)))
5043 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5046 warning ("`%s' attribute ignored for `%s'",
5047 IDENTIFIER_POINTER (name), what);
5049 warning ("`%s' attribute ignored",
5050 IDENTIFIER_POINTER (name));
5056 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5057 to prevent us from duplicating type nodes unnecessarily.
5058 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5059 since we want to distinguish types that are essentially identical (except
5060 for their debug representation), we use a local list here. */
5061 static GTY(()) tree vector_type_node_list = 0;
5063 /* Handle a "vector_size" attribute; arguments as in
5064 struct attribute_spec.handler. */
5067 handle_vector_size_attribute (tree *node, tree name, tree args,
5068 int flags ATTRIBUTE_UNUSED,
5071 unsigned HOST_WIDE_INT vecsize, nunits;
5072 enum machine_mode mode, orig_mode, new_mode;
5073 tree type = *node, new_type = NULL_TREE;
5074 tree type_list_node;
5076 *no_add_attrs = true;
5078 if (! host_integerp (TREE_VALUE (args), 1))
5080 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5084 /* Get the vector size (in bytes). */
5085 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5087 /* We need to provide for vector pointers, vector arrays, and
5088 functions returning vectors. For example:
5090 __attribute__((vector_size(16))) short *foo;
5092 In this case, the mode is SI, but the type being modified is
5093 HI, so we need to look further. */
5095 while (POINTER_TYPE_P (type)
5096 || TREE_CODE (type) == FUNCTION_TYPE
5097 || TREE_CODE (type) == ARRAY_TYPE)
5098 type = TREE_TYPE (type);
5100 /* Get the mode of the type being modified. */
5101 orig_mode = TYPE_MODE (type);
5103 if (TREE_CODE (type) == RECORD_TYPE
5104 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5105 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5106 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5108 error ("invalid vector type for attribute `%s'",
5109 IDENTIFIER_POINTER (name));
5113 /* Calculate how many units fit in the vector. */
5114 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5116 /* Find a suitably sized vector. */
5117 new_mode = VOIDmode;
5118 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5120 : MODE_VECTOR_FLOAT);
5122 mode = GET_MODE_WIDER_MODE (mode))
5123 if (vecsize == GET_MODE_SIZE (mode)
5124 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5130 if (new_mode == VOIDmode)
5132 error ("no vector mode with the size and type specified could be found");
5136 for (type_list_node = vector_type_node_list; type_list_node;
5137 type_list_node = TREE_CHAIN (type_list_node))
5139 tree other_type = TREE_VALUE (type_list_node);
5140 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5141 tree fields = TYPE_FIELDS (record);
5142 tree field_type = TREE_TYPE (fields);
5143 tree array_type = TREE_TYPE (field_type);
5144 if (TREE_CODE (fields) != FIELD_DECL
5145 || TREE_CODE (field_type) != ARRAY_TYPE)
5148 if (TYPE_MODE (other_type) == mode && type == array_type)
5150 new_type = other_type;
5155 if (new_type == NULL_TREE)
5157 tree index, array, rt, list_node;
5159 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5160 TREE_UNSIGNED (type));
5164 error ("no vector mode with the size and type specified could be found");
5168 new_type = build_type_copy (new_type);
5170 /* If this is a vector, make sure we either have hardware
5171 support, or we can emulate it. */
5172 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5173 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5174 && !vector_mode_valid_p (mode))
5176 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5180 /* Set the debug information here, because this is the only
5181 place where we know the underlying type for a vector made
5182 with vector_size. For debugging purposes we pretend a vector
5183 is an array within a structure. */
5184 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5185 array = build_array_type (type, build_index_type (index));
5186 rt = make_node (RECORD_TYPE);
5188 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5189 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5191 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5193 list_node = build_tree_list (NULL, new_type);
5194 TREE_CHAIN (list_node) = vector_type_node_list;
5195 vector_type_node_list = list_node;
5198 /* Build back pointers if needed. */
5199 *node = vector_size_helper (*node, new_type);
5204 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5207 If we requested a pointer to a vector, build up the pointers that
5208 we stripped off while looking for the inner type. Similarly for
5209 return values from functions.
5211 The argument "type" is the top of the chain, and "bottom" is the
5212 new type which we will point to. */
5215 vector_size_helper (tree type, tree bottom)
5219 if (POINTER_TYPE_P (type))
5221 inner = vector_size_helper (TREE_TYPE (type), bottom);
5222 outer = build_pointer_type (inner);
5224 else if (TREE_CODE (type) == ARRAY_TYPE)
5226 inner = vector_size_helper (TREE_TYPE (type), bottom);
5227 outer = build_array_type (inner, TYPE_VALUES (type));
5229 else if (TREE_CODE (type) == FUNCTION_TYPE)
5231 inner = vector_size_helper (TREE_TYPE (type), bottom);
5232 outer = build_function_type (inner, TYPE_VALUES (type));
5237 TREE_READONLY (outer) = TREE_READONLY (type);
5238 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5243 /* Handle the "nonnull" attribute. */
5245 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5246 tree args, int flags ATTRIBUTE_UNUSED,
5250 unsigned HOST_WIDE_INT attr_arg_num;
5252 /* If no arguments are specified, all pointer arguments should be
5253 non-null. Verify a full prototype is given so that the arguments
5254 will have the correct types when we actually check them later. */
5257 if (! TYPE_ARG_TYPES (type))
5259 error ("nonnull attribute without arguments on a non-prototype");
5260 *no_add_attrs = true;
5265 /* Argument list specified. Verify that each argument number references
5266 a pointer argument. */
5267 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5270 unsigned HOST_WIDE_INT arg_num, ck_num;
5272 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5274 error ("nonnull argument has invalid operand number (arg %lu)",
5275 (unsigned long) attr_arg_num);
5276 *no_add_attrs = true;
5280 argument = TYPE_ARG_TYPES (type);
5283 for (ck_num = 1; ; ck_num++)
5285 if (! argument || ck_num == arg_num)
5287 argument = TREE_CHAIN (argument);
5291 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5293 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5294 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5295 *no_add_attrs = true;
5299 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5301 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5302 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5303 *no_add_attrs = true;
5312 /* Check the argument list of a function call for null in argument slots
5313 that are marked as requiring a non-null pointer argument. */
5316 check_function_nonnull (tree attrs, tree params)
5318 tree a, args, param;
5321 for (a = attrs; a; a = TREE_CHAIN (a))
5323 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5325 args = TREE_VALUE (a);
5327 /* Walk the argument list. If we encounter an argument number we
5328 should check for non-null, do it. If the attribute has no args,
5329 then every pointer argument is checked (in which case the check
5330 for pointer type is done in check_nonnull_arg). */
5331 for (param = params, param_num = 1; ;
5332 param_num++, param = TREE_CHAIN (param))
5336 if (! args || nonnull_check_p (args, param_num))
5337 check_function_arguments_recurse (check_nonnull_arg, NULL,
5345 /* Helper for check_function_nonnull; given a list of operands which
5346 must be non-null in ARGS, determine if operand PARAM_NUM should be
5350 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5352 unsigned HOST_WIDE_INT arg_num;
5354 for (; args; args = TREE_CHAIN (args))
5356 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5359 if (arg_num == param_num)
5365 /* Check that the function argument PARAM (which is operand number
5366 PARAM_NUM) is non-null. This is called by check_function_nonnull
5367 via check_function_arguments_recurse. */
5370 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5371 unsigned HOST_WIDE_INT param_num)
5373 /* Just skip checking the argument if it's not a pointer. This can
5374 happen if the "nonnull" attribute was given without an operand
5375 list (which means to check every pointer argument). */
5377 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5380 if (integer_zerop (param))
5381 warning ("null argument where non-null required (arg %lu)",
5382 (unsigned long) param_num);
5385 /* Helper for nonnull attribute handling; fetch the operand number
5386 from the attribute argument list. */
5389 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5391 /* Strip any conversions from the arg number and verify they
5393 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5394 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5395 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5396 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5398 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5399 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5402 *valp = TREE_INT_CST_LOW (arg_num_expr);
5406 /* Handle a "nothrow" attribute; arguments as in
5407 struct attribute_spec.handler. */
5410 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5411 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5413 if (TREE_CODE (*node) == FUNCTION_DECL)
5414 TREE_NOTHROW (*node) = 1;
5415 /* ??? TODO: Support types. */
5418 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5419 *no_add_attrs = true;
5425 /* Handle a "cleanup" attribute; arguments as in
5426 struct attribute_spec.handler. */
5429 handle_cleanup_attribute (tree *node, tree name, tree args,
5430 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5433 tree cleanup_id, cleanup_decl;
5435 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5436 for global destructors in C++. This requires infrastructure that
5437 we don't have generically at the moment. It's also not a feature
5438 we'd be missing too much, since we do have attribute constructor. */
5439 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5441 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5442 *no_add_attrs = true;
5446 /* Verify that the argument is a function in scope. */
5447 /* ??? We could support pointers to functions here as well, if
5448 that was considered desirable. */
5449 cleanup_id = TREE_VALUE (args);
5450 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5452 error ("cleanup arg not an identifier");
5453 *no_add_attrs = true;
5456 cleanup_decl = lookup_name (cleanup_id);
5457 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5459 error ("cleanup arg not a function");
5460 *no_add_attrs = true;
5464 /* That the function has proper type is checked with the
5465 eventual call to build_function_call. */
5470 /* Check for valid arguments being passed to a function. */
5472 check_function_arguments (tree attrs, tree params)
5474 /* Check for null being passed in a pointer argument that must be
5475 non-null. We also need to do this if format checking is enabled. */
5478 check_function_nonnull (attrs, params);
5480 /* Check for errors in format strings. */
5483 check_function_format (NULL, attrs, params);
5486 /* Generic argument checking recursion routine. PARAM is the argument to
5487 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5488 once the argument is resolved. CTX is context for the callback. */
5490 check_function_arguments_recurse (void (*callback)
5491 (void *, tree, unsigned HOST_WIDE_INT),
5492 void *ctx, tree param,
5493 unsigned HOST_WIDE_INT param_num)
5495 if (TREE_CODE (param) == NOP_EXPR)
5497 /* Strip coercion. */
5498 check_function_arguments_recurse (callback, ctx,
5499 TREE_OPERAND (param, 0), param_num);
5503 if (TREE_CODE (param) == CALL_EXPR)
5505 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5507 bool found_format_arg = false;
5509 /* See if this is a call to a known internationalization function
5510 that modifies a format arg. Such a function may have multiple
5511 format_arg attributes (for example, ngettext). */
5513 for (attrs = TYPE_ATTRIBUTES (type);
5515 attrs = TREE_CHAIN (attrs))
5516 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5519 tree format_num_expr;
5523 /* Extract the argument number, which was previously checked
5525 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5526 while (TREE_CODE (format_num_expr) == NOP_EXPR
5527 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5528 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5529 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5531 if (TREE_CODE (format_num_expr) != INTEGER_CST
5532 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5535 format_num = TREE_INT_CST_LOW (format_num_expr);
5537 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5539 inner_args = TREE_CHAIN (inner_args), i++)
5540 if (i == format_num)
5542 check_function_arguments_recurse (callback, ctx,
5543 TREE_VALUE (inner_args),
5545 found_format_arg = true;
5550 /* If we found a format_arg attribute and did a recursive check,
5551 we are done with checking this argument. Otherwise, we continue
5552 and this will be considered a non-literal. */
5553 if (found_format_arg)
5557 if (TREE_CODE (param) == COND_EXPR)
5559 /* Check both halves of the conditional expression. */
5560 check_function_arguments_recurse (callback, ctx,
5561 TREE_OPERAND (param, 1), param_num);
5562 check_function_arguments_recurse (callback, ctx,
5563 TREE_OPERAND (param, 2), param_num);
5567 (*callback) (ctx, param, param_num);
5570 /* Function to help qsort sort FIELD_DECLs by name order. */
5573 field_decl_cmp (const void *x_p, const void *y_p)
5575 const tree *const x = x_p;
5576 const tree *const y = y_p;
5577 if (DECL_NAME (*x) == DECL_NAME (*y))
5578 /* A nontype is "greater" than a type. */
5579 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5580 if (DECL_NAME (*x) == NULL_TREE)
5582 if (DECL_NAME (*y) == NULL_TREE)
5584 if (DECL_NAME (*x) < DECL_NAME (*y))
5590 gt_pointer_operator new_value;
5594 /* This routine compares two fields like field_decl_cmp but using the
5595 pointer operator in resort_data. */
5598 resort_field_decl_cmp (const void *x_p, const void *y_p)
5600 const tree *const x = x_p;
5601 const tree *const y = y_p;
5603 if (DECL_NAME (*x) == DECL_NAME (*y))
5604 /* A nontype is "greater" than a type. */
5605 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5606 if (DECL_NAME (*x) == NULL_TREE)
5608 if (DECL_NAME (*y) == NULL_TREE)
5611 tree d1 = DECL_NAME (*x);
5612 tree d2 = DECL_NAME (*y);
5613 resort_data.new_value (&d1, resort_data.cookie);
5614 resort_data.new_value (&d2, resort_data.cookie);
5621 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5624 resort_sorted_fields (void *obj,
5625 void *orig_obj ATTRIBUTE_UNUSED ,
5626 gt_pointer_operator new_value,
5629 struct sorted_fields_type *sf = obj;
5630 resort_data.new_value = new_value;
5631 resort_data.cookie = cookie;
5632 qsort (&sf->elts[0], sf->len, sizeof (tree),
5633 resort_field_decl_cmp);
5636 /* Used by estimate_num_insns. Estimate number of instructions seen
5637 by given statement. */
5639 c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
5644 if (TYPE_P (x) || DECL_P (x))
5649 /* Assume that constants and references counts nothing. These should
5650 be majorized by amount of operations amoung them we count later
5651 and are common target of CSE and similar optimizations. */
5652 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
5653 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
5655 switch (TREE_CODE (x))
5657 /* Reconginze assignments of large structures and constructors of
5662 int size = int_size_in_bytes (TREE_TYPE (x));
5664 if (!size || size > MOVE_MAX_PIECES)
5667 *count += 2 * (size + MOVE_MAX - 1) / MOVE_MAX;
5671 /* Few special cases of expensive operations. This is usefull
5672 to avoid inlining on functions having too many of these. */
5673 case TRUNC_DIV_EXPR:
5675 case FLOOR_DIV_EXPR:
5676 case ROUND_DIV_EXPR:
5677 case TRUNC_MOD_EXPR:
5679 case FLOOR_MOD_EXPR:
5680 case ROUND_MOD_EXPR:
5685 /* Various containers that will produce no code themselves. */
5692 case IDENTIFIER_NODE:
5693 case PLACEHOLDER_EXPR:
5694 case WITH_CLEANUP_EXPR:
5695 case CLEANUP_POINT_EXPR:
5697 case VIEW_CONVERT_EXPR:
5703 case TRY_CATCH_EXPR:
5704 case TRY_FINALLY_EXPR:
5707 case LABELED_BLOCK_EXPR:
5708 case EXIT_BLOCK_EXPR:
5709 case EXPR_WITH_FILE_LOCATION:
5726 /* Do not account static initializers. */
5727 if (TREE_STATIC (TREE_OPERAND (x, 0)))
5736 /* Estimate number of instructions that will be created by expanding the body. */
5738 c_estimate_num_insns (tree decl)
5741 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl), c_estimate_num_insns_1, &num);
5745 #include "gt-c-common.h"