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 warn for any global function def
276 without separate previous prototype decl. */
278 int warn_missing_prototypes;
280 /* Warn if adding () is suggested. */
282 int warn_parentheses;
284 /* Warn if initializer is not completely bracketed. */
286 int warn_missing_braces;
288 /* Warn about comparison of signed and unsigned values.
289 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified
290 (in which case -Wextra gets to decide). */
292 int warn_sign_compare = -1;
294 /* Nonzero means warn about usage of long long when `-pedantic'. */
296 int warn_long_long = 1;
298 /* Nonzero means warn about deprecated conversion from string constant to
301 int warn_write_strings;
303 /* Nonzero means warn about multiple (redundant) decls for the same single
304 variable or function. */
306 int warn_redundant_decls;
308 /* Warn about testing equality of floating point numbers. */
310 int warn_float_equal;
312 /* Warn about a subscript that has type char. */
314 int warn_char_subscripts;
316 /* Warn if a type conversion is done that might have confusing results. */
320 /* Warn about #pragma directives that are not recognized. */
322 int warn_unknown_pragmas; /* Tri state variable. */
324 /* Warn about format/argument anomalies in calls to formatted I/O functions
325 (*printf, *scanf, strftime, strfmon, etc.). */
329 /* Warn about Y2K problems with strftime formats. */
333 /* Warn about excess arguments to formats. */
335 int warn_format_extra_args;
337 /* Warn about zero-length formats. */
339 int warn_format_zero_length;
341 /* Warn about non-literal format arguments. */
343 int warn_format_nonliteral;
345 /* Warn about possible security problems with calls to format functions. */
347 int warn_format_security;
349 /* Zero means that faster, ...NonNil variants of objc_msgSend...
350 calls will be used in ObjC; passing nil receivers to such calls
351 will most likely result in crashes. */
352 int flag_nil_receivers = 1;
354 /* Nonzero means that we will allow new ObjC exception syntax (@throw,
355 @try, etc.) in source code. */
356 int flag_objc_exceptions = 0;
358 /* Nonzero means that code generation will be altered to support
359 "zero-link" execution. This currently affects ObjC only, but may
360 affect other languages in the future. */
361 int flag_zero_link = 0;
363 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
364 unit. It will inform the ObjC runtime that class definition(s) herein
365 contained are to replace one(s) previously loaded. */
366 int flag_replace_objc_classes = 0;
368 /* C/ObjC language option variables. */
371 /* Nonzero means message about use of implicit function declarations;
372 1 means warning; 2 means error. */
374 int mesg_implicit_function_declaration = -1;
376 /* Nonzero means allow type mismatches in conditional expressions;
377 just make their values `void'. */
379 int flag_cond_mismatch;
381 /* Nonzero means enable C89 Amendment 1 features. */
385 /* Nonzero means use the ISO C99 dialect of C. */
389 /* Nonzero means that we have builtin functions, and main is an int. */
393 /* Nonzero means warn when casting a function call to a type that does
394 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
395 when there is no previous declaration of sqrt or malloc. */
397 int warn_bad_function_cast;
399 /* Warn about traditional constructs whose meanings changed in ANSI C. */
401 int warn_traditional;
403 /* Nonzero means warn for a declaration found after a statement. */
405 int warn_declaration_after_statement;
407 /* Nonzero means warn for non-prototype function decls
408 or non-prototyped defs without previous prototype. */
410 int warn_strict_prototypes;
412 /* Nonzero means warn for any global function def
413 without separate previous decl. */
415 int warn_missing_declarations;
417 /* Nonzero means warn about declarations of objects not at
418 file-scope level and about *all* declarations of functions (whether
419 or static) not at file-scope level. Note that we exclude
420 implicit function declarations. To get warnings about those, use
423 int warn_nested_externs;
425 /* Warn if main is suspicious. */
429 /* Nonzero means warn about possible violations of sequence point rules. */
431 int warn_sequence_point;
433 /* Nonzero means warn about uninitialized variable when it is initialized with itself.
434 For example: int i = i;, GCC will not warn about this when warn_init_self is nonzero. */
438 /* Nonzero means to warn about compile-time division by zero. */
439 int warn_div_by_zero = 1;
441 /* Nonzero means warn about use of implicit int. */
443 int warn_implicit_int;
445 /* Warn about NULL being passed to argument slots marked as requiring
450 /* Warn about old-style parameter declaration. */
452 int warn_old_style_definition;
455 /* ObjC language option variables. */
458 /* Open and close the file for outputting class declarations, if
461 int flag_gen_declaration;
463 /* Generate code for GNU or NeXT runtime environment. */
465 #ifdef NEXT_OBJC_RUNTIME
466 int flag_next_runtime = 1;
468 int flag_next_runtime = 0;
471 /* Tells the compiler that this is a special run. Do not perform any
472 compiling, instead we are to test some platform dependent features
473 and output a C header file with appropriate definitions. */
475 int print_struct_values;
477 /* ???. Undocumented. */
479 const char *constant_string_class_name;
481 /* Warn if multiple methods are seen for the same selector, but with
482 different argument types. Performs the check on the whole selector
483 table at the end of compilation. */
487 /* Warn if a @selector() is found, and no method with that selector
488 has been previously declared. The check is done on each
489 @selector() as soon as it is found - so it warns about forward
492 int warn_undeclared_selector;
494 /* Warn if methods required by a protocol are not implemented in the
495 class adopting it. When turned off, methods inherited to that
496 class are also considered implemented. */
498 int warn_protocol = 1;
501 /* C++ language option variables. */
504 /* Nonzero means don't recognize any extension keywords. */
506 int flag_no_gnu_keywords;
508 /* Nonzero means do emit exported implementations of functions even if
509 they can be inlined. */
511 int flag_implement_inlines = 1;
513 /* Nonzero means that implicit instantiations will be emitted if needed. */
515 int flag_implicit_templates = 1;
517 /* Nonzero means that implicit instantiations of inline templates will be
518 emitted if needed, even if instantiations of non-inline templates
521 int flag_implicit_inline_templates = 1;
523 /* Nonzero means generate separate instantiation control files and
524 juggle them at link time. */
526 int flag_use_repository;
528 /* Nonzero if we want to issue diagnostics that the standard says are not
531 int flag_optional_diags = 1;
533 /* Nonzero means we should attempt to elide constructors when possible. */
535 int flag_elide_constructors = 1;
537 /* Nonzero means that member functions defined in class scope are
538 inline by default. */
540 int flag_default_inline = 1;
542 /* Controls whether compiler generates 'type descriptor' that give
543 run-time type information. */
547 /* Nonzero if we want to conserve space in the .o files. We do this
548 by putting uninitialized data and runtime initialized data into
549 .common instead of .data at the expense of not flagging multiple
552 int flag_conserve_space;
554 /* Nonzero if we want to obey access control semantics. */
556 int flag_access_control = 1;
558 /* Nonzero if we want to check the return value of new and avoid calling
559 constructors if it is a null pointer. */
563 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
564 initialization variables.
565 0: Old rules, set by -fno-for-scope.
566 2: New ISO rules, set by -ffor-scope.
567 1: Try to implement new ISO rules, but with backup compatibility
568 (and warnings). This is the default, for now. */
570 int flag_new_for_scope = 1;
572 /* Nonzero if we want to emit defined symbols with common-like linkage as
573 weak symbols where possible, in order to conform to C++ semantics.
574 Otherwise, emit them as local symbols. */
578 /* 0 means we want the preprocessor to not emit line directives for
579 the current working directory. 1 means we want it to do it. -1
580 means we should decide depending on whether debugging information
581 is being emitted or not. */
583 int flag_working_directory = -1;
585 /* Nonzero to use __cxa_atexit, rather than atexit, to register
586 destructors for local statics and global objects. */
588 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
590 /* Nonzero means make the default pedwarns warnings instead of errors.
591 The value of this flag is ignored if -pedantic is specified. */
595 /* Nonzero means to implement standard semantics for exception
596 specifications, calling unexpected if an exception is thrown that
597 doesn't match the specification. Zero means to treat them as
598 assertions and optimize accordingly, but not check them. */
600 int flag_enforce_eh_specs = 1;
602 /* Nonzero means warn about things that will change when compiling
603 with an ABI-compliant compiler. */
607 /* Nonzero means warn about invalid uses of offsetof. */
609 int warn_invalid_offsetof = 1;
611 /* Nonzero means warn about implicit declarations. */
613 int warn_implicit = 1;
615 /* Nonzero means warn when all ctors or dtors are private, and the class
618 int warn_ctor_dtor_privacy = 0;
620 /* Nonzero means warn in function declared in derived class has the
621 same name as a virtual in the base class, but fails to match the
622 type signature of any virtual function in the base class. */
624 int warn_overloaded_virtual;
626 /* Nonzero means warn when declaring a class that has a non virtual
627 destructor, when it really ought to have a virtual one. */
631 /* Nonzero means warn when the compiler will reorder code. */
635 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
639 /* Nonzero means warn when we convert a pointer to member function
640 into a pointer to (void or function). */
642 int warn_pmf2ptr = 1;
644 /* Nonzero means warn about violation of some Effective C++ style rules. */
648 /* Nonzero means warn where overload resolution chooses a promotion from
649 unsigned to signed over a conversion to an unsigned of the same size. */
653 /* Nonzero means warn when an old-style cast is used. */
655 int warn_old_style_cast;
657 /* Nonzero means warn when non-templatized friend functions are
658 declared within a template */
660 int warn_nontemplate_friend = 1;
662 /* Nonzero means complain about deprecated features. */
664 int warn_deprecated = 1;
666 /* Maximum template instantiation depth. This limit is rather
667 arbitrary, but it exists to limit the time it takes to notice
668 infinite template instantiations. */
670 int max_tinst_depth = 500;
674 /* The elements of `ridpointers' are identifier nodes for the reserved
675 type names and storage classes. It is indexed by a RID_... value. */
678 tree (*make_fname_decl) (tree, int);
680 /* If non-NULL, the address of a language-specific function that takes
681 any action required right before expand_function_end is called. */
682 void (*lang_expand_function_end) (void);
684 /* Nonzero means the expression being parsed will never be evaluated.
685 This is a count, since unevaluated expressions can nest. */
688 /* Information about how a function name is generated. */
691 tree *const decl; /* pointer to the VAR_DECL. */
692 const unsigned rid; /* RID number for the identifier. */
693 const int pretty; /* How pretty is it? */
696 /* The three ways of getting then name of the current function. */
698 const struct fname_var_t fname_vars[] =
700 /* C99 compliant __func__, must be first. */
701 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
702 /* GCC __FUNCTION__ compliant. */
703 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
704 /* GCC __PRETTY_FUNCTION__ compliant. */
705 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
709 static int constant_fits_type_p (tree, tree);
711 /* Keep a stack of if statements. We record the number of compound
712 statements seen up to the if keyword, as well as the line number
713 and file of the if. If a potentially ambiguous else is seen, that
714 fact is recorded; the warning is issued when we can be sure that
715 the enclosing if statement does not have an else branch. */
724 static if_elt *if_stack;
726 /* Amount of space in the if statement stack. */
727 static int if_stack_space = 0;
730 static int if_stack_pointer = 0;
732 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
733 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
734 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
735 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
736 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
737 static tree handle_always_inline_attribute (tree *, tree, tree, int,
739 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
740 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
741 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
742 static tree handle_transparent_union_attribute (tree *, tree, tree,
744 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
745 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
746 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
747 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
748 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
749 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
750 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
751 static tree handle_visibility_attribute (tree *, tree, tree, int,
753 static tree handle_tls_model_attribute (tree *, tree, tree, int,
755 static tree handle_no_instrument_function_attribute (tree *, tree,
757 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
758 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
760 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
761 static tree handle_deprecated_attribute (tree *, tree, tree, int,
763 static tree handle_vector_size_attribute (tree *, tree, tree, int,
765 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
766 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
767 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
768 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
770 static tree vector_size_helper (tree, tree);
772 static void check_function_nonnull (tree, tree);
773 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
774 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
775 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
776 static int resort_field_decl_cmp (const void *, const void *);
778 /* Table of machine-independent attributes common to all C-like languages. */
779 const struct attribute_spec c_common_attribute_table[] =
781 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
782 { "packed", 0, 0, false, false, false,
783 handle_packed_attribute },
784 { "nocommon", 0, 0, true, false, false,
785 handle_nocommon_attribute },
786 { "common", 0, 0, true, false, false,
787 handle_common_attribute },
788 /* FIXME: logically, noreturn attributes should be listed as
789 "false, true, true" and apply to function types. But implementing this
790 would require all the places in the compiler that use TREE_THIS_VOLATILE
791 on a decl to identify non-returning functions to be located and fixed
792 to check the function type instead. */
793 { "noreturn", 0, 0, true, false, false,
794 handle_noreturn_attribute },
795 { "volatile", 0, 0, true, false, false,
796 handle_noreturn_attribute },
797 { "noinline", 0, 0, true, false, false,
798 handle_noinline_attribute },
799 { "always_inline", 0, 0, true, false, false,
800 handle_always_inline_attribute },
801 { "used", 0, 0, true, false, false,
802 handle_used_attribute },
803 { "unused", 0, 0, false, false, false,
804 handle_unused_attribute },
805 /* The same comments as for noreturn attributes apply to const ones. */
806 { "const", 0, 0, true, false, false,
807 handle_const_attribute },
808 { "transparent_union", 0, 0, false, false, false,
809 handle_transparent_union_attribute },
810 { "constructor", 0, 0, true, false, false,
811 handle_constructor_attribute },
812 { "destructor", 0, 0, true, false, false,
813 handle_destructor_attribute },
814 { "mode", 1, 1, false, true, false,
815 handle_mode_attribute },
816 { "section", 1, 1, true, false, false,
817 handle_section_attribute },
818 { "aligned", 0, 1, false, false, false,
819 handle_aligned_attribute },
820 { "weak", 0, 0, true, false, false,
821 handle_weak_attribute },
822 { "alias", 1, 1, true, false, false,
823 handle_alias_attribute },
824 { "no_instrument_function", 0, 0, true, false, false,
825 handle_no_instrument_function_attribute },
826 { "malloc", 0, 0, true, false, false,
827 handle_malloc_attribute },
828 { "no_stack_limit", 0, 0, true, false, false,
829 handle_no_limit_stack_attribute },
830 { "pure", 0, 0, true, false, false,
831 handle_pure_attribute },
832 { "deprecated", 0, 0, false, false, false,
833 handle_deprecated_attribute },
834 { "vector_size", 1, 1, false, true, false,
835 handle_vector_size_attribute },
836 { "visibility", 1, 1, true, false, false,
837 handle_visibility_attribute },
838 { "tls_model", 1, 1, true, false, false,
839 handle_tls_model_attribute },
840 { "nonnull", 0, -1, false, true, true,
841 handle_nonnull_attribute },
842 { "nothrow", 0, 0, true, false, false,
843 handle_nothrow_attribute },
844 { "may_alias", 0, 0, false, true, false, NULL },
845 { "cleanup", 1, 1, true, false, false,
846 handle_cleanup_attribute },
847 { "warn_unused_result", 0, 0, false, true, true,
848 handle_warn_unused_result_attribute },
849 { NULL, 0, 0, false, false, false, NULL }
852 /* Give the specifications for the format attributes, used by C and all
855 const struct attribute_spec c_common_format_attribute_table[] =
857 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
858 { "format", 3, 3, false, true, true,
859 handle_format_attribute },
860 { "format_arg", 1, 1, false, true, true,
861 handle_format_arg_attribute },
862 { NULL, 0, 0, false, false, false, NULL }
865 /* Record the start of an if-then, and record the start of it
866 for ambiguous else detection.
868 COND is the condition for the if-then statement.
870 IF_STMT is the statement node that has already been created for
871 this if-then statement. It is created before parsing the
872 condition to keep line number information accurate. */
875 c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
877 /* Make sure there is enough space on the stack. */
878 if (if_stack_space == 0)
881 if_stack = xmalloc (10 * sizeof (if_elt));
883 else if (if_stack_space == if_stack_pointer)
885 if_stack_space += 10;
886 if_stack = xrealloc (if_stack, if_stack_space * sizeof (if_elt));
889 IF_COND (if_stmt) = cond;
892 /* Record this if statement. */
893 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
894 if_stack[if_stack_pointer].locus = input_location;
895 if_stack[if_stack_pointer].needs_warning = 0;
896 if_stack[if_stack_pointer].if_stmt = if_stmt;
900 /* Called after the then-clause for an if-statement is processed. */
905 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
906 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
909 /* Record the end of an if-then. Optionally warn if a nested
910 if statement had an ambiguous else clause. */
913 c_expand_end_cond (void)
916 if (if_stack[if_stack_pointer].needs_warning)
917 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
918 &if_stack[if_stack_pointer].locus);
919 last_expr_type = NULL_TREE;
922 /* Called between the then-clause and the else-clause
923 of an if-then-else. */
926 c_expand_start_else (void)
928 /* An ambiguous else warning must be generated for the enclosing if
929 statement, unless we see an else branch for that one, too. */
931 && if_stack_pointer > 1
932 && (if_stack[if_stack_pointer - 1].compstmt_count
933 == if_stack[if_stack_pointer - 2].compstmt_count))
934 if_stack[if_stack_pointer - 2].needs_warning = 1;
936 /* Even if a nested if statement had an else branch, it can't be
937 ambiguous if this one also has an else. So don't warn in that
938 case. Also don't warn for any if statements nested in this else. */
939 if_stack[if_stack_pointer - 1].needs_warning = 0;
940 if_stack[if_stack_pointer - 1].compstmt_count--;
943 /* Called after the else-clause for an if-statement is processed. */
948 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
949 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
952 /* Begin an if-statement. Returns a newly created IF_STMT if
955 Unlike the C++ front-end, we do not call add_stmt here; it is
956 probably safe to do so, but I am not very familiar with this
957 code so I am being extra careful not to change its behavior
958 beyond what is strictly necessary for correctness. */
961 c_begin_if_stmt (void)
964 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
968 /* Begin a while statement. Returns a newly created WHILE_STMT if
971 Unlike the C++ front-end, we do not call add_stmt here; it is
972 probably safe to do so, but I am not very familiar with this
973 code so I am being extra careful not to change its behavior
974 beyond what is strictly necessary for correctness. */
977 c_begin_while_stmt (void)
980 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
985 c_finish_while_stmt_cond (tree cond, tree while_stmt)
987 WHILE_COND (while_stmt) = cond;
990 /* Push current bindings for the function name VAR_DECLS. */
993 start_fname_decls (void)
996 tree saved = NULL_TREE;
998 for (ix = 0; fname_vars[ix].decl; ix++)
1000 tree decl = *fname_vars[ix].decl;
1004 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
1005 *fname_vars[ix].decl = NULL_TREE;
1008 if (saved || saved_function_name_decls)
1009 /* Normally they'll have been NULL, so only push if we've got a
1010 stack, or they are non-NULL. */
1011 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1012 saved_function_name_decls);
1015 /* Finish up the current bindings, adding them into the
1016 current function's statement tree. This is done by wrapping the
1017 function's body in a COMPOUND_STMT containing these decls too. This
1018 must be done _before_ finish_stmt_tree is called. If there is no
1019 current function, we must be at file scope and no statements are
1020 involved. Pop the previous bindings. */
1023 finish_fname_decls (void)
1026 tree body = NULL_TREE;
1027 tree stack = saved_function_name_decls;
1029 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1030 body = chainon (TREE_VALUE (stack), body);
1034 /* They were called into existence, so add to statement tree. Add
1035 the DECL_STMTs inside the outermost scope. */
1036 tree *p = &DECL_SAVED_TREE (current_function_decl);
1037 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1038 while (TREE_CODE (*p) != COMPOUND_STMT)
1040 if (TREE_CODE (*p) == EXPR_STMT)
1041 p = &TREE_CHAIN (*p);
1043 p = &TREE_OPERAND(*p, 0);
1046 p = &COMPOUND_BODY (*p);
1047 if (TREE_CODE (*p) == SCOPE_STMT)
1048 p = &TREE_CHAIN (*p);
1050 body = chainon (body, *p);
1054 for (ix = 0; fname_vars[ix].decl; ix++)
1055 *fname_vars[ix].decl = NULL_TREE;
1059 /* We had saved values, restore them. */
1062 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1064 tree decl = TREE_PURPOSE (saved);
1065 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1067 *fname_vars[ix].decl = decl;
1069 stack = TREE_CHAIN (stack);
1071 saved_function_name_decls = stack;
1074 /* Return the text name of the current function, suitably prettified
1078 fname_as_string (int pretty_p)
1080 const char *name = "top level";
1089 if (current_function_decl)
1090 name = (*lang_hooks.decl_printable_name) (current_function_decl, vrb);
1095 /* Return the VAR_DECL for a const char array naming the current
1096 function. If the VAR_DECL has not yet been created, create it
1097 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1098 ID is its name (unfortunately C and C++ hold the RID values of
1099 keywords in different places, so we can't derive RID from ID in
1100 this language independent code. */
1103 fname_decl (unsigned int rid, tree id)
1106 tree decl = NULL_TREE;
1108 for (ix = 0; fname_vars[ix].decl; ix++)
1109 if (fname_vars[ix].rid == rid)
1112 decl = *fname_vars[ix].decl;
1115 tree saved_last_tree = last_tree;
1116 /* If a tree is built here, it would normally have the lineno of
1117 the current statement. Later this tree will be moved to the
1118 beginning of the function and this line number will be wrong.
1119 To avoid this problem set the lineno to 0 here; that prevents
1120 it from appearing in the RTL. */
1121 int saved_lineno = input_line;
1124 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1125 if (last_tree != saved_last_tree)
1127 /* We created some statement tree for the decl. This belongs
1128 at the start of the function, so remove it now and reinsert
1129 it after the function is complete. */
1130 tree stmts = TREE_CHAIN (saved_last_tree);
1132 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1133 last_tree = saved_last_tree;
1134 saved_function_name_decls = tree_cons (decl, stmts,
1135 saved_function_name_decls);
1137 *fname_vars[ix].decl = decl;
1138 input_line = saved_lineno;
1140 if (!ix && !current_function_decl)
1141 pedwarn ("%J'%D' is not defined outside of function scope", decl, decl);
1146 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1149 fix_string_type (tree value)
1151 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1152 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1153 const int nchars_max = flag_isoc99 ? 4095 : 509;
1154 int length = TREE_STRING_LENGTH (value);
1157 /* Compute the number of elements, for the array type. */
1158 nchars = wide_flag ? length / wchar_bytes : length;
1160 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1161 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1162 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1164 /* Create the array type for the string constant.
1165 -Wwrite-strings says make the string constant an array of const char
1166 so that copying it to a non-const pointer will get a warning.
1167 For C++, this is the standard behavior. */
1168 if (flag_const_strings && ! flag_writable_strings)
1171 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1174 = build_array_type (elements,
1175 build_index_type (build_int_2 (nchars - 1, 0)));
1179 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1180 build_index_type (build_int_2 (nchars - 1, 0)));
1182 TREE_CONSTANT (value) = 1;
1183 TREE_READONLY (value) = ! flag_writable_strings;
1184 TREE_STATIC (value) = 1;
1188 /* Print a warning if a constant expression had overflow in folding.
1189 Invoke this function on every expression that the language
1190 requires to be a constant expression.
1191 Note the ANSI C standard says it is erroneous for a
1192 constant expression to overflow. */
1195 constant_expression_warning (tree value)
1197 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1198 || TREE_CODE (value) == VECTOR_CST
1199 || TREE_CODE (value) == COMPLEX_CST)
1200 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1201 pedwarn ("overflow in constant expression");
1204 /* Print a warning if an expression had overflow in folding.
1205 Invoke this function on every expression that
1206 (1) appears in the source code, and
1207 (2) might be a constant expression that overflowed, and
1208 (3) is not already checked by convert_and_check;
1209 however, do not invoke this function on operands of explicit casts. */
1212 overflow_warning (tree value)
1214 if ((TREE_CODE (value) == INTEGER_CST
1215 || (TREE_CODE (value) == COMPLEX_CST
1216 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1217 && TREE_OVERFLOW (value))
1219 TREE_OVERFLOW (value) = 0;
1220 if (skip_evaluation == 0)
1221 warning ("integer overflow in expression");
1223 else if ((TREE_CODE (value) == REAL_CST
1224 || (TREE_CODE (value) == COMPLEX_CST
1225 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1226 && TREE_OVERFLOW (value))
1228 TREE_OVERFLOW (value) = 0;
1229 if (skip_evaluation == 0)
1230 warning ("floating point overflow in expression");
1232 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1234 TREE_OVERFLOW (value) = 0;
1235 if (skip_evaluation == 0)
1236 warning ("vector overflow in expression");
1240 /* Print a warning if a large constant is truncated to unsigned,
1241 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1242 Invoke this function on every expression that might be implicitly
1243 converted to an unsigned type. */
1246 unsigned_conversion_warning (tree result, tree operand)
1248 tree type = TREE_TYPE (result);
1250 if (TREE_CODE (operand) == INTEGER_CST
1251 && TREE_CODE (type) == INTEGER_TYPE
1252 && TREE_UNSIGNED (type)
1253 && skip_evaluation == 0
1254 && !int_fits_type_p (operand, type))
1256 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1257 /* This detects cases like converting -129 or 256 to unsigned char. */
1258 warning ("large integer implicitly truncated to unsigned type");
1259 else if (warn_conversion)
1260 warning ("negative integer implicitly converted to unsigned type");
1264 /* Nonzero if constant C has a value that is permissible
1265 for type TYPE (an INTEGER_TYPE). */
1268 constant_fits_type_p (tree c, tree type)
1270 if (TREE_CODE (c) == INTEGER_CST)
1271 return int_fits_type_p (c, type);
1273 c = convert (type, c);
1274 return !TREE_OVERFLOW (c);
1277 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1278 Invoke this function on every expression that is converted implicitly,
1279 i.e. because of language rules and not because of an explicit cast. */
1282 convert_and_check (tree type, tree expr)
1284 tree t = convert (type, expr);
1285 if (TREE_CODE (t) == INTEGER_CST)
1287 if (TREE_OVERFLOW (t))
1289 TREE_OVERFLOW (t) = 0;
1291 /* Do not diagnose overflow in a constant expression merely
1292 because a conversion overflowed. */
1293 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1295 /* No warning for converting 0x80000000 to int. */
1296 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1297 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1298 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1299 /* If EXPR fits in the unsigned version of TYPE,
1300 don't warn unless pedantic. */
1302 || TREE_UNSIGNED (type)
1303 || ! constant_fits_type_p (expr,
1304 c_common_unsigned_type (type)))
1305 && skip_evaluation == 0)
1306 warning ("overflow in implicit constant conversion");
1309 unsigned_conversion_warning (t, expr);
1314 /* A node in a list that describes references to variables (EXPR), which are
1315 either read accesses if WRITER is zero, or write accesses, in which case
1316 WRITER is the parent of EXPR. */
1323 /* Used to implement a cache the results of a call to verify_tree. We only
1324 use this for SAVE_EXPRs. */
1327 struct tlist_cache *next;
1328 struct tlist *cache_before_sp;
1329 struct tlist *cache_after_sp;
1333 /* Obstack to use when allocating tlist structures, and corresponding
1335 static struct obstack tlist_obstack;
1336 static char *tlist_firstobj = 0;
1338 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1340 static struct tlist *warned_ids;
1341 /* SAVE_EXPRs need special treatment. We process them only once and then
1342 cache the results. */
1343 static struct tlist_cache *save_expr_cache;
1345 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1346 static void merge_tlist (struct tlist **, struct tlist *, int);
1347 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1348 static int warning_candidate_p (tree);
1349 static void warn_for_collisions (struct tlist *);
1350 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1351 static struct tlist *new_tlist (struct tlist *, tree, tree);
1352 static void verify_sequence_points (tree);
1354 /* Create a new struct tlist and fill in its fields. */
1355 static struct tlist *
1356 new_tlist (struct tlist *next, tree t, tree writer)
1359 l = obstack_alloc (&tlist_obstack, sizeof *l);
1366 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1367 is nonnull, we ignore any node we find which has a writer equal to it. */
1370 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1374 struct tlist *next = add->next;
1377 if (! exclude_writer || add->writer != exclude_writer)
1378 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1383 /* Merge the nodes of ADD into TO. This merging process is done so that for
1384 each variable that already exists in TO, no new node is added; however if
1385 there is a write access recorded in ADD, and an occurrence on TO is only
1386 a read access, then the occurrence in TO will be modified to record the
1390 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1392 struct tlist **end = to;
1395 end = &(*end)->next;
1401 struct tlist *next = add->next;
1403 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1404 if (tmp2->expr == add->expr)
1408 tmp2->writer = add->writer;
1412 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1413 end = &(*end)->next;
1420 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1421 references in list LIST conflict with it, excluding reads if ONLY writers
1425 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1430 /* Avoid duplicate warnings. */
1431 for (tmp = warned_ids; tmp; tmp = tmp->next)
1432 if (tmp->expr == written)
1437 if (list->expr == written
1438 && list->writer != writer
1439 && (! only_writes || list->writer))
1441 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1442 warning ("operation on `%s' may be undefined",
1443 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1449 /* Given a list LIST of references to variables, find whether any of these
1450 can cause conflicts due to missing sequence points. */
1453 warn_for_collisions (struct tlist *list)
1457 for (tmp = list; tmp; tmp = tmp->next)
1460 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1464 /* Return nonzero if X is a tree that can be verified by the sequence point
1467 warning_candidate_p (tree x)
1469 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1472 /* Walk the tree X, and record accesses to variables. If X is written by the
1473 parent tree, WRITER is the parent.
1474 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1475 expression or its only operand forces a sequence point, then everything up
1476 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1478 Once we return, we will have emitted warnings if any subexpression before
1479 such a sequence point could be undefined. On a higher level, however, the
1480 sequence point may not be relevant, and we'll merge the two lists.
1482 Example: (b++, a) + b;
1483 The call that processes the COMPOUND_EXPR will store the increment of B
1484 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1485 processes the PLUS_EXPR will need to merge the two lists so that
1486 eventually, all accesses end up on the same list (and we'll warn about the
1487 unordered subexpressions b++ and b.
1489 A note on merging. If we modify the former example so that our expression
1492 care must be taken not simply to add all three expressions into the final
1493 PNO_SP list. The function merge_tlist takes care of that by merging the
1494 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1495 way, so that no more than one access to B is recorded. */
1498 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1501 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1502 enum tree_code code;
1505 /* X may be NULL if it is the operand of an empty statement expression
1511 code = TREE_CODE (x);
1512 class = TREE_CODE_CLASS (code);
1514 if (warning_candidate_p (x))
1516 *pno_sp = new_tlist (*pno_sp, x, writer);
1526 case TRUTH_ANDIF_EXPR:
1527 case TRUTH_ORIF_EXPR:
1528 tmp_before = tmp_nosp = tmp_list3 = 0;
1529 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1530 warn_for_collisions (tmp_nosp);
1531 merge_tlist (pbefore_sp, tmp_before, 0);
1532 merge_tlist (pbefore_sp, tmp_nosp, 0);
1533 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1534 merge_tlist (pbefore_sp, tmp_list3, 0);
1538 tmp_before = tmp_list2 = 0;
1539 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1540 warn_for_collisions (tmp_list2);
1541 merge_tlist (pbefore_sp, tmp_before, 0);
1542 merge_tlist (pbefore_sp, tmp_list2, 1);
1544 tmp_list3 = tmp_nosp = 0;
1545 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1546 warn_for_collisions (tmp_nosp);
1547 merge_tlist (pbefore_sp, tmp_list3, 0);
1549 tmp_list3 = tmp_list2 = 0;
1550 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1551 warn_for_collisions (tmp_list2);
1552 merge_tlist (pbefore_sp, tmp_list3, 0);
1553 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1554 two first, to avoid warning for (a ? b++ : b++). */
1555 merge_tlist (&tmp_nosp, tmp_list2, 0);
1556 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1559 case PREDECREMENT_EXPR:
1560 case PREINCREMENT_EXPR:
1561 case POSTDECREMENT_EXPR:
1562 case POSTINCREMENT_EXPR:
1563 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1567 tmp_before = tmp_nosp = tmp_list3 = 0;
1568 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1569 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1570 /* Expressions inside the LHS are not ordered wrt. the sequence points
1571 in the RHS. Example:
1573 Despite the fact that the modification of "a" is in the before_sp
1574 list (tmp_before), it conflicts with the use of "a" in the LHS.
1575 We can handle this by adding the contents of tmp_list3
1576 to those of tmp_before, and redoing the collision warnings for that
1578 add_tlist (&tmp_before, tmp_list3, x, 1);
1579 warn_for_collisions (tmp_before);
1580 /* Exclude the LHS itself here; we first have to merge it into the
1581 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1582 didn't exclude the LHS, we'd get it twice, once as a read and once
1584 add_tlist (pno_sp, tmp_list3, x, 0);
1585 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1587 merge_tlist (pbefore_sp, tmp_before, 0);
1588 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1589 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1590 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1594 /* We need to warn about conflicts among arguments and conflicts between
1595 args and the function address. Side effects of the function address,
1596 however, are not ordered by the sequence point of the call. */
1597 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1598 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1599 if (TREE_OPERAND (x, 1))
1600 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1601 merge_tlist (&tmp_list3, tmp_list2, 0);
1602 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1603 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1604 warn_for_collisions (tmp_before);
1605 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1609 /* Scan all the list, e.g. indices of multi dimensional array. */
1612 tmp_before = tmp_nosp = 0;
1613 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1614 merge_tlist (&tmp_nosp, tmp_before, 0);
1615 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1622 struct tlist_cache *t;
1623 for (t = save_expr_cache; t; t = t->next)
1629 t = obstack_alloc (&tlist_obstack, sizeof *t);
1630 t->next = save_expr_cache;
1632 save_expr_cache = t;
1634 tmp_before = tmp_nosp = 0;
1635 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1636 warn_for_collisions (tmp_nosp);
1641 struct tlist *t = tmp_nosp;
1643 merge_tlist (&tmp_list3, t, 0);
1645 t->cache_before_sp = tmp_before;
1646 t->cache_after_sp = tmp_list3;
1648 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1649 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1658 if (first_rtl_op (code) == 0)
1660 x = TREE_OPERAND (x, 0);
1676 int max = first_rtl_op (TREE_CODE (x));
1677 for (lp = 0; lp < max; lp++)
1679 tmp_before = tmp_nosp = 0;
1680 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1681 merge_tlist (&tmp_nosp, tmp_before, 0);
1682 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1689 /* Try to warn for undefined behavior in EXPR due to missing sequence
1693 verify_sequence_points (tree expr)
1695 struct tlist *before_sp = 0, *after_sp = 0;
1698 save_expr_cache = 0;
1699 if (tlist_firstobj == 0)
1701 gcc_obstack_init (&tlist_obstack);
1702 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1705 verify_tree (expr, &before_sp, &after_sp, 0);
1706 warn_for_collisions (after_sp);
1707 obstack_free (&tlist_obstack, tlist_firstobj);
1711 c_expand_expr_stmt (tree expr)
1713 /* Do default conversion if safe and possibly important,
1714 in case within ({...}). */
1715 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1716 && (flag_isoc99 || lvalue_p (expr)))
1717 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1718 expr = default_conversion (expr);
1720 if (warn_sequence_point)
1721 verify_sequence_points (expr);
1723 if (TREE_TYPE (expr) != error_mark_node
1724 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1725 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1726 error ("expression statement has incomplete type");
1728 last_expr_type = TREE_TYPE (expr);
1729 return add_stmt (build_stmt (EXPR_STMT, expr));
1732 /* Validate the expression after `case' and apply default promotions. */
1735 check_case_value (tree value)
1737 if (value == NULL_TREE)
1740 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1741 STRIP_TYPE_NOPS (value);
1742 /* In C++, the following is allowed:
1745 switch (...) { case i: ... }
1747 So, we try to reduce the VALUE to a constant that way. */
1748 if (c_dialect_cxx ())
1750 value = decl_constant_value (value);
1751 STRIP_TYPE_NOPS (value);
1752 value = fold (value);
1755 if (TREE_CODE (value) != INTEGER_CST
1756 && value != error_mark_node)
1758 error ("case label does not reduce to an integer constant");
1759 value = error_mark_node;
1762 /* Promote char or short to int. */
1763 value = default_conversion (value);
1765 constant_expression_warning (value);
1770 /* Return an integer type with BITS bits of precision,
1771 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1774 c_common_type_for_size (unsigned int bits, int unsignedp)
1776 if (bits == TYPE_PRECISION (integer_type_node))
1777 return unsignedp ? unsigned_type_node : integer_type_node;
1779 if (bits == TYPE_PRECISION (signed_char_type_node))
1780 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1782 if (bits == TYPE_PRECISION (short_integer_type_node))
1783 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1785 if (bits == TYPE_PRECISION (long_integer_type_node))
1786 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1788 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1789 return (unsignedp ? long_long_unsigned_type_node
1790 : long_long_integer_type_node);
1792 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1793 return (unsignedp ? widest_unsigned_literal_type_node
1794 : widest_integer_literal_type_node);
1796 if (bits <= TYPE_PRECISION (intQI_type_node))
1797 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1799 if (bits <= TYPE_PRECISION (intHI_type_node))
1800 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1802 if (bits <= TYPE_PRECISION (intSI_type_node))
1803 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1805 if (bits <= TYPE_PRECISION (intDI_type_node))
1806 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1811 /* Used for communication between c_common_type_for_mode and
1812 c_register_builtin_type. */
1813 static GTY(()) tree registered_builtin_types;
1815 /* Return a data type that has machine mode MODE.
1816 If the mode is an integer,
1817 then UNSIGNEDP selects between signed and unsigned types. */
1820 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1824 if (mode == TYPE_MODE (integer_type_node))
1825 return unsignedp ? unsigned_type_node : integer_type_node;
1827 if (mode == TYPE_MODE (signed_char_type_node))
1828 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1830 if (mode == TYPE_MODE (short_integer_type_node))
1831 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1833 if (mode == TYPE_MODE (long_integer_type_node))
1834 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1836 if (mode == TYPE_MODE (long_long_integer_type_node))
1837 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1839 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1840 return unsignedp ? widest_unsigned_literal_type_node
1841 : widest_integer_literal_type_node;
1844 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1847 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1850 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1853 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1855 #if HOST_BITS_PER_WIDE_INT >= 64
1856 if (mode == TYPE_MODE (intTI_type_node))
1857 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1860 if (mode == TYPE_MODE (float_type_node))
1861 return float_type_node;
1863 if (mode == TYPE_MODE (double_type_node))
1864 return double_type_node;
1866 if (mode == TYPE_MODE (long_double_type_node))
1867 return long_double_type_node;
1869 if (mode == TYPE_MODE (void_type_node))
1870 return void_type_node;
1872 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1873 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1875 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1876 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1881 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1883 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1885 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
1887 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
1889 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
1891 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
1893 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
1895 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
1897 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
1899 return V16SF_type_node;
1901 return V4SF_type_node;
1903 return V2SF_type_node;
1905 return V2DF_type_node;
1907 return V4DF_type_node;
1912 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1913 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1914 return TREE_VALUE (t);
1919 /* Return an unsigned type the same as TYPE in other respects. */
1921 c_common_unsigned_type (tree type)
1923 tree type1 = TYPE_MAIN_VARIANT (type);
1924 if (type1 == signed_char_type_node || type1 == char_type_node)
1925 return unsigned_char_type_node;
1926 if (type1 == integer_type_node)
1927 return unsigned_type_node;
1928 if (type1 == short_integer_type_node)
1929 return short_unsigned_type_node;
1930 if (type1 == long_integer_type_node)
1931 return long_unsigned_type_node;
1932 if (type1 == long_long_integer_type_node)
1933 return long_long_unsigned_type_node;
1934 if (type1 == widest_integer_literal_type_node)
1935 return widest_unsigned_literal_type_node;
1936 #if HOST_BITS_PER_WIDE_INT >= 64
1937 if (type1 == intTI_type_node)
1938 return unsigned_intTI_type_node;
1940 if (type1 == intDI_type_node)
1941 return unsigned_intDI_type_node;
1942 if (type1 == intSI_type_node)
1943 return unsigned_intSI_type_node;
1944 if (type1 == intHI_type_node)
1945 return unsigned_intHI_type_node;
1946 if (type1 == intQI_type_node)
1947 return unsigned_intQI_type_node;
1949 return c_common_signed_or_unsigned_type (1, type);
1952 /* Return a signed type the same as TYPE in other respects. */
1955 c_common_signed_type (tree type)
1957 tree type1 = TYPE_MAIN_VARIANT (type);
1958 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1959 return signed_char_type_node;
1960 if (type1 == unsigned_type_node)
1961 return integer_type_node;
1962 if (type1 == short_unsigned_type_node)
1963 return short_integer_type_node;
1964 if (type1 == long_unsigned_type_node)
1965 return long_integer_type_node;
1966 if (type1 == long_long_unsigned_type_node)
1967 return long_long_integer_type_node;
1968 if (type1 == widest_unsigned_literal_type_node)
1969 return widest_integer_literal_type_node;
1970 #if HOST_BITS_PER_WIDE_INT >= 64
1971 if (type1 == unsigned_intTI_type_node)
1972 return intTI_type_node;
1974 if (type1 == unsigned_intDI_type_node)
1975 return intDI_type_node;
1976 if (type1 == unsigned_intSI_type_node)
1977 return intSI_type_node;
1978 if (type1 == unsigned_intHI_type_node)
1979 return intHI_type_node;
1980 if (type1 == unsigned_intQI_type_node)
1981 return intQI_type_node;
1983 return c_common_signed_or_unsigned_type (0, type);
1986 /* Return a type the same as TYPE except unsigned or
1987 signed according to UNSIGNEDP. */
1990 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1992 if (! INTEGRAL_TYPE_P (type)
1993 || TREE_UNSIGNED (type) == unsignedp)
1996 /* Must check the mode of the types, not the precision. Enumeral types
1997 in C++ have precision set to match their range, but may use a wider
1998 mode to match an ABI. If we change modes, we may wind up with bad
2001 if (TYPE_MODE (type) == TYPE_MODE (signed_char_type_node))
2002 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2003 if (TYPE_MODE (type) == TYPE_MODE (integer_type_node))
2004 return unsignedp ? unsigned_type_node : integer_type_node;
2005 if (TYPE_MODE (type) == TYPE_MODE (short_integer_type_node))
2006 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2007 if (TYPE_MODE (type) == TYPE_MODE (long_integer_type_node))
2008 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2009 if (TYPE_MODE (type) == TYPE_MODE (long_long_integer_type_node))
2010 return (unsignedp ? long_long_unsigned_type_node
2011 : long_long_integer_type_node);
2012 if (TYPE_MODE (type) == TYPE_MODE (widest_integer_literal_type_node))
2013 return (unsignedp ? widest_unsigned_literal_type_node
2014 : widest_integer_literal_type_node);
2016 #if HOST_BITS_PER_WIDE_INT >= 64
2017 if (TYPE_MODE (type) == TYPE_MODE (intTI_type_node))
2018 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2020 if (TYPE_MODE (type) == TYPE_MODE (intDI_type_node))
2021 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2022 if (TYPE_MODE (type) == TYPE_MODE (intSI_type_node))
2023 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2024 if (TYPE_MODE (type) == TYPE_MODE (intHI_type_node))
2025 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2026 if (TYPE_MODE (type) == TYPE_MODE (intQI_type_node))
2027 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2032 /* The C version of the register_builtin_type langhook. */
2035 c_register_builtin_type (tree type, const char* name)
2039 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2040 DECL_ARTIFICIAL (decl) = 1;
2041 if (!TYPE_NAME (type))
2042 TYPE_NAME (type) = decl;
2045 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
2049 /* Return the minimum number of bits needed to represent VALUE in a
2050 signed or unsigned type, UNSIGNEDP says which. */
2053 min_precision (tree value, int unsignedp)
2057 /* If the value is negative, compute its negative minus 1. The latter
2058 adjustment is because the absolute value of the largest negative value
2059 is one larger than the largest positive value. This is equivalent to
2060 a bit-wise negation, so use that operation instead. */
2062 if (tree_int_cst_sgn (value) < 0)
2063 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2065 /* Return the number of bits needed, taking into account the fact
2066 that we need one more bit for a signed than unsigned type. */
2068 if (integer_zerop (value))
2071 log = tree_floor_log2 (value);
2073 return log + 1 + ! unsignedp;
2076 /* Print an error message for invalid operands to arith operation
2077 CODE. NOP_EXPR is used as a special case (see
2078 c_common_truthvalue_conversion). */
2081 binary_op_error (enum tree_code code)
2088 error ("invalid truth-value expression");
2092 opname = "+"; break;
2094 opname = "-"; break;
2096 opname = "*"; break;
2098 opname = "max"; break;
2100 opname = "min"; break;
2102 opname = "=="; break;
2104 opname = "!="; break;
2106 opname = "<="; break;
2108 opname = ">="; break;
2110 opname = "<"; break;
2112 opname = ">"; break;
2114 opname = "<<"; break;
2116 opname = ">>"; break;
2117 case TRUNC_MOD_EXPR:
2118 case FLOOR_MOD_EXPR:
2119 opname = "%"; break;
2120 case TRUNC_DIV_EXPR:
2121 case FLOOR_DIV_EXPR:
2122 opname = "/"; break;
2124 opname = "&"; break;
2126 opname = "|"; break;
2127 case TRUTH_ANDIF_EXPR:
2128 opname = "&&"; break;
2129 case TRUTH_ORIF_EXPR:
2130 opname = "||"; break;
2132 opname = "^"; break;
2135 opname = "rotate"; break;
2137 opname = "unknown"; break;
2139 error ("invalid operands to binary %s", opname);
2142 /* Subroutine of build_binary_op, used for comparison operations.
2143 See if the operands have both been converted from subword integer types
2144 and, if so, perhaps change them both back to their original type.
2145 This function is also responsible for converting the two operands
2146 to the proper common type for comparison.
2148 The arguments of this function are all pointers to local variables
2149 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2150 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2152 If this function returns nonzero, it means that the comparison has
2153 a constant value. What this function returns is an expression for
2157 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2158 enum tree_code *rescode_ptr)
2161 tree op0 = *op0_ptr;
2162 tree op1 = *op1_ptr;
2163 int unsignedp0, unsignedp1;
2165 tree primop0, primop1;
2166 enum tree_code code = *rescode_ptr;
2168 /* Throw away any conversions to wider types
2169 already present in the operands. */
2171 primop0 = get_narrower (op0, &unsignedp0);
2172 primop1 = get_narrower (op1, &unsignedp1);
2174 /* Handle the case that OP0 does not *contain* a conversion
2175 but it *requires* conversion to FINAL_TYPE. */
2177 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2178 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2179 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2180 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2182 /* If one of the operands must be floated, we cannot optimize. */
2183 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2184 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2186 /* If first arg is constant, swap the args (changing operation
2187 so value is preserved), for canonicalization. Don't do this if
2188 the second arg is 0. */
2190 if (TREE_CONSTANT (primop0)
2191 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2194 int temi = unsignedp0;
2202 unsignedp0 = unsignedp1;
2225 *rescode_ptr = code;
2228 /* If comparing an integer against a constant more bits wide,
2229 maybe we can deduce a value of 1 or 0 independent of the data.
2230 Or else truncate the constant now
2231 rather than extend the variable at run time.
2233 This is only interesting if the constant is the wider arg.
2234 Also, it is not safe if the constant is unsigned and the
2235 variable arg is signed, since in this case the variable
2236 would be sign-extended and then regarded as unsigned.
2237 Our technique fails in this case because the lowest/highest
2238 possible unsigned results don't follow naturally from the
2239 lowest/highest possible values of the variable operand.
2240 For just EQ_EXPR and NE_EXPR there is another technique that
2241 could be used: see if the constant can be faithfully represented
2242 in the other operand's type, by truncating it and reextending it
2243 and see if that preserves the constant's value. */
2245 if (!real1 && !real2
2246 && TREE_CODE (primop1) == INTEGER_CST
2247 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2249 int min_gt, max_gt, min_lt, max_lt;
2250 tree maxval, minval;
2251 /* 1 if comparison is nominally unsigned. */
2252 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2255 type = c_common_signed_or_unsigned_type (unsignedp0,
2256 TREE_TYPE (primop0));
2258 /* In C, if TYPE is an enumeration, then we need to get its
2259 min/max values from it's underlying integral type, not the
2260 enumerated type itself. In C++, TYPE_MAX_VALUE and
2261 TYPE_MIN_VALUE have already been set correctly on the
2262 enumeration type. */
2263 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
2264 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2266 maxval = TYPE_MAX_VALUE (type);
2267 minval = TYPE_MIN_VALUE (type);
2269 if (unsignedp && !unsignedp0)
2270 *restype_ptr = c_common_signed_type (*restype_ptr);
2272 if (TREE_TYPE (primop1) != *restype_ptr)
2273 primop1 = convert (*restype_ptr, primop1);
2274 if (type != *restype_ptr)
2276 minval = convert (*restype_ptr, minval);
2277 maxval = convert (*restype_ptr, maxval);
2280 if (unsignedp && unsignedp0)
2282 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2283 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2284 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2285 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2289 min_gt = INT_CST_LT (primop1, minval);
2290 max_gt = INT_CST_LT (primop1, maxval);
2291 min_lt = INT_CST_LT (minval, primop1);
2292 max_lt = INT_CST_LT (maxval, primop1);
2296 /* This used to be a switch, but Genix compiler can't handle that. */
2297 if (code == NE_EXPR)
2299 if (max_lt || min_gt)
2300 val = truthvalue_true_node;
2302 else if (code == EQ_EXPR)
2304 if (max_lt || min_gt)
2305 val = truthvalue_false_node;
2307 else if (code == LT_EXPR)
2310 val = truthvalue_true_node;
2312 val = truthvalue_false_node;
2314 else if (code == GT_EXPR)
2317 val = truthvalue_true_node;
2319 val = truthvalue_false_node;
2321 else if (code == LE_EXPR)
2324 val = truthvalue_true_node;
2326 val = truthvalue_false_node;
2328 else if (code == GE_EXPR)
2331 val = truthvalue_true_node;
2333 val = truthvalue_false_node;
2336 /* If primop0 was sign-extended and unsigned comparison specd,
2337 we did a signed comparison above using the signed type bounds.
2338 But the comparison we output must be unsigned.
2340 Also, for inequalities, VAL is no good; but if the signed
2341 comparison had *any* fixed result, it follows that the
2342 unsigned comparison just tests the sign in reverse
2343 (positive values are LE, negative ones GE).
2344 So we can generate an unsigned comparison
2345 against an extreme value of the signed type. */
2347 if (unsignedp && !unsignedp0)
2354 primop1 = TYPE_MIN_VALUE (type);
2360 primop1 = TYPE_MAX_VALUE (type);
2367 type = c_common_unsigned_type (type);
2370 if (TREE_CODE (primop0) != INTEGER_CST)
2372 if (val == truthvalue_false_node)
2373 warning ("comparison is always false due to limited range of data type");
2374 if (val == truthvalue_true_node)
2375 warning ("comparison is always true due to limited range of data type");
2380 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2381 if (TREE_SIDE_EFFECTS (primop0))
2382 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2386 /* Value is not predetermined, but do the comparison
2387 in the type of the operand that is not constant.
2388 TYPE is already properly set. */
2390 else if (real1 && real2
2391 && (TYPE_PRECISION (TREE_TYPE (primop0))
2392 == TYPE_PRECISION (TREE_TYPE (primop1))))
2393 type = TREE_TYPE (primop0);
2395 /* If args' natural types are both narrower than nominal type
2396 and both extend in the same manner, compare them
2397 in the type of the wider arg.
2398 Otherwise must actually extend both to the nominal
2399 common type lest different ways of extending
2401 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2403 else if (unsignedp0 == unsignedp1 && real1 == real2
2404 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2405 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2407 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2408 type = c_common_signed_or_unsigned_type (unsignedp0
2409 || TREE_UNSIGNED (*restype_ptr),
2411 /* Make sure shorter operand is extended the right way
2412 to match the longer operand. */
2414 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2415 TREE_TYPE (primop0)),
2418 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2419 TREE_TYPE (primop1)),
2424 /* Here we must do the comparison on the nominal type
2425 using the args exactly as we received them. */
2426 type = *restype_ptr;
2430 if (!real1 && !real2 && integer_zerop (primop1)
2431 && TREE_UNSIGNED (*restype_ptr))
2437 /* All unsigned values are >= 0, so we warn if extra warnings
2438 are requested. However, if OP0 is a constant that is
2439 >= 0, the signedness of the comparison isn't an issue,
2440 so suppress the warning. */
2441 if (extra_warnings && !in_system_header
2442 && ! (TREE_CODE (primop0) == INTEGER_CST
2443 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2445 warning ("comparison of unsigned expression >= 0 is always true");
2446 value = truthvalue_true_node;
2450 if (extra_warnings && !in_system_header
2451 && ! (TREE_CODE (primop0) == INTEGER_CST
2452 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2454 warning ("comparison of unsigned expression < 0 is always false");
2455 value = truthvalue_false_node;
2464 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2465 if (TREE_SIDE_EFFECTS (primop0))
2466 return build (COMPOUND_EXPR, TREE_TYPE (value),
2473 *op0_ptr = convert (type, primop0);
2474 *op1_ptr = convert (type, primop1);
2476 *restype_ptr = truthvalue_type_node;
2481 /* Return a tree for the sum or difference (RESULTCODE says which)
2482 of pointer PTROP and integer INTOP. */
2485 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2492 /* The result is a pointer of the same type that is being added. */
2494 tree result_type = TREE_TYPE (ptrop);
2496 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2498 if (pedantic || warn_pointer_arith)
2499 pedwarn ("pointer of type `void *' used in arithmetic");
2500 size_exp = integer_one_node;
2502 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2504 if (pedantic || warn_pointer_arith)
2505 pedwarn ("pointer to a function used in arithmetic");
2506 size_exp = integer_one_node;
2508 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2510 if (pedantic || warn_pointer_arith)
2511 pedwarn ("pointer to member function used in arithmetic");
2512 size_exp = integer_one_node;
2515 size_exp = size_in_bytes (TREE_TYPE (result_type));
2517 /* If what we are about to multiply by the size of the elements
2518 contains a constant term, apply distributive law
2519 and multiply that constant term separately.
2520 This helps produce common subexpressions. */
2522 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2523 && ! TREE_CONSTANT (intop)
2524 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2525 && TREE_CONSTANT (size_exp)
2526 /* If the constant comes from pointer subtraction,
2527 skip this optimization--it would cause an error. */
2528 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2529 /* If the constant is unsigned, and smaller than the pointer size,
2530 then we must skip this optimization. This is because it could cause
2531 an overflow error if the constant is negative but INTOP is not. */
2532 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2533 || (TYPE_PRECISION (TREE_TYPE (intop))
2534 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2536 enum tree_code subcode = resultcode;
2537 tree int_type = TREE_TYPE (intop);
2538 if (TREE_CODE (intop) == MINUS_EXPR)
2539 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2540 /* Convert both subexpression types to the type of intop,
2541 because weird cases involving pointer arithmetic
2542 can result in a sum or difference with different type args. */
2543 ptrop = build_binary_op (subcode, ptrop,
2544 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2545 intop = convert (int_type, TREE_OPERAND (intop, 0));
2548 /* Convert the integer argument to a type the same size as sizetype
2549 so the multiply won't overflow spuriously. */
2551 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2552 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2553 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2554 TREE_UNSIGNED (sizetype)), intop);
2556 /* Replace the integer argument with a suitable product by the object size.
2557 Do this multiplication as signed, then convert to the appropriate
2558 pointer type (actually unsigned integral). */
2560 intop = convert (result_type,
2561 build_binary_op (MULT_EXPR, intop,
2562 convert (TREE_TYPE (intop), size_exp), 1));
2564 /* Create the sum or difference. */
2566 result = build (resultcode, result_type, ptrop, intop);
2568 folded = fold (result);
2569 if (folded == result)
2570 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2574 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2575 or validate its data type for an `if' or `while' statement or ?..: exp.
2577 This preparation consists of taking the ordinary
2578 representation of an expression expr and producing a valid tree
2579 boolean expression describing whether expr is nonzero. We could
2580 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2581 but we optimize comparisons, &&, ||, and !.
2583 The resulting type should always be `truthvalue_type_node'. */
2586 c_common_truthvalue_conversion (tree expr)
2588 if (TREE_CODE (expr) == ERROR_MARK)
2591 if (TREE_CODE (expr) == FUNCTION_DECL)
2592 expr = build_unary_op (ADDR_EXPR, expr, 0);
2594 #if 0 /* This appears to be wrong for C++. */
2595 /* These really should return error_mark_node after 2.4 is stable.
2596 But not all callers handle ERROR_MARK properly. */
2597 switch (TREE_CODE (TREE_TYPE (expr)))
2600 error ("struct type value used where scalar is required");
2601 return truthvalue_false_node;
2604 error ("union type value used where scalar is required");
2605 return truthvalue_false_node;
2608 error ("array type value used where scalar is required");
2609 return truthvalue_false_node;
2616 switch (TREE_CODE (expr))
2619 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2620 case TRUTH_ANDIF_EXPR:
2621 case TRUTH_ORIF_EXPR:
2622 case TRUTH_AND_EXPR:
2624 case TRUTH_XOR_EXPR:
2625 case TRUTH_NOT_EXPR:
2626 TREE_TYPE (expr) = truthvalue_type_node;
2633 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2636 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2640 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2641 && ! DECL_WEAK (TREE_OPERAND (expr, 0)))
2643 /* Common Ada/Pascal programmer's mistake. We always warn
2644 about this since it is so bad. */
2645 warning ("the address of `%D', will always evaluate as `true'",
2646 TREE_OPERAND (expr, 0));
2647 return truthvalue_true_node;
2650 /* If we are taking the address of an external decl, it might be
2651 zero if it is weak, so we cannot optimize. */
2652 if (DECL_P (TREE_OPERAND (expr, 0))
2653 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2656 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2657 return build (COMPOUND_EXPR, truthvalue_type_node,
2658 TREE_OPERAND (expr, 0), truthvalue_true_node);
2660 return truthvalue_true_node;
2664 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2665 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2666 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2667 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2673 /* These don't change whether an object is nonzero or zero. */
2674 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2678 /* These don't change whether an object is zero or nonzero, but
2679 we can't ignore them if their second arg has side-effects. */
2680 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2681 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2682 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2684 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2687 /* Distribute the conversion into the arms of a COND_EXPR. */
2688 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2689 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2690 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2693 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2694 since that affects how `default_conversion' will behave. */
2695 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2696 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2698 /* Fall through.... */
2700 /* If this is widening the argument, we can ignore it. */
2701 if (TYPE_PRECISION (TREE_TYPE (expr))
2702 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2703 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2707 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2708 aren't guaranteed to the be same for modes that can represent
2709 infinity, since if x and y are both +infinity, or both
2710 -infinity, then x - y is not a number.
2712 Note that this transformation is safe when x or y is NaN.
2713 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2715 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2717 /* Fall through.... */
2719 /* This and MINUS_EXPR can be changed into a comparison of the
2721 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2722 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2723 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2724 TREE_OPERAND (expr, 1), 1);
2725 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2726 fold (build1 (NOP_EXPR,
2727 TREE_TYPE (TREE_OPERAND (expr, 0)),
2728 TREE_OPERAND (expr, 1))), 1);
2731 if (integer_onep (TREE_OPERAND (expr, 1))
2732 && TREE_TYPE (expr) != truthvalue_type_node)
2733 /* Using convert here would cause infinite recursion. */
2734 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2738 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2739 warning ("suggest parentheses around assignment used as truth value");
2746 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2748 tree t = save_expr (expr);
2749 return (build_binary_op
2750 ((TREE_SIDE_EFFECTS (expr)
2751 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2752 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2753 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2757 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2760 static tree builtin_function_2 (const char *, const char *, tree, tree,
2761 int, enum built_in_class, int, int,
2764 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2765 down to the element type of an array. */
2768 c_build_qualified_type (tree type, int type_quals)
2770 if (type == error_mark_node)
2773 if (TREE_CODE (type) == ARRAY_TYPE)
2774 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2776 TYPE_DOMAIN (type));
2778 /* A restrict-qualified pointer type must be a pointer to object or
2779 incomplete type. Note that the use of POINTER_TYPE_P also allows
2780 REFERENCE_TYPEs, which is appropriate for C++. */
2781 if ((type_quals & TYPE_QUAL_RESTRICT)
2782 && (!POINTER_TYPE_P (type)
2783 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2785 error ("invalid use of `restrict'");
2786 type_quals &= ~TYPE_QUAL_RESTRICT;
2789 return build_qualified_type (type, type_quals);
2792 /* Apply the TYPE_QUALS to the new DECL. */
2795 c_apply_type_quals_to_decl (int type_quals, tree decl)
2797 tree type = TREE_TYPE (decl);
2799 if (type == error_mark_node)
2802 if (((type_quals & TYPE_QUAL_CONST)
2803 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2804 /* An object declared 'const' is only readonly after it is
2805 initialized. We don't have any way of expressing this currently,
2806 so we need to be conservative and unset TREE_READONLY for types
2807 with constructors. Otherwise aliasing code will ignore stores in
2808 an inline constructor. */
2809 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2810 TREE_READONLY (decl) = 1;
2811 if (type_quals & TYPE_QUAL_VOLATILE)
2813 TREE_SIDE_EFFECTS (decl) = 1;
2814 TREE_THIS_VOLATILE (decl) = 1;
2816 if (type_quals & TYPE_QUAL_RESTRICT)
2818 while (type && TREE_CODE (type) == ARRAY_TYPE)
2819 /* Allow 'restrict' on arrays of pointers.
2820 FIXME currently we just ignore it. */
2821 type = TREE_TYPE (type);
2823 || !POINTER_TYPE_P (type)
2824 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2825 error ("invalid use of `restrict'");
2826 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2827 /* Indicate we need to make a unique alias set for this pointer.
2828 We can't do it here because it might be pointing to an
2830 DECL_POINTER_ALIAS_SET (decl) = -2;
2834 /* Return the typed-based alias set for T, which may be an expression
2835 or a type. Return -1 if we don't do anything special. */
2838 c_common_get_alias_set (tree t)
2842 /* Permit type-punning when accessing a union, provided the access
2843 is directly through the union. For example, this code does not
2844 permit taking the address of a union member and then storing
2845 through it. Even the type-punning allowed here is a GCC
2846 extension, albeit a common and useful one; the C standard says
2847 that such accesses have implementation-defined behavior. */
2849 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2850 u = TREE_OPERAND (u, 0))
2851 if (TREE_CODE (u) == COMPONENT_REF
2852 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2855 /* That's all the expressions we handle specially. */
2859 /* The C standard guarantees that any object may be accessed via an
2860 lvalue that has character type. */
2861 if (t == char_type_node
2862 || t == signed_char_type_node
2863 || t == unsigned_char_type_node)
2866 /* If it has the may_alias attribute, it can alias anything. */
2867 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2870 /* The C standard specifically allows aliasing between signed and
2871 unsigned variants of the same type. We treat the signed
2872 variant as canonical. */
2873 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2875 tree t1 = c_common_signed_type (t);
2877 /* t1 == t can happen for boolean nodes which are always unsigned. */
2879 return get_alias_set (t1);
2881 else if (POINTER_TYPE_P (t))
2885 /* Unfortunately, there is no canonical form of a pointer type.
2886 In particular, if we have `typedef int I', then `int *', and
2887 `I *' are different types. So, we have to pick a canonical
2888 representative. We do this below.
2890 Technically, this approach is actually more conservative that
2891 it needs to be. In particular, `const int *' and `int *'
2892 should be in different alias sets, according to the C and C++
2893 standard, since their types are not the same, and so,
2894 technically, an `int **' and `const int **' cannot point at
2897 But, the standard is wrong. In particular, this code is
2902 const int* const* cipp = &ipp;
2904 And, it doesn't make sense for that to be legal unless you
2905 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2906 the pointed-to types. This issue has been reported to the
2908 t1 = build_type_no_quals (t);
2910 return get_alias_set (t1);
2916 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2917 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2918 flag controls whether we should diagnose possibly ill-formed
2919 constructs or not. */
2921 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2923 const char *op_name;
2925 enum tree_code type_code = TREE_CODE (type);
2927 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2928 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2930 if (type_code == FUNCTION_TYPE)
2932 if (op == SIZEOF_EXPR)
2934 if (complain && (pedantic || warn_pointer_arith))
2935 pedwarn ("invalid application of `sizeof' to a function type");
2936 value = size_one_node;
2939 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2941 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2943 if (type_code == VOID_TYPE
2944 && complain && (pedantic || warn_pointer_arith))
2945 pedwarn ("invalid application of `%s' to a void type", op_name);
2946 value = size_one_node;
2948 else if (!COMPLETE_TYPE_P (type))
2951 error ("invalid application of `%s' to incomplete type `%T' ",
2953 value = size_zero_node;
2957 if (op == SIZEOF_EXPR)
2958 /* Convert in case a char is more than one unit. */
2959 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2960 size_int (TYPE_PRECISION (char_type_node)
2963 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2966 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2967 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2968 never happen. However, this node should really have type
2969 `size_t', which is just a typedef for an ordinary integer type. */
2970 value = fold (build1 (NOP_EXPR, size_type_node, value));
2971 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2976 /* Implement the __alignof keyword: Return the minimum required
2977 alignment of EXPR, measured in bytes. For VAR_DECL's and
2978 FIELD_DECL's return DECL_ALIGN (which can be set from an
2979 "aligned" __attribute__ specification). */
2982 c_alignof_expr (tree expr)
2986 if (TREE_CODE (expr) == VAR_DECL)
2987 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2989 else if (TREE_CODE (expr) == COMPONENT_REF
2990 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2992 error ("`__alignof' applied to a bit-field");
2995 else if (TREE_CODE (expr) == COMPONENT_REF
2996 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2997 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
2999 else if (TREE_CODE (expr) == INDIRECT_REF)
3001 tree t = TREE_OPERAND (expr, 0);
3003 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3005 while (TREE_CODE (t) == NOP_EXPR
3006 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3010 t = TREE_OPERAND (t, 0);
3011 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3012 if (thisalign > bestalign)
3013 best = t, bestalign = thisalign;
3015 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3018 return c_alignof (TREE_TYPE (expr));
3020 return fold (build1 (NOP_EXPR, size_type_node, t));
3023 /* Handle C and C++ default attributes. */
3025 enum built_in_attribute
3027 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3028 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3029 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3030 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3031 #include "builtin-attrs.def"
3032 #undef DEF_ATTR_NULL_TREE
3034 #undef DEF_ATTR_IDENT
3035 #undef DEF_ATTR_TREE_LIST
3039 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3041 static void c_init_attributes (void);
3043 /* Build tree nodes and builtin functions common to both C and C++ language
3047 c_common_nodes_and_builtins (void)
3051 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3052 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3053 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3054 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3055 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3056 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3057 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3058 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3059 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3060 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3061 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3062 #include "builtin-types.def"
3063 #undef DEF_PRIMITIVE_TYPE
3064 #undef DEF_FUNCTION_TYPE_0
3065 #undef DEF_FUNCTION_TYPE_1
3066 #undef DEF_FUNCTION_TYPE_2
3067 #undef DEF_FUNCTION_TYPE_3
3068 #undef DEF_FUNCTION_TYPE_4
3069 #undef DEF_FUNCTION_TYPE_VAR_0
3070 #undef DEF_FUNCTION_TYPE_VAR_1
3071 #undef DEF_FUNCTION_TYPE_VAR_2
3072 #undef DEF_FUNCTION_TYPE_VAR_3
3073 #undef DEF_POINTER_TYPE
3077 typedef enum builtin_type builtin_type;
3079 tree builtin_types[(int) BT_LAST];
3080 int wchar_type_size;
3081 tree array_domain_type;
3082 tree va_list_ref_type_node;
3083 tree va_list_arg_type_node;
3085 /* Define `int' and `char' first so that dbx will output them first. */
3086 record_builtin_type (RID_INT, NULL, integer_type_node);
3087 record_builtin_type (RID_CHAR, "char", char_type_node);
3089 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3090 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3091 but not C. Are the conditionals here needed? */
3092 if (c_dialect_cxx ())
3093 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3094 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3095 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3096 record_builtin_type (RID_MAX, "long unsigned int",
3097 long_unsigned_type_node);
3098 if (c_dialect_cxx ())
3099 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3100 record_builtin_type (RID_MAX, "long long int",
3101 long_long_integer_type_node);
3102 record_builtin_type (RID_MAX, "long long unsigned int",
3103 long_long_unsigned_type_node);
3104 if (c_dialect_cxx ())
3105 record_builtin_type (RID_MAX, "long long unsigned",
3106 long_long_unsigned_type_node);
3107 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3108 record_builtin_type (RID_MAX, "short unsigned int",
3109 short_unsigned_type_node);
3110 if (c_dialect_cxx ())
3111 record_builtin_type (RID_MAX, "unsigned short",
3112 short_unsigned_type_node);
3114 /* Define both `signed char' and `unsigned char'. */
3115 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3116 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3118 /* These are types that c_common_type_for_size and
3119 c_common_type_for_mode use. */
3120 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3122 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3124 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3126 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3128 #if HOST_BITS_PER_WIDE_INT >= 64
3129 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3130 get_identifier ("__int128_t"),
3133 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3134 unsigned_intQI_type_node));
3135 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3136 unsigned_intHI_type_node));
3137 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3138 unsigned_intSI_type_node));
3139 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3140 unsigned_intDI_type_node));
3141 #if HOST_BITS_PER_WIDE_INT >= 64
3142 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3143 get_identifier ("__uint128_t"),
3144 unsigned_intTI_type_node));
3147 /* Create the widest literal types. */
3148 widest_integer_literal_type_node
3149 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3150 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3151 widest_integer_literal_type_node));
3153 widest_unsigned_literal_type_node
3154 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3155 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3156 widest_unsigned_literal_type_node));
3158 /* `unsigned long' is the standard type for sizeof.
3159 Note that stddef.h uses `unsigned long',
3160 and this must agree, even if long and int are the same size. */
3162 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3163 signed_size_type_node = c_common_signed_type (size_type_node);
3164 set_sizetype (size_type_node);
3166 build_common_tree_nodes_2 (flag_short_double);
3168 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3169 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3170 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3172 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3173 get_identifier ("complex int"),
3174 complex_integer_type_node));
3175 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3176 get_identifier ("complex float"),
3177 complex_float_type_node));
3178 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3179 get_identifier ("complex double"),
3180 complex_double_type_node));
3181 (*lang_hooks.decls.pushdecl)
3182 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3183 complex_long_double_type_node));
3185 /* Types which are common to the fortran compiler and libf2c. When
3186 changing these, you also need to be concerned with f/com.h. */
3188 if (TYPE_PRECISION (float_type_node)
3189 == TYPE_PRECISION (long_integer_type_node))
3191 g77_integer_type_node = long_integer_type_node;
3192 g77_uinteger_type_node = long_unsigned_type_node;
3194 else if (TYPE_PRECISION (float_type_node)
3195 == TYPE_PRECISION (integer_type_node))
3197 g77_integer_type_node = integer_type_node;
3198 g77_uinteger_type_node = unsigned_type_node;
3201 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3203 if (g77_integer_type_node != NULL_TREE)
3205 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3206 get_identifier ("__g77_integer"),
3207 g77_integer_type_node));
3208 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3209 get_identifier ("__g77_uinteger"),
3210 g77_uinteger_type_node));
3213 if (TYPE_PRECISION (float_type_node) * 2
3214 == TYPE_PRECISION (long_integer_type_node))
3216 g77_longint_type_node = long_integer_type_node;
3217 g77_ulongint_type_node = long_unsigned_type_node;
3219 else if (TYPE_PRECISION (float_type_node) * 2
3220 == TYPE_PRECISION (long_long_integer_type_node))
3222 g77_longint_type_node = long_long_integer_type_node;
3223 g77_ulongint_type_node = long_long_unsigned_type_node;
3226 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3228 if (g77_longint_type_node != NULL_TREE)
3230 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3231 get_identifier ("__g77_longint"),
3232 g77_longint_type_node));
3233 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3234 get_identifier ("__g77_ulongint"),
3235 g77_ulongint_type_node));
3238 record_builtin_type (RID_VOID, NULL, void_type_node);
3240 void_zero_node = build_int_2 (0, 0);
3241 TREE_TYPE (void_zero_node) = void_type_node;
3243 void_list_node = build_void_list_node ();
3245 /* Make a type to be the domain of a few array types
3246 whose domains don't really matter.
3247 200 is small enough that it always fits in size_t
3248 and large enough that it can hold most function names for the
3249 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3250 array_domain_type = build_index_type (size_int (200));
3252 /* Make a type for arrays of characters.
3253 With luck nothing will ever really depend on the length of this
3255 char_array_type_node
3256 = build_array_type (char_type_node, array_domain_type);
3258 /* Likewise for arrays of ints. */
3260 = build_array_type (integer_type_node, array_domain_type);
3262 string_type_node = build_pointer_type (char_type_node);
3263 const_string_type_node
3264 = build_pointer_type (build_qualified_type
3265 (char_type_node, TYPE_QUAL_CONST));
3267 /* This is special for C++ so functions can be overloaded. */
3268 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3269 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3270 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3271 if (c_dialect_cxx ())
3273 if (TREE_UNSIGNED (wchar_type_node))
3274 wchar_type_node = make_unsigned_type (wchar_type_size);
3276 wchar_type_node = make_signed_type (wchar_type_size);
3277 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3281 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3282 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3285 /* This is for wide string constants. */
3286 wchar_array_type_node
3287 = build_array_type (wchar_type_node, array_domain_type);
3290 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3293 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3295 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3297 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3299 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3300 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3302 (*lang_hooks.decls.pushdecl)
3303 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3304 va_list_type_node));
3306 (*lang_hooks.decls.pushdecl)
3307 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3308 ptrdiff_type_node));
3310 (*lang_hooks.decls.pushdecl)
3311 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3314 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3316 va_list_arg_type_node = va_list_ref_type_node =
3317 build_pointer_type (TREE_TYPE (va_list_type_node));
3321 va_list_arg_type_node = va_list_type_node;
3322 va_list_ref_type_node = build_reference_type (va_list_type_node);
3325 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3326 builtin_types[(int) ENUM] = VALUE;
3327 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3328 builtin_types[(int) ENUM] \
3329 = build_function_type (builtin_types[(int) RETURN], \
3331 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3332 builtin_types[(int) ENUM] \
3333 = build_function_type (builtin_types[(int) RETURN], \
3334 tree_cons (NULL_TREE, \
3335 builtin_types[(int) ARG1], \
3337 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3338 builtin_types[(int) ENUM] \
3339 = build_function_type \
3340 (builtin_types[(int) RETURN], \
3341 tree_cons (NULL_TREE, \
3342 builtin_types[(int) ARG1], \
3343 tree_cons (NULL_TREE, \
3344 builtin_types[(int) ARG2], \
3346 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3347 builtin_types[(int) ENUM] \
3348 = build_function_type \
3349 (builtin_types[(int) RETURN], \
3350 tree_cons (NULL_TREE, \
3351 builtin_types[(int) ARG1], \
3352 tree_cons (NULL_TREE, \
3353 builtin_types[(int) ARG2], \
3354 tree_cons (NULL_TREE, \
3355 builtin_types[(int) ARG3], \
3357 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3358 builtin_types[(int) ENUM] \
3359 = build_function_type \
3360 (builtin_types[(int) RETURN], \
3361 tree_cons (NULL_TREE, \
3362 builtin_types[(int) ARG1], \
3363 tree_cons (NULL_TREE, \
3364 builtin_types[(int) ARG2], \
3367 builtin_types[(int) ARG3], \
3368 tree_cons (NULL_TREE, \
3369 builtin_types[(int) ARG4], \
3370 void_list_node)))));
3371 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3372 builtin_types[(int) ENUM] \
3373 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3374 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3375 builtin_types[(int) ENUM] \
3376 = build_function_type (builtin_types[(int) RETURN], \
3377 tree_cons (NULL_TREE, \
3378 builtin_types[(int) ARG1], \
3381 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3382 builtin_types[(int) ENUM] \
3383 = build_function_type \
3384 (builtin_types[(int) RETURN], \
3385 tree_cons (NULL_TREE, \
3386 builtin_types[(int) ARG1], \
3387 tree_cons (NULL_TREE, \
3388 builtin_types[(int) ARG2], \
3391 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3392 builtin_types[(int) ENUM] \
3393 = build_function_type \
3394 (builtin_types[(int) RETURN], \
3395 tree_cons (NULL_TREE, \
3396 builtin_types[(int) ARG1], \
3397 tree_cons (NULL_TREE, \
3398 builtin_types[(int) ARG2], \
3399 tree_cons (NULL_TREE, \
3400 builtin_types[(int) ARG3], \
3403 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3404 builtin_types[(int) ENUM] \
3405 = build_pointer_type (builtin_types[(int) TYPE]);
3406 #include "builtin-types.def"
3407 #undef DEF_PRIMITIVE_TYPE
3408 #undef DEF_FUNCTION_TYPE_1
3409 #undef DEF_FUNCTION_TYPE_2
3410 #undef DEF_FUNCTION_TYPE_3
3411 #undef DEF_FUNCTION_TYPE_4
3412 #undef DEF_FUNCTION_TYPE_VAR_0
3413 #undef DEF_FUNCTION_TYPE_VAR_1
3414 #undef DEF_FUNCTION_TYPE_VAR_2
3415 #undef DEF_FUNCTION_TYPE_VAR_3
3416 #undef DEF_POINTER_TYPE
3418 c_init_attributes ();
3420 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3421 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3426 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3430 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3433 ? (NAME + strlen ("__builtin_")) \
3435 built_in_attributes[(int) ATTRS]); \
3437 decl = builtin_function_2 (NAME, \
3438 NAME + strlen ("__builtin_"), \
3439 builtin_types[TYPE], \
3440 builtin_types[LIBTYPE], \
3445 built_in_attributes[(int) ATTRS]); \
3447 built_in_decls[(int) ENUM] = decl; \
3449 implicit_built_in_decls[(int) ENUM] = decl; \
3451 #include "builtins.def"
3454 (*targetm.init_builtins) ();
3456 main_identifier_node = get_identifier ("main");
3460 build_va_arg (tree expr, tree type)
3462 return build1 (VA_ARG_EXPR, type, expr);
3466 /* Linked list of disabled built-in functions. */
3468 typedef struct disabled_builtin
3471 struct disabled_builtin *next;
3473 static disabled_builtin *disabled_builtins = NULL;
3475 static bool builtin_function_disabled_p (const char *);
3477 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3478 begins with "__builtin_", give an error. */
3481 disable_builtin_function (const char *name)
3483 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3484 error ("cannot disable built-in function `%s'", name);
3487 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3489 new->next = disabled_builtins;
3490 disabled_builtins = new;
3495 /* Return true if the built-in function NAME has been disabled, false
3499 builtin_function_disabled_p (const char *name)
3501 disabled_builtin *p;
3502 for (p = disabled_builtins; p != NULL; p = p->next)
3504 if (strcmp (name, p->name) == 0)
3511 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3512 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3513 of these may be NULL (though both being NULL is useless).
3514 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3515 TYPE is the type of the function with the ordinary name. These
3516 may differ if the ordinary name is declared with a looser type to avoid
3517 conflicts with headers. FUNCTION_CODE and CLASS are as for
3518 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3519 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3520 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3521 ATTRS is the tree list representing the builtin's function attributes.
3522 Returns the declaration of BUILTIN_NAME, if any, otherwise
3523 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3524 or if NONANSI_P and flag_no_nonansi_builtin. */
3527 builtin_function_2 (const char *builtin_name, const char *name,
3528 tree builtin_type, tree type, int function_code,
3529 enum built_in_class class, int library_name_p,
3530 int nonansi_p, tree attrs)
3532 tree bdecl = NULL_TREE;
3533 tree decl = NULL_TREE;
3535 if (builtin_name != 0)
3536 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3537 class, library_name_p ? name : NULL, attrs);
3539 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3540 && !(nonansi_p && flag_no_nonansi_builtin))
3541 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3543 return (bdecl != 0 ? bdecl : decl);
3546 /* Nonzero if the type T promotes to int. This is (nearly) the
3547 integral promotions defined in ISO C99 6.3.1.1/2. */
3550 c_promoting_integer_type_p (tree t)
3552 switch (TREE_CODE (t))
3555 return (TYPE_MAIN_VARIANT (t) == char_type_node
3556 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3557 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3558 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3559 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3560 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3563 /* ??? Technically all enumerations not larger than an int
3564 promote to an int. But this is used along code paths
3565 that only want to notice a size change. */
3566 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3576 /* Return 1 if PARMS specifies a fixed number of parameters
3577 and none of their types is affected by default promotions. */
3580 self_promoting_args_p (tree parms)
3583 for (t = parms; t; t = TREE_CHAIN (t))
3585 tree type = TREE_VALUE (t);
3587 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3593 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3596 if (c_promoting_integer_type_p (type))
3602 /* Recursively examines the array elements of TYPE, until a non-array
3603 element type is found. */
3606 strip_array_types (tree type)
3608 while (TREE_CODE (type) == ARRAY_TYPE)
3609 type = TREE_TYPE (type);
3614 /* Recursively remove any '*' or '&' operator from TYPE. */
3616 strip_pointer_operator (tree t)
3618 while (POINTER_TYPE_P (t))
3623 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3625 /* Expand a call to an unordered comparison function such as
3626 __builtin_isgreater(). FUNCTION is the function's declaration and
3627 PARAMS a list of the values passed. For __builtin_isunordered(),
3628 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3629 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3630 that give the opposite of the desired result. UNORDERED_CODE is
3631 used for modes that can hold NaNs and ORDERED_CODE is used for the
3635 expand_unordered_cmp (tree function, tree params,
3636 enum tree_code unordered_code,
3637 enum tree_code ordered_code)
3639 tree arg0, arg1, type;
3640 enum tree_code code0, code1;
3642 /* Check that we have exactly two arguments. */
3643 if (params == 0 || TREE_CHAIN (params) == 0)
3645 error ("too few arguments to function `%s'",
3646 IDENTIFIER_POINTER (DECL_NAME (function)));
3647 return error_mark_node;
3649 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3651 error ("too many arguments to function `%s'",
3652 IDENTIFIER_POINTER (DECL_NAME (function)));
3653 return error_mark_node;
3656 arg0 = TREE_VALUE (params);
3657 arg1 = TREE_VALUE (TREE_CHAIN (params));
3659 code0 = TREE_CODE (TREE_TYPE (arg0));
3660 code1 = TREE_CODE (TREE_TYPE (arg1));
3662 /* Make sure that the arguments have a common type of REAL. */
3664 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3665 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3666 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3668 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3670 error ("non-floating-point argument to function `%s'",
3671 IDENTIFIER_POINTER (DECL_NAME (function)));
3672 return error_mark_node;
3675 if (unordered_code == UNORDERED_EXPR)
3677 if (MODE_HAS_NANS (TYPE_MODE (type)))
3678 return build_binary_op (unordered_code,
3679 convert (type, arg0),
3680 convert (type, arg1),
3683 return integer_zero_node;
3686 return build_unary_op (TRUTH_NOT_EXPR,
3687 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3690 convert (type, arg0),
3691 convert (type, arg1),
3697 /* Recognize certain built-in functions so we can make tree-codes
3698 other than CALL_EXPR. We do this when it enables fold-const.c
3699 to do something useful. */
3700 /* ??? By rights this should go in builtins.c, but only C and C++
3701 implement build_{binary,unary}_op. Not exactly sure what bits
3702 of functionality are actually needed from those functions, or
3703 where the similar functionality exists in the other front ends. */
3706 expand_tree_builtin (tree function, tree params, tree coerced_params)
3708 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3711 switch (DECL_FUNCTION_CODE (function))
3715 case BUILT_IN_LLABS:
3716 case BUILT_IN_IMAXABS:
3718 case BUILT_IN_FABSL:
3719 case BUILT_IN_FABSF:
3720 if (coerced_params == 0)
3721 return integer_zero_node;
3722 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3725 case BUILT_IN_CONJF:
3726 case BUILT_IN_CONJL:
3727 if (coerced_params == 0)
3728 return integer_zero_node;
3729 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3731 case BUILT_IN_CREAL:
3732 case BUILT_IN_CREALF:
3733 case BUILT_IN_CREALL:
3734 if (coerced_params == 0)
3735 return integer_zero_node;
3736 return non_lvalue (build_unary_op (REALPART_EXPR,
3737 TREE_VALUE (coerced_params), 0));
3739 case BUILT_IN_CIMAG:
3740 case BUILT_IN_CIMAGF:
3741 case BUILT_IN_CIMAGL:
3742 if (coerced_params == 0)
3743 return integer_zero_node;
3744 return non_lvalue (build_unary_op (IMAGPART_EXPR,
3745 TREE_VALUE (coerced_params), 0));
3747 case BUILT_IN_ISGREATER:
3748 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3750 case BUILT_IN_ISGREATEREQUAL:
3751 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3753 case BUILT_IN_ISLESS:
3754 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3756 case BUILT_IN_ISLESSEQUAL:
3757 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3759 case BUILT_IN_ISLESSGREATER:
3760 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3762 case BUILT_IN_ISUNORDERED:
3763 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3772 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3773 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3774 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3775 value, the traversal is aborted, and the value returned by FUNC is
3776 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3777 the node being visited are not walked.
3779 We don't need a without_duplicates variant of this one because the
3780 statement tree is a tree, not a graph. */
3783 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3785 enum tree_code code;
3790 #define WALK_SUBTREE(NODE) \
3793 result = walk_stmt_tree (&(NODE), func, data); \
3799 /* Skip empty subtrees. */
3803 /* Skip subtrees below non-statement nodes. */
3804 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3807 /* Call the function. */
3809 result = (*func) (tp, &walk_subtrees, data);
3811 /* If we found something, return it. */
3815 /* FUNC may have modified the tree, recheck that we're looking at a
3817 code = TREE_CODE (*tp);
3818 if (!STATEMENT_CODE_P (code))
3821 /* Visit the subtrees unless FUNC decided that there was nothing
3822 interesting below this point in the tree. */
3825 /* Walk over all the sub-trees of this operand. Statement nodes
3826 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3827 len = TREE_CODE_LENGTH (code);
3829 /* Go through the subtrees. We need to do this in forward order so
3830 that the scope of a FOR_EXPR is handled properly. */
3831 for (i = 0; i < len; ++i)
3832 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3835 /* Finally visit the chain. This can be tail-recursion optimized if
3836 we write it this way. */
3837 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3842 /* Used to compare case labels. K1 and K2 are actually tree nodes
3843 representing case labels, or NULL_TREE for a `default' label.
3844 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3845 K2, and 0 if K1 and K2 are equal. */
3848 case_compare (splay_tree_key k1, splay_tree_key k2)
3850 /* Consider a NULL key (such as arises with a `default' label) to be
3851 smaller than anything else. */
3857 return tree_int_cst_compare ((tree) k1, (tree) k2);
3860 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3861 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3862 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3863 case label was declared using the usual C/C++ syntax, rather than
3864 the GNU case range extension. CASES is a tree containing all the
3865 case ranges processed so far; COND is the condition for the
3866 switch-statement itself. Returns the CASE_LABEL created, or
3867 ERROR_MARK_NODE if no CASE_LABEL is created. */
3870 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3876 splay_tree_node node;
3878 /* Create the LABEL_DECL itself. */
3879 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3880 DECL_CONTEXT (label) = current_function_decl;
3882 /* If there was an error processing the switch condition, bail now
3883 before we get more confused. */
3884 if (!cond || cond == error_mark_node)
3886 /* Add a label anyhow so that the back-end doesn't think that
3887 the beginning of the switch is unreachable. */
3889 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3890 return error_mark_node;
3893 if ((low_value && TREE_TYPE (low_value)
3894 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3895 || (high_value && TREE_TYPE (high_value)
3896 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3897 error ("pointers are not permitted as case values");
3899 /* Case ranges are a GNU extension. */
3900 if (high_value && pedantic)
3901 pedwarn ("range expressions in switch statements are non-standard");
3903 type = TREE_TYPE (cond);
3906 low_value = check_case_value (low_value);
3907 low_value = convert_and_check (type, low_value);
3911 high_value = check_case_value (high_value);
3912 high_value = convert_and_check (type, high_value);
3915 /* If an error has occurred, bail out now. */
3916 if (low_value == error_mark_node || high_value == error_mark_node)
3919 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3920 return error_mark_node;
3923 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3924 really a case range, even though it was written that way. Remove
3925 the HIGH_VALUE to simplify later processing. */
3926 if (tree_int_cst_equal (low_value, high_value))
3927 high_value = NULL_TREE;
3928 if (low_value && high_value
3929 && !tree_int_cst_lt (low_value, high_value))
3930 warning ("empty range specified");
3932 /* Look up the LOW_VALUE in the table of case labels we already
3934 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3935 /* If there was not an exact match, check for overlapping ranges.
3936 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3937 that's a `default' label and the only overlap is an exact match. */
3938 if (!node && (low_value || high_value))
3940 splay_tree_node low_bound;
3941 splay_tree_node high_bound;
3943 /* Even though there wasn't an exact match, there might be an
3944 overlap between this case range and another case range.
3945 Since we've (inductively) not allowed any overlapping case
3946 ranges, we simply need to find the greatest low case label
3947 that is smaller that LOW_VALUE, and the smallest low case
3948 label that is greater than LOW_VALUE. If there is an overlap
3949 it will occur in one of these two ranges. */
3950 low_bound = splay_tree_predecessor (cases,
3951 (splay_tree_key) low_value);
3952 high_bound = splay_tree_successor (cases,
3953 (splay_tree_key) low_value);
3955 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3956 the LOW_VALUE, so there is no need to check unless the
3957 LOW_BOUND is in fact itself a case range. */
3959 && CASE_HIGH ((tree) low_bound->value)
3960 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3963 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3964 range is bigger than the low end of the current range, so we
3965 are only interested if the current range is a real range, and
3966 not an ordinary case label. */
3969 && (tree_int_cst_compare ((tree) high_bound->key,
3974 /* If there was an overlap, issue an error. */
3977 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3981 error ("duplicate (or overlapping) case value");
3982 error ("%Jthis is the first entry overlapping that value", duplicate);
3986 error ("duplicate case value") ;
3987 error ("%Jpreviously used here", duplicate);
3991 error ("multiple default labels in one switch");
3992 error ("%Jthis is the first default label", duplicate);
3995 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3998 /* Add a CASE_LABEL to the statement-tree. */
3999 case_label = add_stmt (build_case_label (low_value, high_value, label));
4000 /* Register this case label in the splay tree. */
4001 splay_tree_insert (cases,
4002 (splay_tree_key) low_value,
4003 (splay_tree_value) case_label);
4008 /* Finish an expression taking the address of LABEL (an
4009 IDENTIFIER_NODE). Returns an expression for the address. */
4012 finish_label_address_expr (tree label)
4017 pedwarn ("taking the address of a label is non-standard");
4019 if (label == error_mark_node)
4020 return error_mark_node;
4022 label = lookup_label (label);
4023 if (label == NULL_TREE)
4024 result = null_pointer_node;
4027 TREE_USED (label) = 1;
4028 result = build1 (ADDR_EXPR, ptr_type_node, label);
4029 TREE_CONSTANT (result) = 1;
4030 /* The current function in not necessarily uninlinable.
4031 Computed gotos are incompatible with inlining, but the value
4032 here could be used only in a diagnostic, for example. */
4038 /* Hook used by expand_expr to expand language-specific tree codes. */
4041 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
4042 int modifier /* Actually enum_modifier. */,
4045 switch (TREE_CODE (exp))
4051 bool preserve_result = false;
4053 if (STMT_EXPR_WARN_UNUSED_RESULT (exp) && target == const0_rtx)
4055 tree stmt = STMT_EXPR_STMT (exp);
4058 for (scope = COMPOUND_BODY (stmt);
4059 scope && TREE_CODE (scope) != SCOPE_STMT;
4060 scope = TREE_CHAIN (scope));
4062 if (scope && SCOPE_STMT_BLOCK (scope))
4063 warning ("%Hignoring return value of `%D', "
4064 "declared with attribute warn_unused_result",
4065 &expr_wfl_stack->location,
4066 BLOCK_ABSTRACT_ORIGIN (SCOPE_STMT_BLOCK (scope)));
4068 warning ("%Hignoring return value of function "
4069 "declared with attribute warn_unused_result",
4070 &expr_wfl_stack->location);
4073 /* Since expand_expr_stmt calls free_temp_slots after every
4074 expression statement, we must call push_temp_slots here.
4075 Otherwise, any temporaries in use now would be considered
4076 out-of-scope after the first EXPR_STMT from within the
4079 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
4081 /* If we want the result of this expression, find the last
4082 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
4083 if (target != const0_rtx
4084 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
4085 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
4087 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
4088 tree last = TREE_CHAIN (expr);
4090 while (TREE_CHAIN (last))
4093 last = TREE_CHAIN (last);
4096 if (TREE_CODE (last) == SCOPE_STMT
4097 && TREE_CODE (expr) == EXPR_STMT)
4099 /* Otherwise, note that we want the value from the last
4101 TREE_ADDRESSABLE (expr) = 1;
4102 preserve_result = true;
4106 expand_stmt (STMT_EXPR_STMT (exp));
4107 expand_end_stmt_expr (rtl_expr);
4109 result = expand_expr_real (rtl_expr, target, tmode, modifier, alt_rtl);
4110 if (preserve_result && GET_CODE (result) == MEM)
4112 if (GET_MODE (result) != BLKmode)
4113 result = copy_to_reg (result);
4115 preserve_temp_slots (result);
4118 /* If the statment-expression does not have a scope, then the
4119 new temporaries we created within it must live beyond the
4120 statement-expression. */
4121 if (STMT_EXPR_NO_SCOPE (exp))
4122 preserve_temp_slots (NULL_RTX);
4129 case COMPOUND_LITERAL_EXPR:
4131 /* Initialize the anonymous variable declared in the compound
4132 literal, then return the variable. */
4133 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4134 emit_local_var (decl);
4135 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
4146 /* Hook used by safe_from_p to handle language-specific tree codes. */
4149 c_safe_from_p (rtx target, tree exp)
4151 /* We can see statements here when processing the body of a
4152 statement-expression. For a declaration statement declaring a
4153 variable, look at the variable's initializer. */
4154 if (TREE_CODE (exp) == DECL_STMT)
4156 tree decl = DECL_STMT_DECL (exp);
4158 if (TREE_CODE (decl) == VAR_DECL
4159 && DECL_INITIAL (decl)
4160 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4164 /* For any statement, we must follow the statement-chain. */
4165 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4166 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4168 /* Assume everything else is safe. */
4172 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4175 c_common_unsafe_for_reeval (tree exp)
4177 /* Statement expressions may not be reevaluated, likewise compound
4179 if (TREE_CODE (exp) == STMT_EXPR
4180 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4183 /* Walk all other expressions. */
4187 /* Hook used by staticp to handle language-specific tree codes. */
4190 c_staticp (tree exp)
4192 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4193 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4199 /* Given a boolean expression ARG, return a tree representing an increment
4200 or decrement (as indicated by CODE) of ARG. The front end must check for
4201 invalid cases (e.g., decrement in C++). */
4203 boolean_increment (enum tree_code code, tree arg)
4206 tree true_res = boolean_true_node;
4208 arg = stabilize_reference (arg);
4211 case PREINCREMENT_EXPR:
4212 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4214 case POSTINCREMENT_EXPR:
4215 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4216 arg = save_expr (arg);
4217 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4218 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4220 case PREDECREMENT_EXPR:
4221 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4223 case POSTDECREMENT_EXPR:
4224 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4225 arg = save_expr (arg);
4226 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4227 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4232 TREE_SIDE_EFFECTS (val) = 1;
4236 /* Built-in macros for stddef.h, that require macros defined in this
4239 c_stddef_cpp_builtins(void)
4241 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4242 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4243 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4244 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4248 c_init_attributes (void)
4250 /* Fill in the built_in_attributes array. */
4251 #define DEF_ATTR_NULL_TREE(ENUM) \
4252 built_in_attributes[(int) ENUM] = NULL_TREE;
4253 #define DEF_ATTR_INT(ENUM, VALUE) \
4254 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4255 #define DEF_ATTR_IDENT(ENUM, STRING) \
4256 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4257 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4258 built_in_attributes[(int) ENUM] \
4259 = tree_cons (built_in_attributes[(int) PURPOSE], \
4260 built_in_attributes[(int) VALUE], \
4261 built_in_attributes[(int) CHAIN]);
4262 #include "builtin-attrs.def"
4263 #undef DEF_ATTR_NULL_TREE
4265 #undef DEF_ATTR_IDENT
4266 #undef DEF_ATTR_TREE_LIST
4269 /* Attribute handlers common to C front ends. */
4271 /* Handle a "packed" attribute; arguments as in
4272 struct attribute_spec.handler. */
4275 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4276 int flags, bool *no_add_attrs)
4280 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4281 *node = build_type_copy (*node);
4282 TYPE_PACKED (*node) = 1;
4283 if (TYPE_MAIN_VARIANT (*node) == *node)
4285 /* If it is the main variant, then pack the other variants
4286 too. This happens in,
4289 struct Foo const *ptr; // creates a variant w/o packed flag
4290 } __ attribute__((packed)); // packs it now.
4294 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4295 TYPE_PACKED (probe) = 1;
4299 else if (TREE_CODE (*node) == FIELD_DECL)
4300 DECL_PACKED (*node) = 1;
4301 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4302 used for DECL_REGISTER. It wouldn't mean anything anyway.
4303 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4304 that changes what the typedef is typing. */
4307 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4308 *no_add_attrs = true;
4314 /* Handle a "nocommon" attribute; arguments as in
4315 struct attribute_spec.handler. */
4318 handle_nocommon_attribute (tree *node, tree name,
4319 tree args ATTRIBUTE_UNUSED,
4320 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4322 if (TREE_CODE (*node) == VAR_DECL)
4323 DECL_COMMON (*node) = 0;
4326 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4327 *no_add_attrs = true;
4333 /* Handle a "common" attribute; arguments as in
4334 struct attribute_spec.handler. */
4337 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4338 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4340 if (TREE_CODE (*node) == VAR_DECL)
4341 DECL_COMMON (*node) = 1;
4344 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4345 *no_add_attrs = true;
4351 /* Handle a "noreturn" attribute; arguments as in
4352 struct attribute_spec.handler. */
4355 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4356 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4358 tree type = TREE_TYPE (*node);
4360 /* See FIXME comment in c_common_attribute_table. */
4361 if (TREE_CODE (*node) == FUNCTION_DECL)
4362 TREE_THIS_VOLATILE (*node) = 1;
4363 else if (TREE_CODE (type) == POINTER_TYPE
4364 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4366 = build_pointer_type
4367 (build_type_variant (TREE_TYPE (type),
4368 TREE_READONLY (TREE_TYPE (type)), 1));
4371 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4372 *no_add_attrs = true;
4378 /* Handle a "noinline" attribute; arguments as in
4379 struct attribute_spec.handler. */
4382 handle_noinline_attribute (tree *node, tree name,
4383 tree args ATTRIBUTE_UNUSED,
4384 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4386 if (TREE_CODE (*node) == FUNCTION_DECL)
4387 DECL_UNINLINABLE (*node) = 1;
4390 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4391 *no_add_attrs = true;
4397 /* Handle a "always_inline" attribute; arguments as in
4398 struct attribute_spec.handler. */
4401 handle_always_inline_attribute (tree *node, tree name,
4402 tree args ATTRIBUTE_UNUSED,
4403 int flags ATTRIBUTE_UNUSED,
4406 if (TREE_CODE (*node) == FUNCTION_DECL)
4408 /* Do nothing else, just set the attribute. We'll get at
4409 it later with lookup_attribute. */
4413 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4414 *no_add_attrs = true;
4420 /* Handle a "used" attribute; arguments as in
4421 struct attribute_spec.handler. */
4424 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4425 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4429 if (TREE_CODE (node) == FUNCTION_DECL
4430 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4432 TREE_USED (node) = 1;
4436 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4437 *no_add_attrs = true;
4443 /* Handle a "unused" attribute; arguments as in
4444 struct attribute_spec.handler. */
4447 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4448 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4454 if (TREE_CODE (decl) == PARM_DECL
4455 || TREE_CODE (decl) == VAR_DECL
4456 || TREE_CODE (decl) == FUNCTION_DECL
4457 || TREE_CODE (decl) == LABEL_DECL
4458 || TREE_CODE (decl) == TYPE_DECL)
4459 TREE_USED (decl) = 1;
4462 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4463 *no_add_attrs = true;
4468 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4469 *node = build_type_copy (*node);
4470 TREE_USED (*node) = 1;
4476 /* Handle a "const" attribute; arguments as in
4477 struct attribute_spec.handler. */
4480 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4481 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4483 tree type = TREE_TYPE (*node);
4485 /* See FIXME comment on noreturn in c_common_attribute_table. */
4486 if (TREE_CODE (*node) == FUNCTION_DECL)
4487 TREE_READONLY (*node) = 1;
4488 else if (TREE_CODE (type) == POINTER_TYPE
4489 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4491 = build_pointer_type
4492 (build_type_variant (TREE_TYPE (type), 1,
4493 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4496 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4497 *no_add_attrs = true;
4503 /* Handle a "transparent_union" attribute; arguments as in
4504 struct attribute_spec.handler. */
4507 handle_transparent_union_attribute (tree *node, tree name,
4508 tree args ATTRIBUTE_UNUSED, int flags,
4511 tree decl = NULL_TREE;
4518 type = &TREE_TYPE (decl);
4519 is_type = TREE_CODE (*node) == TYPE_DECL;
4521 else if (TYPE_P (*node))
4522 type = node, is_type = 1;
4525 && TREE_CODE (*type) == UNION_TYPE
4527 || (TYPE_FIELDS (*type) != 0
4528 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4530 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4531 *type = build_type_copy (*type);
4532 TYPE_TRANSPARENT_UNION (*type) = 1;
4534 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4535 && TREE_CODE (*type) == UNION_TYPE
4536 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4537 DECL_TRANSPARENT_UNION (decl) = 1;
4540 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4541 *no_add_attrs = true;
4547 /* Handle a "constructor" attribute; arguments as in
4548 struct attribute_spec.handler. */
4551 handle_constructor_attribute (tree *node, tree name,
4552 tree args ATTRIBUTE_UNUSED,
4553 int flags ATTRIBUTE_UNUSED,
4557 tree type = TREE_TYPE (decl);
4559 if (TREE_CODE (decl) == FUNCTION_DECL
4560 && TREE_CODE (type) == FUNCTION_TYPE
4561 && decl_function_context (decl) == 0)
4563 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4564 TREE_USED (decl) = 1;
4568 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4569 *no_add_attrs = true;
4575 /* Handle a "destructor" attribute; arguments as in
4576 struct attribute_spec.handler. */
4579 handle_destructor_attribute (tree *node, tree name,
4580 tree args ATTRIBUTE_UNUSED,
4581 int flags ATTRIBUTE_UNUSED,
4585 tree type = TREE_TYPE (decl);
4587 if (TREE_CODE (decl) == FUNCTION_DECL
4588 && TREE_CODE (type) == FUNCTION_TYPE
4589 && decl_function_context (decl) == 0)
4591 DECL_STATIC_DESTRUCTOR (decl) = 1;
4592 TREE_USED (decl) = 1;
4596 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4597 *no_add_attrs = true;
4603 /* Handle a "mode" attribute; arguments as in
4604 struct attribute_spec.handler. */
4607 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4608 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4612 *no_add_attrs = true;
4614 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4615 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4619 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4620 int len = strlen (p);
4621 enum machine_mode mode = VOIDmode;
4625 if (len > 4 && p[0] == '_' && p[1] == '_'
4626 && p[len - 1] == '_' && p[len - 2] == '_')
4628 char *newp = alloca (len - 1);
4630 strcpy (newp, &p[2]);
4631 newp[len - 4] = '\0';
4635 /* Change this type to have a type with the specified mode.
4636 First check for the special modes. */
4637 if (! strcmp (p, "byte"))
4639 else if (!strcmp (p, "word"))
4641 else if (! strcmp (p, "pointer"))
4644 for (j = 0; j < NUM_MACHINE_MODES; j++)
4645 if (!strcmp (p, GET_MODE_NAME (j)))
4646 mode = (enum machine_mode) j;
4648 if (mode == VOIDmode)
4649 error ("unknown machine mode `%s'", p);
4650 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
4651 (mode, TREE_UNSIGNED (type))))
4652 error ("no data type for mode `%s'", p);
4653 else if ((TREE_CODE (type) == POINTER_TYPE
4654 || TREE_CODE (type) == REFERENCE_TYPE)
4655 && !(*targetm.valid_pointer_mode) (mode))
4656 error ("invalid pointer mode `%s'", p);
4659 /* If this is a vector, make sure we either have hardware
4660 support, or we can emulate it. */
4661 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4663 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4667 if (TREE_CODE (type) == POINTER_TYPE)
4669 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4673 else if (TREE_CODE (type) == REFERENCE_TYPE)
4675 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4681 /* No need to layout the type here. The caller should do this. */
4688 /* Handle a "section" attribute; arguments as in
4689 struct attribute_spec.handler. */
4692 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4693 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4697 if (targetm.have_named_sections)
4699 if ((TREE_CODE (decl) == FUNCTION_DECL
4700 || TREE_CODE (decl) == VAR_DECL)
4701 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4703 if (TREE_CODE (decl) == VAR_DECL
4704 && current_function_decl != NULL_TREE
4705 && ! TREE_STATIC (decl))
4707 error ("%Jsection attribute cannot be specified for "
4708 "local variables", decl);
4709 *no_add_attrs = true;
4712 /* The decl may have already been given a section attribute
4713 from a previous declaration. Ensure they match. */
4714 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4715 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4716 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4718 error ("%Jsection of '%D' conflicts with previous declaration",
4720 *no_add_attrs = true;
4723 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4727 error ("%Jsection attribute not allowed for '%D'", *node, *node);
4728 *no_add_attrs = true;
4733 error ("%Jsection attributes are not supported for this target", *node);
4734 *no_add_attrs = true;
4740 /* Handle a "aligned" attribute; arguments as in
4741 struct attribute_spec.handler. */
4744 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4745 int flags, bool *no_add_attrs)
4747 tree decl = NULL_TREE;
4750 tree align_expr = (args ? TREE_VALUE (args)
4751 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4757 type = &TREE_TYPE (decl);
4758 is_type = TREE_CODE (*node) == TYPE_DECL;
4760 else if (TYPE_P (*node))
4761 type = node, is_type = 1;
4763 /* Strip any NOPs of any kind. */
4764 while (TREE_CODE (align_expr) == NOP_EXPR
4765 || TREE_CODE (align_expr) == CONVERT_EXPR
4766 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4767 align_expr = TREE_OPERAND (align_expr, 0);
4769 if (TREE_CODE (align_expr) != INTEGER_CST)
4771 error ("requested alignment is not a constant");
4772 *no_add_attrs = true;
4774 else if ((i = tree_log2 (align_expr)) == -1)
4776 error ("requested alignment is not a power of 2");
4777 *no_add_attrs = true;
4779 else if (i > HOST_BITS_PER_INT - 2)
4781 error ("requested alignment is too large");
4782 *no_add_attrs = true;
4786 /* If we have a TYPE_DECL, then copy the type, so that we
4787 don't accidentally modify a builtin type. See pushdecl. */
4788 if (decl && TREE_TYPE (decl) != error_mark_node
4789 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4791 tree tt = TREE_TYPE (decl);
4792 *type = build_type_copy (*type);
4793 DECL_ORIGINAL_TYPE (decl) = tt;
4794 TYPE_NAME (*type) = decl;
4795 TREE_USED (*type) = TREE_USED (decl);
4796 TREE_TYPE (decl) = *type;
4798 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4799 *type = build_type_copy (*type);
4801 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4802 TYPE_USER_ALIGN (*type) = 1;
4804 else if (TREE_CODE (decl) != VAR_DECL
4805 && TREE_CODE (decl) != FIELD_DECL)
4807 error ("%Jalignment may not be specified for '%D'", decl, decl);
4808 *no_add_attrs = true;
4812 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4813 DECL_USER_ALIGN (decl) = 1;
4819 /* Handle a "weak" attribute; arguments as in
4820 struct attribute_spec.handler. */
4823 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4824 tree args ATTRIBUTE_UNUSED,
4825 int flags ATTRIBUTE_UNUSED,
4826 bool *no_add_attrs ATTRIBUTE_UNUSED)
4828 declare_weak (*node);
4833 /* Handle an "alias" attribute; arguments as in
4834 struct attribute_spec.handler. */
4837 handle_alias_attribute (tree *node, tree name, tree args,
4838 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4842 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4843 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4845 error ("%J'%D' defined both normally and as an alias", decl, decl);
4846 *no_add_attrs = true;
4848 else if (decl_function_context (decl) == 0)
4852 id = TREE_VALUE (args);
4853 if (TREE_CODE (id) != STRING_CST)
4855 error ("alias arg not a string");
4856 *no_add_attrs = true;
4859 id = get_identifier (TREE_STRING_POINTER (id));
4860 /* This counts as a use of the object pointed to. */
4863 if (TREE_CODE (decl) == FUNCTION_DECL)
4864 DECL_INITIAL (decl) = error_mark_node;
4866 DECL_EXTERNAL (decl) = 0;
4870 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4871 *no_add_attrs = true;
4877 /* Handle an "visibility" attribute; arguments as in
4878 struct attribute_spec.handler. */
4881 handle_visibility_attribute (tree *node, tree name, tree args,
4882 int flags ATTRIBUTE_UNUSED,
4886 tree id = TREE_VALUE (args);
4888 *no_add_attrs = true;
4890 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
4892 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4896 if (TREE_CODE (id) != STRING_CST)
4898 error ("visibility arg not a string");
4902 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
4903 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4904 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
4905 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
4906 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
4907 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
4908 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
4909 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
4911 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4916 /* Handle an "tls_model" attribute; arguments as in
4917 struct attribute_spec.handler. */
4920 handle_tls_model_attribute (tree *node, tree name, tree args,
4921 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4925 if (! DECL_THREAD_LOCAL (decl))
4927 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4928 *no_add_attrs = true;
4934 id = TREE_VALUE (args);
4935 if (TREE_CODE (id) != STRING_CST)
4937 error ("tls_model arg not a string");
4938 *no_add_attrs = true;
4941 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4942 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4943 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4944 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4946 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4947 *no_add_attrs = true;
4955 /* Handle a "no_instrument_function" attribute; arguments as in
4956 struct attribute_spec.handler. */
4959 handle_no_instrument_function_attribute (tree *node, tree name,
4960 tree args ATTRIBUTE_UNUSED,
4961 int flags ATTRIBUTE_UNUSED,
4966 if (TREE_CODE (decl) != FUNCTION_DECL)
4968 error ("%J'%E' attribute applies only to functions", decl, name);
4969 *no_add_attrs = true;
4971 else if (DECL_INITIAL (decl))
4973 error ("%Jcan't set '%E' attribute after definition", decl, name);
4974 *no_add_attrs = true;
4977 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
4982 /* Handle a "malloc" attribute; arguments as in
4983 struct attribute_spec.handler. */
4986 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4987 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4989 if (TREE_CODE (*node) == FUNCTION_DECL)
4990 DECL_IS_MALLOC (*node) = 1;
4991 /* ??? TODO: Support types. */
4994 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4995 *no_add_attrs = true;
5001 /* Handle a "no_limit_stack" attribute; arguments as in
5002 struct attribute_spec.handler. */
5005 handle_no_limit_stack_attribute (tree *node, tree name,
5006 tree args ATTRIBUTE_UNUSED,
5007 int flags ATTRIBUTE_UNUSED,
5012 if (TREE_CODE (decl) != FUNCTION_DECL)
5014 error ("%J'%E' attribute applies only to functions", decl, name);
5015 *no_add_attrs = true;
5017 else if (DECL_INITIAL (decl))
5019 error ("%Jcan't set '%E' attribute after definition", decl, name);
5020 *no_add_attrs = true;
5023 DECL_NO_LIMIT_STACK (decl) = 1;
5028 /* Handle a "pure" attribute; arguments as in
5029 struct attribute_spec.handler. */
5032 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5033 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5035 if (TREE_CODE (*node) == FUNCTION_DECL)
5036 DECL_IS_PURE (*node) = 1;
5037 /* ??? TODO: Support types. */
5040 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5041 *no_add_attrs = true;
5047 /* Handle a "deprecated" attribute; arguments as in
5048 struct attribute_spec.handler. */
5051 handle_deprecated_attribute (tree *node, tree name,
5052 tree args ATTRIBUTE_UNUSED, int flags,
5055 tree type = NULL_TREE;
5057 const char *what = NULL;
5062 type = TREE_TYPE (decl);
5064 if (TREE_CODE (decl) == TYPE_DECL
5065 || TREE_CODE (decl) == PARM_DECL
5066 || TREE_CODE (decl) == VAR_DECL
5067 || TREE_CODE (decl) == FUNCTION_DECL
5068 || TREE_CODE (decl) == FIELD_DECL)
5069 TREE_DEPRECATED (decl) = 1;
5073 else if (TYPE_P (*node))
5075 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5076 *node = build_type_copy (*node);
5077 TREE_DEPRECATED (*node) = 1;
5085 *no_add_attrs = true;
5086 if (type && TYPE_NAME (type))
5088 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5089 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5090 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5091 && DECL_NAME (TYPE_NAME (type)))
5092 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5095 warning ("`%s' attribute ignored for `%s'",
5096 IDENTIFIER_POINTER (name), what);
5098 warning ("`%s' attribute ignored",
5099 IDENTIFIER_POINTER (name));
5105 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5106 to prevent us from duplicating type nodes unnecessarily.
5107 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5108 since we want to distinguish types that are essentially identical (except
5109 for their debug representation), we use a local list here. */
5110 static GTY(()) tree vector_type_node_list = 0;
5112 /* Handle a "vector_size" attribute; arguments as in
5113 struct attribute_spec.handler. */
5116 handle_vector_size_attribute (tree *node, tree name, tree args,
5117 int flags ATTRIBUTE_UNUSED,
5120 unsigned HOST_WIDE_INT vecsize, nunits;
5121 enum machine_mode mode, orig_mode, new_mode;
5122 tree type = *node, new_type = NULL_TREE;
5123 tree type_list_node;
5125 *no_add_attrs = true;
5127 if (! host_integerp (TREE_VALUE (args), 1))
5129 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5133 /* Get the vector size (in bytes). */
5134 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5136 /* We need to provide for vector pointers, vector arrays, and
5137 functions returning vectors. For example:
5139 __attribute__((vector_size(16))) short *foo;
5141 In this case, the mode is SI, but the type being modified is
5142 HI, so we need to look further. */
5144 while (POINTER_TYPE_P (type)
5145 || TREE_CODE (type) == FUNCTION_TYPE
5146 || TREE_CODE (type) == METHOD_TYPE
5147 || TREE_CODE (type) == ARRAY_TYPE)
5148 type = TREE_TYPE (type);
5150 /* Get the mode of the type being modified. */
5151 orig_mode = TYPE_MODE (type);
5153 if (TREE_CODE (type) == RECORD_TYPE
5154 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5155 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5156 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5158 error ("invalid vector type for attribute `%s'",
5159 IDENTIFIER_POINTER (name));
5163 /* Calculate how many units fit in the vector. */
5164 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5166 /* Find a suitably sized vector. */
5167 new_mode = VOIDmode;
5168 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5170 : MODE_VECTOR_FLOAT);
5172 mode = GET_MODE_WIDER_MODE (mode))
5173 if (vecsize == GET_MODE_SIZE (mode)
5174 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5180 if (new_mode == VOIDmode)
5182 error ("no vector mode with the size and type specified could be found");
5186 for (type_list_node = vector_type_node_list; type_list_node;
5187 type_list_node = TREE_CHAIN (type_list_node))
5189 tree other_type = TREE_VALUE (type_list_node);
5190 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5191 tree fields = TYPE_FIELDS (record);
5192 tree field_type = TREE_TYPE (fields);
5193 tree array_type = TREE_TYPE (field_type);
5194 if (TREE_CODE (fields) != FIELD_DECL
5195 || TREE_CODE (field_type) != ARRAY_TYPE)
5198 if (TYPE_MODE (other_type) == mode && type == array_type)
5200 new_type = other_type;
5205 if (new_type == NULL_TREE)
5207 tree index, array, rt, list_node;
5209 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5210 TREE_UNSIGNED (type));
5214 error ("no vector mode with the size and type specified could be found");
5218 new_type = build_type_copy (new_type);
5220 /* If this is a vector, make sure we either have hardware
5221 support, or we can emulate it. */
5222 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5223 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5224 && !vector_mode_valid_p (mode))
5226 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5230 /* Set the debug information here, because this is the only
5231 place where we know the underlying type for a vector made
5232 with vector_size. For debugging purposes we pretend a vector
5233 is an array within a structure. */
5234 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5235 array = build_array_type (type, build_index_type (index));
5236 rt = make_node (RECORD_TYPE);
5238 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5239 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5241 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5243 list_node = build_tree_list (NULL, new_type);
5244 TREE_CHAIN (list_node) = vector_type_node_list;
5245 vector_type_node_list = list_node;
5248 /* Build back pointers if needed. */
5249 *node = vector_size_helper (*node, new_type);
5254 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5257 If we requested a pointer to a vector, build up the pointers that
5258 we stripped off while looking for the inner type. Similarly for
5259 return values from functions.
5261 The argument "type" is the top of the chain, and "bottom" is the
5262 new type which we will point to. */
5265 vector_size_helper (tree type, tree bottom)
5269 if (POINTER_TYPE_P (type))
5271 inner = vector_size_helper (TREE_TYPE (type), bottom);
5272 outer = build_pointer_type (inner);
5274 else if (TREE_CODE (type) == ARRAY_TYPE)
5276 inner = vector_size_helper (TREE_TYPE (type), bottom);
5277 outer = build_array_type (inner, TYPE_DOMAIN (type));
5279 else if (TREE_CODE (type) == FUNCTION_TYPE)
5281 inner = vector_size_helper (TREE_TYPE (type), bottom);
5282 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5284 else if (TREE_CODE (type) == METHOD_TYPE)
5286 inner = vector_size_helper (TREE_TYPE (type), bottom);
5287 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5289 TYPE_ARG_TYPES (type));
5294 TREE_READONLY (outer) = TREE_READONLY (type);
5295 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5300 /* Handle the "nonnull" attribute. */
5302 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5303 tree args, int flags ATTRIBUTE_UNUSED,
5307 unsigned HOST_WIDE_INT attr_arg_num;
5309 /* If no arguments are specified, all pointer arguments should be
5310 non-null. Verify a full prototype is given so that the arguments
5311 will have the correct types when we actually check them later. */
5314 if (! TYPE_ARG_TYPES (type))
5316 error ("nonnull attribute without arguments on a non-prototype");
5317 *no_add_attrs = true;
5322 /* Argument list specified. Verify that each argument number references
5323 a pointer argument. */
5324 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5327 unsigned HOST_WIDE_INT arg_num, ck_num;
5329 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5331 error ("nonnull argument has invalid operand number (arg %lu)",
5332 (unsigned long) attr_arg_num);
5333 *no_add_attrs = true;
5337 argument = TYPE_ARG_TYPES (type);
5340 for (ck_num = 1; ; ck_num++)
5342 if (! argument || ck_num == arg_num)
5344 argument = TREE_CHAIN (argument);
5348 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5350 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5351 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5352 *no_add_attrs = true;
5356 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5358 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5359 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5360 *no_add_attrs = true;
5369 /* Check the argument list of a function call for null in argument slots
5370 that are marked as requiring a non-null pointer argument. */
5373 check_function_nonnull (tree attrs, tree params)
5375 tree a, args, param;
5378 for (a = attrs; a; a = TREE_CHAIN (a))
5380 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5382 args = TREE_VALUE (a);
5384 /* Walk the argument list. If we encounter an argument number we
5385 should check for non-null, do it. If the attribute has no args,
5386 then every pointer argument is checked (in which case the check
5387 for pointer type is done in check_nonnull_arg). */
5388 for (param = params, param_num = 1; ;
5389 param_num++, param = TREE_CHAIN (param))
5393 if (! args || nonnull_check_p (args, param_num))
5394 check_function_arguments_recurse (check_nonnull_arg, NULL,
5402 /* Helper for check_function_nonnull; given a list of operands which
5403 must be non-null in ARGS, determine if operand PARAM_NUM should be
5407 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5409 unsigned HOST_WIDE_INT arg_num;
5411 for (; args; args = TREE_CHAIN (args))
5413 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5416 if (arg_num == param_num)
5422 /* Check that the function argument PARAM (which is operand number
5423 PARAM_NUM) is non-null. This is called by check_function_nonnull
5424 via check_function_arguments_recurse. */
5427 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5428 unsigned HOST_WIDE_INT param_num)
5430 /* Just skip checking the argument if it's not a pointer. This can
5431 happen if the "nonnull" attribute was given without an operand
5432 list (which means to check every pointer argument). */
5434 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5437 if (integer_zerop (param))
5438 warning ("null argument where non-null required (arg %lu)",
5439 (unsigned long) param_num);
5442 /* Helper for nonnull attribute handling; fetch the operand number
5443 from the attribute argument list. */
5446 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5448 /* Strip any conversions from the arg number and verify they
5450 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5451 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5452 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5453 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5455 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5456 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5459 *valp = TREE_INT_CST_LOW (arg_num_expr);
5463 /* Handle a "nothrow" attribute; arguments as in
5464 struct attribute_spec.handler. */
5467 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5468 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5470 if (TREE_CODE (*node) == FUNCTION_DECL)
5471 TREE_NOTHROW (*node) = 1;
5472 /* ??? TODO: Support types. */
5475 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5476 *no_add_attrs = true;
5482 /* Handle a "cleanup" attribute; arguments as in
5483 struct attribute_spec.handler. */
5486 handle_cleanup_attribute (tree *node, tree name, tree args,
5487 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5490 tree cleanup_id, cleanup_decl;
5492 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5493 for global destructors in C++. This requires infrastructure that
5494 we don't have generically at the moment. It's also not a feature
5495 we'd be missing too much, since we do have attribute constructor. */
5496 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5498 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5499 *no_add_attrs = true;
5503 /* Verify that the argument is a function in scope. */
5504 /* ??? We could support pointers to functions here as well, if
5505 that was considered desirable. */
5506 cleanup_id = TREE_VALUE (args);
5507 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5509 error ("cleanup arg not an identifier");
5510 *no_add_attrs = true;
5513 cleanup_decl = lookup_name (cleanup_id);
5514 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5516 error ("cleanup arg not a function");
5517 *no_add_attrs = true;
5521 /* That the function has proper type is checked with the
5522 eventual call to build_function_call. */
5527 /* Handle a "warn_unused_result" attribute. No special handling. */
5530 handle_warn_unused_result_attribute (tree *node, tree name,
5531 tree args ATTRIBUTE_UNUSED,
5532 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5534 /* Ignore the attribute for functions not returning any value. */
5535 if (VOID_TYPE_P (TREE_TYPE (*node)))
5537 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5538 *no_add_attrs = true;
5544 /* Check for valid arguments being passed to a function. */
5546 check_function_arguments (tree attrs, tree params)
5548 /* Check for null being passed in a pointer argument that must be
5549 non-null. We also need to do this if format checking is enabled. */
5552 check_function_nonnull (attrs, params);
5554 /* Check for errors in format strings. */
5557 check_function_format (NULL, attrs, params);
5560 /* Generic argument checking recursion routine. PARAM is the argument to
5561 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5562 once the argument is resolved. CTX is context for the callback. */
5564 check_function_arguments_recurse (void (*callback)
5565 (void *, tree, unsigned HOST_WIDE_INT),
5566 void *ctx, tree param,
5567 unsigned HOST_WIDE_INT param_num)
5569 if (TREE_CODE (param) == NOP_EXPR)
5571 /* Strip coercion. */
5572 check_function_arguments_recurse (callback, ctx,
5573 TREE_OPERAND (param, 0), param_num);
5577 if (TREE_CODE (param) == CALL_EXPR)
5579 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5581 bool found_format_arg = false;
5583 /* See if this is a call to a known internationalization function
5584 that modifies a format arg. Such a function may have multiple
5585 format_arg attributes (for example, ngettext). */
5587 for (attrs = TYPE_ATTRIBUTES (type);
5589 attrs = TREE_CHAIN (attrs))
5590 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5593 tree format_num_expr;
5597 /* Extract the argument number, which was previously checked
5599 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5600 while (TREE_CODE (format_num_expr) == NOP_EXPR
5601 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5602 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5603 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5605 if (TREE_CODE (format_num_expr) != INTEGER_CST
5606 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5609 format_num = TREE_INT_CST_LOW (format_num_expr);
5611 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5613 inner_args = TREE_CHAIN (inner_args), i++)
5614 if (i == format_num)
5616 check_function_arguments_recurse (callback, ctx,
5617 TREE_VALUE (inner_args),
5619 found_format_arg = true;
5624 /* If we found a format_arg attribute and did a recursive check,
5625 we are done with checking this argument. Otherwise, we continue
5626 and this will be considered a non-literal. */
5627 if (found_format_arg)
5631 if (TREE_CODE (param) == COND_EXPR)
5633 /* Check both halves of the conditional expression. */
5634 check_function_arguments_recurse (callback, ctx,
5635 TREE_OPERAND (param, 1), param_num);
5636 check_function_arguments_recurse (callback, ctx,
5637 TREE_OPERAND (param, 2), param_num);
5641 (*callback) (ctx, param, param_num);
5644 /* Function to help qsort sort FIELD_DECLs by name order. */
5647 field_decl_cmp (const void *x_p, const void *y_p)
5649 const tree *const x = x_p;
5650 const tree *const y = y_p;
5651 if (DECL_NAME (*x) == DECL_NAME (*y))
5652 /* A nontype is "greater" than a type. */
5653 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5654 if (DECL_NAME (*x) == NULL_TREE)
5656 if (DECL_NAME (*y) == NULL_TREE)
5658 if (DECL_NAME (*x) < DECL_NAME (*y))
5664 gt_pointer_operator new_value;
5668 /* This routine compares two fields like field_decl_cmp but using the
5669 pointer operator in resort_data. */
5672 resort_field_decl_cmp (const void *x_p, const void *y_p)
5674 const tree *const x = x_p;
5675 const tree *const y = y_p;
5677 if (DECL_NAME (*x) == DECL_NAME (*y))
5678 /* A nontype is "greater" than a type. */
5679 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5680 if (DECL_NAME (*x) == NULL_TREE)
5682 if (DECL_NAME (*y) == NULL_TREE)
5685 tree d1 = DECL_NAME (*x);
5686 tree d2 = DECL_NAME (*y);
5687 resort_data.new_value (&d1, resort_data.cookie);
5688 resort_data.new_value (&d2, resort_data.cookie);
5695 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5698 resort_sorted_fields (void *obj,
5699 void *orig_obj ATTRIBUTE_UNUSED ,
5700 gt_pointer_operator new_value,
5703 struct sorted_fields_type *sf = obj;
5704 resort_data.new_value = new_value;
5705 resort_data.cookie = cookie;
5706 qsort (&sf->elts[0], sf->len, sizeof (tree),
5707 resort_field_decl_cmp);
5710 /* Used by estimate_num_insns. Estimate number of instructions seen
5711 by given statement. */
5713 c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
5718 if (TYPE_P (x) || DECL_P (x))
5723 /* Assume that constants and references counts nothing. These should
5724 be majorized by amount of operations among them we count later
5725 and are common target of CSE and similar optimizations. */
5726 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
5727 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
5729 switch (TREE_CODE (x))
5731 /* Recognize assignments of large structures and constructors of
5738 size = int_size_in_bytes (TREE_TYPE (x));
5740 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
5743 *count += ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
5748 tree decl = get_callee_fndecl (x);
5750 if (decl && DECL_BUILT_IN (decl))
5751 switch (DECL_FUNCTION_CODE (decl))
5753 case BUILT_IN_CONSTANT_P:
5756 case BUILT_IN_EXPECT:
5764 /* Few special cases of expensive operations. This is usefull
5765 to avoid inlining on functions having too many of these. */
5766 case TRUNC_DIV_EXPR:
5768 case FLOOR_DIV_EXPR:
5769 case ROUND_DIV_EXPR:
5770 case TRUNC_MOD_EXPR:
5772 case FLOOR_MOD_EXPR:
5773 case ROUND_MOD_EXPR:
5777 /* Various containers that will produce no code themselves. */
5784 case IDENTIFIER_NODE:
5785 case PLACEHOLDER_EXPR:
5786 case WITH_CLEANUP_EXPR:
5787 case CLEANUP_POINT_EXPR:
5789 case VIEW_CONVERT_EXPR:
5795 case TRY_CATCH_EXPR:
5796 case TRY_FINALLY_EXPR:
5799 case LABELED_BLOCK_EXPR:
5800 case EXIT_BLOCK_EXPR:
5801 case EXPR_WITH_FILE_LOCATION:
5818 /* Do not account static initializers. */
5819 if (TREE_STATIC (TREE_OPERAND (x, 0)))
5828 /* Estimate number of instructions that will be created by expanding the body. */
5830 c_estimate_num_insns (tree decl)
5833 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl), c_estimate_num_insns_1, &num);
5837 /* Used by c_decl_uninit to find where expressions like x = x + 1; */
5840 c_decl_uninit_1 (tree *t, int *walk_sub_trees, void *x)
5842 /* If x = EXP(&x)EXP, then do not warn about the use of x. */
5843 if (TREE_CODE (*t) == ADDR_EXPR && TREE_OPERAND (*t, 0) == x)
5845 *walk_sub_trees = 0;
5853 /* Find out if a variable is uninitialized based on DECL_INITIAL. */
5856 c_decl_uninit (tree t)
5858 /* int x = x; is GCC extension to turn off this warning, only if warn_init_self is zero. */
5859 if (DECL_INITIAL (t) == t)
5860 return warn_init_self ? true : false;
5862 /* Walk the trees looking for the variable itself. */
5863 if (walk_tree_without_duplicates (&DECL_INITIAL (t), c_decl_uninit_1, t))
5868 /* Issue the error given by MSGID, indicating that it occurred before
5869 TOKEN, which had the associated VALUE. */
5872 c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5874 const char *string = _(msgid);
5876 if (token == CPP_EOF)
5877 error ("%s at end of input", string);
5878 else if (token == CPP_CHAR || token == CPP_WCHAR)
5880 unsigned int val = TREE_INT_CST_LOW (value);
5881 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5882 if (val <= UCHAR_MAX && ISGRAPH (val))
5883 error ("%s before %s'%c'", string, ell, val);
5885 error ("%s before %s'\\x%x'", string, ell, val);
5887 else if (token == CPP_STRING
5888 || token == CPP_WSTRING)
5889 error ("%s before string constant", string);
5890 else if (token == CPP_NUMBER)
5891 error ("%s before numeric constant", string);
5892 else if (token == CPP_NAME)
5893 error ("%s before \"%s\"", string, IDENTIFIER_POINTER (value));
5894 else if (token < N_TTYPES)
5895 error ("%s before '%s' token", string, cpp_type2name (token));
5897 error ("%s", string);
5900 #include "gt-c-common.h"