1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
36 #include "diagnostic.h"
41 #include "langhooks.h"
42 #include "tree-inline.h"
46 cpp_reader *parse_in; /* Declared in c-pragma.h. */
48 /* We let tm.h override the types used here, to handle trivial differences
49 such as the choice of unsigned int or long unsigned int for size_t.
50 When machines start needing nontrivial differences in the size type,
51 it would be best to do something here to figure out automatically
52 from other information what type to use. */
55 #define SIZE_TYPE "long unsigned int"
59 #define WCHAR_TYPE "int"
62 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
63 #define MODIFIED_WCHAR_TYPE \
64 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
67 #define PTRDIFF_TYPE "long int"
71 #define WINT_TYPE "unsigned int"
75 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
77 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
83 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
85 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
86 ? "long unsigned int" \
87 : "long long unsigned int"))
90 /* The following symbols are subsumed in the c_global_trees array, and
91 listed here individually for documentation purposes.
93 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
95 tree short_integer_type_node;
96 tree long_integer_type_node;
97 tree long_long_integer_type_node;
99 tree short_unsigned_type_node;
100 tree long_unsigned_type_node;
101 tree long_long_unsigned_type_node;
103 tree truthvalue_type_node;
104 tree truthvalue_false_node;
105 tree truthvalue_true_node;
107 tree ptrdiff_type_node;
109 tree unsigned_char_type_node;
110 tree signed_char_type_node;
111 tree wchar_type_node;
112 tree signed_wchar_type_node;
113 tree unsigned_wchar_type_node;
115 tree float_type_node;
116 tree double_type_node;
117 tree long_double_type_node;
119 tree complex_integer_type_node;
120 tree complex_float_type_node;
121 tree complex_double_type_node;
122 tree complex_long_double_type_node;
124 tree intQI_type_node;
125 tree intHI_type_node;
126 tree intSI_type_node;
127 tree intDI_type_node;
128 tree intTI_type_node;
130 tree unsigned_intQI_type_node;
131 tree unsigned_intHI_type_node;
132 tree unsigned_intSI_type_node;
133 tree unsigned_intDI_type_node;
134 tree unsigned_intTI_type_node;
136 tree widest_integer_literal_type_node;
137 tree widest_unsigned_literal_type_node;
139 Nodes for types `void *' and `const void *'.
141 tree ptr_type_node, const_ptr_type_node;
143 Nodes for types `char *' and `const char *'.
145 tree string_type_node, const_string_type_node;
147 Type `char[SOMENUMBER]'.
148 Used when an array of char is needed and the size is irrelevant.
150 tree char_array_type_node;
152 Type `int[SOMENUMBER]' or something like it.
153 Used when an array of int needed and the size is irrelevant.
155 tree int_array_type_node;
157 Type `wchar_t[SOMENUMBER]' or something like it.
158 Used when a wide string literal is created.
160 tree wchar_array_type_node;
162 Type `int ()' -- used for implicit declaration of functions.
164 tree default_function_type;
166 A VOID_TYPE node, packaged in a TREE_LIST.
170 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
171 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
172 VAR_DECLS, but C++ does.)
174 tree function_name_decl_node;
175 tree pretty_function_name_decl_node;
176 tree c99_function_name_decl_node;
178 Stack of nested function name VAR_DECLs.
180 tree saved_function_name_decls;
184 tree c_global_trees[CTI_MAX];
186 /* TRUE if a code represents a statement. The front end init
187 langhook should take care of initialization of this array. */
189 bool statement_code_p[MAX_TREE_CODES];
191 /* Switches common to the C front ends. */
193 /* Nonzero if prepreprocessing only. */
195 int flag_preprocess_only;
197 /* Nonzero means don't output line number information. */
199 char flag_no_line_commands;
201 /* Nonzero causes -E output not to be done, but directives such as
202 #define that have side effects are still obeyed. */
206 /* Nonzero means dump macros in some fashion. */
208 char flag_dump_macros;
210 /* Nonzero means pass #include lines through to the output. */
212 char flag_dump_includes;
214 /* The file name to which we should write a precompiled header, or
215 NULL if no header will be written in this compile. */
217 const char *pch_file;
219 /* Nonzero if an ISO standard was selected. It rejects macros in the
223 /* Nonzero if -undef was given. It suppresses target built-in macros
227 /* Nonzero means don't recognize the non-ANSI builtin functions. */
231 /* Nonzero means don't recognize the non-ANSI builtin functions.
234 int flag_no_nonansi_builtin;
236 /* Nonzero means give `double' the same size as `float'. */
238 int flag_short_double;
240 /* Nonzero means give `wchar_t' the same size as `short'. */
242 int flag_short_wchar;
244 /* Nonzero means allow Microsoft extensions without warnings or errors. */
245 int flag_ms_extensions;
247 /* Nonzero means don't recognize the keyword `asm'. */
251 /* Nonzero means give string constants the type `const char *', as mandated
254 int flag_const_strings;
256 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
258 int flag_signed_bitfields = 1;
259 int explicit_flag_signed_bitfields;
261 /* Nonzero means warn about pointer casts that can drop a type qualifier
262 from the pointer target type. */
266 /* Warn about functions which might be candidates for format attributes. */
268 int warn_missing_format_attribute;
270 /* Nonzero means warn about sizeof(function) or addition/subtraction
271 of function pointers. */
273 int warn_pointer_arith;
275 /* Nonzero means warn for any global function def
276 without separate previous prototype decl. */
278 int warn_missing_prototypes;
280 /* Warn if adding () is suggested. */
282 int warn_parentheses;
284 /* Warn if initializer is not completely bracketed. */
286 int warn_missing_braces;
288 /* Warn about comparison of signed and unsigned values.
289 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified
290 (in which case -Wextra gets to decide). */
292 int warn_sign_compare = -1;
294 /* Nonzero means warn about usage of long long when `-pedantic'. */
296 int warn_long_long = 1;
298 /* Nonzero means warn about deprecated conversion from string constant to
301 int warn_write_strings;
303 /* Nonzero means warn about multiple (redundant) decls for the same single
304 variable or function. */
306 int warn_redundant_decls;
308 /* Warn about testing equality of floating point numbers. */
310 int warn_float_equal;
312 /* Warn about a subscript that has type char. */
314 int warn_char_subscripts;
316 /* Warn if a type conversion is done that might have confusing results. */
320 /* Warn about #pragma directives that are not recognized. */
322 int warn_unknown_pragmas; /* Tri state variable. */
324 /* Warn about format/argument anomalies in calls to formatted I/O functions
325 (*printf, *scanf, strftime, strfmon, etc.). */
329 /* Warn about Y2K problems with strftime formats. */
333 /* Warn about excess arguments to formats. */
335 int warn_format_extra_args;
337 /* Warn about zero-length formats. */
339 int warn_format_zero_length;
341 /* Warn about non-literal format arguments. */
343 int warn_format_nonliteral;
345 /* Warn about possible security problems with calls to format functions. */
347 int warn_format_security;
350 /* C/ObjC language option variables. */
353 /* Nonzero means message about use of implicit function declarations;
354 1 means warning; 2 means error. */
356 int mesg_implicit_function_declaration = -1;
358 /* Nonzero means allow type mismatches in conditional expressions;
359 just make their values `void'. */
361 int flag_cond_mismatch;
363 /* Nonzero means enable C89 Amendment 1 features. */
367 /* Nonzero means use the ISO C99 dialect of C. */
371 /* Nonzero means that we have builtin functions, and main is an int */
375 /* Nonzero means warn when casting a function call to a type that does
376 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
377 when there is no previous declaration of sqrt or malloc. */
379 int warn_bad_function_cast;
381 /* Warn about traditional constructs whose meanings changed in ANSI C. */
383 int warn_traditional;
385 /* Nonzero means warn for a declaration found after a statement. */
387 int warn_declaration_after_statement;
389 /* Nonzero means warn for non-prototype function decls
390 or non-prototyped defs without previous prototype. */
392 int warn_strict_prototypes;
394 /* Nonzero means warn for any global function def
395 without separate previous decl. */
397 int warn_missing_declarations;
399 /* Nonzero means warn about declarations of objects not at
400 file-scope level and about *all* declarations of functions (whether
401 or static) not at file-scope level. Note that we exclude
402 implicit function declarations. To get warnings about those, use
405 int warn_nested_externs;
407 /* Warn if main is suspicious. */
411 /* Nonzero means warn about possible violations of sequence point rules. */
413 int warn_sequence_point;
415 /* Nonzero means warn about uninitialized variable when it is initialized with itself.
416 For example: int i = i;, GCC will not warn about this when warn_init_self is nonzero. */
420 /* Nonzero means to warn about compile-time division by zero. */
421 int warn_div_by_zero = 1;
423 /* Nonzero means warn about use of implicit int. */
425 int warn_implicit_int;
427 /* Warn about NULL being passed to argument slots marked as requiring
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 /* 0 means we want the preprocessor to not emit line directives for
568 the current working directory. 1 means we want it to do it. -1
569 means we should decide depending on whether debugging information
570 is being emitted or not. */
572 int flag_working_directory = -1;
574 /* Nonzero to use __cxa_atexit, rather than atexit, to register
575 destructors for local statics and global objects. */
577 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
579 /* Nonzero means make the default pedwarns warnings instead of errors.
580 The value of this flag is ignored if -pedantic is specified. */
584 /* Nonzero means to implement standard semantics for exception
585 specifications, calling unexpected if an exception is thrown that
586 doesn't match the specification. Zero means to treat them as
587 assertions and optimize accordingly, but not check them. */
589 int flag_enforce_eh_specs = 1;
591 /* The version of the C++ ABI in use. The following values are
594 0: The version of the ABI believed most conformant with the
595 C++ ABI specification. This ABI may change as bugs are
596 discovered and fixed. Therefore, 0 will not necessarily
597 indicate the same ABI in different versions of G++.
599 1: The version of the ABI first used in G++ 3.2.
601 Additional positive integers will be assigned as new versions of
602 the ABI become the default version of the ABI. */
604 int flag_abi_version = 1;
606 /* Nonzero means warn about things that will change when compiling
607 with an ABI-compliant compiler. */
611 /* Nonzero means warn about invalid uses of offsetof. */
613 int warn_invalid_offsetof = 1;
615 /* Nonzero means warn about implicit declarations. */
617 int warn_implicit = 1;
619 /* Nonzero means warn when all ctors or dtors are private, and the class
622 int warn_ctor_dtor_privacy = 0;
624 /* Nonzero means warn in function declared in derived class has the
625 same name as a virtual in the base class, but fails to match the
626 type signature of any virtual function in the base class. */
628 int warn_overloaded_virtual;
630 /* Nonzero means warn when declaring a class that has a non virtual
631 destructor, when it really ought to have a virtual one. */
635 /* Nonzero means warn when the compiler will reorder code. */
639 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
643 /* Nonzero means warn when we convert a pointer to member function
644 into a pointer to (void or function). */
646 int warn_pmf2ptr = 1;
648 /* Nonzero means warn about violation of some Effective C++ style rules. */
652 /* Nonzero means warn where overload resolution chooses a promotion from
653 unsigned to signed over a conversion to an unsigned of the same size. */
657 /* Nonzero means warn when an old-style cast is used. */
659 int warn_old_style_cast;
661 /* Nonzero means warn when non-templatized friend functions are
662 declared within a template */
664 int warn_nontemplate_friend = 1;
666 /* Nonzero means complain about deprecated features. */
668 int warn_deprecated = 1;
670 /* Maximum template instantiation depth. This limit is rather
671 arbitrary, but it exists to limit the time it takes to notice
672 infinite template instantiations. */
674 int max_tinst_depth = 500;
678 /* The elements of `ridpointers' are identifier nodes for the reserved
679 type names and storage classes. It is indexed by a RID_... value. */
682 tree (*make_fname_decl) (tree, int);
684 /* If non-NULL, the address of a language-specific function that takes
685 any action required right before expand_function_end is called. */
686 void (*lang_expand_function_end) (void);
688 /* Nonzero means the expression being parsed will never be evaluated.
689 This is a count, since unevaluated expressions can nest. */
692 /* Information about how a function name is generated. */
695 tree *const decl; /* pointer to the VAR_DECL. */
696 const unsigned rid; /* RID number for the identifier. */
697 const int pretty; /* How pretty is it? */
700 /* The three ways of getting then name of the current function. */
702 const struct fname_var_t fname_vars[] =
704 /* C99 compliant __func__, must be first. */
705 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
706 /* GCC __FUNCTION__ compliant. */
707 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
708 /* GCC __PRETTY_FUNCTION__ compliant. */
709 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
713 static int constant_fits_type_p (tree, tree);
715 /* Keep a stack of if statements. We record the number of compound
716 statements seen up to the if keyword, as well as the line number
717 and file of the if. If a potentially ambiguous else is seen, that
718 fact is recorded; the warning is issued when we can be sure that
719 the enclosing if statement does not have an else branch. */
728 static if_elt *if_stack;
730 /* Amount of space in the if statement stack. */
731 static int if_stack_space = 0;
734 static int if_stack_pointer = 0;
736 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
737 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
738 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
739 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
740 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
741 static tree handle_always_inline_attribute (tree *, tree, tree, int,
743 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
744 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
745 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
746 static tree handle_transparent_union_attribute (tree *, tree, tree,
748 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
749 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
750 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
751 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
752 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
753 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
754 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
755 static tree handle_visibility_attribute (tree *, tree, tree, int,
757 static tree handle_tls_model_attribute (tree *, tree, tree, int,
759 static tree handle_no_instrument_function_attribute (tree *, tree,
761 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
762 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
764 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
765 static tree handle_deprecated_attribute (tree *, tree, tree, int,
767 static tree handle_vector_size_attribute (tree *, tree, tree, int,
769 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
770 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
771 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
772 static tree vector_size_helper (tree, tree);
774 static void check_function_nonnull (tree, tree);
775 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
776 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
777 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
778 static int resort_field_decl_cmp (const void *, const void *);
780 /* Table of machine-independent attributes common to all C-like languages. */
781 const struct attribute_spec c_common_attribute_table[] =
783 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
784 { "packed", 0, 0, false, false, false,
785 handle_packed_attribute },
786 { "nocommon", 0, 0, true, false, false,
787 handle_nocommon_attribute },
788 { "common", 0, 0, true, false, false,
789 handle_common_attribute },
790 /* FIXME: logically, noreturn attributes should be listed as
791 "false, true, true" and apply to function types. But implementing this
792 would require all the places in the compiler that use TREE_THIS_VOLATILE
793 on a decl to identify non-returning functions to be located and fixed
794 to check the function type instead. */
795 { "noreturn", 0, 0, true, false, false,
796 handle_noreturn_attribute },
797 { "volatile", 0, 0, true, false, false,
798 handle_noreturn_attribute },
799 { "noinline", 0, 0, true, false, false,
800 handle_noinline_attribute },
801 { "always_inline", 0, 0, true, false, false,
802 handle_always_inline_attribute },
803 { "used", 0, 0, true, false, false,
804 handle_used_attribute },
805 { "unused", 0, 0, false, false, false,
806 handle_unused_attribute },
807 /* The same comments as for noreturn attributes apply to const ones. */
808 { "const", 0, 0, true, false, false,
809 handle_const_attribute },
810 { "transparent_union", 0, 0, false, false, false,
811 handle_transparent_union_attribute },
812 { "constructor", 0, 0, true, false, false,
813 handle_constructor_attribute },
814 { "destructor", 0, 0, true, false, false,
815 handle_destructor_attribute },
816 { "mode", 1, 1, false, true, false,
817 handle_mode_attribute },
818 { "section", 1, 1, true, false, false,
819 handle_section_attribute },
820 { "aligned", 0, 1, false, false, false,
821 handle_aligned_attribute },
822 { "weak", 0, 0, true, false, false,
823 handle_weak_attribute },
824 { "alias", 1, 1, true, false, false,
825 handle_alias_attribute },
826 { "no_instrument_function", 0, 0, true, false, false,
827 handle_no_instrument_function_attribute },
828 { "malloc", 0, 0, true, false, false,
829 handle_malloc_attribute },
830 { "no_stack_limit", 0, 0, true, false, false,
831 handle_no_limit_stack_attribute },
832 { "pure", 0, 0, true, false, false,
833 handle_pure_attribute },
834 { "deprecated", 0, 0, false, false, false,
835 handle_deprecated_attribute },
836 { "vector_size", 1, 1, false, true, false,
837 handle_vector_size_attribute },
838 { "visibility", 1, 1, true, false, false,
839 handle_visibility_attribute },
840 { "tls_model", 1, 1, true, false, false,
841 handle_tls_model_attribute },
842 { "nonnull", 0, -1, false, true, true,
843 handle_nonnull_attribute },
844 { "nothrow", 0, 0, true, false, false,
845 handle_nothrow_attribute },
846 { "may_alias", 0, 0, false, true, false, NULL },
847 { "cleanup", 1, 1, true, false, false,
848 handle_cleanup_attribute },
849 { NULL, 0, 0, false, false, false, NULL }
852 /* Give the specifications for the format attributes, used by C and all
855 const struct attribute_spec c_common_format_attribute_table[] =
857 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
858 { "format", 3, 3, false, true, true,
859 handle_format_attribute },
860 { "format_arg", 1, 1, false, true, true,
861 handle_format_arg_attribute },
862 { NULL, 0, 0, false, false, false, NULL }
865 /* Record the start of an if-then, and record the start of it
866 for ambiguous else detection.
868 COND is the condition for the if-then statement.
870 IF_STMT is the statement node that has already been created for
871 this if-then statement. It is created before parsing the
872 condition to keep line number information accurate. */
875 c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
877 /* Make sure there is enough space on the stack. */
878 if (if_stack_space == 0)
881 if_stack = xmalloc (10 * sizeof (if_elt));
883 else if (if_stack_space == if_stack_pointer)
885 if_stack_space += 10;
886 if_stack = xrealloc (if_stack, if_stack_space * sizeof (if_elt));
889 IF_COND (if_stmt) = cond;
892 /* Record this if statement. */
893 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
894 if_stack[if_stack_pointer].locus = input_location;
895 if_stack[if_stack_pointer].needs_warning = 0;
896 if_stack[if_stack_pointer].if_stmt = if_stmt;
900 /* Called after the then-clause for an if-statement is processed. */
905 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
906 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
909 /* Record the end of an if-then. Optionally warn if a nested
910 if statement had an ambiguous else clause. */
913 c_expand_end_cond (void)
916 if (if_stack[if_stack_pointer].needs_warning)
917 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
918 &if_stack[if_stack_pointer].locus);
919 last_expr_type = NULL_TREE;
922 /* Called between the then-clause and the else-clause
923 of an if-then-else. */
926 c_expand_start_else (void)
928 /* An ambiguous else warning must be generated for the enclosing if
929 statement, unless we see an else branch for that one, too. */
931 && if_stack_pointer > 1
932 && (if_stack[if_stack_pointer - 1].compstmt_count
933 == if_stack[if_stack_pointer - 2].compstmt_count))
934 if_stack[if_stack_pointer - 2].needs_warning = 1;
936 /* Even if a nested if statement had an else branch, it can't be
937 ambiguous if this one also has an else. So don't warn in that
938 case. Also don't warn for any if statements nested in this else. */
939 if_stack[if_stack_pointer - 1].needs_warning = 0;
940 if_stack[if_stack_pointer - 1].compstmt_count--;
943 /* Called after the else-clause for an if-statement is processed. */
948 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
949 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
952 /* Begin an if-statement. Returns a newly created IF_STMT if
955 Unlike the C++ front-end, we do not call add_stmt here; it is
956 probably safe to do so, but I am not very familiar with this
957 code so I am being extra careful not to change its behavior
958 beyond what is strictly necessary for correctness. */
961 c_begin_if_stmt (void)
964 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
968 /* Begin a while statement. Returns a newly created WHILE_STMT if
971 Unlike the C++ front-end, we do not call add_stmt here; it is
972 probably safe to do so, but I am not very familiar with this
973 code so I am being extra careful not to change its behavior
974 beyond what is strictly necessary for correctness. */
977 c_begin_while_stmt (void)
980 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
985 c_finish_while_stmt_cond (tree cond, tree while_stmt)
987 WHILE_COND (while_stmt) = cond;
990 /* Push current bindings for the function name VAR_DECLS. */
993 start_fname_decls (void)
996 tree saved = NULL_TREE;
998 for (ix = 0; fname_vars[ix].decl; ix++)
1000 tree decl = *fname_vars[ix].decl;
1004 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
1005 *fname_vars[ix].decl = NULL_TREE;
1008 if (saved || saved_function_name_decls)
1009 /* Normally they'll have been NULL, so only push if we've got a
1010 stack, or they are non-NULL. */
1011 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1012 saved_function_name_decls);
1015 /* Finish up the current bindings, adding them into the
1016 current function's statement tree. This is done by wrapping the
1017 function's body in a COMPOUND_STMT containing these decls too. This
1018 must be done _before_ finish_stmt_tree is called. If there is no
1019 current function, we must be at file scope and no statements are
1020 involved. Pop the previous bindings. */
1023 finish_fname_decls (void)
1026 tree body = NULL_TREE;
1027 tree stack = saved_function_name_decls;
1029 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1030 body = chainon (TREE_VALUE (stack), body);
1034 /* They were called into existence, so add to statement tree. Add
1035 the DECL_STMTs inside the outermost scope. */
1036 tree *p = &DECL_SAVED_TREE (current_function_decl);
1037 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1038 while (TREE_CODE (*p) != COMPOUND_STMT)
1039 p = &TREE_CHAIN (*p);
1040 p = &COMPOUND_BODY (*p);
1041 if (TREE_CODE (*p) == SCOPE_STMT)
1042 p = &TREE_CHAIN (*p);
1044 body = chainon (body, *p);
1048 for (ix = 0; fname_vars[ix].decl; ix++)
1049 *fname_vars[ix].decl = NULL_TREE;
1053 /* We had saved values, restore them. */
1056 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1058 tree decl = TREE_PURPOSE (saved);
1059 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1061 *fname_vars[ix].decl = decl;
1063 stack = TREE_CHAIN (stack);
1065 saved_function_name_decls = stack;
1068 /* Return the text name of the current function, suitably prettified
1072 fname_as_string (int pretty_p)
1074 const char *name = NULL;
1077 name = (current_function_decl
1078 ? (*lang_hooks.decl_printable_name) (current_function_decl, 2)
1080 else if (current_function_decl && DECL_NAME (current_function_decl))
1081 name = IDENTIFIER_POINTER (DECL_NAME (current_function_decl));
1087 /* Return the VAR_DECL for a const char array naming the current
1088 function. If the VAR_DECL has not yet been created, create it
1089 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1090 ID is its name (unfortunately C and C++ hold the RID values of
1091 keywords in different places, so we can't derive RID from ID in
1092 this language independent code. */
1095 fname_decl (unsigned int rid, tree id)
1098 tree decl = NULL_TREE;
1100 for (ix = 0; fname_vars[ix].decl; ix++)
1101 if (fname_vars[ix].rid == rid)
1104 decl = *fname_vars[ix].decl;
1107 tree saved_last_tree = last_tree;
1108 /* If a tree is built here, it would normally have the lineno of
1109 the current statement. Later this tree will be moved to the
1110 beginning of the function and this line number will be wrong.
1111 To avoid this problem set the lineno to 0 here; that prevents
1112 it from appearing in the RTL. */
1113 int saved_lineno = input_line;
1116 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1117 if (last_tree != saved_last_tree)
1119 /* We created some statement tree for the decl. This belongs
1120 at the start of the function, so remove it now and reinsert
1121 it after the function is complete. */
1122 tree stmts = TREE_CHAIN (saved_last_tree);
1124 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1125 last_tree = saved_last_tree;
1126 saved_function_name_decls = tree_cons (decl, stmts,
1127 saved_function_name_decls);
1129 *fname_vars[ix].decl = decl;
1130 input_line = saved_lineno;
1132 if (!ix && !current_function_decl)
1133 pedwarn ("%H'%D' is not defined outside of function scope",
1134 &DECL_SOURCE_LOCATION (decl), decl);
1139 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1142 fix_string_type (tree value)
1144 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1145 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1146 const int nchars_max = flag_isoc99 ? 4095 : 509;
1147 int length = TREE_STRING_LENGTH (value);
1150 /* Compute the number of elements, for the array type. */
1151 nchars = wide_flag ? length / wchar_bytes : length;
1153 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1154 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1155 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1157 /* Create the array type for the string constant.
1158 -Wwrite-strings says make the string constant an array of const char
1159 so that copying it to a non-const pointer will get a warning.
1160 For C++, this is the standard behavior. */
1161 if (flag_const_strings && ! flag_writable_strings)
1164 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1167 = build_array_type (elements,
1168 build_index_type (build_int_2 (nchars - 1, 0)));
1172 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1173 build_index_type (build_int_2 (nchars - 1, 0)));
1175 TREE_CONSTANT (value) = 1;
1176 TREE_READONLY (value) = ! flag_writable_strings;
1177 TREE_STATIC (value) = 1;
1181 /* Print a warning if a constant expression had overflow in folding.
1182 Invoke this function on every expression that the language
1183 requires to be a constant expression.
1184 Note the ANSI C standard says it is erroneous for a
1185 constant expression to overflow. */
1188 constant_expression_warning (tree value)
1190 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1191 || TREE_CODE (value) == VECTOR_CST
1192 || TREE_CODE (value) == COMPLEX_CST)
1193 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1194 pedwarn ("overflow in constant expression");
1197 /* Print a warning if an expression had overflow in folding.
1198 Invoke this function on every expression that
1199 (1) appears in the source code, and
1200 (2) might be a constant expression that overflowed, and
1201 (3) is not already checked by convert_and_check;
1202 however, do not invoke this function on operands of explicit casts. */
1205 overflow_warning (tree value)
1207 if ((TREE_CODE (value) == INTEGER_CST
1208 || (TREE_CODE (value) == COMPLEX_CST
1209 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1210 && TREE_OVERFLOW (value))
1212 TREE_OVERFLOW (value) = 0;
1213 if (skip_evaluation == 0)
1214 warning ("integer overflow in expression");
1216 else if ((TREE_CODE (value) == REAL_CST
1217 || (TREE_CODE (value) == COMPLEX_CST
1218 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1219 && TREE_OVERFLOW (value))
1221 TREE_OVERFLOW (value) = 0;
1222 if (skip_evaluation == 0)
1223 warning ("floating point overflow in expression");
1225 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1227 TREE_OVERFLOW (value) = 0;
1228 if (skip_evaluation == 0)
1229 warning ("vector overflow in expression");
1233 /* Print a warning if a large constant is truncated to unsigned,
1234 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1235 Invoke this function on every expression that might be implicitly
1236 converted to an unsigned type. */
1239 unsigned_conversion_warning (tree result, tree operand)
1241 tree type = TREE_TYPE (result);
1243 if (TREE_CODE (operand) == INTEGER_CST
1244 && TREE_CODE (type) == INTEGER_TYPE
1245 && TREE_UNSIGNED (type)
1246 && skip_evaluation == 0
1247 && !int_fits_type_p (operand, type))
1249 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1250 /* This detects cases like converting -129 or 256 to unsigned char. */
1251 warning ("large integer implicitly truncated to unsigned type");
1252 else if (warn_conversion)
1253 warning ("negative integer implicitly converted to unsigned type");
1257 /* Nonzero if constant C has a value that is permissible
1258 for type TYPE (an INTEGER_TYPE). */
1261 constant_fits_type_p (tree c, tree type)
1263 if (TREE_CODE (c) == INTEGER_CST)
1264 return int_fits_type_p (c, type);
1266 c = convert (type, c);
1267 return !TREE_OVERFLOW (c);
1270 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1271 Invoke this function on every expression that is converted implicitly,
1272 i.e. because of language rules and not because of an explicit cast. */
1275 convert_and_check (tree type, tree expr)
1277 tree t = convert (type, expr);
1278 if (TREE_CODE (t) == INTEGER_CST)
1280 if (TREE_OVERFLOW (t))
1282 TREE_OVERFLOW (t) = 0;
1284 /* Do not diagnose overflow in a constant expression merely
1285 because a conversion overflowed. */
1286 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1288 /* No warning for converting 0x80000000 to int. */
1289 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1290 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1291 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1292 /* If EXPR fits in the unsigned version of TYPE,
1293 don't warn unless pedantic. */
1295 || TREE_UNSIGNED (type)
1296 || ! constant_fits_type_p (expr,
1297 c_common_unsigned_type (type)))
1298 && skip_evaluation == 0)
1299 warning ("overflow in implicit constant conversion");
1302 unsigned_conversion_warning (t, expr);
1307 /* A node in a list that describes references to variables (EXPR), which are
1308 either read accesses if WRITER is zero, or write accesses, in which case
1309 WRITER is the parent of EXPR. */
1316 /* Used to implement a cache the results of a call to verify_tree. We only
1317 use this for SAVE_EXPRs. */
1320 struct tlist_cache *next;
1321 struct tlist *cache_before_sp;
1322 struct tlist *cache_after_sp;
1326 /* Obstack to use when allocating tlist structures, and corresponding
1328 static struct obstack tlist_obstack;
1329 static char *tlist_firstobj = 0;
1331 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1333 static struct tlist *warned_ids;
1334 /* SAVE_EXPRs need special treatment. We process them only once and then
1335 cache the results. */
1336 static struct tlist_cache *save_expr_cache;
1338 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1339 static void merge_tlist (struct tlist **, struct tlist *, int);
1340 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1341 static int warning_candidate_p (tree);
1342 static void warn_for_collisions (struct tlist *);
1343 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1344 static struct tlist *new_tlist (struct tlist *, tree, tree);
1345 static void verify_sequence_points (tree);
1347 /* Create a new struct tlist and fill in its fields. */
1348 static struct tlist *
1349 new_tlist (struct tlist *next, tree t, tree writer)
1352 l = obstack_alloc (&tlist_obstack, sizeof *l);
1359 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1360 is nonnull, we ignore any node we find which has a writer equal to it. */
1363 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1367 struct tlist *next = add->next;
1370 if (! exclude_writer || add->writer != exclude_writer)
1371 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1376 /* Merge the nodes of ADD into TO. This merging process is done so that for
1377 each variable that already exists in TO, no new node is added; however if
1378 there is a write access recorded in ADD, and an occurrence on TO is only
1379 a read access, then the occurrence in TO will be modified to record the
1383 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1385 struct tlist **end = to;
1388 end = &(*end)->next;
1394 struct tlist *next = add->next;
1396 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1397 if (tmp2->expr == add->expr)
1401 tmp2->writer = add->writer;
1405 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1406 end = &(*end)->next;
1413 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1414 references in list LIST conflict with it, excluding reads if ONLY writers
1418 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1423 /* Avoid duplicate warnings. */
1424 for (tmp = warned_ids; tmp; tmp = tmp->next)
1425 if (tmp->expr == written)
1430 if (list->expr == written
1431 && list->writer != writer
1432 && (! only_writes || list->writer))
1434 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1435 warning ("operation on `%s' may be undefined",
1436 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1442 /* Given a list LIST of references to variables, find whether any of these
1443 can cause conflicts due to missing sequence points. */
1446 warn_for_collisions (struct tlist *list)
1450 for (tmp = list; tmp; tmp = tmp->next)
1453 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1457 /* Return nonzero if X is a tree that can be verified by the sequence point
1460 warning_candidate_p (tree x)
1462 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1465 /* Walk the tree X, and record accesses to variables. If X is written by the
1466 parent tree, WRITER is the parent.
1467 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1468 expression or its only operand forces a sequence point, then everything up
1469 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1471 Once we return, we will have emitted warnings if any subexpression before
1472 such a sequence point could be undefined. On a higher level, however, the
1473 sequence point may not be relevant, and we'll merge the two lists.
1475 Example: (b++, a) + b;
1476 The call that processes the COMPOUND_EXPR will store the increment of B
1477 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1478 processes the PLUS_EXPR will need to merge the two lists so that
1479 eventually, all accesses end up on the same list (and we'll warn about the
1480 unordered subexpressions b++ and b.
1482 A note on merging. If we modify the former example so that our expression
1485 care must be taken not simply to add all three expressions into the final
1486 PNO_SP list. The function merge_tlist takes care of that by merging the
1487 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1488 way, so that no more than one access to B is recorded. */
1491 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1494 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1495 enum tree_code code;
1498 /* X may be NULL if it is the operand of an empty statement expression
1504 code = TREE_CODE (x);
1505 class = TREE_CODE_CLASS (code);
1507 if (warning_candidate_p (x))
1509 *pno_sp = new_tlist (*pno_sp, x, writer);
1519 case TRUTH_ANDIF_EXPR:
1520 case TRUTH_ORIF_EXPR:
1521 tmp_before = tmp_nosp = tmp_list3 = 0;
1522 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1523 warn_for_collisions (tmp_nosp);
1524 merge_tlist (pbefore_sp, tmp_before, 0);
1525 merge_tlist (pbefore_sp, tmp_nosp, 0);
1526 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1527 merge_tlist (pbefore_sp, tmp_list3, 0);
1531 tmp_before = tmp_list2 = 0;
1532 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1533 warn_for_collisions (tmp_list2);
1534 merge_tlist (pbefore_sp, tmp_before, 0);
1535 merge_tlist (pbefore_sp, tmp_list2, 1);
1537 tmp_list3 = tmp_nosp = 0;
1538 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1539 warn_for_collisions (tmp_nosp);
1540 merge_tlist (pbefore_sp, tmp_list3, 0);
1542 tmp_list3 = tmp_list2 = 0;
1543 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1544 warn_for_collisions (tmp_list2);
1545 merge_tlist (pbefore_sp, tmp_list3, 0);
1546 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1547 two first, to avoid warning for (a ? b++ : b++). */
1548 merge_tlist (&tmp_nosp, tmp_list2, 0);
1549 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1552 case PREDECREMENT_EXPR:
1553 case PREINCREMENT_EXPR:
1554 case POSTDECREMENT_EXPR:
1555 case POSTINCREMENT_EXPR:
1556 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1560 tmp_before = tmp_nosp = tmp_list3 = 0;
1561 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1562 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1563 /* Expressions inside the LHS are not ordered wrt. the sequence points
1564 in the RHS. Example:
1566 Despite the fact that the modification of "a" is in the before_sp
1567 list (tmp_before), it conflicts with the use of "a" in the LHS.
1568 We can handle this by adding the contents of tmp_list3
1569 to those of tmp_before, and redoing the collision warnings for that
1571 add_tlist (&tmp_before, tmp_list3, x, 1);
1572 warn_for_collisions (tmp_before);
1573 /* Exclude the LHS itself here; we first have to merge it into the
1574 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1575 didn't exclude the LHS, we'd get it twice, once as a read and once
1577 add_tlist (pno_sp, tmp_list3, x, 0);
1578 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1580 merge_tlist (pbefore_sp, tmp_before, 0);
1581 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1582 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1583 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1587 /* We need to warn about conflicts among arguments and conflicts between
1588 args and the function address. Side effects of the function address,
1589 however, are not ordered by the sequence point of the call. */
1590 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1591 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1592 if (TREE_OPERAND (x, 1))
1593 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1594 merge_tlist (&tmp_list3, tmp_list2, 0);
1595 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1596 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1597 warn_for_collisions (tmp_before);
1598 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1602 /* Scan all the list, e.g. indices of multi dimensional array. */
1605 tmp_before = tmp_nosp = 0;
1606 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1607 merge_tlist (&tmp_nosp, tmp_before, 0);
1608 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1615 struct tlist_cache *t;
1616 for (t = save_expr_cache; t; t = t->next)
1622 t = obstack_alloc (&tlist_obstack, sizeof *t);
1623 t->next = save_expr_cache;
1625 save_expr_cache = t;
1627 tmp_before = tmp_nosp = 0;
1628 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1629 warn_for_collisions (tmp_nosp);
1634 struct tlist *t = tmp_nosp;
1636 merge_tlist (&tmp_list3, t, 0);
1638 t->cache_before_sp = tmp_before;
1639 t->cache_after_sp = tmp_list3;
1641 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1642 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1651 if (first_rtl_op (code) == 0)
1653 x = TREE_OPERAND (x, 0);
1669 int max = first_rtl_op (TREE_CODE (x));
1670 for (lp = 0; lp < max; lp++)
1672 tmp_before = tmp_nosp = 0;
1673 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1674 merge_tlist (&tmp_nosp, tmp_before, 0);
1675 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1682 /* Try to warn for undefined behavior in EXPR due to missing sequence
1686 verify_sequence_points (tree expr)
1688 struct tlist *before_sp = 0, *after_sp = 0;
1691 save_expr_cache = 0;
1692 if (tlist_firstobj == 0)
1694 gcc_obstack_init (&tlist_obstack);
1695 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1698 verify_tree (expr, &before_sp, &after_sp, 0);
1699 warn_for_collisions (after_sp);
1700 obstack_free (&tlist_obstack, tlist_firstobj);
1704 c_expand_expr_stmt (tree expr)
1706 /* Do default conversion if safe and possibly important,
1707 in case within ({...}). */
1708 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1709 && (flag_isoc99 || lvalue_p (expr)))
1710 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1711 expr = default_conversion (expr);
1713 if (warn_sequence_point)
1714 verify_sequence_points (expr);
1716 if (TREE_TYPE (expr) != error_mark_node
1717 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1718 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1719 error ("expression statement has incomplete type");
1721 last_expr_type = TREE_TYPE (expr);
1722 return add_stmt (build_stmt (EXPR_STMT, expr));
1725 /* Validate the expression after `case' and apply default promotions. */
1728 check_case_value (tree value)
1730 if (value == NULL_TREE)
1733 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1734 STRIP_TYPE_NOPS (value);
1735 /* In C++, the following is allowed:
1738 switch (...) { case i: ... }
1740 So, we try to reduce the VALUE to a constant that way. */
1741 if (c_dialect_cxx ())
1743 value = decl_constant_value (value);
1744 STRIP_TYPE_NOPS (value);
1745 value = fold (value);
1748 if (TREE_CODE (value) != INTEGER_CST
1749 && value != error_mark_node)
1751 error ("case label does not reduce to an integer constant");
1752 value = error_mark_node;
1755 /* Promote char or short to int. */
1756 value = default_conversion (value);
1758 constant_expression_warning (value);
1763 /* Return an integer type with BITS bits of precision,
1764 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1767 c_common_type_for_size (unsigned int bits, int unsignedp)
1769 if (bits == TYPE_PRECISION (integer_type_node))
1770 return unsignedp ? unsigned_type_node : integer_type_node;
1772 if (bits == TYPE_PRECISION (signed_char_type_node))
1773 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1775 if (bits == TYPE_PRECISION (short_integer_type_node))
1776 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1778 if (bits == TYPE_PRECISION (long_integer_type_node))
1779 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1781 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1782 return (unsignedp ? long_long_unsigned_type_node
1783 : long_long_integer_type_node);
1785 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1786 return (unsignedp ? widest_unsigned_literal_type_node
1787 : widest_integer_literal_type_node);
1789 if (bits <= TYPE_PRECISION (intQI_type_node))
1790 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1792 if (bits <= TYPE_PRECISION (intHI_type_node))
1793 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1795 if (bits <= TYPE_PRECISION (intSI_type_node))
1796 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1798 if (bits <= TYPE_PRECISION (intDI_type_node))
1799 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1804 /* Return a data type that has machine mode MODE.
1805 If the mode is an integer,
1806 then UNSIGNEDP selects between signed and unsigned types. */
1809 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1811 if (mode == TYPE_MODE (integer_type_node))
1812 return unsignedp ? unsigned_type_node : integer_type_node;
1814 if (mode == TYPE_MODE (signed_char_type_node))
1815 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1817 if (mode == TYPE_MODE (short_integer_type_node))
1818 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1820 if (mode == TYPE_MODE (long_integer_type_node))
1821 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1823 if (mode == TYPE_MODE (long_long_integer_type_node))
1824 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1826 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1827 return unsignedp ? widest_unsigned_literal_type_node
1828 : widest_integer_literal_type_node;
1831 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1834 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1837 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1840 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1842 #if HOST_BITS_PER_WIDE_INT >= 64
1843 if (mode == TYPE_MODE (intTI_type_node))
1844 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1847 if (mode == TYPE_MODE (float_type_node))
1848 return float_type_node;
1850 if (mode == TYPE_MODE (double_type_node))
1851 return double_type_node;
1853 if (mode == TYPE_MODE (long_double_type_node))
1854 return long_double_type_node;
1856 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1857 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1859 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1860 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1865 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1867 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1869 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
1871 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
1873 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
1875 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
1877 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
1879 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
1881 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
1883 return V16SF_type_node;
1885 return V4SF_type_node;
1887 return V2SF_type_node;
1889 return V2DF_type_node;
1891 return V4DF_type_node;
1899 /* Return an unsigned type the same as TYPE in other respects. */
1901 c_common_unsigned_type (tree type)
1903 tree type1 = TYPE_MAIN_VARIANT (type);
1904 if (type1 == signed_char_type_node || type1 == char_type_node)
1905 return unsigned_char_type_node;
1906 if (type1 == integer_type_node)
1907 return unsigned_type_node;
1908 if (type1 == short_integer_type_node)
1909 return short_unsigned_type_node;
1910 if (type1 == long_integer_type_node)
1911 return long_unsigned_type_node;
1912 if (type1 == long_long_integer_type_node)
1913 return long_long_unsigned_type_node;
1914 if (type1 == widest_integer_literal_type_node)
1915 return widest_unsigned_literal_type_node;
1916 #if HOST_BITS_PER_WIDE_INT >= 64
1917 if (type1 == intTI_type_node)
1918 return unsigned_intTI_type_node;
1920 if (type1 == intDI_type_node)
1921 return unsigned_intDI_type_node;
1922 if (type1 == intSI_type_node)
1923 return unsigned_intSI_type_node;
1924 if (type1 == intHI_type_node)
1925 return unsigned_intHI_type_node;
1926 if (type1 == intQI_type_node)
1927 return unsigned_intQI_type_node;
1929 return c_common_signed_or_unsigned_type (1, type);
1932 /* Return a signed type the same as TYPE in other respects. */
1935 c_common_signed_type (tree type)
1937 tree type1 = TYPE_MAIN_VARIANT (type);
1938 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1939 return signed_char_type_node;
1940 if (type1 == unsigned_type_node)
1941 return integer_type_node;
1942 if (type1 == short_unsigned_type_node)
1943 return short_integer_type_node;
1944 if (type1 == long_unsigned_type_node)
1945 return long_integer_type_node;
1946 if (type1 == long_long_unsigned_type_node)
1947 return long_long_integer_type_node;
1948 if (type1 == widest_unsigned_literal_type_node)
1949 return widest_integer_literal_type_node;
1950 #if HOST_BITS_PER_WIDE_INT >= 64
1951 if (type1 == unsigned_intTI_type_node)
1952 return intTI_type_node;
1954 if (type1 == unsigned_intDI_type_node)
1955 return intDI_type_node;
1956 if (type1 == unsigned_intSI_type_node)
1957 return intSI_type_node;
1958 if (type1 == unsigned_intHI_type_node)
1959 return intHI_type_node;
1960 if (type1 == unsigned_intQI_type_node)
1961 return intQI_type_node;
1963 return c_common_signed_or_unsigned_type (0, type);
1966 /* Return a type the same as TYPE except unsigned or
1967 signed according to UNSIGNEDP. */
1970 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1974 if (! INTEGRAL_TYPE_P (type)
1975 || TREE_UNSIGNED (type) == unsignedp)
1978 if (TYPE_PRECISION (type) == TYPE_PRECISION (signed_char_type_node))
1979 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1980 if (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1981 return unsignedp ? unsigned_type_node : integer_type_node;
1982 if (TYPE_PRECISION (type) == TYPE_PRECISION (short_integer_type_node))
1983 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1984 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_integer_type_node))
1985 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1986 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_long_integer_type_node))
1987 return (unsignedp ? long_long_unsigned_type_node
1988 : long_long_integer_type_node);
1989 if (TYPE_PRECISION (type) == TYPE_PRECISION (widest_integer_literal_type_node))
1990 return (unsignedp ? widest_unsigned_literal_type_node
1991 : widest_integer_literal_type_node);
1993 #if HOST_BITS_PER_WIDE_INT >= 64
1994 if (TYPE_PRECISION (type) == TYPE_PRECISION (intTI_type_node))
1995 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1997 if (TYPE_PRECISION (type) == TYPE_PRECISION (intDI_type_node))
1998 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1999 if (TYPE_PRECISION (type) == TYPE_PRECISION (intSI_type_node))
2000 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2001 if (TYPE_PRECISION (type) == TYPE_PRECISION (intHI_type_node))
2002 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2003 if (TYPE_PRECISION (type) == TYPE_PRECISION (intQI_type_node))
2004 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2006 new_type = (unsignedp
2007 ? make_unsigned_type (TYPE_PRECISION (type))
2008 : make_signed_type (TYPE_PRECISION (type)));
2009 TYPE_SIZE (new_type) = TYPE_SIZE (type);
2010 TYPE_SIZE_UNIT (new_type) = TYPE_SIZE_UNIT (type);
2011 TYPE_MODE (new_type) = TYPE_MODE (type);
2016 /* Return the minimum number of bits needed to represent VALUE in a
2017 signed or unsigned type, UNSIGNEDP says which. */
2020 min_precision (tree value, int unsignedp)
2024 /* If the value is negative, compute its negative minus 1. The latter
2025 adjustment is because the absolute value of the largest negative value
2026 is one larger than the largest positive value. This is equivalent to
2027 a bit-wise negation, so use that operation instead. */
2029 if (tree_int_cst_sgn (value) < 0)
2030 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2032 /* Return the number of bits needed, taking into account the fact
2033 that we need one more bit for a signed than unsigned type. */
2035 if (integer_zerop (value))
2038 log = tree_floor_log2 (value);
2040 return log + 1 + ! unsignedp;
2043 /* Print an error message for invalid operands to arith operation
2044 CODE. NOP_EXPR is used as a special case (see
2045 c_common_truthvalue_conversion). */
2048 binary_op_error (enum tree_code code)
2055 error ("invalid truth-value expression");
2059 opname = "+"; break;
2061 opname = "-"; break;
2063 opname = "*"; break;
2065 opname = "max"; break;
2067 opname = "min"; break;
2069 opname = "=="; break;
2071 opname = "!="; break;
2073 opname = "<="; break;
2075 opname = ">="; break;
2077 opname = "<"; break;
2079 opname = ">"; break;
2081 opname = "<<"; break;
2083 opname = ">>"; break;
2084 case TRUNC_MOD_EXPR:
2085 case FLOOR_MOD_EXPR:
2086 opname = "%"; break;
2087 case TRUNC_DIV_EXPR:
2088 case FLOOR_DIV_EXPR:
2089 opname = "/"; break;
2091 opname = "&"; break;
2093 opname = "|"; break;
2094 case TRUTH_ANDIF_EXPR:
2095 opname = "&&"; break;
2096 case TRUTH_ORIF_EXPR:
2097 opname = "||"; break;
2099 opname = "^"; break;
2102 opname = "rotate"; break;
2104 opname = "unknown"; break;
2106 error ("invalid operands to binary %s", opname);
2109 /* Subroutine of build_binary_op, used for comparison operations.
2110 See if the operands have both been converted from subword integer types
2111 and, if so, perhaps change them both back to their original type.
2112 This function is also responsible for converting the two operands
2113 to the proper common type for comparison.
2115 The arguments of this function are all pointers to local variables
2116 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2117 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2119 If this function returns nonzero, it means that the comparison has
2120 a constant value. What this function returns is an expression for
2124 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2125 enum tree_code *rescode_ptr)
2128 tree op0 = *op0_ptr;
2129 tree op1 = *op1_ptr;
2130 int unsignedp0, unsignedp1;
2132 tree primop0, primop1;
2133 enum tree_code code = *rescode_ptr;
2135 /* Throw away any conversions to wider types
2136 already present in the operands. */
2138 primop0 = get_narrower (op0, &unsignedp0);
2139 primop1 = get_narrower (op1, &unsignedp1);
2141 /* Handle the case that OP0 does not *contain* a conversion
2142 but it *requires* conversion to FINAL_TYPE. */
2144 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2145 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2146 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2147 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2149 /* If one of the operands must be floated, we cannot optimize. */
2150 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2151 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2153 /* If first arg is constant, swap the args (changing operation
2154 so value is preserved), for canonicalization. Don't do this if
2155 the second arg is 0. */
2157 if (TREE_CONSTANT (primop0)
2158 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2161 int temi = unsignedp0;
2169 unsignedp0 = unsignedp1;
2192 *rescode_ptr = code;
2195 /* If comparing an integer against a constant more bits wide,
2196 maybe we can deduce a value of 1 or 0 independent of the data.
2197 Or else truncate the constant now
2198 rather than extend the variable at run time.
2200 This is only interesting if the constant is the wider arg.
2201 Also, it is not safe if the constant is unsigned and the
2202 variable arg is signed, since in this case the variable
2203 would be sign-extended and then regarded as unsigned.
2204 Our technique fails in this case because the lowest/highest
2205 possible unsigned results don't follow naturally from the
2206 lowest/highest possible values of the variable operand.
2207 For just EQ_EXPR and NE_EXPR there is another technique that
2208 could be used: see if the constant can be faithfully represented
2209 in the other operand's type, by truncating it and reextending it
2210 and see if that preserves the constant's value. */
2212 if (!real1 && !real2
2213 && TREE_CODE (primop1) == INTEGER_CST
2214 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2216 int min_gt, max_gt, min_lt, max_lt;
2217 tree maxval, minval;
2218 /* 1 if comparison is nominally unsigned. */
2219 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2222 type = c_common_signed_or_unsigned_type (unsignedp0,
2223 TREE_TYPE (primop0));
2225 /* In C, if TYPE is an enumeration, then we need to get its
2226 min/max values from it's underlying integral type, not the
2227 enumerated type itself. In C++, TYPE_MAX_VALUE and
2228 TYPE_MIN_VALUE have already been set correctly on the
2229 enumeration type. */
2230 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
2231 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2233 maxval = TYPE_MAX_VALUE (type);
2234 minval = TYPE_MIN_VALUE (type);
2236 if (unsignedp && !unsignedp0)
2237 *restype_ptr = c_common_signed_type (*restype_ptr);
2239 if (TREE_TYPE (primop1) != *restype_ptr)
2240 primop1 = convert (*restype_ptr, primop1);
2241 if (type != *restype_ptr)
2243 minval = convert (*restype_ptr, minval);
2244 maxval = convert (*restype_ptr, maxval);
2247 if (unsignedp && unsignedp0)
2249 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2250 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2251 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2252 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2256 min_gt = INT_CST_LT (primop1, minval);
2257 max_gt = INT_CST_LT (primop1, maxval);
2258 min_lt = INT_CST_LT (minval, primop1);
2259 max_lt = INT_CST_LT (maxval, primop1);
2263 /* This used to be a switch, but Genix compiler can't handle that. */
2264 if (code == NE_EXPR)
2266 if (max_lt || min_gt)
2267 val = truthvalue_true_node;
2269 else if (code == EQ_EXPR)
2271 if (max_lt || min_gt)
2272 val = truthvalue_false_node;
2274 else if (code == LT_EXPR)
2277 val = truthvalue_true_node;
2279 val = truthvalue_false_node;
2281 else if (code == GT_EXPR)
2284 val = truthvalue_true_node;
2286 val = truthvalue_false_node;
2288 else if (code == LE_EXPR)
2291 val = truthvalue_true_node;
2293 val = truthvalue_false_node;
2295 else if (code == GE_EXPR)
2298 val = truthvalue_true_node;
2300 val = truthvalue_false_node;
2303 /* If primop0 was sign-extended and unsigned comparison specd,
2304 we did a signed comparison above using the signed type bounds.
2305 But the comparison we output must be unsigned.
2307 Also, for inequalities, VAL is no good; but if the signed
2308 comparison had *any* fixed result, it follows that the
2309 unsigned comparison just tests the sign in reverse
2310 (positive values are LE, negative ones GE).
2311 So we can generate an unsigned comparison
2312 against an extreme value of the signed type. */
2314 if (unsignedp && !unsignedp0)
2321 primop1 = TYPE_MIN_VALUE (type);
2327 primop1 = TYPE_MAX_VALUE (type);
2334 type = c_common_unsigned_type (type);
2337 if (TREE_CODE (primop0) != INTEGER_CST)
2339 if (val == truthvalue_false_node)
2340 warning ("comparison is always false due to limited range of data type");
2341 if (val == truthvalue_true_node)
2342 warning ("comparison is always true due to limited range of data type");
2347 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2348 if (TREE_SIDE_EFFECTS (primop0))
2349 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2353 /* Value is not predetermined, but do the comparison
2354 in the type of the operand that is not constant.
2355 TYPE is already properly set. */
2357 else if (real1 && real2
2358 && (TYPE_PRECISION (TREE_TYPE (primop0))
2359 == TYPE_PRECISION (TREE_TYPE (primop1))))
2360 type = TREE_TYPE (primop0);
2362 /* If args' natural types are both narrower than nominal type
2363 and both extend in the same manner, compare them
2364 in the type of the wider arg.
2365 Otherwise must actually extend both to the nominal
2366 common type lest different ways of extending
2368 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2370 else if (unsignedp0 == unsignedp1 && real1 == real2
2371 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2372 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2374 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2375 type = c_common_signed_or_unsigned_type (unsignedp0
2376 || TREE_UNSIGNED (*restype_ptr),
2378 /* Make sure shorter operand is extended the right way
2379 to match the longer operand. */
2381 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2382 TREE_TYPE (primop0)),
2385 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2386 TREE_TYPE (primop1)),
2391 /* Here we must do the comparison on the nominal type
2392 using the args exactly as we received them. */
2393 type = *restype_ptr;
2397 if (!real1 && !real2 && integer_zerop (primop1)
2398 && TREE_UNSIGNED (*restype_ptr))
2404 /* All unsigned values are >= 0, so we warn if extra warnings
2405 are requested. However, if OP0 is a constant that is
2406 >= 0, the signedness of the comparison isn't an issue,
2407 so suppress the warning. */
2408 if (extra_warnings && !in_system_header
2409 && ! (TREE_CODE (primop0) == INTEGER_CST
2410 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2412 warning ("comparison of unsigned expression >= 0 is always true");
2413 value = truthvalue_true_node;
2417 if (extra_warnings && !in_system_header
2418 && ! (TREE_CODE (primop0) == INTEGER_CST
2419 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2421 warning ("comparison of unsigned expression < 0 is always false");
2422 value = truthvalue_false_node;
2431 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2432 if (TREE_SIDE_EFFECTS (primop0))
2433 return build (COMPOUND_EXPR, TREE_TYPE (value),
2440 *op0_ptr = convert (type, primop0);
2441 *op1_ptr = convert (type, primop1);
2443 *restype_ptr = truthvalue_type_node;
2448 /* Return a tree for the sum or difference (RESULTCODE says which)
2449 of pointer PTROP and integer INTOP. */
2452 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2459 /* The result is a pointer of the same type that is being added. */
2461 tree result_type = TREE_TYPE (ptrop);
2463 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2465 if (pedantic || warn_pointer_arith)
2466 pedwarn ("pointer of type `void *' used in arithmetic");
2467 size_exp = integer_one_node;
2469 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2471 if (pedantic || warn_pointer_arith)
2472 pedwarn ("pointer to a function used in arithmetic");
2473 size_exp = integer_one_node;
2475 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2477 if (pedantic || warn_pointer_arith)
2478 pedwarn ("pointer to member function used in arithmetic");
2479 size_exp = integer_one_node;
2481 else if (TREE_CODE (TREE_TYPE (result_type)) == OFFSET_TYPE)
2483 if (pedantic || warn_pointer_arith)
2484 pedwarn ("pointer to a member used in arithmetic");
2485 size_exp = integer_one_node;
2488 size_exp = size_in_bytes (TREE_TYPE (result_type));
2490 /* If what we are about to multiply by the size of the elements
2491 contains a constant term, apply distributive law
2492 and multiply that constant term separately.
2493 This helps produce common subexpressions. */
2495 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2496 && ! TREE_CONSTANT (intop)
2497 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2498 && TREE_CONSTANT (size_exp)
2499 /* If the constant comes from pointer subtraction,
2500 skip this optimization--it would cause an error. */
2501 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2502 /* If the constant is unsigned, and smaller than the pointer size,
2503 then we must skip this optimization. This is because it could cause
2504 an overflow error if the constant is negative but INTOP is not. */
2505 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2506 || (TYPE_PRECISION (TREE_TYPE (intop))
2507 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2509 enum tree_code subcode = resultcode;
2510 tree int_type = TREE_TYPE (intop);
2511 if (TREE_CODE (intop) == MINUS_EXPR)
2512 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2513 /* Convert both subexpression types to the type of intop,
2514 because weird cases involving pointer arithmetic
2515 can result in a sum or difference with different type args. */
2516 ptrop = build_binary_op (subcode, ptrop,
2517 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2518 intop = convert (int_type, TREE_OPERAND (intop, 0));
2521 /* Convert the integer argument to a type the same size as sizetype
2522 so the multiply won't overflow spuriously. */
2524 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2525 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2526 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2527 TREE_UNSIGNED (sizetype)), intop);
2529 /* Replace the integer argument with a suitable product by the object size.
2530 Do this multiplication as signed, then convert to the appropriate
2531 pointer type (actually unsigned integral). */
2533 intop = convert (result_type,
2534 build_binary_op (MULT_EXPR, intop,
2535 convert (TREE_TYPE (intop), size_exp), 1));
2537 /* Create the sum or difference. */
2539 result = build (resultcode, result_type, ptrop, intop);
2541 folded = fold (result);
2542 if (folded == result)
2543 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2547 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2548 or validate its data type for an `if' or `while' statement or ?..: exp.
2550 This preparation consists of taking the ordinary
2551 representation of an expression expr and producing a valid tree
2552 boolean expression describing whether expr is nonzero. We could
2553 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2554 but we optimize comparisons, &&, ||, and !.
2556 The resulting type should always be `truthvalue_type_node'. */
2559 c_common_truthvalue_conversion (tree expr)
2561 if (TREE_CODE (expr) == ERROR_MARK)
2564 #if 0 /* This appears to be wrong for C++. */
2565 /* These really should return error_mark_node after 2.4 is stable.
2566 But not all callers handle ERROR_MARK properly. */
2567 switch (TREE_CODE (TREE_TYPE (expr)))
2570 error ("struct type value used where scalar is required");
2571 return truthvalue_false_node;
2574 error ("union type value used where scalar is required");
2575 return truthvalue_false_node;
2578 error ("array type value used where scalar is required");
2579 return truthvalue_false_node;
2586 switch (TREE_CODE (expr))
2589 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2590 case TRUTH_ANDIF_EXPR:
2591 case TRUTH_ORIF_EXPR:
2592 case TRUTH_AND_EXPR:
2594 case TRUTH_XOR_EXPR:
2595 case TRUTH_NOT_EXPR:
2596 TREE_TYPE (expr) = truthvalue_type_node;
2603 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2606 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2609 /* If we are taking the address of an external decl, it might be zero
2610 if it is weak, so we cannot optimize. */
2611 if (DECL_P (TREE_OPERAND (expr, 0))
2612 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2615 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2616 return build (COMPOUND_EXPR, truthvalue_type_node,
2617 TREE_OPERAND (expr, 0), truthvalue_true_node);
2619 return truthvalue_true_node;
2622 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2623 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2624 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2625 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2633 /* These don't change whether an object is nonzero or zero. */
2634 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2638 /* These don't change whether an object is zero or nonzero, but
2639 we can't ignore them if their second arg has side-effects. */
2640 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2641 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2642 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2644 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2647 /* Distribute the conversion into the arms of a COND_EXPR. */
2648 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2649 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2650 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2653 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2654 since that affects how `default_conversion' will behave. */
2655 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2656 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2658 /* Fall through.... */
2660 /* If this is widening the argument, we can ignore it. */
2661 if (TYPE_PRECISION (TREE_TYPE (expr))
2662 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2663 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2667 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2668 aren't guaranteed to the be same for modes that can represent
2669 infinity, since if x and y are both +infinity, or both
2670 -infinity, then x - y is not a number.
2672 Note that this transformation is safe when x or y is NaN.
2673 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2675 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2677 /* Fall through.... */
2679 /* This and MINUS_EXPR can be changed into a comparison of the
2681 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2682 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2683 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2684 TREE_OPERAND (expr, 1), 1);
2685 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2686 fold (build1 (NOP_EXPR,
2687 TREE_TYPE (TREE_OPERAND (expr, 0)),
2688 TREE_OPERAND (expr, 1))), 1);
2691 if (integer_onep (TREE_OPERAND (expr, 1))
2692 && TREE_TYPE (expr) != truthvalue_type_node)
2693 /* Using convert here would cause infinite recursion. */
2694 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2698 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2699 warning ("suggest parentheses around assignment used as truth value");
2706 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2708 tree t = save_expr (expr);
2709 return (build_binary_op
2710 ((TREE_SIDE_EFFECTS (expr)
2711 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2712 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2713 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2717 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2720 static tree builtin_function_2 (const char *, const char *, tree, tree,
2721 int, enum built_in_class, int, int,
2724 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2725 down to the element type of an array. */
2728 c_build_qualified_type (tree type, int type_quals)
2730 /* A restrict-qualified pointer type must be a pointer to object or
2731 incomplete type. Note that the use of POINTER_TYPE_P also allows
2732 REFERENCE_TYPEs, which is appropriate for C++. Unfortunately,
2733 the C++ front-end also use POINTER_TYPE for pointer-to-member
2734 values, so even though it should be illegal to use `restrict'
2735 with such an entity we don't flag that here. Thus, special case
2736 code for that case is required in the C++ front-end. */
2737 if ((type_quals & TYPE_QUAL_RESTRICT)
2738 && (!POINTER_TYPE_P (type)
2739 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2741 error ("invalid use of `restrict'");
2742 type_quals &= ~TYPE_QUAL_RESTRICT;
2745 if (TREE_CODE (type) == ARRAY_TYPE)
2746 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2748 TYPE_DOMAIN (type));
2749 return build_qualified_type (type, type_quals);
2752 /* Apply the TYPE_QUALS to the new DECL. */
2755 c_apply_type_quals_to_decl (int type_quals, tree decl)
2757 if ((type_quals & TYPE_QUAL_CONST)
2758 || (TREE_TYPE (decl)
2759 && TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE))
2760 TREE_READONLY (decl) = 1;
2761 if (type_quals & TYPE_QUAL_VOLATILE)
2763 TREE_SIDE_EFFECTS (decl) = 1;
2764 TREE_THIS_VOLATILE (decl) = 1;
2766 if (type_quals & TYPE_QUAL_RESTRICT)
2768 if (!TREE_TYPE (decl)
2769 || !POINTER_TYPE_P (TREE_TYPE (decl))
2770 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (TREE_TYPE (decl))))
2771 error ("invalid use of `restrict'");
2772 else if (flag_strict_aliasing)
2773 /* Indicate we need to make a unique alias set for this pointer.
2774 We can't do it here because it might be pointing to an
2776 DECL_POINTER_ALIAS_SET (decl) = -2;
2780 /* Return the typed-based alias set for T, which may be an expression
2781 or a type. Return -1 if we don't do anything special. */
2784 c_common_get_alias_set (tree t)
2788 /* Permit type-punning when accessing a union, provided the access
2789 is directly through the union. For example, this code does not
2790 permit taking the address of a union member and then storing
2791 through it. Even the type-punning allowed here is a GCC
2792 extension, albeit a common and useful one; the C standard says
2793 that such accesses have implementation-defined behavior. */
2795 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2796 u = TREE_OPERAND (u, 0))
2797 if (TREE_CODE (u) == COMPONENT_REF
2798 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2801 /* That's all the expressions we handle specially. */
2805 /* The C standard guarantees that any object may be accessed via an
2806 lvalue that has character type. */
2807 if (t == char_type_node
2808 || t == signed_char_type_node
2809 || t == unsigned_char_type_node)
2812 /* If it has the may_alias attribute, it can alias anything. */
2813 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2816 /* The C standard specifically allows aliasing between signed and
2817 unsigned variants of the same type. We treat the signed
2818 variant as canonical. */
2819 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2821 tree t1 = c_common_signed_type (t);
2823 /* t1 == t can happen for boolean nodes which are always unsigned. */
2825 return get_alias_set (t1);
2827 else if (POINTER_TYPE_P (t))
2831 /* Unfortunately, there is no canonical form of a pointer type.
2832 In particular, if we have `typedef int I', then `int *', and
2833 `I *' are different types. So, we have to pick a canonical
2834 representative. We do this below.
2836 Technically, this approach is actually more conservative that
2837 it needs to be. In particular, `const int *' and `int *'
2838 should be in different alias sets, according to the C and C++
2839 standard, since their types are not the same, and so,
2840 technically, an `int **' and `const int **' cannot point at
2843 But, the standard is wrong. In particular, this code is
2848 const int* const* cipp = &ipp;
2850 And, it doesn't make sense for that to be legal unless you
2851 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2852 the pointed-to types. This issue has been reported to the
2854 t1 = build_type_no_quals (t);
2856 return get_alias_set (t1);
2862 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2863 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2864 flag controls whether we should diagnose possibly ill-formed
2865 constructs or not. */
2867 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2869 const char *op_name;
2871 enum tree_code type_code = TREE_CODE (type);
2873 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2874 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2876 if (type_code == FUNCTION_TYPE)
2878 if (op == SIZEOF_EXPR)
2880 if (complain && (pedantic || warn_pointer_arith))
2881 pedwarn ("invalid application of `sizeof' to a function type");
2882 value = size_one_node;
2885 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2887 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2889 if (type_code == VOID_TYPE
2890 && complain && (pedantic || warn_pointer_arith))
2891 pedwarn ("invalid application of `%s' to a void type", op_name);
2892 value = size_one_node;
2894 else if (!COMPLETE_TYPE_P (type))
2897 error ("invalid application of `%s' to an incomplete type", op_name);
2898 value = size_zero_node;
2902 if (op == SIZEOF_EXPR)
2903 /* Convert in case a char is more than one unit. */
2904 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2905 size_int (TYPE_PRECISION (char_type_node)
2908 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2911 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2912 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2913 never happen. However, this node should really have type
2914 `size_t', which is just a typedef for an ordinary integer type. */
2915 value = fold (build1 (NOP_EXPR, size_type_node, value));
2916 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2921 /* Implement the __alignof keyword: Return the minimum required
2922 alignment of EXPR, measured in bytes. For VAR_DECL's and
2923 FIELD_DECL's return DECL_ALIGN (which can be set from an
2924 "aligned" __attribute__ specification). */
2927 c_alignof_expr (tree expr)
2931 if (TREE_CODE (expr) == VAR_DECL)
2932 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2934 else if (TREE_CODE (expr) == COMPONENT_REF
2935 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2937 error ("`__alignof' applied to a bit-field");
2940 else if (TREE_CODE (expr) == COMPONENT_REF
2941 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2942 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
2944 else if (TREE_CODE (expr) == INDIRECT_REF)
2946 tree t = TREE_OPERAND (expr, 0);
2948 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2950 while (TREE_CODE (t) == NOP_EXPR
2951 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2955 t = TREE_OPERAND (t, 0);
2956 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2957 if (thisalign > bestalign)
2958 best = t, bestalign = thisalign;
2960 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2963 return c_alignof (TREE_TYPE (expr));
2965 return fold (build1 (NOP_EXPR, size_type_node, t));
2968 /* Handle C and C++ default attributes. */
2970 enum built_in_attribute
2972 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2973 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2974 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2975 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2976 #include "builtin-attrs.def"
2977 #undef DEF_ATTR_NULL_TREE
2979 #undef DEF_ATTR_IDENT
2980 #undef DEF_ATTR_TREE_LIST
2984 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
2986 static void c_init_attributes (void);
2988 /* Build tree nodes and builtin functions common to both C and C++ language
2992 c_common_nodes_and_builtins (void)
2996 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2997 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2998 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2999 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3000 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3001 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3002 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3003 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3004 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3005 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3006 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3007 #include "builtin-types.def"
3008 #undef DEF_PRIMITIVE_TYPE
3009 #undef DEF_FUNCTION_TYPE_0
3010 #undef DEF_FUNCTION_TYPE_1
3011 #undef DEF_FUNCTION_TYPE_2
3012 #undef DEF_FUNCTION_TYPE_3
3013 #undef DEF_FUNCTION_TYPE_4
3014 #undef DEF_FUNCTION_TYPE_VAR_0
3015 #undef DEF_FUNCTION_TYPE_VAR_1
3016 #undef DEF_FUNCTION_TYPE_VAR_2
3017 #undef DEF_FUNCTION_TYPE_VAR_3
3018 #undef DEF_POINTER_TYPE
3022 typedef enum builtin_type builtin_type;
3024 tree builtin_types[(int) BT_LAST];
3025 int wchar_type_size;
3026 tree array_domain_type;
3027 tree va_list_ref_type_node;
3028 tree va_list_arg_type_node;
3030 /* Define `int' and `char' first so that dbx will output them first. */
3031 record_builtin_type (RID_INT, NULL, integer_type_node);
3032 record_builtin_type (RID_CHAR, "char", char_type_node);
3034 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3035 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3036 but not C. Are the conditionals here needed? */
3037 if (c_dialect_cxx ())
3038 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3039 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3040 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3041 record_builtin_type (RID_MAX, "long unsigned int",
3042 long_unsigned_type_node);
3043 if (c_dialect_cxx ())
3044 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3045 record_builtin_type (RID_MAX, "long long int",
3046 long_long_integer_type_node);
3047 record_builtin_type (RID_MAX, "long long unsigned int",
3048 long_long_unsigned_type_node);
3049 if (c_dialect_cxx ())
3050 record_builtin_type (RID_MAX, "long long unsigned",
3051 long_long_unsigned_type_node);
3052 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3053 record_builtin_type (RID_MAX, "short unsigned int",
3054 short_unsigned_type_node);
3055 if (c_dialect_cxx ())
3056 record_builtin_type (RID_MAX, "unsigned short",
3057 short_unsigned_type_node);
3059 /* Define both `signed char' and `unsigned char'. */
3060 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3061 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3063 /* These are types that c_common_type_for_size and
3064 c_common_type_for_mode use. */
3065 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3067 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3069 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3071 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3073 #if HOST_BITS_PER_WIDE_INT >= 64
3074 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3075 get_identifier ("__int128_t"),
3078 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3079 unsigned_intQI_type_node));
3080 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3081 unsigned_intHI_type_node));
3082 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3083 unsigned_intSI_type_node));
3084 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3085 unsigned_intDI_type_node));
3086 #if HOST_BITS_PER_WIDE_INT >= 64
3087 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3088 get_identifier ("__uint128_t"),
3089 unsigned_intTI_type_node));
3092 /* Create the widest literal types. */
3093 widest_integer_literal_type_node
3094 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3095 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3096 widest_integer_literal_type_node));
3098 widest_unsigned_literal_type_node
3099 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3100 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3101 widest_unsigned_literal_type_node));
3103 /* `unsigned long' is the standard type for sizeof.
3104 Note that stddef.h uses `unsigned long',
3105 and this must agree, even if long and int are the same size. */
3107 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3108 signed_size_type_node = c_common_signed_type (size_type_node);
3109 set_sizetype (size_type_node);
3111 build_common_tree_nodes_2 (flag_short_double);
3113 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3114 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3115 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3117 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3118 get_identifier ("complex int"),
3119 complex_integer_type_node));
3120 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3121 get_identifier ("complex float"),
3122 complex_float_type_node));
3123 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3124 get_identifier ("complex double"),
3125 complex_double_type_node));
3126 (*lang_hooks.decls.pushdecl)
3127 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3128 complex_long_double_type_node));
3130 /* Types which are common to the fortran compiler and libf2c. When
3131 changing these, you also need to be concerned with f/com.h. */
3133 if (TYPE_PRECISION (float_type_node)
3134 == TYPE_PRECISION (long_integer_type_node))
3136 g77_integer_type_node = long_integer_type_node;
3137 g77_uinteger_type_node = long_unsigned_type_node;
3139 else if (TYPE_PRECISION (float_type_node)
3140 == TYPE_PRECISION (integer_type_node))
3142 g77_integer_type_node = integer_type_node;
3143 g77_uinteger_type_node = unsigned_type_node;
3146 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3148 if (g77_integer_type_node != NULL_TREE)
3150 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3151 get_identifier ("__g77_integer"),
3152 g77_integer_type_node));
3153 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3154 get_identifier ("__g77_uinteger"),
3155 g77_uinteger_type_node));
3158 if (TYPE_PRECISION (float_type_node) * 2
3159 == TYPE_PRECISION (long_integer_type_node))
3161 g77_longint_type_node = long_integer_type_node;
3162 g77_ulongint_type_node = long_unsigned_type_node;
3164 else if (TYPE_PRECISION (float_type_node) * 2
3165 == TYPE_PRECISION (long_long_integer_type_node))
3167 g77_longint_type_node = long_long_integer_type_node;
3168 g77_ulongint_type_node = long_long_unsigned_type_node;
3171 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3173 if (g77_longint_type_node != NULL_TREE)
3175 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3176 get_identifier ("__g77_longint"),
3177 g77_longint_type_node));
3178 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3179 get_identifier ("__g77_ulongint"),
3180 g77_ulongint_type_node));
3183 record_builtin_type (RID_VOID, NULL, void_type_node);
3185 void_zero_node = build_int_2 (0, 0);
3186 TREE_TYPE (void_zero_node) = void_type_node;
3188 void_list_node = build_void_list_node ();
3190 /* Make a type to be the domain of a few array types
3191 whose domains don't really matter.
3192 200 is small enough that it always fits in size_t
3193 and large enough that it can hold most function names for the
3194 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3195 array_domain_type = build_index_type (size_int (200));
3197 /* Make a type for arrays of characters.
3198 With luck nothing will ever really depend on the length of this
3200 char_array_type_node
3201 = build_array_type (char_type_node, array_domain_type);
3203 /* Likewise for arrays of ints. */
3205 = build_array_type (integer_type_node, array_domain_type);
3207 string_type_node = build_pointer_type (char_type_node);
3208 const_string_type_node
3209 = build_pointer_type (build_qualified_type
3210 (char_type_node, TYPE_QUAL_CONST));
3212 /* This is special for C++ so functions can be overloaded. */
3213 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3214 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3215 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3216 if (c_dialect_cxx ())
3218 if (TREE_UNSIGNED (wchar_type_node))
3219 wchar_type_node = make_unsigned_type (wchar_type_size);
3221 wchar_type_node = make_signed_type (wchar_type_size);
3222 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3226 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3227 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3230 /* This is for wide string constants. */
3231 wchar_array_type_node
3232 = build_array_type (wchar_type_node, array_domain_type);
3235 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3238 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3240 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3242 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3244 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3245 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3247 (*lang_hooks.decls.pushdecl)
3248 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3249 va_list_type_node));
3251 (*lang_hooks.decls.pushdecl)
3252 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3253 ptrdiff_type_node));
3255 (*lang_hooks.decls.pushdecl)
3256 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3259 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3261 va_list_arg_type_node = va_list_ref_type_node =
3262 build_pointer_type (TREE_TYPE (va_list_type_node));
3266 va_list_arg_type_node = va_list_type_node;
3267 va_list_ref_type_node = build_reference_type (va_list_type_node);
3270 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3271 builtin_types[(int) ENUM] = VALUE;
3272 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3273 builtin_types[(int) ENUM] \
3274 = build_function_type (builtin_types[(int) RETURN], \
3276 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3277 builtin_types[(int) ENUM] \
3278 = build_function_type (builtin_types[(int) RETURN], \
3279 tree_cons (NULL_TREE, \
3280 builtin_types[(int) ARG1], \
3282 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3283 builtin_types[(int) ENUM] \
3284 = build_function_type \
3285 (builtin_types[(int) RETURN], \
3286 tree_cons (NULL_TREE, \
3287 builtin_types[(int) ARG1], \
3288 tree_cons (NULL_TREE, \
3289 builtin_types[(int) ARG2], \
3291 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3292 builtin_types[(int) ENUM] \
3293 = build_function_type \
3294 (builtin_types[(int) RETURN], \
3295 tree_cons (NULL_TREE, \
3296 builtin_types[(int) ARG1], \
3297 tree_cons (NULL_TREE, \
3298 builtin_types[(int) ARG2], \
3299 tree_cons (NULL_TREE, \
3300 builtin_types[(int) ARG3], \
3302 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3303 builtin_types[(int) ENUM] \
3304 = build_function_type \
3305 (builtin_types[(int) RETURN], \
3306 tree_cons (NULL_TREE, \
3307 builtin_types[(int) ARG1], \
3308 tree_cons (NULL_TREE, \
3309 builtin_types[(int) ARG2], \
3312 builtin_types[(int) ARG3], \
3313 tree_cons (NULL_TREE, \
3314 builtin_types[(int) ARG4], \
3315 void_list_node)))));
3316 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3317 builtin_types[(int) ENUM] \
3318 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3319 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3320 builtin_types[(int) ENUM] \
3321 = build_function_type (builtin_types[(int) RETURN], \
3322 tree_cons (NULL_TREE, \
3323 builtin_types[(int) ARG1], \
3326 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3327 builtin_types[(int) ENUM] \
3328 = build_function_type \
3329 (builtin_types[(int) RETURN], \
3330 tree_cons (NULL_TREE, \
3331 builtin_types[(int) ARG1], \
3332 tree_cons (NULL_TREE, \
3333 builtin_types[(int) ARG2], \
3336 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3337 builtin_types[(int) ENUM] \
3338 = build_function_type \
3339 (builtin_types[(int) RETURN], \
3340 tree_cons (NULL_TREE, \
3341 builtin_types[(int) ARG1], \
3342 tree_cons (NULL_TREE, \
3343 builtin_types[(int) ARG2], \
3344 tree_cons (NULL_TREE, \
3345 builtin_types[(int) ARG3], \
3348 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3349 builtin_types[(int) ENUM] \
3350 = build_pointer_type (builtin_types[(int) TYPE]);
3351 #include "builtin-types.def"
3352 #undef DEF_PRIMITIVE_TYPE
3353 #undef DEF_FUNCTION_TYPE_1
3354 #undef DEF_FUNCTION_TYPE_2
3355 #undef DEF_FUNCTION_TYPE_3
3356 #undef DEF_FUNCTION_TYPE_4
3357 #undef DEF_FUNCTION_TYPE_VAR_0
3358 #undef DEF_FUNCTION_TYPE_VAR_1
3359 #undef DEF_FUNCTION_TYPE_VAR_2
3360 #undef DEF_FUNCTION_TYPE_VAR_3
3361 #undef DEF_POINTER_TYPE
3363 c_init_attributes ();
3365 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3366 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3371 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3375 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3378 ? (NAME + strlen ("__builtin_")) \
3380 built_in_attributes[(int) ATTRS]); \
3382 decl = builtin_function_2 (NAME, \
3383 NAME + strlen ("__builtin_"), \
3384 builtin_types[TYPE], \
3385 builtin_types[LIBTYPE], \
3390 built_in_attributes[(int) ATTRS]); \
3392 built_in_decls[(int) ENUM] = decl; \
3394 implicit_built_in_decls[(int) ENUM] = decl; \
3396 #include "builtins.def"
3399 (*targetm.init_builtins) ();
3401 main_identifier_node = get_identifier ("main");
3405 build_va_arg (tree expr, tree type)
3407 return build1 (VA_ARG_EXPR, type, expr);
3411 /* Linked list of disabled built-in functions. */
3413 typedef struct disabled_builtin
3416 struct disabled_builtin *next;
3418 static disabled_builtin *disabled_builtins = NULL;
3420 static bool builtin_function_disabled_p (const char *);
3422 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3423 begins with "__builtin_", give an error. */
3426 disable_builtin_function (const char *name)
3428 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3429 error ("cannot disable built-in function `%s'", name);
3432 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3434 new->next = disabled_builtins;
3435 disabled_builtins = new;
3440 /* Return true if the built-in function NAME has been disabled, false
3444 builtin_function_disabled_p (const char *name)
3446 disabled_builtin *p;
3447 for (p = disabled_builtins; p != NULL; p = p->next)
3449 if (strcmp (name, p->name) == 0)
3456 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3457 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3458 of these may be NULL (though both being NULL is useless).
3459 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3460 TYPE is the type of the function with the ordinary name. These
3461 may differ if the ordinary name is declared with a looser type to avoid
3462 conflicts with headers. FUNCTION_CODE and CLASS are as for
3463 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3464 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3465 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3466 ATTRS is the tree list representing the builtin's function attributes.
3467 Returns the declaration of BUILTIN_NAME, if any, otherwise
3468 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3469 or if NONANSI_P and flag_no_nonansi_builtin. */
3472 builtin_function_2 (const char *builtin_name, const char *name,
3473 tree builtin_type, tree type, int function_code,
3474 enum built_in_class class, int library_name_p,
3475 int nonansi_p, tree attrs)
3477 tree bdecl = NULL_TREE;
3478 tree decl = NULL_TREE;
3480 if (builtin_name != 0)
3481 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3482 class, library_name_p ? name : NULL, attrs);
3484 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3485 && !(nonansi_p && flag_no_nonansi_builtin))
3486 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3488 return (bdecl != 0 ? bdecl : decl);
3491 /* Nonzero if the type T promotes to int. This is (nearly) the
3492 integral promotions defined in ISO C99 6.3.1.1/2. */
3495 c_promoting_integer_type_p (tree t)
3497 switch (TREE_CODE (t))
3500 return (TYPE_MAIN_VARIANT (t) == char_type_node
3501 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3502 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3503 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3504 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3505 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3508 /* ??? Technically all enumerations not larger than an int
3509 promote to an int. But this is used along code paths
3510 that only want to notice a size change. */
3511 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3521 /* Return 1 if PARMS specifies a fixed number of parameters
3522 and none of their types is affected by default promotions. */
3525 self_promoting_args_p (tree parms)
3528 for (t = parms; t; t = TREE_CHAIN (t))
3530 tree type = TREE_VALUE (t);
3532 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3538 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3541 if (c_promoting_integer_type_p (type))
3547 /* Recursively examines the array elements of TYPE, until a non-array
3548 element type is found. */
3551 strip_array_types (tree type)
3553 while (TREE_CODE (type) == ARRAY_TYPE)
3554 type = TREE_TYPE (type);
3559 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3561 /* Expand a call to an unordered comparison function such as
3562 __builtin_isgreater(). FUNCTION is the function's declaration and
3563 PARAMS a list of the values passed. For __builtin_isunordered(),
3564 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3565 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3566 that give the opposite of the desired result. UNORDERED_CODE is
3567 used for modes that can hold NaNs and ORDERED_CODE is used for the
3571 expand_unordered_cmp (tree function, tree params,
3572 enum tree_code unordered_code,
3573 enum tree_code ordered_code)
3575 tree arg0, arg1, type;
3576 enum tree_code code0, code1;
3578 /* Check that we have exactly two arguments. */
3579 if (params == 0 || TREE_CHAIN (params) == 0)
3581 error ("too few arguments to function `%s'",
3582 IDENTIFIER_POINTER (DECL_NAME (function)));
3583 return error_mark_node;
3585 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3587 error ("too many arguments to function `%s'",
3588 IDENTIFIER_POINTER (DECL_NAME (function)));
3589 return error_mark_node;
3592 arg0 = TREE_VALUE (params);
3593 arg1 = TREE_VALUE (TREE_CHAIN (params));
3595 code0 = TREE_CODE (TREE_TYPE (arg0));
3596 code1 = TREE_CODE (TREE_TYPE (arg1));
3598 /* Make sure that the arguments have a common type of REAL. */
3600 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3601 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3602 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3604 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3606 error ("non-floating-point argument to function `%s'",
3607 IDENTIFIER_POINTER (DECL_NAME (function)));
3608 return error_mark_node;
3611 if (unordered_code == UNORDERED_EXPR)
3613 if (MODE_HAS_NANS (TYPE_MODE (type)))
3614 return build_binary_op (unordered_code,
3615 convert (type, arg0),
3616 convert (type, arg1),
3619 return integer_zero_node;
3622 return build_unary_op (TRUTH_NOT_EXPR,
3623 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3626 convert (type, arg0),
3627 convert (type, arg1),
3633 /* Recognize certain built-in functions so we can make tree-codes
3634 other than CALL_EXPR. We do this when it enables fold-const.c
3635 to do something useful. */
3636 /* ??? By rights this should go in builtins.c, but only C and C++
3637 implement build_{binary,unary}_op. Not exactly sure what bits
3638 of functionality are actually needed from those functions, or
3639 where the similar functionality exists in the other front ends. */
3642 expand_tree_builtin (tree function, tree params, tree coerced_params)
3644 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3647 switch (DECL_FUNCTION_CODE (function))
3651 case BUILT_IN_LLABS:
3652 case BUILT_IN_IMAXABS:
3654 case BUILT_IN_FABSL:
3655 case BUILT_IN_FABSF:
3656 if (coerced_params == 0)
3657 return integer_zero_node;
3658 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3661 case BUILT_IN_CONJF:
3662 case BUILT_IN_CONJL:
3663 if (coerced_params == 0)
3664 return integer_zero_node;
3665 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3667 case BUILT_IN_CREAL:
3668 case BUILT_IN_CREALF:
3669 case BUILT_IN_CREALL:
3670 if (coerced_params == 0)
3671 return integer_zero_node;
3672 return build_unary_op (REALPART_EXPR, TREE_VALUE (coerced_params), 0);
3674 case BUILT_IN_CIMAG:
3675 case BUILT_IN_CIMAGF:
3676 case BUILT_IN_CIMAGL:
3677 if (coerced_params == 0)
3678 return integer_zero_node;
3679 return build_unary_op (IMAGPART_EXPR, TREE_VALUE (coerced_params), 0);
3681 case BUILT_IN_ISGREATER:
3682 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3684 case BUILT_IN_ISGREATEREQUAL:
3685 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3687 case BUILT_IN_ISLESS:
3688 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3690 case BUILT_IN_ISLESSEQUAL:
3691 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3693 case BUILT_IN_ISLESSGREATER:
3694 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3696 case BUILT_IN_ISUNORDERED:
3697 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3706 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3707 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3708 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3709 value, the traversal is aborted, and the value returned by FUNC is
3710 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3711 the node being visited are not walked.
3713 We don't need a without_duplicates variant of this one because the
3714 statement tree is a tree, not a graph. */
3717 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3719 enum tree_code code;
3724 #define WALK_SUBTREE(NODE) \
3727 result = walk_stmt_tree (&(NODE), func, data); \
3733 /* Skip empty subtrees. */
3737 /* Skip subtrees below non-statement nodes. */
3738 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3741 /* Call the function. */
3743 result = (*func) (tp, &walk_subtrees, data);
3745 /* If we found something, return it. */
3749 /* FUNC may have modified the tree, recheck that we're looking at a
3751 code = TREE_CODE (*tp);
3752 if (!STATEMENT_CODE_P (code))
3755 /* Visit the subtrees unless FUNC decided that there was nothing
3756 interesting below this point in the tree. */
3759 /* Walk over all the sub-trees of this operand. Statement nodes
3760 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3761 len = TREE_CODE_LENGTH (code);
3763 /* Go through the subtrees. We need to do this in forward order so
3764 that the scope of a FOR_EXPR is handled properly. */
3765 for (i = 0; i < len; ++i)
3766 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3769 /* Finally visit the chain. This can be tail-recursion optimized if
3770 we write it this way. */
3771 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3776 /* Used to compare case labels. K1 and K2 are actually tree nodes
3777 representing case labels, or NULL_TREE for a `default' label.
3778 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3779 K2, and 0 if K1 and K2 are equal. */
3782 case_compare (splay_tree_key k1, splay_tree_key k2)
3784 /* Consider a NULL key (such as arises with a `default' label) to be
3785 smaller than anything else. */
3791 return tree_int_cst_compare ((tree) k1, (tree) k2);
3794 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3795 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3796 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3797 case label was declared using the usual C/C++ syntax, rather than
3798 the GNU case range extension. CASES is a tree containing all the
3799 case ranges processed so far; COND is the condition for the
3800 switch-statement itself. Returns the CASE_LABEL created, or
3801 ERROR_MARK_NODE if no CASE_LABEL is created. */
3804 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3810 splay_tree_node node;
3812 /* Create the LABEL_DECL itself. */
3813 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3814 DECL_CONTEXT (label) = current_function_decl;
3816 /* If there was an error processing the switch condition, bail now
3817 before we get more confused. */
3818 if (!cond || cond == error_mark_node)
3820 /* Add a label anyhow so that the back-end doesn't think that
3821 the beginning of the switch is unreachable. */
3823 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3824 return error_mark_node;
3827 if ((low_value && TREE_TYPE (low_value)
3828 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3829 || (high_value && TREE_TYPE (high_value)
3830 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3831 error ("pointers are not permitted as case values");
3833 /* Case ranges are a GNU extension. */
3834 if (high_value && pedantic)
3835 pedwarn ("range expressions in switch statements are non-standard");
3837 type = TREE_TYPE (cond);
3840 low_value = check_case_value (low_value);
3841 low_value = convert_and_check (type, low_value);
3845 high_value = check_case_value (high_value);
3846 high_value = convert_and_check (type, high_value);
3849 /* If an error has occurred, bail out now. */
3850 if (low_value == error_mark_node || high_value == error_mark_node)
3853 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3854 return error_mark_node;
3857 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3858 really a case range, even though it was written that way. Remove
3859 the HIGH_VALUE to simplify later processing. */
3860 if (tree_int_cst_equal (low_value, high_value))
3861 high_value = NULL_TREE;
3862 if (low_value && high_value
3863 && !tree_int_cst_lt (low_value, high_value))
3864 warning ("empty range specified");
3866 /* Look up the LOW_VALUE in the table of case labels we already
3868 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3869 /* If there was not an exact match, check for overlapping ranges.
3870 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3871 that's a `default' label and the only overlap is an exact match. */
3872 if (!node && (low_value || high_value))
3874 splay_tree_node low_bound;
3875 splay_tree_node high_bound;
3877 /* Even though there wasn't an exact match, there might be an
3878 overlap between this case range and another case range.
3879 Since we've (inductively) not allowed any overlapping case
3880 ranges, we simply need to find the greatest low case label
3881 that is smaller that LOW_VALUE, and the smallest low case
3882 label that is greater than LOW_VALUE. If there is an overlap
3883 it will occur in one of these two ranges. */
3884 low_bound = splay_tree_predecessor (cases,
3885 (splay_tree_key) low_value);
3886 high_bound = splay_tree_successor (cases,
3887 (splay_tree_key) low_value);
3889 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3890 the LOW_VALUE, so there is no need to check unless the
3891 LOW_BOUND is in fact itself a case range. */
3893 && CASE_HIGH ((tree) low_bound->value)
3894 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3897 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3898 range is bigger than the low end of the current range, so we
3899 are only interested if the current range is a real range, and
3900 not an ordinary case label. */
3903 && (tree_int_cst_compare ((tree) high_bound->key,
3908 /* If there was an overlap, issue an error. */
3911 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3915 error ("duplicate (or overlapping) case value");
3916 error ("%Hthis is the first entry overlapping that value",
3917 &DECL_SOURCE_LOCATION (duplicate));
3921 error ("duplicate case value") ;
3922 error ("%Hpreviously used here", &DECL_SOURCE_LOCATION (duplicate));
3926 error ("multiple default labels in one switch");
3927 error ("%Hthis is the first default label",
3928 &DECL_SOURCE_LOCATION (duplicate));
3931 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3934 /* Add a CASE_LABEL to the statement-tree. */
3935 case_label = add_stmt (build_case_label (low_value, high_value, label));
3936 /* Register this case label in the splay tree. */
3937 splay_tree_insert (cases,
3938 (splay_tree_key) low_value,
3939 (splay_tree_value) case_label);
3944 /* Finish an expression taking the address of LABEL (an
3945 IDENTIFIER_NODE). Returns an expression for the address. */
3948 finish_label_address_expr (tree label)
3953 pedwarn ("taking the address of a label is non-standard");
3955 if (label == error_mark_node)
3956 return error_mark_node;
3958 label = lookup_label (label);
3959 if (label == NULL_TREE)
3960 result = null_pointer_node;
3963 TREE_USED (label) = 1;
3964 result = build1 (ADDR_EXPR, ptr_type_node, label);
3965 TREE_CONSTANT (result) = 1;
3966 /* The current function in not necessarily uninlinable.
3967 Computed gotos are incompatible with inlining, but the value
3968 here could be used only in a diagnostic, for example. */
3974 /* Hook used by expand_expr to expand language-specific tree codes. */
3977 c_expand_expr (tree exp, rtx target, enum machine_mode tmode, int modifier)
3978 /* Actually enum_modifier. */
3980 switch (TREE_CODE (exp))
3986 bool preserve_result = false;
3987 bool return_target = false;
3989 /* Since expand_expr_stmt calls free_temp_slots after every
3990 expression statement, we must call push_temp_slots here.
3991 Otherwise, any temporaries in use now would be considered
3992 out-of-scope after the first EXPR_STMT from within the
3995 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
3997 /* If we want the result of this expression, find the last
3998 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
3999 if (target != const0_rtx
4000 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
4001 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
4003 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
4004 tree last = TREE_CHAIN (expr);
4006 while (TREE_CHAIN (last))
4009 last = TREE_CHAIN (last);
4012 if (TREE_CODE (last) == SCOPE_STMT
4013 && TREE_CODE (expr) == EXPR_STMT)
4015 if (target && TREE_CODE (EXPR_STMT_EXPR (expr)) == VAR_DECL
4016 && DECL_RTL_IF_SET (EXPR_STMT_EXPR (expr)) == target)
4017 /* If the last expression is a variable whose RTL is the
4018 same as our target, just return the target; if it
4019 isn't valid expanding the decl would produce different
4020 RTL, and store_expr would try to do a copy. */
4021 return_target = true;
4024 /* Otherwise, note that we want the value from the last
4026 TREE_ADDRESSABLE (expr) = 1;
4027 preserve_result = true;
4032 expand_stmt (STMT_EXPR_STMT (exp));
4033 expand_end_stmt_expr (rtl_expr);
4035 result = expand_expr (rtl_expr, target, tmode, modifier);
4038 else if (preserve_result && GET_CODE (result) == MEM)
4040 if (GET_MODE (result) != BLKmode)
4041 result = copy_to_reg (result);
4043 preserve_temp_slots (result);
4046 /* If the statment-expression does not have a scope, then the
4047 new temporaries we created within it must live beyond the
4048 statement-expression. */
4049 if (STMT_EXPR_NO_SCOPE (exp))
4050 preserve_temp_slots (NULL_RTX);
4057 case COMPOUND_LITERAL_EXPR:
4059 /* Initialize the anonymous variable declared in the compound
4060 literal, then return the variable. */
4061 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4062 emit_local_var (decl);
4063 return expand_expr (decl, target, tmode, modifier);
4074 /* Hook used by safe_from_p to handle language-specific tree codes. */
4077 c_safe_from_p (rtx target, tree exp)
4079 /* We can see statements here when processing the body of a
4080 statement-expression. For a declaration statement declaring a
4081 variable, look at the variable's initializer. */
4082 if (TREE_CODE (exp) == DECL_STMT)
4084 tree decl = DECL_STMT_DECL (exp);
4086 if (TREE_CODE (decl) == VAR_DECL
4087 && DECL_INITIAL (decl)
4088 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4092 /* For any statement, we must follow the statement-chain. */
4093 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4094 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4096 /* Assume everything else is safe. */
4100 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4103 c_common_unsafe_for_reeval (tree exp)
4105 /* Statement expressions may not be reevaluated, likewise compound
4107 if (TREE_CODE (exp) == STMT_EXPR
4108 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4111 /* Walk all other expressions. */
4115 /* Hook used by staticp to handle language-specific tree codes. */
4118 c_staticp (tree exp)
4120 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4121 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4127 /* Given a boolean expression ARG, return a tree representing an increment
4128 or decrement (as indicated by CODE) of ARG. The front end must check for
4129 invalid cases (e.g., decrement in C++). */
4131 boolean_increment (enum tree_code code, tree arg)
4134 tree true_res = boolean_true_node;
4136 arg = stabilize_reference (arg);
4139 case PREINCREMENT_EXPR:
4140 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4142 case POSTINCREMENT_EXPR:
4143 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4144 arg = save_expr (arg);
4145 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4146 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4148 case PREDECREMENT_EXPR:
4149 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4151 case POSTDECREMENT_EXPR:
4152 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4153 arg = save_expr (arg);
4154 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4155 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4160 TREE_SIDE_EFFECTS (val) = 1;
4164 /* Built-in macros for stddef.h, that require macros defined in this
4167 c_stddef_cpp_builtins(void)
4169 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4170 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4171 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4172 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4176 c_init_attributes (void)
4178 /* Fill in the built_in_attributes array. */
4179 #define DEF_ATTR_NULL_TREE(ENUM) \
4180 built_in_attributes[(int) ENUM] = NULL_TREE;
4181 #define DEF_ATTR_INT(ENUM, VALUE) \
4182 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4183 #define DEF_ATTR_IDENT(ENUM, STRING) \
4184 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4185 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4186 built_in_attributes[(int) ENUM] \
4187 = tree_cons (built_in_attributes[(int) PURPOSE], \
4188 built_in_attributes[(int) VALUE], \
4189 built_in_attributes[(int) CHAIN]);
4190 #include "builtin-attrs.def"
4191 #undef DEF_ATTR_NULL_TREE
4193 #undef DEF_ATTR_IDENT
4194 #undef DEF_ATTR_TREE_LIST
4197 /* Output a -Wshadow warning MSGCODE about NAME, and give the location
4198 of the previous declaration DECL. */
4200 shadow_warning (enum sw_kind msgcode, const char *name, tree decl)
4202 static const char *const msgs[] = {
4203 /* SW_PARAM */ N_("declaration of \"%s\" shadows a parameter"),
4204 /* SW_LOCAL */ N_("declaration of \"%s\" shadows a previous local"),
4205 /* SW_GLOBAL */ N_("declaration of \"%s\" shadows a global declaration")
4208 warning (msgs[msgcode], name);
4209 warning ("%Hshadowed declaration is here", &DECL_SOURCE_LOCATION (decl));
4212 /* Attribute handlers common to C front ends. */
4214 /* Handle a "packed" attribute; arguments as in
4215 struct attribute_spec.handler. */
4218 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4219 int flags, bool *no_add_attrs)
4223 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4224 *node = build_type_copy (*node);
4225 TYPE_PACKED (*node) = 1;
4226 if (TYPE_MAIN_VARIANT (*node) == *node)
4228 /* If it is the main variant, then pack the other variants
4229 too. This happens in,
4232 struct Foo const *ptr; // creates a variant w/o packed flag
4233 } __ attribute__((packed)); // packs it now.
4237 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4238 TYPE_PACKED (probe) = 1;
4242 else if (TREE_CODE (*node) == FIELD_DECL)
4243 DECL_PACKED (*node) = 1;
4244 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4245 used for DECL_REGISTER. It wouldn't mean anything anyway.
4246 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4247 that changes what the typedef is typing. */
4250 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4251 *no_add_attrs = true;
4257 /* Handle a "nocommon" attribute; arguments as in
4258 struct attribute_spec.handler. */
4261 handle_nocommon_attribute (tree *node, tree name,
4262 tree args ATTRIBUTE_UNUSED,
4263 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4265 if (TREE_CODE (*node) == VAR_DECL)
4266 DECL_COMMON (*node) = 0;
4269 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4270 *no_add_attrs = true;
4276 /* Handle a "common" attribute; arguments as in
4277 struct attribute_spec.handler. */
4280 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4281 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4283 if (TREE_CODE (*node) == VAR_DECL)
4284 DECL_COMMON (*node) = 1;
4287 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4288 *no_add_attrs = true;
4294 /* Handle a "noreturn" attribute; arguments as in
4295 struct attribute_spec.handler. */
4298 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4299 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4301 tree type = TREE_TYPE (*node);
4303 /* See FIXME comment in c_common_attribute_table. */
4304 if (TREE_CODE (*node) == FUNCTION_DECL)
4305 TREE_THIS_VOLATILE (*node) = 1;
4306 else if (TREE_CODE (type) == POINTER_TYPE
4307 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4309 = build_pointer_type
4310 (build_type_variant (TREE_TYPE (type),
4311 TREE_READONLY (TREE_TYPE (type)), 1));
4314 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4315 *no_add_attrs = true;
4321 /* Handle a "noinline" attribute; arguments as in
4322 struct attribute_spec.handler. */
4325 handle_noinline_attribute (tree *node, tree name,
4326 tree args ATTRIBUTE_UNUSED,
4327 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4329 if (TREE_CODE (*node) == FUNCTION_DECL)
4330 DECL_UNINLINABLE (*node) = 1;
4333 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4334 *no_add_attrs = true;
4340 /* Handle a "always_inline" attribute; arguments as in
4341 struct attribute_spec.handler. */
4344 handle_always_inline_attribute (tree *node, tree name,
4345 tree args ATTRIBUTE_UNUSED,
4346 int flags ATTRIBUTE_UNUSED,
4349 if (TREE_CODE (*node) == FUNCTION_DECL)
4351 /* Do nothing else, just set the attribute. We'll get at
4352 it later with lookup_attribute. */
4356 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4357 *no_add_attrs = true;
4363 /* Handle a "used" attribute; arguments as in
4364 struct attribute_spec.handler. */
4367 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4368 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4372 if (TREE_CODE (node) == FUNCTION_DECL
4373 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4375 TREE_USED (node) = 1;
4379 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4380 *no_add_attrs = true;
4386 /* Handle a "unused" attribute; arguments as in
4387 struct attribute_spec.handler. */
4390 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4391 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4397 if (TREE_CODE (decl) == PARM_DECL
4398 || TREE_CODE (decl) == VAR_DECL
4399 || TREE_CODE (decl) == FUNCTION_DECL
4400 || TREE_CODE (decl) == LABEL_DECL
4401 || TREE_CODE (decl) == TYPE_DECL)
4402 TREE_USED (decl) = 1;
4405 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4406 *no_add_attrs = true;
4411 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4412 *node = build_type_copy (*node);
4413 TREE_USED (*node) = 1;
4419 /* Handle a "const" attribute; arguments as in
4420 struct attribute_spec.handler. */
4423 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4424 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4426 tree type = TREE_TYPE (*node);
4428 /* See FIXME comment on noreturn in c_common_attribute_table. */
4429 if (TREE_CODE (*node) == FUNCTION_DECL)
4430 TREE_READONLY (*node) = 1;
4431 else if (TREE_CODE (type) == POINTER_TYPE
4432 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4434 = build_pointer_type
4435 (build_type_variant (TREE_TYPE (type), 1,
4436 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4439 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4440 *no_add_attrs = true;
4446 /* Handle a "transparent_union" attribute; arguments as in
4447 struct attribute_spec.handler. */
4450 handle_transparent_union_attribute (tree *node, tree name,
4451 tree args ATTRIBUTE_UNUSED, int flags,
4454 tree decl = NULL_TREE;
4461 type = &TREE_TYPE (decl);
4462 is_type = TREE_CODE (*node) == TYPE_DECL;
4464 else if (TYPE_P (*node))
4465 type = node, is_type = 1;
4468 && TREE_CODE (*type) == UNION_TYPE
4470 || (TYPE_FIELDS (*type) != 0
4471 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4473 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4474 *type = build_type_copy (*type);
4475 TYPE_TRANSPARENT_UNION (*type) = 1;
4477 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4478 && TREE_CODE (*type) == UNION_TYPE
4479 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4480 DECL_TRANSPARENT_UNION (decl) = 1;
4483 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4484 *no_add_attrs = true;
4490 /* Handle a "constructor" attribute; arguments as in
4491 struct attribute_spec.handler. */
4494 handle_constructor_attribute (tree *node, tree name,
4495 tree args ATTRIBUTE_UNUSED,
4496 int flags ATTRIBUTE_UNUSED,
4500 tree type = TREE_TYPE (decl);
4502 if (TREE_CODE (decl) == FUNCTION_DECL
4503 && TREE_CODE (type) == FUNCTION_TYPE
4504 && decl_function_context (decl) == 0)
4506 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4507 TREE_USED (decl) = 1;
4511 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4512 *no_add_attrs = true;
4518 /* Handle a "destructor" attribute; arguments as in
4519 struct attribute_spec.handler. */
4522 handle_destructor_attribute (tree *node, tree name,
4523 tree args ATTRIBUTE_UNUSED,
4524 int flags ATTRIBUTE_UNUSED,
4528 tree type = TREE_TYPE (decl);
4530 if (TREE_CODE (decl) == FUNCTION_DECL
4531 && TREE_CODE (type) == FUNCTION_TYPE
4532 && decl_function_context (decl) == 0)
4534 DECL_STATIC_DESTRUCTOR (decl) = 1;
4535 TREE_USED (decl) = 1;
4539 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4540 *no_add_attrs = true;
4546 /* Handle a "mode" attribute; arguments as in
4547 struct attribute_spec.handler. */
4550 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4551 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4555 *no_add_attrs = true;
4557 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4558 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4562 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4563 int len = strlen (p);
4564 enum machine_mode mode = VOIDmode;
4568 if (len > 4 && p[0] == '_' && p[1] == '_'
4569 && p[len - 1] == '_' && p[len - 2] == '_')
4571 char *newp = alloca (len - 1);
4573 strcpy (newp, &p[2]);
4574 newp[len - 4] = '\0';
4578 /* Change this type to have a type with the specified mode.
4579 First check for the special modes. */
4580 if (! strcmp (p, "byte"))
4582 else if (!strcmp (p, "word"))
4584 else if (! strcmp (p, "pointer"))
4587 for (j = 0; j < NUM_MACHINE_MODES; j++)
4588 if (!strcmp (p, GET_MODE_NAME (j)))
4589 mode = (enum machine_mode) j;
4591 if (mode == VOIDmode)
4592 error ("unknown machine mode `%s'", p);
4593 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
4594 (mode, TREE_UNSIGNED (type))))
4595 error ("no data type for mode `%s'", p);
4596 else if ((TREE_CODE (type) == POINTER_TYPE
4597 || TREE_CODE (type) == REFERENCE_TYPE)
4598 && !(*targetm.valid_pointer_mode) (mode))
4599 error ("invalid pointer mode `%s'", p);
4602 /* If this is a vector, make sure we either have hardware
4603 support, or we can emulate it. */
4604 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4606 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4610 if (TREE_CODE (type) == POINTER_TYPE)
4612 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4616 else if (TREE_CODE (type) == REFERENCE_TYPE)
4618 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4624 /* No need to layout the type here. The caller should do this. */
4631 /* Handle a "section" attribute; arguments as in
4632 struct attribute_spec.handler. */
4635 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4636 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4640 if (targetm.have_named_sections)
4642 if ((TREE_CODE (decl) == FUNCTION_DECL
4643 || TREE_CODE (decl) == VAR_DECL)
4644 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4646 if (TREE_CODE (decl) == VAR_DECL
4647 && current_function_decl != NULL_TREE
4648 && ! TREE_STATIC (decl))
4650 error ("%Hsection attribute cannot be specified for "
4651 "local variables", &DECL_SOURCE_LOCATION (decl));
4652 *no_add_attrs = true;
4655 /* The decl may have already been given a section attribute
4656 from a previous declaration. Ensure they match. */
4657 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4658 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4659 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4661 error ("%Hsection of '%D' conflicts with previous declaration",
4662 &DECL_SOURCE_LOCATION (*node), *node);
4663 *no_add_attrs = true;
4666 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4670 error ("%Hsection attribute not allowed for '%D'",
4671 &DECL_SOURCE_LOCATION (*node), *node);
4672 *no_add_attrs = true;
4677 error ("%Hsection attributes are not supported for this target",
4678 &DECL_SOURCE_LOCATION (*node));
4679 *no_add_attrs = true;
4685 /* Handle a "aligned" attribute; arguments as in
4686 struct attribute_spec.handler. */
4689 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4690 int flags, bool *no_add_attrs)
4692 tree decl = NULL_TREE;
4695 tree align_expr = (args ? TREE_VALUE (args)
4696 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4702 type = &TREE_TYPE (decl);
4703 is_type = TREE_CODE (*node) == TYPE_DECL;
4705 else if (TYPE_P (*node))
4706 type = node, is_type = 1;
4708 /* Strip any NOPs of any kind. */
4709 while (TREE_CODE (align_expr) == NOP_EXPR
4710 || TREE_CODE (align_expr) == CONVERT_EXPR
4711 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4712 align_expr = TREE_OPERAND (align_expr, 0);
4714 if (TREE_CODE (align_expr) != INTEGER_CST)
4716 error ("requested alignment is not a constant");
4717 *no_add_attrs = true;
4719 else if ((i = tree_log2 (align_expr)) == -1)
4721 error ("requested alignment is not a power of 2");
4722 *no_add_attrs = true;
4724 else if (i > HOST_BITS_PER_INT - 2)
4726 error ("requested alignment is too large");
4727 *no_add_attrs = true;
4731 /* If we have a TYPE_DECL, then copy the type, so that we
4732 don't accidentally modify a builtin type. See pushdecl. */
4733 if (decl && TREE_TYPE (decl) != error_mark_node
4734 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4736 tree tt = TREE_TYPE (decl);
4737 *type = build_type_copy (*type);
4738 DECL_ORIGINAL_TYPE (decl) = tt;
4739 TYPE_NAME (*type) = decl;
4740 TREE_USED (*type) = TREE_USED (decl);
4741 TREE_TYPE (decl) = *type;
4743 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4744 *type = build_type_copy (*type);
4746 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4747 TYPE_USER_ALIGN (*type) = 1;
4749 else if (TREE_CODE (decl) != VAR_DECL
4750 && TREE_CODE (decl) != FIELD_DECL)
4752 error ("%Halignment may not be specified for '%D'",
4753 &DECL_SOURCE_LOCATION (decl), decl);
4754 *no_add_attrs = true;
4758 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4759 DECL_USER_ALIGN (decl) = 1;
4765 /* Handle a "weak" attribute; arguments as in
4766 struct attribute_spec.handler. */
4769 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4770 tree args ATTRIBUTE_UNUSED,
4771 int flags ATTRIBUTE_UNUSED,
4772 bool *no_add_attrs ATTRIBUTE_UNUSED)
4774 declare_weak (*node);
4779 /* Handle an "alias" attribute; arguments as in
4780 struct attribute_spec.handler. */
4783 handle_alias_attribute (tree *node, tree name, tree args,
4784 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4788 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4789 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4791 error ("%H'%D' defined both normally and as an alias",
4792 &DECL_SOURCE_LOCATION (decl), decl);
4793 *no_add_attrs = true;
4795 else if (decl_function_context (decl) == 0)
4799 id = TREE_VALUE (args);
4800 if (TREE_CODE (id) != STRING_CST)
4802 error ("alias arg not a string");
4803 *no_add_attrs = true;
4806 id = get_identifier (TREE_STRING_POINTER (id));
4807 /* This counts as a use of the object pointed to. */
4810 if (TREE_CODE (decl) == FUNCTION_DECL)
4811 DECL_INITIAL (decl) = error_mark_node;
4813 DECL_EXTERNAL (decl) = 0;
4817 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4818 *no_add_attrs = true;
4824 /* Handle an "visibility" attribute; arguments as in
4825 struct attribute_spec.handler. */
4828 handle_visibility_attribute (tree *node, tree name, tree args,
4829 int flags ATTRIBUTE_UNUSED,
4834 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
4836 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4837 *no_add_attrs = true;
4843 id = TREE_VALUE (args);
4844 if (TREE_CODE (id) != STRING_CST)
4846 error ("visibility arg not a string");
4847 *no_add_attrs = true;
4850 if (strcmp (TREE_STRING_POINTER (id), "hidden")
4851 && strcmp (TREE_STRING_POINTER (id), "protected")
4852 && strcmp (TREE_STRING_POINTER (id), "internal")
4853 && strcmp (TREE_STRING_POINTER (id), "default"))
4855 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4856 *no_add_attrs = true;
4864 /* Handle an "tls_model" attribute; arguments as in
4865 struct attribute_spec.handler. */
4868 handle_tls_model_attribute (tree *node, tree name, tree args,
4869 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4873 if (! DECL_THREAD_LOCAL (decl))
4875 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4876 *no_add_attrs = true;
4882 id = TREE_VALUE (args);
4883 if (TREE_CODE (id) != STRING_CST)
4885 error ("tls_model arg not a string");
4886 *no_add_attrs = true;
4889 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4890 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4891 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4892 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4894 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4895 *no_add_attrs = true;
4903 /* Handle a "no_instrument_function" attribute; arguments as in
4904 struct attribute_spec.handler. */
4907 handle_no_instrument_function_attribute (tree *node, tree name,
4908 tree args ATTRIBUTE_UNUSED,
4909 int flags ATTRIBUTE_UNUSED,
4914 if (TREE_CODE (decl) != FUNCTION_DECL)
4916 error ("%H'%E' attribute applies only to functions",
4917 &DECL_SOURCE_LOCATION (decl), name);
4918 *no_add_attrs = true;
4920 else if (DECL_INITIAL (decl))
4922 error ("%Hcan't set '%E' attribute after definition",
4923 &DECL_SOURCE_LOCATION (decl), name);
4924 *no_add_attrs = true;
4927 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
4932 /* Handle a "malloc" attribute; arguments as in
4933 struct attribute_spec.handler. */
4936 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4937 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4939 if (TREE_CODE (*node) == FUNCTION_DECL)
4940 DECL_IS_MALLOC (*node) = 1;
4941 /* ??? TODO: Support types. */
4944 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4945 *no_add_attrs = true;
4951 /* Handle a "no_limit_stack" attribute; arguments as in
4952 struct attribute_spec.handler. */
4955 handle_no_limit_stack_attribute (tree *node, tree name,
4956 tree args ATTRIBUTE_UNUSED,
4957 int flags ATTRIBUTE_UNUSED,
4962 if (TREE_CODE (decl) != FUNCTION_DECL)
4964 error ("%H'%E' attribute applies only to functions",
4965 &DECL_SOURCE_LOCATION (decl), name);
4966 *no_add_attrs = true;
4968 else if (DECL_INITIAL (decl))
4970 error ("%Hcan't set '%E' attribute after definition",
4971 &DECL_SOURCE_LOCATION (decl), name);
4972 *no_add_attrs = true;
4975 DECL_NO_LIMIT_STACK (decl) = 1;
4980 /* Handle a "pure" attribute; arguments as in
4981 struct attribute_spec.handler. */
4984 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4985 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4987 if (TREE_CODE (*node) == FUNCTION_DECL)
4988 DECL_IS_PURE (*node) = 1;
4989 /* ??? TODO: Support types. */
4992 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4993 *no_add_attrs = true;
4999 /* Handle a "deprecated" attribute; arguments as in
5000 struct attribute_spec.handler. */
5003 handle_deprecated_attribute (tree *node, tree name,
5004 tree args ATTRIBUTE_UNUSED, int flags,
5007 tree type = NULL_TREE;
5009 const char *what = NULL;
5014 type = TREE_TYPE (decl);
5016 if (TREE_CODE (decl) == TYPE_DECL
5017 || TREE_CODE (decl) == PARM_DECL
5018 || TREE_CODE (decl) == VAR_DECL
5019 || TREE_CODE (decl) == FUNCTION_DECL
5020 || TREE_CODE (decl) == FIELD_DECL)
5021 TREE_DEPRECATED (decl) = 1;
5025 else if (TYPE_P (*node))
5027 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5028 *node = build_type_copy (*node);
5029 TREE_DEPRECATED (*node) = 1;
5037 *no_add_attrs = true;
5038 if (type && TYPE_NAME (type))
5040 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5041 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5042 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5043 && DECL_NAME (TYPE_NAME (type)))
5044 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5047 warning ("`%s' attribute ignored for `%s'",
5048 IDENTIFIER_POINTER (name), what);
5050 warning ("`%s' attribute ignored",
5051 IDENTIFIER_POINTER (name));
5057 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5058 to prevent us from duplicating type nodes unnecessarily.
5059 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5060 since we want to distinguish types that are essentially identical (except
5061 for their debug representation), we use a local list here. */
5062 static GTY(()) tree vector_type_node_list = 0;
5064 /* Handle a "vector_size" attribute; arguments as in
5065 struct attribute_spec.handler. */
5068 handle_vector_size_attribute (tree *node, tree name, tree args,
5069 int flags ATTRIBUTE_UNUSED,
5072 unsigned HOST_WIDE_INT vecsize, nunits;
5073 enum machine_mode mode, orig_mode, new_mode;
5074 tree type = *node, new_type = NULL_TREE;
5075 tree type_list_node;
5077 *no_add_attrs = true;
5079 if (! host_integerp (TREE_VALUE (args), 1))
5081 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5085 /* Get the vector size (in bytes). */
5086 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5088 /* We need to provide for vector pointers, vector arrays, and
5089 functions returning vectors. For example:
5091 __attribute__((vector_size(16))) short *foo;
5093 In this case, the mode is SI, but the type being modified is
5094 HI, so we need to look further. */
5096 while (POINTER_TYPE_P (type)
5097 || TREE_CODE (type) == FUNCTION_TYPE
5098 || TREE_CODE (type) == ARRAY_TYPE)
5099 type = TREE_TYPE (type);
5101 /* Get the mode of the type being modified. */
5102 orig_mode = TYPE_MODE (type);
5104 if (TREE_CODE (type) == RECORD_TYPE
5105 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5106 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5107 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5109 error ("invalid vector type for attribute `%s'",
5110 IDENTIFIER_POINTER (name));
5114 /* Calculate how many units fit in the vector. */
5115 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5117 /* Find a suitably sized vector. */
5118 new_mode = VOIDmode;
5119 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5121 : MODE_VECTOR_FLOAT);
5123 mode = GET_MODE_WIDER_MODE (mode))
5124 if (vecsize == GET_MODE_SIZE (mode)
5125 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5131 if (new_mode == VOIDmode)
5133 error ("no vector mode with the size and type specified could be found");
5137 for (type_list_node = vector_type_node_list; type_list_node;
5138 type_list_node = TREE_CHAIN (type_list_node))
5140 tree other_type = TREE_VALUE (type_list_node);
5141 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5142 tree fields = TYPE_FIELDS (record);
5143 tree field_type = TREE_TYPE (fields);
5144 tree array_type = TREE_TYPE (field_type);
5145 if (TREE_CODE (fields) != FIELD_DECL
5146 || TREE_CODE (field_type) != ARRAY_TYPE)
5149 if (TYPE_MODE (other_type) == mode && type == array_type)
5151 new_type = other_type;
5156 if (new_type == NULL_TREE)
5158 tree index, array, rt, list_node;
5160 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5161 TREE_UNSIGNED (type));
5165 error ("no vector mode with the size and type specified could be found");
5169 new_type = build_type_copy (new_type);
5171 /* If this is a vector, make sure we either have hardware
5172 support, or we can emulate it. */
5173 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5174 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5175 && !vector_mode_valid_p (mode))
5177 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5181 /* Set the debug information here, because this is the only
5182 place where we know the underlying type for a vector made
5183 with vector_size. For debugging purposes we pretend a vector
5184 is an array within a structure. */
5185 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5186 array = build_array_type (type, build_index_type (index));
5187 rt = make_node (RECORD_TYPE);
5189 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5190 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5192 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5194 list_node = build_tree_list (NULL, new_type);
5195 TREE_CHAIN (list_node) = vector_type_node_list;
5196 vector_type_node_list = list_node;
5199 /* Build back pointers if needed. */
5200 *node = vector_size_helper (*node, new_type);
5205 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5208 If we requested a pointer to a vector, build up the pointers that
5209 we stripped off while looking for the inner type. Similarly for
5210 return values from functions.
5212 The argument "type" is the top of the chain, and "bottom" is the
5213 new type which we will point to. */
5216 vector_size_helper (tree type, tree bottom)
5220 if (POINTER_TYPE_P (type))
5222 inner = vector_size_helper (TREE_TYPE (type), bottom);
5223 outer = build_pointer_type (inner);
5225 else if (TREE_CODE (type) == ARRAY_TYPE)
5227 inner = vector_size_helper (TREE_TYPE (type), bottom);
5228 outer = build_array_type (inner, TYPE_VALUES (type));
5230 else if (TREE_CODE (type) == FUNCTION_TYPE)
5232 inner = vector_size_helper (TREE_TYPE (type), bottom);
5233 outer = build_function_type (inner, TYPE_VALUES (type));
5238 TREE_READONLY (outer) = TREE_READONLY (type);
5239 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5244 /* Handle the "nonnull" attribute. */
5246 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5247 tree args, int flags ATTRIBUTE_UNUSED,
5251 unsigned HOST_WIDE_INT attr_arg_num;
5253 /* If no arguments are specified, all pointer arguments should be
5254 non-null. Verify a full prototype is given so that the arguments
5255 will have the correct types when we actually check them later. */
5258 if (! TYPE_ARG_TYPES (type))
5260 error ("nonnull attribute without arguments on a non-prototype");
5261 *no_add_attrs = true;
5266 /* Argument list specified. Verify that each argument number references
5267 a pointer argument. */
5268 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5271 unsigned HOST_WIDE_INT arg_num, ck_num;
5273 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5275 error ("nonnull argument has invalid operand number (arg %lu)",
5276 (unsigned long) attr_arg_num);
5277 *no_add_attrs = true;
5281 argument = TYPE_ARG_TYPES (type);
5284 for (ck_num = 1; ; ck_num++)
5286 if (! argument || ck_num == arg_num)
5288 argument = TREE_CHAIN (argument);
5292 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5294 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5295 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5296 *no_add_attrs = true;
5300 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5302 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5303 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5304 *no_add_attrs = true;
5313 /* Check the argument list of a function call for null in argument slots
5314 that are marked as requiring a non-null pointer argument. */
5317 check_function_nonnull (tree attrs, tree params)
5319 tree a, args, param;
5322 for (a = attrs; a; a = TREE_CHAIN (a))
5324 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5326 args = TREE_VALUE (a);
5328 /* Walk the argument list. If we encounter an argument number we
5329 should check for non-null, do it. If the attribute has no args,
5330 then every pointer argument is checked (in which case the check
5331 for pointer type is done in check_nonnull_arg). */
5332 for (param = params, param_num = 1; ;
5333 param_num++, param = TREE_CHAIN (param))
5337 if (! args || nonnull_check_p (args, param_num))
5338 check_function_arguments_recurse (check_nonnull_arg, NULL,
5346 /* Helper for check_function_nonnull; given a list of operands which
5347 must be non-null in ARGS, determine if operand PARAM_NUM should be
5351 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5353 unsigned HOST_WIDE_INT arg_num;
5355 for (; args; args = TREE_CHAIN (args))
5357 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5360 if (arg_num == param_num)
5366 /* Check that the function argument PARAM (which is operand number
5367 PARAM_NUM) is non-null. This is called by check_function_nonnull
5368 via check_function_arguments_recurse. */
5371 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5372 unsigned HOST_WIDE_INT param_num)
5374 /* Just skip checking the argument if it's not a pointer. This can
5375 happen if the "nonnull" attribute was given without an operand
5376 list (which means to check every pointer argument). */
5378 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5381 if (integer_zerop (param))
5382 warning ("null argument where non-null required (arg %lu)",
5383 (unsigned long) param_num);
5386 /* Helper for nonnull attribute handling; fetch the operand number
5387 from the attribute argument list. */
5390 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5392 /* Strip any conversions from the arg number and verify they
5394 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5395 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5396 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5397 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5399 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5400 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5403 *valp = TREE_INT_CST_LOW (arg_num_expr);
5407 /* Handle a "nothrow" attribute; arguments as in
5408 struct attribute_spec.handler. */
5411 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5412 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5414 if (TREE_CODE (*node) == FUNCTION_DECL)
5415 TREE_NOTHROW (*node) = 1;
5416 /* ??? TODO: Support types. */
5419 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5420 *no_add_attrs = true;
5426 /* Handle a "cleanup" attribute; arguments as in
5427 struct attribute_spec.handler. */
5430 handle_cleanup_attribute (tree *node, tree name, tree args,
5431 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5434 tree cleanup_id, cleanup_decl;
5436 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5437 for global destructors in C++. This requires infrastructure that
5438 we don't have generically at the moment. It's also not a feature
5439 we'd be missing too much, since we do have attribute constructor. */
5440 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5442 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5443 *no_add_attrs = true;
5447 /* Verify that the argument is a function in scope. */
5448 /* ??? We could support pointers to functions here as well, if
5449 that was considered desirable. */
5450 cleanup_id = TREE_VALUE (args);
5451 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5453 error ("cleanup arg not an identifier");
5454 *no_add_attrs = true;
5457 cleanup_decl = lookup_name (cleanup_id);
5458 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5460 error ("cleanup arg not a function");
5461 *no_add_attrs = true;
5465 /* That the function has proper type is checked with the
5466 eventual call to build_function_call. */
5471 /* Check for valid arguments being passed to a function. */
5473 check_function_arguments (tree attrs, tree params)
5475 /* Check for null being passed in a pointer argument that must be
5476 non-null. We also need to do this if format checking is enabled. */
5479 check_function_nonnull (attrs, params);
5481 /* Check for errors in format strings. */
5484 check_function_format (NULL, attrs, params);
5487 /* Generic argument checking recursion routine. PARAM is the argument to
5488 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5489 once the argument is resolved. CTX is context for the callback. */
5491 check_function_arguments_recurse (void (*callback)
5492 (void *, tree, unsigned HOST_WIDE_INT),
5493 void *ctx, tree param,
5494 unsigned HOST_WIDE_INT param_num)
5496 if (TREE_CODE (param) == NOP_EXPR)
5498 /* Strip coercion. */
5499 check_function_arguments_recurse (callback, ctx,
5500 TREE_OPERAND (param, 0), param_num);
5504 if (TREE_CODE (param) == CALL_EXPR)
5506 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5508 bool found_format_arg = false;
5510 /* See if this is a call to a known internationalization function
5511 that modifies a format arg. Such a function may have multiple
5512 format_arg attributes (for example, ngettext). */
5514 for (attrs = TYPE_ATTRIBUTES (type);
5516 attrs = TREE_CHAIN (attrs))
5517 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5520 tree format_num_expr;
5524 /* Extract the argument number, which was previously checked
5526 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5527 while (TREE_CODE (format_num_expr) == NOP_EXPR
5528 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5529 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5530 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5532 if (TREE_CODE (format_num_expr) != INTEGER_CST
5533 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5536 format_num = TREE_INT_CST_LOW (format_num_expr);
5538 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5540 inner_args = TREE_CHAIN (inner_args), i++)
5541 if (i == format_num)
5543 check_function_arguments_recurse (callback, ctx,
5544 TREE_VALUE (inner_args),
5546 found_format_arg = true;
5551 /* If we found a format_arg attribute and did a recursive check,
5552 we are done with checking this argument. Otherwise, we continue
5553 and this will be considered a non-literal. */
5554 if (found_format_arg)
5558 if (TREE_CODE (param) == COND_EXPR)
5560 /* Check both halves of the conditional expression. */
5561 check_function_arguments_recurse (callback, ctx,
5562 TREE_OPERAND (param, 1), param_num);
5563 check_function_arguments_recurse (callback, ctx,
5564 TREE_OPERAND (param, 2), param_num);
5568 (*callback) (ctx, param, param_num);
5571 /* Function to help qsort sort FIELD_DECLs by name order. */
5574 field_decl_cmp (const void *x_p, const void *y_p)
5576 const tree *const x = x_p;
5577 const tree *const y = y_p;
5578 if (DECL_NAME (*x) == DECL_NAME (*y))
5579 /* A nontype is "greater" than a type. */
5580 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5581 if (DECL_NAME (*x) == NULL_TREE)
5583 if (DECL_NAME (*y) == NULL_TREE)
5585 if (DECL_NAME (*x) < DECL_NAME (*y))
5591 gt_pointer_operator new_value;
5595 /* This routine compares two fields like field_decl_cmp but using the
5596 pointer operator in resort_data. */
5599 resort_field_decl_cmp (const void *x_p, const void *y_p)
5601 const tree *const x = x_p;
5602 const tree *const y = y_p;
5604 if (DECL_NAME (*x) == DECL_NAME (*y))
5605 /* A nontype is "greater" than a type. */
5606 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5607 if (DECL_NAME (*x) == NULL_TREE)
5609 if (DECL_NAME (*y) == NULL_TREE)
5612 tree d1 = DECL_NAME (*x);
5613 tree d2 = DECL_NAME (*y);
5614 resort_data.new_value (&d1, resort_data.cookie);
5615 resort_data.new_value (&d2, resort_data.cookie);
5622 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5625 resort_sorted_fields (void *obj,
5626 void *orig_obj ATTRIBUTE_UNUSED ,
5627 gt_pointer_operator new_value,
5630 struct sorted_fields_type *sf = obj;
5631 resort_data.new_value = new_value;
5632 resort_data.cookie = cookie;
5633 qsort (&sf->elts[0], sf->len, sizeof (tree),
5634 resort_field_decl_cmp);
5637 /* Used by estimate_num_insns. Estimate number of instructions seen
5638 by given statement. */
5640 c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
5645 if (TYPE_P (x) || DECL_P (x))
5650 /* Assume that constants and references counts nothing. These should
5651 be majorized by amount of operations among them we count later
5652 and are common target of CSE and similar optimizations. */
5653 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
5654 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
5656 switch (TREE_CODE (x))
5658 /* Reconginze assignments of large structures and constructors of
5663 int size = int_size_in_bytes (TREE_TYPE (x));
5665 if (!size || size > MOVE_MAX_PIECES)
5668 *count += 2 * (size + MOVE_MAX - 1) / MOVE_MAX;
5672 /* Few special cases of expensive operations. This is usefull
5673 to avoid inlining on functions having too many of these. */
5674 case TRUNC_DIV_EXPR:
5676 case FLOOR_DIV_EXPR:
5677 case ROUND_DIV_EXPR:
5678 case TRUNC_MOD_EXPR:
5680 case FLOOR_MOD_EXPR:
5681 case ROUND_MOD_EXPR:
5686 /* Various containers that will produce no code themselves. */
5693 case IDENTIFIER_NODE:
5694 case PLACEHOLDER_EXPR:
5695 case WITH_CLEANUP_EXPR:
5696 case CLEANUP_POINT_EXPR:
5698 case VIEW_CONVERT_EXPR:
5704 case TRY_CATCH_EXPR:
5705 case TRY_FINALLY_EXPR:
5708 case LABELED_BLOCK_EXPR:
5709 case EXIT_BLOCK_EXPR:
5710 case EXPR_WITH_FILE_LOCATION:
5727 /* Do not account static initializers. */
5728 if (TREE_STATIC (TREE_OPERAND (x, 0)))
5737 /* Estimate number of instructions that will be created by expanding the body. */
5739 c_estimate_num_insns (tree decl)
5742 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl), c_estimate_num_insns_1, &num);
5746 /* Used by c_decl_uninit to find where expressions like x = x + 1; */
5749 c_decl_uninit_1 (tree *t, int *walk_sub_trees, void *x)
5751 /* If x = EXP(&x)EXP, then do not warn about the use of x. */
5752 if (TREE_CODE (*t) == ADDR_EXPR && TREE_OPERAND (*t, 0) == x)
5754 *walk_sub_trees = 0;
5762 /* Find out if a variable is uninitialized based on DECL_INITIAL. */
5765 c_decl_uninit (tree t)
5767 /* int x = x; is GCC extension to turn off this warning, only if warn_init_self is zero. */
5768 if (DECL_INITIAL (t) == t)
5769 return warn_init_self ? true : false;
5771 /* Walk the trees looking for the variable itself. */
5772 if (walk_tree_without_duplicates (&DECL_INITIAL (t), c_decl_uninit_1, t))
5777 #include "gt-c-common.h"