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, 2004 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 do not warn that K&R style main() is not a function prototype. */
277 int flag_bsd_no_warn_kr_main;
279 /* Nonzero means warn for any global function def
280 without separate previous prototype decl. */
282 int warn_missing_prototypes;
284 /* Warn if adding () is suggested. */
286 int warn_parentheses;
288 /* Warn if initializer is not completely bracketed. */
290 int warn_missing_braces;
292 /* Warn about comparison of signed and unsigned values.
293 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified
294 (in which case -Wextra gets to decide). */
296 int warn_sign_compare = -1;
298 /* Nonzero means warn about usage of long long when `-pedantic'. */
300 int warn_long_long = 1;
302 /* Nonzero means warn about deprecated conversion from string constant to
305 int warn_write_strings;
307 /* Nonzero means warn about multiple (redundant) decls for the same single
308 variable or function. */
310 int warn_redundant_decls;
312 /* Warn about testing equality of floating point numbers. */
314 int warn_float_equal;
316 /* Warn about a subscript that has type char. */
318 int warn_char_subscripts;
320 /* Warn if a type conversion is done that might have confusing results. */
324 /* Warn about #pragma directives that are not recognized. */
326 int warn_unknown_pragmas; /* Tri state variable. */
328 /* Warn about format/argument anomalies in calls to formatted I/O functions
329 (*printf, *scanf, strftime, strfmon, etc.). */
333 /* Warn about Y2K problems with strftime formats. */
337 /* Warn about excess arguments to formats. */
339 int warn_format_extra_args;
341 /* Warn about zero-length formats. */
343 int warn_format_zero_length;
345 /* Warn about non-literal format arguments. */
347 int warn_format_nonliteral;
349 /* Warn about possible security problems with calls to format functions. */
351 int warn_format_security;
353 /* Zero means that faster, ...NonNil variants of objc_msgSend...
354 calls will be used in ObjC; passing nil receivers to such calls
355 will most likely result in crashes. */
356 int flag_nil_receivers = 1;
358 /* Nonzero means that we will allow new ObjC exception syntax (@throw,
359 @try, etc.) in source code. */
360 int flag_objc_exceptions = 0;
362 /* Nonzero means that code generation will be altered to support
363 "zero-link" execution. This currently affects ObjC only, but may
364 affect other languages in the future. */
365 int flag_zero_link = 0;
367 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
368 unit. It will inform the ObjC runtime that class definition(s) herein
369 contained are to replace one(s) previously loaded. */
370 int flag_replace_objc_classes = 0;
372 /* C/ObjC language option variables. */
375 /* Nonzero means message about use of implicit function declarations;
376 1 means warning; 2 means error. */
378 int mesg_implicit_function_declaration = -1;
380 /* Nonzero means allow type mismatches in conditional expressions;
381 just make their values `void'. */
383 int flag_cond_mismatch;
385 /* Nonzero means enable C89 Amendment 1 features. */
389 /* Nonzero means use the ISO C99 dialect of C. */
393 /* Nonzero means allow the BSD kernel printf enhancements. */
397 /* Nonzero means that we have builtin functions, and main is an int. */
401 /* Nonzero means warn when casting a function call to a type that does
402 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
403 when there is no previous declaration of sqrt or malloc. */
405 int warn_bad_function_cast;
407 /* Warn about traditional constructs whose meanings changed in ANSI C. */
409 int warn_traditional;
411 /* Nonzero means warn for a declaration found after a statement. */
413 int warn_declaration_after_statement;
415 /* Nonzero means warn for non-prototype function decls
416 or non-prototyped defs without previous prototype. */
418 int warn_strict_prototypes;
420 /* Nonzero means warn for any global function def
421 without separate previous decl. */
423 int warn_missing_declarations;
425 /* Nonzero means warn about declarations of objects not at
426 file-scope level and about *all* declarations of functions (whether
427 or static) not at file-scope level. Note that we exclude
428 implicit function declarations. To get warnings about those, use
431 int warn_nested_externs;
433 /* Warn if main is suspicious. */
437 /* Nonzero means warn about possible violations of sequence point rules. */
439 int warn_sequence_point;
441 /* Nonzero means warn about uninitialized variable when it is initialized with itself.
442 For example: int i = i;, GCC will not warn about this when warn_init_self is nonzero. */
446 /* Nonzero means to warn about compile-time division by zero. */
447 int warn_div_by_zero = 1;
449 /* Nonzero means warn about use of implicit int. */
451 int warn_implicit_int;
453 /* Warn about NULL being passed to argument slots marked as requiring
458 /* Warn about old-style parameter declaration. */
460 int warn_old_style_definition;
463 /* ObjC language option variables. */
466 /* Open and close the file for outputting class declarations, if
469 int flag_gen_declaration;
471 /* Generate code for GNU or NeXT runtime environment. */
473 #ifdef NEXT_OBJC_RUNTIME
474 int flag_next_runtime = 1;
476 int flag_next_runtime = 0;
479 /* Tells the compiler that this is a special run. Do not perform any
480 compiling, instead we are to test some platform dependent features
481 and output a C header file with appropriate definitions. */
483 int print_struct_values;
485 /* ???. Undocumented. */
487 const char *constant_string_class_name;
489 /* Warn if multiple methods are seen for the same selector, but with
490 different argument types. Performs the check on the whole selector
491 table at the end of compilation. */
495 /* Warn if a @selector() is found, and no method with that selector
496 has been previously declared. The check is done on each
497 @selector() as soon as it is found - so it warns about forward
500 int warn_undeclared_selector;
502 /* Warn if methods required by a protocol are not implemented in the
503 class adopting it. When turned off, methods inherited to that
504 class are also considered implemented. */
506 int warn_protocol = 1;
509 /* C++ language option variables. */
512 /* Nonzero means don't recognize any extension keywords. */
514 int flag_no_gnu_keywords;
516 /* Nonzero means do emit exported implementations of functions even if
517 they can be inlined. */
519 int flag_implement_inlines = 1;
521 /* Nonzero means that implicit instantiations will be emitted if needed. */
523 int flag_implicit_templates = 1;
525 /* Nonzero means that implicit instantiations of inline templates will be
526 emitted if needed, even if instantiations of non-inline templates
529 int flag_implicit_inline_templates = 1;
531 /* Nonzero means generate separate instantiation control files and
532 juggle them at link time. */
534 int flag_use_repository;
536 /* Nonzero if we want to issue diagnostics that the standard says are not
539 int flag_optional_diags = 1;
541 /* Nonzero means we should attempt to elide constructors when possible. */
543 int flag_elide_constructors = 1;
545 /* Nonzero means that member functions defined in class scope are
546 inline by default. */
548 int flag_default_inline = 1;
550 /* Controls whether compiler generates 'type descriptor' that give
551 run-time type information. */
555 /* Nonzero if we want to conserve space in the .o files. We do this
556 by putting uninitialized data and runtime initialized data into
557 .common instead of .data at the expense of not flagging multiple
560 int flag_conserve_space;
562 /* Nonzero if we want to obey access control semantics. */
564 int flag_access_control = 1;
566 /* Nonzero if we want to check the return value of new and avoid calling
567 constructors if it is a null pointer. */
571 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
572 initialization variables.
573 0: Old rules, set by -fno-for-scope.
574 2: New ISO rules, set by -ffor-scope.
575 1: Try to implement new ISO rules, but with backup compatibility
576 (and warnings). This is the default, for now. */
578 int flag_new_for_scope = 1;
580 /* Nonzero if we want to emit defined symbols with common-like linkage as
581 weak symbols where possible, in order to conform to C++ semantics.
582 Otherwise, emit them as local symbols. */
586 /* 0 means we want the preprocessor to not emit line directives for
587 the current working directory. 1 means we want it to do it. -1
588 means we should decide depending on whether debugging information
589 is being emitted or not. */
591 int flag_working_directory = -1;
593 /* Nonzero to use __cxa_atexit, rather than atexit, to register
594 destructors for local statics and global objects. */
596 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
598 /* Nonzero means make the default pedwarns warnings instead of errors.
599 The value of this flag is ignored if -pedantic is specified. */
603 /* Nonzero means to implement standard semantics for exception
604 specifications, calling unexpected if an exception is thrown that
605 doesn't match the specification. Zero means to treat them as
606 assertions and optimize accordingly, but not check them. */
608 int flag_enforce_eh_specs = 1;
610 /* Nonzero means warn about things that will change when compiling
611 with an ABI-compliant compiler. */
615 /* Nonzero means warn about invalid uses of offsetof. */
617 int warn_invalid_offsetof = 1;
619 /* Nonzero means warn about implicit declarations. */
621 int warn_implicit = 1;
623 /* Nonzero means warn when all ctors or dtors are private, and the class
626 int warn_ctor_dtor_privacy = 0;
628 /* Nonzero means warn in function declared in derived class has the
629 same name as a virtual in the base class, but fails to match the
630 type signature of any virtual function in the base class. */
632 int warn_overloaded_virtual;
634 /* Nonzero means warn when declaring a class that has a non virtual
635 destructor, when it really ought to have a virtual one. */
639 /* Nonzero means warn when the compiler will reorder code. */
643 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
647 /* Nonzero means warn when we convert a pointer to member function
648 into a pointer to (void or function). */
650 int warn_pmf2ptr = 1;
652 /* Nonzero means warn about violation of some Effective C++ style rules. */
656 /* Nonzero means warn where overload resolution chooses a promotion from
657 unsigned to signed over a conversion to an unsigned of the same size. */
661 /* Nonzero means warn when an old-style cast is used. */
663 int warn_old_style_cast;
665 /* Nonzero means warn when non-templatized friend functions are
666 declared within a template */
668 int warn_nontemplate_friend = 1;
670 /* Nonzero means complain about deprecated features. */
672 int warn_deprecated = 1;
674 /* Maximum template instantiation depth. This limit is rather
675 arbitrary, but it exists to limit the time it takes to notice
676 infinite template instantiations. */
678 int max_tinst_depth = 500;
682 /* The elements of `ridpointers' are identifier nodes for the reserved
683 type names and storage classes. It is indexed by a RID_... value. */
686 tree (*make_fname_decl) (tree, int);
688 /* If non-NULL, the address of a language-specific function that takes
689 any action required right before expand_function_end is called. */
690 void (*lang_expand_function_end) (void);
692 /* Nonzero means the expression being parsed will never be evaluated.
693 This is a count, since unevaluated expressions can nest. */
696 /* Information about how a function name is generated. */
699 tree *const decl; /* pointer to the VAR_DECL. */
700 const unsigned rid; /* RID number for the identifier. */
701 const int pretty; /* How pretty is it? */
704 /* The three ways of getting then name of the current function. */
706 const struct fname_var_t fname_vars[] =
708 /* C99 compliant __func__, must be first. */
709 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
710 /* GCC __FUNCTION__ compliant. */
711 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
712 /* GCC __PRETTY_FUNCTION__ compliant. */
713 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
717 static int constant_fits_type_p (tree, tree);
719 /* Keep a stack of if statements. We record the number of compound
720 statements seen up to the if keyword, as well as the line number
721 and file of the if. If a potentially ambiguous else is seen, that
722 fact is recorded; the warning is issued when we can be sure that
723 the enclosing if statement does not have an else branch. */
732 static if_elt *if_stack;
734 /* Amount of space in the if statement stack. */
735 static int if_stack_space = 0;
738 static int if_stack_pointer = 0;
740 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
741 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
742 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
743 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
744 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
745 static tree handle_always_inline_attribute (tree *, tree, tree, int,
747 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
748 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
749 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
750 static tree handle_transparent_union_attribute (tree *, tree, tree,
752 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
753 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
754 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
755 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
756 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
757 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
758 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
759 static tree handle_visibility_attribute (tree *, tree, tree, int,
761 static tree handle_tls_model_attribute (tree *, tree, tree, int,
763 static tree handle_no_instrument_function_attribute (tree *, tree,
765 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
766 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
768 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
769 static tree handle_deprecated_attribute (tree *, tree, tree, int,
771 static tree handle_vector_size_attribute (tree *, tree, tree, int,
773 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
774 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
775 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
776 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
778 static tree vector_size_helper (tree, tree);
780 static void check_function_nonnull (tree, tree);
781 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
782 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
783 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
784 static int resort_field_decl_cmp (const void *, const void *);
786 /* Table of machine-independent attributes common to all C-like languages. */
787 const struct attribute_spec c_common_attribute_table[] =
789 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
790 { "packed", 0, 0, false, false, false,
791 handle_packed_attribute },
792 { "nocommon", 0, 0, true, false, false,
793 handle_nocommon_attribute },
794 { "common", 0, 0, true, false, false,
795 handle_common_attribute },
796 /* FIXME: logically, noreturn attributes should be listed as
797 "false, true, true" and apply to function types. But implementing this
798 would require all the places in the compiler that use TREE_THIS_VOLATILE
799 on a decl to identify non-returning functions to be located and fixed
800 to check the function type instead. */
801 { "noreturn", 0, 0, true, false, false,
802 handle_noreturn_attribute },
803 { "volatile", 0, 0, true, false, false,
804 handle_noreturn_attribute },
805 { "noinline", 0, 0, true, false, false,
806 handle_noinline_attribute },
807 { "always_inline", 0, 0, true, false, false,
808 handle_always_inline_attribute },
809 { "used", 0, 0, true, false, false,
810 handle_used_attribute },
811 { "unused", 0, 0, false, false, false,
812 handle_unused_attribute },
813 /* The same comments as for noreturn attributes apply to const ones. */
814 { "const", 0, 0, true, false, false,
815 handle_const_attribute },
816 { "transparent_union", 0, 0, false, false, false,
817 handle_transparent_union_attribute },
818 { "constructor", 0, 0, true, false, false,
819 handle_constructor_attribute },
820 { "destructor", 0, 0, true, false, false,
821 handle_destructor_attribute },
822 { "mode", 1, 1, false, true, false,
823 handle_mode_attribute },
824 { "section", 1, 1, true, false, false,
825 handle_section_attribute },
826 { "aligned", 0, 1, false, false, false,
827 handle_aligned_attribute },
828 { "weak", 0, 0, true, false, false,
829 handle_weak_attribute },
830 { "alias", 1, 1, true, false, false,
831 handle_alias_attribute },
832 { "no_instrument_function", 0, 0, true, false, false,
833 handle_no_instrument_function_attribute },
834 { "malloc", 0, 0, true, false, false,
835 handle_malloc_attribute },
836 { "no_stack_limit", 0, 0, true, false, false,
837 handle_no_limit_stack_attribute },
838 { "pure", 0, 0, true, false, false,
839 handle_pure_attribute },
840 { "deprecated", 0, 0, false, false, false,
841 handle_deprecated_attribute },
842 { "vector_size", 1, 1, false, true, false,
843 handle_vector_size_attribute },
844 { "visibility", 1, 1, true, false, false,
845 handle_visibility_attribute },
846 { "tls_model", 1, 1, true, false, false,
847 handle_tls_model_attribute },
848 { "nonnull", 0, -1, false, true, true,
849 handle_nonnull_attribute },
850 { "nothrow", 0, 0, true, false, false,
851 handle_nothrow_attribute },
852 { "may_alias", 0, 0, false, true, false, NULL },
853 { "cleanup", 1, 1, true, false, false,
854 handle_cleanup_attribute },
855 { "warn_unused_result", 0, 0, false, true, true,
856 handle_warn_unused_result_attribute },
857 { NULL, 0, 0, false, false, false, NULL }
860 /* Give the specifications for the format attributes, used by C and all
863 const struct attribute_spec c_common_format_attribute_table[] =
865 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
866 { "format", 3, 3, false, true, true,
867 handle_format_attribute },
868 { "format_arg", 1, 1, false, true, true,
869 handle_format_arg_attribute },
870 { NULL, 0, 0, false, false, false, NULL }
873 /* Record the start of an if-then, and record the start of it
874 for ambiguous else detection.
876 COND is the condition for the if-then statement.
878 IF_STMT is the statement node that has already been created for
879 this if-then statement. It is created before parsing the
880 condition to keep line number information accurate. */
883 c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
885 /* Make sure there is enough space on the stack. */
886 if (if_stack_space == 0)
889 if_stack = xmalloc (10 * sizeof (if_elt));
891 else if (if_stack_space == if_stack_pointer)
893 if_stack_space += 10;
894 if_stack = xrealloc (if_stack, if_stack_space * sizeof (if_elt));
897 IF_COND (if_stmt) = cond;
900 /* Record this if statement. */
901 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
902 if_stack[if_stack_pointer].locus = input_location;
903 if_stack[if_stack_pointer].needs_warning = 0;
904 if_stack[if_stack_pointer].if_stmt = if_stmt;
908 /* Called after the then-clause for an if-statement is processed. */
913 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
914 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
917 /* Record the end of an if-then. Optionally warn if a nested
918 if statement had an ambiguous else clause. */
921 c_expand_end_cond (void)
924 if (if_stack[if_stack_pointer].needs_warning)
925 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
926 &if_stack[if_stack_pointer].locus);
927 last_expr_type = NULL_TREE;
930 /* Called between the then-clause and the else-clause
931 of an if-then-else. */
934 c_expand_start_else (void)
936 /* An ambiguous else warning must be generated for the enclosing if
937 statement, unless we see an else branch for that one, too. */
939 && if_stack_pointer > 1
940 && (if_stack[if_stack_pointer - 1].compstmt_count
941 == if_stack[if_stack_pointer - 2].compstmt_count))
942 if_stack[if_stack_pointer - 2].needs_warning = 1;
944 /* Even if a nested if statement had an else branch, it can't be
945 ambiguous if this one also has an else. So don't warn in that
946 case. Also don't warn for any if statements nested in this else. */
947 if_stack[if_stack_pointer - 1].needs_warning = 0;
948 if_stack[if_stack_pointer - 1].compstmt_count--;
951 /* Called after the else-clause for an if-statement is processed. */
956 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
957 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
960 /* Begin an if-statement. Returns a newly created IF_STMT if
963 Unlike the C++ front-end, we do not call add_stmt here; it is
964 probably safe to do so, but I am not very familiar with this
965 code so I am being extra careful not to change its behavior
966 beyond what is strictly necessary for correctness. */
969 c_begin_if_stmt (void)
972 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
976 /* Begin a while statement. Returns a newly created WHILE_STMT if
979 Unlike the C++ front-end, we do not call add_stmt here; it is
980 probably safe to do so, but I am not very familiar with this
981 code so I am being extra careful not to change its behavior
982 beyond what is strictly necessary for correctness. */
985 c_begin_while_stmt (void)
988 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
993 c_finish_while_stmt_cond (tree cond, tree while_stmt)
995 WHILE_COND (while_stmt) = cond;
998 /* Push current bindings for the function name VAR_DECLS. */
1001 start_fname_decls (void)
1004 tree saved = NULL_TREE;
1006 for (ix = 0; fname_vars[ix].decl; ix++)
1008 tree decl = *fname_vars[ix].decl;
1012 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
1013 *fname_vars[ix].decl = NULL_TREE;
1016 if (saved || saved_function_name_decls)
1017 /* Normally they'll have been NULL, so only push if we've got a
1018 stack, or they are non-NULL. */
1019 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1020 saved_function_name_decls);
1023 /* Finish up the current bindings, adding them into the
1024 current function's statement tree. This is done by wrapping the
1025 function's body in a COMPOUND_STMT containing these decls too. This
1026 must be done _before_ finish_stmt_tree is called. If there is no
1027 current function, we must be at file scope and no statements are
1028 involved. Pop the previous bindings. */
1031 finish_fname_decls (void)
1034 tree body = NULL_TREE;
1035 tree stack = saved_function_name_decls;
1037 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1038 body = chainon (TREE_VALUE (stack), body);
1042 /* They were called into existence, so add to statement tree. Add
1043 the DECL_STMTs inside the outermost scope. */
1044 tree *p = &DECL_SAVED_TREE (current_function_decl);
1045 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1046 while (TREE_CODE (*p) != COMPOUND_STMT)
1048 if (TREE_CODE (*p) == EXPR_STMT)
1049 p = &TREE_CHAIN (*p);
1051 p = &TREE_OPERAND(*p, 0);
1054 p = &COMPOUND_BODY (*p);
1055 if (TREE_CODE (*p) == SCOPE_STMT)
1056 p = &TREE_CHAIN (*p);
1058 body = chainon (body, *p);
1062 for (ix = 0; fname_vars[ix].decl; ix++)
1063 *fname_vars[ix].decl = NULL_TREE;
1067 /* We had saved values, restore them. */
1070 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1072 tree decl = TREE_PURPOSE (saved);
1073 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1075 *fname_vars[ix].decl = decl;
1077 stack = TREE_CHAIN (stack);
1079 saved_function_name_decls = stack;
1082 /* Return the text name of the current function, suitably prettified
1086 fname_as_string (int pretty_p)
1088 const char *name = "top level";
1097 if (current_function_decl)
1098 name = (*lang_hooks.decl_printable_name) (current_function_decl, vrb);
1103 /* Return the VAR_DECL for a const char array naming the current
1104 function. If the VAR_DECL has not yet been created, create it
1105 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1106 ID is its name (unfortunately C and C++ hold the RID values of
1107 keywords in different places, so we can't derive RID from ID in
1108 this language independent code. */
1111 fname_decl (unsigned int rid, tree id)
1114 tree decl = NULL_TREE;
1116 for (ix = 0; fname_vars[ix].decl; ix++)
1117 if (fname_vars[ix].rid == rid)
1120 decl = *fname_vars[ix].decl;
1123 tree saved_last_tree = last_tree;
1124 /* If a tree is built here, it would normally have the lineno of
1125 the current statement. Later this tree will be moved to the
1126 beginning of the function and this line number will be wrong.
1127 To avoid this problem set the lineno to 0 here; that prevents
1128 it from appearing in the RTL. */
1129 int saved_lineno = input_line;
1132 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1133 if (last_tree != saved_last_tree)
1135 /* We created some statement tree for the decl. This belongs
1136 at the start of the function, so remove it now and reinsert
1137 it after the function is complete. */
1138 tree stmts = TREE_CHAIN (saved_last_tree);
1140 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1141 last_tree = saved_last_tree;
1142 saved_function_name_decls = tree_cons (decl, stmts,
1143 saved_function_name_decls);
1145 *fname_vars[ix].decl = decl;
1146 input_line = saved_lineno;
1148 if (!ix && !current_function_decl)
1149 pedwarn ("%J'%D' is not defined outside of function scope", decl, decl);
1154 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1157 fix_string_type (tree value)
1159 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1160 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1161 const int nchars_max = flag_isoc99 ? 4095 : 509;
1162 int length = TREE_STRING_LENGTH (value);
1165 /* Compute the number of elements, for the array type. */
1166 nchars = wide_flag ? length / wchar_bytes : length;
1168 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1169 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1170 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1172 /* Create the array type for the string constant.
1173 -Wwrite-strings says make the string constant an array of const char
1174 so that copying it to a non-const pointer will get a warning.
1175 For C++, this is the standard behavior. */
1176 if (flag_const_strings && ! flag_writable_strings)
1179 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1182 = build_array_type (elements,
1183 build_index_type (build_int_2 (nchars - 1, 0)));
1187 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1188 build_index_type (build_int_2 (nchars - 1, 0)));
1190 TREE_CONSTANT (value) = 1;
1191 TREE_READONLY (value) = ! flag_writable_strings;
1192 TREE_STATIC (value) = 1;
1196 /* Print a warning if a constant expression had overflow in folding.
1197 Invoke this function on every expression that the language
1198 requires to be a constant expression.
1199 Note the ANSI C standard says it is erroneous for a
1200 constant expression to overflow. */
1203 constant_expression_warning (tree value)
1205 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1206 || TREE_CODE (value) == VECTOR_CST
1207 || TREE_CODE (value) == COMPLEX_CST)
1208 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1209 pedwarn ("overflow in constant expression");
1212 /* Print a warning if an expression had overflow in folding.
1213 Invoke this function on every expression that
1214 (1) appears in the source code, and
1215 (2) might be a constant expression that overflowed, and
1216 (3) is not already checked by convert_and_check;
1217 however, do not invoke this function on operands of explicit casts. */
1220 overflow_warning (tree value)
1222 if ((TREE_CODE (value) == INTEGER_CST
1223 || (TREE_CODE (value) == COMPLEX_CST
1224 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1225 && TREE_OVERFLOW (value))
1227 TREE_OVERFLOW (value) = 0;
1228 if (skip_evaluation == 0)
1229 warning ("integer overflow in expression");
1231 else if ((TREE_CODE (value) == REAL_CST
1232 || (TREE_CODE (value) == COMPLEX_CST
1233 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1234 && TREE_OVERFLOW (value))
1236 TREE_OVERFLOW (value) = 0;
1237 if (skip_evaluation == 0)
1238 warning ("floating point overflow in expression");
1240 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1242 TREE_OVERFLOW (value) = 0;
1243 if (skip_evaluation == 0)
1244 warning ("vector overflow in expression");
1248 /* Print a warning if a large constant is truncated to unsigned,
1249 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1250 Invoke this function on every expression that might be implicitly
1251 converted to an unsigned type. */
1254 unsigned_conversion_warning (tree result, tree operand)
1256 tree type = TREE_TYPE (result);
1258 if (TREE_CODE (operand) == INTEGER_CST
1259 && TREE_CODE (type) == INTEGER_TYPE
1260 && TREE_UNSIGNED (type)
1261 && skip_evaluation == 0
1262 && !int_fits_type_p (operand, type))
1264 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1265 /* This detects cases like converting -129 or 256 to unsigned char. */
1266 warning ("large integer implicitly truncated to unsigned type");
1267 else if (warn_conversion)
1268 warning ("negative integer implicitly converted to unsigned type");
1272 /* Nonzero if constant C has a value that is permissible
1273 for type TYPE (an INTEGER_TYPE). */
1276 constant_fits_type_p (tree c, tree type)
1278 if (TREE_CODE (c) == INTEGER_CST)
1279 return int_fits_type_p (c, type);
1281 c = convert (type, c);
1282 return !TREE_OVERFLOW (c);
1285 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1286 Invoke this function on every expression that is converted implicitly,
1287 i.e. because of language rules and not because of an explicit cast. */
1290 convert_and_check (tree type, tree expr)
1292 tree t = convert (type, expr);
1293 if (TREE_CODE (t) == INTEGER_CST)
1295 if (TREE_OVERFLOW (t))
1297 TREE_OVERFLOW (t) = 0;
1299 /* Do not diagnose overflow in a constant expression merely
1300 because a conversion overflowed. */
1301 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1303 /* No warning for converting 0x80000000 to int. */
1304 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1305 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1306 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1307 /* If EXPR fits in the unsigned version of TYPE,
1308 don't warn unless pedantic. */
1310 || TREE_UNSIGNED (type)
1311 || ! constant_fits_type_p (expr,
1312 c_common_unsigned_type (type)))
1313 && skip_evaluation == 0)
1314 warning ("overflow in implicit constant conversion");
1317 unsigned_conversion_warning (t, expr);
1322 /* A node in a list that describes references to variables (EXPR), which are
1323 either read accesses if WRITER is zero, or write accesses, in which case
1324 WRITER is the parent of EXPR. */
1331 /* Used to implement a cache the results of a call to verify_tree. We only
1332 use this for SAVE_EXPRs. */
1335 struct tlist_cache *next;
1336 struct tlist *cache_before_sp;
1337 struct tlist *cache_after_sp;
1341 /* Obstack to use when allocating tlist structures, and corresponding
1343 static struct obstack tlist_obstack;
1344 static char *tlist_firstobj = 0;
1346 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1348 static struct tlist *warned_ids;
1349 /* SAVE_EXPRs need special treatment. We process them only once and then
1350 cache the results. */
1351 static struct tlist_cache *save_expr_cache;
1353 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1354 static void merge_tlist (struct tlist **, struct tlist *, int);
1355 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1356 static int warning_candidate_p (tree);
1357 static void warn_for_collisions (struct tlist *);
1358 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1359 static struct tlist *new_tlist (struct tlist *, tree, tree);
1360 static void verify_sequence_points (tree);
1362 /* Create a new struct tlist and fill in its fields. */
1363 static struct tlist *
1364 new_tlist (struct tlist *next, tree t, tree writer)
1367 l = obstack_alloc (&tlist_obstack, sizeof *l);
1374 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1375 is nonnull, we ignore any node we find which has a writer equal to it. */
1378 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1382 struct tlist *next = add->next;
1385 if (! exclude_writer || add->writer != exclude_writer)
1386 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1391 /* Merge the nodes of ADD into TO. This merging process is done so that for
1392 each variable that already exists in TO, no new node is added; however if
1393 there is a write access recorded in ADD, and an occurrence on TO is only
1394 a read access, then the occurrence in TO will be modified to record the
1398 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1400 struct tlist **end = to;
1403 end = &(*end)->next;
1409 struct tlist *next = add->next;
1411 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1412 if (tmp2->expr == add->expr)
1416 tmp2->writer = add->writer;
1420 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1421 end = &(*end)->next;
1428 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1429 references in list LIST conflict with it, excluding reads if ONLY writers
1433 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1438 /* Avoid duplicate warnings. */
1439 for (tmp = warned_ids; tmp; tmp = tmp->next)
1440 if (tmp->expr == written)
1445 if (list->expr == written
1446 && list->writer != writer
1447 && (! only_writes || list->writer))
1449 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1450 warning ("operation on `%s' may be undefined",
1451 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1457 /* Given a list LIST of references to variables, find whether any of these
1458 can cause conflicts due to missing sequence points. */
1461 warn_for_collisions (struct tlist *list)
1465 for (tmp = list; tmp; tmp = tmp->next)
1468 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1472 /* Return nonzero if X is a tree that can be verified by the sequence point
1475 warning_candidate_p (tree x)
1477 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1480 /* Walk the tree X, and record accesses to variables. If X is written by the
1481 parent tree, WRITER is the parent.
1482 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1483 expression or its only operand forces a sequence point, then everything up
1484 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1486 Once we return, we will have emitted warnings if any subexpression before
1487 such a sequence point could be undefined. On a higher level, however, the
1488 sequence point may not be relevant, and we'll merge the two lists.
1490 Example: (b++, a) + b;
1491 The call that processes the COMPOUND_EXPR will store the increment of B
1492 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1493 processes the PLUS_EXPR will need to merge the two lists so that
1494 eventually, all accesses end up on the same list (and we'll warn about the
1495 unordered subexpressions b++ and b.
1497 A note on merging. If we modify the former example so that our expression
1500 care must be taken not simply to add all three expressions into the final
1501 PNO_SP list. The function merge_tlist takes care of that by merging the
1502 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1503 way, so that no more than one access to B is recorded. */
1506 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1509 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1510 enum tree_code code;
1513 /* X may be NULL if it is the operand of an empty statement expression
1519 code = TREE_CODE (x);
1520 class = TREE_CODE_CLASS (code);
1522 if (warning_candidate_p (x))
1524 *pno_sp = new_tlist (*pno_sp, x, writer);
1534 case TRUTH_ANDIF_EXPR:
1535 case TRUTH_ORIF_EXPR:
1536 tmp_before = tmp_nosp = tmp_list3 = 0;
1537 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1538 warn_for_collisions (tmp_nosp);
1539 merge_tlist (pbefore_sp, tmp_before, 0);
1540 merge_tlist (pbefore_sp, tmp_nosp, 0);
1541 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1542 merge_tlist (pbefore_sp, tmp_list3, 0);
1546 tmp_before = tmp_list2 = 0;
1547 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1548 warn_for_collisions (tmp_list2);
1549 merge_tlist (pbefore_sp, tmp_before, 0);
1550 merge_tlist (pbefore_sp, tmp_list2, 1);
1552 tmp_list3 = tmp_nosp = 0;
1553 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1554 warn_for_collisions (tmp_nosp);
1555 merge_tlist (pbefore_sp, tmp_list3, 0);
1557 tmp_list3 = tmp_list2 = 0;
1558 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1559 warn_for_collisions (tmp_list2);
1560 merge_tlist (pbefore_sp, tmp_list3, 0);
1561 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1562 two first, to avoid warning for (a ? b++ : b++). */
1563 merge_tlist (&tmp_nosp, tmp_list2, 0);
1564 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1567 case PREDECREMENT_EXPR:
1568 case PREINCREMENT_EXPR:
1569 case POSTDECREMENT_EXPR:
1570 case POSTINCREMENT_EXPR:
1571 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1575 tmp_before = tmp_nosp = tmp_list3 = 0;
1576 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1577 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1578 /* Expressions inside the LHS are not ordered wrt. the sequence points
1579 in the RHS. Example:
1581 Despite the fact that the modification of "a" is in the before_sp
1582 list (tmp_before), it conflicts with the use of "a" in the LHS.
1583 We can handle this by adding the contents of tmp_list3
1584 to those of tmp_before, and redoing the collision warnings for that
1586 add_tlist (&tmp_before, tmp_list3, x, 1);
1587 warn_for_collisions (tmp_before);
1588 /* Exclude the LHS itself here; we first have to merge it into the
1589 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1590 didn't exclude the LHS, we'd get it twice, once as a read and once
1592 add_tlist (pno_sp, tmp_list3, x, 0);
1593 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1595 merge_tlist (pbefore_sp, tmp_before, 0);
1596 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1597 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1598 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1602 /* We need to warn about conflicts among arguments and conflicts between
1603 args and the function address. Side effects of the function address,
1604 however, are not ordered by the sequence point of the call. */
1605 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1606 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1607 if (TREE_OPERAND (x, 1))
1608 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1609 merge_tlist (&tmp_list3, tmp_list2, 0);
1610 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1611 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1612 warn_for_collisions (tmp_before);
1613 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1617 /* Scan all the list, e.g. indices of multi dimensional array. */
1620 tmp_before = tmp_nosp = 0;
1621 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1622 merge_tlist (&tmp_nosp, tmp_before, 0);
1623 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1630 struct tlist_cache *t;
1631 for (t = save_expr_cache; t; t = t->next)
1637 t = obstack_alloc (&tlist_obstack, sizeof *t);
1638 t->next = save_expr_cache;
1640 save_expr_cache = t;
1642 tmp_before = tmp_nosp = 0;
1643 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1644 warn_for_collisions (tmp_nosp);
1649 struct tlist *t = tmp_nosp;
1651 merge_tlist (&tmp_list3, t, 0);
1653 t->cache_before_sp = tmp_before;
1654 t->cache_after_sp = tmp_list3;
1656 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1657 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1666 if (first_rtl_op (code) == 0)
1668 x = TREE_OPERAND (x, 0);
1684 int max = first_rtl_op (TREE_CODE (x));
1685 for (lp = 0; lp < max; lp++)
1687 tmp_before = tmp_nosp = 0;
1688 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1689 merge_tlist (&tmp_nosp, tmp_before, 0);
1690 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1697 /* Try to warn for undefined behavior in EXPR due to missing sequence
1701 verify_sequence_points (tree expr)
1703 struct tlist *before_sp = 0, *after_sp = 0;
1706 save_expr_cache = 0;
1707 if (tlist_firstobj == 0)
1709 gcc_obstack_init (&tlist_obstack);
1710 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1713 verify_tree (expr, &before_sp, &after_sp, 0);
1714 warn_for_collisions (after_sp);
1715 obstack_free (&tlist_obstack, tlist_firstobj);
1719 c_expand_expr_stmt (tree expr)
1721 /* Do default conversion if safe and possibly important,
1722 in case within ({...}). */
1723 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1724 && (flag_isoc99 || lvalue_p (expr)))
1725 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1726 expr = default_conversion (expr);
1728 if (warn_sequence_point)
1729 verify_sequence_points (expr);
1731 if (TREE_TYPE (expr) != error_mark_node
1732 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1733 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1734 error ("expression statement has incomplete type");
1736 last_expr_type = TREE_TYPE (expr);
1737 return add_stmt (build_stmt (EXPR_STMT, expr));
1740 /* Validate the expression after `case' and apply default promotions. */
1743 check_case_value (tree value)
1745 if (value == NULL_TREE)
1748 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1749 STRIP_TYPE_NOPS (value);
1750 /* In C++, the following is allowed:
1753 switch (...) { case i: ... }
1755 So, we try to reduce the VALUE to a constant that way. */
1756 if (c_dialect_cxx ())
1758 value = decl_constant_value (value);
1759 STRIP_TYPE_NOPS (value);
1760 value = fold (value);
1763 if (TREE_CODE (value) != INTEGER_CST
1764 && value != error_mark_node)
1766 error ("case label does not reduce to an integer constant");
1767 value = error_mark_node;
1770 /* Promote char or short to int. */
1771 value = default_conversion (value);
1773 constant_expression_warning (value);
1778 /* Return an integer type with BITS bits of precision,
1779 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1782 c_common_type_for_size (unsigned int bits, int unsignedp)
1784 if (bits == TYPE_PRECISION (integer_type_node))
1785 return unsignedp ? unsigned_type_node : integer_type_node;
1787 if (bits == TYPE_PRECISION (signed_char_type_node))
1788 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1790 if (bits == TYPE_PRECISION (short_integer_type_node))
1791 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1793 if (bits == TYPE_PRECISION (long_integer_type_node))
1794 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1796 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1797 return (unsignedp ? long_long_unsigned_type_node
1798 : long_long_integer_type_node);
1800 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1801 return (unsignedp ? widest_unsigned_literal_type_node
1802 : widest_integer_literal_type_node);
1804 if (bits <= TYPE_PRECISION (intQI_type_node))
1805 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1807 if (bits <= TYPE_PRECISION (intHI_type_node))
1808 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1810 if (bits <= TYPE_PRECISION (intSI_type_node))
1811 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1813 if (bits <= TYPE_PRECISION (intDI_type_node))
1814 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1819 /* Used for communication between c_common_type_for_mode and
1820 c_register_builtin_type. */
1821 static GTY(()) tree registered_builtin_types;
1823 /* Return a data type that has machine mode MODE.
1824 If the mode is an integer,
1825 then UNSIGNEDP selects between signed and unsigned types. */
1828 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1832 if (mode == TYPE_MODE (integer_type_node))
1833 return unsignedp ? unsigned_type_node : integer_type_node;
1835 if (mode == TYPE_MODE (signed_char_type_node))
1836 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1838 if (mode == TYPE_MODE (short_integer_type_node))
1839 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1841 if (mode == TYPE_MODE (long_integer_type_node))
1842 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1844 if (mode == TYPE_MODE (long_long_integer_type_node))
1845 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1847 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1848 return unsignedp ? widest_unsigned_literal_type_node
1849 : widest_integer_literal_type_node;
1852 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1855 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1858 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1861 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1863 #if HOST_BITS_PER_WIDE_INT >= 64
1864 if (mode == TYPE_MODE (intTI_type_node))
1865 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1868 if (mode == TYPE_MODE (float_type_node))
1869 return float_type_node;
1871 if (mode == TYPE_MODE (double_type_node))
1872 return double_type_node;
1874 if (mode == TYPE_MODE (long_double_type_node))
1875 return long_double_type_node;
1877 if (mode == TYPE_MODE (void_type_node))
1878 return void_type_node;
1880 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1881 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1883 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1884 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1889 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1891 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1893 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
1895 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
1897 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
1899 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
1901 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
1903 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
1905 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
1907 return V16SF_type_node;
1909 return V4SF_type_node;
1911 return V2SF_type_node;
1913 return V2DF_type_node;
1915 return V4DF_type_node;
1920 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1921 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1922 return TREE_VALUE (t);
1927 /* Return an unsigned type the same as TYPE in other respects. */
1929 c_common_unsigned_type (tree type)
1931 tree type1 = TYPE_MAIN_VARIANT (type);
1932 if (type1 == signed_char_type_node || type1 == char_type_node)
1933 return unsigned_char_type_node;
1934 if (type1 == integer_type_node)
1935 return unsigned_type_node;
1936 if (type1 == short_integer_type_node)
1937 return short_unsigned_type_node;
1938 if (type1 == long_integer_type_node)
1939 return long_unsigned_type_node;
1940 if (type1 == long_long_integer_type_node)
1941 return long_long_unsigned_type_node;
1942 if (type1 == widest_integer_literal_type_node)
1943 return widest_unsigned_literal_type_node;
1944 #if HOST_BITS_PER_WIDE_INT >= 64
1945 if (type1 == intTI_type_node)
1946 return unsigned_intTI_type_node;
1948 if (type1 == intDI_type_node)
1949 return unsigned_intDI_type_node;
1950 if (type1 == intSI_type_node)
1951 return unsigned_intSI_type_node;
1952 if (type1 == intHI_type_node)
1953 return unsigned_intHI_type_node;
1954 if (type1 == intQI_type_node)
1955 return unsigned_intQI_type_node;
1957 return c_common_signed_or_unsigned_type (1, type);
1960 /* Return a signed type the same as TYPE in other respects. */
1963 c_common_signed_type (tree type)
1965 tree type1 = TYPE_MAIN_VARIANT (type);
1966 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1967 return signed_char_type_node;
1968 if (type1 == unsigned_type_node)
1969 return integer_type_node;
1970 if (type1 == short_unsigned_type_node)
1971 return short_integer_type_node;
1972 if (type1 == long_unsigned_type_node)
1973 return long_integer_type_node;
1974 if (type1 == long_long_unsigned_type_node)
1975 return long_long_integer_type_node;
1976 if (type1 == widest_unsigned_literal_type_node)
1977 return widest_integer_literal_type_node;
1978 #if HOST_BITS_PER_WIDE_INT >= 64
1979 if (type1 == unsigned_intTI_type_node)
1980 return intTI_type_node;
1982 if (type1 == unsigned_intDI_type_node)
1983 return intDI_type_node;
1984 if (type1 == unsigned_intSI_type_node)
1985 return intSI_type_node;
1986 if (type1 == unsigned_intHI_type_node)
1987 return intHI_type_node;
1988 if (type1 == unsigned_intQI_type_node)
1989 return intQI_type_node;
1991 return c_common_signed_or_unsigned_type (0, type);
1994 /* Return a type the same as TYPE except unsigned or
1995 signed according to UNSIGNEDP. */
1998 c_common_signed_or_unsigned_type (int unsignedp, tree type)
2000 if (! INTEGRAL_TYPE_P (type)
2001 || TREE_UNSIGNED (type) == unsignedp)
2004 /* Must check the mode of the types, not the precision. Enumeral types
2005 in C++ have precision set to match their range, but may use a wider
2006 mode to match an ABI. If we change modes, we may wind up with bad
2009 if (TYPE_MODE (type) == TYPE_MODE (signed_char_type_node))
2010 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2011 if (TYPE_MODE (type) == TYPE_MODE (integer_type_node))
2012 return unsignedp ? unsigned_type_node : integer_type_node;
2013 if (TYPE_MODE (type) == TYPE_MODE (short_integer_type_node))
2014 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2015 if (TYPE_MODE (type) == TYPE_MODE (long_integer_type_node))
2016 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2017 if (TYPE_MODE (type) == TYPE_MODE (long_long_integer_type_node))
2018 return (unsignedp ? long_long_unsigned_type_node
2019 : long_long_integer_type_node);
2020 if (TYPE_MODE (type) == TYPE_MODE (widest_integer_literal_type_node))
2021 return (unsignedp ? widest_unsigned_literal_type_node
2022 : widest_integer_literal_type_node);
2024 #if HOST_BITS_PER_WIDE_INT >= 64
2025 if (TYPE_MODE (type) == TYPE_MODE (intTI_type_node))
2026 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2028 if (TYPE_MODE (type) == TYPE_MODE (intDI_type_node))
2029 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2030 if (TYPE_MODE (type) == TYPE_MODE (intSI_type_node))
2031 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2032 if (TYPE_MODE (type) == TYPE_MODE (intHI_type_node))
2033 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2034 if (TYPE_MODE (type) == TYPE_MODE (intQI_type_node))
2035 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2040 /* The C version of the register_builtin_type langhook. */
2043 c_register_builtin_type (tree type, const char* name)
2047 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2048 DECL_ARTIFICIAL (decl) = 1;
2049 if (!TYPE_NAME (type))
2050 TYPE_NAME (type) = decl;
2053 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
2057 /* Return the minimum number of bits needed to represent VALUE in a
2058 signed or unsigned type, UNSIGNEDP says which. */
2061 min_precision (tree value, int unsignedp)
2065 /* If the value is negative, compute its negative minus 1. The latter
2066 adjustment is because the absolute value of the largest negative value
2067 is one larger than the largest positive value. This is equivalent to
2068 a bit-wise negation, so use that operation instead. */
2070 if (tree_int_cst_sgn (value) < 0)
2071 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2073 /* Return the number of bits needed, taking into account the fact
2074 that we need one more bit for a signed than unsigned type. */
2076 if (integer_zerop (value))
2079 log = tree_floor_log2 (value);
2081 return log + 1 + ! unsignedp;
2084 /* Print an error message for invalid operands to arith operation
2085 CODE. NOP_EXPR is used as a special case (see
2086 c_common_truthvalue_conversion). */
2089 binary_op_error (enum tree_code code)
2096 error ("invalid truth-value expression");
2100 opname = "+"; break;
2102 opname = "-"; break;
2104 opname = "*"; break;
2106 opname = "max"; break;
2108 opname = "min"; break;
2110 opname = "=="; break;
2112 opname = "!="; break;
2114 opname = "<="; break;
2116 opname = ">="; break;
2118 opname = "<"; break;
2120 opname = ">"; break;
2122 opname = "<<"; break;
2124 opname = ">>"; break;
2125 case TRUNC_MOD_EXPR:
2126 case FLOOR_MOD_EXPR:
2127 opname = "%"; break;
2128 case TRUNC_DIV_EXPR:
2129 case FLOOR_DIV_EXPR:
2130 opname = "/"; break;
2132 opname = "&"; break;
2134 opname = "|"; break;
2135 case TRUTH_ANDIF_EXPR:
2136 opname = "&&"; break;
2137 case TRUTH_ORIF_EXPR:
2138 opname = "||"; break;
2140 opname = "^"; break;
2143 opname = "rotate"; break;
2145 opname = "unknown"; break;
2147 error ("invalid operands to binary %s", opname);
2150 /* Subroutine of build_binary_op, used for comparison operations.
2151 See if the operands have both been converted from subword integer types
2152 and, if so, perhaps change them both back to their original type.
2153 This function is also responsible for converting the two operands
2154 to the proper common type for comparison.
2156 The arguments of this function are all pointers to local variables
2157 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2158 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2160 If this function returns nonzero, it means that the comparison has
2161 a constant value. What this function returns is an expression for
2165 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2166 enum tree_code *rescode_ptr)
2169 tree op0 = *op0_ptr;
2170 tree op1 = *op1_ptr;
2171 int unsignedp0, unsignedp1;
2173 tree primop0, primop1;
2174 enum tree_code code = *rescode_ptr;
2176 /* Throw away any conversions to wider types
2177 already present in the operands. */
2179 primop0 = get_narrower (op0, &unsignedp0);
2180 primop1 = get_narrower (op1, &unsignedp1);
2182 /* Handle the case that OP0 does not *contain* a conversion
2183 but it *requires* conversion to FINAL_TYPE. */
2185 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2186 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2187 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2188 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2190 /* If one of the operands must be floated, we cannot optimize. */
2191 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2192 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2194 /* If first arg is constant, swap the args (changing operation
2195 so value is preserved), for canonicalization. Don't do this if
2196 the second arg is 0. */
2198 if (TREE_CONSTANT (primop0)
2199 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2202 int temi = unsignedp0;
2210 unsignedp0 = unsignedp1;
2233 *rescode_ptr = code;
2236 /* If comparing an integer against a constant more bits wide,
2237 maybe we can deduce a value of 1 or 0 independent of the data.
2238 Or else truncate the constant now
2239 rather than extend the variable at run time.
2241 This is only interesting if the constant is the wider arg.
2242 Also, it is not safe if the constant is unsigned and the
2243 variable arg is signed, since in this case the variable
2244 would be sign-extended and then regarded as unsigned.
2245 Our technique fails in this case because the lowest/highest
2246 possible unsigned results don't follow naturally from the
2247 lowest/highest possible values of the variable operand.
2248 For just EQ_EXPR and NE_EXPR there is another technique that
2249 could be used: see if the constant can be faithfully represented
2250 in the other operand's type, by truncating it and reextending it
2251 and see if that preserves the constant's value. */
2253 if (!real1 && !real2
2254 && TREE_CODE (primop1) == INTEGER_CST
2255 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2257 int min_gt, max_gt, min_lt, max_lt;
2258 tree maxval, minval;
2259 /* 1 if comparison is nominally unsigned. */
2260 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2263 type = c_common_signed_or_unsigned_type (unsignedp0,
2264 TREE_TYPE (primop0));
2266 /* In C, if TYPE is an enumeration, then we need to get its
2267 min/max values from it's underlying integral type, not the
2268 enumerated type itself. In C++, TYPE_MAX_VALUE and
2269 TYPE_MIN_VALUE have already been set correctly on the
2270 enumeration type. */
2271 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
2272 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2274 maxval = TYPE_MAX_VALUE (type);
2275 minval = TYPE_MIN_VALUE (type);
2277 if (unsignedp && !unsignedp0)
2278 *restype_ptr = c_common_signed_type (*restype_ptr);
2280 if (TREE_TYPE (primop1) != *restype_ptr)
2281 primop1 = convert (*restype_ptr, primop1);
2282 if (type != *restype_ptr)
2284 minval = convert (*restype_ptr, minval);
2285 maxval = convert (*restype_ptr, maxval);
2288 if (unsignedp && unsignedp0)
2290 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2291 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2292 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2293 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2297 min_gt = INT_CST_LT (primop1, minval);
2298 max_gt = INT_CST_LT (primop1, maxval);
2299 min_lt = INT_CST_LT (minval, primop1);
2300 max_lt = INT_CST_LT (maxval, primop1);
2304 /* This used to be a switch, but Genix compiler can't handle that. */
2305 if (code == NE_EXPR)
2307 if (max_lt || min_gt)
2308 val = truthvalue_true_node;
2310 else if (code == EQ_EXPR)
2312 if (max_lt || min_gt)
2313 val = truthvalue_false_node;
2315 else if (code == LT_EXPR)
2318 val = truthvalue_true_node;
2320 val = truthvalue_false_node;
2322 else if (code == GT_EXPR)
2325 val = truthvalue_true_node;
2327 val = truthvalue_false_node;
2329 else if (code == LE_EXPR)
2332 val = truthvalue_true_node;
2334 val = truthvalue_false_node;
2336 else if (code == GE_EXPR)
2339 val = truthvalue_true_node;
2341 val = truthvalue_false_node;
2344 /* If primop0 was sign-extended and unsigned comparison specd,
2345 we did a signed comparison above using the signed type bounds.
2346 But the comparison we output must be unsigned.
2348 Also, for inequalities, VAL is no good; but if the signed
2349 comparison had *any* fixed result, it follows that the
2350 unsigned comparison just tests the sign in reverse
2351 (positive values are LE, negative ones GE).
2352 So we can generate an unsigned comparison
2353 against an extreme value of the signed type. */
2355 if (unsignedp && !unsignedp0)
2362 primop1 = TYPE_MIN_VALUE (type);
2368 primop1 = TYPE_MAX_VALUE (type);
2375 type = c_common_unsigned_type (type);
2378 if (TREE_CODE (primop0) != INTEGER_CST)
2380 if (val == truthvalue_false_node)
2381 warning ("comparison is always false due to limited range of data type");
2382 if (val == truthvalue_true_node)
2383 warning ("comparison is always true due to limited range of data type");
2388 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2389 if (TREE_SIDE_EFFECTS (primop0))
2390 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2394 /* Value is not predetermined, but do the comparison
2395 in the type of the operand that is not constant.
2396 TYPE is already properly set. */
2398 else if (real1 && real2
2399 && (TYPE_PRECISION (TREE_TYPE (primop0))
2400 == TYPE_PRECISION (TREE_TYPE (primop1))))
2401 type = TREE_TYPE (primop0);
2403 /* If args' natural types are both narrower than nominal type
2404 and both extend in the same manner, compare them
2405 in the type of the wider arg.
2406 Otherwise must actually extend both to the nominal
2407 common type lest different ways of extending
2409 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2411 else if (unsignedp0 == unsignedp1 && real1 == real2
2412 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2413 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2415 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2416 type = c_common_signed_or_unsigned_type (unsignedp0
2417 || TREE_UNSIGNED (*restype_ptr),
2419 /* Make sure shorter operand is extended the right way
2420 to match the longer operand. */
2422 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2423 TREE_TYPE (primop0)),
2426 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2427 TREE_TYPE (primop1)),
2432 /* Here we must do the comparison on the nominal type
2433 using the args exactly as we received them. */
2434 type = *restype_ptr;
2438 if (!real1 && !real2 && integer_zerop (primop1)
2439 && TREE_UNSIGNED (*restype_ptr))
2445 /* All unsigned values are >= 0, so we warn if extra warnings
2446 are requested. However, if OP0 is a constant that is
2447 >= 0, the signedness of the comparison isn't an issue,
2448 so suppress the warning. */
2449 if (extra_warnings && !in_system_header
2450 && ! (TREE_CODE (primop0) == INTEGER_CST
2451 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2453 warning ("comparison of unsigned expression >= 0 is always true");
2454 value = truthvalue_true_node;
2458 if (extra_warnings && !in_system_header
2459 && ! (TREE_CODE (primop0) == INTEGER_CST
2460 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2462 warning ("comparison of unsigned expression < 0 is always false");
2463 value = truthvalue_false_node;
2472 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2473 if (TREE_SIDE_EFFECTS (primop0))
2474 return build (COMPOUND_EXPR, TREE_TYPE (value),
2481 *op0_ptr = convert (type, primop0);
2482 *op1_ptr = convert (type, primop1);
2484 *restype_ptr = truthvalue_type_node;
2489 /* Return a tree for the sum or difference (RESULTCODE says which)
2490 of pointer PTROP and integer INTOP. */
2493 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2500 /* The result is a pointer of the same type that is being added. */
2502 tree result_type = TREE_TYPE (ptrop);
2504 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2506 if (pedantic || warn_pointer_arith)
2507 pedwarn ("pointer of type `void *' used in arithmetic");
2508 size_exp = integer_one_node;
2510 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2512 if (pedantic || warn_pointer_arith)
2513 pedwarn ("pointer to a function used in arithmetic");
2514 size_exp = integer_one_node;
2516 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2518 if (pedantic || warn_pointer_arith)
2519 pedwarn ("pointer to member function used in arithmetic");
2520 size_exp = integer_one_node;
2523 size_exp = size_in_bytes (TREE_TYPE (result_type));
2525 /* If what we are about to multiply by the size of the elements
2526 contains a constant term, apply distributive law
2527 and multiply that constant term separately.
2528 This helps produce common subexpressions. */
2530 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2531 && ! TREE_CONSTANT (intop)
2532 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2533 && TREE_CONSTANT (size_exp)
2534 /* If the constant comes from pointer subtraction,
2535 skip this optimization--it would cause an error. */
2536 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2537 /* If the constant is unsigned, and smaller than the pointer size,
2538 then we must skip this optimization. This is because it could cause
2539 an overflow error if the constant is negative but INTOP is not. */
2540 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2541 || (TYPE_PRECISION (TREE_TYPE (intop))
2542 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2544 enum tree_code subcode = resultcode;
2545 tree int_type = TREE_TYPE (intop);
2546 if (TREE_CODE (intop) == MINUS_EXPR)
2547 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2548 /* Convert both subexpression types to the type of intop,
2549 because weird cases involving pointer arithmetic
2550 can result in a sum or difference with different type args. */
2551 ptrop = build_binary_op (subcode, ptrop,
2552 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2553 intop = convert (int_type, TREE_OPERAND (intop, 0));
2556 /* Convert the integer argument to a type the same size as sizetype
2557 so the multiply won't overflow spuriously. */
2559 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2560 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2561 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2562 TREE_UNSIGNED (sizetype)), intop);
2564 /* Replace the integer argument with a suitable product by the object size.
2565 Do this multiplication as signed, then convert to the appropriate
2566 pointer type (actually unsigned integral). */
2568 intop = convert (result_type,
2569 build_binary_op (MULT_EXPR, intop,
2570 convert (TREE_TYPE (intop), size_exp), 1));
2572 /* Create the sum or difference. */
2574 result = build (resultcode, result_type, ptrop, intop);
2576 folded = fold (result);
2577 if (folded == result)
2578 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2582 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2583 or validate its data type for an `if' or `while' statement or ?..: exp.
2585 This preparation consists of taking the ordinary
2586 representation of an expression expr and producing a valid tree
2587 boolean expression describing whether expr is nonzero. We could
2588 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2589 but we optimize comparisons, &&, ||, and !.
2591 The resulting type should always be `truthvalue_type_node'. */
2594 c_common_truthvalue_conversion (tree expr)
2596 if (TREE_CODE (expr) == ERROR_MARK)
2599 if (TREE_CODE (expr) == FUNCTION_DECL)
2600 expr = build_unary_op (ADDR_EXPR, expr, 0);
2602 #if 0 /* This appears to be wrong for C++. */
2603 /* These really should return error_mark_node after 2.4 is stable.
2604 But not all callers handle ERROR_MARK properly. */
2605 switch (TREE_CODE (TREE_TYPE (expr)))
2608 error ("struct type value used where scalar is required");
2609 return truthvalue_false_node;
2612 error ("union type value used where scalar is required");
2613 return truthvalue_false_node;
2616 error ("array type value used where scalar is required");
2617 return truthvalue_false_node;
2624 switch (TREE_CODE (expr))
2627 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2628 case TRUTH_ANDIF_EXPR:
2629 case TRUTH_ORIF_EXPR:
2630 case TRUTH_AND_EXPR:
2632 case TRUTH_XOR_EXPR:
2633 case TRUTH_NOT_EXPR:
2634 TREE_TYPE (expr) = truthvalue_type_node;
2641 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2644 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2648 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2649 && ! DECL_WEAK (TREE_OPERAND (expr, 0)))
2651 /* Common Ada/Pascal programmer's mistake. We always warn
2652 about this since it is so bad. */
2653 warning ("the address of `%D', will always evaluate as `true'",
2654 TREE_OPERAND (expr, 0));
2655 return truthvalue_true_node;
2658 /* If we are taking the address of an external decl, it might be
2659 zero if it is weak, so we cannot optimize. */
2660 if (DECL_P (TREE_OPERAND (expr, 0))
2661 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2664 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2665 return build (COMPOUND_EXPR, truthvalue_type_node,
2666 TREE_OPERAND (expr, 0), truthvalue_true_node);
2668 return truthvalue_true_node;
2672 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2673 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2674 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2675 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2681 /* These don't change whether an object is nonzero or zero. */
2682 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2686 /* These don't change whether an object is zero or nonzero, but
2687 we can't ignore them if their second arg has side-effects. */
2688 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2689 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2690 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2692 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2695 /* Distribute the conversion into the arms of a COND_EXPR. */
2696 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2697 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2698 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2701 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2702 since that affects how `default_conversion' will behave. */
2703 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2704 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2706 /* Fall through.... */
2708 /* If this is widening the argument, we can ignore it. */
2709 if (TYPE_PRECISION (TREE_TYPE (expr))
2710 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2711 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2715 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2716 aren't guaranteed to the be same for modes that can represent
2717 infinity, since if x and y are both +infinity, or both
2718 -infinity, then x - y is not a number.
2720 Note that this transformation is safe when x or y is NaN.
2721 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2723 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2725 /* Fall through.... */
2727 /* This and MINUS_EXPR can be changed into a comparison of the
2729 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2730 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2731 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2732 TREE_OPERAND (expr, 1), 1);
2733 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2734 fold (build1 (NOP_EXPR,
2735 TREE_TYPE (TREE_OPERAND (expr, 0)),
2736 TREE_OPERAND (expr, 1))), 1);
2739 if (integer_onep (TREE_OPERAND (expr, 1))
2740 && TREE_TYPE (expr) != truthvalue_type_node)
2741 /* Using convert here would cause infinite recursion. */
2742 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2746 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2747 warning ("suggest parentheses around assignment used as truth value");
2754 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2756 tree t = save_expr (expr);
2757 return (build_binary_op
2758 ((TREE_SIDE_EFFECTS (expr)
2759 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2760 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2761 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2765 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2768 static tree builtin_function_2 (const char *, const char *, tree, tree,
2769 int, enum built_in_class, int, int,
2772 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2773 down to the element type of an array. */
2776 c_build_qualified_type (tree type, int type_quals)
2778 if (type == error_mark_node)
2781 if (TREE_CODE (type) == ARRAY_TYPE)
2782 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2784 TYPE_DOMAIN (type));
2786 /* A restrict-qualified pointer type must be a pointer to object or
2787 incomplete type. Note that the use of POINTER_TYPE_P also allows
2788 REFERENCE_TYPEs, which is appropriate for C++. */
2789 if ((type_quals & TYPE_QUAL_RESTRICT)
2790 && (!POINTER_TYPE_P (type)
2791 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2793 error ("invalid use of `restrict'");
2794 type_quals &= ~TYPE_QUAL_RESTRICT;
2797 return build_qualified_type (type, type_quals);
2800 /* Apply the TYPE_QUALS to the new DECL. */
2803 c_apply_type_quals_to_decl (int type_quals, tree decl)
2805 tree type = TREE_TYPE (decl);
2807 if (type == error_mark_node)
2810 if (((type_quals & TYPE_QUAL_CONST)
2811 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2812 /* An object declared 'const' is only readonly after it is
2813 initialized. We don't have any way of expressing this currently,
2814 so we need to be conservative and unset TREE_READONLY for types
2815 with constructors. Otherwise aliasing code will ignore stores in
2816 an inline constructor. */
2817 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2818 TREE_READONLY (decl) = 1;
2819 if (type_quals & TYPE_QUAL_VOLATILE)
2821 TREE_SIDE_EFFECTS (decl) = 1;
2822 TREE_THIS_VOLATILE (decl) = 1;
2824 if (type_quals & TYPE_QUAL_RESTRICT)
2826 while (type && TREE_CODE (type) == ARRAY_TYPE)
2827 /* Allow 'restrict' on arrays of pointers.
2828 FIXME currently we just ignore it. */
2829 type = TREE_TYPE (type);
2831 || !POINTER_TYPE_P (type)
2832 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2833 error ("invalid use of `restrict'");
2834 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2835 /* Indicate we need to make a unique alias set for this pointer.
2836 We can't do it here because it might be pointing to an
2838 DECL_POINTER_ALIAS_SET (decl) = -2;
2842 /* Return the typed-based alias set for T, which may be an expression
2843 or a type. Return -1 if we don't do anything special. */
2846 c_common_get_alias_set (tree t)
2850 /* Permit type-punning when accessing a union, provided the access
2851 is directly through the union. For example, this code does not
2852 permit taking the address of a union member and then storing
2853 through it. Even the type-punning allowed here is a GCC
2854 extension, albeit a common and useful one; the C standard says
2855 that such accesses have implementation-defined behavior. */
2857 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2858 u = TREE_OPERAND (u, 0))
2859 if (TREE_CODE (u) == COMPONENT_REF
2860 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2863 /* That's all the expressions we handle specially. */
2867 /* The C standard guarantees that any object may be accessed via an
2868 lvalue that has character type. */
2869 if (t == char_type_node
2870 || t == signed_char_type_node
2871 || t == unsigned_char_type_node)
2874 /* If it has the may_alias attribute, it can alias anything. */
2875 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2878 /* The C standard specifically allows aliasing between signed and
2879 unsigned variants of the same type. We treat the signed
2880 variant as canonical. */
2881 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2883 tree t1 = c_common_signed_type (t);
2885 /* t1 == t can happen for boolean nodes which are always unsigned. */
2887 return get_alias_set (t1);
2889 else if (POINTER_TYPE_P (t))
2893 /* Unfortunately, there is no canonical form of a pointer type.
2894 In particular, if we have `typedef int I', then `int *', and
2895 `I *' are different types. So, we have to pick a canonical
2896 representative. We do this below.
2898 Technically, this approach is actually more conservative that
2899 it needs to be. In particular, `const int *' and `int *'
2900 should be in different alias sets, according to the C and C++
2901 standard, since their types are not the same, and so,
2902 technically, an `int **' and `const int **' cannot point at
2905 But, the standard is wrong. In particular, this code is
2910 const int* const* cipp = &ipp;
2912 And, it doesn't make sense for that to be legal unless you
2913 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2914 the pointed-to types. This issue has been reported to the
2916 t1 = build_type_no_quals (t);
2918 return get_alias_set (t1);
2924 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2925 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2926 flag controls whether we should diagnose possibly ill-formed
2927 constructs or not. */
2929 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2931 const char *op_name;
2933 enum tree_code type_code = TREE_CODE (type);
2935 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2936 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2938 if (type_code == FUNCTION_TYPE)
2940 if (op == SIZEOF_EXPR)
2942 if (complain && (pedantic || warn_pointer_arith))
2943 pedwarn ("invalid application of `sizeof' to a function type");
2944 value = size_one_node;
2947 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2949 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2951 if (type_code == VOID_TYPE
2952 && complain && (pedantic || warn_pointer_arith))
2953 pedwarn ("invalid application of `%s' to a void type", op_name);
2954 value = size_one_node;
2956 else if (!COMPLETE_TYPE_P (type))
2959 error ("invalid application of `%s' to incomplete type `%T' ",
2961 value = size_zero_node;
2965 if (op == SIZEOF_EXPR)
2966 /* Convert in case a char is more than one unit. */
2967 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2968 size_int (TYPE_PRECISION (char_type_node)
2971 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2974 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2975 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2976 never happen. However, this node should really have type
2977 `size_t', which is just a typedef for an ordinary integer type. */
2978 value = fold (build1 (NOP_EXPR, size_type_node, value));
2979 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2984 /* Implement the __alignof keyword: Return the minimum required
2985 alignment of EXPR, measured in bytes. For VAR_DECL's and
2986 FIELD_DECL's return DECL_ALIGN (which can be set from an
2987 "aligned" __attribute__ specification). */
2990 c_alignof_expr (tree expr)
2994 if (TREE_CODE (expr) == VAR_DECL)
2995 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2997 else if (TREE_CODE (expr) == COMPONENT_REF
2998 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
3000 error ("`__alignof' applied to a bit-field");
3003 else if (TREE_CODE (expr) == COMPONENT_REF
3004 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
3005 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
3007 else if (TREE_CODE (expr) == INDIRECT_REF)
3009 tree t = TREE_OPERAND (expr, 0);
3011 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3013 while (TREE_CODE (t) == NOP_EXPR
3014 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3018 t = TREE_OPERAND (t, 0);
3019 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3020 if (thisalign > bestalign)
3021 best = t, bestalign = thisalign;
3023 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3026 return c_alignof (TREE_TYPE (expr));
3028 return fold (build1 (NOP_EXPR, size_type_node, t));
3031 /* Handle C and C++ default attributes. */
3033 enum built_in_attribute
3035 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3036 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3037 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3038 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3039 #include "builtin-attrs.def"
3040 #undef DEF_ATTR_NULL_TREE
3042 #undef DEF_ATTR_IDENT
3043 #undef DEF_ATTR_TREE_LIST
3047 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3049 static void c_init_attributes (void);
3051 /* Build tree nodes and builtin functions common to both C and C++ language
3055 c_common_nodes_and_builtins (void)
3059 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3060 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3061 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3062 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3063 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3064 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3065 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3066 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3067 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3068 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3069 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3070 #include "builtin-types.def"
3071 #undef DEF_PRIMITIVE_TYPE
3072 #undef DEF_FUNCTION_TYPE_0
3073 #undef DEF_FUNCTION_TYPE_1
3074 #undef DEF_FUNCTION_TYPE_2
3075 #undef DEF_FUNCTION_TYPE_3
3076 #undef DEF_FUNCTION_TYPE_4
3077 #undef DEF_FUNCTION_TYPE_VAR_0
3078 #undef DEF_FUNCTION_TYPE_VAR_1
3079 #undef DEF_FUNCTION_TYPE_VAR_2
3080 #undef DEF_FUNCTION_TYPE_VAR_3
3081 #undef DEF_POINTER_TYPE
3085 typedef enum builtin_type builtin_type;
3087 tree builtin_types[(int) BT_LAST];
3088 int wchar_type_size;
3089 tree array_domain_type;
3090 tree va_list_ref_type_node;
3091 tree va_list_arg_type_node;
3093 /* Define `int' and `char' first so that dbx will output them first. */
3094 record_builtin_type (RID_INT, NULL, integer_type_node);
3095 record_builtin_type (RID_CHAR, "char", char_type_node);
3097 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3098 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3099 but not C. Are the conditionals here needed? */
3100 if (c_dialect_cxx ())
3101 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3102 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3103 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3104 record_builtin_type (RID_MAX, "long unsigned int",
3105 long_unsigned_type_node);
3106 if (c_dialect_cxx ())
3107 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3108 record_builtin_type (RID_MAX, "long long int",
3109 long_long_integer_type_node);
3110 record_builtin_type (RID_MAX, "long long unsigned int",
3111 long_long_unsigned_type_node);
3112 if (c_dialect_cxx ())
3113 record_builtin_type (RID_MAX, "long long unsigned",
3114 long_long_unsigned_type_node);
3115 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3116 record_builtin_type (RID_MAX, "short unsigned int",
3117 short_unsigned_type_node);
3118 if (c_dialect_cxx ())
3119 record_builtin_type (RID_MAX, "unsigned short",
3120 short_unsigned_type_node);
3122 /* Define both `signed char' and `unsigned char'. */
3123 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3124 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3126 /* These are types that c_common_type_for_size and
3127 c_common_type_for_mode use. */
3128 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3130 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3132 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3134 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3136 #if HOST_BITS_PER_WIDE_INT >= 64
3137 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3138 get_identifier ("__int128_t"),
3141 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3142 unsigned_intQI_type_node));
3143 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3144 unsigned_intHI_type_node));
3145 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3146 unsigned_intSI_type_node));
3147 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3148 unsigned_intDI_type_node));
3149 #if HOST_BITS_PER_WIDE_INT >= 64
3150 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3151 get_identifier ("__uint128_t"),
3152 unsigned_intTI_type_node));
3155 /* Create the widest literal types. */
3156 widest_integer_literal_type_node
3157 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3158 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3159 widest_integer_literal_type_node));
3161 widest_unsigned_literal_type_node
3162 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3163 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3164 widest_unsigned_literal_type_node));
3166 /* `unsigned long' is the standard type for sizeof.
3167 Note that stddef.h uses `unsigned long',
3168 and this must agree, even if long and int are the same size. */
3170 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3171 signed_size_type_node = c_common_signed_type (size_type_node);
3172 set_sizetype (size_type_node);
3174 build_common_tree_nodes_2 (flag_short_double);
3176 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3177 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3178 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3180 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3181 get_identifier ("complex int"),
3182 complex_integer_type_node));
3183 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3184 get_identifier ("complex float"),
3185 complex_float_type_node));
3186 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3187 get_identifier ("complex double"),
3188 complex_double_type_node));
3189 (*lang_hooks.decls.pushdecl)
3190 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3191 complex_long_double_type_node));
3193 /* Types which are common to the fortran compiler and libf2c. When
3194 changing these, you also need to be concerned with f/com.h. */
3196 if (TYPE_PRECISION (float_type_node)
3197 == TYPE_PRECISION (long_integer_type_node))
3199 g77_integer_type_node = long_integer_type_node;
3200 g77_uinteger_type_node = long_unsigned_type_node;
3202 else if (TYPE_PRECISION (float_type_node)
3203 == TYPE_PRECISION (integer_type_node))
3205 g77_integer_type_node = integer_type_node;
3206 g77_uinteger_type_node = unsigned_type_node;
3209 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3211 if (g77_integer_type_node != NULL_TREE)
3213 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3214 get_identifier ("__g77_integer"),
3215 g77_integer_type_node));
3216 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3217 get_identifier ("__g77_uinteger"),
3218 g77_uinteger_type_node));
3221 if (TYPE_PRECISION (float_type_node) * 2
3222 == TYPE_PRECISION (long_integer_type_node))
3224 g77_longint_type_node = long_integer_type_node;
3225 g77_ulongint_type_node = long_unsigned_type_node;
3227 else if (TYPE_PRECISION (float_type_node) * 2
3228 == TYPE_PRECISION (long_long_integer_type_node))
3230 g77_longint_type_node = long_long_integer_type_node;
3231 g77_ulongint_type_node = long_long_unsigned_type_node;
3234 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3236 if (g77_longint_type_node != NULL_TREE)
3238 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3239 get_identifier ("__g77_longint"),
3240 g77_longint_type_node));
3241 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3242 get_identifier ("__g77_ulongint"),
3243 g77_ulongint_type_node));
3246 record_builtin_type (RID_VOID, NULL, void_type_node);
3248 void_zero_node = build_int_2 (0, 0);
3249 TREE_TYPE (void_zero_node) = void_type_node;
3251 void_list_node = build_void_list_node ();
3253 /* Make a type to be the domain of a few array types
3254 whose domains don't really matter.
3255 200 is small enough that it always fits in size_t
3256 and large enough that it can hold most function names for the
3257 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3258 array_domain_type = build_index_type (size_int (200));
3260 /* Make a type for arrays of characters.
3261 With luck nothing will ever really depend on the length of this
3263 char_array_type_node
3264 = build_array_type (char_type_node, array_domain_type);
3266 /* Likewise for arrays of ints. */
3268 = build_array_type (integer_type_node, array_domain_type);
3270 string_type_node = build_pointer_type (char_type_node);
3271 const_string_type_node
3272 = build_pointer_type (build_qualified_type
3273 (char_type_node, TYPE_QUAL_CONST));
3275 /* This is special for C++ so functions can be overloaded. */
3276 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3277 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3278 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3279 if (c_dialect_cxx ())
3281 if (TREE_UNSIGNED (wchar_type_node))
3282 wchar_type_node = make_unsigned_type (wchar_type_size);
3284 wchar_type_node = make_signed_type (wchar_type_size);
3285 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3289 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3290 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3293 /* This is for wide string constants. */
3294 wchar_array_type_node
3295 = build_array_type (wchar_type_node, array_domain_type);
3298 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3301 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3303 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3305 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3307 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3308 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3310 (*lang_hooks.decls.pushdecl)
3311 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3312 va_list_type_node));
3314 (*lang_hooks.decls.pushdecl)
3315 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3316 ptrdiff_type_node));
3318 (*lang_hooks.decls.pushdecl)
3319 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3322 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3324 va_list_arg_type_node = va_list_ref_type_node =
3325 build_pointer_type (TREE_TYPE (va_list_type_node));
3329 va_list_arg_type_node = va_list_type_node;
3330 va_list_ref_type_node = build_reference_type (va_list_type_node);
3333 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3334 builtin_types[(int) ENUM] = VALUE;
3335 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3336 builtin_types[(int) ENUM] \
3337 = build_function_type (builtin_types[(int) RETURN], \
3339 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3340 builtin_types[(int) ENUM] \
3341 = build_function_type (builtin_types[(int) RETURN], \
3342 tree_cons (NULL_TREE, \
3343 builtin_types[(int) ARG1], \
3345 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3346 builtin_types[(int) ENUM] \
3347 = build_function_type \
3348 (builtin_types[(int) RETURN], \
3349 tree_cons (NULL_TREE, \
3350 builtin_types[(int) ARG1], \
3351 tree_cons (NULL_TREE, \
3352 builtin_types[(int) ARG2], \
3354 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3355 builtin_types[(int) ENUM] \
3356 = build_function_type \
3357 (builtin_types[(int) RETURN], \
3358 tree_cons (NULL_TREE, \
3359 builtin_types[(int) ARG1], \
3360 tree_cons (NULL_TREE, \
3361 builtin_types[(int) ARG2], \
3362 tree_cons (NULL_TREE, \
3363 builtin_types[(int) ARG3], \
3365 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3366 builtin_types[(int) ENUM] \
3367 = build_function_type \
3368 (builtin_types[(int) RETURN], \
3369 tree_cons (NULL_TREE, \
3370 builtin_types[(int) ARG1], \
3371 tree_cons (NULL_TREE, \
3372 builtin_types[(int) ARG2], \
3375 builtin_types[(int) ARG3], \
3376 tree_cons (NULL_TREE, \
3377 builtin_types[(int) ARG4], \
3378 void_list_node)))));
3379 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3380 builtin_types[(int) ENUM] \
3381 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3382 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3383 builtin_types[(int) ENUM] \
3384 = build_function_type (builtin_types[(int) RETURN], \
3385 tree_cons (NULL_TREE, \
3386 builtin_types[(int) ARG1], \
3389 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3390 builtin_types[(int) ENUM] \
3391 = build_function_type \
3392 (builtin_types[(int) RETURN], \
3393 tree_cons (NULL_TREE, \
3394 builtin_types[(int) ARG1], \
3395 tree_cons (NULL_TREE, \
3396 builtin_types[(int) ARG2], \
3399 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3400 builtin_types[(int) ENUM] \
3401 = build_function_type \
3402 (builtin_types[(int) RETURN], \
3403 tree_cons (NULL_TREE, \
3404 builtin_types[(int) ARG1], \
3405 tree_cons (NULL_TREE, \
3406 builtin_types[(int) ARG2], \
3407 tree_cons (NULL_TREE, \
3408 builtin_types[(int) ARG3], \
3411 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3412 builtin_types[(int) ENUM] \
3413 = build_pointer_type (builtin_types[(int) TYPE]);
3414 #include "builtin-types.def"
3415 #undef DEF_PRIMITIVE_TYPE
3416 #undef DEF_FUNCTION_TYPE_1
3417 #undef DEF_FUNCTION_TYPE_2
3418 #undef DEF_FUNCTION_TYPE_3
3419 #undef DEF_FUNCTION_TYPE_4
3420 #undef DEF_FUNCTION_TYPE_VAR_0
3421 #undef DEF_FUNCTION_TYPE_VAR_1
3422 #undef DEF_FUNCTION_TYPE_VAR_2
3423 #undef DEF_FUNCTION_TYPE_VAR_3
3424 #undef DEF_POINTER_TYPE
3426 c_init_attributes ();
3428 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3429 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3434 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3438 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3441 ? (NAME + strlen ("__builtin_")) \
3443 built_in_attributes[(int) ATTRS]); \
3445 decl = builtin_function_2 (NAME, \
3446 NAME + strlen ("__builtin_"), \
3447 builtin_types[TYPE], \
3448 builtin_types[LIBTYPE], \
3453 built_in_attributes[(int) ATTRS]); \
3455 built_in_decls[(int) ENUM] = decl; \
3457 implicit_built_in_decls[(int) ENUM] = decl; \
3459 #include "builtins.def"
3462 (*targetm.init_builtins) ();
3464 main_identifier_node = get_identifier ("main");
3468 build_va_arg (tree expr, tree type)
3470 return build1 (VA_ARG_EXPR, type, expr);
3474 /* Linked list of disabled built-in functions. */
3476 typedef struct disabled_builtin
3479 struct disabled_builtin *next;
3481 static disabled_builtin *disabled_builtins = NULL;
3483 static bool builtin_function_disabled_p (const char *);
3485 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3486 begins with "__builtin_", give an error. */
3489 disable_builtin_function (const char *name)
3491 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3492 error ("cannot disable built-in function `%s'", name);
3495 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3497 new->next = disabled_builtins;
3498 disabled_builtins = new;
3503 /* Return true if the built-in function NAME has been disabled, false
3507 builtin_function_disabled_p (const char *name)
3509 disabled_builtin *p;
3510 for (p = disabled_builtins; p != NULL; p = p->next)
3512 if (strcmp (name, p->name) == 0)
3519 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3520 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3521 of these may be NULL (though both being NULL is useless).
3522 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3523 TYPE is the type of the function with the ordinary name. These
3524 may differ if the ordinary name is declared with a looser type to avoid
3525 conflicts with headers. FUNCTION_CODE and CLASS are as for
3526 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3527 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3528 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3529 ATTRS is the tree list representing the builtin's function attributes.
3530 Returns the declaration of BUILTIN_NAME, if any, otherwise
3531 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3532 or if NONANSI_P and flag_no_nonansi_builtin. */
3535 builtin_function_2 (const char *builtin_name, const char *name,
3536 tree builtin_type, tree type, int function_code,
3537 enum built_in_class class, int library_name_p,
3538 int nonansi_p, tree attrs)
3540 tree bdecl = NULL_TREE;
3541 tree decl = NULL_TREE;
3543 if (builtin_name != 0)
3544 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3545 class, library_name_p ? name : NULL, attrs);
3547 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3548 && !(nonansi_p && flag_no_nonansi_builtin))
3549 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3551 return (bdecl != 0 ? bdecl : decl);
3554 /* Nonzero if the type T promotes to int. This is (nearly) the
3555 integral promotions defined in ISO C99 6.3.1.1/2. */
3558 c_promoting_integer_type_p (tree t)
3560 switch (TREE_CODE (t))
3563 return (TYPE_MAIN_VARIANT (t) == char_type_node
3564 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3565 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3566 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3567 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3568 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3571 /* ??? Technically all enumerations not larger than an int
3572 promote to an int. But this is used along code paths
3573 that only want to notice a size change. */
3574 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3584 /* Return 1 if PARMS specifies a fixed number of parameters
3585 and none of their types is affected by default promotions. */
3588 self_promoting_args_p (tree parms)
3591 for (t = parms; t; t = TREE_CHAIN (t))
3593 tree type = TREE_VALUE (t);
3595 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3601 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3604 if (c_promoting_integer_type_p (type))
3610 /* Recursively examines the array elements of TYPE, until a non-array
3611 element type is found. */
3614 strip_array_types (tree type)
3616 while (TREE_CODE (type) == ARRAY_TYPE)
3617 type = TREE_TYPE (type);
3622 /* Recursively remove any '*' or '&' operator from TYPE. */
3624 strip_pointer_operator (tree t)
3626 while (POINTER_TYPE_P (t))
3631 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3633 /* Expand a call to an unordered comparison function such as
3634 __builtin_isgreater(). FUNCTION is the function's declaration and
3635 PARAMS a list of the values passed. For __builtin_isunordered(),
3636 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3637 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3638 that give the opposite of the desired result. UNORDERED_CODE is
3639 used for modes that can hold NaNs and ORDERED_CODE is used for the
3643 expand_unordered_cmp (tree function, tree params,
3644 enum tree_code unordered_code,
3645 enum tree_code ordered_code)
3647 tree arg0, arg1, type;
3648 enum tree_code code0, code1;
3650 /* Check that we have exactly two arguments. */
3651 if (params == 0 || TREE_CHAIN (params) == 0)
3653 error ("too few arguments to function `%s'",
3654 IDENTIFIER_POINTER (DECL_NAME (function)));
3655 return error_mark_node;
3657 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3659 error ("too many arguments to function `%s'",
3660 IDENTIFIER_POINTER (DECL_NAME (function)));
3661 return error_mark_node;
3664 arg0 = TREE_VALUE (params);
3665 arg1 = TREE_VALUE (TREE_CHAIN (params));
3667 code0 = TREE_CODE (TREE_TYPE (arg0));
3668 code1 = TREE_CODE (TREE_TYPE (arg1));
3670 /* Make sure that the arguments have a common type of REAL. */
3672 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3673 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3674 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3676 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3678 error ("non-floating-point argument to function `%s'",
3679 IDENTIFIER_POINTER (DECL_NAME (function)));
3680 return error_mark_node;
3683 if (unordered_code == UNORDERED_EXPR)
3685 if (MODE_HAS_NANS (TYPE_MODE (type)))
3686 return build_binary_op (unordered_code,
3687 convert (type, arg0),
3688 convert (type, arg1),
3691 return integer_zero_node;
3694 return build_unary_op (TRUTH_NOT_EXPR,
3695 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3698 convert (type, arg0),
3699 convert (type, arg1),
3705 /* Recognize certain built-in functions so we can make tree-codes
3706 other than CALL_EXPR. We do this when it enables fold-const.c
3707 to do something useful. */
3708 /* ??? By rights this should go in builtins.c, but only C and C++
3709 implement build_{binary,unary}_op. Not exactly sure what bits
3710 of functionality are actually needed from those functions, or
3711 where the similar functionality exists in the other front ends. */
3714 expand_tree_builtin (tree function, tree params, tree coerced_params)
3716 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3719 switch (DECL_FUNCTION_CODE (function))
3723 case BUILT_IN_LLABS:
3724 case BUILT_IN_IMAXABS:
3726 case BUILT_IN_FABSL:
3727 case BUILT_IN_FABSF:
3728 if (coerced_params == 0)
3729 return integer_zero_node;
3730 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3733 case BUILT_IN_CONJF:
3734 case BUILT_IN_CONJL:
3735 if (coerced_params == 0)
3736 return integer_zero_node;
3737 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3739 case BUILT_IN_CREAL:
3740 case BUILT_IN_CREALF:
3741 case BUILT_IN_CREALL:
3742 if (coerced_params == 0)
3743 return integer_zero_node;
3744 return non_lvalue (build_unary_op (REALPART_EXPR,
3745 TREE_VALUE (coerced_params), 0));
3747 case BUILT_IN_CIMAG:
3748 case BUILT_IN_CIMAGF:
3749 case BUILT_IN_CIMAGL:
3750 if (coerced_params == 0)
3751 return integer_zero_node;
3752 return non_lvalue (build_unary_op (IMAGPART_EXPR,
3753 TREE_VALUE (coerced_params), 0));
3755 case BUILT_IN_ISGREATER:
3756 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3758 case BUILT_IN_ISGREATEREQUAL:
3759 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3761 case BUILT_IN_ISLESS:
3762 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3764 case BUILT_IN_ISLESSEQUAL:
3765 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3767 case BUILT_IN_ISLESSGREATER:
3768 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3770 case BUILT_IN_ISUNORDERED:
3771 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3780 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3781 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3782 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3783 value, the traversal is aborted, and the value returned by FUNC is
3784 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3785 the node being visited are not walked.
3787 We don't need a without_duplicates variant of this one because the
3788 statement tree is a tree, not a graph. */
3791 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3793 enum tree_code code;
3798 #define WALK_SUBTREE(NODE) \
3801 result = walk_stmt_tree (&(NODE), func, data); \
3807 /* Skip empty subtrees. */
3811 /* Skip subtrees below non-statement nodes. */
3812 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3815 /* Call the function. */
3817 result = (*func) (tp, &walk_subtrees, data);
3819 /* If we found something, return it. */
3823 /* FUNC may have modified the tree, recheck that we're looking at a
3825 code = TREE_CODE (*tp);
3826 if (!STATEMENT_CODE_P (code))
3829 /* Visit the subtrees unless FUNC decided that there was nothing
3830 interesting below this point in the tree. */
3833 /* Walk over all the sub-trees of this operand. Statement nodes
3834 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3835 len = TREE_CODE_LENGTH (code);
3837 /* Go through the subtrees. We need to do this in forward order so
3838 that the scope of a FOR_EXPR is handled properly. */
3839 for (i = 0; i < len; ++i)
3840 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3843 /* Finally visit the chain. This can be tail-recursion optimized if
3844 we write it this way. */
3845 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3850 /* Used to compare case labels. K1 and K2 are actually tree nodes
3851 representing case labels, or NULL_TREE for a `default' label.
3852 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3853 K2, and 0 if K1 and K2 are equal. */
3856 case_compare (splay_tree_key k1, splay_tree_key k2)
3858 /* Consider a NULL key (such as arises with a `default' label) to be
3859 smaller than anything else. */
3865 return tree_int_cst_compare ((tree) k1, (tree) k2);
3868 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3869 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3870 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3871 case label was declared using the usual C/C++ syntax, rather than
3872 the GNU case range extension. CASES is a tree containing all the
3873 case ranges processed so far; COND is the condition for the
3874 switch-statement itself. Returns the CASE_LABEL created, or
3875 ERROR_MARK_NODE if no CASE_LABEL is created. */
3878 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3884 splay_tree_node node;
3886 /* Create the LABEL_DECL itself. */
3887 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3888 DECL_CONTEXT (label) = current_function_decl;
3890 /* If there was an error processing the switch condition, bail now
3891 before we get more confused. */
3892 if (!cond || cond == error_mark_node)
3894 /* Add a label anyhow so that the back-end doesn't think that
3895 the beginning of the switch is unreachable. */
3897 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3898 return error_mark_node;
3901 if ((low_value && TREE_TYPE (low_value)
3902 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3903 || (high_value && TREE_TYPE (high_value)
3904 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3905 error ("pointers are not permitted as case values");
3907 /* Case ranges are a GNU extension. */
3908 if (high_value && pedantic)
3909 pedwarn ("range expressions in switch statements are non-standard");
3911 type = TREE_TYPE (cond);
3914 low_value = check_case_value (low_value);
3915 low_value = convert_and_check (type, low_value);
3919 high_value = check_case_value (high_value);
3920 high_value = convert_and_check (type, high_value);
3923 /* If an error has occurred, bail out now. */
3924 if (low_value == error_mark_node || high_value == error_mark_node)
3927 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3928 return error_mark_node;
3931 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3932 really a case range, even though it was written that way. Remove
3933 the HIGH_VALUE to simplify later processing. */
3934 if (tree_int_cst_equal (low_value, high_value))
3935 high_value = NULL_TREE;
3936 if (low_value && high_value
3937 && !tree_int_cst_lt (low_value, high_value))
3938 warning ("empty range specified");
3940 /* Look up the LOW_VALUE in the table of case labels we already
3942 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3943 /* If there was not an exact match, check for overlapping ranges.
3944 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3945 that's a `default' label and the only overlap is an exact match. */
3946 if (!node && (low_value || high_value))
3948 splay_tree_node low_bound;
3949 splay_tree_node high_bound;
3951 /* Even though there wasn't an exact match, there might be an
3952 overlap between this case range and another case range.
3953 Since we've (inductively) not allowed any overlapping case
3954 ranges, we simply need to find the greatest low case label
3955 that is smaller that LOW_VALUE, and the smallest low case
3956 label that is greater than LOW_VALUE. If there is an overlap
3957 it will occur in one of these two ranges. */
3958 low_bound = splay_tree_predecessor (cases,
3959 (splay_tree_key) low_value);
3960 high_bound = splay_tree_successor (cases,
3961 (splay_tree_key) low_value);
3963 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3964 the LOW_VALUE, so there is no need to check unless the
3965 LOW_BOUND is in fact itself a case range. */
3967 && CASE_HIGH ((tree) low_bound->value)
3968 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3971 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3972 range is bigger than the low end of the current range, so we
3973 are only interested if the current range is a real range, and
3974 not an ordinary case label. */
3977 && (tree_int_cst_compare ((tree) high_bound->key,
3982 /* If there was an overlap, issue an error. */
3985 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3989 error ("duplicate (or overlapping) case value");
3990 error ("%Jthis is the first entry overlapping that value", duplicate);
3994 error ("duplicate case value") ;
3995 error ("%Jpreviously used here", duplicate);
3999 error ("multiple default labels in one switch");
4000 error ("%Jthis is the first default label", duplicate);
4003 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
4006 /* Add a CASE_LABEL to the statement-tree. */
4007 case_label = add_stmt (build_case_label (low_value, high_value, label));
4008 /* Register this case label in the splay tree. */
4009 splay_tree_insert (cases,
4010 (splay_tree_key) low_value,
4011 (splay_tree_value) case_label);
4016 /* Finish an expression taking the address of LABEL (an
4017 IDENTIFIER_NODE). Returns an expression for the address. */
4020 finish_label_address_expr (tree label)
4025 pedwarn ("taking the address of a label is non-standard");
4027 if (label == error_mark_node)
4028 return error_mark_node;
4030 label = lookup_label (label);
4031 if (label == NULL_TREE)
4032 result = null_pointer_node;
4035 TREE_USED (label) = 1;
4036 result = build1 (ADDR_EXPR, ptr_type_node, label);
4037 TREE_CONSTANT (result) = 1;
4038 /* The current function in not necessarily uninlinable.
4039 Computed gotos are incompatible with inlining, but the value
4040 here could be used only in a diagnostic, for example. */
4046 /* Hook used by expand_expr to expand language-specific tree codes. */
4049 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
4050 int modifier /* Actually enum_modifier. */,
4053 switch (TREE_CODE (exp))
4059 bool preserve_result = false;
4061 if (STMT_EXPR_WARN_UNUSED_RESULT (exp) && target == const0_rtx)
4063 tree stmt = STMT_EXPR_STMT (exp);
4066 for (scope = COMPOUND_BODY (stmt);
4067 scope && TREE_CODE (scope) != SCOPE_STMT;
4068 scope = TREE_CHAIN (scope));
4070 if (scope && SCOPE_STMT_BLOCK (scope))
4071 warning ("%Hignoring return value of `%D', "
4072 "declared with attribute warn_unused_result",
4073 &expr_wfl_stack->location,
4074 BLOCK_ABSTRACT_ORIGIN (SCOPE_STMT_BLOCK (scope)));
4076 warning ("%Hignoring return value of function "
4077 "declared with attribute warn_unused_result",
4078 &expr_wfl_stack->location);
4081 /* Since expand_expr_stmt calls free_temp_slots after every
4082 expression statement, we must call push_temp_slots here.
4083 Otherwise, any temporaries in use now would be considered
4084 out-of-scope after the first EXPR_STMT from within the
4087 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
4089 /* If we want the result of this expression, find the last
4090 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
4091 if (target != const0_rtx
4092 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
4093 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
4095 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
4096 tree last = TREE_CHAIN (expr);
4098 while (TREE_CHAIN (last))
4101 last = TREE_CHAIN (last);
4104 if (TREE_CODE (last) == SCOPE_STMT
4105 && TREE_CODE (expr) == EXPR_STMT)
4107 /* Otherwise, note that we want the value from the last
4109 TREE_ADDRESSABLE (expr) = 1;
4110 preserve_result = true;
4114 expand_stmt (STMT_EXPR_STMT (exp));
4115 expand_end_stmt_expr (rtl_expr);
4117 result = expand_expr_real (rtl_expr, target, tmode, modifier, alt_rtl);
4118 if (preserve_result && GET_CODE (result) == MEM)
4120 if (GET_MODE (result) != BLKmode)
4121 result = copy_to_reg (result);
4123 preserve_temp_slots (result);
4126 /* If the statment-expression does not have a scope, then the
4127 new temporaries we created within it must live beyond the
4128 statement-expression. */
4129 if (STMT_EXPR_NO_SCOPE (exp))
4130 preserve_temp_slots (NULL_RTX);
4137 case COMPOUND_LITERAL_EXPR:
4139 /* Initialize the anonymous variable declared in the compound
4140 literal, then return the variable. */
4141 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4142 emit_local_var (decl);
4143 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
4154 /* Hook used by safe_from_p to handle language-specific tree codes. */
4157 c_safe_from_p (rtx target, tree exp)
4159 /* We can see statements here when processing the body of a
4160 statement-expression. For a declaration statement declaring a
4161 variable, look at the variable's initializer. */
4162 if (TREE_CODE (exp) == DECL_STMT)
4164 tree decl = DECL_STMT_DECL (exp);
4166 if (TREE_CODE (decl) == VAR_DECL
4167 && DECL_INITIAL (decl)
4168 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4172 /* For any statement, we must follow the statement-chain. */
4173 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4174 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4176 /* Assume everything else is safe. */
4180 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4183 c_common_unsafe_for_reeval (tree exp)
4185 /* Statement expressions may not be reevaluated, likewise compound
4187 if (TREE_CODE (exp) == STMT_EXPR
4188 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4191 /* Walk all other expressions. */
4195 /* Hook used by staticp to handle language-specific tree codes. */
4198 c_staticp (tree exp)
4200 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4201 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4207 /* Given a boolean expression ARG, return a tree representing an increment
4208 or decrement (as indicated by CODE) of ARG. The front end must check for
4209 invalid cases (e.g., decrement in C++). */
4211 boolean_increment (enum tree_code code, tree arg)
4214 tree true_res = boolean_true_node;
4216 arg = stabilize_reference (arg);
4219 case PREINCREMENT_EXPR:
4220 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4222 case POSTINCREMENT_EXPR:
4223 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4224 arg = save_expr (arg);
4225 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4226 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4228 case PREDECREMENT_EXPR:
4229 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4231 case POSTDECREMENT_EXPR:
4232 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4233 arg = save_expr (arg);
4234 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4235 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4240 TREE_SIDE_EFFECTS (val) = 1;
4244 /* Built-in macros for stddef.h, that require macros defined in this
4247 c_stddef_cpp_builtins(void)
4249 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4250 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4251 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4252 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4256 c_init_attributes (void)
4258 /* Fill in the built_in_attributes array. */
4259 #define DEF_ATTR_NULL_TREE(ENUM) \
4260 built_in_attributes[(int) ENUM] = NULL_TREE;
4261 #define DEF_ATTR_INT(ENUM, VALUE) \
4262 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4263 #define DEF_ATTR_IDENT(ENUM, STRING) \
4264 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4265 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4266 built_in_attributes[(int) ENUM] \
4267 = tree_cons (built_in_attributes[(int) PURPOSE], \
4268 built_in_attributes[(int) VALUE], \
4269 built_in_attributes[(int) CHAIN]);
4270 #include "builtin-attrs.def"
4271 #undef DEF_ATTR_NULL_TREE
4273 #undef DEF_ATTR_IDENT
4274 #undef DEF_ATTR_TREE_LIST
4277 /* Attribute handlers common to C front ends. */
4279 /* Handle a "packed" attribute; arguments as in
4280 struct attribute_spec.handler. */
4283 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4284 int flags, bool *no_add_attrs)
4288 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4289 *node = build_type_copy (*node);
4290 TYPE_PACKED (*node) = 1;
4291 if (TYPE_MAIN_VARIANT (*node) == *node)
4293 /* If it is the main variant, then pack the other variants
4294 too. This happens in,
4297 struct Foo const *ptr; // creates a variant w/o packed flag
4298 } __ attribute__((packed)); // packs it now.
4302 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4303 TYPE_PACKED (probe) = 1;
4307 else if (TREE_CODE (*node) == FIELD_DECL)
4308 DECL_PACKED (*node) = 1;
4309 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4310 used for DECL_REGISTER. It wouldn't mean anything anyway.
4311 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4312 that changes what the typedef is typing. */
4315 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4316 *no_add_attrs = true;
4322 /* Handle a "nocommon" attribute; arguments as in
4323 struct attribute_spec.handler. */
4326 handle_nocommon_attribute (tree *node, tree name,
4327 tree args ATTRIBUTE_UNUSED,
4328 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4330 if (TREE_CODE (*node) == VAR_DECL)
4331 DECL_COMMON (*node) = 0;
4334 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4335 *no_add_attrs = true;
4341 /* Handle a "common" attribute; arguments as in
4342 struct attribute_spec.handler. */
4345 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4346 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4348 if (TREE_CODE (*node) == VAR_DECL)
4349 DECL_COMMON (*node) = 1;
4352 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4353 *no_add_attrs = true;
4359 /* Handle a "noreturn" attribute; arguments as in
4360 struct attribute_spec.handler. */
4363 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4364 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4366 tree type = TREE_TYPE (*node);
4368 /* See FIXME comment in c_common_attribute_table. */
4369 if (TREE_CODE (*node) == FUNCTION_DECL)
4370 TREE_THIS_VOLATILE (*node) = 1;
4371 else if (TREE_CODE (type) == POINTER_TYPE
4372 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4374 = build_pointer_type
4375 (build_type_variant (TREE_TYPE (type),
4376 TREE_READONLY (TREE_TYPE (type)), 1));
4379 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4380 *no_add_attrs = true;
4386 /* Handle a "noinline" attribute; arguments as in
4387 struct attribute_spec.handler. */
4390 handle_noinline_attribute (tree *node, tree name,
4391 tree args ATTRIBUTE_UNUSED,
4392 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4394 if (TREE_CODE (*node) == FUNCTION_DECL)
4395 DECL_UNINLINABLE (*node) = 1;
4398 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4399 *no_add_attrs = true;
4405 /* Handle a "always_inline" attribute; arguments as in
4406 struct attribute_spec.handler. */
4409 handle_always_inline_attribute (tree *node, tree name,
4410 tree args ATTRIBUTE_UNUSED,
4411 int flags ATTRIBUTE_UNUSED,
4414 if (TREE_CODE (*node) == FUNCTION_DECL)
4416 /* Do nothing else, just set the attribute. We'll get at
4417 it later with lookup_attribute. */
4421 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4422 *no_add_attrs = true;
4428 /* Handle a "used" attribute; arguments as in
4429 struct attribute_spec.handler. */
4432 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4433 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4437 if (TREE_CODE (node) == FUNCTION_DECL
4438 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4440 TREE_USED (node) = 1;
4444 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4445 *no_add_attrs = true;
4451 /* Handle a "unused" attribute; arguments as in
4452 struct attribute_spec.handler. */
4455 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4456 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4462 if (TREE_CODE (decl) == PARM_DECL
4463 || TREE_CODE (decl) == VAR_DECL
4464 || TREE_CODE (decl) == FUNCTION_DECL
4465 || TREE_CODE (decl) == LABEL_DECL
4466 || TREE_CODE (decl) == TYPE_DECL)
4467 TREE_USED (decl) = 1;
4470 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4471 *no_add_attrs = true;
4476 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4477 *node = build_type_copy (*node);
4478 TREE_USED (*node) = 1;
4484 /* Handle a "const" attribute; arguments as in
4485 struct attribute_spec.handler. */
4488 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4489 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4491 tree type = TREE_TYPE (*node);
4493 /* See FIXME comment on noreturn in c_common_attribute_table. */
4494 if (TREE_CODE (*node) == FUNCTION_DECL)
4495 TREE_READONLY (*node) = 1;
4496 else if (TREE_CODE (type) == POINTER_TYPE
4497 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4499 = build_pointer_type
4500 (build_type_variant (TREE_TYPE (type), 1,
4501 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4504 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4505 *no_add_attrs = true;
4511 /* Handle a "transparent_union" attribute; arguments as in
4512 struct attribute_spec.handler. */
4515 handle_transparent_union_attribute (tree *node, tree name,
4516 tree args ATTRIBUTE_UNUSED, int flags,
4519 tree decl = NULL_TREE;
4526 type = &TREE_TYPE (decl);
4527 is_type = TREE_CODE (*node) == TYPE_DECL;
4529 else if (TYPE_P (*node))
4530 type = node, is_type = 1;
4533 && TREE_CODE (*type) == UNION_TYPE
4535 || (TYPE_FIELDS (*type) != 0
4536 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4538 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4539 *type = build_type_copy (*type);
4540 TYPE_TRANSPARENT_UNION (*type) = 1;
4542 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4543 && TREE_CODE (*type) == UNION_TYPE
4544 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4545 DECL_TRANSPARENT_UNION (decl) = 1;
4548 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4549 *no_add_attrs = true;
4555 /* Handle a "constructor" attribute; arguments as in
4556 struct attribute_spec.handler. */
4559 handle_constructor_attribute (tree *node, tree name,
4560 tree args ATTRIBUTE_UNUSED,
4561 int flags ATTRIBUTE_UNUSED,
4565 tree type = TREE_TYPE (decl);
4567 if (TREE_CODE (decl) == FUNCTION_DECL
4568 && TREE_CODE (type) == FUNCTION_TYPE
4569 && decl_function_context (decl) == 0)
4571 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4572 TREE_USED (decl) = 1;
4576 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4577 *no_add_attrs = true;
4583 /* Handle a "destructor" attribute; arguments as in
4584 struct attribute_spec.handler. */
4587 handle_destructor_attribute (tree *node, tree name,
4588 tree args ATTRIBUTE_UNUSED,
4589 int flags ATTRIBUTE_UNUSED,
4593 tree type = TREE_TYPE (decl);
4595 if (TREE_CODE (decl) == FUNCTION_DECL
4596 && TREE_CODE (type) == FUNCTION_TYPE
4597 && decl_function_context (decl) == 0)
4599 DECL_STATIC_DESTRUCTOR (decl) = 1;
4600 TREE_USED (decl) = 1;
4604 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4605 *no_add_attrs = true;
4611 /* Handle a "mode" attribute; arguments as in
4612 struct attribute_spec.handler. */
4615 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4616 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4620 *no_add_attrs = true;
4622 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4623 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4627 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4628 int len = strlen (p);
4629 enum machine_mode mode = VOIDmode;
4633 if (len > 4 && p[0] == '_' && p[1] == '_'
4634 && p[len - 1] == '_' && p[len - 2] == '_')
4636 char *newp = alloca (len - 1);
4638 strcpy (newp, &p[2]);
4639 newp[len - 4] = '\0';
4643 /* Change this type to have a type with the specified mode.
4644 First check for the special modes. */
4645 if (! strcmp (p, "byte"))
4647 else if (!strcmp (p, "word"))
4649 else if (! strcmp (p, "pointer"))
4652 for (j = 0; j < NUM_MACHINE_MODES; j++)
4653 if (!strcmp (p, GET_MODE_NAME (j)))
4654 mode = (enum machine_mode) j;
4656 if (mode == VOIDmode)
4657 error ("unknown machine mode `%s'", p);
4658 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
4659 (mode, TREE_UNSIGNED (type))))
4660 error ("no data type for mode `%s'", p);
4661 else if ((TREE_CODE (type) == POINTER_TYPE
4662 || TREE_CODE (type) == REFERENCE_TYPE)
4663 && !(*targetm.valid_pointer_mode) (mode))
4664 error ("invalid pointer mode `%s'", p);
4667 /* If this is a vector, make sure we either have hardware
4668 support, or we can emulate it. */
4669 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4671 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4675 if (TREE_CODE (type) == POINTER_TYPE)
4677 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4681 else if (TREE_CODE (type) == REFERENCE_TYPE)
4683 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4689 /* No need to layout the type here. The caller should do this. */
4696 /* Handle a "section" attribute; arguments as in
4697 struct attribute_spec.handler. */
4700 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4701 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4705 if (targetm.have_named_sections)
4707 if ((TREE_CODE (decl) == FUNCTION_DECL
4708 || TREE_CODE (decl) == VAR_DECL)
4709 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4711 if (TREE_CODE (decl) == VAR_DECL
4712 && current_function_decl != NULL_TREE
4713 && ! TREE_STATIC (decl))
4715 error ("%Jsection attribute cannot be specified for "
4716 "local variables", decl);
4717 *no_add_attrs = true;
4720 /* The decl may have already been given a section attribute
4721 from a previous declaration. Ensure they match. */
4722 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4723 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4724 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4726 error ("%Jsection of '%D' conflicts with previous declaration",
4728 *no_add_attrs = true;
4731 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4735 error ("%Jsection attribute not allowed for '%D'", *node, *node);
4736 *no_add_attrs = true;
4741 error ("%Jsection attributes are not supported for this target", *node);
4742 *no_add_attrs = true;
4748 /* Handle a "aligned" attribute; arguments as in
4749 struct attribute_spec.handler. */
4752 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4753 int flags, bool *no_add_attrs)
4755 tree decl = NULL_TREE;
4758 tree align_expr = (args ? TREE_VALUE (args)
4759 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4765 type = &TREE_TYPE (decl);
4766 is_type = TREE_CODE (*node) == TYPE_DECL;
4768 else if (TYPE_P (*node))
4769 type = node, is_type = 1;
4771 /* Strip any NOPs of any kind. */
4772 while (TREE_CODE (align_expr) == NOP_EXPR
4773 || TREE_CODE (align_expr) == CONVERT_EXPR
4774 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4775 align_expr = TREE_OPERAND (align_expr, 0);
4777 if (TREE_CODE (align_expr) != INTEGER_CST)
4779 error ("requested alignment is not a constant");
4780 *no_add_attrs = true;
4782 else if ((i = tree_log2 (align_expr)) == -1)
4784 error ("requested alignment is not a power of 2");
4785 *no_add_attrs = true;
4787 else if (i > HOST_BITS_PER_INT - 2)
4789 error ("requested alignment is too large");
4790 *no_add_attrs = true;
4794 /* If we have a TYPE_DECL, then copy the type, so that we
4795 don't accidentally modify a builtin type. See pushdecl. */
4796 if (decl && TREE_TYPE (decl) != error_mark_node
4797 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4799 tree tt = TREE_TYPE (decl);
4800 *type = build_type_copy (*type);
4801 DECL_ORIGINAL_TYPE (decl) = tt;
4802 TYPE_NAME (*type) = decl;
4803 TREE_USED (*type) = TREE_USED (decl);
4804 TREE_TYPE (decl) = *type;
4806 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4807 *type = build_type_copy (*type);
4809 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4810 TYPE_USER_ALIGN (*type) = 1;
4812 else if (TREE_CODE (decl) != VAR_DECL
4813 && TREE_CODE (decl) != FIELD_DECL)
4815 error ("%Jalignment may not be specified for '%D'", decl, decl);
4816 *no_add_attrs = true;
4820 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4821 DECL_USER_ALIGN (decl) = 1;
4827 /* Handle a "weak" attribute; arguments as in
4828 struct attribute_spec.handler. */
4831 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4832 tree args ATTRIBUTE_UNUSED,
4833 int flags ATTRIBUTE_UNUSED,
4834 bool *no_add_attrs ATTRIBUTE_UNUSED)
4836 declare_weak (*node);
4841 /* Handle an "alias" attribute; arguments as in
4842 struct attribute_spec.handler. */
4845 handle_alias_attribute (tree *node, tree name, tree args,
4846 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4850 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4851 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4853 error ("%J'%D' defined both normally and as an alias", decl, decl);
4854 *no_add_attrs = true;
4856 else if (decl_function_context (decl) == 0)
4860 id = TREE_VALUE (args);
4861 if (TREE_CODE (id) != STRING_CST)
4863 error ("alias arg not a string");
4864 *no_add_attrs = true;
4867 id = get_identifier (TREE_STRING_POINTER (id));
4868 /* This counts as a use of the object pointed to. */
4871 if (TREE_CODE (decl) == FUNCTION_DECL)
4872 DECL_INITIAL (decl) = error_mark_node;
4874 DECL_EXTERNAL (decl) = 0;
4878 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4879 *no_add_attrs = true;
4885 /* Handle an "visibility" attribute; arguments as in
4886 struct attribute_spec.handler. */
4889 handle_visibility_attribute (tree *node, tree name, tree args,
4890 int flags ATTRIBUTE_UNUSED,
4894 tree id = TREE_VALUE (args);
4896 *no_add_attrs = true;
4898 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
4900 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4904 if (TREE_CODE (id) != STRING_CST)
4906 error ("visibility arg not a string");
4910 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
4911 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4912 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
4913 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
4914 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
4915 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
4916 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
4917 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
4919 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4924 /* Handle an "tls_model" attribute; arguments as in
4925 struct attribute_spec.handler. */
4928 handle_tls_model_attribute (tree *node, tree name, tree args,
4929 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4933 if (! DECL_THREAD_LOCAL (decl))
4935 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4936 *no_add_attrs = true;
4942 id = TREE_VALUE (args);
4943 if (TREE_CODE (id) != STRING_CST)
4945 error ("tls_model arg not a string");
4946 *no_add_attrs = true;
4949 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4950 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4951 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4952 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4954 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4955 *no_add_attrs = true;
4963 /* Handle a "no_instrument_function" attribute; arguments as in
4964 struct attribute_spec.handler. */
4967 handle_no_instrument_function_attribute (tree *node, tree name,
4968 tree args ATTRIBUTE_UNUSED,
4969 int flags ATTRIBUTE_UNUSED,
4974 if (TREE_CODE (decl) != FUNCTION_DECL)
4976 error ("%J'%E' attribute applies only to functions", decl, name);
4977 *no_add_attrs = true;
4979 else if (DECL_INITIAL (decl))
4981 error ("%Jcan't set '%E' attribute after definition", decl, name);
4982 *no_add_attrs = true;
4985 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
4990 /* Handle a "malloc" attribute; arguments as in
4991 struct attribute_spec.handler. */
4994 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4995 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4997 if (TREE_CODE (*node) == FUNCTION_DECL)
4998 DECL_IS_MALLOC (*node) = 1;
4999 /* ??? TODO: Support types. */
5002 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5003 *no_add_attrs = true;
5009 /* Handle a "no_limit_stack" attribute; arguments as in
5010 struct attribute_spec.handler. */
5013 handle_no_limit_stack_attribute (tree *node, tree name,
5014 tree args ATTRIBUTE_UNUSED,
5015 int flags ATTRIBUTE_UNUSED,
5020 if (TREE_CODE (decl) != FUNCTION_DECL)
5022 error ("%J'%E' attribute applies only to functions", decl, name);
5023 *no_add_attrs = true;
5025 else if (DECL_INITIAL (decl))
5027 error ("%Jcan't set '%E' attribute after definition", decl, name);
5028 *no_add_attrs = true;
5031 DECL_NO_LIMIT_STACK (decl) = 1;
5036 /* Handle a "pure" attribute; arguments as in
5037 struct attribute_spec.handler. */
5040 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5041 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5043 if (TREE_CODE (*node) == FUNCTION_DECL)
5044 DECL_IS_PURE (*node) = 1;
5045 /* ??? TODO: Support types. */
5048 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5049 *no_add_attrs = true;
5055 /* Handle a "deprecated" attribute; arguments as in
5056 struct attribute_spec.handler. */
5059 handle_deprecated_attribute (tree *node, tree name,
5060 tree args ATTRIBUTE_UNUSED, int flags,
5063 tree type = NULL_TREE;
5065 const char *what = NULL;
5070 type = TREE_TYPE (decl);
5072 if (TREE_CODE (decl) == TYPE_DECL
5073 || TREE_CODE (decl) == PARM_DECL
5074 || TREE_CODE (decl) == VAR_DECL
5075 || TREE_CODE (decl) == FUNCTION_DECL
5076 || TREE_CODE (decl) == FIELD_DECL)
5077 TREE_DEPRECATED (decl) = 1;
5081 else if (TYPE_P (*node))
5083 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5084 *node = build_type_copy (*node);
5085 TREE_DEPRECATED (*node) = 1;
5093 *no_add_attrs = true;
5094 if (type && TYPE_NAME (type))
5096 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5097 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5098 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5099 && DECL_NAME (TYPE_NAME (type)))
5100 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5103 warning ("`%s' attribute ignored for `%s'",
5104 IDENTIFIER_POINTER (name), what);
5106 warning ("`%s' attribute ignored",
5107 IDENTIFIER_POINTER (name));
5113 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5114 to prevent us from duplicating type nodes unnecessarily.
5115 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5116 since we want to distinguish types that are essentially identical (except
5117 for their debug representation), we use a local list here. */
5118 static GTY(()) tree vector_type_node_list = 0;
5120 /* Handle a "vector_size" attribute; arguments as in
5121 struct attribute_spec.handler. */
5124 handle_vector_size_attribute (tree *node, tree name, tree args,
5125 int flags ATTRIBUTE_UNUSED,
5128 unsigned HOST_WIDE_INT vecsize, nunits;
5129 enum machine_mode mode, orig_mode, new_mode;
5130 tree type = *node, new_type = NULL_TREE;
5131 tree type_list_node;
5133 *no_add_attrs = true;
5135 if (! host_integerp (TREE_VALUE (args), 1))
5137 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5141 /* Get the vector size (in bytes). */
5142 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5144 /* We need to provide for vector pointers, vector arrays, and
5145 functions returning vectors. For example:
5147 __attribute__((vector_size(16))) short *foo;
5149 In this case, the mode is SI, but the type being modified is
5150 HI, so we need to look further. */
5152 while (POINTER_TYPE_P (type)
5153 || TREE_CODE (type) == FUNCTION_TYPE
5154 || TREE_CODE (type) == METHOD_TYPE
5155 || TREE_CODE (type) == ARRAY_TYPE)
5156 type = TREE_TYPE (type);
5158 /* Get the mode of the type being modified. */
5159 orig_mode = TYPE_MODE (type);
5161 if (TREE_CODE (type) == RECORD_TYPE
5162 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5163 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5164 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5166 error ("invalid vector type for attribute `%s'",
5167 IDENTIFIER_POINTER (name));
5171 /* Calculate how many units fit in the vector. */
5172 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5174 /* Find a suitably sized vector. */
5175 new_mode = VOIDmode;
5176 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5178 : MODE_VECTOR_FLOAT);
5180 mode = GET_MODE_WIDER_MODE (mode))
5181 if (vecsize == GET_MODE_SIZE (mode)
5182 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5188 if (new_mode == VOIDmode)
5190 error ("no vector mode with the size and type specified could be found");
5194 for (type_list_node = vector_type_node_list; type_list_node;
5195 type_list_node = TREE_CHAIN (type_list_node))
5197 tree other_type = TREE_VALUE (type_list_node);
5198 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5199 tree fields = TYPE_FIELDS (record);
5200 tree field_type = TREE_TYPE (fields);
5201 tree array_type = TREE_TYPE (field_type);
5202 if (TREE_CODE (fields) != FIELD_DECL
5203 || TREE_CODE (field_type) != ARRAY_TYPE)
5206 if (TYPE_MODE (other_type) == mode && type == array_type)
5208 new_type = other_type;
5213 if (new_type == NULL_TREE)
5215 tree index, array, rt, list_node;
5217 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5218 TREE_UNSIGNED (type));
5222 error ("no vector mode with the size and type specified could be found");
5226 new_type = build_type_copy (new_type);
5228 /* If this is a vector, make sure we either have hardware
5229 support, or we can emulate it. */
5230 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5231 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5232 && !vector_mode_valid_p (mode))
5234 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5238 /* Set the debug information here, because this is the only
5239 place where we know the underlying type for a vector made
5240 with vector_size. For debugging purposes we pretend a vector
5241 is an array within a structure. */
5242 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5243 array = build_array_type (type, build_index_type (index));
5244 rt = make_node (RECORD_TYPE);
5246 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5247 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5249 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5251 list_node = build_tree_list (NULL, new_type);
5252 TREE_CHAIN (list_node) = vector_type_node_list;
5253 vector_type_node_list = list_node;
5256 /* Build back pointers if needed. */
5257 *node = vector_size_helper (*node, new_type);
5262 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5265 If we requested a pointer to a vector, build up the pointers that
5266 we stripped off while looking for the inner type. Similarly for
5267 return values from functions.
5269 The argument "type" is the top of the chain, and "bottom" is the
5270 new type which we will point to. */
5273 vector_size_helper (tree type, tree bottom)
5277 if (POINTER_TYPE_P (type))
5279 inner = vector_size_helper (TREE_TYPE (type), bottom);
5280 outer = build_pointer_type (inner);
5282 else if (TREE_CODE (type) == ARRAY_TYPE)
5284 inner = vector_size_helper (TREE_TYPE (type), bottom);
5285 outer = build_array_type (inner, TYPE_DOMAIN (type));
5287 else if (TREE_CODE (type) == FUNCTION_TYPE)
5289 inner = vector_size_helper (TREE_TYPE (type), bottom);
5290 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5292 else if (TREE_CODE (type) == METHOD_TYPE)
5294 inner = vector_size_helper (TREE_TYPE (type), bottom);
5295 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5297 TYPE_ARG_TYPES (type));
5302 TREE_READONLY (outer) = TREE_READONLY (type);
5303 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5308 /* Handle the "nonnull" attribute. */
5310 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5311 tree args, int flags ATTRIBUTE_UNUSED,
5315 unsigned HOST_WIDE_INT attr_arg_num;
5317 /* If no arguments are specified, all pointer arguments should be
5318 non-null. Verify a full prototype is given so that the arguments
5319 will have the correct types when we actually check them later. */
5322 if (! TYPE_ARG_TYPES (type))
5324 error ("nonnull attribute without arguments on a non-prototype");
5325 *no_add_attrs = true;
5330 /* Argument list specified. Verify that each argument number references
5331 a pointer argument. */
5332 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5335 unsigned HOST_WIDE_INT arg_num, ck_num;
5337 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5339 error ("nonnull argument has invalid operand number (arg %lu)",
5340 (unsigned long) attr_arg_num);
5341 *no_add_attrs = true;
5345 argument = TYPE_ARG_TYPES (type);
5348 for (ck_num = 1; ; ck_num++)
5350 if (! argument || ck_num == arg_num)
5352 argument = TREE_CHAIN (argument);
5356 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5358 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5359 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5360 *no_add_attrs = true;
5364 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5366 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5367 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5368 *no_add_attrs = true;
5377 /* Check the argument list of a function call for null in argument slots
5378 that are marked as requiring a non-null pointer argument. */
5381 check_function_nonnull (tree attrs, tree params)
5383 tree a, args, param;
5386 for (a = attrs; a; a = TREE_CHAIN (a))
5388 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5390 args = TREE_VALUE (a);
5392 /* Walk the argument list. If we encounter an argument number we
5393 should check for non-null, do it. If the attribute has no args,
5394 then every pointer argument is checked (in which case the check
5395 for pointer type is done in check_nonnull_arg). */
5396 for (param = params, param_num = 1; ;
5397 param_num++, param = TREE_CHAIN (param))
5401 if (! args || nonnull_check_p (args, param_num))
5402 check_function_arguments_recurse (check_nonnull_arg, NULL,
5410 /* Helper for check_function_nonnull; given a list of operands which
5411 must be non-null in ARGS, determine if operand PARAM_NUM should be
5415 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5417 unsigned HOST_WIDE_INT arg_num;
5419 for (; args; args = TREE_CHAIN (args))
5421 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5424 if (arg_num == param_num)
5430 /* Check that the function argument PARAM (which is operand number
5431 PARAM_NUM) is non-null. This is called by check_function_nonnull
5432 via check_function_arguments_recurse. */
5435 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5436 unsigned HOST_WIDE_INT param_num)
5438 /* Just skip checking the argument if it's not a pointer. This can
5439 happen if the "nonnull" attribute was given without an operand
5440 list (which means to check every pointer argument). */
5442 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5445 if (integer_zerop (param))
5446 warning ("null argument where non-null required (arg %lu)",
5447 (unsigned long) param_num);
5450 /* Helper for nonnull attribute handling; fetch the operand number
5451 from the attribute argument list. */
5454 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5456 /* Strip any conversions from the arg number and verify they
5458 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5459 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5460 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5461 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5463 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5464 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5467 *valp = TREE_INT_CST_LOW (arg_num_expr);
5471 /* Handle a "nothrow" attribute; arguments as in
5472 struct attribute_spec.handler. */
5475 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5476 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5478 if (TREE_CODE (*node) == FUNCTION_DECL)
5479 TREE_NOTHROW (*node) = 1;
5480 /* ??? TODO: Support types. */
5483 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5484 *no_add_attrs = true;
5490 /* Handle a "cleanup" attribute; arguments as in
5491 struct attribute_spec.handler. */
5494 handle_cleanup_attribute (tree *node, tree name, tree args,
5495 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5498 tree cleanup_id, cleanup_decl;
5500 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5501 for global destructors in C++. This requires infrastructure that
5502 we don't have generically at the moment. It's also not a feature
5503 we'd be missing too much, since we do have attribute constructor. */
5504 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5506 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5507 *no_add_attrs = true;
5511 /* Verify that the argument is a function in scope. */
5512 /* ??? We could support pointers to functions here as well, if
5513 that was considered desirable. */
5514 cleanup_id = TREE_VALUE (args);
5515 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5517 error ("cleanup arg not an identifier");
5518 *no_add_attrs = true;
5521 cleanup_decl = lookup_name (cleanup_id);
5522 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5524 error ("cleanup arg not a function");
5525 *no_add_attrs = true;
5529 /* That the function has proper type is checked with the
5530 eventual call to build_function_call. */
5535 /* Handle a "warn_unused_result" attribute. No special handling. */
5538 handle_warn_unused_result_attribute (tree *node, tree name,
5539 tree args ATTRIBUTE_UNUSED,
5540 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5542 /* Ignore the attribute for functions not returning any value. */
5543 if (VOID_TYPE_P (TREE_TYPE (*node)))
5545 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5546 *no_add_attrs = true;
5552 /* Check for valid arguments being passed to a function. */
5554 check_function_arguments (tree attrs, tree params)
5556 /* Check for null being passed in a pointer argument that must be
5557 non-null. We also need to do this if format checking is enabled. */
5560 check_function_nonnull (attrs, params);
5562 /* Check for errors in format strings. */
5565 check_function_format (NULL, attrs, params);
5568 /* Generic argument checking recursion routine. PARAM is the argument to
5569 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5570 once the argument is resolved. CTX is context for the callback. */
5572 check_function_arguments_recurse (void (*callback)
5573 (void *, tree, unsigned HOST_WIDE_INT),
5574 void *ctx, tree param,
5575 unsigned HOST_WIDE_INT param_num)
5577 if (TREE_CODE (param) == NOP_EXPR)
5579 /* Strip coercion. */
5580 check_function_arguments_recurse (callback, ctx,
5581 TREE_OPERAND (param, 0), param_num);
5585 if (TREE_CODE (param) == CALL_EXPR)
5587 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5589 bool found_format_arg = false;
5591 /* See if this is a call to a known internationalization function
5592 that modifies a format arg. Such a function may have multiple
5593 format_arg attributes (for example, ngettext). */
5595 for (attrs = TYPE_ATTRIBUTES (type);
5597 attrs = TREE_CHAIN (attrs))
5598 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5601 tree format_num_expr;
5605 /* Extract the argument number, which was previously checked
5607 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5608 while (TREE_CODE (format_num_expr) == NOP_EXPR
5609 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5610 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5611 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5613 if (TREE_CODE (format_num_expr) != INTEGER_CST
5614 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5617 format_num = TREE_INT_CST_LOW (format_num_expr);
5619 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5621 inner_args = TREE_CHAIN (inner_args), i++)
5622 if (i == format_num)
5624 check_function_arguments_recurse (callback, ctx,
5625 TREE_VALUE (inner_args),
5627 found_format_arg = true;
5632 /* If we found a format_arg attribute and did a recursive check,
5633 we are done with checking this argument. Otherwise, we continue
5634 and this will be considered a non-literal. */
5635 if (found_format_arg)
5639 if (TREE_CODE (param) == COND_EXPR)
5641 /* Check both halves of the conditional expression. */
5642 check_function_arguments_recurse (callback, ctx,
5643 TREE_OPERAND (param, 1), param_num);
5644 check_function_arguments_recurse (callback, ctx,
5645 TREE_OPERAND (param, 2), param_num);
5649 (*callback) (ctx, param, param_num);
5652 /* Function to help qsort sort FIELD_DECLs by name order. */
5655 field_decl_cmp (const void *x_p, const void *y_p)
5657 const tree *const x = x_p;
5658 const tree *const y = y_p;
5659 if (DECL_NAME (*x) == DECL_NAME (*y))
5660 /* A nontype is "greater" than a type. */
5661 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5662 if (DECL_NAME (*x) == NULL_TREE)
5664 if (DECL_NAME (*y) == NULL_TREE)
5666 if (DECL_NAME (*x) < DECL_NAME (*y))
5672 gt_pointer_operator new_value;
5676 /* This routine compares two fields like field_decl_cmp but using the
5677 pointer operator in resort_data. */
5680 resort_field_decl_cmp (const void *x_p, const void *y_p)
5682 const tree *const x = x_p;
5683 const tree *const y = y_p;
5685 if (DECL_NAME (*x) == DECL_NAME (*y))
5686 /* A nontype is "greater" than a type. */
5687 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5688 if (DECL_NAME (*x) == NULL_TREE)
5690 if (DECL_NAME (*y) == NULL_TREE)
5693 tree d1 = DECL_NAME (*x);
5694 tree d2 = DECL_NAME (*y);
5695 resort_data.new_value (&d1, resort_data.cookie);
5696 resort_data.new_value (&d2, resort_data.cookie);
5703 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5706 resort_sorted_fields (void *obj,
5707 void *orig_obj ATTRIBUTE_UNUSED ,
5708 gt_pointer_operator new_value,
5711 struct sorted_fields_type *sf = obj;
5712 resort_data.new_value = new_value;
5713 resort_data.cookie = cookie;
5714 qsort (&sf->elts[0], sf->len, sizeof (tree),
5715 resort_field_decl_cmp);
5718 /* Used by estimate_num_insns. Estimate number of instructions seen
5719 by given statement. */
5721 c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
5726 if (TYPE_P (x) || DECL_P (x))
5731 /* Assume that constants and references counts nothing. These should
5732 be majorized by amount of operations among them we count later
5733 and are common target of CSE and similar optimizations. */
5734 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
5735 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
5737 switch (TREE_CODE (x))
5739 /* Recognize assignments of large structures and constructors of
5746 size = int_size_in_bytes (TREE_TYPE (x));
5748 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
5751 *count += ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
5756 tree decl = get_callee_fndecl (x);
5758 if (decl && DECL_BUILT_IN (decl))
5759 switch (DECL_FUNCTION_CODE (decl))
5761 case BUILT_IN_CONSTANT_P:
5764 case BUILT_IN_EXPECT:
5772 /* Few special cases of expensive operations. This is usefull
5773 to avoid inlining on functions having too many of these. */
5774 case TRUNC_DIV_EXPR:
5776 case FLOOR_DIV_EXPR:
5777 case ROUND_DIV_EXPR:
5778 case TRUNC_MOD_EXPR:
5780 case FLOOR_MOD_EXPR:
5781 case ROUND_MOD_EXPR:
5785 /* Various containers that will produce no code themselves. */
5792 case IDENTIFIER_NODE:
5793 case PLACEHOLDER_EXPR:
5794 case WITH_CLEANUP_EXPR:
5795 case CLEANUP_POINT_EXPR:
5797 case VIEW_CONVERT_EXPR:
5803 case TRY_CATCH_EXPR:
5804 case TRY_FINALLY_EXPR:
5807 case LABELED_BLOCK_EXPR:
5808 case EXIT_BLOCK_EXPR:
5809 case EXPR_WITH_FILE_LOCATION:
5826 /* Do not account static initializers. */
5827 if (TREE_STATIC (TREE_OPERAND (x, 0)))
5836 /* Estimate number of instructions that will be created by expanding the body. */
5838 c_estimate_num_insns (tree decl)
5841 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl), c_estimate_num_insns_1, &num);
5845 /* Used by c_decl_uninit to find where expressions like x = x + 1; */
5848 c_decl_uninit_1 (tree *t, int *walk_sub_trees, void *x)
5850 /* If x = EXP(&x)EXP, then do not warn about the use of x. */
5851 if (TREE_CODE (*t) == ADDR_EXPR && TREE_OPERAND (*t, 0) == x)
5853 *walk_sub_trees = 0;
5861 /* Find out if a variable is uninitialized based on DECL_INITIAL. */
5864 c_decl_uninit (tree t)
5866 /* int x = x; is GCC extension to turn off this warning, only if warn_init_self is zero. */
5867 if (DECL_INITIAL (t) == t)
5868 return warn_init_self ? true : false;
5870 /* Walk the trees looking for the variable itself. */
5871 if (walk_tree_without_duplicates (&DECL_INITIAL (t), c_decl_uninit_1, t))
5876 /* Issue the error given by MSGID, indicating that it occurred before
5877 TOKEN, which had the associated VALUE. */
5880 c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5882 const char *string = _(msgid);
5884 if (token == CPP_EOF)
5885 error ("%s at end of input", string);
5886 else if (token == CPP_CHAR || token == CPP_WCHAR)
5888 unsigned int val = TREE_INT_CST_LOW (value);
5889 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5890 if (val <= UCHAR_MAX && ISGRAPH (val))
5891 error ("%s before %s'%c'", string, ell, val);
5893 error ("%s before %s'\\x%x'", string, ell, val);
5895 else if (token == CPP_STRING
5896 || token == CPP_WSTRING)
5897 error ("%s before string constant", string);
5898 else if (token == CPP_NUMBER)
5899 error ("%s before numeric constant", string);
5900 else if (token == CPP_NAME)
5901 error ("%s before \"%s\"", string, IDENTIFIER_POINTER (value));
5902 else if (token < N_TTYPES)
5903 error ("%s before '%s' token", string, cpp_type2name (token));
5905 error ("%s", string);
5908 #include "gt-c-common.h"