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 = "top level";
1083 if (current_function_decl)
1084 name = (*lang_hooks.decl_printable_name) (current_function_decl, vrb);
1089 /* Return the VAR_DECL for a const char array naming the current
1090 function. If the VAR_DECL has not yet been created, create it
1091 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1092 ID is its name (unfortunately C and C++ hold the RID values of
1093 keywords in different places, so we can't derive RID from ID in
1094 this language independent code. */
1097 fname_decl (unsigned int rid, tree id)
1100 tree decl = NULL_TREE;
1102 for (ix = 0; fname_vars[ix].decl; ix++)
1103 if (fname_vars[ix].rid == rid)
1106 decl = *fname_vars[ix].decl;
1109 tree saved_last_tree = last_tree;
1110 /* If a tree is built here, it would normally have the lineno of
1111 the current statement. Later this tree will be moved to the
1112 beginning of the function and this line number will be wrong.
1113 To avoid this problem set the lineno to 0 here; that prevents
1114 it from appearing in the RTL. */
1115 int saved_lineno = input_line;
1118 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1119 if (last_tree != saved_last_tree)
1121 /* We created some statement tree for the decl. This belongs
1122 at the start of the function, so remove it now and reinsert
1123 it after the function is complete. */
1124 tree stmts = TREE_CHAIN (saved_last_tree);
1126 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1127 last_tree = saved_last_tree;
1128 saved_function_name_decls = tree_cons (decl, stmts,
1129 saved_function_name_decls);
1131 *fname_vars[ix].decl = decl;
1132 input_line = saved_lineno;
1134 if (!ix && !current_function_decl)
1135 pedwarn ("%H'%D' is not defined outside of function scope",
1136 &DECL_SOURCE_LOCATION (decl), decl);
1141 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1144 fix_string_type (tree value)
1146 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1147 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1148 const int nchars_max = flag_isoc99 ? 4095 : 509;
1149 int length = TREE_STRING_LENGTH (value);
1152 /* Compute the number of elements, for the array type. */
1153 nchars = wide_flag ? length / wchar_bytes : length;
1155 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1156 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1157 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1159 /* Create the array type for the string constant.
1160 -Wwrite-strings says make the string constant an array of const char
1161 so that copying it to a non-const pointer will get a warning.
1162 For C++, this is the standard behavior. */
1163 if (flag_const_strings && ! flag_writable_strings)
1166 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1169 = build_array_type (elements,
1170 build_index_type (build_int_2 (nchars - 1, 0)));
1174 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1175 build_index_type (build_int_2 (nchars - 1, 0)));
1177 TREE_CONSTANT (value) = 1;
1178 TREE_READONLY (value) = ! flag_writable_strings;
1179 TREE_STATIC (value) = 1;
1183 /* Print a warning if a constant expression had overflow in folding.
1184 Invoke this function on every expression that the language
1185 requires to be a constant expression.
1186 Note the ANSI C standard says it is erroneous for a
1187 constant expression to overflow. */
1190 constant_expression_warning (tree value)
1192 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1193 || TREE_CODE (value) == VECTOR_CST
1194 || TREE_CODE (value) == COMPLEX_CST)
1195 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1196 pedwarn ("overflow in constant expression");
1199 /* Print a warning if an expression had overflow in folding.
1200 Invoke this function on every expression that
1201 (1) appears in the source code, and
1202 (2) might be a constant expression that overflowed, and
1203 (3) is not already checked by convert_and_check;
1204 however, do not invoke this function on operands of explicit casts. */
1207 overflow_warning (tree value)
1209 if ((TREE_CODE (value) == INTEGER_CST
1210 || (TREE_CODE (value) == COMPLEX_CST
1211 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1212 && TREE_OVERFLOW (value))
1214 TREE_OVERFLOW (value) = 0;
1215 if (skip_evaluation == 0)
1216 warning ("integer overflow in expression");
1218 else if ((TREE_CODE (value) == REAL_CST
1219 || (TREE_CODE (value) == COMPLEX_CST
1220 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1221 && TREE_OVERFLOW (value))
1223 TREE_OVERFLOW (value) = 0;
1224 if (skip_evaluation == 0)
1225 warning ("floating point overflow in expression");
1227 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1229 TREE_OVERFLOW (value) = 0;
1230 if (skip_evaluation == 0)
1231 warning ("vector overflow in expression");
1235 /* Print a warning if a large constant is truncated to unsigned,
1236 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1237 Invoke this function on every expression that might be implicitly
1238 converted to an unsigned type. */
1241 unsigned_conversion_warning (tree result, tree operand)
1243 tree type = TREE_TYPE (result);
1245 if (TREE_CODE (operand) == INTEGER_CST
1246 && TREE_CODE (type) == INTEGER_TYPE
1247 && TREE_UNSIGNED (type)
1248 && skip_evaluation == 0
1249 && !int_fits_type_p (operand, type))
1251 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1252 /* This detects cases like converting -129 or 256 to unsigned char. */
1253 warning ("large integer implicitly truncated to unsigned type");
1254 else if (warn_conversion)
1255 warning ("negative integer implicitly converted to unsigned type");
1259 /* Nonzero if constant C has a value that is permissible
1260 for type TYPE (an INTEGER_TYPE). */
1263 constant_fits_type_p (tree c, tree type)
1265 if (TREE_CODE (c) == INTEGER_CST)
1266 return int_fits_type_p (c, type);
1268 c = convert (type, c);
1269 return !TREE_OVERFLOW (c);
1272 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1273 Invoke this function on every expression that is converted implicitly,
1274 i.e. because of language rules and not because of an explicit cast. */
1277 convert_and_check (tree type, tree expr)
1279 tree t = convert (type, expr);
1280 if (TREE_CODE (t) == INTEGER_CST)
1282 if (TREE_OVERFLOW (t))
1284 TREE_OVERFLOW (t) = 0;
1286 /* Do not diagnose overflow in a constant expression merely
1287 because a conversion overflowed. */
1288 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1290 /* No warning for converting 0x80000000 to int. */
1291 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1292 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1293 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1294 /* If EXPR fits in the unsigned version of TYPE,
1295 don't warn unless pedantic. */
1297 || TREE_UNSIGNED (type)
1298 || ! constant_fits_type_p (expr,
1299 c_common_unsigned_type (type)))
1300 && skip_evaluation == 0)
1301 warning ("overflow in implicit constant conversion");
1304 unsigned_conversion_warning (t, expr);
1309 /* A node in a list that describes references to variables (EXPR), which are
1310 either read accesses if WRITER is zero, or write accesses, in which case
1311 WRITER is the parent of EXPR. */
1318 /* Used to implement a cache the results of a call to verify_tree. We only
1319 use this for SAVE_EXPRs. */
1322 struct tlist_cache *next;
1323 struct tlist *cache_before_sp;
1324 struct tlist *cache_after_sp;
1328 /* Obstack to use when allocating tlist structures, and corresponding
1330 static struct obstack tlist_obstack;
1331 static char *tlist_firstobj = 0;
1333 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1335 static struct tlist *warned_ids;
1336 /* SAVE_EXPRs need special treatment. We process them only once and then
1337 cache the results. */
1338 static struct tlist_cache *save_expr_cache;
1340 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1341 static void merge_tlist (struct tlist **, struct tlist *, int);
1342 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1343 static int warning_candidate_p (tree);
1344 static void warn_for_collisions (struct tlist *);
1345 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1346 static struct tlist *new_tlist (struct tlist *, tree, tree);
1347 static void verify_sequence_points (tree);
1349 /* Create a new struct tlist and fill in its fields. */
1350 static struct tlist *
1351 new_tlist (struct tlist *next, tree t, tree writer)
1354 l = obstack_alloc (&tlist_obstack, sizeof *l);
1361 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1362 is nonnull, we ignore any node we find which has a writer equal to it. */
1365 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1369 struct tlist *next = add->next;
1372 if (! exclude_writer || add->writer != exclude_writer)
1373 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1378 /* Merge the nodes of ADD into TO. This merging process is done so that for
1379 each variable that already exists in TO, no new node is added; however if
1380 there is a write access recorded in ADD, and an occurrence on TO is only
1381 a read access, then the occurrence in TO will be modified to record the
1385 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1387 struct tlist **end = to;
1390 end = &(*end)->next;
1396 struct tlist *next = add->next;
1398 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1399 if (tmp2->expr == add->expr)
1403 tmp2->writer = add->writer;
1407 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1408 end = &(*end)->next;
1415 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1416 references in list LIST conflict with it, excluding reads if ONLY writers
1420 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1425 /* Avoid duplicate warnings. */
1426 for (tmp = warned_ids; tmp; tmp = tmp->next)
1427 if (tmp->expr == written)
1432 if (list->expr == written
1433 && list->writer != writer
1434 && (! only_writes || list->writer))
1436 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1437 warning ("operation on `%s' may be undefined",
1438 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1444 /* Given a list LIST of references to variables, find whether any of these
1445 can cause conflicts due to missing sequence points. */
1448 warn_for_collisions (struct tlist *list)
1452 for (tmp = list; tmp; tmp = tmp->next)
1455 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1459 /* Return nonzero if X is a tree that can be verified by the sequence point
1462 warning_candidate_p (tree x)
1464 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1467 /* Walk the tree X, and record accesses to variables. If X is written by the
1468 parent tree, WRITER is the parent.
1469 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1470 expression or its only operand forces a sequence point, then everything up
1471 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1473 Once we return, we will have emitted warnings if any subexpression before
1474 such a sequence point could be undefined. On a higher level, however, the
1475 sequence point may not be relevant, and we'll merge the two lists.
1477 Example: (b++, a) + b;
1478 The call that processes the COMPOUND_EXPR will store the increment of B
1479 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1480 processes the PLUS_EXPR will need to merge the two lists so that
1481 eventually, all accesses end up on the same list (and we'll warn about the
1482 unordered subexpressions b++ and b.
1484 A note on merging. If we modify the former example so that our expression
1487 care must be taken not simply to add all three expressions into the final
1488 PNO_SP list. The function merge_tlist takes care of that by merging the
1489 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1490 way, so that no more than one access to B is recorded. */
1493 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1496 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1497 enum tree_code code;
1500 /* X may be NULL if it is the operand of an empty statement expression
1506 code = TREE_CODE (x);
1507 class = TREE_CODE_CLASS (code);
1509 if (warning_candidate_p (x))
1511 *pno_sp = new_tlist (*pno_sp, x, writer);
1521 case TRUTH_ANDIF_EXPR:
1522 case TRUTH_ORIF_EXPR:
1523 tmp_before = tmp_nosp = tmp_list3 = 0;
1524 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1525 warn_for_collisions (tmp_nosp);
1526 merge_tlist (pbefore_sp, tmp_before, 0);
1527 merge_tlist (pbefore_sp, tmp_nosp, 0);
1528 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1529 merge_tlist (pbefore_sp, tmp_list3, 0);
1533 tmp_before = tmp_list2 = 0;
1534 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1535 warn_for_collisions (tmp_list2);
1536 merge_tlist (pbefore_sp, tmp_before, 0);
1537 merge_tlist (pbefore_sp, tmp_list2, 1);
1539 tmp_list3 = tmp_nosp = 0;
1540 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1541 warn_for_collisions (tmp_nosp);
1542 merge_tlist (pbefore_sp, tmp_list3, 0);
1544 tmp_list3 = tmp_list2 = 0;
1545 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1546 warn_for_collisions (tmp_list2);
1547 merge_tlist (pbefore_sp, tmp_list3, 0);
1548 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1549 two first, to avoid warning for (a ? b++ : b++). */
1550 merge_tlist (&tmp_nosp, tmp_list2, 0);
1551 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1554 case PREDECREMENT_EXPR:
1555 case PREINCREMENT_EXPR:
1556 case POSTDECREMENT_EXPR:
1557 case POSTINCREMENT_EXPR:
1558 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1562 tmp_before = tmp_nosp = tmp_list3 = 0;
1563 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1564 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1565 /* Expressions inside the LHS are not ordered wrt. the sequence points
1566 in the RHS. Example:
1568 Despite the fact that the modification of "a" is in the before_sp
1569 list (tmp_before), it conflicts with the use of "a" in the LHS.
1570 We can handle this by adding the contents of tmp_list3
1571 to those of tmp_before, and redoing the collision warnings for that
1573 add_tlist (&tmp_before, tmp_list3, x, 1);
1574 warn_for_collisions (tmp_before);
1575 /* Exclude the LHS itself here; we first have to merge it into the
1576 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1577 didn't exclude the LHS, we'd get it twice, once as a read and once
1579 add_tlist (pno_sp, tmp_list3, x, 0);
1580 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1582 merge_tlist (pbefore_sp, tmp_before, 0);
1583 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1584 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1585 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1589 /* We need to warn about conflicts among arguments and conflicts between
1590 args and the function address. Side effects of the function address,
1591 however, are not ordered by the sequence point of the call. */
1592 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1593 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1594 if (TREE_OPERAND (x, 1))
1595 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1596 merge_tlist (&tmp_list3, tmp_list2, 0);
1597 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1598 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1599 warn_for_collisions (tmp_before);
1600 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1604 /* Scan all the list, e.g. indices of multi dimensional array. */
1607 tmp_before = tmp_nosp = 0;
1608 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1609 merge_tlist (&tmp_nosp, tmp_before, 0);
1610 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1617 struct tlist_cache *t;
1618 for (t = save_expr_cache; t; t = t->next)
1624 t = obstack_alloc (&tlist_obstack, sizeof *t);
1625 t->next = save_expr_cache;
1627 save_expr_cache = t;
1629 tmp_before = tmp_nosp = 0;
1630 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1631 warn_for_collisions (tmp_nosp);
1636 struct tlist *t = tmp_nosp;
1638 merge_tlist (&tmp_list3, t, 0);
1640 t->cache_before_sp = tmp_before;
1641 t->cache_after_sp = tmp_list3;
1643 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1644 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1653 if (first_rtl_op (code) == 0)
1655 x = TREE_OPERAND (x, 0);
1671 int max = first_rtl_op (TREE_CODE (x));
1672 for (lp = 0; lp < max; lp++)
1674 tmp_before = tmp_nosp = 0;
1675 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1676 merge_tlist (&tmp_nosp, tmp_before, 0);
1677 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1684 /* Try to warn for undefined behavior in EXPR due to missing sequence
1688 verify_sequence_points (tree expr)
1690 struct tlist *before_sp = 0, *after_sp = 0;
1693 save_expr_cache = 0;
1694 if (tlist_firstobj == 0)
1696 gcc_obstack_init (&tlist_obstack);
1697 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1700 verify_tree (expr, &before_sp, &after_sp, 0);
1701 warn_for_collisions (after_sp);
1702 obstack_free (&tlist_obstack, tlist_firstobj);
1706 c_expand_expr_stmt (tree expr)
1708 /* Do default conversion if safe and possibly important,
1709 in case within ({...}). */
1710 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1711 && (flag_isoc99 || lvalue_p (expr)))
1712 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1713 expr = default_conversion (expr);
1715 if (warn_sequence_point)
1716 verify_sequence_points (expr);
1718 if (TREE_TYPE (expr) != error_mark_node
1719 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1720 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1721 error ("expression statement has incomplete type");
1723 last_expr_type = TREE_TYPE (expr);
1724 return add_stmt (build_stmt (EXPR_STMT, expr));
1727 /* Validate the expression after `case' and apply default promotions. */
1730 check_case_value (tree value)
1732 if (value == NULL_TREE)
1735 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1736 STRIP_TYPE_NOPS (value);
1737 /* In C++, the following is allowed:
1740 switch (...) { case i: ... }
1742 So, we try to reduce the VALUE to a constant that way. */
1743 if (c_dialect_cxx ())
1745 value = decl_constant_value (value);
1746 STRIP_TYPE_NOPS (value);
1747 value = fold (value);
1750 if (TREE_CODE (value) != INTEGER_CST
1751 && value != error_mark_node)
1753 error ("case label does not reduce to an integer constant");
1754 value = error_mark_node;
1757 /* Promote char or short to int. */
1758 value = default_conversion (value);
1760 constant_expression_warning (value);
1765 /* Return an integer type with BITS bits of precision,
1766 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1769 c_common_type_for_size (unsigned int bits, int unsignedp)
1771 if (bits == TYPE_PRECISION (integer_type_node))
1772 return unsignedp ? unsigned_type_node : integer_type_node;
1774 if (bits == TYPE_PRECISION (signed_char_type_node))
1775 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1777 if (bits == TYPE_PRECISION (short_integer_type_node))
1778 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1780 if (bits == TYPE_PRECISION (long_integer_type_node))
1781 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1783 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1784 return (unsignedp ? long_long_unsigned_type_node
1785 : long_long_integer_type_node);
1787 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1788 return (unsignedp ? widest_unsigned_literal_type_node
1789 : widest_integer_literal_type_node);
1791 if (bits <= TYPE_PRECISION (intQI_type_node))
1792 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1794 if (bits <= TYPE_PRECISION (intHI_type_node))
1795 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1797 if (bits <= TYPE_PRECISION (intSI_type_node))
1798 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1800 if (bits <= TYPE_PRECISION (intDI_type_node))
1801 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1806 /* Return a data type that has machine mode MODE.
1807 If the mode is an integer,
1808 then UNSIGNEDP selects between signed and unsigned types. */
1811 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1813 if (mode == TYPE_MODE (integer_type_node))
1814 return unsignedp ? unsigned_type_node : integer_type_node;
1816 if (mode == TYPE_MODE (signed_char_type_node))
1817 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1819 if (mode == TYPE_MODE (short_integer_type_node))
1820 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1822 if (mode == TYPE_MODE (long_integer_type_node))
1823 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1825 if (mode == TYPE_MODE (long_long_integer_type_node))
1826 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1828 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1829 return unsignedp ? widest_unsigned_literal_type_node
1830 : widest_integer_literal_type_node;
1833 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1836 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1839 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1842 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1844 #if HOST_BITS_PER_WIDE_INT >= 64
1845 if (mode == TYPE_MODE (intTI_type_node))
1846 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1849 if (mode == TYPE_MODE (float_type_node))
1850 return float_type_node;
1852 if (mode == TYPE_MODE (double_type_node))
1853 return double_type_node;
1855 if (mode == TYPE_MODE (long_double_type_node))
1856 return long_double_type_node;
1858 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1859 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1861 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1862 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1867 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1869 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1871 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
1873 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
1875 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
1877 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
1879 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
1881 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
1883 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
1885 return V16SF_type_node;
1887 return V4SF_type_node;
1889 return V2SF_type_node;
1891 return V2DF_type_node;
1893 return V4DF_type_node;
1901 /* Return an unsigned type the same as TYPE in other respects. */
1903 c_common_unsigned_type (tree type)
1905 tree type1 = TYPE_MAIN_VARIANT (type);
1906 if (type1 == signed_char_type_node || type1 == char_type_node)
1907 return unsigned_char_type_node;
1908 if (type1 == integer_type_node)
1909 return unsigned_type_node;
1910 if (type1 == short_integer_type_node)
1911 return short_unsigned_type_node;
1912 if (type1 == long_integer_type_node)
1913 return long_unsigned_type_node;
1914 if (type1 == long_long_integer_type_node)
1915 return long_long_unsigned_type_node;
1916 if (type1 == widest_integer_literal_type_node)
1917 return widest_unsigned_literal_type_node;
1918 #if HOST_BITS_PER_WIDE_INT >= 64
1919 if (type1 == intTI_type_node)
1920 return unsigned_intTI_type_node;
1922 if (type1 == intDI_type_node)
1923 return unsigned_intDI_type_node;
1924 if (type1 == intSI_type_node)
1925 return unsigned_intSI_type_node;
1926 if (type1 == intHI_type_node)
1927 return unsigned_intHI_type_node;
1928 if (type1 == intQI_type_node)
1929 return unsigned_intQI_type_node;
1931 return c_common_signed_or_unsigned_type (1, type);
1934 /* Return a signed type the same as TYPE in other respects. */
1937 c_common_signed_type (tree type)
1939 tree type1 = TYPE_MAIN_VARIANT (type);
1940 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1941 return signed_char_type_node;
1942 if (type1 == unsigned_type_node)
1943 return integer_type_node;
1944 if (type1 == short_unsigned_type_node)
1945 return short_integer_type_node;
1946 if (type1 == long_unsigned_type_node)
1947 return long_integer_type_node;
1948 if (type1 == long_long_unsigned_type_node)
1949 return long_long_integer_type_node;
1950 if (type1 == widest_unsigned_literal_type_node)
1951 return widest_integer_literal_type_node;
1952 #if HOST_BITS_PER_WIDE_INT >= 64
1953 if (type1 == unsigned_intTI_type_node)
1954 return intTI_type_node;
1956 if (type1 == unsigned_intDI_type_node)
1957 return intDI_type_node;
1958 if (type1 == unsigned_intSI_type_node)
1959 return intSI_type_node;
1960 if (type1 == unsigned_intHI_type_node)
1961 return intHI_type_node;
1962 if (type1 == unsigned_intQI_type_node)
1963 return intQI_type_node;
1965 return c_common_signed_or_unsigned_type (0, type);
1968 /* Return a type the same as TYPE except unsigned or
1969 signed according to UNSIGNEDP. */
1972 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;
2009 /* Return the minimum number of bits needed to represent VALUE in a
2010 signed or unsigned type, UNSIGNEDP says which. */
2013 min_precision (tree value, int unsignedp)
2017 /* If the value is negative, compute its negative minus 1. The latter
2018 adjustment is because the absolute value of the largest negative value
2019 is one larger than the largest positive value. This is equivalent to
2020 a bit-wise negation, so use that operation instead. */
2022 if (tree_int_cst_sgn (value) < 0)
2023 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2025 /* Return the number of bits needed, taking into account the fact
2026 that we need one more bit for a signed than unsigned type. */
2028 if (integer_zerop (value))
2031 log = tree_floor_log2 (value);
2033 return log + 1 + ! unsignedp;
2036 /* Print an error message for invalid operands to arith operation
2037 CODE. NOP_EXPR is used as a special case (see
2038 c_common_truthvalue_conversion). */
2041 binary_op_error (enum tree_code code)
2048 error ("invalid truth-value expression");
2052 opname = "+"; break;
2054 opname = "-"; break;
2056 opname = "*"; break;
2058 opname = "max"; break;
2060 opname = "min"; break;
2062 opname = "=="; break;
2064 opname = "!="; break;
2066 opname = "<="; break;
2068 opname = ">="; break;
2070 opname = "<"; break;
2072 opname = ">"; break;
2074 opname = "<<"; break;
2076 opname = ">>"; break;
2077 case TRUNC_MOD_EXPR:
2078 case FLOOR_MOD_EXPR:
2079 opname = "%"; break;
2080 case TRUNC_DIV_EXPR:
2081 case FLOOR_DIV_EXPR:
2082 opname = "/"; break;
2084 opname = "&"; break;
2086 opname = "|"; break;
2087 case TRUTH_ANDIF_EXPR:
2088 opname = "&&"; break;
2089 case TRUTH_ORIF_EXPR:
2090 opname = "||"; break;
2092 opname = "^"; break;
2095 opname = "rotate"; break;
2097 opname = "unknown"; break;
2099 error ("invalid operands to binary %s", opname);
2102 /* Subroutine of build_binary_op, used for comparison operations.
2103 See if the operands have both been converted from subword integer types
2104 and, if so, perhaps change them both back to their original type.
2105 This function is also responsible for converting the two operands
2106 to the proper common type for comparison.
2108 The arguments of this function are all pointers to local variables
2109 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2110 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2112 If this function returns nonzero, it means that the comparison has
2113 a constant value. What this function returns is an expression for
2117 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2118 enum tree_code *rescode_ptr)
2121 tree op0 = *op0_ptr;
2122 tree op1 = *op1_ptr;
2123 int unsignedp0, unsignedp1;
2125 tree primop0, primop1;
2126 enum tree_code code = *rescode_ptr;
2128 /* Throw away any conversions to wider types
2129 already present in the operands. */
2131 primop0 = get_narrower (op0, &unsignedp0);
2132 primop1 = get_narrower (op1, &unsignedp1);
2134 /* Handle the case that OP0 does not *contain* a conversion
2135 but it *requires* conversion to FINAL_TYPE. */
2137 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2138 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2139 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2140 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2142 /* If one of the operands must be floated, we cannot optimize. */
2143 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2144 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2146 /* If first arg is constant, swap the args (changing operation
2147 so value is preserved), for canonicalization. Don't do this if
2148 the second arg is 0. */
2150 if (TREE_CONSTANT (primop0)
2151 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2154 int temi = unsignedp0;
2162 unsignedp0 = unsignedp1;
2185 *rescode_ptr = code;
2188 /* If comparing an integer against a constant more bits wide,
2189 maybe we can deduce a value of 1 or 0 independent of the data.
2190 Or else truncate the constant now
2191 rather than extend the variable at run time.
2193 This is only interesting if the constant is the wider arg.
2194 Also, it is not safe if the constant is unsigned and the
2195 variable arg is signed, since in this case the variable
2196 would be sign-extended and then regarded as unsigned.
2197 Our technique fails in this case because the lowest/highest
2198 possible unsigned results don't follow naturally from the
2199 lowest/highest possible values of the variable operand.
2200 For just EQ_EXPR and NE_EXPR there is another technique that
2201 could be used: see if the constant can be faithfully represented
2202 in the other operand's type, by truncating it and reextending it
2203 and see if that preserves the constant's value. */
2205 if (!real1 && !real2
2206 && TREE_CODE (primop1) == INTEGER_CST
2207 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2209 int min_gt, max_gt, min_lt, max_lt;
2210 tree maxval, minval;
2211 /* 1 if comparison is nominally unsigned. */
2212 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2215 type = c_common_signed_or_unsigned_type (unsignedp0,
2216 TREE_TYPE (primop0));
2218 /* In C, if TYPE is an enumeration, then we need to get its
2219 min/max values from it's underlying integral type, not the
2220 enumerated type itself. In C++, TYPE_MAX_VALUE and
2221 TYPE_MIN_VALUE have already been set correctly on the
2222 enumeration type. */
2223 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
2224 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2226 maxval = TYPE_MAX_VALUE (type);
2227 minval = TYPE_MIN_VALUE (type);
2229 if (unsignedp && !unsignedp0)
2230 *restype_ptr = c_common_signed_type (*restype_ptr);
2232 if (TREE_TYPE (primop1) != *restype_ptr)
2233 primop1 = convert (*restype_ptr, primop1);
2234 if (type != *restype_ptr)
2236 minval = convert (*restype_ptr, minval);
2237 maxval = convert (*restype_ptr, maxval);
2240 if (unsignedp && unsignedp0)
2242 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2243 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2244 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2245 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2249 min_gt = INT_CST_LT (primop1, minval);
2250 max_gt = INT_CST_LT (primop1, maxval);
2251 min_lt = INT_CST_LT (minval, primop1);
2252 max_lt = INT_CST_LT (maxval, primop1);
2256 /* This used to be a switch, but Genix compiler can't handle that. */
2257 if (code == NE_EXPR)
2259 if (max_lt || min_gt)
2260 val = truthvalue_true_node;
2262 else if (code == EQ_EXPR)
2264 if (max_lt || min_gt)
2265 val = truthvalue_false_node;
2267 else if (code == LT_EXPR)
2270 val = truthvalue_true_node;
2272 val = truthvalue_false_node;
2274 else if (code == GT_EXPR)
2277 val = truthvalue_true_node;
2279 val = truthvalue_false_node;
2281 else if (code == LE_EXPR)
2284 val = truthvalue_true_node;
2286 val = truthvalue_false_node;
2288 else if (code == GE_EXPR)
2291 val = truthvalue_true_node;
2293 val = truthvalue_false_node;
2296 /* If primop0 was sign-extended and unsigned comparison specd,
2297 we did a signed comparison above using the signed type bounds.
2298 But the comparison we output must be unsigned.
2300 Also, for inequalities, VAL is no good; but if the signed
2301 comparison had *any* fixed result, it follows that the
2302 unsigned comparison just tests the sign in reverse
2303 (positive values are LE, negative ones GE).
2304 So we can generate an unsigned comparison
2305 against an extreme value of the signed type. */
2307 if (unsignedp && !unsignedp0)
2314 primop1 = TYPE_MIN_VALUE (type);
2320 primop1 = TYPE_MAX_VALUE (type);
2327 type = c_common_unsigned_type (type);
2330 if (TREE_CODE (primop0) != INTEGER_CST)
2332 if (val == truthvalue_false_node)
2333 warning ("comparison is always false due to limited range of data type");
2334 if (val == truthvalue_true_node)
2335 warning ("comparison is always true due to limited range of data type");
2340 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2341 if (TREE_SIDE_EFFECTS (primop0))
2342 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2346 /* Value is not predetermined, but do the comparison
2347 in the type of the operand that is not constant.
2348 TYPE is already properly set. */
2350 else if (real1 && real2
2351 && (TYPE_PRECISION (TREE_TYPE (primop0))
2352 == TYPE_PRECISION (TREE_TYPE (primop1))))
2353 type = TREE_TYPE (primop0);
2355 /* If args' natural types are both narrower than nominal type
2356 and both extend in the same manner, compare them
2357 in the type of the wider arg.
2358 Otherwise must actually extend both to the nominal
2359 common type lest different ways of extending
2361 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2363 else if (unsignedp0 == unsignedp1 && real1 == real2
2364 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2365 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2367 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2368 type = c_common_signed_or_unsigned_type (unsignedp0
2369 || TREE_UNSIGNED (*restype_ptr),
2371 /* Make sure shorter operand is extended the right way
2372 to match the longer operand. */
2374 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2375 TREE_TYPE (primop0)),
2378 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2379 TREE_TYPE (primop1)),
2384 /* Here we must do the comparison on the nominal type
2385 using the args exactly as we received them. */
2386 type = *restype_ptr;
2390 if (!real1 && !real2 && integer_zerop (primop1)
2391 && TREE_UNSIGNED (*restype_ptr))
2397 /* All unsigned values are >= 0, so we warn if extra warnings
2398 are requested. However, if OP0 is a constant that is
2399 >= 0, the signedness of the comparison isn't an issue,
2400 so suppress the warning. */
2401 if (extra_warnings && !in_system_header
2402 && ! (TREE_CODE (primop0) == INTEGER_CST
2403 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2405 warning ("comparison of unsigned expression >= 0 is always true");
2406 value = truthvalue_true_node;
2410 if (extra_warnings && !in_system_header
2411 && ! (TREE_CODE (primop0) == INTEGER_CST
2412 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2414 warning ("comparison of unsigned expression < 0 is always false");
2415 value = truthvalue_false_node;
2424 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2425 if (TREE_SIDE_EFFECTS (primop0))
2426 return build (COMPOUND_EXPR, TREE_TYPE (value),
2433 *op0_ptr = convert (type, primop0);
2434 *op1_ptr = convert (type, primop1);
2436 *restype_ptr = truthvalue_type_node;
2441 /* Return a tree for the sum or difference (RESULTCODE says which)
2442 of pointer PTROP and integer INTOP. */
2445 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2452 /* The result is a pointer of the same type that is being added. */
2454 tree result_type = TREE_TYPE (ptrop);
2456 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2458 if (pedantic || warn_pointer_arith)
2459 pedwarn ("pointer of type `void *' used in arithmetic");
2460 size_exp = integer_one_node;
2462 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2464 if (pedantic || warn_pointer_arith)
2465 pedwarn ("pointer to a function used in arithmetic");
2466 size_exp = integer_one_node;
2468 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2470 if (pedantic || warn_pointer_arith)
2471 pedwarn ("pointer to member function used in arithmetic");
2472 size_exp = integer_one_node;
2474 else if (TREE_CODE (TREE_TYPE (result_type)) == OFFSET_TYPE)
2476 if (pedantic || warn_pointer_arith)
2477 pedwarn ("pointer to a member used in arithmetic");
2478 size_exp = integer_one_node;
2481 size_exp = size_in_bytes (TREE_TYPE (result_type));
2483 /* If what we are about to multiply by the size of the elements
2484 contains a constant term, apply distributive law
2485 and multiply that constant term separately.
2486 This helps produce common subexpressions. */
2488 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2489 && ! TREE_CONSTANT (intop)
2490 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2491 && TREE_CONSTANT (size_exp)
2492 /* If the constant comes from pointer subtraction,
2493 skip this optimization--it would cause an error. */
2494 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2495 /* If the constant is unsigned, and smaller than the pointer size,
2496 then we must skip this optimization. This is because it could cause
2497 an overflow error if the constant is negative but INTOP is not. */
2498 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2499 || (TYPE_PRECISION (TREE_TYPE (intop))
2500 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2502 enum tree_code subcode = resultcode;
2503 tree int_type = TREE_TYPE (intop);
2504 if (TREE_CODE (intop) == MINUS_EXPR)
2505 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2506 /* Convert both subexpression types to the type of intop,
2507 because weird cases involving pointer arithmetic
2508 can result in a sum or difference with different type args. */
2509 ptrop = build_binary_op (subcode, ptrop,
2510 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2511 intop = convert (int_type, TREE_OPERAND (intop, 0));
2514 /* Convert the integer argument to a type the same size as sizetype
2515 so the multiply won't overflow spuriously. */
2517 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2518 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2519 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2520 TREE_UNSIGNED (sizetype)), intop);
2522 /* Replace the integer argument with a suitable product by the object size.
2523 Do this multiplication as signed, then convert to the appropriate
2524 pointer type (actually unsigned integral). */
2526 intop = convert (result_type,
2527 build_binary_op (MULT_EXPR, intop,
2528 convert (TREE_TYPE (intop), size_exp), 1));
2530 /* Create the sum or difference. */
2532 result = build (resultcode, result_type, ptrop, intop);
2534 folded = fold (result);
2535 if (folded == result)
2536 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2540 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2541 or validate its data type for an `if' or `while' statement or ?..: exp.
2543 This preparation consists of taking the ordinary
2544 representation of an expression expr and producing a valid tree
2545 boolean expression describing whether expr is nonzero. We could
2546 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2547 but we optimize comparisons, &&, ||, and !.
2549 The resulting type should always be `truthvalue_type_node'. */
2552 c_common_truthvalue_conversion (tree expr)
2554 if (TREE_CODE (expr) == ERROR_MARK)
2557 #if 0 /* This appears to be wrong for C++. */
2558 /* These really should return error_mark_node after 2.4 is stable.
2559 But not all callers handle ERROR_MARK properly. */
2560 switch (TREE_CODE (TREE_TYPE (expr)))
2563 error ("struct type value used where scalar is required");
2564 return truthvalue_false_node;
2567 error ("union type value used where scalar is required");
2568 return truthvalue_false_node;
2571 error ("array type value used where scalar is required");
2572 return truthvalue_false_node;
2579 switch (TREE_CODE (expr))
2582 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2583 case TRUTH_ANDIF_EXPR:
2584 case TRUTH_ORIF_EXPR:
2585 case TRUTH_AND_EXPR:
2587 case TRUTH_XOR_EXPR:
2588 case TRUTH_NOT_EXPR:
2589 TREE_TYPE (expr) = truthvalue_type_node;
2596 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2599 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2602 /* If we are taking the address of an external decl, it might be zero
2603 if it is weak, so we cannot optimize. */
2604 if (DECL_P (TREE_OPERAND (expr, 0))
2605 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2608 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2609 return build (COMPOUND_EXPR, truthvalue_type_node,
2610 TREE_OPERAND (expr, 0), truthvalue_true_node);
2612 return truthvalue_true_node;
2615 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2616 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2617 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2618 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2626 /* These don't change whether an object is nonzero or zero. */
2627 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2631 /* These don't change whether an object is zero or nonzero, but
2632 we can't ignore them if their second arg has side-effects. */
2633 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2634 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2635 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2637 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2640 /* Distribute the conversion into the arms of a COND_EXPR. */
2641 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2642 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2643 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2646 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2647 since that affects how `default_conversion' will behave. */
2648 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2649 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2651 /* Fall through.... */
2653 /* If this is widening the argument, we can ignore it. */
2654 if (TYPE_PRECISION (TREE_TYPE (expr))
2655 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2656 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2660 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2661 aren't guaranteed to the be same for modes that can represent
2662 infinity, since if x and y are both +infinity, or both
2663 -infinity, then x - y is not a number.
2665 Note that this transformation is safe when x or y is NaN.
2666 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2668 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2670 /* Fall through.... */
2672 /* This and MINUS_EXPR can be changed into a comparison of the
2674 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2675 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2676 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2677 TREE_OPERAND (expr, 1), 1);
2678 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2679 fold (build1 (NOP_EXPR,
2680 TREE_TYPE (TREE_OPERAND (expr, 0)),
2681 TREE_OPERAND (expr, 1))), 1);
2684 if (integer_onep (TREE_OPERAND (expr, 1))
2685 && TREE_TYPE (expr) != truthvalue_type_node)
2686 /* Using convert here would cause infinite recursion. */
2687 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2691 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2692 warning ("suggest parentheses around assignment used as truth value");
2699 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2701 tree t = save_expr (expr);
2702 return (build_binary_op
2703 ((TREE_SIDE_EFFECTS (expr)
2704 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2705 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2706 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2710 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2713 static tree builtin_function_2 (const char *, const char *, tree, tree,
2714 int, enum built_in_class, int, int,
2717 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2718 down to the element type of an array. */
2721 c_build_qualified_type (tree type, int type_quals)
2723 /* A restrict-qualified pointer type must be a pointer to object or
2724 incomplete type. Note that the use of POINTER_TYPE_P also allows
2725 REFERENCE_TYPEs, which is appropriate for C++. Unfortunately,
2726 the C++ front-end also use POINTER_TYPE for pointer-to-member
2727 values, so even though it should be illegal to use `restrict'
2728 with such an entity we don't flag that here. Thus, special case
2729 code for that case is required in the C++ front-end. */
2730 if ((type_quals & TYPE_QUAL_RESTRICT)
2731 && (!POINTER_TYPE_P (type)
2732 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2734 error ("invalid use of `restrict'");
2735 type_quals &= ~TYPE_QUAL_RESTRICT;
2738 if (TREE_CODE (type) == ARRAY_TYPE)
2739 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2741 TYPE_DOMAIN (type));
2742 return build_qualified_type (type, type_quals);
2745 /* Apply the TYPE_QUALS to the new DECL. */
2748 c_apply_type_quals_to_decl (int type_quals, tree decl)
2750 if ((type_quals & TYPE_QUAL_CONST)
2751 || (TREE_TYPE (decl)
2752 && TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE))
2753 TREE_READONLY (decl) = 1;
2754 if (type_quals & TYPE_QUAL_VOLATILE)
2756 TREE_SIDE_EFFECTS (decl) = 1;
2757 TREE_THIS_VOLATILE (decl) = 1;
2759 if (type_quals & TYPE_QUAL_RESTRICT)
2761 if (!TREE_TYPE (decl)
2762 || !POINTER_TYPE_P (TREE_TYPE (decl))
2763 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (TREE_TYPE (decl))))
2764 error ("invalid use of `restrict'");
2765 else if (flag_strict_aliasing)
2766 /* Indicate we need to make a unique alias set for this pointer.
2767 We can't do it here because it might be pointing to an
2769 DECL_POINTER_ALIAS_SET (decl) = -2;
2773 /* Return the typed-based alias set for T, which may be an expression
2774 or a type. Return -1 if we don't do anything special. */
2777 c_common_get_alias_set (tree t)
2781 /* Permit type-punning when accessing a union, provided the access
2782 is directly through the union. For example, this code does not
2783 permit taking the address of a union member and then storing
2784 through it. Even the type-punning allowed here is a GCC
2785 extension, albeit a common and useful one; the C standard says
2786 that such accesses have implementation-defined behavior. */
2788 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2789 u = TREE_OPERAND (u, 0))
2790 if (TREE_CODE (u) == COMPONENT_REF
2791 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2794 /* That's all the expressions we handle specially. */
2798 /* The C standard guarantees that any object may be accessed via an
2799 lvalue that has character type. */
2800 if (t == char_type_node
2801 || t == signed_char_type_node
2802 || t == unsigned_char_type_node)
2805 /* If it has the may_alias attribute, it can alias anything. */
2806 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2809 /* The C standard specifically allows aliasing between signed and
2810 unsigned variants of the same type. We treat the signed
2811 variant as canonical. */
2812 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2814 tree t1 = c_common_signed_type (t);
2816 /* t1 == t can happen for boolean nodes which are always unsigned. */
2818 return get_alias_set (t1);
2820 else if (POINTER_TYPE_P (t))
2824 /* Unfortunately, there is no canonical form of a pointer type.
2825 In particular, if we have `typedef int I', then `int *', and
2826 `I *' are different types. So, we have to pick a canonical
2827 representative. We do this below.
2829 Technically, this approach is actually more conservative that
2830 it needs to be. In particular, `const int *' and `int *'
2831 should be in different alias sets, according to the C and C++
2832 standard, since their types are not the same, and so,
2833 technically, an `int **' and `const int **' cannot point at
2836 But, the standard is wrong. In particular, this code is
2841 const int* const* cipp = &ipp;
2843 And, it doesn't make sense for that to be legal unless you
2844 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2845 the pointed-to types. This issue has been reported to the
2847 t1 = build_type_no_quals (t);
2849 return get_alias_set (t1);
2855 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2856 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2857 flag controls whether we should diagnose possibly ill-formed
2858 constructs or not. */
2860 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2862 const char *op_name;
2864 enum tree_code type_code = TREE_CODE (type);
2866 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2867 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2869 if (type_code == FUNCTION_TYPE)
2871 if (op == SIZEOF_EXPR)
2873 if (complain && (pedantic || warn_pointer_arith))
2874 pedwarn ("invalid application of `sizeof' to a function type");
2875 value = size_one_node;
2878 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2880 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2882 if (type_code == VOID_TYPE
2883 && complain && (pedantic || warn_pointer_arith))
2884 pedwarn ("invalid application of `%s' to a void type", op_name);
2885 value = size_one_node;
2887 else if (!COMPLETE_TYPE_P (type))
2890 error ("invalid application of `%s' to an incomplete type", op_name);
2891 value = size_zero_node;
2895 if (op == SIZEOF_EXPR)
2896 /* Convert in case a char is more than one unit. */
2897 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2898 size_int (TYPE_PRECISION (char_type_node)
2901 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2904 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2905 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2906 never happen. However, this node should really have type
2907 `size_t', which is just a typedef for an ordinary integer type. */
2908 value = fold (build1 (NOP_EXPR, size_type_node, value));
2909 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2914 /* Implement the __alignof keyword: Return the minimum required
2915 alignment of EXPR, measured in bytes. For VAR_DECL's and
2916 FIELD_DECL's return DECL_ALIGN (which can be set from an
2917 "aligned" __attribute__ specification). */
2920 c_alignof_expr (tree expr)
2924 if (TREE_CODE (expr) == VAR_DECL)
2925 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2927 else if (TREE_CODE (expr) == COMPONENT_REF
2928 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2930 error ("`__alignof' applied to a bit-field");
2933 else if (TREE_CODE (expr) == COMPONENT_REF
2934 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2935 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
2937 else if (TREE_CODE (expr) == INDIRECT_REF)
2939 tree t = TREE_OPERAND (expr, 0);
2941 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2943 while (TREE_CODE (t) == NOP_EXPR
2944 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2948 t = TREE_OPERAND (t, 0);
2949 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2950 if (thisalign > bestalign)
2951 best = t, bestalign = thisalign;
2953 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2956 return c_alignof (TREE_TYPE (expr));
2958 return fold (build1 (NOP_EXPR, size_type_node, t));
2961 /* Handle C and C++ default attributes. */
2963 enum built_in_attribute
2965 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2966 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2967 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2968 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2969 #include "builtin-attrs.def"
2970 #undef DEF_ATTR_NULL_TREE
2972 #undef DEF_ATTR_IDENT
2973 #undef DEF_ATTR_TREE_LIST
2977 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
2979 static void c_init_attributes (void);
2981 /* Build tree nodes and builtin functions common to both C and C++ language
2985 c_common_nodes_and_builtins (void)
2989 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2990 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2991 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2992 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2993 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2994 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2995 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2996 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2997 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2998 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2999 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3000 #include "builtin-types.def"
3001 #undef DEF_PRIMITIVE_TYPE
3002 #undef DEF_FUNCTION_TYPE_0
3003 #undef DEF_FUNCTION_TYPE_1
3004 #undef DEF_FUNCTION_TYPE_2
3005 #undef DEF_FUNCTION_TYPE_3
3006 #undef DEF_FUNCTION_TYPE_4
3007 #undef DEF_FUNCTION_TYPE_VAR_0
3008 #undef DEF_FUNCTION_TYPE_VAR_1
3009 #undef DEF_FUNCTION_TYPE_VAR_2
3010 #undef DEF_FUNCTION_TYPE_VAR_3
3011 #undef DEF_POINTER_TYPE
3015 typedef enum builtin_type builtin_type;
3017 tree builtin_types[(int) BT_LAST];
3018 int wchar_type_size;
3019 tree array_domain_type;
3020 tree va_list_ref_type_node;
3021 tree va_list_arg_type_node;
3023 /* Define `int' and `char' first so that dbx will output them first. */
3024 record_builtin_type (RID_INT, NULL, integer_type_node);
3025 record_builtin_type (RID_CHAR, "char", char_type_node);
3027 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3028 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3029 but not C. Are the conditionals here needed? */
3030 if (c_dialect_cxx ())
3031 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3032 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3033 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3034 record_builtin_type (RID_MAX, "long unsigned int",
3035 long_unsigned_type_node);
3036 if (c_dialect_cxx ())
3037 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3038 record_builtin_type (RID_MAX, "long long int",
3039 long_long_integer_type_node);
3040 record_builtin_type (RID_MAX, "long long unsigned int",
3041 long_long_unsigned_type_node);
3042 if (c_dialect_cxx ())
3043 record_builtin_type (RID_MAX, "long long unsigned",
3044 long_long_unsigned_type_node);
3045 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3046 record_builtin_type (RID_MAX, "short unsigned int",
3047 short_unsigned_type_node);
3048 if (c_dialect_cxx ())
3049 record_builtin_type (RID_MAX, "unsigned short",
3050 short_unsigned_type_node);
3052 /* Define both `signed char' and `unsigned char'. */
3053 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3054 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3056 /* These are types that c_common_type_for_size and
3057 c_common_type_for_mode use. */
3058 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3060 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3062 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3064 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3066 #if HOST_BITS_PER_WIDE_INT >= 64
3067 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3068 get_identifier ("__int128_t"),
3071 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3072 unsigned_intQI_type_node));
3073 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3074 unsigned_intHI_type_node));
3075 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3076 unsigned_intSI_type_node));
3077 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3078 unsigned_intDI_type_node));
3079 #if HOST_BITS_PER_WIDE_INT >= 64
3080 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3081 get_identifier ("__uint128_t"),
3082 unsigned_intTI_type_node));
3085 /* Create the widest literal types. */
3086 widest_integer_literal_type_node
3087 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3088 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3089 widest_integer_literal_type_node));
3091 widest_unsigned_literal_type_node
3092 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3093 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3094 widest_unsigned_literal_type_node));
3096 /* `unsigned long' is the standard type for sizeof.
3097 Note that stddef.h uses `unsigned long',
3098 and this must agree, even if long and int are the same size. */
3100 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3101 signed_size_type_node = c_common_signed_type (size_type_node);
3102 set_sizetype (size_type_node);
3104 build_common_tree_nodes_2 (flag_short_double);
3106 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3107 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3108 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3110 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3111 get_identifier ("complex int"),
3112 complex_integer_type_node));
3113 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3114 get_identifier ("complex float"),
3115 complex_float_type_node));
3116 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3117 get_identifier ("complex double"),
3118 complex_double_type_node));
3119 (*lang_hooks.decls.pushdecl)
3120 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3121 complex_long_double_type_node));
3123 /* Types which are common to the fortran compiler and libf2c. When
3124 changing these, you also need to be concerned with f/com.h. */
3126 if (TYPE_PRECISION (float_type_node)
3127 == TYPE_PRECISION (long_integer_type_node))
3129 g77_integer_type_node = long_integer_type_node;
3130 g77_uinteger_type_node = long_unsigned_type_node;
3132 else if (TYPE_PRECISION (float_type_node)
3133 == TYPE_PRECISION (integer_type_node))
3135 g77_integer_type_node = integer_type_node;
3136 g77_uinteger_type_node = unsigned_type_node;
3139 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3141 if (g77_integer_type_node != NULL_TREE)
3143 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3144 get_identifier ("__g77_integer"),
3145 g77_integer_type_node));
3146 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3147 get_identifier ("__g77_uinteger"),
3148 g77_uinteger_type_node));
3151 if (TYPE_PRECISION (float_type_node) * 2
3152 == TYPE_PRECISION (long_integer_type_node))
3154 g77_longint_type_node = long_integer_type_node;
3155 g77_ulongint_type_node = long_unsigned_type_node;
3157 else if (TYPE_PRECISION (float_type_node) * 2
3158 == TYPE_PRECISION (long_long_integer_type_node))
3160 g77_longint_type_node = long_long_integer_type_node;
3161 g77_ulongint_type_node = long_long_unsigned_type_node;
3164 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3166 if (g77_longint_type_node != NULL_TREE)
3168 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3169 get_identifier ("__g77_longint"),
3170 g77_longint_type_node));
3171 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3172 get_identifier ("__g77_ulongint"),
3173 g77_ulongint_type_node));
3176 record_builtin_type (RID_VOID, NULL, void_type_node);
3178 void_zero_node = build_int_2 (0, 0);
3179 TREE_TYPE (void_zero_node) = void_type_node;
3181 void_list_node = build_void_list_node ();
3183 /* Make a type to be the domain of a few array types
3184 whose domains don't really matter.
3185 200 is small enough that it always fits in size_t
3186 and large enough that it can hold most function names for the
3187 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3188 array_domain_type = build_index_type (size_int (200));
3190 /* Make a type for arrays of characters.
3191 With luck nothing will ever really depend on the length of this
3193 char_array_type_node
3194 = build_array_type (char_type_node, array_domain_type);
3196 /* Likewise for arrays of ints. */
3198 = build_array_type (integer_type_node, array_domain_type);
3200 string_type_node = build_pointer_type (char_type_node);
3201 const_string_type_node
3202 = build_pointer_type (build_qualified_type
3203 (char_type_node, TYPE_QUAL_CONST));
3205 /* This is special for C++ so functions can be overloaded. */
3206 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3207 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3208 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3209 if (c_dialect_cxx ())
3211 if (TREE_UNSIGNED (wchar_type_node))
3212 wchar_type_node = make_unsigned_type (wchar_type_size);
3214 wchar_type_node = make_signed_type (wchar_type_size);
3215 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3219 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3220 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3223 /* This is for wide string constants. */
3224 wchar_array_type_node
3225 = build_array_type (wchar_type_node, array_domain_type);
3228 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3231 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3233 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3235 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3237 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3238 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3240 (*lang_hooks.decls.pushdecl)
3241 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3242 va_list_type_node));
3244 (*lang_hooks.decls.pushdecl)
3245 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3246 ptrdiff_type_node));
3248 (*lang_hooks.decls.pushdecl)
3249 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3252 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3254 va_list_arg_type_node = va_list_ref_type_node =
3255 build_pointer_type (TREE_TYPE (va_list_type_node));
3259 va_list_arg_type_node = va_list_type_node;
3260 va_list_ref_type_node = build_reference_type (va_list_type_node);
3263 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3264 builtin_types[(int) ENUM] = VALUE;
3265 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3266 builtin_types[(int) ENUM] \
3267 = build_function_type (builtin_types[(int) RETURN], \
3269 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3270 builtin_types[(int) ENUM] \
3271 = build_function_type (builtin_types[(int) RETURN], \
3272 tree_cons (NULL_TREE, \
3273 builtin_types[(int) ARG1], \
3275 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3276 builtin_types[(int) ENUM] \
3277 = build_function_type \
3278 (builtin_types[(int) RETURN], \
3279 tree_cons (NULL_TREE, \
3280 builtin_types[(int) ARG1], \
3281 tree_cons (NULL_TREE, \
3282 builtin_types[(int) ARG2], \
3284 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3285 builtin_types[(int) ENUM] \
3286 = build_function_type \
3287 (builtin_types[(int) RETURN], \
3288 tree_cons (NULL_TREE, \
3289 builtin_types[(int) ARG1], \
3290 tree_cons (NULL_TREE, \
3291 builtin_types[(int) ARG2], \
3292 tree_cons (NULL_TREE, \
3293 builtin_types[(int) ARG3], \
3295 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3296 builtin_types[(int) ENUM] \
3297 = build_function_type \
3298 (builtin_types[(int) RETURN], \
3299 tree_cons (NULL_TREE, \
3300 builtin_types[(int) ARG1], \
3301 tree_cons (NULL_TREE, \
3302 builtin_types[(int) ARG2], \
3305 builtin_types[(int) ARG3], \
3306 tree_cons (NULL_TREE, \
3307 builtin_types[(int) ARG4], \
3308 void_list_node)))));
3309 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3310 builtin_types[(int) ENUM] \
3311 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3312 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3313 builtin_types[(int) ENUM] \
3314 = build_function_type (builtin_types[(int) RETURN], \
3315 tree_cons (NULL_TREE, \
3316 builtin_types[(int) ARG1], \
3319 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3320 builtin_types[(int) ENUM] \
3321 = build_function_type \
3322 (builtin_types[(int) RETURN], \
3323 tree_cons (NULL_TREE, \
3324 builtin_types[(int) ARG1], \
3325 tree_cons (NULL_TREE, \
3326 builtin_types[(int) ARG2], \
3329 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3330 builtin_types[(int) ENUM] \
3331 = build_function_type \
3332 (builtin_types[(int) RETURN], \
3333 tree_cons (NULL_TREE, \
3334 builtin_types[(int) ARG1], \
3335 tree_cons (NULL_TREE, \
3336 builtin_types[(int) ARG2], \
3337 tree_cons (NULL_TREE, \
3338 builtin_types[(int) ARG3], \
3341 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3342 builtin_types[(int) ENUM] \
3343 = build_pointer_type (builtin_types[(int) TYPE]);
3344 #include "builtin-types.def"
3345 #undef DEF_PRIMITIVE_TYPE
3346 #undef DEF_FUNCTION_TYPE_1
3347 #undef DEF_FUNCTION_TYPE_2
3348 #undef DEF_FUNCTION_TYPE_3
3349 #undef DEF_FUNCTION_TYPE_4
3350 #undef DEF_FUNCTION_TYPE_VAR_0
3351 #undef DEF_FUNCTION_TYPE_VAR_1
3352 #undef DEF_FUNCTION_TYPE_VAR_2
3353 #undef DEF_FUNCTION_TYPE_VAR_3
3354 #undef DEF_POINTER_TYPE
3356 c_init_attributes ();
3358 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3359 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3364 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3368 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3371 ? (NAME + strlen ("__builtin_")) \
3373 built_in_attributes[(int) ATTRS]); \
3375 decl = builtin_function_2 (NAME, \
3376 NAME + strlen ("__builtin_"), \
3377 builtin_types[TYPE], \
3378 builtin_types[LIBTYPE], \
3383 built_in_attributes[(int) ATTRS]); \
3385 built_in_decls[(int) ENUM] = decl; \
3387 implicit_built_in_decls[(int) ENUM] = decl; \
3389 #include "builtins.def"
3392 (*targetm.init_builtins) ();
3394 main_identifier_node = get_identifier ("main");
3398 build_va_arg (tree expr, tree type)
3400 return build1 (VA_ARG_EXPR, type, expr);
3404 /* Linked list of disabled built-in functions. */
3406 typedef struct disabled_builtin
3409 struct disabled_builtin *next;
3411 static disabled_builtin *disabled_builtins = NULL;
3413 static bool builtin_function_disabled_p (const char *);
3415 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3416 begins with "__builtin_", give an error. */
3419 disable_builtin_function (const char *name)
3421 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3422 error ("cannot disable built-in function `%s'", name);
3425 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3427 new->next = disabled_builtins;
3428 disabled_builtins = new;
3433 /* Return true if the built-in function NAME has been disabled, false
3437 builtin_function_disabled_p (const char *name)
3439 disabled_builtin *p;
3440 for (p = disabled_builtins; p != NULL; p = p->next)
3442 if (strcmp (name, p->name) == 0)
3449 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3450 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3451 of these may be NULL (though both being NULL is useless).
3452 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3453 TYPE is the type of the function with the ordinary name. These
3454 may differ if the ordinary name is declared with a looser type to avoid
3455 conflicts with headers. FUNCTION_CODE and CLASS are as for
3456 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3457 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3458 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3459 ATTRS is the tree list representing the builtin's function attributes.
3460 Returns the declaration of BUILTIN_NAME, if any, otherwise
3461 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3462 or if NONANSI_P and flag_no_nonansi_builtin. */
3465 builtin_function_2 (const char *builtin_name, const char *name,
3466 tree builtin_type, tree type, int function_code,
3467 enum built_in_class class, int library_name_p,
3468 int nonansi_p, tree attrs)
3470 tree bdecl = NULL_TREE;
3471 tree decl = NULL_TREE;
3473 if (builtin_name != 0)
3474 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3475 class, library_name_p ? name : NULL, attrs);
3477 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3478 && !(nonansi_p && flag_no_nonansi_builtin))
3479 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3481 return (bdecl != 0 ? bdecl : decl);
3484 /* Nonzero if the type T promotes to int. This is (nearly) the
3485 integral promotions defined in ISO C99 6.3.1.1/2. */
3488 c_promoting_integer_type_p (tree t)
3490 switch (TREE_CODE (t))
3493 return (TYPE_MAIN_VARIANT (t) == char_type_node
3494 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3495 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3496 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3497 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3498 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3501 /* ??? Technically all enumerations not larger than an int
3502 promote to an int. But this is used along code paths
3503 that only want to notice a size change. */
3504 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3514 /* Return 1 if PARMS specifies a fixed number of parameters
3515 and none of their types is affected by default promotions. */
3518 self_promoting_args_p (tree parms)
3521 for (t = parms; t; t = TREE_CHAIN (t))
3523 tree type = TREE_VALUE (t);
3525 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3531 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3534 if (c_promoting_integer_type_p (type))
3540 /* Recursively examines the array elements of TYPE, until a non-array
3541 element type is found. */
3544 strip_array_types (tree type)
3546 while (TREE_CODE (type) == ARRAY_TYPE)
3547 type = TREE_TYPE (type);
3552 /* Recursively remove any '*' or '&' operator from TYPE. */
3554 strip_pointer_operator (tree t)
3556 while (POINTER_TYPE_P (t))
3561 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3563 /* Expand a call to an unordered comparison function such as
3564 __builtin_isgreater(). FUNCTION is the function's declaration and
3565 PARAMS a list of the values passed. For __builtin_isunordered(),
3566 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3567 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3568 that give the opposite of the desired result. UNORDERED_CODE is
3569 used for modes that can hold NaNs and ORDERED_CODE is used for the
3573 expand_unordered_cmp (tree function, tree params,
3574 enum tree_code unordered_code,
3575 enum tree_code ordered_code)
3577 tree arg0, arg1, type;
3578 enum tree_code code0, code1;
3580 /* Check that we have exactly two arguments. */
3581 if (params == 0 || TREE_CHAIN (params) == 0)
3583 error ("too few arguments to function `%s'",
3584 IDENTIFIER_POINTER (DECL_NAME (function)));
3585 return error_mark_node;
3587 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3589 error ("too many arguments to function `%s'",
3590 IDENTIFIER_POINTER (DECL_NAME (function)));
3591 return error_mark_node;
3594 arg0 = TREE_VALUE (params);
3595 arg1 = TREE_VALUE (TREE_CHAIN (params));
3597 code0 = TREE_CODE (TREE_TYPE (arg0));
3598 code1 = TREE_CODE (TREE_TYPE (arg1));
3600 /* Make sure that the arguments have a common type of REAL. */
3602 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3603 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3604 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3606 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3608 error ("non-floating-point argument to function `%s'",
3609 IDENTIFIER_POINTER (DECL_NAME (function)));
3610 return error_mark_node;
3613 if (unordered_code == UNORDERED_EXPR)
3615 if (MODE_HAS_NANS (TYPE_MODE (type)))
3616 return build_binary_op (unordered_code,
3617 convert (type, arg0),
3618 convert (type, arg1),
3621 return integer_zero_node;
3624 return build_unary_op (TRUTH_NOT_EXPR,
3625 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3628 convert (type, arg0),
3629 convert (type, arg1),
3635 /* Recognize certain built-in functions so we can make tree-codes
3636 other than CALL_EXPR. We do this when it enables fold-const.c
3637 to do something useful. */
3638 /* ??? By rights this should go in builtins.c, but only C and C++
3639 implement build_{binary,unary}_op. Not exactly sure what bits
3640 of functionality are actually needed from those functions, or
3641 where the similar functionality exists in the other front ends. */
3644 expand_tree_builtin (tree function, tree params, tree coerced_params)
3646 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3649 switch (DECL_FUNCTION_CODE (function))
3653 case BUILT_IN_LLABS:
3654 case BUILT_IN_IMAXABS:
3656 case BUILT_IN_FABSL:
3657 case BUILT_IN_FABSF:
3658 if (coerced_params == 0)
3659 return integer_zero_node;
3660 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3663 case BUILT_IN_CONJF:
3664 case BUILT_IN_CONJL:
3665 if (coerced_params == 0)
3666 return integer_zero_node;
3667 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3669 case BUILT_IN_CREAL:
3670 case BUILT_IN_CREALF:
3671 case BUILT_IN_CREALL:
3672 if (coerced_params == 0)
3673 return integer_zero_node;
3674 return build_unary_op (REALPART_EXPR, TREE_VALUE (coerced_params), 0);
3676 case BUILT_IN_CIMAG:
3677 case BUILT_IN_CIMAGF:
3678 case BUILT_IN_CIMAGL:
3679 if (coerced_params == 0)
3680 return integer_zero_node;
3681 return build_unary_op (IMAGPART_EXPR, TREE_VALUE (coerced_params), 0);
3683 case BUILT_IN_ISGREATER:
3684 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3686 case BUILT_IN_ISGREATEREQUAL:
3687 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3689 case BUILT_IN_ISLESS:
3690 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3692 case BUILT_IN_ISLESSEQUAL:
3693 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3695 case BUILT_IN_ISLESSGREATER:
3696 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3698 case BUILT_IN_ISUNORDERED:
3699 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3708 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3709 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3710 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3711 value, the traversal is aborted, and the value returned by FUNC is
3712 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3713 the node being visited are not walked.
3715 We don't need a without_duplicates variant of this one because the
3716 statement tree is a tree, not a graph. */
3719 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3721 enum tree_code code;
3726 #define WALK_SUBTREE(NODE) \
3729 result = walk_stmt_tree (&(NODE), func, data); \
3735 /* Skip empty subtrees. */
3739 /* Skip subtrees below non-statement nodes. */
3740 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3743 /* Call the function. */
3745 result = (*func) (tp, &walk_subtrees, data);
3747 /* If we found something, return it. */
3751 /* FUNC may have modified the tree, recheck that we're looking at a
3753 code = TREE_CODE (*tp);
3754 if (!STATEMENT_CODE_P (code))
3757 /* Visit the subtrees unless FUNC decided that there was nothing
3758 interesting below this point in the tree. */
3761 /* Walk over all the sub-trees of this operand. Statement nodes
3762 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3763 len = TREE_CODE_LENGTH (code);
3765 /* Go through the subtrees. We need to do this in forward order so
3766 that the scope of a FOR_EXPR is handled properly. */
3767 for (i = 0; i < len; ++i)
3768 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3771 /* Finally visit the chain. This can be tail-recursion optimized if
3772 we write it this way. */
3773 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3778 /* Used to compare case labels. K1 and K2 are actually tree nodes
3779 representing case labels, or NULL_TREE for a `default' label.
3780 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3781 K2, and 0 if K1 and K2 are equal. */
3784 case_compare (splay_tree_key k1, splay_tree_key k2)
3786 /* Consider a NULL key (such as arises with a `default' label) to be
3787 smaller than anything else. */
3793 return tree_int_cst_compare ((tree) k1, (tree) k2);
3796 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3797 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3798 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3799 case label was declared using the usual C/C++ syntax, rather than
3800 the GNU case range extension. CASES is a tree containing all the
3801 case ranges processed so far; COND is the condition for the
3802 switch-statement itself. Returns the CASE_LABEL created, or
3803 ERROR_MARK_NODE if no CASE_LABEL is created. */
3806 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3812 splay_tree_node node;
3814 /* Create the LABEL_DECL itself. */
3815 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3816 DECL_CONTEXT (label) = current_function_decl;
3818 /* If there was an error processing the switch condition, bail now
3819 before we get more confused. */
3820 if (!cond || cond == error_mark_node)
3822 /* Add a label anyhow so that the back-end doesn't think that
3823 the beginning of the switch is unreachable. */
3825 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3826 return error_mark_node;
3829 if ((low_value && TREE_TYPE (low_value)
3830 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3831 || (high_value && TREE_TYPE (high_value)
3832 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3833 error ("pointers are not permitted as case values");
3835 /* Case ranges are a GNU extension. */
3836 if (high_value && pedantic)
3837 pedwarn ("range expressions in switch statements are non-standard");
3839 type = TREE_TYPE (cond);
3842 low_value = check_case_value (low_value);
3843 low_value = convert_and_check (type, low_value);
3847 high_value = check_case_value (high_value);
3848 high_value = convert_and_check (type, high_value);
3851 /* If an error has occurred, bail out now. */
3852 if (low_value == error_mark_node || high_value == error_mark_node)
3855 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3856 return error_mark_node;
3859 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3860 really a case range, even though it was written that way. Remove
3861 the HIGH_VALUE to simplify later processing. */
3862 if (tree_int_cst_equal (low_value, high_value))
3863 high_value = NULL_TREE;
3864 if (low_value && high_value
3865 && !tree_int_cst_lt (low_value, high_value))
3866 warning ("empty range specified");
3868 /* Look up the LOW_VALUE in the table of case labels we already
3870 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3871 /* If there was not an exact match, check for overlapping ranges.
3872 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3873 that's a `default' label and the only overlap is an exact match. */
3874 if (!node && (low_value || high_value))
3876 splay_tree_node low_bound;
3877 splay_tree_node high_bound;
3879 /* Even though there wasn't an exact match, there might be an
3880 overlap between this case range and another case range.
3881 Since we've (inductively) not allowed any overlapping case
3882 ranges, we simply need to find the greatest low case label
3883 that is smaller that LOW_VALUE, and the smallest low case
3884 label that is greater than LOW_VALUE. If there is an overlap
3885 it will occur in one of these two ranges. */
3886 low_bound = splay_tree_predecessor (cases,
3887 (splay_tree_key) low_value);
3888 high_bound = splay_tree_successor (cases,
3889 (splay_tree_key) low_value);
3891 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3892 the LOW_VALUE, so there is no need to check unless the
3893 LOW_BOUND is in fact itself a case range. */
3895 && CASE_HIGH ((tree) low_bound->value)
3896 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3899 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3900 range is bigger than the low end of the current range, so we
3901 are only interested if the current range is a real range, and
3902 not an ordinary case label. */
3905 && (tree_int_cst_compare ((tree) high_bound->key,
3910 /* If there was an overlap, issue an error. */
3913 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3917 error ("duplicate (or overlapping) case value");
3918 error ("%Hthis is the first entry overlapping that value",
3919 &DECL_SOURCE_LOCATION (duplicate));
3923 error ("duplicate case value") ;
3924 error ("%Hpreviously used here", &DECL_SOURCE_LOCATION (duplicate));
3928 error ("multiple default labels in one switch");
3929 error ("%Hthis is the first default label",
3930 &DECL_SOURCE_LOCATION (duplicate));
3933 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3936 /* Add a CASE_LABEL to the statement-tree. */
3937 case_label = add_stmt (build_case_label (low_value, high_value, label));
3938 /* Register this case label in the splay tree. */
3939 splay_tree_insert (cases,
3940 (splay_tree_key) low_value,
3941 (splay_tree_value) case_label);
3946 /* Finish an expression taking the address of LABEL (an
3947 IDENTIFIER_NODE). Returns an expression for the address. */
3950 finish_label_address_expr (tree label)
3955 pedwarn ("taking the address of a label is non-standard");
3957 if (label == error_mark_node)
3958 return error_mark_node;
3960 label = lookup_label (label);
3961 if (label == NULL_TREE)
3962 result = null_pointer_node;
3965 TREE_USED (label) = 1;
3966 result = build1 (ADDR_EXPR, ptr_type_node, label);
3967 TREE_CONSTANT (result) = 1;
3968 /* The current function in not necessarily uninlinable.
3969 Computed gotos are incompatible with inlining, but the value
3970 here could be used only in a diagnostic, for example. */
3976 /* Hook used by expand_expr to expand language-specific tree codes. */
3979 c_expand_expr (tree exp, rtx target, enum machine_mode tmode, int modifier)
3980 /* Actually enum_modifier. */
3982 switch (TREE_CODE (exp))
3988 bool preserve_result = false;
3989 bool return_target = false;
3991 /* Since expand_expr_stmt calls free_temp_slots after every
3992 expression statement, we must call push_temp_slots here.
3993 Otherwise, any temporaries in use now would be considered
3994 out-of-scope after the first EXPR_STMT from within the
3997 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
3999 /* If we want the result of this expression, find the last
4000 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
4001 if (target != const0_rtx
4002 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
4003 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
4005 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
4006 tree last = TREE_CHAIN (expr);
4008 while (TREE_CHAIN (last))
4011 last = TREE_CHAIN (last);
4014 if (TREE_CODE (last) == SCOPE_STMT
4015 && TREE_CODE (expr) == EXPR_STMT)
4017 if (target && TREE_CODE (EXPR_STMT_EXPR (expr)) == VAR_DECL
4018 && DECL_RTL_IF_SET (EXPR_STMT_EXPR (expr)) == target)
4019 /* If the last expression is a variable whose RTL is the
4020 same as our target, just return the target; if it
4021 isn't valid expanding the decl would produce different
4022 RTL, and store_expr would try to do a copy. */
4023 return_target = true;
4026 /* Otherwise, note that we want the value from the last
4028 TREE_ADDRESSABLE (expr) = 1;
4029 preserve_result = true;
4034 expand_stmt (STMT_EXPR_STMT (exp));
4035 expand_end_stmt_expr (rtl_expr);
4037 result = expand_expr (rtl_expr, target, tmode, modifier);
4040 else if (preserve_result && GET_CODE (result) == MEM)
4042 if (GET_MODE (result) != BLKmode)
4043 result = copy_to_reg (result);
4045 preserve_temp_slots (result);
4048 /* If the statment-expression does not have a scope, then the
4049 new temporaries we created within it must live beyond the
4050 statement-expression. */
4051 if (STMT_EXPR_NO_SCOPE (exp))
4052 preserve_temp_slots (NULL_RTX);
4059 case COMPOUND_LITERAL_EXPR:
4061 /* Initialize the anonymous variable declared in the compound
4062 literal, then return the variable. */
4063 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4064 emit_local_var (decl);
4065 return expand_expr (decl, target, tmode, modifier);
4076 /* Hook used by safe_from_p to handle language-specific tree codes. */
4079 c_safe_from_p (rtx target, tree exp)
4081 /* We can see statements here when processing the body of a
4082 statement-expression. For a declaration statement declaring a
4083 variable, look at the variable's initializer. */
4084 if (TREE_CODE (exp) == DECL_STMT)
4086 tree decl = DECL_STMT_DECL (exp);
4088 if (TREE_CODE (decl) == VAR_DECL
4089 && DECL_INITIAL (decl)
4090 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4094 /* For any statement, we must follow the statement-chain. */
4095 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4096 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4098 /* Assume everything else is safe. */
4102 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4105 c_common_unsafe_for_reeval (tree exp)
4107 /* Statement expressions may not be reevaluated, likewise compound
4109 if (TREE_CODE (exp) == STMT_EXPR
4110 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4113 /* Walk all other expressions. */
4117 /* Hook used by staticp to handle language-specific tree codes. */
4120 c_staticp (tree exp)
4122 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4123 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4129 /* Given a boolean expression ARG, return a tree representing an increment
4130 or decrement (as indicated by CODE) of ARG. The front end must check for
4131 invalid cases (e.g., decrement in C++). */
4133 boolean_increment (enum tree_code code, tree arg)
4136 tree true_res = boolean_true_node;
4138 arg = stabilize_reference (arg);
4141 case PREINCREMENT_EXPR:
4142 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4144 case POSTINCREMENT_EXPR:
4145 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4146 arg = save_expr (arg);
4147 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4148 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4150 case PREDECREMENT_EXPR:
4151 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4153 case POSTDECREMENT_EXPR:
4154 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4155 arg = save_expr (arg);
4156 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4157 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4162 TREE_SIDE_EFFECTS (val) = 1;
4166 /* Built-in macros for stddef.h, that require macros defined in this
4169 c_stddef_cpp_builtins(void)
4171 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4172 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4173 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4174 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4178 c_init_attributes (void)
4180 /* Fill in the built_in_attributes array. */
4181 #define DEF_ATTR_NULL_TREE(ENUM) \
4182 built_in_attributes[(int) ENUM] = NULL_TREE;
4183 #define DEF_ATTR_INT(ENUM, VALUE) \
4184 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4185 #define DEF_ATTR_IDENT(ENUM, STRING) \
4186 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4187 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4188 built_in_attributes[(int) ENUM] \
4189 = tree_cons (built_in_attributes[(int) PURPOSE], \
4190 built_in_attributes[(int) VALUE], \
4191 built_in_attributes[(int) CHAIN]);
4192 #include "builtin-attrs.def"
4193 #undef DEF_ATTR_NULL_TREE
4195 #undef DEF_ATTR_IDENT
4196 #undef DEF_ATTR_TREE_LIST
4199 /* Output a -Wshadow warning MSGCODE about NAME, and give the location
4200 of the previous declaration DECL. */
4202 shadow_warning (enum sw_kind msgcode, const char *name, tree decl)
4204 static const char *const msgs[] = {
4205 /* SW_PARAM */ N_("declaration of \"%s\" shadows a parameter"),
4206 /* SW_LOCAL */ N_("declaration of \"%s\" shadows a previous local"),
4207 /* SW_GLOBAL */ N_("declaration of \"%s\" shadows a global declaration")
4210 warning (msgs[msgcode], name);
4211 warning ("%Hshadowed declaration is here", &DECL_SOURCE_LOCATION (decl));
4214 /* Attribute handlers common to C front ends. */
4216 /* Handle a "packed" attribute; arguments as in
4217 struct attribute_spec.handler. */
4220 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4221 int flags, bool *no_add_attrs)
4225 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4226 *node = build_type_copy (*node);
4227 TYPE_PACKED (*node) = 1;
4228 if (TYPE_MAIN_VARIANT (*node) == *node)
4230 /* If it is the main variant, then pack the other variants
4231 too. This happens in,
4234 struct Foo const *ptr; // creates a variant w/o packed flag
4235 } __ attribute__((packed)); // packs it now.
4239 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4240 TYPE_PACKED (probe) = 1;
4244 else if (TREE_CODE (*node) == FIELD_DECL)
4245 DECL_PACKED (*node) = 1;
4246 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4247 used for DECL_REGISTER. It wouldn't mean anything anyway.
4248 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4249 that changes what the typedef is typing. */
4252 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4253 *no_add_attrs = true;
4259 /* Handle a "nocommon" attribute; arguments as in
4260 struct attribute_spec.handler. */
4263 handle_nocommon_attribute (tree *node, tree name,
4264 tree args ATTRIBUTE_UNUSED,
4265 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4267 if (TREE_CODE (*node) == VAR_DECL)
4268 DECL_COMMON (*node) = 0;
4271 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4272 *no_add_attrs = true;
4278 /* Handle a "common" attribute; arguments as in
4279 struct attribute_spec.handler. */
4282 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4283 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4285 if (TREE_CODE (*node) == VAR_DECL)
4286 DECL_COMMON (*node) = 1;
4289 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4290 *no_add_attrs = true;
4296 /* Handle a "noreturn" attribute; arguments as in
4297 struct attribute_spec.handler. */
4300 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4301 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4303 tree type = TREE_TYPE (*node);
4305 /* See FIXME comment in c_common_attribute_table. */
4306 if (TREE_CODE (*node) == FUNCTION_DECL)
4307 TREE_THIS_VOLATILE (*node) = 1;
4308 else if (TREE_CODE (type) == POINTER_TYPE
4309 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4311 = build_pointer_type
4312 (build_type_variant (TREE_TYPE (type),
4313 TREE_READONLY (TREE_TYPE (type)), 1));
4316 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4317 *no_add_attrs = true;
4323 /* Handle a "noinline" attribute; arguments as in
4324 struct attribute_spec.handler. */
4327 handle_noinline_attribute (tree *node, tree name,
4328 tree args ATTRIBUTE_UNUSED,
4329 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4331 if (TREE_CODE (*node) == FUNCTION_DECL)
4332 DECL_UNINLINABLE (*node) = 1;
4335 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4336 *no_add_attrs = true;
4342 /* Handle a "always_inline" attribute; arguments as in
4343 struct attribute_spec.handler. */
4346 handle_always_inline_attribute (tree *node, tree name,
4347 tree args ATTRIBUTE_UNUSED,
4348 int flags ATTRIBUTE_UNUSED,
4351 if (TREE_CODE (*node) == FUNCTION_DECL)
4353 /* Do nothing else, just set the attribute. We'll get at
4354 it later with lookup_attribute. */
4358 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4359 *no_add_attrs = true;
4365 /* Handle a "used" attribute; arguments as in
4366 struct attribute_spec.handler. */
4369 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4370 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4374 if (TREE_CODE (node) == FUNCTION_DECL
4375 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4377 TREE_USED (node) = 1;
4381 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4382 *no_add_attrs = true;
4388 /* Handle a "unused" attribute; arguments as in
4389 struct attribute_spec.handler. */
4392 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4393 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4399 if (TREE_CODE (decl) == PARM_DECL
4400 || TREE_CODE (decl) == VAR_DECL
4401 || TREE_CODE (decl) == FUNCTION_DECL
4402 || TREE_CODE (decl) == LABEL_DECL
4403 || TREE_CODE (decl) == TYPE_DECL)
4404 TREE_USED (decl) = 1;
4407 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4408 *no_add_attrs = true;
4413 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4414 *node = build_type_copy (*node);
4415 TREE_USED (*node) = 1;
4421 /* Handle a "const" attribute; arguments as in
4422 struct attribute_spec.handler. */
4425 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4426 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4428 tree type = TREE_TYPE (*node);
4430 /* See FIXME comment on noreturn in c_common_attribute_table. */
4431 if (TREE_CODE (*node) == FUNCTION_DECL)
4432 TREE_READONLY (*node) = 1;
4433 else if (TREE_CODE (type) == POINTER_TYPE
4434 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4436 = build_pointer_type
4437 (build_type_variant (TREE_TYPE (type), 1,
4438 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4441 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4442 *no_add_attrs = true;
4448 /* Handle a "transparent_union" attribute; arguments as in
4449 struct attribute_spec.handler. */
4452 handle_transparent_union_attribute (tree *node, tree name,
4453 tree args ATTRIBUTE_UNUSED, int flags,
4456 tree decl = NULL_TREE;
4463 type = &TREE_TYPE (decl);
4464 is_type = TREE_CODE (*node) == TYPE_DECL;
4466 else if (TYPE_P (*node))
4467 type = node, is_type = 1;
4470 && TREE_CODE (*type) == UNION_TYPE
4472 || (TYPE_FIELDS (*type) != 0
4473 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4475 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4476 *type = build_type_copy (*type);
4477 TYPE_TRANSPARENT_UNION (*type) = 1;
4479 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4480 && TREE_CODE (*type) == UNION_TYPE
4481 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4482 DECL_TRANSPARENT_UNION (decl) = 1;
4485 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4486 *no_add_attrs = true;
4492 /* Handle a "constructor" attribute; arguments as in
4493 struct attribute_spec.handler. */
4496 handle_constructor_attribute (tree *node, tree name,
4497 tree args ATTRIBUTE_UNUSED,
4498 int flags ATTRIBUTE_UNUSED,
4502 tree type = TREE_TYPE (decl);
4504 if (TREE_CODE (decl) == FUNCTION_DECL
4505 && TREE_CODE (type) == FUNCTION_TYPE
4506 && decl_function_context (decl) == 0)
4508 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4509 TREE_USED (decl) = 1;
4513 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4514 *no_add_attrs = true;
4520 /* Handle a "destructor" attribute; arguments as in
4521 struct attribute_spec.handler. */
4524 handle_destructor_attribute (tree *node, tree name,
4525 tree args ATTRIBUTE_UNUSED,
4526 int flags ATTRIBUTE_UNUSED,
4530 tree type = TREE_TYPE (decl);
4532 if (TREE_CODE (decl) == FUNCTION_DECL
4533 && TREE_CODE (type) == FUNCTION_TYPE
4534 && decl_function_context (decl) == 0)
4536 DECL_STATIC_DESTRUCTOR (decl) = 1;
4537 TREE_USED (decl) = 1;
4541 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4542 *no_add_attrs = true;
4548 /* Handle a "mode" attribute; arguments as in
4549 struct attribute_spec.handler. */
4552 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4553 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4557 *no_add_attrs = true;
4559 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4560 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4564 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4565 int len = strlen (p);
4566 enum machine_mode mode = VOIDmode;
4570 if (len > 4 && p[0] == '_' && p[1] == '_'
4571 && p[len - 1] == '_' && p[len - 2] == '_')
4573 char *newp = alloca (len - 1);
4575 strcpy (newp, &p[2]);
4576 newp[len - 4] = '\0';
4580 /* Change this type to have a type with the specified mode.
4581 First check for the special modes. */
4582 if (! strcmp (p, "byte"))
4584 else if (!strcmp (p, "word"))
4586 else if (! strcmp (p, "pointer"))
4589 for (j = 0; j < NUM_MACHINE_MODES; j++)
4590 if (!strcmp (p, GET_MODE_NAME (j)))
4591 mode = (enum machine_mode) j;
4593 if (mode == VOIDmode)
4594 error ("unknown machine mode `%s'", p);
4595 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
4596 (mode, TREE_UNSIGNED (type))))
4597 error ("no data type for mode `%s'", p);
4598 else if ((TREE_CODE (type) == POINTER_TYPE
4599 || TREE_CODE (type) == REFERENCE_TYPE)
4600 && !(*targetm.valid_pointer_mode) (mode))
4601 error ("invalid pointer mode `%s'", p);
4604 /* If this is a vector, make sure we either have hardware
4605 support, or we can emulate it. */
4606 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4608 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4612 if (TREE_CODE (type) == POINTER_TYPE)
4614 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4618 else if (TREE_CODE (type) == REFERENCE_TYPE)
4620 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4626 /* No need to layout the type here. The caller should do this. */
4633 /* Handle a "section" attribute; arguments as in
4634 struct attribute_spec.handler. */
4637 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4638 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4642 if (targetm.have_named_sections)
4644 if ((TREE_CODE (decl) == FUNCTION_DECL
4645 || TREE_CODE (decl) == VAR_DECL)
4646 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4648 if (TREE_CODE (decl) == VAR_DECL
4649 && current_function_decl != NULL_TREE
4650 && ! TREE_STATIC (decl))
4652 error ("%Hsection attribute cannot be specified for "
4653 "local variables", &DECL_SOURCE_LOCATION (decl));
4654 *no_add_attrs = true;
4657 /* The decl may have already been given a section attribute
4658 from a previous declaration. Ensure they match. */
4659 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4660 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4661 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4663 error ("%Hsection of '%D' conflicts with previous declaration",
4664 &DECL_SOURCE_LOCATION (*node), *node);
4665 *no_add_attrs = true;
4668 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4672 error ("%Hsection attribute not allowed for '%D'",
4673 &DECL_SOURCE_LOCATION (*node), *node);
4674 *no_add_attrs = true;
4679 error ("%Hsection attributes are not supported for this target",
4680 &DECL_SOURCE_LOCATION (*node));
4681 *no_add_attrs = true;
4687 /* Handle a "aligned" attribute; arguments as in
4688 struct attribute_spec.handler. */
4691 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4692 int flags, bool *no_add_attrs)
4694 tree decl = NULL_TREE;
4697 tree align_expr = (args ? TREE_VALUE (args)
4698 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4704 type = &TREE_TYPE (decl);
4705 is_type = TREE_CODE (*node) == TYPE_DECL;
4707 else if (TYPE_P (*node))
4708 type = node, is_type = 1;
4710 /* Strip any NOPs of any kind. */
4711 while (TREE_CODE (align_expr) == NOP_EXPR
4712 || TREE_CODE (align_expr) == CONVERT_EXPR
4713 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4714 align_expr = TREE_OPERAND (align_expr, 0);
4716 if (TREE_CODE (align_expr) != INTEGER_CST)
4718 error ("requested alignment is not a constant");
4719 *no_add_attrs = true;
4721 else if ((i = tree_log2 (align_expr)) == -1)
4723 error ("requested alignment is not a power of 2");
4724 *no_add_attrs = true;
4726 else if (i > HOST_BITS_PER_INT - 2)
4728 error ("requested alignment is too large");
4729 *no_add_attrs = true;
4733 /* If we have a TYPE_DECL, then copy the type, so that we
4734 don't accidentally modify a builtin type. See pushdecl. */
4735 if (decl && TREE_TYPE (decl) != error_mark_node
4736 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4738 tree tt = TREE_TYPE (decl);
4739 *type = build_type_copy (*type);
4740 DECL_ORIGINAL_TYPE (decl) = tt;
4741 TYPE_NAME (*type) = decl;
4742 TREE_USED (*type) = TREE_USED (decl);
4743 TREE_TYPE (decl) = *type;
4745 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4746 *type = build_type_copy (*type);
4748 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4749 TYPE_USER_ALIGN (*type) = 1;
4751 else if (TREE_CODE (decl) != VAR_DECL
4752 && TREE_CODE (decl) != FIELD_DECL)
4754 error ("%Halignment may not be specified for '%D'",
4755 &DECL_SOURCE_LOCATION (decl), decl);
4756 *no_add_attrs = true;
4760 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4761 DECL_USER_ALIGN (decl) = 1;
4767 /* Handle a "weak" attribute; arguments as in
4768 struct attribute_spec.handler. */
4771 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4772 tree args ATTRIBUTE_UNUSED,
4773 int flags ATTRIBUTE_UNUSED,
4774 bool *no_add_attrs ATTRIBUTE_UNUSED)
4776 declare_weak (*node);
4781 /* Handle an "alias" attribute; arguments as in
4782 struct attribute_spec.handler. */
4785 handle_alias_attribute (tree *node, tree name, tree args,
4786 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4790 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4791 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4793 error ("%H'%D' defined both normally and as an alias",
4794 &DECL_SOURCE_LOCATION (decl), decl);
4795 *no_add_attrs = true;
4797 else if (decl_function_context (decl) == 0)
4801 id = TREE_VALUE (args);
4802 if (TREE_CODE (id) != STRING_CST)
4804 error ("alias arg not a string");
4805 *no_add_attrs = true;
4808 id = get_identifier (TREE_STRING_POINTER (id));
4809 /* This counts as a use of the object pointed to. */
4812 if (TREE_CODE (decl) == FUNCTION_DECL)
4813 DECL_INITIAL (decl) = error_mark_node;
4815 DECL_EXTERNAL (decl) = 0;
4819 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4820 *no_add_attrs = true;
4826 /* Handle an "visibility" attribute; arguments as in
4827 struct attribute_spec.handler. */
4830 handle_visibility_attribute (tree *node, tree name, tree args,
4831 int flags ATTRIBUTE_UNUSED,
4836 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
4838 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4839 *no_add_attrs = true;
4845 id = TREE_VALUE (args);
4846 if (TREE_CODE (id) != STRING_CST)
4848 error ("visibility arg not a string");
4849 *no_add_attrs = true;
4852 if (strcmp (TREE_STRING_POINTER (id), "hidden")
4853 && strcmp (TREE_STRING_POINTER (id), "protected")
4854 && strcmp (TREE_STRING_POINTER (id), "internal")
4855 && strcmp (TREE_STRING_POINTER (id), "default"))
4857 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4858 *no_add_attrs = true;
4866 /* Handle an "tls_model" attribute; arguments as in
4867 struct attribute_spec.handler. */
4870 handle_tls_model_attribute (tree *node, tree name, tree args,
4871 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4875 if (! DECL_THREAD_LOCAL (decl))
4877 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4878 *no_add_attrs = true;
4884 id = TREE_VALUE (args);
4885 if (TREE_CODE (id) != STRING_CST)
4887 error ("tls_model arg not a string");
4888 *no_add_attrs = true;
4891 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4892 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4893 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4894 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4896 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4897 *no_add_attrs = true;
4905 /* Handle a "no_instrument_function" attribute; arguments as in
4906 struct attribute_spec.handler. */
4909 handle_no_instrument_function_attribute (tree *node, tree name,
4910 tree args ATTRIBUTE_UNUSED,
4911 int flags ATTRIBUTE_UNUSED,
4916 if (TREE_CODE (decl) != FUNCTION_DECL)
4918 error ("%H'%E' attribute applies only to functions",
4919 &DECL_SOURCE_LOCATION (decl), name);
4920 *no_add_attrs = true;
4922 else if (DECL_INITIAL (decl))
4924 error ("%Hcan't set '%E' attribute after definition",
4925 &DECL_SOURCE_LOCATION (decl), name);
4926 *no_add_attrs = true;
4929 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
4934 /* Handle a "malloc" attribute; arguments as in
4935 struct attribute_spec.handler. */
4938 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4939 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4941 if (TREE_CODE (*node) == FUNCTION_DECL)
4942 DECL_IS_MALLOC (*node) = 1;
4943 /* ??? TODO: Support types. */
4946 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4947 *no_add_attrs = true;
4953 /* Handle a "no_limit_stack" attribute; arguments as in
4954 struct attribute_spec.handler. */
4957 handle_no_limit_stack_attribute (tree *node, tree name,
4958 tree args ATTRIBUTE_UNUSED,
4959 int flags ATTRIBUTE_UNUSED,
4964 if (TREE_CODE (decl) != FUNCTION_DECL)
4966 error ("%H'%E' attribute applies only to functions",
4967 &DECL_SOURCE_LOCATION (decl), name);
4968 *no_add_attrs = true;
4970 else if (DECL_INITIAL (decl))
4972 error ("%Hcan't set '%E' attribute after definition",
4973 &DECL_SOURCE_LOCATION (decl), name);
4974 *no_add_attrs = true;
4977 DECL_NO_LIMIT_STACK (decl) = 1;
4982 /* Handle a "pure" attribute; arguments as in
4983 struct attribute_spec.handler. */
4986 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4987 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4989 if (TREE_CODE (*node) == FUNCTION_DECL)
4990 DECL_IS_PURE (*node) = 1;
4991 /* ??? TODO: Support types. */
4994 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4995 *no_add_attrs = true;
5001 /* Handle a "deprecated" attribute; arguments as in
5002 struct attribute_spec.handler. */
5005 handle_deprecated_attribute (tree *node, tree name,
5006 tree args ATTRIBUTE_UNUSED, int flags,
5009 tree type = NULL_TREE;
5011 const char *what = NULL;
5016 type = TREE_TYPE (decl);
5018 if (TREE_CODE (decl) == TYPE_DECL
5019 || TREE_CODE (decl) == PARM_DECL
5020 || TREE_CODE (decl) == VAR_DECL
5021 || TREE_CODE (decl) == FUNCTION_DECL
5022 || TREE_CODE (decl) == FIELD_DECL)
5023 TREE_DEPRECATED (decl) = 1;
5027 else if (TYPE_P (*node))
5029 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5030 *node = build_type_copy (*node);
5031 TREE_DEPRECATED (*node) = 1;
5039 *no_add_attrs = true;
5040 if (type && TYPE_NAME (type))
5042 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5043 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5044 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5045 && DECL_NAME (TYPE_NAME (type)))
5046 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5049 warning ("`%s' attribute ignored for `%s'",
5050 IDENTIFIER_POINTER (name), what);
5052 warning ("`%s' attribute ignored",
5053 IDENTIFIER_POINTER (name));
5059 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5060 to prevent us from duplicating type nodes unnecessarily.
5061 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5062 since we want to distinguish types that are essentially identical (except
5063 for their debug representation), we use a local list here. */
5064 static GTY(()) tree vector_type_node_list = 0;
5066 /* Handle a "vector_size" attribute; arguments as in
5067 struct attribute_spec.handler. */
5070 handle_vector_size_attribute (tree *node, tree name, tree args,
5071 int flags ATTRIBUTE_UNUSED,
5074 unsigned HOST_WIDE_INT vecsize, nunits;
5075 enum machine_mode mode, orig_mode, new_mode;
5076 tree type = *node, new_type = NULL_TREE;
5077 tree type_list_node;
5079 *no_add_attrs = true;
5081 if (! host_integerp (TREE_VALUE (args), 1))
5083 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5087 /* Get the vector size (in bytes). */
5088 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5090 /* We need to provide for vector pointers, vector arrays, and
5091 functions returning vectors. For example:
5093 __attribute__((vector_size(16))) short *foo;
5095 In this case, the mode is SI, but the type being modified is
5096 HI, so we need to look further. */
5098 while (POINTER_TYPE_P (type)
5099 || TREE_CODE (type) == FUNCTION_TYPE
5100 || TREE_CODE (type) == METHOD_TYPE
5101 || TREE_CODE (type) == ARRAY_TYPE)
5102 type = TREE_TYPE (type);
5104 /* Get the mode of the type being modified. */
5105 orig_mode = TYPE_MODE (type);
5107 if (TREE_CODE (type) == RECORD_TYPE
5108 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5109 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5110 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5112 error ("invalid vector type for attribute `%s'",
5113 IDENTIFIER_POINTER (name));
5117 /* Calculate how many units fit in the vector. */
5118 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5120 /* Find a suitably sized vector. */
5121 new_mode = VOIDmode;
5122 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5124 : MODE_VECTOR_FLOAT);
5126 mode = GET_MODE_WIDER_MODE (mode))
5127 if (vecsize == GET_MODE_SIZE (mode)
5128 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5134 if (new_mode == VOIDmode)
5136 error ("no vector mode with the size and type specified could be found");
5140 for (type_list_node = vector_type_node_list; type_list_node;
5141 type_list_node = TREE_CHAIN (type_list_node))
5143 tree other_type = TREE_VALUE (type_list_node);
5144 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5145 tree fields = TYPE_FIELDS (record);
5146 tree field_type = TREE_TYPE (fields);
5147 tree array_type = TREE_TYPE (field_type);
5148 if (TREE_CODE (fields) != FIELD_DECL
5149 || TREE_CODE (field_type) != ARRAY_TYPE)
5152 if (TYPE_MODE (other_type) == mode && type == array_type)
5154 new_type = other_type;
5159 if (new_type == NULL_TREE)
5161 tree index, array, rt, list_node;
5163 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5164 TREE_UNSIGNED (type));
5168 error ("no vector mode with the size and type specified could be found");
5172 new_type = build_type_copy (new_type);
5174 /* If this is a vector, make sure we either have hardware
5175 support, or we can emulate it. */
5176 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5177 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5178 && !vector_mode_valid_p (mode))
5180 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5184 /* Set the debug information here, because this is the only
5185 place where we know the underlying type for a vector made
5186 with vector_size. For debugging purposes we pretend a vector
5187 is an array within a structure. */
5188 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5189 array = build_array_type (type, build_index_type (index));
5190 rt = make_node (RECORD_TYPE);
5192 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5193 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5195 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5197 list_node = build_tree_list (NULL, new_type);
5198 TREE_CHAIN (list_node) = vector_type_node_list;
5199 vector_type_node_list = list_node;
5202 /* Build back pointers if needed. */
5203 *node = vector_size_helper (*node, new_type);
5208 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5211 If we requested a pointer to a vector, build up the pointers that
5212 we stripped off while looking for the inner type. Similarly for
5213 return values from functions.
5215 The argument "type" is the top of the chain, and "bottom" is the
5216 new type which we will point to. */
5219 vector_size_helper (tree type, tree bottom)
5223 if (POINTER_TYPE_P (type))
5225 inner = vector_size_helper (TREE_TYPE (type), bottom);
5226 outer = build_pointer_type (inner);
5228 else if (TREE_CODE (type) == ARRAY_TYPE)
5230 inner = vector_size_helper (TREE_TYPE (type), bottom);
5231 outer = build_array_type (inner, TYPE_DOMAIN (type));
5233 else if (TREE_CODE (type) == FUNCTION_TYPE)
5235 inner = vector_size_helper (TREE_TYPE (type), bottom);
5236 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5238 else if (TREE_CODE (type) == METHOD_TYPE)
5240 inner = vector_size_helper (TREE_TYPE (type), bottom);
5241 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5243 TYPE_ARG_TYPES (type));
5248 TREE_READONLY (outer) = TREE_READONLY (type);
5249 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5254 /* Handle the "nonnull" attribute. */
5256 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5257 tree args, int flags ATTRIBUTE_UNUSED,
5261 unsigned HOST_WIDE_INT attr_arg_num;
5263 /* If no arguments are specified, all pointer arguments should be
5264 non-null. Verify a full prototype is given so that the arguments
5265 will have the correct types when we actually check them later. */
5268 if (! TYPE_ARG_TYPES (type))
5270 error ("nonnull attribute without arguments on a non-prototype");
5271 *no_add_attrs = true;
5276 /* Argument list specified. Verify that each argument number references
5277 a pointer argument. */
5278 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5281 unsigned HOST_WIDE_INT arg_num, ck_num;
5283 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5285 error ("nonnull argument has invalid operand number (arg %lu)",
5286 (unsigned long) attr_arg_num);
5287 *no_add_attrs = true;
5291 argument = TYPE_ARG_TYPES (type);
5294 for (ck_num = 1; ; ck_num++)
5296 if (! argument || ck_num == arg_num)
5298 argument = TREE_CHAIN (argument);
5302 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5304 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5305 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5306 *no_add_attrs = true;
5310 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5312 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5313 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5314 *no_add_attrs = true;
5323 /* Check the argument list of a function call for null in argument slots
5324 that are marked as requiring a non-null pointer argument. */
5327 check_function_nonnull (tree attrs, tree params)
5329 tree a, args, param;
5332 for (a = attrs; a; a = TREE_CHAIN (a))
5334 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5336 args = TREE_VALUE (a);
5338 /* Walk the argument list. If we encounter an argument number we
5339 should check for non-null, do it. If the attribute has no args,
5340 then every pointer argument is checked (in which case the check
5341 for pointer type is done in check_nonnull_arg). */
5342 for (param = params, param_num = 1; ;
5343 param_num++, param = TREE_CHAIN (param))
5347 if (! args || nonnull_check_p (args, param_num))
5348 check_function_arguments_recurse (check_nonnull_arg, NULL,
5356 /* Helper for check_function_nonnull; given a list of operands which
5357 must be non-null in ARGS, determine if operand PARAM_NUM should be
5361 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5363 unsigned HOST_WIDE_INT arg_num;
5365 for (; args; args = TREE_CHAIN (args))
5367 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5370 if (arg_num == param_num)
5376 /* Check that the function argument PARAM (which is operand number
5377 PARAM_NUM) is non-null. This is called by check_function_nonnull
5378 via check_function_arguments_recurse. */
5381 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5382 unsigned HOST_WIDE_INT param_num)
5384 /* Just skip checking the argument if it's not a pointer. This can
5385 happen if the "nonnull" attribute was given without an operand
5386 list (which means to check every pointer argument). */
5388 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5391 if (integer_zerop (param))
5392 warning ("null argument where non-null required (arg %lu)",
5393 (unsigned long) param_num);
5396 /* Helper for nonnull attribute handling; fetch the operand number
5397 from the attribute argument list. */
5400 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5402 /* Strip any conversions from the arg number and verify they
5404 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5405 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5406 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5407 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5409 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5410 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5413 *valp = TREE_INT_CST_LOW (arg_num_expr);
5417 /* Handle a "nothrow" attribute; arguments as in
5418 struct attribute_spec.handler. */
5421 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5422 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5424 if (TREE_CODE (*node) == FUNCTION_DECL)
5425 TREE_NOTHROW (*node) = 1;
5426 /* ??? TODO: Support types. */
5429 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5430 *no_add_attrs = true;
5436 /* Handle a "cleanup" attribute; arguments as in
5437 struct attribute_spec.handler. */
5440 handle_cleanup_attribute (tree *node, tree name, tree args,
5441 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5444 tree cleanup_id, cleanup_decl;
5446 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5447 for global destructors in C++. This requires infrastructure that
5448 we don't have generically at the moment. It's also not a feature
5449 we'd be missing too much, since we do have attribute constructor. */
5450 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5452 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5453 *no_add_attrs = true;
5457 /* Verify that the argument is a function in scope. */
5458 /* ??? We could support pointers to functions here as well, if
5459 that was considered desirable. */
5460 cleanup_id = TREE_VALUE (args);
5461 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5463 error ("cleanup arg not an identifier");
5464 *no_add_attrs = true;
5467 cleanup_decl = lookup_name (cleanup_id);
5468 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5470 error ("cleanup arg not a function");
5471 *no_add_attrs = true;
5475 /* That the function has proper type is checked with the
5476 eventual call to build_function_call. */
5481 /* Check for valid arguments being passed to a function. */
5483 check_function_arguments (tree attrs, tree params)
5485 /* Check for null being passed in a pointer argument that must be
5486 non-null. We also need to do this if format checking is enabled. */
5489 check_function_nonnull (attrs, params);
5491 /* Check for errors in format strings. */
5494 check_function_format (NULL, attrs, params);
5497 /* Generic argument checking recursion routine. PARAM is the argument to
5498 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5499 once the argument is resolved. CTX is context for the callback. */
5501 check_function_arguments_recurse (void (*callback)
5502 (void *, tree, unsigned HOST_WIDE_INT),
5503 void *ctx, tree param,
5504 unsigned HOST_WIDE_INT param_num)
5506 if (TREE_CODE (param) == NOP_EXPR)
5508 /* Strip coercion. */
5509 check_function_arguments_recurse (callback, ctx,
5510 TREE_OPERAND (param, 0), param_num);
5514 if (TREE_CODE (param) == CALL_EXPR)
5516 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5518 bool found_format_arg = false;
5520 /* See if this is a call to a known internationalization function
5521 that modifies a format arg. Such a function may have multiple
5522 format_arg attributes (for example, ngettext). */
5524 for (attrs = TYPE_ATTRIBUTES (type);
5526 attrs = TREE_CHAIN (attrs))
5527 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5530 tree format_num_expr;
5534 /* Extract the argument number, which was previously checked
5536 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5537 while (TREE_CODE (format_num_expr) == NOP_EXPR
5538 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5539 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5540 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5542 if (TREE_CODE (format_num_expr) != INTEGER_CST
5543 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5546 format_num = TREE_INT_CST_LOW (format_num_expr);
5548 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5550 inner_args = TREE_CHAIN (inner_args), i++)
5551 if (i == format_num)
5553 check_function_arguments_recurse (callback, ctx,
5554 TREE_VALUE (inner_args),
5556 found_format_arg = true;
5561 /* If we found a format_arg attribute and did a recursive check,
5562 we are done with checking this argument. Otherwise, we continue
5563 and this will be considered a non-literal. */
5564 if (found_format_arg)
5568 if (TREE_CODE (param) == COND_EXPR)
5570 /* Check both halves of the conditional expression. */
5571 check_function_arguments_recurse (callback, ctx,
5572 TREE_OPERAND (param, 1), param_num);
5573 check_function_arguments_recurse (callback, ctx,
5574 TREE_OPERAND (param, 2), param_num);
5578 (*callback) (ctx, param, param_num);
5581 /* Function to help qsort sort FIELD_DECLs by name order. */
5584 field_decl_cmp (const void *x_p, const void *y_p)
5586 const tree *const x = x_p;
5587 const tree *const y = y_p;
5588 if (DECL_NAME (*x) == DECL_NAME (*y))
5589 /* A nontype is "greater" than a type. */
5590 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5591 if (DECL_NAME (*x) == NULL_TREE)
5593 if (DECL_NAME (*y) == NULL_TREE)
5595 if (DECL_NAME (*x) < DECL_NAME (*y))
5601 gt_pointer_operator new_value;
5605 /* This routine compares two fields like field_decl_cmp but using the
5606 pointer operator in resort_data. */
5609 resort_field_decl_cmp (const void *x_p, const void *y_p)
5611 const tree *const x = x_p;
5612 const tree *const y = y_p;
5614 if (DECL_NAME (*x) == DECL_NAME (*y))
5615 /* A nontype is "greater" than a type. */
5616 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5617 if (DECL_NAME (*x) == NULL_TREE)
5619 if (DECL_NAME (*y) == NULL_TREE)
5622 tree d1 = DECL_NAME (*x);
5623 tree d2 = DECL_NAME (*y);
5624 resort_data.new_value (&d1, resort_data.cookie);
5625 resort_data.new_value (&d2, resort_data.cookie);
5632 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5635 resort_sorted_fields (void *obj,
5636 void *orig_obj ATTRIBUTE_UNUSED ,
5637 gt_pointer_operator new_value,
5640 struct sorted_fields_type *sf = obj;
5641 resort_data.new_value = new_value;
5642 resort_data.cookie = cookie;
5643 qsort (&sf->elts[0], sf->len, sizeof (tree),
5644 resort_field_decl_cmp);
5647 /* Used by estimate_num_insns. Estimate number of instructions seen
5648 by given statement. */
5650 c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
5655 if (TYPE_P (x) || DECL_P (x))
5660 /* Assume that constants and references counts nothing. These should
5661 be majorized by amount of operations among them we count later
5662 and are common target of CSE and similar optimizations. */
5663 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
5664 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
5666 switch (TREE_CODE (x))
5668 /* Reconginze assignments of large structures and constructors of
5673 int size = int_size_in_bytes (TREE_TYPE (x));
5675 if (!size || size > MOVE_MAX_PIECES)
5678 *count += 2 * (size + MOVE_MAX - 1) / MOVE_MAX;
5682 /* Few special cases of expensive operations. This is usefull
5683 to avoid inlining on functions having too many of these. */
5684 case TRUNC_DIV_EXPR:
5686 case FLOOR_DIV_EXPR:
5687 case ROUND_DIV_EXPR:
5688 case TRUNC_MOD_EXPR:
5690 case FLOOR_MOD_EXPR:
5691 case ROUND_MOD_EXPR:
5696 /* Various containers that will produce no code themselves. */
5703 case IDENTIFIER_NODE:
5704 case PLACEHOLDER_EXPR:
5705 case WITH_CLEANUP_EXPR:
5706 case CLEANUP_POINT_EXPR:
5708 case VIEW_CONVERT_EXPR:
5714 case TRY_CATCH_EXPR:
5715 case TRY_FINALLY_EXPR:
5718 case LABELED_BLOCK_EXPR:
5719 case EXIT_BLOCK_EXPR:
5720 case EXPR_WITH_FILE_LOCATION:
5737 /* Do not account static initializers. */
5738 if (TREE_STATIC (TREE_OPERAND (x, 0)))
5747 /* Estimate number of instructions that will be created by expanding the body. */
5749 c_estimate_num_insns (tree decl)
5752 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl), c_estimate_num_insns_1, &num);
5756 /* Used by c_decl_uninit to find where expressions like x = x + 1; */
5759 c_decl_uninit_1 (tree *t, int *walk_sub_trees, void *x)
5761 /* If x = EXP(&x)EXP, then do not warn about the use of x. */
5762 if (TREE_CODE (*t) == ADDR_EXPR && TREE_OPERAND (*t, 0) == x)
5764 *walk_sub_trees = 0;
5772 /* Find out if a variable is uninitialized based on DECL_INITIAL. */
5775 c_decl_uninit (tree t)
5777 /* int x = x; is GCC extension to turn off this warning, only if warn_init_self is zero. */
5778 if (DECL_INITIAL (t) == t)
5779 return warn_init_self ? true : false;
5781 /* Walk the trees looking for the variable itself. */
5782 if (walk_tree_without_duplicates (&DECL_INITIAL (t), c_decl_uninit_1, t))
5787 #include "gt-c-common.h"