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;
349 /* Zero means that faster, ...NonNil variants of objc_msgSend...
350 calls will be used in ObjC; passing nil receivers to such calls
351 will most likely result in crashes. */
352 int flag_nil_receivers = 1;
354 /* Nonzero means that we will allow new ObjC exception syntax (@throw,
355 @try, etc.) in source code. */
356 int flag_objc_exceptions = 0;
358 /* Nonzero means that code generation will be altered to support
359 "zero-link" execution. This currently affects ObjC only, but may
360 affect other languages in the future. */
361 int flag_zero_link = 0;
363 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
364 unit. It will inform the ObjC runtime that class definition(s) herein
365 contained are to replace one(s) previously loaded. */
366 int flag_replace_objc_classes = 0;
368 /* C/ObjC language option variables. */
371 /* Nonzero means message about use of implicit function declarations;
372 1 means warning; 2 means error. */
374 int mesg_implicit_function_declaration = -1;
376 /* Nonzero means allow type mismatches in conditional expressions;
377 just make their values `void'. */
379 int flag_cond_mismatch;
381 /* Nonzero means enable C89 Amendment 1 features. */
385 /* Nonzero means use the ISO C99 dialect of C. */
389 /* Nonzero means that we have builtin functions, and main is an int. */
393 /* Nonzero means warn when casting a function call to a type that does
394 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
395 when there is no previous declaration of sqrt or malloc. */
397 int warn_bad_function_cast;
399 /* Warn about traditional constructs whose meanings changed in ANSI C. */
401 int warn_traditional;
403 /* Nonzero means warn for a declaration found after a statement. */
405 int warn_declaration_after_statement;
407 /* Nonzero means warn for non-prototype function decls
408 or non-prototyped defs without previous prototype. */
410 int warn_strict_prototypes;
412 /* Nonzero means warn for any global function def
413 without separate previous decl. */
415 int warn_missing_declarations;
417 /* Nonzero means warn about declarations of objects not at
418 file-scope level and about *all* declarations of functions (whether
419 or static) not at file-scope level. Note that we exclude
420 implicit function declarations. To get warnings about those, use
423 int warn_nested_externs;
425 /* Warn if main is suspicious. */
429 /* Nonzero means warn about possible violations of sequence point rules. */
431 int warn_sequence_point;
433 /* Nonzero means warn about uninitialized variable when it is initialized with itself.
434 For example: int i = i;, GCC will not warn about this when warn_init_self is nonzero. */
438 /* Nonzero means to warn about compile-time division by zero. */
439 int warn_div_by_zero = 1;
441 /* Nonzero means warn about use of implicit int. */
443 int warn_implicit_int;
445 /* Warn about NULL being passed to argument slots marked as requiring
450 /* Warn about old-style parameter declaration. */
452 int warn_old_style_definition;
455 /* ObjC language option variables. */
458 /* Open and close the file for outputting class declarations, if
461 int flag_gen_declaration;
463 /* Generate code for GNU or NeXT runtime environment. */
465 #ifdef NEXT_OBJC_RUNTIME
466 int flag_next_runtime = 1;
468 int flag_next_runtime = 0;
471 /* Tells the compiler that this is a special run. Do not perform any
472 compiling, instead we are to test some platform dependent features
473 and output a C header file with appropriate definitions. */
475 int print_struct_values;
477 /* ???. Undocumented. */
479 const char *constant_string_class_name;
481 /* Warn if multiple methods are seen for the same selector, but with
482 different argument types. Performs the check on the whole selector
483 table at the end of compilation. */
487 /* Warn if a @selector() is found, and no method with that selector
488 has been previously declared. The check is done on each
489 @selector() as soon as it is found - so it warns about forward
492 int warn_undeclared_selector;
494 /* Warn if methods required by a protocol are not implemented in the
495 class adopting it. When turned off, methods inherited to that
496 class are also considered implemented. */
498 int warn_protocol = 1;
501 /* C++ language option variables. */
504 /* Nonzero means don't recognize any extension keywords. */
506 int flag_no_gnu_keywords;
508 /* Nonzero means do emit exported implementations of functions even if
509 they can be inlined. */
511 int flag_implement_inlines = 1;
513 /* Nonzero means that implicit instantiations will be emitted if needed. */
515 int flag_implicit_templates = 1;
517 /* Nonzero means that implicit instantiations of inline templates will be
518 emitted if needed, even if instantiations of non-inline templates
521 int flag_implicit_inline_templates = 1;
523 /* Nonzero means generate separate instantiation control files and
524 juggle them at link time. */
526 int flag_use_repository;
528 /* Nonzero if we want to issue diagnostics that the standard says are not
531 int flag_optional_diags = 1;
533 /* Nonzero means we should attempt to elide constructors when possible. */
535 int flag_elide_constructors = 1;
537 /* Nonzero means that member functions defined in class scope are
538 inline by default. */
540 int flag_default_inline = 1;
542 /* Controls whether compiler generates 'type descriptor' that give
543 run-time type information. */
547 /* Nonzero if we want to conserve space in the .o files. We do this
548 by putting uninitialized data and runtime initialized data into
549 .common instead of .data at the expense of not flagging multiple
552 int flag_conserve_space;
554 /* Nonzero if we want to obey access control semantics. */
556 int flag_access_control = 1;
558 /* Nonzero if we want to check the return value of new and avoid calling
559 constructors if it is a null pointer. */
563 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
564 initialization variables.
565 0: Old rules, set by -fno-for-scope.
566 2: New ISO rules, set by -ffor-scope.
567 1: Try to implement new ISO rules, but with backup compatibility
568 (and warnings). This is the default, for now. */
570 int flag_new_for_scope = 1;
572 /* Nonzero if we want to emit defined symbols with common-like linkage as
573 weak symbols where possible, in order to conform to C++ semantics.
574 Otherwise, emit them as local symbols. */
578 /* 0 means we want the preprocessor to not emit line directives for
579 the current working directory. 1 means we want it to do it. -1
580 means we should decide depending on whether debugging information
581 is being emitted or not. */
583 int flag_working_directory = -1;
585 /* Nonzero to use __cxa_atexit, rather than atexit, to register
586 destructors for local statics and global objects. */
588 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
590 /* Nonzero means make the default pedwarns warnings instead of errors.
591 The value of this flag is ignored if -pedantic is specified. */
595 /* Nonzero means to implement standard semantics for exception
596 specifications, calling unexpected if an exception is thrown that
597 doesn't match the specification. Zero means to treat them as
598 assertions and optimize accordingly, but not check them. */
600 int flag_enforce_eh_specs = 1;
602 /* The version of the C++ ABI in use. The following values are
605 0: The version of the ABI believed most conformant with the
606 C++ ABI specification. This ABI may change as bugs are
607 discovered and fixed. Therefore, 0 will not necessarily
608 indicate the same ABI in different versions of G++.
610 1: The version of the ABI first used in G++ 3.2.
612 2: The version of the ABI first used in G++ 3.4.
614 Additional positive integers will be assigned as new versions of
615 the ABI become the default version of the ABI. */
617 int flag_abi_version = 2;
619 /* Nonzero means warn about things that will change when compiling
620 with an ABI-compliant compiler. */
624 /* Nonzero means warn about invalid uses of offsetof. */
626 int warn_invalid_offsetof = 1;
628 /* Nonzero means warn about implicit declarations. */
630 int warn_implicit = 1;
632 /* Nonzero means warn when all ctors or dtors are private, and the class
635 int warn_ctor_dtor_privacy = 0;
637 /* Nonzero means warn in function declared in derived class has the
638 same name as a virtual in the base class, but fails to match the
639 type signature of any virtual function in the base class. */
641 int warn_overloaded_virtual;
643 /* Nonzero means warn when declaring a class that has a non virtual
644 destructor, when it really ought to have a virtual one. */
648 /* Nonzero means warn when the compiler will reorder code. */
652 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
656 /* Nonzero means warn when we convert a pointer to member function
657 into a pointer to (void or function). */
659 int warn_pmf2ptr = 1;
661 /* Nonzero means warn about violation of some Effective C++ style rules. */
665 /* Nonzero means warn where overload resolution chooses a promotion from
666 unsigned to signed over a conversion to an unsigned of the same size. */
670 /* Nonzero means warn when an old-style cast is used. */
672 int warn_old_style_cast;
674 /* Nonzero means warn when non-templatized friend functions are
675 declared within a template */
677 int warn_nontemplate_friend = 1;
679 /* Nonzero means complain about deprecated features. */
681 int warn_deprecated = 1;
683 /* Maximum template instantiation depth. This limit is rather
684 arbitrary, but it exists to limit the time it takes to notice
685 infinite template instantiations. */
687 int max_tinst_depth = 500;
691 /* The elements of `ridpointers' are identifier nodes for the reserved
692 type names and storage classes. It is indexed by a RID_... value. */
695 tree (*make_fname_decl) (tree, int);
697 /* If non-NULL, the address of a language-specific function that takes
698 any action required right before expand_function_end is called. */
699 void (*lang_expand_function_end) (void);
701 /* Nonzero means the expression being parsed will never be evaluated.
702 This is a count, since unevaluated expressions can nest. */
705 /* Information about how a function name is generated. */
708 tree *const decl; /* pointer to the VAR_DECL. */
709 const unsigned rid; /* RID number for the identifier. */
710 const int pretty; /* How pretty is it? */
713 /* The three ways of getting then name of the current function. */
715 const struct fname_var_t fname_vars[] =
717 /* C99 compliant __func__, must be first. */
718 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
719 /* GCC __FUNCTION__ compliant. */
720 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
721 /* GCC __PRETTY_FUNCTION__ compliant. */
722 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
726 static int constant_fits_type_p (tree, tree);
728 /* Keep a stack of if statements. We record the number of compound
729 statements seen up to the if keyword, as well as the line number
730 and file of the if. If a potentially ambiguous else is seen, that
731 fact is recorded; the warning is issued when we can be sure that
732 the enclosing if statement does not have an else branch. */
741 static if_elt *if_stack;
743 /* Amount of space in the if statement stack. */
744 static int if_stack_space = 0;
747 static int if_stack_pointer = 0;
749 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
750 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
751 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
752 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
753 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
754 static tree handle_always_inline_attribute (tree *, tree, tree, int,
756 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
757 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
758 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
759 static tree handle_transparent_union_attribute (tree *, tree, tree,
761 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
762 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
763 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
764 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
765 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
766 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
767 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
768 static tree handle_visibility_attribute (tree *, tree, tree, int,
770 static tree handle_tls_model_attribute (tree *, tree, tree, int,
772 static tree handle_no_instrument_function_attribute (tree *, tree,
774 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
775 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
777 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
778 static tree handle_deprecated_attribute (tree *, tree, tree, int,
780 static tree handle_vector_size_attribute (tree *, tree, tree, int,
782 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
783 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
784 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
785 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
787 static tree vector_size_helper (tree, tree);
789 static void check_function_nonnull (tree, tree);
790 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
791 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
792 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
793 static int resort_field_decl_cmp (const void *, const void *);
795 /* Table of machine-independent attributes common to all C-like languages. */
796 const struct attribute_spec c_common_attribute_table[] =
798 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
799 { "packed", 0, 0, false, false, false,
800 handle_packed_attribute },
801 { "nocommon", 0, 0, true, false, false,
802 handle_nocommon_attribute },
803 { "common", 0, 0, true, false, false,
804 handle_common_attribute },
805 /* FIXME: logically, noreturn attributes should be listed as
806 "false, true, true" and apply to function types. But implementing this
807 would require all the places in the compiler that use TREE_THIS_VOLATILE
808 on a decl to identify non-returning functions to be located and fixed
809 to check the function type instead. */
810 { "noreturn", 0, 0, true, false, false,
811 handle_noreturn_attribute },
812 { "volatile", 0, 0, true, false, false,
813 handle_noreturn_attribute },
814 { "noinline", 0, 0, true, false, false,
815 handle_noinline_attribute },
816 { "always_inline", 0, 0, true, false, false,
817 handle_always_inline_attribute },
818 { "used", 0, 0, true, false, false,
819 handle_used_attribute },
820 { "unused", 0, 0, false, false, false,
821 handle_unused_attribute },
822 /* The same comments as for noreturn attributes apply to const ones. */
823 { "const", 0, 0, true, false, false,
824 handle_const_attribute },
825 { "transparent_union", 0, 0, false, false, false,
826 handle_transparent_union_attribute },
827 { "constructor", 0, 0, true, false, false,
828 handle_constructor_attribute },
829 { "destructor", 0, 0, true, false, false,
830 handle_destructor_attribute },
831 { "mode", 1, 1, false, true, false,
832 handle_mode_attribute },
833 { "section", 1, 1, true, false, false,
834 handle_section_attribute },
835 { "aligned", 0, 1, false, false, false,
836 handle_aligned_attribute },
837 { "weak", 0, 0, true, false, false,
838 handle_weak_attribute },
839 { "alias", 1, 1, true, false, false,
840 handle_alias_attribute },
841 { "no_instrument_function", 0, 0, true, false, false,
842 handle_no_instrument_function_attribute },
843 { "malloc", 0, 0, true, false, false,
844 handle_malloc_attribute },
845 { "no_stack_limit", 0, 0, true, false, false,
846 handle_no_limit_stack_attribute },
847 { "pure", 0, 0, true, false, false,
848 handle_pure_attribute },
849 { "deprecated", 0, 0, false, false, false,
850 handle_deprecated_attribute },
851 { "vector_size", 1, 1, false, true, false,
852 handle_vector_size_attribute },
853 { "visibility", 1, 1, true, false, false,
854 handle_visibility_attribute },
855 { "tls_model", 1, 1, true, false, false,
856 handle_tls_model_attribute },
857 { "nonnull", 0, -1, false, true, true,
858 handle_nonnull_attribute },
859 { "nothrow", 0, 0, true, false, false,
860 handle_nothrow_attribute },
861 { "may_alias", 0, 0, false, true, false, NULL },
862 { "cleanup", 1, 1, true, false, false,
863 handle_cleanup_attribute },
864 { "warn_unused_result", 0, 0, false, true, true,
865 handle_warn_unused_result_attribute },
866 { NULL, 0, 0, false, false, false, NULL }
869 /* Give the specifications for the format attributes, used by C and all
872 const struct attribute_spec c_common_format_attribute_table[] =
874 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
875 { "format", 3, 3, false, true, true,
876 handle_format_attribute },
877 { "format_arg", 1, 1, false, true, true,
878 handle_format_arg_attribute },
879 { NULL, 0, 0, false, false, false, NULL }
882 /* Record the start of an if-then, and record the start of it
883 for ambiguous else detection.
885 COND is the condition for the if-then statement.
887 IF_STMT is the statement node that has already been created for
888 this if-then statement. It is created before parsing the
889 condition to keep line number information accurate. */
892 c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
894 /* Make sure there is enough space on the stack. */
895 if (if_stack_space == 0)
898 if_stack = xmalloc (10 * sizeof (if_elt));
900 else if (if_stack_space == if_stack_pointer)
902 if_stack_space += 10;
903 if_stack = xrealloc (if_stack, if_stack_space * sizeof (if_elt));
906 IF_COND (if_stmt) = cond;
909 /* Record this if statement. */
910 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
911 if_stack[if_stack_pointer].locus = input_location;
912 if_stack[if_stack_pointer].needs_warning = 0;
913 if_stack[if_stack_pointer].if_stmt = if_stmt;
917 /* Called after the then-clause for an if-statement is processed. */
922 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
923 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
926 /* Record the end of an if-then. Optionally warn if a nested
927 if statement had an ambiguous else clause. */
930 c_expand_end_cond (void)
933 if (if_stack[if_stack_pointer].needs_warning)
934 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
935 &if_stack[if_stack_pointer].locus);
936 last_expr_type = NULL_TREE;
939 /* Called between the then-clause and the else-clause
940 of an if-then-else. */
943 c_expand_start_else (void)
945 /* An ambiguous else warning must be generated for the enclosing if
946 statement, unless we see an else branch for that one, too. */
948 && if_stack_pointer > 1
949 && (if_stack[if_stack_pointer - 1].compstmt_count
950 == if_stack[if_stack_pointer - 2].compstmt_count))
951 if_stack[if_stack_pointer - 2].needs_warning = 1;
953 /* Even if a nested if statement had an else branch, it can't be
954 ambiguous if this one also has an else. So don't warn in that
955 case. Also don't warn for any if statements nested in this else. */
956 if_stack[if_stack_pointer - 1].needs_warning = 0;
957 if_stack[if_stack_pointer - 1].compstmt_count--;
960 /* Called after the else-clause for an if-statement is processed. */
965 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
966 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
969 /* Begin an if-statement. Returns a newly created IF_STMT if
972 Unlike the C++ front-end, we do not call add_stmt here; it is
973 probably safe to do so, but I am not very familiar with this
974 code so I am being extra careful not to change its behavior
975 beyond what is strictly necessary for correctness. */
978 c_begin_if_stmt (void)
981 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
985 /* Begin a while statement. Returns a newly created WHILE_STMT if
988 Unlike the C++ front-end, we do not call add_stmt here; it is
989 probably safe to do so, but I am not very familiar with this
990 code so I am being extra careful not to change its behavior
991 beyond what is strictly necessary for correctness. */
994 c_begin_while_stmt (void)
997 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
1002 c_finish_while_stmt_cond (tree cond, tree while_stmt)
1004 WHILE_COND (while_stmt) = cond;
1007 /* Push current bindings for the function name VAR_DECLS. */
1010 start_fname_decls (void)
1013 tree saved = NULL_TREE;
1015 for (ix = 0; fname_vars[ix].decl; ix++)
1017 tree decl = *fname_vars[ix].decl;
1021 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
1022 *fname_vars[ix].decl = NULL_TREE;
1025 if (saved || saved_function_name_decls)
1026 /* Normally they'll have been NULL, so only push if we've got a
1027 stack, or they are non-NULL. */
1028 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1029 saved_function_name_decls);
1032 /* Finish up the current bindings, adding them into the
1033 current function's statement tree. This is done by wrapping the
1034 function's body in a COMPOUND_STMT containing these decls too. This
1035 must be done _before_ finish_stmt_tree is called. If there is no
1036 current function, we must be at file scope and no statements are
1037 involved. Pop the previous bindings. */
1040 finish_fname_decls (void)
1043 tree body = NULL_TREE;
1044 tree stack = saved_function_name_decls;
1046 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1047 body = chainon (TREE_VALUE (stack), body);
1051 /* They were called into existence, so add to statement tree. Add
1052 the DECL_STMTs inside the outermost scope. */
1053 tree *p = &DECL_SAVED_TREE (current_function_decl);
1054 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1055 while (TREE_CODE (*p) != COMPOUND_STMT)
1056 p = &TREE_CHAIN (*p);
1057 p = &COMPOUND_BODY (*p);
1058 if (TREE_CODE (*p) == SCOPE_STMT)
1059 p = &TREE_CHAIN (*p);
1061 body = chainon (body, *p);
1065 for (ix = 0; fname_vars[ix].decl; ix++)
1066 *fname_vars[ix].decl = NULL_TREE;
1070 /* We had saved values, restore them. */
1073 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1075 tree decl = TREE_PURPOSE (saved);
1076 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1078 *fname_vars[ix].decl = decl;
1080 stack = TREE_CHAIN (stack);
1082 saved_function_name_decls = stack;
1085 /* Return the text name of the current function, suitably prettified
1089 fname_as_string (int pretty_p)
1091 const char *name = "top level";
1100 if (current_function_decl)
1101 name = (*lang_hooks.decl_printable_name) (current_function_decl, vrb);
1106 /* Return the VAR_DECL for a const char array naming the current
1107 function. If the VAR_DECL has not yet been created, create it
1108 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1109 ID is its name (unfortunately C and C++ hold the RID values of
1110 keywords in different places, so we can't derive RID from ID in
1111 this language independent code. */
1114 fname_decl (unsigned int rid, tree id)
1117 tree decl = NULL_TREE;
1119 for (ix = 0; fname_vars[ix].decl; ix++)
1120 if (fname_vars[ix].rid == rid)
1123 decl = *fname_vars[ix].decl;
1126 tree saved_last_tree = last_tree;
1127 /* If a tree is built here, it would normally have the lineno of
1128 the current statement. Later this tree will be moved to the
1129 beginning of the function and this line number will be wrong.
1130 To avoid this problem set the lineno to 0 here; that prevents
1131 it from appearing in the RTL. */
1132 int saved_lineno = input_line;
1135 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1136 if (last_tree != saved_last_tree)
1138 /* We created some statement tree for the decl. This belongs
1139 at the start of the function, so remove it now and reinsert
1140 it after the function is complete. */
1141 tree stmts = TREE_CHAIN (saved_last_tree);
1143 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1144 last_tree = saved_last_tree;
1145 saved_function_name_decls = tree_cons (decl, stmts,
1146 saved_function_name_decls);
1148 *fname_vars[ix].decl = decl;
1149 input_line = saved_lineno;
1151 if (!ix && !current_function_decl)
1152 pedwarn ("%J'%D' is not defined outside of function scope", decl, decl);
1157 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1160 fix_string_type (tree value)
1162 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1163 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1164 const int nchars_max = flag_isoc99 ? 4095 : 509;
1165 int length = TREE_STRING_LENGTH (value);
1168 /* Compute the number of elements, for the array type. */
1169 nchars = wide_flag ? length / wchar_bytes : length;
1171 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1172 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1173 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1175 /* Create the array type for the string constant.
1176 -Wwrite-strings says make the string constant an array of const char
1177 so that copying it to a non-const pointer will get a warning.
1178 For C++, this is the standard behavior. */
1179 if (flag_const_strings && ! flag_writable_strings)
1182 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1185 = build_array_type (elements,
1186 build_index_type (build_int_2 (nchars - 1, 0)));
1190 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1191 build_index_type (build_int_2 (nchars - 1, 0)));
1193 TREE_CONSTANT (value) = 1;
1194 TREE_READONLY (value) = ! flag_writable_strings;
1195 TREE_STATIC (value) = 1;
1199 /* Print a warning if a constant expression had overflow in folding.
1200 Invoke this function on every expression that the language
1201 requires to be a constant expression.
1202 Note the ANSI C standard says it is erroneous for a
1203 constant expression to overflow. */
1206 constant_expression_warning (tree value)
1208 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1209 || TREE_CODE (value) == VECTOR_CST
1210 || TREE_CODE (value) == COMPLEX_CST)
1211 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1212 pedwarn ("overflow in constant expression");
1215 /* Print a warning if an expression had overflow in folding.
1216 Invoke this function on every expression that
1217 (1) appears in the source code, and
1218 (2) might be a constant expression that overflowed, and
1219 (3) is not already checked by convert_and_check;
1220 however, do not invoke this function on operands of explicit casts. */
1223 overflow_warning (tree value)
1225 if ((TREE_CODE (value) == INTEGER_CST
1226 || (TREE_CODE (value) == COMPLEX_CST
1227 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1228 && TREE_OVERFLOW (value))
1230 TREE_OVERFLOW (value) = 0;
1231 if (skip_evaluation == 0)
1232 warning ("integer overflow in expression");
1234 else if ((TREE_CODE (value) == REAL_CST
1235 || (TREE_CODE (value) == COMPLEX_CST
1236 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1237 && TREE_OVERFLOW (value))
1239 TREE_OVERFLOW (value) = 0;
1240 if (skip_evaluation == 0)
1241 warning ("floating point overflow in expression");
1243 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1245 TREE_OVERFLOW (value) = 0;
1246 if (skip_evaluation == 0)
1247 warning ("vector overflow in expression");
1251 /* Print a warning if a large constant is truncated to unsigned,
1252 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1253 Invoke this function on every expression that might be implicitly
1254 converted to an unsigned type. */
1257 unsigned_conversion_warning (tree result, tree operand)
1259 tree type = TREE_TYPE (result);
1261 if (TREE_CODE (operand) == INTEGER_CST
1262 && TREE_CODE (type) == INTEGER_TYPE
1263 && TREE_UNSIGNED (type)
1264 && skip_evaluation == 0
1265 && !int_fits_type_p (operand, type))
1267 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1268 /* This detects cases like converting -129 or 256 to unsigned char. */
1269 warning ("large integer implicitly truncated to unsigned type");
1270 else if (warn_conversion)
1271 warning ("negative integer implicitly converted to unsigned type");
1275 /* Nonzero if constant C has a value that is permissible
1276 for type TYPE (an INTEGER_TYPE). */
1279 constant_fits_type_p (tree c, tree type)
1281 if (TREE_CODE (c) == INTEGER_CST)
1282 return int_fits_type_p (c, type);
1284 c = convert (type, c);
1285 return !TREE_OVERFLOW (c);
1288 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1289 Invoke this function on every expression that is converted implicitly,
1290 i.e. because of language rules and not because of an explicit cast. */
1293 convert_and_check (tree type, tree expr)
1295 tree t = convert (type, expr);
1296 if (TREE_CODE (t) == INTEGER_CST)
1298 if (TREE_OVERFLOW (t))
1300 TREE_OVERFLOW (t) = 0;
1302 /* Do not diagnose overflow in a constant expression merely
1303 because a conversion overflowed. */
1304 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1306 /* No warning for converting 0x80000000 to int. */
1307 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1308 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1309 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1310 /* If EXPR fits in the unsigned version of TYPE,
1311 don't warn unless pedantic. */
1313 || TREE_UNSIGNED (type)
1314 || ! constant_fits_type_p (expr,
1315 c_common_unsigned_type (type)))
1316 && skip_evaluation == 0)
1317 warning ("overflow in implicit constant conversion");
1320 unsigned_conversion_warning (t, expr);
1325 /* A node in a list that describes references to variables (EXPR), which are
1326 either read accesses if WRITER is zero, or write accesses, in which case
1327 WRITER is the parent of EXPR. */
1334 /* Used to implement a cache the results of a call to verify_tree. We only
1335 use this for SAVE_EXPRs. */
1338 struct tlist_cache *next;
1339 struct tlist *cache_before_sp;
1340 struct tlist *cache_after_sp;
1344 /* Obstack to use when allocating tlist structures, and corresponding
1346 static struct obstack tlist_obstack;
1347 static char *tlist_firstobj = 0;
1349 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1351 static struct tlist *warned_ids;
1352 /* SAVE_EXPRs need special treatment. We process them only once and then
1353 cache the results. */
1354 static struct tlist_cache *save_expr_cache;
1356 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1357 static void merge_tlist (struct tlist **, struct tlist *, int);
1358 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1359 static int warning_candidate_p (tree);
1360 static void warn_for_collisions (struct tlist *);
1361 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1362 static struct tlist *new_tlist (struct tlist *, tree, tree);
1363 static void verify_sequence_points (tree);
1365 /* Create a new struct tlist and fill in its fields. */
1366 static struct tlist *
1367 new_tlist (struct tlist *next, tree t, tree writer)
1370 l = obstack_alloc (&tlist_obstack, sizeof *l);
1377 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1378 is nonnull, we ignore any node we find which has a writer equal to it. */
1381 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1385 struct tlist *next = add->next;
1388 if (! exclude_writer || add->writer != exclude_writer)
1389 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1394 /* Merge the nodes of ADD into TO. This merging process is done so that for
1395 each variable that already exists in TO, no new node is added; however if
1396 there is a write access recorded in ADD, and an occurrence on TO is only
1397 a read access, then the occurrence in TO will be modified to record the
1401 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1403 struct tlist **end = to;
1406 end = &(*end)->next;
1412 struct tlist *next = add->next;
1414 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1415 if (tmp2->expr == add->expr)
1419 tmp2->writer = add->writer;
1423 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1424 end = &(*end)->next;
1431 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1432 references in list LIST conflict with it, excluding reads if ONLY writers
1436 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1441 /* Avoid duplicate warnings. */
1442 for (tmp = warned_ids; tmp; tmp = tmp->next)
1443 if (tmp->expr == written)
1448 if (list->expr == written
1449 && list->writer != writer
1450 && (! only_writes || list->writer))
1452 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1453 warning ("operation on `%s' may be undefined",
1454 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1460 /* Given a list LIST of references to variables, find whether any of these
1461 can cause conflicts due to missing sequence points. */
1464 warn_for_collisions (struct tlist *list)
1468 for (tmp = list; tmp; tmp = tmp->next)
1471 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1475 /* Return nonzero if X is a tree that can be verified by the sequence point
1478 warning_candidate_p (tree x)
1480 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1483 /* Walk the tree X, and record accesses to variables. If X is written by the
1484 parent tree, WRITER is the parent.
1485 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1486 expression or its only operand forces a sequence point, then everything up
1487 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1489 Once we return, we will have emitted warnings if any subexpression before
1490 such a sequence point could be undefined. On a higher level, however, the
1491 sequence point may not be relevant, and we'll merge the two lists.
1493 Example: (b++, a) + b;
1494 The call that processes the COMPOUND_EXPR will store the increment of B
1495 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1496 processes the PLUS_EXPR will need to merge the two lists so that
1497 eventually, all accesses end up on the same list (and we'll warn about the
1498 unordered subexpressions b++ and b.
1500 A note on merging. If we modify the former example so that our expression
1503 care must be taken not simply to add all three expressions into the final
1504 PNO_SP list. The function merge_tlist takes care of that by merging the
1505 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1506 way, so that no more than one access to B is recorded. */
1509 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1512 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1513 enum tree_code code;
1516 /* X may be NULL if it is the operand of an empty statement expression
1522 code = TREE_CODE (x);
1523 class = TREE_CODE_CLASS (code);
1525 if (warning_candidate_p (x))
1527 *pno_sp = new_tlist (*pno_sp, x, writer);
1537 case TRUTH_ANDIF_EXPR:
1538 case TRUTH_ORIF_EXPR:
1539 tmp_before = tmp_nosp = tmp_list3 = 0;
1540 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1541 warn_for_collisions (tmp_nosp);
1542 merge_tlist (pbefore_sp, tmp_before, 0);
1543 merge_tlist (pbefore_sp, tmp_nosp, 0);
1544 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1545 merge_tlist (pbefore_sp, tmp_list3, 0);
1549 tmp_before = tmp_list2 = 0;
1550 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1551 warn_for_collisions (tmp_list2);
1552 merge_tlist (pbefore_sp, tmp_before, 0);
1553 merge_tlist (pbefore_sp, tmp_list2, 1);
1555 tmp_list3 = tmp_nosp = 0;
1556 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1557 warn_for_collisions (tmp_nosp);
1558 merge_tlist (pbefore_sp, tmp_list3, 0);
1560 tmp_list3 = tmp_list2 = 0;
1561 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1562 warn_for_collisions (tmp_list2);
1563 merge_tlist (pbefore_sp, tmp_list3, 0);
1564 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1565 two first, to avoid warning for (a ? b++ : b++). */
1566 merge_tlist (&tmp_nosp, tmp_list2, 0);
1567 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1570 case PREDECREMENT_EXPR:
1571 case PREINCREMENT_EXPR:
1572 case POSTDECREMENT_EXPR:
1573 case POSTINCREMENT_EXPR:
1574 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1578 tmp_before = tmp_nosp = tmp_list3 = 0;
1579 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1580 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1581 /* Expressions inside the LHS are not ordered wrt. the sequence points
1582 in the RHS. Example:
1584 Despite the fact that the modification of "a" is in the before_sp
1585 list (tmp_before), it conflicts with the use of "a" in the LHS.
1586 We can handle this by adding the contents of tmp_list3
1587 to those of tmp_before, and redoing the collision warnings for that
1589 add_tlist (&tmp_before, tmp_list3, x, 1);
1590 warn_for_collisions (tmp_before);
1591 /* Exclude the LHS itself here; we first have to merge it into the
1592 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1593 didn't exclude the LHS, we'd get it twice, once as a read and once
1595 add_tlist (pno_sp, tmp_list3, x, 0);
1596 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1598 merge_tlist (pbefore_sp, tmp_before, 0);
1599 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1600 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1601 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1605 /* We need to warn about conflicts among arguments and conflicts between
1606 args and the function address. Side effects of the function address,
1607 however, are not ordered by the sequence point of the call. */
1608 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1609 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1610 if (TREE_OPERAND (x, 1))
1611 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1612 merge_tlist (&tmp_list3, tmp_list2, 0);
1613 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1614 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1615 warn_for_collisions (tmp_before);
1616 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1620 /* Scan all the list, e.g. indices of multi dimensional array. */
1623 tmp_before = tmp_nosp = 0;
1624 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1625 merge_tlist (&tmp_nosp, tmp_before, 0);
1626 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1633 struct tlist_cache *t;
1634 for (t = save_expr_cache; t; t = t->next)
1640 t = obstack_alloc (&tlist_obstack, sizeof *t);
1641 t->next = save_expr_cache;
1643 save_expr_cache = t;
1645 tmp_before = tmp_nosp = 0;
1646 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1647 warn_for_collisions (tmp_nosp);
1652 struct tlist *t = tmp_nosp;
1654 merge_tlist (&tmp_list3, t, 0);
1656 t->cache_before_sp = tmp_before;
1657 t->cache_after_sp = tmp_list3;
1659 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1660 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1669 if (first_rtl_op (code) == 0)
1671 x = TREE_OPERAND (x, 0);
1687 int max = first_rtl_op (TREE_CODE (x));
1688 for (lp = 0; lp < max; lp++)
1690 tmp_before = tmp_nosp = 0;
1691 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1692 merge_tlist (&tmp_nosp, tmp_before, 0);
1693 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1700 /* Try to warn for undefined behavior in EXPR due to missing sequence
1704 verify_sequence_points (tree expr)
1706 struct tlist *before_sp = 0, *after_sp = 0;
1709 save_expr_cache = 0;
1710 if (tlist_firstobj == 0)
1712 gcc_obstack_init (&tlist_obstack);
1713 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1716 verify_tree (expr, &before_sp, &after_sp, 0);
1717 warn_for_collisions (after_sp);
1718 obstack_free (&tlist_obstack, tlist_firstobj);
1722 c_expand_expr_stmt (tree expr)
1724 /* Do default conversion if safe and possibly important,
1725 in case within ({...}). */
1726 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1727 && (flag_isoc99 || lvalue_p (expr)))
1728 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1729 expr = default_conversion (expr);
1731 if (warn_sequence_point)
1732 verify_sequence_points (expr);
1734 if (TREE_TYPE (expr) != error_mark_node
1735 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1736 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1737 error ("expression statement has incomplete type");
1739 last_expr_type = TREE_TYPE (expr);
1740 return add_stmt (build_stmt (EXPR_STMT, expr));
1743 /* Validate the expression after `case' and apply default promotions. */
1746 check_case_value (tree value)
1748 if (value == NULL_TREE)
1751 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1752 STRIP_TYPE_NOPS (value);
1753 /* In C++, the following is allowed:
1756 switch (...) { case i: ... }
1758 So, we try to reduce the VALUE to a constant that way. */
1759 if (c_dialect_cxx ())
1761 value = decl_constant_value (value);
1762 STRIP_TYPE_NOPS (value);
1763 value = fold (value);
1766 if (TREE_CODE (value) != INTEGER_CST
1767 && value != error_mark_node)
1769 error ("case label does not reduce to an integer constant");
1770 value = error_mark_node;
1773 /* Promote char or short to int. */
1774 value = default_conversion (value);
1776 constant_expression_warning (value);
1781 /* Return an integer type with BITS bits of precision,
1782 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1785 c_common_type_for_size (unsigned int bits, int unsignedp)
1787 if (bits == TYPE_PRECISION (integer_type_node))
1788 return unsignedp ? unsigned_type_node : integer_type_node;
1790 if (bits == TYPE_PRECISION (signed_char_type_node))
1791 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1793 if (bits == TYPE_PRECISION (short_integer_type_node))
1794 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1796 if (bits == TYPE_PRECISION (long_integer_type_node))
1797 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1799 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1800 return (unsignedp ? long_long_unsigned_type_node
1801 : long_long_integer_type_node);
1803 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1804 return (unsignedp ? widest_unsigned_literal_type_node
1805 : widest_integer_literal_type_node);
1807 if (bits <= TYPE_PRECISION (intQI_type_node))
1808 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1810 if (bits <= TYPE_PRECISION (intHI_type_node))
1811 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1813 if (bits <= TYPE_PRECISION (intSI_type_node))
1814 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1816 if (bits <= TYPE_PRECISION (intDI_type_node))
1817 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1822 /* Used for communication between c_common_type_for_mode and
1823 c_register_builtin_type. */
1824 static GTY(()) tree registered_builtin_types;
1826 /* Return a data type that has machine mode MODE.
1827 If the mode is an integer,
1828 then UNSIGNEDP selects between signed and unsigned types. */
1831 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1835 if (mode == TYPE_MODE (integer_type_node))
1836 return unsignedp ? unsigned_type_node : integer_type_node;
1838 if (mode == TYPE_MODE (signed_char_type_node))
1839 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1841 if (mode == TYPE_MODE (short_integer_type_node))
1842 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1844 if (mode == TYPE_MODE (long_integer_type_node))
1845 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1847 if (mode == TYPE_MODE (long_long_integer_type_node))
1848 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1850 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1851 return unsignedp ? widest_unsigned_literal_type_node
1852 : widest_integer_literal_type_node;
1855 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1858 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1861 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1864 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1866 #if HOST_BITS_PER_WIDE_INT >= 64
1867 if (mode == TYPE_MODE (intTI_type_node))
1868 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1871 if (mode == TYPE_MODE (float_type_node))
1872 return float_type_node;
1874 if (mode == TYPE_MODE (double_type_node))
1875 return double_type_node;
1877 if (mode == TYPE_MODE (long_double_type_node))
1878 return long_double_type_node;
1880 if (mode == TYPE_MODE (void_type_node))
1881 return void_type_node;
1883 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1884 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1886 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1887 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1892 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1894 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1896 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
1898 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
1900 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
1902 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
1904 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
1906 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
1908 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
1910 return V16SF_type_node;
1912 return V4SF_type_node;
1914 return V2SF_type_node;
1916 return V2DF_type_node;
1918 return V4DF_type_node;
1923 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1924 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1925 return TREE_VALUE (t);
1930 /* Return an unsigned type the same as TYPE in other respects. */
1932 c_common_unsigned_type (tree type)
1934 tree type1 = TYPE_MAIN_VARIANT (type);
1935 if (type1 == signed_char_type_node || type1 == char_type_node)
1936 return unsigned_char_type_node;
1937 if (type1 == integer_type_node)
1938 return unsigned_type_node;
1939 if (type1 == short_integer_type_node)
1940 return short_unsigned_type_node;
1941 if (type1 == long_integer_type_node)
1942 return long_unsigned_type_node;
1943 if (type1 == long_long_integer_type_node)
1944 return long_long_unsigned_type_node;
1945 if (type1 == widest_integer_literal_type_node)
1946 return widest_unsigned_literal_type_node;
1947 #if HOST_BITS_PER_WIDE_INT >= 64
1948 if (type1 == intTI_type_node)
1949 return unsigned_intTI_type_node;
1951 if (type1 == intDI_type_node)
1952 return unsigned_intDI_type_node;
1953 if (type1 == intSI_type_node)
1954 return unsigned_intSI_type_node;
1955 if (type1 == intHI_type_node)
1956 return unsigned_intHI_type_node;
1957 if (type1 == intQI_type_node)
1958 return unsigned_intQI_type_node;
1960 return c_common_signed_or_unsigned_type (1, type);
1963 /* Return a signed type the same as TYPE in other respects. */
1966 c_common_signed_type (tree type)
1968 tree type1 = TYPE_MAIN_VARIANT (type);
1969 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1970 return signed_char_type_node;
1971 if (type1 == unsigned_type_node)
1972 return integer_type_node;
1973 if (type1 == short_unsigned_type_node)
1974 return short_integer_type_node;
1975 if (type1 == long_unsigned_type_node)
1976 return long_integer_type_node;
1977 if (type1 == long_long_unsigned_type_node)
1978 return long_long_integer_type_node;
1979 if (type1 == widest_unsigned_literal_type_node)
1980 return widest_integer_literal_type_node;
1981 #if HOST_BITS_PER_WIDE_INT >= 64
1982 if (type1 == unsigned_intTI_type_node)
1983 return intTI_type_node;
1985 if (type1 == unsigned_intDI_type_node)
1986 return intDI_type_node;
1987 if (type1 == unsigned_intSI_type_node)
1988 return intSI_type_node;
1989 if (type1 == unsigned_intHI_type_node)
1990 return intHI_type_node;
1991 if (type1 == unsigned_intQI_type_node)
1992 return intQI_type_node;
1994 return c_common_signed_or_unsigned_type (0, type);
1997 /* Return a type the same as TYPE except unsigned or
1998 signed according to UNSIGNEDP. */
2001 c_common_signed_or_unsigned_type (int unsignedp, tree type)
2003 if (! INTEGRAL_TYPE_P (type)
2004 || TREE_UNSIGNED (type) == unsignedp)
2007 /* Must check the mode of the types, not the precision. Enumeral types
2008 in C++ have precision set to match their range, but may use a wider
2009 mode to match an ABI. If we change modes, we may wind up with bad
2012 if (TYPE_MODE (type) == TYPE_MODE (signed_char_type_node))
2013 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2014 if (TYPE_MODE (type) == TYPE_MODE (integer_type_node))
2015 return unsignedp ? unsigned_type_node : integer_type_node;
2016 if (TYPE_MODE (type) == TYPE_MODE (short_integer_type_node))
2017 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2018 if (TYPE_MODE (type) == TYPE_MODE (long_integer_type_node))
2019 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2020 if (TYPE_MODE (type) == TYPE_MODE (long_long_integer_type_node))
2021 return (unsignedp ? long_long_unsigned_type_node
2022 : long_long_integer_type_node);
2023 if (TYPE_MODE (type) == TYPE_MODE (widest_integer_literal_type_node))
2024 return (unsignedp ? widest_unsigned_literal_type_node
2025 : widest_integer_literal_type_node);
2027 #if HOST_BITS_PER_WIDE_INT >= 64
2028 if (TYPE_MODE (type) == TYPE_MODE (intTI_type_node))
2029 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2031 if (TYPE_MODE (type) == TYPE_MODE (intDI_type_node))
2032 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2033 if (TYPE_MODE (type) == TYPE_MODE (intSI_type_node))
2034 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2035 if (TYPE_MODE (type) == TYPE_MODE (intHI_type_node))
2036 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2037 if (TYPE_MODE (type) == TYPE_MODE (intQI_type_node))
2038 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2043 /* The C version of the register_builtin_type langhook. */
2046 c_register_builtin_type (tree type, const char* name)
2050 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2051 DECL_ARTIFICIAL (decl) = 1;
2052 if (!TYPE_NAME (type))
2053 TYPE_NAME (type) = decl;
2056 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
2060 /* Return the minimum number of bits needed to represent VALUE in a
2061 signed or unsigned type, UNSIGNEDP says which. */
2064 min_precision (tree value, int unsignedp)
2068 /* If the value is negative, compute its negative minus 1. The latter
2069 adjustment is because the absolute value of the largest negative value
2070 is one larger than the largest positive value. This is equivalent to
2071 a bit-wise negation, so use that operation instead. */
2073 if (tree_int_cst_sgn (value) < 0)
2074 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2076 /* Return the number of bits needed, taking into account the fact
2077 that we need one more bit for a signed than unsigned type. */
2079 if (integer_zerop (value))
2082 log = tree_floor_log2 (value);
2084 return log + 1 + ! unsignedp;
2087 /* Print an error message for invalid operands to arith operation
2088 CODE. NOP_EXPR is used as a special case (see
2089 c_common_truthvalue_conversion). */
2092 binary_op_error (enum tree_code code)
2099 error ("invalid truth-value expression");
2103 opname = "+"; break;
2105 opname = "-"; break;
2107 opname = "*"; break;
2109 opname = "max"; break;
2111 opname = "min"; break;
2113 opname = "=="; break;
2115 opname = "!="; break;
2117 opname = "<="; break;
2119 opname = ">="; break;
2121 opname = "<"; break;
2123 opname = ">"; break;
2125 opname = "<<"; break;
2127 opname = ">>"; break;
2128 case TRUNC_MOD_EXPR:
2129 case FLOOR_MOD_EXPR:
2130 opname = "%"; break;
2131 case TRUNC_DIV_EXPR:
2132 case FLOOR_DIV_EXPR:
2133 opname = "/"; break;
2135 opname = "&"; break;
2137 opname = "|"; break;
2138 case TRUTH_ANDIF_EXPR:
2139 opname = "&&"; break;
2140 case TRUTH_ORIF_EXPR:
2141 opname = "||"; break;
2143 opname = "^"; break;
2146 opname = "rotate"; break;
2148 opname = "unknown"; break;
2150 error ("invalid operands to binary %s", opname);
2153 /* Subroutine of build_binary_op, used for comparison operations.
2154 See if the operands have both been converted from subword integer types
2155 and, if so, perhaps change them both back to their original type.
2156 This function is also responsible for converting the two operands
2157 to the proper common type for comparison.
2159 The arguments of this function are all pointers to local variables
2160 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2161 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2163 If this function returns nonzero, it means that the comparison has
2164 a constant value. What this function returns is an expression for
2168 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2169 enum tree_code *rescode_ptr)
2172 tree op0 = *op0_ptr;
2173 tree op1 = *op1_ptr;
2174 int unsignedp0, unsignedp1;
2176 tree primop0, primop1;
2177 enum tree_code code = *rescode_ptr;
2179 /* Throw away any conversions to wider types
2180 already present in the operands. */
2182 primop0 = get_narrower (op0, &unsignedp0);
2183 primop1 = get_narrower (op1, &unsignedp1);
2185 /* Handle the case that OP0 does not *contain* a conversion
2186 but it *requires* conversion to FINAL_TYPE. */
2188 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2189 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2190 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2191 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2193 /* If one of the operands must be floated, we cannot optimize. */
2194 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2195 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2197 /* If first arg is constant, swap the args (changing operation
2198 so value is preserved), for canonicalization. Don't do this if
2199 the second arg is 0. */
2201 if (TREE_CONSTANT (primop0)
2202 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2205 int temi = unsignedp0;
2213 unsignedp0 = unsignedp1;
2236 *rescode_ptr = code;
2239 /* If comparing an integer against a constant more bits wide,
2240 maybe we can deduce a value of 1 or 0 independent of the data.
2241 Or else truncate the constant now
2242 rather than extend the variable at run time.
2244 This is only interesting if the constant is the wider arg.
2245 Also, it is not safe if the constant is unsigned and the
2246 variable arg is signed, since in this case the variable
2247 would be sign-extended and then regarded as unsigned.
2248 Our technique fails in this case because the lowest/highest
2249 possible unsigned results don't follow naturally from the
2250 lowest/highest possible values of the variable operand.
2251 For just EQ_EXPR and NE_EXPR there is another technique that
2252 could be used: see if the constant can be faithfully represented
2253 in the other operand's type, by truncating it and reextending it
2254 and see if that preserves the constant's value. */
2256 if (!real1 && !real2
2257 && TREE_CODE (primop1) == INTEGER_CST
2258 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2260 int min_gt, max_gt, min_lt, max_lt;
2261 tree maxval, minval;
2262 /* 1 if comparison is nominally unsigned. */
2263 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2266 type = c_common_signed_or_unsigned_type (unsignedp0,
2267 TREE_TYPE (primop0));
2269 /* In C, if TYPE is an enumeration, then we need to get its
2270 min/max values from it's underlying integral type, not the
2271 enumerated type itself. In C++, TYPE_MAX_VALUE and
2272 TYPE_MIN_VALUE have already been set correctly on the
2273 enumeration type. */
2274 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
2275 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2277 maxval = TYPE_MAX_VALUE (type);
2278 minval = TYPE_MIN_VALUE (type);
2280 if (unsignedp && !unsignedp0)
2281 *restype_ptr = c_common_signed_type (*restype_ptr);
2283 if (TREE_TYPE (primop1) != *restype_ptr)
2284 primop1 = convert (*restype_ptr, primop1);
2285 if (type != *restype_ptr)
2287 minval = convert (*restype_ptr, minval);
2288 maxval = convert (*restype_ptr, maxval);
2291 if (unsignedp && unsignedp0)
2293 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2294 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2295 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2296 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2300 min_gt = INT_CST_LT (primop1, minval);
2301 max_gt = INT_CST_LT (primop1, maxval);
2302 min_lt = INT_CST_LT (minval, primop1);
2303 max_lt = INT_CST_LT (maxval, primop1);
2307 /* This used to be a switch, but Genix compiler can't handle that. */
2308 if (code == NE_EXPR)
2310 if (max_lt || min_gt)
2311 val = truthvalue_true_node;
2313 else if (code == EQ_EXPR)
2315 if (max_lt || min_gt)
2316 val = truthvalue_false_node;
2318 else if (code == LT_EXPR)
2321 val = truthvalue_true_node;
2323 val = truthvalue_false_node;
2325 else if (code == GT_EXPR)
2328 val = truthvalue_true_node;
2330 val = truthvalue_false_node;
2332 else if (code == LE_EXPR)
2335 val = truthvalue_true_node;
2337 val = truthvalue_false_node;
2339 else if (code == GE_EXPR)
2342 val = truthvalue_true_node;
2344 val = truthvalue_false_node;
2347 /* If primop0 was sign-extended and unsigned comparison specd,
2348 we did a signed comparison above using the signed type bounds.
2349 But the comparison we output must be unsigned.
2351 Also, for inequalities, VAL is no good; but if the signed
2352 comparison had *any* fixed result, it follows that the
2353 unsigned comparison just tests the sign in reverse
2354 (positive values are LE, negative ones GE).
2355 So we can generate an unsigned comparison
2356 against an extreme value of the signed type. */
2358 if (unsignedp && !unsignedp0)
2365 primop1 = TYPE_MIN_VALUE (type);
2371 primop1 = TYPE_MAX_VALUE (type);
2378 type = c_common_unsigned_type (type);
2381 if (TREE_CODE (primop0) != INTEGER_CST)
2383 if (val == truthvalue_false_node)
2384 warning ("comparison is always false due to limited range of data type");
2385 if (val == truthvalue_true_node)
2386 warning ("comparison is always true due to limited range of data type");
2391 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2392 if (TREE_SIDE_EFFECTS (primop0))
2393 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2397 /* Value is not predetermined, but do the comparison
2398 in the type of the operand that is not constant.
2399 TYPE is already properly set. */
2401 else if (real1 && real2
2402 && (TYPE_PRECISION (TREE_TYPE (primop0))
2403 == TYPE_PRECISION (TREE_TYPE (primop1))))
2404 type = TREE_TYPE (primop0);
2406 /* If args' natural types are both narrower than nominal type
2407 and both extend in the same manner, compare them
2408 in the type of the wider arg.
2409 Otherwise must actually extend both to the nominal
2410 common type lest different ways of extending
2412 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2414 else if (unsignedp0 == unsignedp1 && real1 == real2
2415 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2416 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2418 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2419 type = c_common_signed_or_unsigned_type (unsignedp0
2420 || TREE_UNSIGNED (*restype_ptr),
2422 /* Make sure shorter operand is extended the right way
2423 to match the longer operand. */
2425 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2426 TREE_TYPE (primop0)),
2429 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2430 TREE_TYPE (primop1)),
2435 /* Here we must do the comparison on the nominal type
2436 using the args exactly as we received them. */
2437 type = *restype_ptr;
2441 if (!real1 && !real2 && integer_zerop (primop1)
2442 && TREE_UNSIGNED (*restype_ptr))
2448 /* All unsigned values are >= 0, so we warn if extra warnings
2449 are requested. However, if OP0 is a constant that is
2450 >= 0, the signedness of the comparison isn't an issue,
2451 so suppress the warning. */
2452 if (extra_warnings && !in_system_header
2453 && ! (TREE_CODE (primop0) == INTEGER_CST
2454 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2456 warning ("comparison of unsigned expression >= 0 is always true");
2457 value = truthvalue_true_node;
2461 if (extra_warnings && !in_system_header
2462 && ! (TREE_CODE (primop0) == INTEGER_CST
2463 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2465 warning ("comparison of unsigned expression < 0 is always false");
2466 value = truthvalue_false_node;
2475 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2476 if (TREE_SIDE_EFFECTS (primop0))
2477 return build (COMPOUND_EXPR, TREE_TYPE (value),
2484 *op0_ptr = convert (type, primop0);
2485 *op1_ptr = convert (type, primop1);
2487 *restype_ptr = truthvalue_type_node;
2492 /* Return a tree for the sum or difference (RESULTCODE says which)
2493 of pointer PTROP and integer INTOP. */
2496 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2503 /* The result is a pointer of the same type that is being added. */
2505 tree result_type = TREE_TYPE (ptrop);
2507 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2509 if (pedantic || warn_pointer_arith)
2510 pedwarn ("pointer of type `void *' used in arithmetic");
2511 size_exp = integer_one_node;
2513 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2515 if (pedantic || warn_pointer_arith)
2516 pedwarn ("pointer to a function used in arithmetic");
2517 size_exp = integer_one_node;
2519 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2521 if (pedantic || warn_pointer_arith)
2522 pedwarn ("pointer to member function used in arithmetic");
2523 size_exp = integer_one_node;
2525 else if (TREE_CODE (TREE_TYPE (result_type)) == OFFSET_TYPE)
2527 if (pedantic || warn_pointer_arith)
2528 pedwarn ("pointer to a member used in arithmetic");
2529 size_exp = integer_one_node;
2532 size_exp = size_in_bytes (TREE_TYPE (result_type));
2534 /* If what we are about to multiply by the size of the elements
2535 contains a constant term, apply distributive law
2536 and multiply that constant term separately.
2537 This helps produce common subexpressions. */
2539 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2540 && ! TREE_CONSTANT (intop)
2541 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2542 && TREE_CONSTANT (size_exp)
2543 /* If the constant comes from pointer subtraction,
2544 skip this optimization--it would cause an error. */
2545 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2546 /* If the constant is unsigned, and smaller than the pointer size,
2547 then we must skip this optimization. This is because it could cause
2548 an overflow error if the constant is negative but INTOP is not. */
2549 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2550 || (TYPE_PRECISION (TREE_TYPE (intop))
2551 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2553 enum tree_code subcode = resultcode;
2554 tree int_type = TREE_TYPE (intop);
2555 if (TREE_CODE (intop) == MINUS_EXPR)
2556 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2557 /* Convert both subexpression types to the type of intop,
2558 because weird cases involving pointer arithmetic
2559 can result in a sum or difference with different type args. */
2560 ptrop = build_binary_op (subcode, ptrop,
2561 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2562 intop = convert (int_type, TREE_OPERAND (intop, 0));
2565 /* Convert the integer argument to a type the same size as sizetype
2566 so the multiply won't overflow spuriously. */
2568 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2569 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2570 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2571 TREE_UNSIGNED (sizetype)), intop);
2573 /* Replace the integer argument with a suitable product by the object size.
2574 Do this multiplication as signed, then convert to the appropriate
2575 pointer type (actually unsigned integral). */
2577 intop = convert (result_type,
2578 build_binary_op (MULT_EXPR, intop,
2579 convert (TREE_TYPE (intop), size_exp), 1));
2581 /* Create the sum or difference. */
2583 result = build (resultcode, result_type, ptrop, intop);
2585 folded = fold (result);
2586 if (folded == result)
2587 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2591 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2592 or validate its data type for an `if' or `while' statement or ?..: exp.
2594 This preparation consists of taking the ordinary
2595 representation of an expression expr and producing a valid tree
2596 boolean expression describing whether expr is nonzero. We could
2597 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2598 but we optimize comparisons, &&, ||, and !.
2600 The resulting type should always be `truthvalue_type_node'. */
2603 c_common_truthvalue_conversion (tree expr)
2605 if (TREE_CODE (expr) == ERROR_MARK)
2608 if (TREE_CODE (expr) == FUNCTION_DECL)
2609 expr = build_unary_op (ADDR_EXPR, expr, 0);
2611 #if 0 /* This appears to be wrong for C++. */
2612 /* These really should return error_mark_node after 2.4 is stable.
2613 But not all callers handle ERROR_MARK properly. */
2614 switch (TREE_CODE (TREE_TYPE (expr)))
2617 error ("struct type value used where scalar is required");
2618 return truthvalue_false_node;
2621 error ("union type value used where scalar is required");
2622 return truthvalue_false_node;
2625 error ("array type value used where scalar is required");
2626 return truthvalue_false_node;
2633 switch (TREE_CODE (expr))
2636 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2637 case TRUTH_ANDIF_EXPR:
2638 case TRUTH_ORIF_EXPR:
2639 case TRUTH_AND_EXPR:
2641 case TRUTH_XOR_EXPR:
2642 case TRUTH_NOT_EXPR:
2643 TREE_TYPE (expr) = truthvalue_type_node;
2650 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2653 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2657 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2658 && ! DECL_WEAK (TREE_OPERAND (expr, 0)))
2660 /* Common Ada/Pascal programmer's mistake. We always warn
2661 about this since it is so bad. */
2662 warning ("the address of `%D', will always evaluate as `true'",
2663 TREE_OPERAND (expr, 0));
2664 return truthvalue_true_node;
2667 /* If we are taking the address of an external decl, it might be
2668 zero if it is weak, so we cannot optimize. */
2669 if (DECL_P (TREE_OPERAND (expr, 0))
2670 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2673 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2674 return build (COMPOUND_EXPR, truthvalue_type_node,
2675 TREE_OPERAND (expr, 0), truthvalue_true_node);
2677 return truthvalue_true_node;
2681 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2682 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2683 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2684 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2690 /* These don't change whether an object is nonzero or zero. */
2691 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2695 /* These don't change whether an object is zero or nonzero, but
2696 we can't ignore them if their second arg has side-effects. */
2697 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2698 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2699 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2701 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2704 /* Distribute the conversion into the arms of a COND_EXPR. */
2705 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2706 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2707 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2710 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2711 since that affects how `default_conversion' will behave. */
2712 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2713 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2715 /* Fall through.... */
2717 /* If this is widening the argument, we can ignore it. */
2718 if (TYPE_PRECISION (TREE_TYPE (expr))
2719 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2720 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2724 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2725 aren't guaranteed to the be same for modes that can represent
2726 infinity, since if x and y are both +infinity, or both
2727 -infinity, then x - y is not a number.
2729 Note that this transformation is safe when x or y is NaN.
2730 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2732 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2734 /* Fall through.... */
2736 /* This and MINUS_EXPR can be changed into a comparison of the
2738 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2739 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2740 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2741 TREE_OPERAND (expr, 1), 1);
2742 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2743 fold (build1 (NOP_EXPR,
2744 TREE_TYPE (TREE_OPERAND (expr, 0)),
2745 TREE_OPERAND (expr, 1))), 1);
2748 if (integer_onep (TREE_OPERAND (expr, 1))
2749 && TREE_TYPE (expr) != truthvalue_type_node)
2750 /* Using convert here would cause infinite recursion. */
2751 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2755 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2756 warning ("suggest parentheses around assignment used as truth value");
2763 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2765 tree t = save_expr (expr);
2766 return (build_binary_op
2767 ((TREE_SIDE_EFFECTS (expr)
2768 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2769 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2770 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2774 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2777 static tree builtin_function_2 (const char *, const char *, tree, tree,
2778 int, enum built_in_class, int, int,
2781 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2782 down to the element type of an array. */
2785 c_build_qualified_type (tree type, int type_quals)
2787 if (type == error_mark_node)
2790 if (TREE_CODE (type) == ARRAY_TYPE)
2791 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2793 TYPE_DOMAIN (type));
2795 /* A restrict-qualified pointer type must be a pointer to object or
2796 incomplete type. Note that the use of POINTER_TYPE_P also allows
2797 REFERENCE_TYPEs, which is appropriate for C++. */
2798 if ((type_quals & TYPE_QUAL_RESTRICT)
2799 && (!POINTER_TYPE_P (type)
2800 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2802 error ("invalid use of `restrict'");
2803 type_quals &= ~TYPE_QUAL_RESTRICT;
2806 return build_qualified_type (type, type_quals);
2809 /* Apply the TYPE_QUALS to the new DECL. */
2812 c_apply_type_quals_to_decl (int type_quals, tree decl)
2814 tree type = TREE_TYPE (decl);
2816 if (type == error_mark_node)
2819 if (((type_quals & TYPE_QUAL_CONST)
2820 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2821 /* An object declared 'const' is only readonly after it is
2822 initialized. We don't have any way of expressing this currently,
2823 so we need to be conservative and unset TREE_READONLY for types
2824 with constructors. Otherwise aliasing code will ignore stores in
2825 an inline constructor. */
2826 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2827 TREE_READONLY (decl) = 1;
2828 if (type_quals & TYPE_QUAL_VOLATILE)
2830 TREE_SIDE_EFFECTS (decl) = 1;
2831 TREE_THIS_VOLATILE (decl) = 1;
2833 if (type_quals & TYPE_QUAL_RESTRICT)
2835 while (type && TREE_CODE (type) == ARRAY_TYPE)
2836 /* Allow 'restrict' on arrays of pointers.
2837 FIXME currently we just ignore it. */
2838 type = TREE_TYPE (type);
2840 || !POINTER_TYPE_P (type)
2841 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2842 error ("invalid use of `restrict'");
2843 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2844 /* Indicate we need to make a unique alias set for this pointer.
2845 We can't do it here because it might be pointing to an
2847 DECL_POINTER_ALIAS_SET (decl) = -2;
2851 /* Return the typed-based alias set for T, which may be an expression
2852 or a type. Return -1 if we don't do anything special. */
2855 c_common_get_alias_set (tree t)
2859 /* Permit type-punning when accessing a union, provided the access
2860 is directly through the union. For example, this code does not
2861 permit taking the address of a union member and then storing
2862 through it. Even the type-punning allowed here is a GCC
2863 extension, albeit a common and useful one; the C standard says
2864 that such accesses have implementation-defined behavior. */
2866 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2867 u = TREE_OPERAND (u, 0))
2868 if (TREE_CODE (u) == COMPONENT_REF
2869 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2872 /* That's all the expressions we handle specially. */
2876 /* The C standard guarantees that any object may be accessed via an
2877 lvalue that has character type. */
2878 if (t == char_type_node
2879 || t == signed_char_type_node
2880 || t == unsigned_char_type_node)
2883 /* If it has the may_alias attribute, it can alias anything. */
2884 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2887 /* The C standard specifically allows aliasing between signed and
2888 unsigned variants of the same type. We treat the signed
2889 variant as canonical. */
2890 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2892 tree t1 = c_common_signed_type (t);
2894 /* t1 == t can happen for boolean nodes which are always unsigned. */
2896 return get_alias_set (t1);
2898 else if (POINTER_TYPE_P (t))
2902 /* Unfortunately, there is no canonical form of a pointer type.
2903 In particular, if we have `typedef int I', then `int *', and
2904 `I *' are different types. So, we have to pick a canonical
2905 representative. We do this below.
2907 Technically, this approach is actually more conservative that
2908 it needs to be. In particular, `const int *' and `int *'
2909 should be in different alias sets, according to the C and C++
2910 standard, since their types are not the same, and so,
2911 technically, an `int **' and `const int **' cannot point at
2914 But, the standard is wrong. In particular, this code is
2919 const int* const* cipp = &ipp;
2921 And, it doesn't make sense for that to be legal unless you
2922 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2923 the pointed-to types. This issue has been reported to the
2925 t1 = build_type_no_quals (t);
2927 return get_alias_set (t1);
2933 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2934 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2935 flag controls whether we should diagnose possibly ill-formed
2936 constructs or not. */
2938 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2940 const char *op_name;
2942 enum tree_code type_code = TREE_CODE (type);
2944 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2945 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2947 if (type_code == FUNCTION_TYPE)
2949 if (op == SIZEOF_EXPR)
2951 if (complain && (pedantic || warn_pointer_arith))
2952 pedwarn ("invalid application of `sizeof' to a function type");
2953 value = size_one_node;
2956 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2958 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2960 if (type_code == VOID_TYPE
2961 && complain && (pedantic || warn_pointer_arith))
2962 pedwarn ("invalid application of `%s' to a void type", op_name);
2963 value = size_one_node;
2965 else if (!COMPLETE_TYPE_P (type))
2968 error ("invalid application of `%s' to an incomplete type", op_name);
2969 value = size_zero_node;
2973 if (op == SIZEOF_EXPR)
2974 /* Convert in case a char is more than one unit. */
2975 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2976 size_int (TYPE_PRECISION (char_type_node)
2979 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2982 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2983 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2984 never happen. However, this node should really have type
2985 `size_t', which is just a typedef for an ordinary integer type. */
2986 value = fold (build1 (NOP_EXPR, size_type_node, value));
2987 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2992 /* Implement the __alignof keyword: Return the minimum required
2993 alignment of EXPR, measured in bytes. For VAR_DECL's and
2994 FIELD_DECL's return DECL_ALIGN (which can be set from an
2995 "aligned" __attribute__ specification). */
2998 c_alignof_expr (tree expr)
3002 if (TREE_CODE (expr) == VAR_DECL)
3003 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
3005 else if (TREE_CODE (expr) == COMPONENT_REF
3006 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
3008 error ("`__alignof' applied to a bit-field");
3011 else if (TREE_CODE (expr) == COMPONENT_REF
3012 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
3013 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
3015 else if (TREE_CODE (expr) == INDIRECT_REF)
3017 tree t = TREE_OPERAND (expr, 0);
3019 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3021 while (TREE_CODE (t) == NOP_EXPR
3022 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3026 t = TREE_OPERAND (t, 0);
3027 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3028 if (thisalign > bestalign)
3029 best = t, bestalign = thisalign;
3031 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3034 return c_alignof (TREE_TYPE (expr));
3036 return fold (build1 (NOP_EXPR, size_type_node, t));
3039 /* Handle C and C++ default attributes. */
3041 enum built_in_attribute
3043 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3044 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3045 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3046 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3047 #include "builtin-attrs.def"
3048 #undef DEF_ATTR_NULL_TREE
3050 #undef DEF_ATTR_IDENT
3051 #undef DEF_ATTR_TREE_LIST
3055 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3057 static void c_init_attributes (void);
3059 /* Build tree nodes and builtin functions common to both C and C++ language
3063 c_common_nodes_and_builtins (void)
3067 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3068 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3069 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3070 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3071 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3072 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3073 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3074 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3075 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3076 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3077 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3078 #include "builtin-types.def"
3079 #undef DEF_PRIMITIVE_TYPE
3080 #undef DEF_FUNCTION_TYPE_0
3081 #undef DEF_FUNCTION_TYPE_1
3082 #undef DEF_FUNCTION_TYPE_2
3083 #undef DEF_FUNCTION_TYPE_3
3084 #undef DEF_FUNCTION_TYPE_4
3085 #undef DEF_FUNCTION_TYPE_VAR_0
3086 #undef DEF_FUNCTION_TYPE_VAR_1
3087 #undef DEF_FUNCTION_TYPE_VAR_2
3088 #undef DEF_FUNCTION_TYPE_VAR_3
3089 #undef DEF_POINTER_TYPE
3093 typedef enum builtin_type builtin_type;
3095 tree builtin_types[(int) BT_LAST];
3096 int wchar_type_size;
3097 tree array_domain_type;
3098 tree va_list_ref_type_node;
3099 tree va_list_arg_type_node;
3101 /* Define `int' and `char' first so that dbx will output them first. */
3102 record_builtin_type (RID_INT, NULL, integer_type_node);
3103 record_builtin_type (RID_CHAR, "char", char_type_node);
3105 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3106 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3107 but not C. Are the conditionals here needed? */
3108 if (c_dialect_cxx ())
3109 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3110 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3111 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3112 record_builtin_type (RID_MAX, "long unsigned int",
3113 long_unsigned_type_node);
3114 if (c_dialect_cxx ())
3115 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3116 record_builtin_type (RID_MAX, "long long int",
3117 long_long_integer_type_node);
3118 record_builtin_type (RID_MAX, "long long unsigned int",
3119 long_long_unsigned_type_node);
3120 if (c_dialect_cxx ())
3121 record_builtin_type (RID_MAX, "long long unsigned",
3122 long_long_unsigned_type_node);
3123 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3124 record_builtin_type (RID_MAX, "short unsigned int",
3125 short_unsigned_type_node);
3126 if (c_dialect_cxx ())
3127 record_builtin_type (RID_MAX, "unsigned short",
3128 short_unsigned_type_node);
3130 /* Define both `signed char' and `unsigned char'. */
3131 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3132 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3134 /* These are types that c_common_type_for_size and
3135 c_common_type_for_mode use. */
3136 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3138 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3140 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3142 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3144 #if HOST_BITS_PER_WIDE_INT >= 64
3145 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3146 get_identifier ("__int128_t"),
3149 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3150 unsigned_intQI_type_node));
3151 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3152 unsigned_intHI_type_node));
3153 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3154 unsigned_intSI_type_node));
3155 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3156 unsigned_intDI_type_node));
3157 #if HOST_BITS_PER_WIDE_INT >= 64
3158 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3159 get_identifier ("__uint128_t"),
3160 unsigned_intTI_type_node));
3163 /* Create the widest literal types. */
3164 widest_integer_literal_type_node
3165 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3166 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3167 widest_integer_literal_type_node));
3169 widest_unsigned_literal_type_node
3170 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3171 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3172 widest_unsigned_literal_type_node));
3174 /* `unsigned long' is the standard type for sizeof.
3175 Note that stddef.h uses `unsigned long',
3176 and this must agree, even if long and int are the same size. */
3178 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3179 signed_size_type_node = c_common_signed_type (size_type_node);
3180 set_sizetype (size_type_node);
3182 build_common_tree_nodes_2 (flag_short_double);
3184 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3185 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3186 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3188 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3189 get_identifier ("complex int"),
3190 complex_integer_type_node));
3191 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3192 get_identifier ("complex float"),
3193 complex_float_type_node));
3194 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3195 get_identifier ("complex double"),
3196 complex_double_type_node));
3197 (*lang_hooks.decls.pushdecl)
3198 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3199 complex_long_double_type_node));
3201 /* Types which are common to the fortran compiler and libf2c. When
3202 changing these, you also need to be concerned with f/com.h. */
3204 if (TYPE_PRECISION (float_type_node)
3205 == TYPE_PRECISION (long_integer_type_node))
3207 g77_integer_type_node = long_integer_type_node;
3208 g77_uinteger_type_node = long_unsigned_type_node;
3210 else if (TYPE_PRECISION (float_type_node)
3211 == TYPE_PRECISION (integer_type_node))
3213 g77_integer_type_node = integer_type_node;
3214 g77_uinteger_type_node = unsigned_type_node;
3217 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3219 if (g77_integer_type_node != NULL_TREE)
3221 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3222 get_identifier ("__g77_integer"),
3223 g77_integer_type_node));
3224 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3225 get_identifier ("__g77_uinteger"),
3226 g77_uinteger_type_node));
3229 if (TYPE_PRECISION (float_type_node) * 2
3230 == TYPE_PRECISION (long_integer_type_node))
3232 g77_longint_type_node = long_integer_type_node;
3233 g77_ulongint_type_node = long_unsigned_type_node;
3235 else if (TYPE_PRECISION (float_type_node) * 2
3236 == TYPE_PRECISION (long_long_integer_type_node))
3238 g77_longint_type_node = long_long_integer_type_node;
3239 g77_ulongint_type_node = long_long_unsigned_type_node;
3242 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3244 if (g77_longint_type_node != NULL_TREE)
3246 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3247 get_identifier ("__g77_longint"),
3248 g77_longint_type_node));
3249 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3250 get_identifier ("__g77_ulongint"),
3251 g77_ulongint_type_node));
3254 record_builtin_type (RID_VOID, NULL, void_type_node);
3256 void_zero_node = build_int_2 (0, 0);
3257 TREE_TYPE (void_zero_node) = void_type_node;
3259 void_list_node = build_void_list_node ();
3261 /* Make a type to be the domain of a few array types
3262 whose domains don't really matter.
3263 200 is small enough that it always fits in size_t
3264 and large enough that it can hold most function names for the
3265 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3266 array_domain_type = build_index_type (size_int (200));
3268 /* Make a type for arrays of characters.
3269 With luck nothing will ever really depend on the length of this
3271 char_array_type_node
3272 = build_array_type (char_type_node, array_domain_type);
3274 /* Likewise for arrays of ints. */
3276 = build_array_type (integer_type_node, array_domain_type);
3278 string_type_node = build_pointer_type (char_type_node);
3279 const_string_type_node
3280 = build_pointer_type (build_qualified_type
3281 (char_type_node, TYPE_QUAL_CONST));
3283 /* This is special for C++ so functions can be overloaded. */
3284 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3285 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3286 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3287 if (c_dialect_cxx ())
3289 if (TREE_UNSIGNED (wchar_type_node))
3290 wchar_type_node = make_unsigned_type (wchar_type_size);
3292 wchar_type_node = make_signed_type (wchar_type_size);
3293 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3297 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3298 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3301 /* This is for wide string constants. */
3302 wchar_array_type_node
3303 = build_array_type (wchar_type_node, array_domain_type);
3306 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3309 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3311 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3313 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3315 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3316 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3318 (*lang_hooks.decls.pushdecl)
3319 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3320 va_list_type_node));
3322 (*lang_hooks.decls.pushdecl)
3323 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3324 ptrdiff_type_node));
3326 (*lang_hooks.decls.pushdecl)
3327 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3330 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3332 va_list_arg_type_node = va_list_ref_type_node =
3333 build_pointer_type (TREE_TYPE (va_list_type_node));
3337 va_list_arg_type_node = va_list_type_node;
3338 va_list_ref_type_node = build_reference_type (va_list_type_node);
3341 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3342 builtin_types[(int) ENUM] = VALUE;
3343 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3344 builtin_types[(int) ENUM] \
3345 = build_function_type (builtin_types[(int) RETURN], \
3347 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3348 builtin_types[(int) ENUM] \
3349 = build_function_type (builtin_types[(int) RETURN], \
3350 tree_cons (NULL_TREE, \
3351 builtin_types[(int) ARG1], \
3353 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3354 builtin_types[(int) ENUM] \
3355 = build_function_type \
3356 (builtin_types[(int) RETURN], \
3357 tree_cons (NULL_TREE, \
3358 builtin_types[(int) ARG1], \
3359 tree_cons (NULL_TREE, \
3360 builtin_types[(int) ARG2], \
3362 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3363 builtin_types[(int) ENUM] \
3364 = build_function_type \
3365 (builtin_types[(int) RETURN], \
3366 tree_cons (NULL_TREE, \
3367 builtin_types[(int) ARG1], \
3368 tree_cons (NULL_TREE, \
3369 builtin_types[(int) ARG2], \
3370 tree_cons (NULL_TREE, \
3371 builtin_types[(int) ARG3], \
3373 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3374 builtin_types[(int) ENUM] \
3375 = build_function_type \
3376 (builtin_types[(int) RETURN], \
3377 tree_cons (NULL_TREE, \
3378 builtin_types[(int) ARG1], \
3379 tree_cons (NULL_TREE, \
3380 builtin_types[(int) ARG2], \
3383 builtin_types[(int) ARG3], \
3384 tree_cons (NULL_TREE, \
3385 builtin_types[(int) ARG4], \
3386 void_list_node)))));
3387 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3388 builtin_types[(int) ENUM] \
3389 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3390 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3391 builtin_types[(int) ENUM] \
3392 = build_function_type (builtin_types[(int) RETURN], \
3393 tree_cons (NULL_TREE, \
3394 builtin_types[(int) ARG1], \
3397 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3398 builtin_types[(int) ENUM] \
3399 = build_function_type \
3400 (builtin_types[(int) RETURN], \
3401 tree_cons (NULL_TREE, \
3402 builtin_types[(int) ARG1], \
3403 tree_cons (NULL_TREE, \
3404 builtin_types[(int) ARG2], \
3407 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3408 builtin_types[(int) ENUM] \
3409 = build_function_type \
3410 (builtin_types[(int) RETURN], \
3411 tree_cons (NULL_TREE, \
3412 builtin_types[(int) ARG1], \
3413 tree_cons (NULL_TREE, \
3414 builtin_types[(int) ARG2], \
3415 tree_cons (NULL_TREE, \
3416 builtin_types[(int) ARG3], \
3419 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3420 builtin_types[(int) ENUM] \
3421 = build_pointer_type (builtin_types[(int) TYPE]);
3422 #include "builtin-types.def"
3423 #undef DEF_PRIMITIVE_TYPE
3424 #undef DEF_FUNCTION_TYPE_1
3425 #undef DEF_FUNCTION_TYPE_2
3426 #undef DEF_FUNCTION_TYPE_3
3427 #undef DEF_FUNCTION_TYPE_4
3428 #undef DEF_FUNCTION_TYPE_VAR_0
3429 #undef DEF_FUNCTION_TYPE_VAR_1
3430 #undef DEF_FUNCTION_TYPE_VAR_2
3431 #undef DEF_FUNCTION_TYPE_VAR_3
3432 #undef DEF_POINTER_TYPE
3434 c_init_attributes ();
3436 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3437 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3442 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3446 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3449 ? (NAME + strlen ("__builtin_")) \
3451 built_in_attributes[(int) ATTRS]); \
3453 decl = builtin_function_2 (NAME, \
3454 NAME + strlen ("__builtin_"), \
3455 builtin_types[TYPE], \
3456 builtin_types[LIBTYPE], \
3461 built_in_attributes[(int) ATTRS]); \
3463 built_in_decls[(int) ENUM] = decl; \
3465 implicit_built_in_decls[(int) ENUM] = decl; \
3467 #include "builtins.def"
3470 (*targetm.init_builtins) ();
3472 main_identifier_node = get_identifier ("main");
3476 build_va_arg (tree expr, tree type)
3478 return build1 (VA_ARG_EXPR, type, expr);
3482 /* Linked list of disabled built-in functions. */
3484 typedef struct disabled_builtin
3487 struct disabled_builtin *next;
3489 static disabled_builtin *disabled_builtins = NULL;
3491 static bool builtin_function_disabled_p (const char *);
3493 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3494 begins with "__builtin_", give an error. */
3497 disable_builtin_function (const char *name)
3499 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3500 error ("cannot disable built-in function `%s'", name);
3503 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3505 new->next = disabled_builtins;
3506 disabled_builtins = new;
3511 /* Return true if the built-in function NAME has been disabled, false
3515 builtin_function_disabled_p (const char *name)
3517 disabled_builtin *p;
3518 for (p = disabled_builtins; p != NULL; p = p->next)
3520 if (strcmp (name, p->name) == 0)
3527 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3528 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3529 of these may be NULL (though both being NULL is useless).
3530 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3531 TYPE is the type of the function with the ordinary name. These
3532 may differ if the ordinary name is declared with a looser type to avoid
3533 conflicts with headers. FUNCTION_CODE and CLASS are as for
3534 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3535 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3536 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3537 ATTRS is the tree list representing the builtin's function attributes.
3538 Returns the declaration of BUILTIN_NAME, if any, otherwise
3539 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3540 or if NONANSI_P and flag_no_nonansi_builtin. */
3543 builtin_function_2 (const char *builtin_name, const char *name,
3544 tree builtin_type, tree type, int function_code,
3545 enum built_in_class class, int library_name_p,
3546 int nonansi_p, tree attrs)
3548 tree bdecl = NULL_TREE;
3549 tree decl = NULL_TREE;
3551 if (builtin_name != 0)
3552 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3553 class, library_name_p ? name : NULL, attrs);
3555 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3556 && !(nonansi_p && flag_no_nonansi_builtin))
3557 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3559 return (bdecl != 0 ? bdecl : decl);
3562 /* Nonzero if the type T promotes to int. This is (nearly) the
3563 integral promotions defined in ISO C99 6.3.1.1/2. */
3566 c_promoting_integer_type_p (tree t)
3568 switch (TREE_CODE (t))
3571 return (TYPE_MAIN_VARIANT (t) == char_type_node
3572 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3573 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3574 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3575 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3576 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3579 /* ??? Technically all enumerations not larger than an int
3580 promote to an int. But this is used along code paths
3581 that only want to notice a size change. */
3582 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3592 /* Return 1 if PARMS specifies a fixed number of parameters
3593 and none of their types is affected by default promotions. */
3596 self_promoting_args_p (tree parms)
3599 for (t = parms; t; t = TREE_CHAIN (t))
3601 tree type = TREE_VALUE (t);
3603 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3609 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3612 if (c_promoting_integer_type_p (type))
3618 /* Recursively examines the array elements of TYPE, until a non-array
3619 element type is found. */
3622 strip_array_types (tree type)
3624 while (TREE_CODE (type) == ARRAY_TYPE)
3625 type = TREE_TYPE (type);
3630 /* Recursively remove any '*' or '&' operator from TYPE. */
3632 strip_pointer_operator (tree t)
3634 while (POINTER_TYPE_P (t))
3639 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3641 /* Expand a call to an unordered comparison function such as
3642 __builtin_isgreater(). FUNCTION is the function's declaration and
3643 PARAMS a list of the values passed. For __builtin_isunordered(),
3644 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3645 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3646 that give the opposite of the desired result. UNORDERED_CODE is
3647 used for modes that can hold NaNs and ORDERED_CODE is used for the
3651 expand_unordered_cmp (tree function, tree params,
3652 enum tree_code unordered_code,
3653 enum tree_code ordered_code)
3655 tree arg0, arg1, type;
3656 enum tree_code code0, code1;
3658 /* Check that we have exactly two arguments. */
3659 if (params == 0 || TREE_CHAIN (params) == 0)
3661 error ("too few arguments to function `%s'",
3662 IDENTIFIER_POINTER (DECL_NAME (function)));
3663 return error_mark_node;
3665 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3667 error ("too many arguments to function `%s'",
3668 IDENTIFIER_POINTER (DECL_NAME (function)));
3669 return error_mark_node;
3672 arg0 = TREE_VALUE (params);
3673 arg1 = TREE_VALUE (TREE_CHAIN (params));
3675 code0 = TREE_CODE (TREE_TYPE (arg0));
3676 code1 = TREE_CODE (TREE_TYPE (arg1));
3678 /* Make sure that the arguments have a common type of REAL. */
3680 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3681 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3682 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3684 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3686 error ("non-floating-point argument to function `%s'",
3687 IDENTIFIER_POINTER (DECL_NAME (function)));
3688 return error_mark_node;
3691 if (unordered_code == UNORDERED_EXPR)
3693 if (MODE_HAS_NANS (TYPE_MODE (type)))
3694 return build_binary_op (unordered_code,
3695 convert (type, arg0),
3696 convert (type, arg1),
3699 return integer_zero_node;
3702 return build_unary_op (TRUTH_NOT_EXPR,
3703 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3706 convert (type, arg0),
3707 convert (type, arg1),
3713 /* Recognize certain built-in functions so we can make tree-codes
3714 other than CALL_EXPR. We do this when it enables fold-const.c
3715 to do something useful. */
3716 /* ??? By rights this should go in builtins.c, but only C and C++
3717 implement build_{binary,unary}_op. Not exactly sure what bits
3718 of functionality are actually needed from those functions, or
3719 where the similar functionality exists in the other front ends. */
3722 expand_tree_builtin (tree function, tree params, tree coerced_params)
3724 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3727 switch (DECL_FUNCTION_CODE (function))
3731 case BUILT_IN_LLABS:
3732 case BUILT_IN_IMAXABS:
3734 case BUILT_IN_FABSL:
3735 case BUILT_IN_FABSF:
3736 if (coerced_params == 0)
3737 return integer_zero_node;
3738 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3741 case BUILT_IN_CONJF:
3742 case BUILT_IN_CONJL:
3743 if (coerced_params == 0)
3744 return integer_zero_node;
3745 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3747 case BUILT_IN_CREAL:
3748 case BUILT_IN_CREALF:
3749 case BUILT_IN_CREALL:
3750 if (coerced_params == 0)
3751 return integer_zero_node;
3752 return non_lvalue (build_unary_op (REALPART_EXPR,
3753 TREE_VALUE (coerced_params), 0));
3755 case BUILT_IN_CIMAG:
3756 case BUILT_IN_CIMAGF:
3757 case BUILT_IN_CIMAGL:
3758 if (coerced_params == 0)
3759 return integer_zero_node;
3760 return non_lvalue (build_unary_op (IMAGPART_EXPR,
3761 TREE_VALUE (coerced_params), 0));
3763 case BUILT_IN_ISGREATER:
3764 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3766 case BUILT_IN_ISGREATEREQUAL:
3767 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3769 case BUILT_IN_ISLESS:
3770 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3772 case BUILT_IN_ISLESSEQUAL:
3773 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3775 case BUILT_IN_ISLESSGREATER:
3776 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3778 case BUILT_IN_ISUNORDERED:
3779 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3788 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3789 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3790 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3791 value, the traversal is aborted, and the value returned by FUNC is
3792 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3793 the node being visited are not walked.
3795 We don't need a without_duplicates variant of this one because the
3796 statement tree is a tree, not a graph. */
3799 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3801 enum tree_code code;
3806 #define WALK_SUBTREE(NODE) \
3809 result = walk_stmt_tree (&(NODE), func, data); \
3815 /* Skip empty subtrees. */
3819 /* Skip subtrees below non-statement nodes. */
3820 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3823 /* Call the function. */
3825 result = (*func) (tp, &walk_subtrees, data);
3827 /* If we found something, return it. */
3831 /* FUNC may have modified the tree, recheck that we're looking at a
3833 code = TREE_CODE (*tp);
3834 if (!STATEMENT_CODE_P (code))
3837 /* Visit the subtrees unless FUNC decided that there was nothing
3838 interesting below this point in the tree. */
3841 /* Walk over all the sub-trees of this operand. Statement nodes
3842 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3843 len = TREE_CODE_LENGTH (code);
3845 /* Go through the subtrees. We need to do this in forward order so
3846 that the scope of a FOR_EXPR is handled properly. */
3847 for (i = 0; i < len; ++i)
3848 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3851 /* Finally visit the chain. This can be tail-recursion optimized if
3852 we write it this way. */
3853 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3858 /* Used to compare case labels. K1 and K2 are actually tree nodes
3859 representing case labels, or NULL_TREE for a `default' label.
3860 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3861 K2, and 0 if K1 and K2 are equal. */
3864 case_compare (splay_tree_key k1, splay_tree_key k2)
3866 /* Consider a NULL key (such as arises with a `default' label) to be
3867 smaller than anything else. */
3873 return tree_int_cst_compare ((tree) k1, (tree) k2);
3876 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3877 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3878 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3879 case label was declared using the usual C/C++ syntax, rather than
3880 the GNU case range extension. CASES is a tree containing all the
3881 case ranges processed so far; COND is the condition for the
3882 switch-statement itself. Returns the CASE_LABEL created, or
3883 ERROR_MARK_NODE if no CASE_LABEL is created. */
3886 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3892 splay_tree_node node;
3894 /* Create the LABEL_DECL itself. */
3895 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3896 DECL_CONTEXT (label) = current_function_decl;
3898 /* If there was an error processing the switch condition, bail now
3899 before we get more confused. */
3900 if (!cond || cond == error_mark_node)
3902 /* Add a label anyhow so that the back-end doesn't think that
3903 the beginning of the switch is unreachable. */
3905 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3906 return error_mark_node;
3909 if ((low_value && TREE_TYPE (low_value)
3910 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3911 || (high_value && TREE_TYPE (high_value)
3912 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3913 error ("pointers are not permitted as case values");
3915 /* Case ranges are a GNU extension. */
3916 if (high_value && pedantic)
3917 pedwarn ("range expressions in switch statements are non-standard");
3919 type = TREE_TYPE (cond);
3922 low_value = check_case_value (low_value);
3923 low_value = convert_and_check (type, low_value);
3927 high_value = check_case_value (high_value);
3928 high_value = convert_and_check (type, high_value);
3931 /* If an error has occurred, bail out now. */
3932 if (low_value == error_mark_node || high_value == error_mark_node)
3935 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3936 return error_mark_node;
3939 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3940 really a case range, even though it was written that way. Remove
3941 the HIGH_VALUE to simplify later processing. */
3942 if (tree_int_cst_equal (low_value, high_value))
3943 high_value = NULL_TREE;
3944 if (low_value && high_value
3945 && !tree_int_cst_lt (low_value, high_value))
3946 warning ("empty range specified");
3948 /* Look up the LOW_VALUE in the table of case labels we already
3950 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3951 /* If there was not an exact match, check for overlapping ranges.
3952 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3953 that's a `default' label and the only overlap is an exact match. */
3954 if (!node && (low_value || high_value))
3956 splay_tree_node low_bound;
3957 splay_tree_node high_bound;
3959 /* Even though there wasn't an exact match, there might be an
3960 overlap between this case range and another case range.
3961 Since we've (inductively) not allowed any overlapping case
3962 ranges, we simply need to find the greatest low case label
3963 that is smaller that LOW_VALUE, and the smallest low case
3964 label that is greater than LOW_VALUE. If there is an overlap
3965 it will occur in one of these two ranges. */
3966 low_bound = splay_tree_predecessor (cases,
3967 (splay_tree_key) low_value);
3968 high_bound = splay_tree_successor (cases,
3969 (splay_tree_key) low_value);
3971 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3972 the LOW_VALUE, so there is no need to check unless the
3973 LOW_BOUND is in fact itself a case range. */
3975 && CASE_HIGH ((tree) low_bound->value)
3976 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3979 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3980 range is bigger than the low end of the current range, so we
3981 are only interested if the current range is a real range, and
3982 not an ordinary case label. */
3985 && (tree_int_cst_compare ((tree) high_bound->key,
3990 /* If there was an overlap, issue an error. */
3993 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3997 error ("duplicate (or overlapping) case value");
3998 error ("%Jthis is the first entry overlapping that value", duplicate);
4002 error ("duplicate case value") ;
4003 error ("%Jpreviously used here", duplicate);
4007 error ("multiple default labels in one switch");
4008 error ("%Jthis is the first default label", duplicate);
4011 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
4014 /* Add a CASE_LABEL to the statement-tree. */
4015 case_label = add_stmt (build_case_label (low_value, high_value, label));
4016 /* Register this case label in the splay tree. */
4017 splay_tree_insert (cases,
4018 (splay_tree_key) low_value,
4019 (splay_tree_value) case_label);
4024 /* Finish an expression taking the address of LABEL (an
4025 IDENTIFIER_NODE). Returns an expression for the address. */
4028 finish_label_address_expr (tree label)
4033 pedwarn ("taking the address of a label is non-standard");
4035 if (label == error_mark_node)
4036 return error_mark_node;
4038 label = lookup_label (label);
4039 if (label == NULL_TREE)
4040 result = null_pointer_node;
4043 TREE_USED (label) = 1;
4044 result = build1 (ADDR_EXPR, ptr_type_node, label);
4045 TREE_CONSTANT (result) = 1;
4046 /* The current function in not necessarily uninlinable.
4047 Computed gotos are incompatible with inlining, but the value
4048 here could be used only in a diagnostic, for example. */
4054 /* Hook used by expand_expr to expand language-specific tree codes. */
4057 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
4058 int modifier /* Actually enum_modifier. */,
4061 switch (TREE_CODE (exp))
4067 bool preserve_result = false;
4069 if (STMT_EXPR_WARN_UNUSED_RESULT (exp) && target == const0_rtx)
4071 tree stmt = STMT_EXPR_STMT (exp);
4074 for (scope = COMPOUND_BODY (stmt);
4075 scope && TREE_CODE (scope) != SCOPE_STMT;
4076 scope = TREE_CHAIN (scope));
4078 if (scope && SCOPE_STMT_BLOCK (scope))
4079 warning ("%Hignoring return value of `%D', "
4080 "declared with attribute warn_unused_result",
4081 &expr_wfl_stack->location,
4082 BLOCK_ABSTRACT_ORIGIN (SCOPE_STMT_BLOCK (scope)));
4084 warning ("%Hignoring return value of function "
4085 "declared with attribute warn_unused_result",
4086 &expr_wfl_stack->location);
4089 /* Since expand_expr_stmt calls free_temp_slots after every
4090 expression statement, we must call push_temp_slots here.
4091 Otherwise, any temporaries in use now would be considered
4092 out-of-scope after the first EXPR_STMT from within the
4095 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
4097 /* If we want the result of this expression, find the last
4098 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
4099 if (target != const0_rtx
4100 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
4101 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
4103 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
4104 tree last = TREE_CHAIN (expr);
4106 while (TREE_CHAIN (last))
4109 last = TREE_CHAIN (last);
4112 if (TREE_CODE (last) == SCOPE_STMT
4113 && TREE_CODE (expr) == EXPR_STMT)
4115 /* Otherwise, note that we want the value from the last
4117 TREE_ADDRESSABLE (expr) = 1;
4118 preserve_result = true;
4122 expand_stmt (STMT_EXPR_STMT (exp));
4123 expand_end_stmt_expr (rtl_expr);
4125 result = expand_expr (rtl_expr, target, tmode, modifier);
4126 if (preserve_result && GET_CODE (result) == MEM)
4128 if (GET_MODE (result) != BLKmode)
4129 result = copy_to_reg (result);
4131 preserve_temp_slots (result);
4134 /* If the statment-expression does not have a scope, then the
4135 new temporaries we created within it must live beyond the
4136 statement-expression. */
4137 if (STMT_EXPR_NO_SCOPE (exp))
4138 preserve_temp_slots (NULL_RTX);
4145 case COMPOUND_LITERAL_EXPR:
4147 /* Initialize the anonymous variable declared in the compound
4148 literal, then return the variable. */
4149 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4150 emit_local_var (decl);
4151 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
4162 /* Hook used by safe_from_p to handle language-specific tree codes. */
4165 c_safe_from_p (rtx target, tree exp)
4167 /* We can see statements here when processing the body of a
4168 statement-expression. For a declaration statement declaring a
4169 variable, look at the variable's initializer. */
4170 if (TREE_CODE (exp) == DECL_STMT)
4172 tree decl = DECL_STMT_DECL (exp);
4174 if (TREE_CODE (decl) == VAR_DECL
4175 && DECL_INITIAL (decl)
4176 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4180 /* For any statement, we must follow the statement-chain. */
4181 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4182 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4184 /* Assume everything else is safe. */
4188 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4191 c_common_unsafe_for_reeval (tree exp)
4193 /* Statement expressions may not be reevaluated, likewise compound
4195 if (TREE_CODE (exp) == STMT_EXPR
4196 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4199 /* Walk all other expressions. */
4203 /* Hook used by staticp to handle language-specific tree codes. */
4206 c_staticp (tree exp)
4208 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4209 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4215 /* Given a boolean expression ARG, return a tree representing an increment
4216 or decrement (as indicated by CODE) of ARG. The front end must check for
4217 invalid cases (e.g., decrement in C++). */
4219 boolean_increment (enum tree_code code, tree arg)
4222 tree true_res = boolean_true_node;
4224 arg = stabilize_reference (arg);
4227 case PREINCREMENT_EXPR:
4228 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4230 case POSTINCREMENT_EXPR:
4231 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4232 arg = save_expr (arg);
4233 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4234 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4236 case PREDECREMENT_EXPR:
4237 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4239 case POSTDECREMENT_EXPR:
4240 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4241 arg = save_expr (arg);
4242 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4243 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4248 TREE_SIDE_EFFECTS (val) = 1;
4252 /* Built-in macros for stddef.h, that require macros defined in this
4255 c_stddef_cpp_builtins(void)
4257 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4258 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4259 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4260 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4264 c_init_attributes (void)
4266 /* Fill in the built_in_attributes array. */
4267 #define DEF_ATTR_NULL_TREE(ENUM) \
4268 built_in_attributes[(int) ENUM] = NULL_TREE;
4269 #define DEF_ATTR_INT(ENUM, VALUE) \
4270 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4271 #define DEF_ATTR_IDENT(ENUM, STRING) \
4272 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4273 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4274 built_in_attributes[(int) ENUM] \
4275 = tree_cons (built_in_attributes[(int) PURPOSE], \
4276 built_in_attributes[(int) VALUE], \
4277 built_in_attributes[(int) CHAIN]);
4278 #include "builtin-attrs.def"
4279 #undef DEF_ATTR_NULL_TREE
4281 #undef DEF_ATTR_IDENT
4282 #undef DEF_ATTR_TREE_LIST
4285 /* Output a -Wshadow warning MSGCODE about NAME, and give the location
4286 of the previous declaration DECL. */
4288 shadow_warning (enum sw_kind msgcode, const char *name, tree decl)
4290 static const char *const msgs[] = {
4291 /* SW_PARAM */ N_("declaration of \"%s\" shadows a parameter"),
4292 /* SW_LOCAL */ N_("declaration of \"%s\" shadows a previous local"),
4293 /* SW_GLOBAL */ N_("declaration of \"%s\" shadows a global declaration")
4296 warning (msgs[msgcode], name);
4297 warning ("%Jshadowed declaration is here", decl);
4300 /* Attribute handlers common to C front ends. */
4302 /* Handle a "packed" attribute; arguments as in
4303 struct attribute_spec.handler. */
4306 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4307 int flags, bool *no_add_attrs)
4311 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4312 *node = build_type_copy (*node);
4313 TYPE_PACKED (*node) = 1;
4314 if (TYPE_MAIN_VARIANT (*node) == *node)
4316 /* If it is the main variant, then pack the other variants
4317 too. This happens in,
4320 struct Foo const *ptr; // creates a variant w/o packed flag
4321 } __ attribute__((packed)); // packs it now.
4325 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4326 TYPE_PACKED (probe) = 1;
4330 else if (TREE_CODE (*node) == FIELD_DECL)
4331 DECL_PACKED (*node) = 1;
4332 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4333 used for DECL_REGISTER. It wouldn't mean anything anyway.
4334 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4335 that changes what the typedef is typing. */
4338 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4339 *no_add_attrs = true;
4345 /* Handle a "nocommon" attribute; arguments as in
4346 struct attribute_spec.handler. */
4349 handle_nocommon_attribute (tree *node, tree name,
4350 tree args ATTRIBUTE_UNUSED,
4351 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4353 if (TREE_CODE (*node) == VAR_DECL)
4354 DECL_COMMON (*node) = 0;
4357 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4358 *no_add_attrs = true;
4364 /* Handle a "common" attribute; arguments as in
4365 struct attribute_spec.handler. */
4368 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4369 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4371 if (TREE_CODE (*node) == VAR_DECL)
4372 DECL_COMMON (*node) = 1;
4375 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4376 *no_add_attrs = true;
4382 /* Handle a "noreturn" attribute; arguments as in
4383 struct attribute_spec.handler. */
4386 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4387 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4389 tree type = TREE_TYPE (*node);
4391 /* See FIXME comment in c_common_attribute_table. */
4392 if (TREE_CODE (*node) == FUNCTION_DECL)
4393 TREE_THIS_VOLATILE (*node) = 1;
4394 else if (TREE_CODE (type) == POINTER_TYPE
4395 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4397 = build_pointer_type
4398 (build_type_variant (TREE_TYPE (type),
4399 TREE_READONLY (TREE_TYPE (type)), 1));
4402 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4403 *no_add_attrs = true;
4409 /* Handle a "noinline" attribute; arguments as in
4410 struct attribute_spec.handler. */
4413 handle_noinline_attribute (tree *node, tree name,
4414 tree args ATTRIBUTE_UNUSED,
4415 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4417 if (TREE_CODE (*node) == FUNCTION_DECL)
4418 DECL_UNINLINABLE (*node) = 1;
4421 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4422 *no_add_attrs = true;
4428 /* Handle a "always_inline" attribute; arguments as in
4429 struct attribute_spec.handler. */
4432 handle_always_inline_attribute (tree *node, tree name,
4433 tree args ATTRIBUTE_UNUSED,
4434 int flags ATTRIBUTE_UNUSED,
4437 if (TREE_CODE (*node) == FUNCTION_DECL)
4439 /* Do nothing else, just set the attribute. We'll get at
4440 it later with lookup_attribute. */
4444 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4445 *no_add_attrs = true;
4451 /* Handle a "used" attribute; arguments as in
4452 struct attribute_spec.handler. */
4455 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4456 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4460 if (TREE_CODE (node) == FUNCTION_DECL
4461 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4463 TREE_USED (node) = 1;
4467 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4468 *no_add_attrs = true;
4474 /* Handle a "unused" attribute; arguments as in
4475 struct attribute_spec.handler. */
4478 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4479 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4485 if (TREE_CODE (decl) == PARM_DECL
4486 || TREE_CODE (decl) == VAR_DECL
4487 || TREE_CODE (decl) == FUNCTION_DECL
4488 || TREE_CODE (decl) == LABEL_DECL
4489 || TREE_CODE (decl) == TYPE_DECL)
4490 TREE_USED (decl) = 1;
4493 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4494 *no_add_attrs = true;
4499 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4500 *node = build_type_copy (*node);
4501 TREE_USED (*node) = 1;
4507 /* Handle a "const" attribute; arguments as in
4508 struct attribute_spec.handler. */
4511 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4512 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4514 tree type = TREE_TYPE (*node);
4516 /* See FIXME comment on noreturn in c_common_attribute_table. */
4517 if (TREE_CODE (*node) == FUNCTION_DECL)
4518 TREE_READONLY (*node) = 1;
4519 else if (TREE_CODE (type) == POINTER_TYPE
4520 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4522 = build_pointer_type
4523 (build_type_variant (TREE_TYPE (type), 1,
4524 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4527 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4528 *no_add_attrs = true;
4534 /* Handle a "transparent_union" attribute; arguments as in
4535 struct attribute_spec.handler. */
4538 handle_transparent_union_attribute (tree *node, tree name,
4539 tree args ATTRIBUTE_UNUSED, int flags,
4542 tree decl = NULL_TREE;
4549 type = &TREE_TYPE (decl);
4550 is_type = TREE_CODE (*node) == TYPE_DECL;
4552 else if (TYPE_P (*node))
4553 type = node, is_type = 1;
4556 && TREE_CODE (*type) == UNION_TYPE
4558 || (TYPE_FIELDS (*type) != 0
4559 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4561 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4562 *type = build_type_copy (*type);
4563 TYPE_TRANSPARENT_UNION (*type) = 1;
4565 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4566 && TREE_CODE (*type) == UNION_TYPE
4567 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4568 DECL_TRANSPARENT_UNION (decl) = 1;
4571 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4572 *no_add_attrs = true;
4578 /* Handle a "constructor" attribute; arguments as in
4579 struct attribute_spec.handler. */
4582 handle_constructor_attribute (tree *node, tree name,
4583 tree args ATTRIBUTE_UNUSED,
4584 int flags ATTRIBUTE_UNUSED,
4588 tree type = TREE_TYPE (decl);
4590 if (TREE_CODE (decl) == FUNCTION_DECL
4591 && TREE_CODE (type) == FUNCTION_TYPE
4592 && decl_function_context (decl) == 0)
4594 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4595 TREE_USED (decl) = 1;
4599 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4600 *no_add_attrs = true;
4606 /* Handle a "destructor" attribute; arguments as in
4607 struct attribute_spec.handler. */
4610 handle_destructor_attribute (tree *node, tree name,
4611 tree args ATTRIBUTE_UNUSED,
4612 int flags ATTRIBUTE_UNUSED,
4616 tree type = TREE_TYPE (decl);
4618 if (TREE_CODE (decl) == FUNCTION_DECL
4619 && TREE_CODE (type) == FUNCTION_TYPE
4620 && decl_function_context (decl) == 0)
4622 DECL_STATIC_DESTRUCTOR (decl) = 1;
4623 TREE_USED (decl) = 1;
4627 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4628 *no_add_attrs = true;
4634 /* Handle a "mode" attribute; arguments as in
4635 struct attribute_spec.handler. */
4638 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4639 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4643 *no_add_attrs = true;
4645 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4646 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4650 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4651 int len = strlen (p);
4652 enum machine_mode mode = VOIDmode;
4656 if (len > 4 && p[0] == '_' && p[1] == '_'
4657 && p[len - 1] == '_' && p[len - 2] == '_')
4659 char *newp = alloca (len - 1);
4661 strcpy (newp, &p[2]);
4662 newp[len - 4] = '\0';
4666 /* Change this type to have a type with the specified mode.
4667 First check for the special modes. */
4668 if (! strcmp (p, "byte"))
4670 else if (!strcmp (p, "word"))
4672 else if (! strcmp (p, "pointer"))
4675 for (j = 0; j < NUM_MACHINE_MODES; j++)
4676 if (!strcmp (p, GET_MODE_NAME (j)))
4677 mode = (enum machine_mode) j;
4679 if (mode == VOIDmode)
4680 error ("unknown machine mode `%s'", p);
4681 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
4682 (mode, TREE_UNSIGNED (type))))
4683 error ("no data type for mode `%s'", p);
4684 else if ((TREE_CODE (type) == POINTER_TYPE
4685 || TREE_CODE (type) == REFERENCE_TYPE)
4686 && !(*targetm.valid_pointer_mode) (mode))
4687 error ("invalid pointer mode `%s'", p);
4690 /* If this is a vector, make sure we either have hardware
4691 support, or we can emulate it. */
4692 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4694 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4698 if (TREE_CODE (type) == POINTER_TYPE)
4700 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4704 else if (TREE_CODE (type) == REFERENCE_TYPE)
4706 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4712 /* No need to layout the type here. The caller should do this. */
4719 /* Handle a "section" attribute; arguments as in
4720 struct attribute_spec.handler. */
4723 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4724 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4728 if (targetm.have_named_sections)
4730 if ((TREE_CODE (decl) == FUNCTION_DECL
4731 || TREE_CODE (decl) == VAR_DECL)
4732 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4734 if (TREE_CODE (decl) == VAR_DECL
4735 && current_function_decl != NULL_TREE
4736 && ! TREE_STATIC (decl))
4738 error ("%Jsection attribute cannot be specified for "
4739 "local variables", decl);
4740 *no_add_attrs = true;
4743 /* The decl may have already been given a section attribute
4744 from a previous declaration. Ensure they match. */
4745 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4746 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4747 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4749 error ("%Jsection of '%D' conflicts with previous declaration",
4751 *no_add_attrs = true;
4754 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4758 error ("%Jsection attribute not allowed for '%D'", *node, *node);
4759 *no_add_attrs = true;
4764 error ("%Jsection attributes are not supported for this target", *node);
4765 *no_add_attrs = true;
4771 /* Handle a "aligned" attribute; arguments as in
4772 struct attribute_spec.handler. */
4775 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4776 int flags, bool *no_add_attrs)
4778 tree decl = NULL_TREE;
4781 tree align_expr = (args ? TREE_VALUE (args)
4782 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4788 type = &TREE_TYPE (decl);
4789 is_type = TREE_CODE (*node) == TYPE_DECL;
4791 else if (TYPE_P (*node))
4792 type = node, is_type = 1;
4794 /* Strip any NOPs of any kind. */
4795 while (TREE_CODE (align_expr) == NOP_EXPR
4796 || TREE_CODE (align_expr) == CONVERT_EXPR
4797 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4798 align_expr = TREE_OPERAND (align_expr, 0);
4800 if (TREE_CODE (align_expr) != INTEGER_CST)
4802 error ("requested alignment is not a constant");
4803 *no_add_attrs = true;
4805 else if ((i = tree_log2 (align_expr)) == -1)
4807 error ("requested alignment is not a power of 2");
4808 *no_add_attrs = true;
4810 else if (i > HOST_BITS_PER_INT - 2)
4812 error ("requested alignment is too large");
4813 *no_add_attrs = true;
4817 /* If we have a TYPE_DECL, then copy the type, so that we
4818 don't accidentally modify a builtin type. See pushdecl. */
4819 if (decl && TREE_TYPE (decl) != error_mark_node
4820 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4822 tree tt = TREE_TYPE (decl);
4823 *type = build_type_copy (*type);
4824 DECL_ORIGINAL_TYPE (decl) = tt;
4825 TYPE_NAME (*type) = decl;
4826 TREE_USED (*type) = TREE_USED (decl);
4827 TREE_TYPE (decl) = *type;
4829 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4830 *type = build_type_copy (*type);
4832 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4833 TYPE_USER_ALIGN (*type) = 1;
4835 else if (TREE_CODE (decl) != VAR_DECL
4836 && TREE_CODE (decl) != FIELD_DECL)
4838 error ("%Jalignment may not be specified for '%D'", decl, decl);
4839 *no_add_attrs = true;
4843 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4844 DECL_USER_ALIGN (decl) = 1;
4850 /* Handle a "weak" attribute; arguments as in
4851 struct attribute_spec.handler. */
4854 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4855 tree args ATTRIBUTE_UNUSED,
4856 int flags ATTRIBUTE_UNUSED,
4857 bool *no_add_attrs ATTRIBUTE_UNUSED)
4859 declare_weak (*node);
4864 /* Handle an "alias" attribute; arguments as in
4865 struct attribute_spec.handler. */
4868 handle_alias_attribute (tree *node, tree name, tree args,
4869 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4873 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4874 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4876 error ("%J'%D' defined both normally and as an alias", decl, decl);
4877 *no_add_attrs = true;
4879 else if (decl_function_context (decl) == 0)
4883 id = TREE_VALUE (args);
4884 if (TREE_CODE (id) != STRING_CST)
4886 error ("alias arg not a string");
4887 *no_add_attrs = true;
4890 id = get_identifier (TREE_STRING_POINTER (id));
4891 /* This counts as a use of the object pointed to. */
4894 if (TREE_CODE (decl) == FUNCTION_DECL)
4895 DECL_INITIAL (decl) = error_mark_node;
4897 DECL_EXTERNAL (decl) = 0;
4901 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4902 *no_add_attrs = true;
4908 /* Handle an "visibility" attribute; arguments as in
4909 struct attribute_spec.handler. */
4912 handle_visibility_attribute (tree *node, tree name, tree args,
4913 int flags ATTRIBUTE_UNUSED,
4917 tree id = TREE_VALUE (args);
4919 *no_add_attrs = true;
4921 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
4923 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4927 if (TREE_CODE (id) != STRING_CST)
4929 error ("visibility arg not a string");
4933 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
4934 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4935 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
4936 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
4937 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
4938 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
4939 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
4940 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
4942 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4947 /* Handle an "tls_model" attribute; arguments as in
4948 struct attribute_spec.handler. */
4951 handle_tls_model_attribute (tree *node, tree name, tree args,
4952 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4956 if (! DECL_THREAD_LOCAL (decl))
4958 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4959 *no_add_attrs = true;
4965 id = TREE_VALUE (args);
4966 if (TREE_CODE (id) != STRING_CST)
4968 error ("tls_model arg not a string");
4969 *no_add_attrs = true;
4972 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4973 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4974 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4975 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4977 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4978 *no_add_attrs = true;
4986 /* Handle a "no_instrument_function" attribute; arguments as in
4987 struct attribute_spec.handler. */
4990 handle_no_instrument_function_attribute (tree *node, tree name,
4991 tree args ATTRIBUTE_UNUSED,
4992 int flags ATTRIBUTE_UNUSED,
4997 if (TREE_CODE (decl) != FUNCTION_DECL)
4999 error ("%J'%E' attribute applies only to functions", decl, name);
5000 *no_add_attrs = true;
5002 else if (DECL_INITIAL (decl))
5004 error ("%Jcan't set '%E' attribute after definition", decl, name);
5005 *no_add_attrs = true;
5008 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5013 /* Handle a "malloc" attribute; arguments as in
5014 struct attribute_spec.handler. */
5017 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5018 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5020 if (TREE_CODE (*node) == FUNCTION_DECL)
5021 DECL_IS_MALLOC (*node) = 1;
5022 /* ??? TODO: Support types. */
5025 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5026 *no_add_attrs = true;
5032 /* Handle a "no_limit_stack" attribute; arguments as in
5033 struct attribute_spec.handler. */
5036 handle_no_limit_stack_attribute (tree *node, tree name,
5037 tree args ATTRIBUTE_UNUSED,
5038 int flags ATTRIBUTE_UNUSED,
5043 if (TREE_CODE (decl) != FUNCTION_DECL)
5045 error ("%J'%E' attribute applies only to functions", decl, name);
5046 *no_add_attrs = true;
5048 else if (DECL_INITIAL (decl))
5050 error ("%Jcan't set '%E' attribute after definition", decl, name);
5051 *no_add_attrs = true;
5054 DECL_NO_LIMIT_STACK (decl) = 1;
5059 /* Handle a "pure" attribute; arguments as in
5060 struct attribute_spec.handler. */
5063 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5064 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5066 if (TREE_CODE (*node) == FUNCTION_DECL)
5067 DECL_IS_PURE (*node) = 1;
5068 /* ??? TODO: Support types. */
5071 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5072 *no_add_attrs = true;
5078 /* Handle a "deprecated" attribute; arguments as in
5079 struct attribute_spec.handler. */
5082 handle_deprecated_attribute (tree *node, tree name,
5083 tree args ATTRIBUTE_UNUSED, int flags,
5086 tree type = NULL_TREE;
5088 const char *what = NULL;
5093 type = TREE_TYPE (decl);
5095 if (TREE_CODE (decl) == TYPE_DECL
5096 || TREE_CODE (decl) == PARM_DECL
5097 || TREE_CODE (decl) == VAR_DECL
5098 || TREE_CODE (decl) == FUNCTION_DECL
5099 || TREE_CODE (decl) == FIELD_DECL)
5100 TREE_DEPRECATED (decl) = 1;
5104 else if (TYPE_P (*node))
5106 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5107 *node = build_type_copy (*node);
5108 TREE_DEPRECATED (*node) = 1;
5116 *no_add_attrs = true;
5117 if (type && TYPE_NAME (type))
5119 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5120 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5121 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5122 && DECL_NAME (TYPE_NAME (type)))
5123 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5126 warning ("`%s' attribute ignored for `%s'",
5127 IDENTIFIER_POINTER (name), what);
5129 warning ("`%s' attribute ignored",
5130 IDENTIFIER_POINTER (name));
5136 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5137 to prevent us from duplicating type nodes unnecessarily.
5138 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5139 since we want to distinguish types that are essentially identical (except
5140 for their debug representation), we use a local list here. */
5141 static GTY(()) tree vector_type_node_list = 0;
5143 /* Handle a "vector_size" attribute; arguments as in
5144 struct attribute_spec.handler. */
5147 handle_vector_size_attribute (tree *node, tree name, tree args,
5148 int flags ATTRIBUTE_UNUSED,
5151 unsigned HOST_WIDE_INT vecsize, nunits;
5152 enum machine_mode mode, orig_mode, new_mode;
5153 tree type = *node, new_type = NULL_TREE;
5154 tree type_list_node;
5156 *no_add_attrs = true;
5158 if (! host_integerp (TREE_VALUE (args), 1))
5160 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5164 /* Get the vector size (in bytes). */
5165 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5167 /* We need to provide for vector pointers, vector arrays, and
5168 functions returning vectors. For example:
5170 __attribute__((vector_size(16))) short *foo;
5172 In this case, the mode is SI, but the type being modified is
5173 HI, so we need to look further. */
5175 while (POINTER_TYPE_P (type)
5176 || TREE_CODE (type) == FUNCTION_TYPE
5177 || TREE_CODE (type) == METHOD_TYPE
5178 || TREE_CODE (type) == ARRAY_TYPE)
5179 type = TREE_TYPE (type);
5181 /* Get the mode of the type being modified. */
5182 orig_mode = TYPE_MODE (type);
5184 if (TREE_CODE (type) == RECORD_TYPE
5185 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5186 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5187 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5189 error ("invalid vector type for attribute `%s'",
5190 IDENTIFIER_POINTER (name));
5194 /* Calculate how many units fit in the vector. */
5195 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5197 /* Find a suitably sized vector. */
5198 new_mode = VOIDmode;
5199 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5201 : MODE_VECTOR_FLOAT);
5203 mode = GET_MODE_WIDER_MODE (mode))
5204 if (vecsize == GET_MODE_SIZE (mode)
5205 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5211 if (new_mode == VOIDmode)
5213 error ("no vector mode with the size and type specified could be found");
5217 for (type_list_node = vector_type_node_list; type_list_node;
5218 type_list_node = TREE_CHAIN (type_list_node))
5220 tree other_type = TREE_VALUE (type_list_node);
5221 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5222 tree fields = TYPE_FIELDS (record);
5223 tree field_type = TREE_TYPE (fields);
5224 tree array_type = TREE_TYPE (field_type);
5225 if (TREE_CODE (fields) != FIELD_DECL
5226 || TREE_CODE (field_type) != ARRAY_TYPE)
5229 if (TYPE_MODE (other_type) == mode && type == array_type)
5231 new_type = other_type;
5236 if (new_type == NULL_TREE)
5238 tree index, array, rt, list_node;
5240 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5241 TREE_UNSIGNED (type));
5245 error ("no vector mode with the size and type specified could be found");
5249 new_type = build_type_copy (new_type);
5251 /* If this is a vector, make sure we either have hardware
5252 support, or we can emulate it. */
5253 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5254 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5255 && !vector_mode_valid_p (mode))
5257 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5261 /* Set the debug information here, because this is the only
5262 place where we know the underlying type for a vector made
5263 with vector_size. For debugging purposes we pretend a vector
5264 is an array within a structure. */
5265 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5266 array = build_array_type (type, build_index_type (index));
5267 rt = make_node (RECORD_TYPE);
5269 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5270 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5272 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5274 list_node = build_tree_list (NULL, new_type);
5275 TREE_CHAIN (list_node) = vector_type_node_list;
5276 vector_type_node_list = list_node;
5279 /* Build back pointers if needed. */
5280 *node = vector_size_helper (*node, new_type);
5285 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5288 If we requested a pointer to a vector, build up the pointers that
5289 we stripped off while looking for the inner type. Similarly for
5290 return values from functions.
5292 The argument "type" is the top of the chain, and "bottom" is the
5293 new type which we will point to. */
5296 vector_size_helper (tree type, tree bottom)
5300 if (POINTER_TYPE_P (type))
5302 inner = vector_size_helper (TREE_TYPE (type), bottom);
5303 outer = build_pointer_type (inner);
5305 else if (TREE_CODE (type) == ARRAY_TYPE)
5307 inner = vector_size_helper (TREE_TYPE (type), bottom);
5308 outer = build_array_type (inner, TYPE_DOMAIN (type));
5310 else if (TREE_CODE (type) == FUNCTION_TYPE)
5312 inner = vector_size_helper (TREE_TYPE (type), bottom);
5313 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5315 else if (TREE_CODE (type) == METHOD_TYPE)
5317 inner = vector_size_helper (TREE_TYPE (type), bottom);
5318 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5320 TYPE_ARG_TYPES (type));
5325 TREE_READONLY (outer) = TREE_READONLY (type);
5326 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5331 /* Handle the "nonnull" attribute. */
5333 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5334 tree args, int flags ATTRIBUTE_UNUSED,
5338 unsigned HOST_WIDE_INT attr_arg_num;
5340 /* If no arguments are specified, all pointer arguments should be
5341 non-null. Verify a full prototype is given so that the arguments
5342 will have the correct types when we actually check them later. */
5345 if (! TYPE_ARG_TYPES (type))
5347 error ("nonnull attribute without arguments on a non-prototype");
5348 *no_add_attrs = true;
5353 /* Argument list specified. Verify that each argument number references
5354 a pointer argument. */
5355 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5358 unsigned HOST_WIDE_INT arg_num, ck_num;
5360 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5362 error ("nonnull argument has invalid operand number (arg %lu)",
5363 (unsigned long) attr_arg_num);
5364 *no_add_attrs = true;
5368 argument = TYPE_ARG_TYPES (type);
5371 for (ck_num = 1; ; ck_num++)
5373 if (! argument || ck_num == arg_num)
5375 argument = TREE_CHAIN (argument);
5379 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5381 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5382 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5383 *no_add_attrs = true;
5387 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5389 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5390 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5391 *no_add_attrs = true;
5400 /* Check the argument list of a function call for null in argument slots
5401 that are marked as requiring a non-null pointer argument. */
5404 check_function_nonnull (tree attrs, tree params)
5406 tree a, args, param;
5409 for (a = attrs; a; a = TREE_CHAIN (a))
5411 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5413 args = TREE_VALUE (a);
5415 /* Walk the argument list. If we encounter an argument number we
5416 should check for non-null, do it. If the attribute has no args,
5417 then every pointer argument is checked (in which case the check
5418 for pointer type is done in check_nonnull_arg). */
5419 for (param = params, param_num = 1; ;
5420 param_num++, param = TREE_CHAIN (param))
5424 if (! args || nonnull_check_p (args, param_num))
5425 check_function_arguments_recurse (check_nonnull_arg, NULL,
5433 /* Helper for check_function_nonnull; given a list of operands which
5434 must be non-null in ARGS, determine if operand PARAM_NUM should be
5438 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5440 unsigned HOST_WIDE_INT arg_num;
5442 for (; args; args = TREE_CHAIN (args))
5444 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5447 if (arg_num == param_num)
5453 /* Check that the function argument PARAM (which is operand number
5454 PARAM_NUM) is non-null. This is called by check_function_nonnull
5455 via check_function_arguments_recurse. */
5458 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5459 unsigned HOST_WIDE_INT param_num)
5461 /* Just skip checking the argument if it's not a pointer. This can
5462 happen if the "nonnull" attribute was given without an operand
5463 list (which means to check every pointer argument). */
5465 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5468 if (integer_zerop (param))
5469 warning ("null argument where non-null required (arg %lu)",
5470 (unsigned long) param_num);
5473 /* Helper for nonnull attribute handling; fetch the operand number
5474 from the attribute argument list. */
5477 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5479 /* Strip any conversions from the arg number and verify they
5481 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5482 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5483 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5484 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5486 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5487 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5490 *valp = TREE_INT_CST_LOW (arg_num_expr);
5494 /* Handle a "nothrow" attribute; arguments as in
5495 struct attribute_spec.handler. */
5498 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5499 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5501 if (TREE_CODE (*node) == FUNCTION_DECL)
5502 TREE_NOTHROW (*node) = 1;
5503 /* ??? TODO: Support types. */
5506 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5507 *no_add_attrs = true;
5513 /* Handle a "cleanup" attribute; arguments as in
5514 struct attribute_spec.handler. */
5517 handle_cleanup_attribute (tree *node, tree name, tree args,
5518 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5521 tree cleanup_id, cleanup_decl;
5523 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5524 for global destructors in C++. This requires infrastructure that
5525 we don't have generically at the moment. It's also not a feature
5526 we'd be missing too much, since we do have attribute constructor. */
5527 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5529 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5530 *no_add_attrs = true;
5534 /* Verify that the argument is a function in scope. */
5535 /* ??? We could support pointers to functions here as well, if
5536 that was considered desirable. */
5537 cleanup_id = TREE_VALUE (args);
5538 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5540 error ("cleanup arg not an identifier");
5541 *no_add_attrs = true;
5544 cleanup_decl = lookup_name (cleanup_id);
5545 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5547 error ("cleanup arg not a function");
5548 *no_add_attrs = true;
5552 /* That the function has proper type is checked with the
5553 eventual call to build_function_call. */
5558 /* Handle a "warn_unused_result" attribute. No special handling. */
5561 handle_warn_unused_result_attribute (tree *node, tree name,
5562 tree args ATTRIBUTE_UNUSED,
5563 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5565 /* Ignore the attribute for functions not returning any value. */
5566 if (VOID_TYPE_P (TREE_TYPE (*node)))
5568 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5569 *no_add_attrs = true;
5575 /* Check for valid arguments being passed to a function. */
5577 check_function_arguments (tree attrs, tree params)
5579 /* Check for null being passed in a pointer argument that must be
5580 non-null. We also need to do this if format checking is enabled. */
5583 check_function_nonnull (attrs, params);
5585 /* Check for errors in format strings. */
5588 check_function_format (NULL, attrs, params);
5591 /* Generic argument checking recursion routine. PARAM is the argument to
5592 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5593 once the argument is resolved. CTX is context for the callback. */
5595 check_function_arguments_recurse (void (*callback)
5596 (void *, tree, unsigned HOST_WIDE_INT),
5597 void *ctx, tree param,
5598 unsigned HOST_WIDE_INT param_num)
5600 if (TREE_CODE (param) == NOP_EXPR)
5602 /* Strip coercion. */
5603 check_function_arguments_recurse (callback, ctx,
5604 TREE_OPERAND (param, 0), param_num);
5608 if (TREE_CODE (param) == CALL_EXPR)
5610 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5612 bool found_format_arg = false;
5614 /* See if this is a call to a known internationalization function
5615 that modifies a format arg. Such a function may have multiple
5616 format_arg attributes (for example, ngettext). */
5618 for (attrs = TYPE_ATTRIBUTES (type);
5620 attrs = TREE_CHAIN (attrs))
5621 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5624 tree format_num_expr;
5628 /* Extract the argument number, which was previously checked
5630 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5631 while (TREE_CODE (format_num_expr) == NOP_EXPR
5632 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5633 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5634 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5636 if (TREE_CODE (format_num_expr) != INTEGER_CST
5637 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5640 format_num = TREE_INT_CST_LOW (format_num_expr);
5642 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5644 inner_args = TREE_CHAIN (inner_args), i++)
5645 if (i == format_num)
5647 check_function_arguments_recurse (callback, ctx,
5648 TREE_VALUE (inner_args),
5650 found_format_arg = true;
5655 /* If we found a format_arg attribute and did a recursive check,
5656 we are done with checking this argument. Otherwise, we continue
5657 and this will be considered a non-literal. */
5658 if (found_format_arg)
5662 if (TREE_CODE (param) == COND_EXPR)
5664 /* Check both halves of the conditional expression. */
5665 check_function_arguments_recurse (callback, ctx,
5666 TREE_OPERAND (param, 1), param_num);
5667 check_function_arguments_recurse (callback, ctx,
5668 TREE_OPERAND (param, 2), param_num);
5672 (*callback) (ctx, param, param_num);
5675 /* Function to help qsort sort FIELD_DECLs by name order. */
5678 field_decl_cmp (const void *x_p, const void *y_p)
5680 const tree *const x = x_p;
5681 const tree *const y = y_p;
5682 if (DECL_NAME (*x) == DECL_NAME (*y))
5683 /* A nontype is "greater" than a type. */
5684 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5685 if (DECL_NAME (*x) == NULL_TREE)
5687 if (DECL_NAME (*y) == NULL_TREE)
5689 if (DECL_NAME (*x) < DECL_NAME (*y))
5695 gt_pointer_operator new_value;
5699 /* This routine compares two fields like field_decl_cmp but using the
5700 pointer operator in resort_data. */
5703 resort_field_decl_cmp (const void *x_p, const void *y_p)
5705 const tree *const x = x_p;
5706 const tree *const y = y_p;
5708 if (DECL_NAME (*x) == DECL_NAME (*y))
5709 /* A nontype is "greater" than a type. */
5710 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5711 if (DECL_NAME (*x) == NULL_TREE)
5713 if (DECL_NAME (*y) == NULL_TREE)
5716 tree d1 = DECL_NAME (*x);
5717 tree d2 = DECL_NAME (*y);
5718 resort_data.new_value (&d1, resort_data.cookie);
5719 resort_data.new_value (&d2, resort_data.cookie);
5726 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5729 resort_sorted_fields (void *obj,
5730 void *orig_obj ATTRIBUTE_UNUSED ,
5731 gt_pointer_operator new_value,
5734 struct sorted_fields_type *sf = obj;
5735 resort_data.new_value = new_value;
5736 resort_data.cookie = cookie;
5737 qsort (&sf->elts[0], sf->len, sizeof (tree),
5738 resort_field_decl_cmp);
5741 /* Used by estimate_num_insns. Estimate number of instructions seen
5742 by given statement. */
5744 c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
5749 if (TYPE_P (x) || DECL_P (x))
5754 /* Assume that constants and references counts nothing. These should
5755 be majorized by amount of operations among them we count later
5756 and are common target of CSE and similar optimizations. */
5757 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
5758 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
5760 switch (TREE_CODE (x))
5762 /* Recognize assignments of large structures and constructors of
5767 int size = int_size_in_bytes (TREE_TYPE (x));
5769 if (!size || size > MOVE_MAX_PIECES)
5772 *count += 2 * (size + MOVE_MAX - 1) / MOVE_MAX;
5776 /* Few special cases of expensive operations. This is usefull
5777 to avoid inlining on functions having too many of these. */
5778 case TRUNC_DIV_EXPR:
5780 case FLOOR_DIV_EXPR:
5781 case ROUND_DIV_EXPR:
5782 case TRUNC_MOD_EXPR:
5784 case FLOOR_MOD_EXPR:
5785 case ROUND_MOD_EXPR:
5790 /* Various containers that will produce no code themselves. */
5797 case IDENTIFIER_NODE:
5798 case PLACEHOLDER_EXPR:
5799 case WITH_CLEANUP_EXPR:
5800 case CLEANUP_POINT_EXPR:
5802 case VIEW_CONVERT_EXPR:
5808 case TRY_CATCH_EXPR:
5809 case TRY_FINALLY_EXPR:
5812 case LABELED_BLOCK_EXPR:
5813 case EXIT_BLOCK_EXPR:
5814 case EXPR_WITH_FILE_LOCATION:
5831 /* Do not account static initializers. */
5832 if (TREE_STATIC (TREE_OPERAND (x, 0)))
5841 /* Estimate number of instructions that will be created by expanding the body. */
5843 c_estimate_num_insns (tree decl)
5846 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl), c_estimate_num_insns_1, &num);
5850 /* Used by c_decl_uninit to find where expressions like x = x + 1; */
5853 c_decl_uninit_1 (tree *t, int *walk_sub_trees, void *x)
5855 /* If x = EXP(&x)EXP, then do not warn about the use of x. */
5856 if (TREE_CODE (*t) == ADDR_EXPR && TREE_OPERAND (*t, 0) == x)
5858 *walk_sub_trees = 0;
5866 /* Find out if a variable is uninitialized based on DECL_INITIAL. */
5869 c_decl_uninit (tree t)
5871 /* int x = x; is GCC extension to turn off this warning, only if warn_init_self is zero. */
5872 if (DECL_INITIAL (t) == t)
5873 return warn_init_self ? true : false;
5875 /* Walk the trees looking for the variable itself. */
5876 if (walk_tree_without_duplicates (&DECL_INITIAL (t), c_decl_uninit_1, t))
5881 /* Issue the error given by MSGID, indicating that it occurred before
5882 TOKEN, which had the associated VALUE. */
5885 c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5887 const char *string = _(msgid);
5889 if (token == CPP_EOF)
5890 error ("%s at end of input", string);
5891 else if (token == CPP_CHAR || token == CPP_WCHAR)
5893 unsigned int val = TREE_INT_CST_LOW (value);
5894 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5895 if (val <= UCHAR_MAX && ISGRAPH (val))
5896 error ("%s before %s'%c'", string, ell, val);
5898 error ("%s before %s'\\x%x'", string, ell, val);
5900 else if (token == CPP_STRING
5901 || token == CPP_WSTRING)
5902 error ("%s before string constant", string);
5903 else if (token == CPP_NUMBER)
5904 error ("%s before numeric constant", string);
5905 else if (token == CPP_NAME)
5906 error ("%s before \"%s\"", string, IDENTIFIER_POINTER (value));
5907 else if (token < N_TTYPES)
5908 error ("%s before '%s' token", string, cpp_type2name (token));
5910 error ("%s", string);
5913 #include "gt-c-common.h"