1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
36 #include "diagnostic.h"
41 #include "langhooks.h"
42 #include "tree-inline.h"
46 cpp_reader *parse_in; /* Declared in c-pragma.h. */
48 /* We let tm.h override the types used here, to handle trivial differences
49 such as the choice of unsigned int or long unsigned int for size_t.
50 When machines start needing nontrivial differences in the size type,
51 it would be best to do something here to figure out automatically
52 from other information what type to use. */
55 #define SIZE_TYPE "long unsigned int"
59 #define WCHAR_TYPE "int"
62 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
63 #define MODIFIED_WCHAR_TYPE \
64 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
67 #define PTRDIFF_TYPE "long int"
71 #define WINT_TYPE "unsigned int"
75 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
77 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
83 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
85 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
86 ? "long unsigned int" \
87 : "long long unsigned int"))
90 /* The following symbols are subsumed in the c_global_trees array, and
91 listed here individually for documentation purposes.
93 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
95 tree short_integer_type_node;
96 tree long_integer_type_node;
97 tree long_long_integer_type_node;
99 tree short_unsigned_type_node;
100 tree long_unsigned_type_node;
101 tree long_long_unsigned_type_node;
103 tree truthvalue_type_node;
104 tree truthvalue_false_node;
105 tree truthvalue_true_node;
107 tree ptrdiff_type_node;
109 tree unsigned_char_type_node;
110 tree signed_char_type_node;
111 tree wchar_type_node;
112 tree signed_wchar_type_node;
113 tree unsigned_wchar_type_node;
115 tree float_type_node;
116 tree double_type_node;
117 tree long_double_type_node;
119 tree complex_integer_type_node;
120 tree complex_float_type_node;
121 tree complex_double_type_node;
122 tree complex_long_double_type_node;
124 tree intQI_type_node;
125 tree intHI_type_node;
126 tree intSI_type_node;
127 tree intDI_type_node;
128 tree intTI_type_node;
130 tree unsigned_intQI_type_node;
131 tree unsigned_intHI_type_node;
132 tree unsigned_intSI_type_node;
133 tree unsigned_intDI_type_node;
134 tree unsigned_intTI_type_node;
136 tree widest_integer_literal_type_node;
137 tree widest_unsigned_literal_type_node;
139 Nodes for types `void *' and `const void *'.
141 tree ptr_type_node, const_ptr_type_node;
143 Nodes for types `char *' and `const char *'.
145 tree string_type_node, const_string_type_node;
147 Type `char[SOMENUMBER]'.
148 Used when an array of char is needed and the size is irrelevant.
150 tree char_array_type_node;
152 Type `int[SOMENUMBER]' or something like it.
153 Used when an array of int needed and the size is irrelevant.
155 tree int_array_type_node;
157 Type `wchar_t[SOMENUMBER]' or something like it.
158 Used when a wide string literal is created.
160 tree wchar_array_type_node;
162 Type `int ()' -- used for implicit declaration of functions.
164 tree default_function_type;
166 A VOID_TYPE node, packaged in a TREE_LIST.
170 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
171 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
172 VAR_DECLS, but C++ does.)
174 tree function_name_decl_node;
175 tree pretty_function_name_decl_node;
176 tree c99_function_name_decl_node;
178 Stack of nested function name VAR_DECLs.
180 tree saved_function_name_decls;
184 tree c_global_trees[CTI_MAX];
186 /* TRUE if a code represents a statement. The front end init
187 langhook should take care of initialization of this array. */
189 bool statement_code_p[MAX_TREE_CODES];
191 /* Switches common to the C front ends. */
193 /* Nonzero if prepreprocessing only. */
195 int flag_preprocess_only;
197 /* Nonzero means don't output line number information. */
199 char flag_no_line_commands;
201 /* Nonzero causes -E output not to be done, but directives such as
202 #define that have side effects are still obeyed. */
206 /* Nonzero means dump macros in some fashion. */
208 char flag_dump_macros;
210 /* Nonzero means pass #include lines through to the output. */
212 char flag_dump_includes;
214 /* The file name to which we should write a precompiled header, or
215 NULL if no header will be written in this compile. */
217 const char *pch_file;
219 /* Nonzero if an ISO standard was selected. It rejects macros in the
223 /* Nonzero if -undef was given. It suppresses target built-in macros
227 /* Nonzero means don't recognize the non-ANSI builtin functions. */
231 /* Nonzero means don't recognize the non-ANSI builtin functions.
234 int flag_no_nonansi_builtin;
236 /* Nonzero means give `double' the same size as `float'. */
238 int flag_short_double;
240 /* Nonzero means give `wchar_t' the same size as `short'. */
242 int flag_short_wchar;
244 /* Nonzero means allow Microsoft extensions without warnings or errors. */
245 int flag_ms_extensions;
247 /* Nonzero means don't recognize the keyword `asm'. */
251 /* Nonzero means give string constants the type `const char *', as mandated
254 int flag_const_strings;
256 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
258 int flag_signed_bitfields = 1;
259 int explicit_flag_signed_bitfields;
261 /* Nonzero means warn about pointer casts that can drop a type qualifier
262 from the pointer target type. */
266 /* Warn about functions which might be candidates for format attributes. */
268 int warn_missing_format_attribute;
270 /* Nonzero means warn about sizeof(function) or addition/subtraction
271 of function pointers. */
273 int warn_pointer_arith;
275 /* Nonzero means warn for any global function def
276 without separate previous prototype decl. */
278 int warn_missing_prototypes;
280 /* Warn if adding () is suggested. */
282 int warn_parentheses;
284 /* Warn if initializer is not completely bracketed. */
286 int warn_missing_braces;
288 /* Warn about comparison of signed and unsigned values.
289 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified
290 (in which case -Wextra gets to decide). */
292 int warn_sign_compare = -1;
294 /* Nonzero means warn about usage of long long when `-pedantic'. */
296 int warn_long_long = 1;
298 /* Nonzero means warn about deprecated conversion from string constant to
301 int warn_write_strings;
303 /* Nonzero means warn about multiple (redundant) decls for the same single
304 variable or function. */
306 int warn_redundant_decls;
308 /* Warn about testing equality of floating point numbers. */
310 int warn_float_equal;
312 /* Warn about a subscript that has type char. */
314 int warn_char_subscripts;
316 /* Warn if a type conversion is done that might have confusing results. */
320 /* Warn about #pragma directives that are not recognized. */
322 int warn_unknown_pragmas; /* Tri state variable. */
324 /* Warn about format/argument anomalies in calls to formatted I/O functions
325 (*printf, *scanf, strftime, strfmon, etc.). */
329 /* Warn about Y2K problems with strftime formats. */
333 /* Warn about excess arguments to formats. */
335 int warn_format_extra_args;
337 /* Warn about zero-length formats. */
339 int warn_format_zero_length;
341 /* Warn about non-literal format arguments. */
343 int warn_format_nonliteral;
345 /* Warn about possible security problems with calls to format functions. */
347 int warn_format_security;
349 /* Zero means that faster, ...NonNil variants of objc_msgSend...
350 calls will be used in ObjC; passing nil receivers to such calls
351 will most likely result in crashes. */
352 int flag_nil_receivers = 1;
354 /* Nonzero means that we will allow new ObjC exception syntax (@throw,
355 @try, etc.) in source code. */
356 int flag_objc_exceptions = 0;
358 /* Nonzero means that code generation will be altered to support
359 "zero-link" execution. This currently affects ObjC only, but may
360 affect other languages in the future. */
361 int flag_zero_link = 0;
363 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
364 unit. It will inform the ObjC runtime that class definition(s) herein
365 contained are to replace one(s) previously loaded. */
366 int flag_replace_objc_classes = 0;
368 /* C/ObjC language option variables. */
371 /* Nonzero means message about use of implicit function declarations;
372 1 means warning; 2 means error. */
374 int mesg_implicit_function_declaration = -1;
376 /* Nonzero means allow type mismatches in conditional expressions;
377 just make their values `void'. */
379 int flag_cond_mismatch;
381 /* Nonzero means enable C89 Amendment 1 features. */
385 /* Nonzero means use the ISO C99 dialect of C. */
389 /* Nonzero means that we have builtin functions, and main is an int. */
393 /* Nonzero means warn when casting a function call to a type that does
394 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
395 when there is no previous declaration of sqrt or malloc. */
397 int warn_bad_function_cast;
399 /* Warn about traditional constructs whose meanings changed in ANSI C. */
401 int warn_traditional;
403 /* Nonzero means warn for a declaration found after a statement. */
405 int warn_declaration_after_statement;
407 /* Nonzero means warn for non-prototype function decls
408 or non-prototyped defs without previous prototype. */
410 int warn_strict_prototypes;
412 /* Nonzero means warn for any global function def
413 without separate previous decl. */
415 int warn_missing_declarations;
417 /* Nonzero means warn about declarations of objects not at
418 file-scope level and about *all* declarations of functions (whether
419 or static) not at file-scope level. Note that we exclude
420 implicit function declarations. To get warnings about those, use
423 int warn_nested_externs;
425 /* Warn if main is suspicious. */
429 /* Nonzero means warn about possible violations of sequence point rules. */
431 int warn_sequence_point;
433 /* Nonzero means warn about uninitialized variable when it is initialized with itself.
434 For example: int i = i;, GCC will not warn about this when warn_init_self is nonzero. */
438 /* Nonzero means to warn about compile-time division by zero. */
439 int warn_div_by_zero = 1;
441 /* Nonzero means warn about use of implicit int. */
443 int warn_implicit_int;
445 /* Warn about NULL being passed to argument slots marked as requiring
450 /* Warn about old-style parameter declaration. */
452 int warn_old_style_definition;
455 /* ObjC language option variables. */
458 /* Open and close the file for outputting class declarations, if
461 int flag_gen_declaration;
463 /* Generate code for GNU or NeXT runtime environment. */
465 #ifdef NEXT_OBJC_RUNTIME
466 int flag_next_runtime = 1;
468 int flag_next_runtime = 0;
471 /* Tells the compiler that this is a special run. Do not perform any
472 compiling, instead we are to test some platform dependent features
473 and output a C header file with appropriate definitions. */
475 int print_struct_values;
477 /* ???. Undocumented. */
479 const char *constant_string_class_name;
481 /* Warn if multiple methods are seen for the same selector, but with
482 different argument types. Performs the check on the whole selector
483 table at the end of compilation. */
487 /* Warn if a @selector() is found, and no method with that selector
488 has been previously declared. The check is done on each
489 @selector() as soon as it is found - so it warns about forward
492 int warn_undeclared_selector;
494 /* Warn if methods required by a protocol are not implemented in the
495 class adopting it. When turned off, methods inherited to that
496 class are also considered implemented. */
498 int warn_protocol = 1;
501 /* C++ language option variables. */
504 /* Nonzero means don't recognize any extension keywords. */
506 int flag_no_gnu_keywords;
508 /* Nonzero means do emit exported implementations of functions even if
509 they can be inlined. */
511 int flag_implement_inlines = 1;
513 /* Nonzero means that implicit instantiations will be emitted if needed. */
515 int flag_implicit_templates = 1;
517 /* Nonzero means that implicit instantiations of inline templates will be
518 emitted if needed, even if instantiations of non-inline templates
521 int flag_implicit_inline_templates = 1;
523 /* Nonzero means generate separate instantiation control files and
524 juggle them at link time. */
526 int flag_use_repository;
528 /* Nonzero if we want to issue diagnostics that the standard says are not
531 int flag_optional_diags = 1;
533 /* Nonzero means we should attempt to elide constructors when possible. */
535 int flag_elide_constructors = 1;
537 /* Nonzero means that member functions defined in class scope are
538 inline by default. */
540 int flag_default_inline = 1;
542 /* Controls whether compiler generates 'type descriptor' that give
543 run-time type information. */
547 /* Nonzero if we want to conserve space in the .o files. We do this
548 by putting uninitialized data and runtime initialized data into
549 .common instead of .data at the expense of not flagging multiple
552 int flag_conserve_space;
554 /* Nonzero if we want to obey access control semantics. */
556 int flag_access_control = 1;
558 /* Nonzero if we want to check the return value of new and avoid calling
559 constructors if it is a null pointer. */
563 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
564 initialization variables.
565 0: Old rules, set by -fno-for-scope.
566 2: New ISO rules, set by -ffor-scope.
567 1: Try to implement new ISO rules, but with backup compatibility
568 (and warnings). This is the default, for now. */
570 int flag_new_for_scope = 1;
572 /* Nonzero if we want to emit defined symbols with common-like linkage as
573 weak symbols where possible, in order to conform to C++ semantics.
574 Otherwise, emit them as local symbols. */
578 /* 0 means we want the preprocessor to not emit line directives for
579 the current working directory. 1 means we want it to do it. -1
580 means we should decide depending on whether debugging information
581 is being emitted or not. */
583 int flag_working_directory = -1;
585 /* Nonzero to use __cxa_atexit, rather than atexit, to register
586 destructors for local statics and global objects. */
588 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
590 /* Nonzero means make the default pedwarns warnings instead of errors.
591 The value of this flag is ignored if -pedantic is specified. */
595 /* Nonzero means to implement standard semantics for exception
596 specifications, calling unexpected if an exception is thrown that
597 doesn't match the specification. Zero means to treat them as
598 assertions and optimize accordingly, but not check them. */
600 int flag_enforce_eh_specs = 1;
602 /* The version of the C++ ABI in use. The following values are
605 0: The version of the ABI believed most conformant with the
606 C++ ABI specification. This ABI may change as bugs are
607 discovered and fixed. Therefore, 0 will not necessarily
608 indicate the same ABI in different versions of G++.
610 1: The version of the ABI first used in G++ 3.2.
612 Additional positive integers will be assigned as new versions of
613 the ABI become the default version of the ABI. */
615 int flag_abi_version = 1;
617 /* Nonzero means warn about things that will change when compiling
618 with an ABI-compliant compiler. */
622 /* Nonzero means warn about invalid uses of offsetof. */
624 int warn_invalid_offsetof = 1;
626 /* Nonzero means warn about implicit declarations. */
628 int warn_implicit = 1;
630 /* Nonzero means warn when all ctors or dtors are private, and the class
633 int warn_ctor_dtor_privacy = 0;
635 /* Nonzero means warn in function declared in derived class has the
636 same name as a virtual in the base class, but fails to match the
637 type signature of any virtual function in the base class. */
639 int warn_overloaded_virtual;
641 /* Nonzero means warn when declaring a class that has a non virtual
642 destructor, when it really ought to have a virtual one. */
646 /* Nonzero means warn when the compiler will reorder code. */
650 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
654 /* Nonzero means warn when we convert a pointer to member function
655 into a pointer to (void or function). */
657 int warn_pmf2ptr = 1;
659 /* Nonzero means warn about violation of some Effective C++ style rules. */
663 /* Nonzero means warn where overload resolution chooses a promotion from
664 unsigned to signed over a conversion to an unsigned of the same size. */
668 /* Nonzero means warn when an old-style cast is used. */
670 int warn_old_style_cast;
672 /* Nonzero means warn when non-templatized friend functions are
673 declared within a template */
675 int warn_nontemplate_friend = 1;
677 /* Nonzero means complain about deprecated features. */
679 int warn_deprecated = 1;
681 /* Maximum template instantiation depth. This limit is rather
682 arbitrary, but it exists to limit the time it takes to notice
683 infinite template instantiations. */
685 int max_tinst_depth = 500;
689 /* The elements of `ridpointers' are identifier nodes for the reserved
690 type names and storage classes. It is indexed by a RID_... value. */
693 tree (*make_fname_decl) (tree, int);
695 /* If non-NULL, the address of a language-specific function that takes
696 any action required right before expand_function_end is called. */
697 void (*lang_expand_function_end) (void);
699 /* Nonzero means the expression being parsed will never be evaluated.
700 This is a count, since unevaluated expressions can nest. */
703 /* Information about how a function name is generated. */
706 tree *const decl; /* pointer to the VAR_DECL. */
707 const unsigned rid; /* RID number for the identifier. */
708 const int pretty; /* How pretty is it? */
711 /* The three ways of getting then name of the current function. */
713 const struct fname_var_t fname_vars[] =
715 /* C99 compliant __func__, must be first. */
716 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
717 /* GCC __FUNCTION__ compliant. */
718 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
719 /* GCC __PRETTY_FUNCTION__ compliant. */
720 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
724 static int constant_fits_type_p (tree, tree);
726 /* Keep a stack of if statements. We record the number of compound
727 statements seen up to the if keyword, as well as the line number
728 and file of the if. If a potentially ambiguous else is seen, that
729 fact is recorded; the warning is issued when we can be sure that
730 the enclosing if statement does not have an else branch. */
739 static if_elt *if_stack;
741 /* Amount of space in the if statement stack. */
742 static int if_stack_space = 0;
745 static int if_stack_pointer = 0;
747 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
748 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
749 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
750 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
751 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
752 static tree handle_always_inline_attribute (tree *, tree, tree, int,
754 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
755 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
756 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
757 static tree handle_transparent_union_attribute (tree *, tree, tree,
759 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
760 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
761 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
762 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
763 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
764 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
765 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
766 static tree handle_visibility_attribute (tree *, tree, tree, int,
768 static tree handle_tls_model_attribute (tree *, tree, tree, int,
770 static tree handle_no_instrument_function_attribute (tree *, tree,
772 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
773 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
775 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
776 static tree handle_deprecated_attribute (tree *, tree, tree, int,
778 static tree handle_vector_size_attribute (tree *, tree, tree, int,
780 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
781 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
782 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
783 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
785 static tree vector_size_helper (tree, tree);
787 static void check_function_nonnull (tree, tree);
788 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
789 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
790 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
791 static int resort_field_decl_cmp (const void *, const void *);
793 /* Table of machine-independent attributes common to all C-like languages. */
794 const struct attribute_spec c_common_attribute_table[] =
796 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
797 { "packed", 0, 0, false, false, false,
798 handle_packed_attribute },
799 { "nocommon", 0, 0, true, false, false,
800 handle_nocommon_attribute },
801 { "common", 0, 0, true, false, false,
802 handle_common_attribute },
803 /* FIXME: logically, noreturn attributes should be listed as
804 "false, true, true" and apply to function types. But implementing this
805 would require all the places in the compiler that use TREE_THIS_VOLATILE
806 on a decl to identify non-returning functions to be located and fixed
807 to check the function type instead. */
808 { "noreturn", 0, 0, true, false, false,
809 handle_noreturn_attribute },
810 { "volatile", 0, 0, true, false, false,
811 handle_noreturn_attribute },
812 { "noinline", 0, 0, true, false, false,
813 handle_noinline_attribute },
814 { "always_inline", 0, 0, true, false, false,
815 handle_always_inline_attribute },
816 { "used", 0, 0, true, false, false,
817 handle_used_attribute },
818 { "unused", 0, 0, false, false, false,
819 handle_unused_attribute },
820 /* The same comments as for noreturn attributes apply to const ones. */
821 { "const", 0, 0, true, false, false,
822 handle_const_attribute },
823 { "transparent_union", 0, 0, false, false, false,
824 handle_transparent_union_attribute },
825 { "constructor", 0, 0, true, false, false,
826 handle_constructor_attribute },
827 { "destructor", 0, 0, true, false, false,
828 handle_destructor_attribute },
829 { "mode", 1, 1, false, true, false,
830 handle_mode_attribute },
831 { "section", 1, 1, true, false, false,
832 handle_section_attribute },
833 { "aligned", 0, 1, false, false, false,
834 handle_aligned_attribute },
835 { "weak", 0, 0, true, false, false,
836 handle_weak_attribute },
837 { "alias", 1, 1, true, false, false,
838 handle_alias_attribute },
839 { "no_instrument_function", 0, 0, true, false, false,
840 handle_no_instrument_function_attribute },
841 { "malloc", 0, 0, true, false, false,
842 handle_malloc_attribute },
843 { "no_stack_limit", 0, 0, true, false, false,
844 handle_no_limit_stack_attribute },
845 { "pure", 0, 0, true, false, false,
846 handle_pure_attribute },
847 { "deprecated", 0, 0, false, false, false,
848 handle_deprecated_attribute },
849 { "vector_size", 1, 1, false, true, false,
850 handle_vector_size_attribute },
851 { "visibility", 1, 1, true, false, false,
852 handle_visibility_attribute },
853 { "tls_model", 1, 1, true, false, false,
854 handle_tls_model_attribute },
855 { "nonnull", 0, -1, false, true, true,
856 handle_nonnull_attribute },
857 { "nothrow", 0, 0, true, false, false,
858 handle_nothrow_attribute },
859 { "may_alias", 0, 0, false, true, false, NULL },
860 { "cleanup", 1, 1, true, false, false,
861 handle_cleanup_attribute },
862 { "warn_unused_result", 0, 0, false, true, true,
863 handle_warn_unused_result_attribute },
864 { NULL, 0, 0, false, false, false, NULL }
867 /* Give the specifications for the format attributes, used by C and all
870 const struct attribute_spec c_common_format_attribute_table[] =
872 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
873 { "format", 3, 3, false, true, true,
874 handle_format_attribute },
875 { "format_arg", 1, 1, false, true, true,
876 handle_format_arg_attribute },
877 { NULL, 0, 0, false, false, false, NULL }
880 /* Record the start of an if-then, and record the start of it
881 for ambiguous else detection.
883 COND is the condition for the if-then statement.
885 IF_STMT is the statement node that has already been created for
886 this if-then statement. It is created before parsing the
887 condition to keep line number information accurate. */
890 c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
892 /* Make sure there is enough space on the stack. */
893 if (if_stack_space == 0)
896 if_stack = xmalloc (10 * sizeof (if_elt));
898 else if (if_stack_space == if_stack_pointer)
900 if_stack_space += 10;
901 if_stack = xrealloc (if_stack, if_stack_space * sizeof (if_elt));
904 IF_COND (if_stmt) = cond;
907 /* Record this if statement. */
908 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
909 if_stack[if_stack_pointer].locus = input_location;
910 if_stack[if_stack_pointer].needs_warning = 0;
911 if_stack[if_stack_pointer].if_stmt = if_stmt;
915 /* Called after the then-clause for an if-statement is processed. */
920 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
921 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
924 /* Record the end of an if-then. Optionally warn if a nested
925 if statement had an ambiguous else clause. */
928 c_expand_end_cond (void)
931 if (if_stack[if_stack_pointer].needs_warning)
932 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
933 &if_stack[if_stack_pointer].locus);
934 last_expr_type = NULL_TREE;
937 /* Called between the then-clause and the else-clause
938 of an if-then-else. */
941 c_expand_start_else (void)
943 /* An ambiguous else warning must be generated for the enclosing if
944 statement, unless we see an else branch for that one, too. */
946 && if_stack_pointer > 1
947 && (if_stack[if_stack_pointer - 1].compstmt_count
948 == if_stack[if_stack_pointer - 2].compstmt_count))
949 if_stack[if_stack_pointer - 2].needs_warning = 1;
951 /* Even if a nested if statement had an else branch, it can't be
952 ambiguous if this one also has an else. So don't warn in that
953 case. Also don't warn for any if statements nested in this else. */
954 if_stack[if_stack_pointer - 1].needs_warning = 0;
955 if_stack[if_stack_pointer - 1].compstmt_count--;
958 /* Called after the else-clause for an if-statement is processed. */
963 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
964 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
967 /* Begin an if-statement. Returns a newly created IF_STMT if
970 Unlike the C++ front-end, we do not call add_stmt here; it is
971 probably safe to do so, but I am not very familiar with this
972 code so I am being extra careful not to change its behavior
973 beyond what is strictly necessary for correctness. */
976 c_begin_if_stmt (void)
979 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
983 /* Begin a while statement. Returns a newly created WHILE_STMT if
986 Unlike the C++ front-end, we do not call add_stmt here; it is
987 probably safe to do so, but I am not very familiar with this
988 code so I am being extra careful not to change its behavior
989 beyond what is strictly necessary for correctness. */
992 c_begin_while_stmt (void)
995 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
1000 c_finish_while_stmt_cond (tree cond, tree while_stmt)
1002 WHILE_COND (while_stmt) = cond;
1005 /* Push current bindings for the function name VAR_DECLS. */
1008 start_fname_decls (void)
1011 tree saved = NULL_TREE;
1013 for (ix = 0; fname_vars[ix].decl; ix++)
1015 tree decl = *fname_vars[ix].decl;
1019 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
1020 *fname_vars[ix].decl = NULL_TREE;
1023 if (saved || saved_function_name_decls)
1024 /* Normally they'll have been NULL, so only push if we've got a
1025 stack, or they are non-NULL. */
1026 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1027 saved_function_name_decls);
1030 /* Finish up the current bindings, adding them into the
1031 current function's statement tree. This is done by wrapping the
1032 function's body in a COMPOUND_STMT containing these decls too. This
1033 must be done _before_ finish_stmt_tree is called. If there is no
1034 current function, we must be at file scope and no statements are
1035 involved. Pop the previous bindings. */
1038 finish_fname_decls (void)
1041 tree body = NULL_TREE;
1042 tree stack = saved_function_name_decls;
1044 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1045 body = chainon (TREE_VALUE (stack), body);
1049 /* They were called into existence, so add to statement tree. Add
1050 the DECL_STMTs inside the outermost scope. */
1051 tree *p = &DECL_SAVED_TREE (current_function_decl);
1052 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1053 while (TREE_CODE (*p) != COMPOUND_STMT)
1054 p = &TREE_CHAIN (*p);
1055 p = &COMPOUND_BODY (*p);
1056 if (TREE_CODE (*p) == SCOPE_STMT)
1057 p = &TREE_CHAIN (*p);
1059 body = chainon (body, *p);
1063 for (ix = 0; fname_vars[ix].decl; ix++)
1064 *fname_vars[ix].decl = NULL_TREE;
1068 /* We had saved values, restore them. */
1071 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1073 tree decl = TREE_PURPOSE (saved);
1074 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1076 *fname_vars[ix].decl = decl;
1078 stack = TREE_CHAIN (stack);
1080 saved_function_name_decls = stack;
1083 /* Return the text name of the current function, suitably prettified
1087 fname_as_string (int pretty_p)
1089 const char *name = "top level";
1098 if (current_function_decl)
1099 name = (*lang_hooks.decl_printable_name) (current_function_decl, vrb);
1104 /* Return the VAR_DECL for a const char array naming the current
1105 function. If the VAR_DECL has not yet been created, create it
1106 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1107 ID is its name (unfortunately C and C++ hold the RID values of
1108 keywords in different places, so we can't derive RID from ID in
1109 this language independent code. */
1112 fname_decl (unsigned int rid, tree id)
1115 tree decl = NULL_TREE;
1117 for (ix = 0; fname_vars[ix].decl; ix++)
1118 if (fname_vars[ix].rid == rid)
1121 decl = *fname_vars[ix].decl;
1124 tree saved_last_tree = last_tree;
1125 /* If a tree is built here, it would normally have the lineno of
1126 the current statement. Later this tree will be moved to the
1127 beginning of the function and this line number will be wrong.
1128 To avoid this problem set the lineno to 0 here; that prevents
1129 it from appearing in the RTL. */
1130 int saved_lineno = input_line;
1133 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1134 if (last_tree != saved_last_tree)
1136 /* We created some statement tree for the decl. This belongs
1137 at the start of the function, so remove it now and reinsert
1138 it after the function is complete. */
1139 tree stmts = TREE_CHAIN (saved_last_tree);
1141 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1142 last_tree = saved_last_tree;
1143 saved_function_name_decls = tree_cons (decl, stmts,
1144 saved_function_name_decls);
1146 *fname_vars[ix].decl = decl;
1147 input_line = saved_lineno;
1149 if (!ix && !current_function_decl)
1150 pedwarn ("%J'%D' is not defined outside of function scope", decl, decl);
1155 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1158 fix_string_type (tree value)
1160 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1161 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1162 const int nchars_max = flag_isoc99 ? 4095 : 509;
1163 int length = TREE_STRING_LENGTH (value);
1166 /* Compute the number of elements, for the array type. */
1167 nchars = wide_flag ? length / wchar_bytes : length;
1169 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1170 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1171 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1173 /* Create the array type for the string constant.
1174 -Wwrite-strings says make the string constant an array of const char
1175 so that copying it to a non-const pointer will get a warning.
1176 For C++, this is the standard behavior. */
1177 if (flag_const_strings && ! flag_writable_strings)
1180 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1183 = build_array_type (elements,
1184 build_index_type (build_int_2 (nchars - 1, 0)));
1188 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1189 build_index_type (build_int_2 (nchars - 1, 0)));
1191 TREE_CONSTANT (value) = 1;
1192 TREE_READONLY (value) = ! flag_writable_strings;
1193 TREE_STATIC (value) = 1;
1197 /* Print a warning if a constant expression had overflow in folding.
1198 Invoke this function on every expression that the language
1199 requires to be a constant expression.
1200 Note the ANSI C standard says it is erroneous for a
1201 constant expression to overflow. */
1204 constant_expression_warning (tree value)
1206 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1207 || TREE_CODE (value) == VECTOR_CST
1208 || TREE_CODE (value) == COMPLEX_CST)
1209 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1210 pedwarn ("overflow in constant expression");
1213 /* Print a warning if an expression had overflow in folding.
1214 Invoke this function on every expression that
1215 (1) appears in the source code, and
1216 (2) might be a constant expression that overflowed, and
1217 (3) is not already checked by convert_and_check;
1218 however, do not invoke this function on operands of explicit casts. */
1221 overflow_warning (tree value)
1223 if ((TREE_CODE (value) == INTEGER_CST
1224 || (TREE_CODE (value) == COMPLEX_CST
1225 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1226 && TREE_OVERFLOW (value))
1228 TREE_OVERFLOW (value) = 0;
1229 if (skip_evaluation == 0)
1230 warning ("integer overflow in expression");
1232 else if ((TREE_CODE (value) == REAL_CST
1233 || (TREE_CODE (value) == COMPLEX_CST
1234 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1235 && TREE_OVERFLOW (value))
1237 TREE_OVERFLOW (value) = 0;
1238 if (skip_evaluation == 0)
1239 warning ("floating point overflow in expression");
1241 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1243 TREE_OVERFLOW (value) = 0;
1244 if (skip_evaluation == 0)
1245 warning ("vector overflow in expression");
1249 /* Print a warning if a large constant is truncated to unsigned,
1250 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1251 Invoke this function on every expression that might be implicitly
1252 converted to an unsigned type. */
1255 unsigned_conversion_warning (tree result, tree operand)
1257 tree type = TREE_TYPE (result);
1259 if (TREE_CODE (operand) == INTEGER_CST
1260 && TREE_CODE (type) == INTEGER_TYPE
1261 && TREE_UNSIGNED (type)
1262 && skip_evaluation == 0
1263 && !int_fits_type_p (operand, type))
1265 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1266 /* This detects cases like converting -129 or 256 to unsigned char. */
1267 warning ("large integer implicitly truncated to unsigned type");
1268 else if (warn_conversion)
1269 warning ("negative integer implicitly converted to unsigned type");
1273 /* Nonzero if constant C has a value that is permissible
1274 for type TYPE (an INTEGER_TYPE). */
1277 constant_fits_type_p (tree c, tree type)
1279 if (TREE_CODE (c) == INTEGER_CST)
1280 return int_fits_type_p (c, type);
1282 c = convert (type, c);
1283 return !TREE_OVERFLOW (c);
1286 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1287 Invoke this function on every expression that is converted implicitly,
1288 i.e. because of language rules and not because of an explicit cast. */
1291 convert_and_check (tree type, tree expr)
1293 tree t = convert (type, expr);
1294 if (TREE_CODE (t) == INTEGER_CST)
1296 if (TREE_OVERFLOW (t))
1298 TREE_OVERFLOW (t) = 0;
1300 /* Do not diagnose overflow in a constant expression merely
1301 because a conversion overflowed. */
1302 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1304 /* No warning for converting 0x80000000 to int. */
1305 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1306 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1307 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1308 /* If EXPR fits in the unsigned version of TYPE,
1309 don't warn unless pedantic. */
1311 || TREE_UNSIGNED (type)
1312 || ! constant_fits_type_p (expr,
1313 c_common_unsigned_type (type)))
1314 && skip_evaluation == 0)
1315 warning ("overflow in implicit constant conversion");
1318 unsigned_conversion_warning (t, expr);
1323 /* A node in a list that describes references to variables (EXPR), which are
1324 either read accesses if WRITER is zero, or write accesses, in which case
1325 WRITER is the parent of EXPR. */
1332 /* Used to implement a cache the results of a call to verify_tree. We only
1333 use this for SAVE_EXPRs. */
1336 struct tlist_cache *next;
1337 struct tlist *cache_before_sp;
1338 struct tlist *cache_after_sp;
1342 /* Obstack to use when allocating tlist structures, and corresponding
1344 static struct obstack tlist_obstack;
1345 static char *tlist_firstobj = 0;
1347 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1349 static struct tlist *warned_ids;
1350 /* SAVE_EXPRs need special treatment. We process them only once and then
1351 cache the results. */
1352 static struct tlist_cache *save_expr_cache;
1354 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1355 static void merge_tlist (struct tlist **, struct tlist *, int);
1356 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1357 static int warning_candidate_p (tree);
1358 static void warn_for_collisions (struct tlist *);
1359 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1360 static struct tlist *new_tlist (struct tlist *, tree, tree);
1361 static void verify_sequence_points (tree);
1363 /* Create a new struct tlist and fill in its fields. */
1364 static struct tlist *
1365 new_tlist (struct tlist *next, tree t, tree writer)
1368 l = obstack_alloc (&tlist_obstack, sizeof *l);
1375 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1376 is nonnull, we ignore any node we find which has a writer equal to it. */
1379 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1383 struct tlist *next = add->next;
1386 if (! exclude_writer || add->writer != exclude_writer)
1387 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1392 /* Merge the nodes of ADD into TO. This merging process is done so that for
1393 each variable that already exists in TO, no new node is added; however if
1394 there is a write access recorded in ADD, and an occurrence on TO is only
1395 a read access, then the occurrence in TO will be modified to record the
1399 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1401 struct tlist **end = to;
1404 end = &(*end)->next;
1410 struct tlist *next = add->next;
1412 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1413 if (tmp2->expr == add->expr)
1417 tmp2->writer = add->writer;
1421 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1422 end = &(*end)->next;
1429 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1430 references in list LIST conflict with it, excluding reads if ONLY writers
1434 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1439 /* Avoid duplicate warnings. */
1440 for (tmp = warned_ids; tmp; tmp = tmp->next)
1441 if (tmp->expr == written)
1446 if (list->expr == written
1447 && list->writer != writer
1448 && (! only_writes || list->writer))
1450 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1451 warning ("operation on `%s' may be undefined",
1452 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1458 /* Given a list LIST of references to variables, find whether any of these
1459 can cause conflicts due to missing sequence points. */
1462 warn_for_collisions (struct tlist *list)
1466 for (tmp = list; tmp; tmp = tmp->next)
1469 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1473 /* Return nonzero if X is a tree that can be verified by the sequence point
1476 warning_candidate_p (tree x)
1478 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1481 /* Walk the tree X, and record accesses to variables. If X is written by the
1482 parent tree, WRITER is the parent.
1483 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1484 expression or its only operand forces a sequence point, then everything up
1485 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1487 Once we return, we will have emitted warnings if any subexpression before
1488 such a sequence point could be undefined. On a higher level, however, the
1489 sequence point may not be relevant, and we'll merge the two lists.
1491 Example: (b++, a) + b;
1492 The call that processes the COMPOUND_EXPR will store the increment of B
1493 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1494 processes the PLUS_EXPR will need to merge the two lists so that
1495 eventually, all accesses end up on the same list (and we'll warn about the
1496 unordered subexpressions b++ and b.
1498 A note on merging. If we modify the former example so that our expression
1501 care must be taken not simply to add all three expressions into the final
1502 PNO_SP list. The function merge_tlist takes care of that by merging the
1503 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1504 way, so that no more than one access to B is recorded. */
1507 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1510 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1511 enum tree_code code;
1514 /* X may be NULL if it is the operand of an empty statement expression
1520 code = TREE_CODE (x);
1521 class = TREE_CODE_CLASS (code);
1523 if (warning_candidate_p (x))
1525 *pno_sp = new_tlist (*pno_sp, x, writer);
1535 case TRUTH_ANDIF_EXPR:
1536 case TRUTH_ORIF_EXPR:
1537 tmp_before = tmp_nosp = tmp_list3 = 0;
1538 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1539 warn_for_collisions (tmp_nosp);
1540 merge_tlist (pbefore_sp, tmp_before, 0);
1541 merge_tlist (pbefore_sp, tmp_nosp, 0);
1542 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1543 merge_tlist (pbefore_sp, tmp_list3, 0);
1547 tmp_before = tmp_list2 = 0;
1548 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1549 warn_for_collisions (tmp_list2);
1550 merge_tlist (pbefore_sp, tmp_before, 0);
1551 merge_tlist (pbefore_sp, tmp_list2, 1);
1553 tmp_list3 = tmp_nosp = 0;
1554 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1555 warn_for_collisions (tmp_nosp);
1556 merge_tlist (pbefore_sp, tmp_list3, 0);
1558 tmp_list3 = tmp_list2 = 0;
1559 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1560 warn_for_collisions (tmp_list2);
1561 merge_tlist (pbefore_sp, tmp_list3, 0);
1562 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1563 two first, to avoid warning for (a ? b++ : b++). */
1564 merge_tlist (&tmp_nosp, tmp_list2, 0);
1565 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1568 case PREDECREMENT_EXPR:
1569 case PREINCREMENT_EXPR:
1570 case POSTDECREMENT_EXPR:
1571 case POSTINCREMENT_EXPR:
1572 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1576 tmp_before = tmp_nosp = tmp_list3 = 0;
1577 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1578 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1579 /* Expressions inside the LHS are not ordered wrt. the sequence points
1580 in the RHS. Example:
1582 Despite the fact that the modification of "a" is in the before_sp
1583 list (tmp_before), it conflicts with the use of "a" in the LHS.
1584 We can handle this by adding the contents of tmp_list3
1585 to those of tmp_before, and redoing the collision warnings for that
1587 add_tlist (&tmp_before, tmp_list3, x, 1);
1588 warn_for_collisions (tmp_before);
1589 /* Exclude the LHS itself here; we first have to merge it into the
1590 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1591 didn't exclude the LHS, we'd get it twice, once as a read and once
1593 add_tlist (pno_sp, tmp_list3, x, 0);
1594 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1596 merge_tlist (pbefore_sp, tmp_before, 0);
1597 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1598 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1599 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1603 /* We need to warn about conflicts among arguments and conflicts between
1604 args and the function address. Side effects of the function address,
1605 however, are not ordered by the sequence point of the call. */
1606 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1607 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1608 if (TREE_OPERAND (x, 1))
1609 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1610 merge_tlist (&tmp_list3, tmp_list2, 0);
1611 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1612 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1613 warn_for_collisions (tmp_before);
1614 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1618 /* Scan all the list, e.g. indices of multi dimensional array. */
1621 tmp_before = tmp_nosp = 0;
1622 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1623 merge_tlist (&tmp_nosp, tmp_before, 0);
1624 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1631 struct tlist_cache *t;
1632 for (t = save_expr_cache; t; t = t->next)
1638 t = obstack_alloc (&tlist_obstack, sizeof *t);
1639 t->next = save_expr_cache;
1641 save_expr_cache = t;
1643 tmp_before = tmp_nosp = 0;
1644 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1645 warn_for_collisions (tmp_nosp);
1650 struct tlist *t = tmp_nosp;
1652 merge_tlist (&tmp_list3, t, 0);
1654 t->cache_before_sp = tmp_before;
1655 t->cache_after_sp = tmp_list3;
1657 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1658 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1667 if (first_rtl_op (code) == 0)
1669 x = TREE_OPERAND (x, 0);
1685 int max = first_rtl_op (TREE_CODE (x));
1686 for (lp = 0; lp < max; lp++)
1688 tmp_before = tmp_nosp = 0;
1689 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1690 merge_tlist (&tmp_nosp, tmp_before, 0);
1691 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1698 /* Try to warn for undefined behavior in EXPR due to missing sequence
1702 verify_sequence_points (tree expr)
1704 struct tlist *before_sp = 0, *after_sp = 0;
1707 save_expr_cache = 0;
1708 if (tlist_firstobj == 0)
1710 gcc_obstack_init (&tlist_obstack);
1711 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1714 verify_tree (expr, &before_sp, &after_sp, 0);
1715 warn_for_collisions (after_sp);
1716 obstack_free (&tlist_obstack, tlist_firstobj);
1720 c_expand_expr_stmt (tree expr)
1722 /* Do default conversion if safe and possibly important,
1723 in case within ({...}). */
1724 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1725 && (flag_isoc99 || lvalue_p (expr)))
1726 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1727 expr = default_conversion (expr);
1729 if (warn_sequence_point)
1730 verify_sequence_points (expr);
1732 if (TREE_TYPE (expr) != error_mark_node
1733 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1734 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1735 error ("expression statement has incomplete type");
1737 last_expr_type = TREE_TYPE (expr);
1738 return add_stmt (build_stmt (EXPR_STMT, expr));
1741 /* Validate the expression after `case' and apply default promotions. */
1744 check_case_value (tree value)
1746 if (value == NULL_TREE)
1749 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1750 STRIP_TYPE_NOPS (value);
1751 /* In C++, the following is allowed:
1754 switch (...) { case i: ... }
1756 So, we try to reduce the VALUE to a constant that way. */
1757 if (c_dialect_cxx ())
1759 value = decl_constant_value (value);
1760 STRIP_TYPE_NOPS (value);
1761 value = fold (value);
1764 if (TREE_CODE (value) != INTEGER_CST
1765 && value != error_mark_node)
1767 error ("case label does not reduce to an integer constant");
1768 value = error_mark_node;
1771 /* Promote char or short to int. */
1772 value = default_conversion (value);
1774 constant_expression_warning (value);
1779 /* Return an integer type with BITS bits of precision,
1780 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1783 c_common_type_for_size (unsigned int bits, int unsignedp)
1785 if (bits == TYPE_PRECISION (integer_type_node))
1786 return unsignedp ? unsigned_type_node : integer_type_node;
1788 if (bits == TYPE_PRECISION (signed_char_type_node))
1789 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1791 if (bits == TYPE_PRECISION (short_integer_type_node))
1792 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1794 if (bits == TYPE_PRECISION (long_integer_type_node))
1795 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1797 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1798 return (unsignedp ? long_long_unsigned_type_node
1799 : long_long_integer_type_node);
1801 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1802 return (unsignedp ? widest_unsigned_literal_type_node
1803 : widest_integer_literal_type_node);
1805 if (bits <= TYPE_PRECISION (intQI_type_node))
1806 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1808 if (bits <= TYPE_PRECISION (intHI_type_node))
1809 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1811 if (bits <= TYPE_PRECISION (intSI_type_node))
1812 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1814 if (bits <= TYPE_PRECISION (intDI_type_node))
1815 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1820 /* Used for communication between c_common_type_for_mode and
1821 c_register_builtin_type. */
1822 static GTY(()) tree registered_builtin_types;
1824 /* Return a data type that has machine mode MODE.
1825 If the mode is an integer,
1826 then UNSIGNEDP selects between signed and unsigned types. */
1829 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1833 if (mode == TYPE_MODE (integer_type_node))
1834 return unsignedp ? unsigned_type_node : integer_type_node;
1836 if (mode == TYPE_MODE (signed_char_type_node))
1837 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1839 if (mode == TYPE_MODE (short_integer_type_node))
1840 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1842 if (mode == TYPE_MODE (long_integer_type_node))
1843 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1845 if (mode == TYPE_MODE (long_long_integer_type_node))
1846 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1848 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1849 return unsignedp ? widest_unsigned_literal_type_node
1850 : widest_integer_literal_type_node;
1853 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1856 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1859 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1862 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1864 #if HOST_BITS_PER_WIDE_INT >= 64
1865 if (mode == TYPE_MODE (intTI_type_node))
1866 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1869 if (mode == TYPE_MODE (float_type_node))
1870 return float_type_node;
1872 if (mode == TYPE_MODE (double_type_node))
1873 return double_type_node;
1875 if (mode == TYPE_MODE (long_double_type_node))
1876 return long_double_type_node;
1878 if (mode == TYPE_MODE (void_type_node))
1879 return void_type_node;
1881 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1882 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1884 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1885 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1890 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1892 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1894 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
1896 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
1898 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
1900 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
1902 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
1904 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
1906 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
1908 return V16SF_type_node;
1910 return V4SF_type_node;
1912 return V2SF_type_node;
1914 return V2DF_type_node;
1916 return V4DF_type_node;
1921 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1922 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1923 return TREE_VALUE (t);
1928 /* Return an unsigned type the same as TYPE in other respects. */
1930 c_common_unsigned_type (tree type)
1932 tree type1 = TYPE_MAIN_VARIANT (type);
1933 if (type1 == signed_char_type_node || type1 == char_type_node)
1934 return unsigned_char_type_node;
1935 if (type1 == integer_type_node)
1936 return unsigned_type_node;
1937 if (type1 == short_integer_type_node)
1938 return short_unsigned_type_node;
1939 if (type1 == long_integer_type_node)
1940 return long_unsigned_type_node;
1941 if (type1 == long_long_integer_type_node)
1942 return long_long_unsigned_type_node;
1943 if (type1 == widest_integer_literal_type_node)
1944 return widest_unsigned_literal_type_node;
1945 #if HOST_BITS_PER_WIDE_INT >= 64
1946 if (type1 == intTI_type_node)
1947 return unsigned_intTI_type_node;
1949 if (type1 == intDI_type_node)
1950 return unsigned_intDI_type_node;
1951 if (type1 == intSI_type_node)
1952 return unsigned_intSI_type_node;
1953 if (type1 == intHI_type_node)
1954 return unsigned_intHI_type_node;
1955 if (type1 == intQI_type_node)
1956 return unsigned_intQI_type_node;
1958 return c_common_signed_or_unsigned_type (1, type);
1961 /* Return a signed type the same as TYPE in other respects. */
1964 c_common_signed_type (tree type)
1966 tree type1 = TYPE_MAIN_VARIANT (type);
1967 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1968 return signed_char_type_node;
1969 if (type1 == unsigned_type_node)
1970 return integer_type_node;
1971 if (type1 == short_unsigned_type_node)
1972 return short_integer_type_node;
1973 if (type1 == long_unsigned_type_node)
1974 return long_integer_type_node;
1975 if (type1 == long_long_unsigned_type_node)
1976 return long_long_integer_type_node;
1977 if (type1 == widest_unsigned_literal_type_node)
1978 return widest_integer_literal_type_node;
1979 #if HOST_BITS_PER_WIDE_INT >= 64
1980 if (type1 == unsigned_intTI_type_node)
1981 return intTI_type_node;
1983 if (type1 == unsigned_intDI_type_node)
1984 return intDI_type_node;
1985 if (type1 == unsigned_intSI_type_node)
1986 return intSI_type_node;
1987 if (type1 == unsigned_intHI_type_node)
1988 return intHI_type_node;
1989 if (type1 == unsigned_intQI_type_node)
1990 return intQI_type_node;
1992 return c_common_signed_or_unsigned_type (0, type);
1995 /* Return a type the same as TYPE except unsigned or
1996 signed according to UNSIGNEDP. */
1999 c_common_signed_or_unsigned_type (int unsignedp, tree type)
2001 if (! INTEGRAL_TYPE_P (type)
2002 || TREE_UNSIGNED (type) == unsignedp)
2005 /* Must check the mode of the types, not the precision. Enumeral types
2006 in C++ have precision set to match their range, but may use a wider
2007 mode to match an ABI. If we change modes, we may wind up with bad
2010 if (TYPE_MODE (type) == TYPE_MODE (signed_char_type_node))
2011 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2012 if (TYPE_MODE (type) == TYPE_MODE (integer_type_node))
2013 return unsignedp ? unsigned_type_node : integer_type_node;
2014 if (TYPE_MODE (type) == TYPE_MODE (short_integer_type_node))
2015 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2016 if (TYPE_MODE (type) == TYPE_MODE (long_integer_type_node))
2017 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2018 if (TYPE_MODE (type) == TYPE_MODE (long_long_integer_type_node))
2019 return (unsignedp ? long_long_unsigned_type_node
2020 : long_long_integer_type_node);
2021 if (TYPE_MODE (type) == TYPE_MODE (widest_integer_literal_type_node))
2022 return (unsignedp ? widest_unsigned_literal_type_node
2023 : widest_integer_literal_type_node);
2025 #if HOST_BITS_PER_WIDE_INT >= 64
2026 if (TYPE_MODE (type) == TYPE_MODE (intTI_type_node))
2027 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2029 if (TYPE_MODE (type) == TYPE_MODE (intDI_type_node))
2030 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2031 if (TYPE_MODE (type) == TYPE_MODE (intSI_type_node))
2032 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2033 if (TYPE_MODE (type) == TYPE_MODE (intHI_type_node))
2034 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2035 if (TYPE_MODE (type) == TYPE_MODE (intQI_type_node))
2036 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2041 /* The C version of the register_builtin_type langhook. */
2044 c_register_builtin_type (tree type, const char* name)
2048 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2049 DECL_ARTIFICIAL (decl) = 1;
2050 if (!TYPE_NAME (type))
2051 TYPE_NAME (type) = decl;
2054 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
2058 /* Return the minimum number of bits needed to represent VALUE in a
2059 signed or unsigned type, UNSIGNEDP says which. */
2062 min_precision (tree value, int unsignedp)
2066 /* If the value is negative, compute its negative minus 1. The latter
2067 adjustment is because the absolute value of the largest negative value
2068 is one larger than the largest positive value. This is equivalent to
2069 a bit-wise negation, so use that operation instead. */
2071 if (tree_int_cst_sgn (value) < 0)
2072 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2074 /* Return the number of bits needed, taking into account the fact
2075 that we need one more bit for a signed than unsigned type. */
2077 if (integer_zerop (value))
2080 log = tree_floor_log2 (value);
2082 return log + 1 + ! unsignedp;
2085 /* Print an error message for invalid operands to arith operation
2086 CODE. NOP_EXPR is used as a special case (see
2087 c_common_truthvalue_conversion). */
2090 binary_op_error (enum tree_code code)
2097 error ("invalid truth-value expression");
2101 opname = "+"; break;
2103 opname = "-"; break;
2105 opname = "*"; break;
2107 opname = "max"; break;
2109 opname = "min"; break;
2111 opname = "=="; break;
2113 opname = "!="; break;
2115 opname = "<="; break;
2117 opname = ">="; break;
2119 opname = "<"; break;
2121 opname = ">"; break;
2123 opname = "<<"; break;
2125 opname = ">>"; break;
2126 case TRUNC_MOD_EXPR:
2127 case FLOOR_MOD_EXPR:
2128 opname = "%"; break;
2129 case TRUNC_DIV_EXPR:
2130 case FLOOR_DIV_EXPR:
2131 opname = "/"; break;
2133 opname = "&"; break;
2135 opname = "|"; break;
2136 case TRUTH_ANDIF_EXPR:
2137 opname = "&&"; break;
2138 case TRUTH_ORIF_EXPR:
2139 opname = "||"; break;
2141 opname = "^"; break;
2144 opname = "rotate"; break;
2146 opname = "unknown"; break;
2148 error ("invalid operands to binary %s", opname);
2151 /* Subroutine of build_binary_op, used for comparison operations.
2152 See if the operands have both been converted from subword integer types
2153 and, if so, perhaps change them both back to their original type.
2154 This function is also responsible for converting the two operands
2155 to the proper common type for comparison.
2157 The arguments of this function are all pointers to local variables
2158 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2159 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2161 If this function returns nonzero, it means that the comparison has
2162 a constant value. What this function returns is an expression for
2166 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2167 enum tree_code *rescode_ptr)
2170 tree op0 = *op0_ptr;
2171 tree op1 = *op1_ptr;
2172 int unsignedp0, unsignedp1;
2174 tree primop0, primop1;
2175 enum tree_code code = *rescode_ptr;
2177 /* Throw away any conversions to wider types
2178 already present in the operands. */
2180 primop0 = get_narrower (op0, &unsignedp0);
2181 primop1 = get_narrower (op1, &unsignedp1);
2183 /* Handle the case that OP0 does not *contain* a conversion
2184 but it *requires* conversion to FINAL_TYPE. */
2186 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2187 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2188 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2189 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2191 /* If one of the operands must be floated, we cannot optimize. */
2192 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2193 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2195 /* If first arg is constant, swap the args (changing operation
2196 so value is preserved), for canonicalization. Don't do this if
2197 the second arg is 0. */
2199 if (TREE_CONSTANT (primop0)
2200 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2203 int temi = unsignedp0;
2211 unsignedp0 = unsignedp1;
2234 *rescode_ptr = code;
2237 /* If comparing an integer against a constant more bits wide,
2238 maybe we can deduce a value of 1 or 0 independent of the data.
2239 Or else truncate the constant now
2240 rather than extend the variable at run time.
2242 This is only interesting if the constant is the wider arg.
2243 Also, it is not safe if the constant is unsigned and the
2244 variable arg is signed, since in this case the variable
2245 would be sign-extended and then regarded as unsigned.
2246 Our technique fails in this case because the lowest/highest
2247 possible unsigned results don't follow naturally from the
2248 lowest/highest possible values of the variable operand.
2249 For just EQ_EXPR and NE_EXPR there is another technique that
2250 could be used: see if the constant can be faithfully represented
2251 in the other operand's type, by truncating it and reextending it
2252 and see if that preserves the constant's value. */
2254 if (!real1 && !real2
2255 && TREE_CODE (primop1) == INTEGER_CST
2256 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2258 int min_gt, max_gt, min_lt, max_lt;
2259 tree maxval, minval;
2260 /* 1 if comparison is nominally unsigned. */
2261 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2264 type = c_common_signed_or_unsigned_type (unsignedp0,
2265 TREE_TYPE (primop0));
2267 /* In C, if TYPE is an enumeration, then we need to get its
2268 min/max values from it's underlying integral type, not the
2269 enumerated type itself. In C++, TYPE_MAX_VALUE and
2270 TYPE_MIN_VALUE have already been set correctly on the
2271 enumeration type. */
2272 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
2273 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2275 maxval = TYPE_MAX_VALUE (type);
2276 minval = TYPE_MIN_VALUE (type);
2278 if (unsignedp && !unsignedp0)
2279 *restype_ptr = c_common_signed_type (*restype_ptr);
2281 if (TREE_TYPE (primop1) != *restype_ptr)
2282 primop1 = convert (*restype_ptr, primop1);
2283 if (type != *restype_ptr)
2285 minval = convert (*restype_ptr, minval);
2286 maxval = convert (*restype_ptr, maxval);
2289 if (unsignedp && unsignedp0)
2291 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2292 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2293 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2294 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2298 min_gt = INT_CST_LT (primop1, minval);
2299 max_gt = INT_CST_LT (primop1, maxval);
2300 min_lt = INT_CST_LT (minval, primop1);
2301 max_lt = INT_CST_LT (maxval, primop1);
2305 /* This used to be a switch, but Genix compiler can't handle that. */
2306 if (code == NE_EXPR)
2308 if (max_lt || min_gt)
2309 val = truthvalue_true_node;
2311 else if (code == EQ_EXPR)
2313 if (max_lt || min_gt)
2314 val = truthvalue_false_node;
2316 else if (code == LT_EXPR)
2319 val = truthvalue_true_node;
2321 val = truthvalue_false_node;
2323 else if (code == GT_EXPR)
2326 val = truthvalue_true_node;
2328 val = truthvalue_false_node;
2330 else if (code == LE_EXPR)
2333 val = truthvalue_true_node;
2335 val = truthvalue_false_node;
2337 else if (code == GE_EXPR)
2340 val = truthvalue_true_node;
2342 val = truthvalue_false_node;
2345 /* If primop0 was sign-extended and unsigned comparison specd,
2346 we did a signed comparison above using the signed type bounds.
2347 But the comparison we output must be unsigned.
2349 Also, for inequalities, VAL is no good; but if the signed
2350 comparison had *any* fixed result, it follows that the
2351 unsigned comparison just tests the sign in reverse
2352 (positive values are LE, negative ones GE).
2353 So we can generate an unsigned comparison
2354 against an extreme value of the signed type. */
2356 if (unsignedp && !unsignedp0)
2363 primop1 = TYPE_MIN_VALUE (type);
2369 primop1 = TYPE_MAX_VALUE (type);
2376 type = c_common_unsigned_type (type);
2379 if (TREE_CODE (primop0) != INTEGER_CST)
2381 if (val == truthvalue_false_node)
2382 warning ("comparison is always false due to limited range of data type");
2383 if (val == truthvalue_true_node)
2384 warning ("comparison is always true due to limited range of data type");
2389 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2390 if (TREE_SIDE_EFFECTS (primop0))
2391 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2395 /* Value is not predetermined, but do the comparison
2396 in the type of the operand that is not constant.
2397 TYPE is already properly set. */
2399 else if (real1 && real2
2400 && (TYPE_PRECISION (TREE_TYPE (primop0))
2401 == TYPE_PRECISION (TREE_TYPE (primop1))))
2402 type = TREE_TYPE (primop0);
2404 /* If args' natural types are both narrower than nominal type
2405 and both extend in the same manner, compare them
2406 in the type of the wider arg.
2407 Otherwise must actually extend both to the nominal
2408 common type lest different ways of extending
2410 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2412 else if (unsignedp0 == unsignedp1 && real1 == real2
2413 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2414 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2416 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2417 type = c_common_signed_or_unsigned_type (unsignedp0
2418 || TREE_UNSIGNED (*restype_ptr),
2420 /* Make sure shorter operand is extended the right way
2421 to match the longer operand. */
2423 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2424 TREE_TYPE (primop0)),
2427 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2428 TREE_TYPE (primop1)),
2433 /* Here we must do the comparison on the nominal type
2434 using the args exactly as we received them. */
2435 type = *restype_ptr;
2439 if (!real1 && !real2 && integer_zerop (primop1)
2440 && TREE_UNSIGNED (*restype_ptr))
2446 /* All unsigned values are >= 0, so we warn if extra warnings
2447 are requested. However, if OP0 is a constant that is
2448 >= 0, the signedness of the comparison isn't an issue,
2449 so suppress the warning. */
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 true");
2455 value = truthvalue_true_node;
2459 if (extra_warnings && !in_system_header
2460 && ! (TREE_CODE (primop0) == INTEGER_CST
2461 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2463 warning ("comparison of unsigned expression < 0 is always false");
2464 value = truthvalue_false_node;
2473 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2474 if (TREE_SIDE_EFFECTS (primop0))
2475 return build (COMPOUND_EXPR, TREE_TYPE (value),
2482 *op0_ptr = convert (type, primop0);
2483 *op1_ptr = convert (type, primop1);
2485 *restype_ptr = truthvalue_type_node;
2490 /* Return a tree for the sum or difference (RESULTCODE says which)
2491 of pointer PTROP and integer INTOP. */
2494 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2501 /* The result is a pointer of the same type that is being added. */
2503 tree result_type = TREE_TYPE (ptrop);
2505 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2507 if (pedantic || warn_pointer_arith)
2508 pedwarn ("pointer of type `void *' used in arithmetic");
2509 size_exp = integer_one_node;
2511 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2513 if (pedantic || warn_pointer_arith)
2514 pedwarn ("pointer to a function used in arithmetic");
2515 size_exp = integer_one_node;
2517 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2519 if (pedantic || warn_pointer_arith)
2520 pedwarn ("pointer to member function used in arithmetic");
2521 size_exp = integer_one_node;
2523 else if (TREE_CODE (TREE_TYPE (result_type)) == OFFSET_TYPE)
2525 if (pedantic || warn_pointer_arith)
2526 pedwarn ("pointer to a member used in arithmetic");
2527 size_exp = integer_one_node;
2530 size_exp = size_in_bytes (TREE_TYPE (result_type));
2532 /* If what we are about to multiply by the size of the elements
2533 contains a constant term, apply distributive law
2534 and multiply that constant term separately.
2535 This helps produce common subexpressions. */
2537 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2538 && ! TREE_CONSTANT (intop)
2539 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2540 && TREE_CONSTANT (size_exp)
2541 /* If the constant comes from pointer subtraction,
2542 skip this optimization--it would cause an error. */
2543 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2544 /* If the constant is unsigned, and smaller than the pointer size,
2545 then we must skip this optimization. This is because it could cause
2546 an overflow error if the constant is negative but INTOP is not. */
2547 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2548 || (TYPE_PRECISION (TREE_TYPE (intop))
2549 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2551 enum tree_code subcode = resultcode;
2552 tree int_type = TREE_TYPE (intop);
2553 if (TREE_CODE (intop) == MINUS_EXPR)
2554 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2555 /* Convert both subexpression types to the type of intop,
2556 because weird cases involving pointer arithmetic
2557 can result in a sum or difference with different type args. */
2558 ptrop = build_binary_op (subcode, ptrop,
2559 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2560 intop = convert (int_type, TREE_OPERAND (intop, 0));
2563 /* Convert the integer argument to a type the same size as sizetype
2564 so the multiply won't overflow spuriously. */
2566 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2567 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2568 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2569 TREE_UNSIGNED (sizetype)), intop);
2571 /* Replace the integer argument with a suitable product by the object size.
2572 Do this multiplication as signed, then convert to the appropriate
2573 pointer type (actually unsigned integral). */
2575 intop = convert (result_type,
2576 build_binary_op (MULT_EXPR, intop,
2577 convert (TREE_TYPE (intop), size_exp), 1));
2579 /* Create the sum or difference. */
2581 result = build (resultcode, result_type, ptrop, intop);
2583 folded = fold (result);
2584 if (folded == result)
2585 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2589 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2590 or validate its data type for an `if' or `while' statement or ?..: exp.
2592 This preparation consists of taking the ordinary
2593 representation of an expression expr and producing a valid tree
2594 boolean expression describing whether expr is nonzero. We could
2595 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2596 but we optimize comparisons, &&, ||, and !.
2598 The resulting type should always be `truthvalue_type_node'. */
2601 c_common_truthvalue_conversion (tree expr)
2603 if (TREE_CODE (expr) == ERROR_MARK)
2606 if (TREE_CODE (expr) == FUNCTION_DECL)
2607 expr = build_unary_op (ADDR_EXPR, expr, 0);
2609 #if 0 /* This appears to be wrong for C++. */
2610 /* These really should return error_mark_node after 2.4 is stable.
2611 But not all callers handle ERROR_MARK properly. */
2612 switch (TREE_CODE (TREE_TYPE (expr)))
2615 error ("struct type value used where scalar is required");
2616 return truthvalue_false_node;
2619 error ("union type value used where scalar is required");
2620 return truthvalue_false_node;
2623 error ("array type value used where scalar is required");
2624 return truthvalue_false_node;
2631 switch (TREE_CODE (expr))
2634 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2635 case TRUTH_ANDIF_EXPR:
2636 case TRUTH_ORIF_EXPR:
2637 case TRUTH_AND_EXPR:
2639 case TRUTH_XOR_EXPR:
2640 case TRUTH_NOT_EXPR:
2641 TREE_TYPE (expr) = truthvalue_type_node;
2648 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2651 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2655 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2656 && ! DECL_WEAK (TREE_OPERAND (expr, 0)))
2658 /* Common Ada/Pascal programmer's mistake. We always warn
2659 about this since it is so bad. */
2660 warning ("the address of `%D', will always evaluate as `true'",
2661 TREE_OPERAND (expr, 0));
2662 return truthvalue_true_node;
2665 /* If we are taking the address of an external decl, it might be
2666 zero if it is weak, so we cannot optimize. */
2667 if (DECL_P (TREE_OPERAND (expr, 0))
2668 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2671 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2672 return build (COMPOUND_EXPR, truthvalue_type_node,
2673 TREE_OPERAND (expr, 0), truthvalue_true_node);
2675 return truthvalue_true_node;
2679 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2680 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2681 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2682 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2688 /* These don't change whether an object is nonzero or zero. */
2689 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2693 /* These don't change whether an object is zero or nonzero, but
2694 we can't ignore them if their second arg has side-effects. */
2695 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2696 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2697 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2699 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2702 /* Distribute the conversion into the arms of a COND_EXPR. */
2703 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2704 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2705 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2708 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2709 since that affects how `default_conversion' will behave. */
2710 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2711 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2713 /* Fall through.... */
2715 /* If this is widening the argument, we can ignore it. */
2716 if (TYPE_PRECISION (TREE_TYPE (expr))
2717 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2718 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2722 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2723 aren't guaranteed to the be same for modes that can represent
2724 infinity, since if x and y are both +infinity, or both
2725 -infinity, then x - y is not a number.
2727 Note that this transformation is safe when x or y is NaN.
2728 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2730 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2732 /* Fall through.... */
2734 /* This and MINUS_EXPR can be changed into a comparison of the
2736 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2737 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2738 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2739 TREE_OPERAND (expr, 1), 1);
2740 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2741 fold (build1 (NOP_EXPR,
2742 TREE_TYPE (TREE_OPERAND (expr, 0)),
2743 TREE_OPERAND (expr, 1))), 1);
2746 if (integer_onep (TREE_OPERAND (expr, 1))
2747 && TREE_TYPE (expr) != truthvalue_type_node)
2748 /* Using convert here would cause infinite recursion. */
2749 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2753 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2754 warning ("suggest parentheses around assignment used as truth value");
2761 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2763 tree t = save_expr (expr);
2764 return (build_binary_op
2765 ((TREE_SIDE_EFFECTS (expr)
2766 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2767 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2768 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2772 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2775 static tree builtin_function_2 (const char *, const char *, tree, tree,
2776 int, enum built_in_class, int, int,
2779 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2780 down to the element type of an array. */
2783 c_build_qualified_type (tree type, int type_quals)
2785 if (TREE_CODE (type) == ARRAY_TYPE)
2786 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2788 TYPE_DOMAIN (type));
2790 /* A restrict-qualified pointer type must be a pointer to object or
2791 incomplete type. Note that the use of POINTER_TYPE_P also allows
2792 REFERENCE_TYPEs, which is appropriate for C++. */
2793 if ((type_quals & TYPE_QUAL_RESTRICT)
2794 && (!POINTER_TYPE_P (type)
2795 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2797 error ("invalid use of `restrict'");
2798 type_quals &= ~TYPE_QUAL_RESTRICT;
2801 return build_qualified_type (type, type_quals);
2804 /* Apply the TYPE_QUALS to the new DECL. */
2807 c_apply_type_quals_to_decl (int type_quals, tree decl)
2809 tree type = TREE_TYPE (decl);
2811 if (((type_quals & TYPE_QUAL_CONST)
2812 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2813 /* An object declared 'const' is only readonly after it is
2814 initialized. We don't have any way of expressing this currently,
2815 so we need to be conservative and unset TREE_READONLY for types
2816 with constructors. Otherwise aliasing code will ignore stores in
2817 an inline constructor. */
2818 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2819 TREE_READONLY (decl) = 1;
2820 if (type_quals & TYPE_QUAL_VOLATILE)
2822 TREE_SIDE_EFFECTS (decl) = 1;
2823 TREE_THIS_VOLATILE (decl) = 1;
2825 if (type_quals & TYPE_QUAL_RESTRICT)
2827 while (type && TREE_CODE (type) == ARRAY_TYPE)
2828 /* Allow 'restrict' on arrays of pointers.
2829 FIXME currently we just ignore it. */
2830 type = TREE_TYPE (type);
2832 || !POINTER_TYPE_P (type)
2833 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2834 error ("invalid use of `restrict'");
2835 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2836 /* Indicate we need to make a unique alias set for this pointer.
2837 We can't do it here because it might be pointing to an
2839 DECL_POINTER_ALIAS_SET (decl) = -2;
2843 /* Return the typed-based alias set for T, which may be an expression
2844 or a type. Return -1 if we don't do anything special. */
2847 c_common_get_alias_set (tree t)
2851 /* Permit type-punning when accessing a union, provided the access
2852 is directly through the union. For example, this code does not
2853 permit taking the address of a union member and then storing
2854 through it. Even the type-punning allowed here is a GCC
2855 extension, albeit a common and useful one; the C standard says
2856 that such accesses have implementation-defined behavior. */
2858 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2859 u = TREE_OPERAND (u, 0))
2860 if (TREE_CODE (u) == COMPONENT_REF
2861 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2864 /* That's all the expressions we handle specially. */
2868 /* The C standard guarantees that any object may be accessed via an
2869 lvalue that has character type. */
2870 if (t == char_type_node
2871 || t == signed_char_type_node
2872 || t == unsigned_char_type_node)
2875 /* If it has the may_alias attribute, it can alias anything. */
2876 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2879 /* The C standard specifically allows aliasing between signed and
2880 unsigned variants of the same type. We treat the signed
2881 variant as canonical. */
2882 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2884 tree t1 = c_common_signed_type (t);
2886 /* t1 == t can happen for boolean nodes which are always unsigned. */
2888 return get_alias_set (t1);
2890 else if (POINTER_TYPE_P (t))
2894 /* Unfortunately, there is no canonical form of a pointer type.
2895 In particular, if we have `typedef int I', then `int *', and
2896 `I *' are different types. So, we have to pick a canonical
2897 representative. We do this below.
2899 Technically, this approach is actually more conservative that
2900 it needs to be. In particular, `const int *' and `int *'
2901 should be in different alias sets, according to the C and C++
2902 standard, since their types are not the same, and so,
2903 technically, an `int **' and `const int **' cannot point at
2906 But, the standard is wrong. In particular, this code is
2911 const int* const* cipp = &ipp;
2913 And, it doesn't make sense for that to be legal unless you
2914 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2915 the pointed-to types. This issue has been reported to the
2917 t1 = build_type_no_quals (t);
2919 return get_alias_set (t1);
2925 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2926 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2927 flag controls whether we should diagnose possibly ill-formed
2928 constructs or not. */
2930 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2932 const char *op_name;
2934 enum tree_code type_code = TREE_CODE (type);
2936 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2937 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2939 if (type_code == FUNCTION_TYPE)
2941 if (op == SIZEOF_EXPR)
2943 if (complain && (pedantic || warn_pointer_arith))
2944 pedwarn ("invalid application of `sizeof' to a function type");
2945 value = size_one_node;
2948 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2950 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2952 if (type_code == VOID_TYPE
2953 && complain && (pedantic || warn_pointer_arith))
2954 pedwarn ("invalid application of `%s' to a void type", op_name);
2955 value = size_one_node;
2957 else if (!COMPLETE_TYPE_P (type))
2960 error ("invalid application of `%s' to an incomplete type", op_name);
2961 value = size_zero_node;
2965 if (op == SIZEOF_EXPR)
2966 /* Convert in case a char is more than one unit. */
2967 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2968 size_int (TYPE_PRECISION (char_type_node)
2971 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2974 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2975 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2976 never happen. However, this node should really have type
2977 `size_t', which is just a typedef for an ordinary integer type. */
2978 value = fold (build1 (NOP_EXPR, size_type_node, value));
2979 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2984 /* Implement the __alignof keyword: Return the minimum required
2985 alignment of EXPR, measured in bytes. For VAR_DECL's and
2986 FIELD_DECL's return DECL_ALIGN (which can be set from an
2987 "aligned" __attribute__ specification). */
2990 c_alignof_expr (tree expr)
2994 if (TREE_CODE (expr) == VAR_DECL)
2995 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2997 else if (TREE_CODE (expr) == COMPONENT_REF
2998 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
3000 error ("`__alignof' applied to a bit-field");
3003 else if (TREE_CODE (expr) == COMPONENT_REF
3004 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
3005 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
3007 else if (TREE_CODE (expr) == INDIRECT_REF)
3009 tree t = TREE_OPERAND (expr, 0);
3011 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3013 while (TREE_CODE (t) == NOP_EXPR
3014 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3018 t = TREE_OPERAND (t, 0);
3019 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3020 if (thisalign > bestalign)
3021 best = t, bestalign = thisalign;
3023 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3026 return c_alignof (TREE_TYPE (expr));
3028 return fold (build1 (NOP_EXPR, size_type_node, t));
3031 /* Handle C and C++ default attributes. */
3033 enum built_in_attribute
3035 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3036 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3037 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3038 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3039 #include "builtin-attrs.def"
3040 #undef DEF_ATTR_NULL_TREE
3042 #undef DEF_ATTR_IDENT
3043 #undef DEF_ATTR_TREE_LIST
3047 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3049 static void c_init_attributes (void);
3051 /* Build tree nodes and builtin functions common to both C and C++ language
3055 c_common_nodes_and_builtins (void)
3059 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3060 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3061 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3062 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3063 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3064 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3065 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3066 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3067 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3068 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3069 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3070 #include "builtin-types.def"
3071 #undef DEF_PRIMITIVE_TYPE
3072 #undef DEF_FUNCTION_TYPE_0
3073 #undef DEF_FUNCTION_TYPE_1
3074 #undef DEF_FUNCTION_TYPE_2
3075 #undef DEF_FUNCTION_TYPE_3
3076 #undef DEF_FUNCTION_TYPE_4
3077 #undef DEF_FUNCTION_TYPE_VAR_0
3078 #undef DEF_FUNCTION_TYPE_VAR_1
3079 #undef DEF_FUNCTION_TYPE_VAR_2
3080 #undef DEF_FUNCTION_TYPE_VAR_3
3081 #undef DEF_POINTER_TYPE
3085 typedef enum builtin_type builtin_type;
3087 tree builtin_types[(int) BT_LAST];
3088 int wchar_type_size;
3089 tree array_domain_type;
3090 tree va_list_ref_type_node;
3091 tree va_list_arg_type_node;
3093 /* Define `int' and `char' first so that dbx will output them first. */
3094 record_builtin_type (RID_INT, NULL, integer_type_node);
3095 record_builtin_type (RID_CHAR, "char", char_type_node);
3097 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3098 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3099 but not C. Are the conditionals here needed? */
3100 if (c_dialect_cxx ())
3101 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3102 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3103 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3104 record_builtin_type (RID_MAX, "long unsigned int",
3105 long_unsigned_type_node);
3106 if (c_dialect_cxx ())
3107 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3108 record_builtin_type (RID_MAX, "long long int",
3109 long_long_integer_type_node);
3110 record_builtin_type (RID_MAX, "long long unsigned int",
3111 long_long_unsigned_type_node);
3112 if (c_dialect_cxx ())
3113 record_builtin_type (RID_MAX, "long long unsigned",
3114 long_long_unsigned_type_node);
3115 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3116 record_builtin_type (RID_MAX, "short unsigned int",
3117 short_unsigned_type_node);
3118 if (c_dialect_cxx ())
3119 record_builtin_type (RID_MAX, "unsigned short",
3120 short_unsigned_type_node);
3122 /* Define both `signed char' and `unsigned char'. */
3123 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3124 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3126 /* These are types that c_common_type_for_size and
3127 c_common_type_for_mode use. */
3128 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3130 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3132 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3134 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3136 #if HOST_BITS_PER_WIDE_INT >= 64
3137 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3138 get_identifier ("__int128_t"),
3141 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3142 unsigned_intQI_type_node));
3143 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3144 unsigned_intHI_type_node));
3145 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3146 unsigned_intSI_type_node));
3147 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3148 unsigned_intDI_type_node));
3149 #if HOST_BITS_PER_WIDE_INT >= 64
3150 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3151 get_identifier ("__uint128_t"),
3152 unsigned_intTI_type_node));
3155 /* Create the widest literal types. */
3156 widest_integer_literal_type_node
3157 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3158 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3159 widest_integer_literal_type_node));
3161 widest_unsigned_literal_type_node
3162 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3163 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3164 widest_unsigned_literal_type_node));
3166 /* `unsigned long' is the standard type for sizeof.
3167 Note that stddef.h uses `unsigned long',
3168 and this must agree, even if long and int are the same size. */
3170 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3171 signed_size_type_node = c_common_signed_type (size_type_node);
3172 set_sizetype (size_type_node);
3174 build_common_tree_nodes_2 (flag_short_double);
3176 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3177 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3178 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3180 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3181 get_identifier ("complex int"),
3182 complex_integer_type_node));
3183 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3184 get_identifier ("complex float"),
3185 complex_float_type_node));
3186 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3187 get_identifier ("complex double"),
3188 complex_double_type_node));
3189 (*lang_hooks.decls.pushdecl)
3190 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3191 complex_long_double_type_node));
3193 /* Types which are common to the fortran compiler and libf2c. When
3194 changing these, you also need to be concerned with f/com.h. */
3196 if (TYPE_PRECISION (float_type_node)
3197 == TYPE_PRECISION (long_integer_type_node))
3199 g77_integer_type_node = long_integer_type_node;
3200 g77_uinteger_type_node = long_unsigned_type_node;
3202 else if (TYPE_PRECISION (float_type_node)
3203 == TYPE_PRECISION (integer_type_node))
3205 g77_integer_type_node = integer_type_node;
3206 g77_uinteger_type_node = unsigned_type_node;
3209 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3211 if (g77_integer_type_node != NULL_TREE)
3213 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3214 get_identifier ("__g77_integer"),
3215 g77_integer_type_node));
3216 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3217 get_identifier ("__g77_uinteger"),
3218 g77_uinteger_type_node));
3221 if (TYPE_PRECISION (float_type_node) * 2
3222 == TYPE_PRECISION (long_integer_type_node))
3224 g77_longint_type_node = long_integer_type_node;
3225 g77_ulongint_type_node = long_unsigned_type_node;
3227 else if (TYPE_PRECISION (float_type_node) * 2
3228 == TYPE_PRECISION (long_long_integer_type_node))
3230 g77_longint_type_node = long_long_integer_type_node;
3231 g77_ulongint_type_node = long_long_unsigned_type_node;
3234 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3236 if (g77_longint_type_node != NULL_TREE)
3238 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3239 get_identifier ("__g77_longint"),
3240 g77_longint_type_node));
3241 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3242 get_identifier ("__g77_ulongint"),
3243 g77_ulongint_type_node));
3246 record_builtin_type (RID_VOID, NULL, void_type_node);
3248 void_zero_node = build_int_2 (0, 0);
3249 TREE_TYPE (void_zero_node) = void_type_node;
3251 void_list_node = build_void_list_node ();
3253 /* Make a type to be the domain of a few array types
3254 whose domains don't really matter.
3255 200 is small enough that it always fits in size_t
3256 and large enough that it can hold most function names for the
3257 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3258 array_domain_type = build_index_type (size_int (200));
3260 /* Make a type for arrays of characters.
3261 With luck nothing will ever really depend on the length of this
3263 char_array_type_node
3264 = build_array_type (char_type_node, array_domain_type);
3266 /* Likewise for arrays of ints. */
3268 = build_array_type (integer_type_node, array_domain_type);
3270 string_type_node = build_pointer_type (char_type_node);
3271 const_string_type_node
3272 = build_pointer_type (build_qualified_type
3273 (char_type_node, TYPE_QUAL_CONST));
3275 /* This is special for C++ so functions can be overloaded. */
3276 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3277 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3278 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3279 if (c_dialect_cxx ())
3281 if (TREE_UNSIGNED (wchar_type_node))
3282 wchar_type_node = make_unsigned_type (wchar_type_size);
3284 wchar_type_node = make_signed_type (wchar_type_size);
3285 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3289 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3290 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3293 /* This is for wide string constants. */
3294 wchar_array_type_node
3295 = build_array_type (wchar_type_node, array_domain_type);
3298 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3301 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3303 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3305 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3307 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3308 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3310 (*lang_hooks.decls.pushdecl)
3311 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3312 va_list_type_node));
3314 (*lang_hooks.decls.pushdecl)
3315 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3316 ptrdiff_type_node));
3318 (*lang_hooks.decls.pushdecl)
3319 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3322 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3324 va_list_arg_type_node = va_list_ref_type_node =
3325 build_pointer_type (TREE_TYPE (va_list_type_node));
3329 va_list_arg_type_node = va_list_type_node;
3330 va_list_ref_type_node = build_reference_type (va_list_type_node);
3333 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3334 builtin_types[(int) ENUM] = VALUE;
3335 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3336 builtin_types[(int) ENUM] \
3337 = build_function_type (builtin_types[(int) RETURN], \
3339 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3340 builtin_types[(int) ENUM] \
3341 = build_function_type (builtin_types[(int) RETURN], \
3342 tree_cons (NULL_TREE, \
3343 builtin_types[(int) ARG1], \
3345 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3346 builtin_types[(int) ENUM] \
3347 = build_function_type \
3348 (builtin_types[(int) RETURN], \
3349 tree_cons (NULL_TREE, \
3350 builtin_types[(int) ARG1], \
3351 tree_cons (NULL_TREE, \
3352 builtin_types[(int) ARG2], \
3354 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3355 builtin_types[(int) ENUM] \
3356 = build_function_type \
3357 (builtin_types[(int) RETURN], \
3358 tree_cons (NULL_TREE, \
3359 builtin_types[(int) ARG1], \
3360 tree_cons (NULL_TREE, \
3361 builtin_types[(int) ARG2], \
3362 tree_cons (NULL_TREE, \
3363 builtin_types[(int) ARG3], \
3365 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3366 builtin_types[(int) ENUM] \
3367 = build_function_type \
3368 (builtin_types[(int) RETURN], \
3369 tree_cons (NULL_TREE, \
3370 builtin_types[(int) ARG1], \
3371 tree_cons (NULL_TREE, \
3372 builtin_types[(int) ARG2], \
3375 builtin_types[(int) ARG3], \
3376 tree_cons (NULL_TREE, \
3377 builtin_types[(int) ARG4], \
3378 void_list_node)))));
3379 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3380 builtin_types[(int) ENUM] \
3381 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3382 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3383 builtin_types[(int) ENUM] \
3384 = build_function_type (builtin_types[(int) RETURN], \
3385 tree_cons (NULL_TREE, \
3386 builtin_types[(int) ARG1], \
3389 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3390 builtin_types[(int) ENUM] \
3391 = build_function_type \
3392 (builtin_types[(int) RETURN], \
3393 tree_cons (NULL_TREE, \
3394 builtin_types[(int) ARG1], \
3395 tree_cons (NULL_TREE, \
3396 builtin_types[(int) ARG2], \
3399 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3400 builtin_types[(int) ENUM] \
3401 = build_function_type \
3402 (builtin_types[(int) RETURN], \
3403 tree_cons (NULL_TREE, \
3404 builtin_types[(int) ARG1], \
3405 tree_cons (NULL_TREE, \
3406 builtin_types[(int) ARG2], \
3407 tree_cons (NULL_TREE, \
3408 builtin_types[(int) ARG3], \
3411 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3412 builtin_types[(int) ENUM] \
3413 = build_pointer_type (builtin_types[(int) TYPE]);
3414 #include "builtin-types.def"
3415 #undef DEF_PRIMITIVE_TYPE
3416 #undef DEF_FUNCTION_TYPE_1
3417 #undef DEF_FUNCTION_TYPE_2
3418 #undef DEF_FUNCTION_TYPE_3
3419 #undef DEF_FUNCTION_TYPE_4
3420 #undef DEF_FUNCTION_TYPE_VAR_0
3421 #undef DEF_FUNCTION_TYPE_VAR_1
3422 #undef DEF_FUNCTION_TYPE_VAR_2
3423 #undef DEF_FUNCTION_TYPE_VAR_3
3424 #undef DEF_POINTER_TYPE
3426 c_init_attributes ();
3428 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3429 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3434 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3438 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3441 ? (NAME + strlen ("__builtin_")) \
3443 built_in_attributes[(int) ATTRS]); \
3445 decl = builtin_function_2 (NAME, \
3446 NAME + strlen ("__builtin_"), \
3447 builtin_types[TYPE], \
3448 builtin_types[LIBTYPE], \
3453 built_in_attributes[(int) ATTRS]); \
3455 built_in_decls[(int) ENUM] = decl; \
3457 implicit_built_in_decls[(int) ENUM] = decl; \
3459 #include "builtins.def"
3462 (*targetm.init_builtins) ();
3464 main_identifier_node = get_identifier ("main");
3468 build_va_arg (tree expr, tree type)
3470 return build1 (VA_ARG_EXPR, type, expr);
3474 /* Linked list of disabled built-in functions. */
3476 typedef struct disabled_builtin
3479 struct disabled_builtin *next;
3481 static disabled_builtin *disabled_builtins = NULL;
3483 static bool builtin_function_disabled_p (const char *);
3485 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3486 begins with "__builtin_", give an error. */
3489 disable_builtin_function (const char *name)
3491 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3492 error ("cannot disable built-in function `%s'", name);
3495 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3497 new->next = disabled_builtins;
3498 disabled_builtins = new;
3503 /* Return true if the built-in function NAME has been disabled, false
3507 builtin_function_disabled_p (const char *name)
3509 disabled_builtin *p;
3510 for (p = disabled_builtins; p != NULL; p = p->next)
3512 if (strcmp (name, p->name) == 0)
3519 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3520 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3521 of these may be NULL (though both being NULL is useless).
3522 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3523 TYPE is the type of the function with the ordinary name. These
3524 may differ if the ordinary name is declared with a looser type to avoid
3525 conflicts with headers. FUNCTION_CODE and CLASS are as for
3526 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3527 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3528 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3529 ATTRS is the tree list representing the builtin's function attributes.
3530 Returns the declaration of BUILTIN_NAME, if any, otherwise
3531 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3532 or if NONANSI_P and flag_no_nonansi_builtin. */
3535 builtin_function_2 (const char *builtin_name, const char *name,
3536 tree builtin_type, tree type, int function_code,
3537 enum built_in_class class, int library_name_p,
3538 int nonansi_p, tree attrs)
3540 tree bdecl = NULL_TREE;
3541 tree decl = NULL_TREE;
3543 if (builtin_name != 0)
3544 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3545 class, library_name_p ? name : NULL, attrs);
3547 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3548 && !(nonansi_p && flag_no_nonansi_builtin))
3549 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3551 return (bdecl != 0 ? bdecl : decl);
3554 /* Nonzero if the type T promotes to int. This is (nearly) the
3555 integral promotions defined in ISO C99 6.3.1.1/2. */
3558 c_promoting_integer_type_p (tree t)
3560 switch (TREE_CODE (t))
3563 return (TYPE_MAIN_VARIANT (t) == char_type_node
3564 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3565 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3566 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3567 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3568 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3571 /* ??? Technically all enumerations not larger than an int
3572 promote to an int. But this is used along code paths
3573 that only want to notice a size change. */
3574 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3584 /* Return 1 if PARMS specifies a fixed number of parameters
3585 and none of their types is affected by default promotions. */
3588 self_promoting_args_p (tree parms)
3591 for (t = parms; t; t = TREE_CHAIN (t))
3593 tree type = TREE_VALUE (t);
3595 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3601 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3604 if (c_promoting_integer_type_p (type))
3610 /* Recursively examines the array elements of TYPE, until a non-array
3611 element type is found. */
3614 strip_array_types (tree type)
3616 while (TREE_CODE (type) == ARRAY_TYPE)
3617 type = TREE_TYPE (type);
3622 /* Recursively remove any '*' or '&' operator from TYPE. */
3624 strip_pointer_operator (tree t)
3626 while (POINTER_TYPE_P (t))
3631 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3633 /* Expand a call to an unordered comparison function such as
3634 __builtin_isgreater(). FUNCTION is the function's declaration and
3635 PARAMS a list of the values passed. For __builtin_isunordered(),
3636 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3637 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3638 that give the opposite of the desired result. UNORDERED_CODE is
3639 used for modes that can hold NaNs and ORDERED_CODE is used for the
3643 expand_unordered_cmp (tree function, tree params,
3644 enum tree_code unordered_code,
3645 enum tree_code ordered_code)
3647 tree arg0, arg1, type;
3648 enum tree_code code0, code1;
3650 /* Check that we have exactly two arguments. */
3651 if (params == 0 || TREE_CHAIN (params) == 0)
3653 error ("too few arguments to function `%s'",
3654 IDENTIFIER_POINTER (DECL_NAME (function)));
3655 return error_mark_node;
3657 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3659 error ("too many arguments to function `%s'",
3660 IDENTIFIER_POINTER (DECL_NAME (function)));
3661 return error_mark_node;
3664 arg0 = TREE_VALUE (params);
3665 arg1 = TREE_VALUE (TREE_CHAIN (params));
3667 code0 = TREE_CODE (TREE_TYPE (arg0));
3668 code1 = TREE_CODE (TREE_TYPE (arg1));
3670 /* Make sure that the arguments have a common type of REAL. */
3672 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3673 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3674 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3676 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3678 error ("non-floating-point argument to function `%s'",
3679 IDENTIFIER_POINTER (DECL_NAME (function)));
3680 return error_mark_node;
3683 if (unordered_code == UNORDERED_EXPR)
3685 if (MODE_HAS_NANS (TYPE_MODE (type)))
3686 return build_binary_op (unordered_code,
3687 convert (type, arg0),
3688 convert (type, arg1),
3691 return integer_zero_node;
3694 return build_unary_op (TRUTH_NOT_EXPR,
3695 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3698 convert (type, arg0),
3699 convert (type, arg1),
3705 /* Recognize certain built-in functions so we can make tree-codes
3706 other than CALL_EXPR. We do this when it enables fold-const.c
3707 to do something useful. */
3708 /* ??? By rights this should go in builtins.c, but only C and C++
3709 implement build_{binary,unary}_op. Not exactly sure what bits
3710 of functionality are actually needed from those functions, or
3711 where the similar functionality exists in the other front ends. */
3714 expand_tree_builtin (tree function, tree params, tree coerced_params)
3716 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3719 switch (DECL_FUNCTION_CODE (function))
3723 case BUILT_IN_LLABS:
3724 case BUILT_IN_IMAXABS:
3726 case BUILT_IN_FABSL:
3727 case BUILT_IN_FABSF:
3728 if (coerced_params == 0)
3729 return integer_zero_node;
3730 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3733 case BUILT_IN_CONJF:
3734 case BUILT_IN_CONJL:
3735 if (coerced_params == 0)
3736 return integer_zero_node;
3737 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3739 case BUILT_IN_CREAL:
3740 case BUILT_IN_CREALF:
3741 case BUILT_IN_CREALL:
3742 if (coerced_params == 0)
3743 return integer_zero_node;
3744 return non_lvalue (build_unary_op (REALPART_EXPR,
3745 TREE_VALUE (coerced_params), 0));
3747 case BUILT_IN_CIMAG:
3748 case BUILT_IN_CIMAGF:
3749 case BUILT_IN_CIMAGL:
3750 if (coerced_params == 0)
3751 return integer_zero_node;
3752 return non_lvalue (build_unary_op (IMAGPART_EXPR,
3753 TREE_VALUE (coerced_params), 0));
3755 case BUILT_IN_ISGREATER:
3756 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3758 case BUILT_IN_ISGREATEREQUAL:
3759 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3761 case BUILT_IN_ISLESS:
3762 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3764 case BUILT_IN_ISLESSEQUAL:
3765 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3767 case BUILT_IN_ISLESSGREATER:
3768 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3770 case BUILT_IN_ISUNORDERED:
3771 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3780 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3781 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3782 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3783 value, the traversal is aborted, and the value returned by FUNC is
3784 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3785 the node being visited are not walked.
3787 We don't need a without_duplicates variant of this one because the
3788 statement tree is a tree, not a graph. */
3791 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3793 enum tree_code code;
3798 #define WALK_SUBTREE(NODE) \
3801 result = walk_stmt_tree (&(NODE), func, data); \
3807 /* Skip empty subtrees. */
3811 /* Skip subtrees below non-statement nodes. */
3812 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3815 /* Call the function. */
3817 result = (*func) (tp, &walk_subtrees, data);
3819 /* If we found something, return it. */
3823 /* FUNC may have modified the tree, recheck that we're looking at a
3825 code = TREE_CODE (*tp);
3826 if (!STATEMENT_CODE_P (code))
3829 /* Visit the subtrees unless FUNC decided that there was nothing
3830 interesting below this point in the tree. */
3833 /* Walk over all the sub-trees of this operand. Statement nodes
3834 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3835 len = TREE_CODE_LENGTH (code);
3837 /* Go through the subtrees. We need to do this in forward order so
3838 that the scope of a FOR_EXPR is handled properly. */
3839 for (i = 0; i < len; ++i)
3840 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3843 /* Finally visit the chain. This can be tail-recursion optimized if
3844 we write it this way. */
3845 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3850 /* Used to compare case labels. K1 and K2 are actually tree nodes
3851 representing case labels, or NULL_TREE for a `default' label.
3852 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3853 K2, and 0 if K1 and K2 are equal. */
3856 case_compare (splay_tree_key k1, splay_tree_key k2)
3858 /* Consider a NULL key (such as arises with a `default' label) to be
3859 smaller than anything else. */
3865 return tree_int_cst_compare ((tree) k1, (tree) k2);
3868 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3869 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3870 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3871 case label was declared using the usual C/C++ syntax, rather than
3872 the GNU case range extension. CASES is a tree containing all the
3873 case ranges processed so far; COND is the condition for the
3874 switch-statement itself. Returns the CASE_LABEL created, or
3875 ERROR_MARK_NODE if no CASE_LABEL is created. */
3878 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3884 splay_tree_node node;
3886 /* Create the LABEL_DECL itself. */
3887 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3888 DECL_CONTEXT (label) = current_function_decl;
3890 /* If there was an error processing the switch condition, bail now
3891 before we get more confused. */
3892 if (!cond || cond == error_mark_node)
3894 /* Add a label anyhow so that the back-end doesn't think that
3895 the beginning of the switch is unreachable. */
3897 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3898 return error_mark_node;
3901 if ((low_value && TREE_TYPE (low_value)
3902 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3903 || (high_value && TREE_TYPE (high_value)
3904 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3905 error ("pointers are not permitted as case values");
3907 /* Case ranges are a GNU extension. */
3908 if (high_value && pedantic)
3909 pedwarn ("range expressions in switch statements are non-standard");
3911 type = TREE_TYPE (cond);
3914 low_value = check_case_value (low_value);
3915 low_value = convert_and_check (type, low_value);
3919 high_value = check_case_value (high_value);
3920 high_value = convert_and_check (type, high_value);
3923 /* If an error has occurred, bail out now. */
3924 if (low_value == error_mark_node || high_value == error_mark_node)
3927 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3928 return error_mark_node;
3931 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3932 really a case range, even though it was written that way. Remove
3933 the HIGH_VALUE to simplify later processing. */
3934 if (tree_int_cst_equal (low_value, high_value))
3935 high_value = NULL_TREE;
3936 if (low_value && high_value
3937 && !tree_int_cst_lt (low_value, high_value))
3938 warning ("empty range specified");
3940 /* Look up the LOW_VALUE in the table of case labels we already
3942 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3943 /* If there was not an exact match, check for overlapping ranges.
3944 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3945 that's a `default' label and the only overlap is an exact match. */
3946 if (!node && (low_value || high_value))
3948 splay_tree_node low_bound;
3949 splay_tree_node high_bound;
3951 /* Even though there wasn't an exact match, there might be an
3952 overlap between this case range and another case range.
3953 Since we've (inductively) not allowed any overlapping case
3954 ranges, we simply need to find the greatest low case label
3955 that is smaller that LOW_VALUE, and the smallest low case
3956 label that is greater than LOW_VALUE. If there is an overlap
3957 it will occur in one of these two ranges. */
3958 low_bound = splay_tree_predecessor (cases,
3959 (splay_tree_key) low_value);
3960 high_bound = splay_tree_successor (cases,
3961 (splay_tree_key) low_value);
3963 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3964 the LOW_VALUE, so there is no need to check unless the
3965 LOW_BOUND is in fact itself a case range. */
3967 && CASE_HIGH ((tree) low_bound->value)
3968 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3971 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3972 range is bigger than the low end of the current range, so we
3973 are only interested if the current range is a real range, and
3974 not an ordinary case label. */
3977 && (tree_int_cst_compare ((tree) high_bound->key,
3982 /* If there was an overlap, issue an error. */
3985 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3989 error ("duplicate (or overlapping) case value");
3990 error ("%Jthis is the first entry overlapping that value", duplicate);
3994 error ("duplicate case value") ;
3995 error ("%Jpreviously used here", duplicate);
3999 error ("multiple default labels in one switch");
4000 error ("%Jthis is the first default label", duplicate);
4003 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
4006 /* Add a CASE_LABEL to the statement-tree. */
4007 case_label = add_stmt (build_case_label (low_value, high_value, label));
4008 /* Register this case label in the splay tree. */
4009 splay_tree_insert (cases,
4010 (splay_tree_key) low_value,
4011 (splay_tree_value) case_label);
4016 /* Finish an expression taking the address of LABEL (an
4017 IDENTIFIER_NODE). Returns an expression for the address. */
4020 finish_label_address_expr (tree label)
4025 pedwarn ("taking the address of a label is non-standard");
4027 if (label == error_mark_node)
4028 return error_mark_node;
4030 label = lookup_label (label);
4031 if (label == NULL_TREE)
4032 result = null_pointer_node;
4035 TREE_USED (label) = 1;
4036 result = build1 (ADDR_EXPR, ptr_type_node, label);
4037 TREE_CONSTANT (result) = 1;
4038 /* The current function in not necessarily uninlinable.
4039 Computed gotos are incompatible with inlining, but the value
4040 here could be used only in a diagnostic, for example. */
4046 /* Hook used by expand_expr to expand language-specific tree codes. */
4049 c_expand_expr (tree exp, rtx target, enum machine_mode tmode, int modifier)
4050 /* Actually enum_modifier. */
4052 switch (TREE_CODE (exp))
4058 bool preserve_result = false;
4059 bool return_target = false;
4061 if (STMT_EXPR_WARN_UNUSED_RESULT (exp) && target == const0_rtx)
4063 tree stmt = STMT_EXPR_STMT (exp);
4066 for (scope = COMPOUND_BODY (stmt);
4067 scope && TREE_CODE (scope) != SCOPE_STMT;
4068 scope = TREE_CHAIN (scope));
4070 if (scope && SCOPE_STMT_BLOCK (scope))
4071 warning ("%Hignoring return value of `%D', "
4072 "declared with attribute warn_unused_result",
4073 &expr_wfl_stack->location,
4074 BLOCK_ABSTRACT_ORIGIN (SCOPE_STMT_BLOCK (scope)));
4076 warning ("%Hignoring return value of function "
4077 "declared with attribute warn_unused_result",
4078 &expr_wfl_stack->location);
4081 /* Since expand_expr_stmt calls free_temp_slots after every
4082 expression statement, we must call push_temp_slots here.
4083 Otherwise, any temporaries in use now would be considered
4084 out-of-scope after the first EXPR_STMT from within the
4087 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
4089 /* If we want the result of this expression, find the last
4090 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
4091 if (target != const0_rtx
4092 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
4093 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
4095 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
4096 tree last = TREE_CHAIN (expr);
4098 while (TREE_CHAIN (last))
4101 last = TREE_CHAIN (last);
4104 if (TREE_CODE (last) == SCOPE_STMT
4105 && TREE_CODE (expr) == EXPR_STMT)
4107 if (target && TREE_CODE (EXPR_STMT_EXPR (expr)) == VAR_DECL
4108 && DECL_RTL_IF_SET (EXPR_STMT_EXPR (expr)) == target)
4109 /* If the last expression is a variable whose RTL is the
4110 same as our target, just return the target; if it
4111 isn't valid expanding the decl would produce different
4112 RTL, and store_expr would try to do a copy. */
4113 return_target = true;
4116 /* Otherwise, note that we want the value from the last
4118 TREE_ADDRESSABLE (expr) = 1;
4119 preserve_result = true;
4124 expand_stmt (STMT_EXPR_STMT (exp));
4125 expand_end_stmt_expr (rtl_expr);
4127 result = expand_expr (rtl_expr, target, tmode, modifier);
4130 else if (preserve_result && GET_CODE (result) == MEM)
4132 if (GET_MODE (result) != BLKmode)
4133 result = copy_to_reg (result);
4135 preserve_temp_slots (result);
4138 /* If the statment-expression does not have a scope, then the
4139 new temporaries we created within it must live beyond the
4140 statement-expression. */
4141 if (STMT_EXPR_NO_SCOPE (exp))
4142 preserve_temp_slots (NULL_RTX);
4149 case COMPOUND_LITERAL_EXPR:
4151 /* Initialize the anonymous variable declared in the compound
4152 literal, then return the variable. */
4153 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4154 emit_local_var (decl);
4155 return expand_expr (decl, target, tmode, modifier);
4166 /* Hook used by safe_from_p to handle language-specific tree codes. */
4169 c_safe_from_p (rtx target, tree exp)
4171 /* We can see statements here when processing the body of a
4172 statement-expression. For a declaration statement declaring a
4173 variable, look at the variable's initializer. */
4174 if (TREE_CODE (exp) == DECL_STMT)
4176 tree decl = DECL_STMT_DECL (exp);
4178 if (TREE_CODE (decl) == VAR_DECL
4179 && DECL_INITIAL (decl)
4180 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4184 /* For any statement, we must follow the statement-chain. */
4185 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4186 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4188 /* Assume everything else is safe. */
4192 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4195 c_common_unsafe_for_reeval (tree exp)
4197 /* Statement expressions may not be reevaluated, likewise compound
4199 if (TREE_CODE (exp) == STMT_EXPR
4200 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4203 /* Walk all other expressions. */
4207 /* Hook used by staticp to handle language-specific tree codes. */
4210 c_staticp (tree exp)
4212 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4213 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4219 /* Given a boolean expression ARG, return a tree representing an increment
4220 or decrement (as indicated by CODE) of ARG. The front end must check for
4221 invalid cases (e.g., decrement in C++). */
4223 boolean_increment (enum tree_code code, tree arg)
4226 tree true_res = boolean_true_node;
4228 arg = stabilize_reference (arg);
4231 case PREINCREMENT_EXPR:
4232 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4234 case POSTINCREMENT_EXPR:
4235 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4236 arg = save_expr (arg);
4237 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4238 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4240 case PREDECREMENT_EXPR:
4241 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4243 case POSTDECREMENT_EXPR:
4244 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4245 arg = save_expr (arg);
4246 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4247 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4252 TREE_SIDE_EFFECTS (val) = 1;
4256 /* Built-in macros for stddef.h, that require macros defined in this
4259 c_stddef_cpp_builtins(void)
4261 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4262 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4263 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4264 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4268 c_init_attributes (void)
4270 /* Fill in the built_in_attributes array. */
4271 #define DEF_ATTR_NULL_TREE(ENUM) \
4272 built_in_attributes[(int) ENUM] = NULL_TREE;
4273 #define DEF_ATTR_INT(ENUM, VALUE) \
4274 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4275 #define DEF_ATTR_IDENT(ENUM, STRING) \
4276 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4277 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4278 built_in_attributes[(int) ENUM] \
4279 = tree_cons (built_in_attributes[(int) PURPOSE], \
4280 built_in_attributes[(int) VALUE], \
4281 built_in_attributes[(int) CHAIN]);
4282 #include "builtin-attrs.def"
4283 #undef DEF_ATTR_NULL_TREE
4285 #undef DEF_ATTR_IDENT
4286 #undef DEF_ATTR_TREE_LIST
4289 /* Output a -Wshadow warning MSGCODE about NAME, and give the location
4290 of the previous declaration DECL. */
4292 shadow_warning (enum sw_kind msgcode, const char *name, tree decl)
4294 static const char *const msgs[] = {
4295 /* SW_PARAM */ N_("declaration of \"%s\" shadows a parameter"),
4296 /* SW_LOCAL */ N_("declaration of \"%s\" shadows a previous local"),
4297 /* SW_GLOBAL */ N_("declaration of \"%s\" shadows a global declaration")
4300 warning (msgs[msgcode], name);
4301 warning ("%Jshadowed declaration is here", decl);
4304 /* Attribute handlers common to C front ends. */
4306 /* Handle a "packed" attribute; arguments as in
4307 struct attribute_spec.handler. */
4310 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4311 int flags, bool *no_add_attrs)
4315 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4316 *node = build_type_copy (*node);
4317 TYPE_PACKED (*node) = 1;
4318 if (TYPE_MAIN_VARIANT (*node) == *node)
4320 /* If it is the main variant, then pack the other variants
4321 too. This happens in,
4324 struct Foo const *ptr; // creates a variant w/o packed flag
4325 } __ attribute__((packed)); // packs it now.
4329 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4330 TYPE_PACKED (probe) = 1;
4334 else if (TREE_CODE (*node) == FIELD_DECL)
4335 DECL_PACKED (*node) = 1;
4336 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4337 used for DECL_REGISTER. It wouldn't mean anything anyway.
4338 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4339 that changes what the typedef is typing. */
4342 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4343 *no_add_attrs = true;
4349 /* Handle a "nocommon" attribute; arguments as in
4350 struct attribute_spec.handler. */
4353 handle_nocommon_attribute (tree *node, tree name,
4354 tree args ATTRIBUTE_UNUSED,
4355 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4357 if (TREE_CODE (*node) == VAR_DECL)
4358 DECL_COMMON (*node) = 0;
4361 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4362 *no_add_attrs = true;
4368 /* Handle a "common" attribute; arguments as in
4369 struct attribute_spec.handler. */
4372 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4373 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4375 if (TREE_CODE (*node) == VAR_DECL)
4376 DECL_COMMON (*node) = 1;
4379 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4380 *no_add_attrs = true;
4386 /* Handle a "noreturn" attribute; arguments as in
4387 struct attribute_spec.handler. */
4390 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4391 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4393 tree type = TREE_TYPE (*node);
4395 /* See FIXME comment in c_common_attribute_table. */
4396 if (TREE_CODE (*node) == FUNCTION_DECL)
4397 TREE_THIS_VOLATILE (*node) = 1;
4398 else if (TREE_CODE (type) == POINTER_TYPE
4399 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4401 = build_pointer_type
4402 (build_type_variant (TREE_TYPE (type),
4403 TREE_READONLY (TREE_TYPE (type)), 1));
4406 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4407 *no_add_attrs = true;
4413 /* Handle a "noinline" attribute; arguments as in
4414 struct attribute_spec.handler. */
4417 handle_noinline_attribute (tree *node, tree name,
4418 tree args ATTRIBUTE_UNUSED,
4419 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4421 if (TREE_CODE (*node) == FUNCTION_DECL)
4422 DECL_UNINLINABLE (*node) = 1;
4425 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4426 *no_add_attrs = true;
4432 /* Handle a "always_inline" attribute; arguments as in
4433 struct attribute_spec.handler. */
4436 handle_always_inline_attribute (tree *node, tree name,
4437 tree args ATTRIBUTE_UNUSED,
4438 int flags ATTRIBUTE_UNUSED,
4441 if (TREE_CODE (*node) == FUNCTION_DECL)
4443 /* Do nothing else, just set the attribute. We'll get at
4444 it later with lookup_attribute. */
4448 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4449 *no_add_attrs = true;
4455 /* Handle a "used" attribute; arguments as in
4456 struct attribute_spec.handler. */
4459 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4460 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4464 if (TREE_CODE (node) == FUNCTION_DECL
4465 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4467 TREE_USED (node) = 1;
4471 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4472 *no_add_attrs = true;
4478 /* Handle a "unused" attribute; arguments as in
4479 struct attribute_spec.handler. */
4482 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4483 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4489 if (TREE_CODE (decl) == PARM_DECL
4490 || TREE_CODE (decl) == VAR_DECL
4491 || TREE_CODE (decl) == FUNCTION_DECL
4492 || TREE_CODE (decl) == LABEL_DECL
4493 || TREE_CODE (decl) == TYPE_DECL)
4494 TREE_USED (decl) = 1;
4497 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4498 *no_add_attrs = true;
4503 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4504 *node = build_type_copy (*node);
4505 TREE_USED (*node) = 1;
4511 /* Handle a "const" attribute; arguments as in
4512 struct attribute_spec.handler. */
4515 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4516 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4518 tree type = TREE_TYPE (*node);
4520 /* See FIXME comment on noreturn in c_common_attribute_table. */
4521 if (TREE_CODE (*node) == FUNCTION_DECL)
4522 TREE_READONLY (*node) = 1;
4523 else if (TREE_CODE (type) == POINTER_TYPE
4524 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4526 = build_pointer_type
4527 (build_type_variant (TREE_TYPE (type), 1,
4528 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4531 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4532 *no_add_attrs = true;
4538 /* Handle a "transparent_union" attribute; arguments as in
4539 struct attribute_spec.handler. */
4542 handle_transparent_union_attribute (tree *node, tree name,
4543 tree args ATTRIBUTE_UNUSED, int flags,
4546 tree decl = NULL_TREE;
4553 type = &TREE_TYPE (decl);
4554 is_type = TREE_CODE (*node) == TYPE_DECL;
4556 else if (TYPE_P (*node))
4557 type = node, is_type = 1;
4560 && TREE_CODE (*type) == UNION_TYPE
4562 || (TYPE_FIELDS (*type) != 0
4563 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4565 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4566 *type = build_type_copy (*type);
4567 TYPE_TRANSPARENT_UNION (*type) = 1;
4569 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4570 && TREE_CODE (*type) == UNION_TYPE
4571 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4572 DECL_TRANSPARENT_UNION (decl) = 1;
4575 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4576 *no_add_attrs = true;
4582 /* Handle a "constructor" attribute; arguments as in
4583 struct attribute_spec.handler. */
4586 handle_constructor_attribute (tree *node, tree name,
4587 tree args ATTRIBUTE_UNUSED,
4588 int flags ATTRIBUTE_UNUSED,
4592 tree type = TREE_TYPE (decl);
4594 if (TREE_CODE (decl) == FUNCTION_DECL
4595 && TREE_CODE (type) == FUNCTION_TYPE
4596 && decl_function_context (decl) == 0)
4598 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4599 TREE_USED (decl) = 1;
4603 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4604 *no_add_attrs = true;
4610 /* Handle a "destructor" attribute; arguments as in
4611 struct attribute_spec.handler. */
4614 handle_destructor_attribute (tree *node, tree name,
4615 tree args ATTRIBUTE_UNUSED,
4616 int flags ATTRIBUTE_UNUSED,
4620 tree type = TREE_TYPE (decl);
4622 if (TREE_CODE (decl) == FUNCTION_DECL
4623 && TREE_CODE (type) == FUNCTION_TYPE
4624 && decl_function_context (decl) == 0)
4626 DECL_STATIC_DESTRUCTOR (decl) = 1;
4627 TREE_USED (decl) = 1;
4631 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4632 *no_add_attrs = true;
4638 /* Handle a "mode" attribute; arguments as in
4639 struct attribute_spec.handler. */
4642 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4643 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4647 *no_add_attrs = true;
4649 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4650 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4654 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4655 int len = strlen (p);
4656 enum machine_mode mode = VOIDmode;
4660 if (len > 4 && p[0] == '_' && p[1] == '_'
4661 && p[len - 1] == '_' && p[len - 2] == '_')
4663 char *newp = alloca (len - 1);
4665 strcpy (newp, &p[2]);
4666 newp[len - 4] = '\0';
4670 /* Change this type to have a type with the specified mode.
4671 First check for the special modes. */
4672 if (! strcmp (p, "byte"))
4674 else if (!strcmp (p, "word"))
4676 else if (! strcmp (p, "pointer"))
4679 for (j = 0; j < NUM_MACHINE_MODES; j++)
4680 if (!strcmp (p, GET_MODE_NAME (j)))
4681 mode = (enum machine_mode) j;
4683 if (mode == VOIDmode)
4684 error ("unknown machine mode `%s'", p);
4685 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
4686 (mode, TREE_UNSIGNED (type))))
4687 error ("no data type for mode `%s'", p);
4688 else if ((TREE_CODE (type) == POINTER_TYPE
4689 || TREE_CODE (type) == REFERENCE_TYPE)
4690 && !(*targetm.valid_pointer_mode) (mode))
4691 error ("invalid pointer mode `%s'", p);
4694 /* If this is a vector, make sure we either have hardware
4695 support, or we can emulate it. */
4696 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4698 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4702 if (TREE_CODE (type) == POINTER_TYPE)
4704 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4708 else if (TREE_CODE (type) == REFERENCE_TYPE)
4710 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4716 /* No need to layout the type here. The caller should do this. */
4723 /* Handle a "section" attribute; arguments as in
4724 struct attribute_spec.handler. */
4727 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4728 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4732 if (targetm.have_named_sections)
4734 if ((TREE_CODE (decl) == FUNCTION_DECL
4735 || TREE_CODE (decl) == VAR_DECL)
4736 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4738 if (TREE_CODE (decl) == VAR_DECL
4739 && current_function_decl != NULL_TREE
4740 && ! TREE_STATIC (decl))
4742 error ("%Jsection attribute cannot be specified for "
4743 "local variables", decl);
4744 *no_add_attrs = true;
4747 /* The decl may have already been given a section attribute
4748 from a previous declaration. Ensure they match. */
4749 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4750 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4751 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4753 error ("%Jsection of '%D' conflicts with previous declaration",
4755 *no_add_attrs = true;
4758 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4762 error ("%Jsection attribute not allowed for '%D'", *node, *node);
4763 *no_add_attrs = true;
4768 error ("%Jsection attributes are not supported for this target", *node);
4769 *no_add_attrs = true;
4775 /* Handle a "aligned" attribute; arguments as in
4776 struct attribute_spec.handler. */
4779 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4780 int flags, bool *no_add_attrs)
4782 tree decl = NULL_TREE;
4785 tree align_expr = (args ? TREE_VALUE (args)
4786 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4792 type = &TREE_TYPE (decl);
4793 is_type = TREE_CODE (*node) == TYPE_DECL;
4795 else if (TYPE_P (*node))
4796 type = node, is_type = 1;
4798 /* Strip any NOPs of any kind. */
4799 while (TREE_CODE (align_expr) == NOP_EXPR
4800 || TREE_CODE (align_expr) == CONVERT_EXPR
4801 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4802 align_expr = TREE_OPERAND (align_expr, 0);
4804 if (TREE_CODE (align_expr) != INTEGER_CST)
4806 error ("requested alignment is not a constant");
4807 *no_add_attrs = true;
4809 else if ((i = tree_log2 (align_expr)) == -1)
4811 error ("requested alignment is not a power of 2");
4812 *no_add_attrs = true;
4814 else if (i > HOST_BITS_PER_INT - 2)
4816 error ("requested alignment is too large");
4817 *no_add_attrs = true;
4821 /* If we have a TYPE_DECL, then copy the type, so that we
4822 don't accidentally modify a builtin type. See pushdecl. */
4823 if (decl && TREE_TYPE (decl) != error_mark_node
4824 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4826 tree tt = TREE_TYPE (decl);
4827 *type = build_type_copy (*type);
4828 DECL_ORIGINAL_TYPE (decl) = tt;
4829 TYPE_NAME (*type) = decl;
4830 TREE_USED (*type) = TREE_USED (decl);
4831 TREE_TYPE (decl) = *type;
4833 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4834 *type = build_type_copy (*type);
4836 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4837 TYPE_USER_ALIGN (*type) = 1;
4839 else if (TREE_CODE (decl) != VAR_DECL
4840 && TREE_CODE (decl) != FIELD_DECL)
4842 error ("%Jalignment may not be specified for '%D'", decl, decl);
4843 *no_add_attrs = true;
4847 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4848 DECL_USER_ALIGN (decl) = 1;
4854 /* Handle a "weak" attribute; arguments as in
4855 struct attribute_spec.handler. */
4858 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4859 tree args ATTRIBUTE_UNUSED,
4860 int flags ATTRIBUTE_UNUSED,
4861 bool *no_add_attrs ATTRIBUTE_UNUSED)
4863 declare_weak (*node);
4868 /* Handle an "alias" attribute; arguments as in
4869 struct attribute_spec.handler. */
4872 handle_alias_attribute (tree *node, tree name, tree args,
4873 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4877 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4878 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4880 error ("%J'%D' defined both normally and as an alias", decl, decl);
4881 *no_add_attrs = true;
4883 else if (decl_function_context (decl) == 0)
4887 id = TREE_VALUE (args);
4888 if (TREE_CODE (id) != STRING_CST)
4890 error ("alias arg not a string");
4891 *no_add_attrs = true;
4894 id = get_identifier (TREE_STRING_POINTER (id));
4895 /* This counts as a use of the object pointed to. */
4898 if (TREE_CODE (decl) == FUNCTION_DECL)
4899 DECL_INITIAL (decl) = error_mark_node;
4901 DECL_EXTERNAL (decl) = 0;
4905 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4906 *no_add_attrs = true;
4912 /* Handle an "visibility" attribute; arguments as in
4913 struct attribute_spec.handler. */
4916 handle_visibility_attribute (tree *node, tree name, tree args,
4917 int flags ATTRIBUTE_UNUSED,
4921 tree id = TREE_VALUE (args);
4923 *no_add_attrs = true;
4925 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
4927 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4931 if (TREE_CODE (id) != STRING_CST)
4933 error ("visibility arg not a string");
4937 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
4938 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4939 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
4940 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
4941 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
4942 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
4943 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
4944 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
4946 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4951 /* Handle an "tls_model" attribute; arguments as in
4952 struct attribute_spec.handler. */
4955 handle_tls_model_attribute (tree *node, tree name, tree args,
4956 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4960 if (! DECL_THREAD_LOCAL (decl))
4962 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4963 *no_add_attrs = true;
4969 id = TREE_VALUE (args);
4970 if (TREE_CODE (id) != STRING_CST)
4972 error ("tls_model arg not a string");
4973 *no_add_attrs = true;
4976 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4977 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4978 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4979 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4981 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4982 *no_add_attrs = true;
4990 /* Handle a "no_instrument_function" attribute; arguments as in
4991 struct attribute_spec.handler. */
4994 handle_no_instrument_function_attribute (tree *node, tree name,
4995 tree args ATTRIBUTE_UNUSED,
4996 int flags ATTRIBUTE_UNUSED,
5001 if (TREE_CODE (decl) != FUNCTION_DECL)
5003 error ("%J'%E' attribute applies only to functions", decl, name);
5004 *no_add_attrs = true;
5006 else if (DECL_INITIAL (decl))
5008 error ("%Jcan't set '%E' attribute after definition", decl, name);
5009 *no_add_attrs = true;
5012 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5017 /* Handle a "malloc" attribute; arguments as in
5018 struct attribute_spec.handler. */
5021 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5022 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5024 if (TREE_CODE (*node) == FUNCTION_DECL)
5025 DECL_IS_MALLOC (*node) = 1;
5026 /* ??? TODO: Support types. */
5029 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5030 *no_add_attrs = true;
5036 /* Handle a "no_limit_stack" attribute; arguments as in
5037 struct attribute_spec.handler. */
5040 handle_no_limit_stack_attribute (tree *node, tree name,
5041 tree args ATTRIBUTE_UNUSED,
5042 int flags ATTRIBUTE_UNUSED,
5047 if (TREE_CODE (decl) != FUNCTION_DECL)
5049 error ("%J'%E' attribute applies only to functions", decl, name);
5050 *no_add_attrs = true;
5052 else if (DECL_INITIAL (decl))
5054 error ("%Jcan't set '%E' attribute after definition", decl, name);
5055 *no_add_attrs = true;
5058 DECL_NO_LIMIT_STACK (decl) = 1;
5063 /* Handle a "pure" attribute; arguments as in
5064 struct attribute_spec.handler. */
5067 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5068 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5070 if (TREE_CODE (*node) == FUNCTION_DECL)
5071 DECL_IS_PURE (*node) = 1;
5072 /* ??? TODO: Support types. */
5075 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5076 *no_add_attrs = true;
5082 /* Handle a "deprecated" attribute; arguments as in
5083 struct attribute_spec.handler. */
5086 handle_deprecated_attribute (tree *node, tree name,
5087 tree args ATTRIBUTE_UNUSED, int flags,
5090 tree type = NULL_TREE;
5092 const char *what = NULL;
5097 type = TREE_TYPE (decl);
5099 if (TREE_CODE (decl) == TYPE_DECL
5100 || TREE_CODE (decl) == PARM_DECL
5101 || TREE_CODE (decl) == VAR_DECL
5102 || TREE_CODE (decl) == FUNCTION_DECL
5103 || TREE_CODE (decl) == FIELD_DECL)
5104 TREE_DEPRECATED (decl) = 1;
5108 else if (TYPE_P (*node))
5110 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5111 *node = build_type_copy (*node);
5112 TREE_DEPRECATED (*node) = 1;
5120 *no_add_attrs = true;
5121 if (type && TYPE_NAME (type))
5123 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5124 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5125 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5126 && DECL_NAME (TYPE_NAME (type)))
5127 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5130 warning ("`%s' attribute ignored for `%s'",
5131 IDENTIFIER_POINTER (name), what);
5133 warning ("`%s' attribute ignored",
5134 IDENTIFIER_POINTER (name));
5140 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5141 to prevent us from duplicating type nodes unnecessarily.
5142 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5143 since we want to distinguish types that are essentially identical (except
5144 for their debug representation), we use a local list here. */
5145 static GTY(()) tree vector_type_node_list = 0;
5147 /* Handle a "vector_size" attribute; arguments as in
5148 struct attribute_spec.handler. */
5151 handle_vector_size_attribute (tree *node, tree name, tree args,
5152 int flags ATTRIBUTE_UNUSED,
5155 unsigned HOST_WIDE_INT vecsize, nunits;
5156 enum machine_mode mode, orig_mode, new_mode;
5157 tree type = *node, new_type = NULL_TREE;
5158 tree type_list_node;
5160 *no_add_attrs = true;
5162 if (! host_integerp (TREE_VALUE (args), 1))
5164 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5168 /* Get the vector size (in bytes). */
5169 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5171 /* We need to provide for vector pointers, vector arrays, and
5172 functions returning vectors. For example:
5174 __attribute__((vector_size(16))) short *foo;
5176 In this case, the mode is SI, but the type being modified is
5177 HI, so we need to look further. */
5179 while (POINTER_TYPE_P (type)
5180 || TREE_CODE (type) == FUNCTION_TYPE
5181 || TREE_CODE (type) == METHOD_TYPE
5182 || TREE_CODE (type) == ARRAY_TYPE)
5183 type = TREE_TYPE (type);
5185 /* Get the mode of the type being modified. */
5186 orig_mode = TYPE_MODE (type);
5188 if (TREE_CODE (type) == RECORD_TYPE
5189 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5190 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5191 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5193 error ("invalid vector type for attribute `%s'",
5194 IDENTIFIER_POINTER (name));
5198 /* Calculate how many units fit in the vector. */
5199 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5201 /* Find a suitably sized vector. */
5202 new_mode = VOIDmode;
5203 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5205 : MODE_VECTOR_FLOAT);
5207 mode = GET_MODE_WIDER_MODE (mode))
5208 if (vecsize == GET_MODE_SIZE (mode)
5209 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5215 if (new_mode == VOIDmode)
5217 error ("no vector mode with the size and type specified could be found");
5221 for (type_list_node = vector_type_node_list; type_list_node;
5222 type_list_node = TREE_CHAIN (type_list_node))
5224 tree other_type = TREE_VALUE (type_list_node);
5225 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5226 tree fields = TYPE_FIELDS (record);
5227 tree field_type = TREE_TYPE (fields);
5228 tree array_type = TREE_TYPE (field_type);
5229 if (TREE_CODE (fields) != FIELD_DECL
5230 || TREE_CODE (field_type) != ARRAY_TYPE)
5233 if (TYPE_MODE (other_type) == mode && type == array_type)
5235 new_type = other_type;
5240 if (new_type == NULL_TREE)
5242 tree index, array, rt, list_node;
5244 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5245 TREE_UNSIGNED (type));
5249 error ("no vector mode with the size and type specified could be found");
5253 new_type = build_type_copy (new_type);
5255 /* If this is a vector, make sure we either have hardware
5256 support, or we can emulate it. */
5257 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5258 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5259 && !vector_mode_valid_p (mode))
5261 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5265 /* Set the debug information here, because this is the only
5266 place where we know the underlying type for a vector made
5267 with vector_size. For debugging purposes we pretend a vector
5268 is an array within a structure. */
5269 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5270 array = build_array_type (type, build_index_type (index));
5271 rt = make_node (RECORD_TYPE);
5273 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5274 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5276 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5278 list_node = build_tree_list (NULL, new_type);
5279 TREE_CHAIN (list_node) = vector_type_node_list;
5280 vector_type_node_list = list_node;
5283 /* Build back pointers if needed. */
5284 *node = vector_size_helper (*node, new_type);
5289 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5292 If we requested a pointer to a vector, build up the pointers that
5293 we stripped off while looking for the inner type. Similarly for
5294 return values from functions.
5296 The argument "type" is the top of the chain, and "bottom" is the
5297 new type which we will point to. */
5300 vector_size_helper (tree type, tree bottom)
5304 if (POINTER_TYPE_P (type))
5306 inner = vector_size_helper (TREE_TYPE (type), bottom);
5307 outer = build_pointer_type (inner);
5309 else if (TREE_CODE (type) == ARRAY_TYPE)
5311 inner = vector_size_helper (TREE_TYPE (type), bottom);
5312 outer = build_array_type (inner, TYPE_DOMAIN (type));
5314 else if (TREE_CODE (type) == FUNCTION_TYPE)
5316 inner = vector_size_helper (TREE_TYPE (type), bottom);
5317 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5319 else if (TREE_CODE (type) == METHOD_TYPE)
5321 inner = vector_size_helper (TREE_TYPE (type), bottom);
5322 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5324 TYPE_ARG_TYPES (type));
5329 TREE_READONLY (outer) = TREE_READONLY (type);
5330 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5335 /* Handle the "nonnull" attribute. */
5337 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5338 tree args, int flags ATTRIBUTE_UNUSED,
5342 unsigned HOST_WIDE_INT attr_arg_num;
5344 /* If no arguments are specified, all pointer arguments should be
5345 non-null. Verify a full prototype is given so that the arguments
5346 will have the correct types when we actually check them later. */
5349 if (! TYPE_ARG_TYPES (type))
5351 error ("nonnull attribute without arguments on a non-prototype");
5352 *no_add_attrs = true;
5357 /* Argument list specified. Verify that each argument number references
5358 a pointer argument. */
5359 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5362 unsigned HOST_WIDE_INT arg_num, ck_num;
5364 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5366 error ("nonnull argument has invalid operand number (arg %lu)",
5367 (unsigned long) attr_arg_num);
5368 *no_add_attrs = true;
5372 argument = TYPE_ARG_TYPES (type);
5375 for (ck_num = 1; ; ck_num++)
5377 if (! argument || ck_num == arg_num)
5379 argument = TREE_CHAIN (argument);
5383 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5385 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5386 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5387 *no_add_attrs = true;
5391 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5393 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5394 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5395 *no_add_attrs = true;
5404 /* Check the argument list of a function call for null in argument slots
5405 that are marked as requiring a non-null pointer argument. */
5408 check_function_nonnull (tree attrs, tree params)
5410 tree a, args, param;
5413 for (a = attrs; a; a = TREE_CHAIN (a))
5415 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5417 args = TREE_VALUE (a);
5419 /* Walk the argument list. If we encounter an argument number we
5420 should check for non-null, do it. If the attribute has no args,
5421 then every pointer argument is checked (in which case the check
5422 for pointer type is done in check_nonnull_arg). */
5423 for (param = params, param_num = 1; ;
5424 param_num++, param = TREE_CHAIN (param))
5428 if (! args || nonnull_check_p (args, param_num))
5429 check_function_arguments_recurse (check_nonnull_arg, NULL,
5437 /* Helper for check_function_nonnull; given a list of operands which
5438 must be non-null in ARGS, determine if operand PARAM_NUM should be
5442 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5444 unsigned HOST_WIDE_INT arg_num;
5446 for (; args; args = TREE_CHAIN (args))
5448 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5451 if (arg_num == param_num)
5457 /* Check that the function argument PARAM (which is operand number
5458 PARAM_NUM) is non-null. This is called by check_function_nonnull
5459 via check_function_arguments_recurse. */
5462 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5463 unsigned HOST_WIDE_INT param_num)
5465 /* Just skip checking the argument if it's not a pointer. This can
5466 happen if the "nonnull" attribute was given without an operand
5467 list (which means to check every pointer argument). */
5469 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5472 if (integer_zerop (param))
5473 warning ("null argument where non-null required (arg %lu)",
5474 (unsigned long) param_num);
5477 /* Helper for nonnull attribute handling; fetch the operand number
5478 from the attribute argument list. */
5481 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5483 /* Strip any conversions from the arg number and verify they
5485 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5486 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5487 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5488 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5490 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5491 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5494 *valp = TREE_INT_CST_LOW (arg_num_expr);
5498 /* Handle a "nothrow" attribute; arguments as in
5499 struct attribute_spec.handler. */
5502 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5503 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5505 if (TREE_CODE (*node) == FUNCTION_DECL)
5506 TREE_NOTHROW (*node) = 1;
5507 /* ??? TODO: Support types. */
5510 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5511 *no_add_attrs = true;
5517 /* Handle a "cleanup" attribute; arguments as in
5518 struct attribute_spec.handler. */
5521 handle_cleanup_attribute (tree *node, tree name, tree args,
5522 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5525 tree cleanup_id, cleanup_decl;
5527 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5528 for global destructors in C++. This requires infrastructure that
5529 we don't have generically at the moment. It's also not a feature
5530 we'd be missing too much, since we do have attribute constructor. */
5531 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5533 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5534 *no_add_attrs = true;
5538 /* Verify that the argument is a function in scope. */
5539 /* ??? We could support pointers to functions here as well, if
5540 that was considered desirable. */
5541 cleanup_id = TREE_VALUE (args);
5542 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5544 error ("cleanup arg not an identifier");
5545 *no_add_attrs = true;
5548 cleanup_decl = lookup_name (cleanup_id);
5549 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5551 error ("cleanup arg not a function");
5552 *no_add_attrs = true;
5556 /* That the function has proper type is checked with the
5557 eventual call to build_function_call. */
5562 /* Handle a "warn_unused_result" attribute. No special handling. */
5565 handle_warn_unused_result_attribute (tree *node, tree name,
5566 tree args ATTRIBUTE_UNUSED,
5567 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5569 /* Ignore the attribute for functions not returning any value. */
5570 if (VOID_TYPE_P (TREE_TYPE (*node)))
5572 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5573 *no_add_attrs = true;
5579 /* Check for valid arguments being passed to a function. */
5581 check_function_arguments (tree attrs, tree params)
5583 /* Check for null being passed in a pointer argument that must be
5584 non-null. We also need to do this if format checking is enabled. */
5587 check_function_nonnull (attrs, params);
5589 /* Check for errors in format strings. */
5592 check_function_format (NULL, attrs, params);
5595 /* Generic argument checking recursion routine. PARAM is the argument to
5596 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5597 once the argument is resolved. CTX is context for the callback. */
5599 check_function_arguments_recurse (void (*callback)
5600 (void *, tree, unsigned HOST_WIDE_INT),
5601 void *ctx, tree param,
5602 unsigned HOST_WIDE_INT param_num)
5604 if (TREE_CODE (param) == NOP_EXPR)
5606 /* Strip coercion. */
5607 check_function_arguments_recurse (callback, ctx,
5608 TREE_OPERAND (param, 0), param_num);
5612 if (TREE_CODE (param) == CALL_EXPR)
5614 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5616 bool found_format_arg = false;
5618 /* See if this is a call to a known internationalization function
5619 that modifies a format arg. Such a function may have multiple
5620 format_arg attributes (for example, ngettext). */
5622 for (attrs = TYPE_ATTRIBUTES (type);
5624 attrs = TREE_CHAIN (attrs))
5625 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5628 tree format_num_expr;
5632 /* Extract the argument number, which was previously checked
5634 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5635 while (TREE_CODE (format_num_expr) == NOP_EXPR
5636 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5637 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5638 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5640 if (TREE_CODE (format_num_expr) != INTEGER_CST
5641 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5644 format_num = TREE_INT_CST_LOW (format_num_expr);
5646 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5648 inner_args = TREE_CHAIN (inner_args), i++)
5649 if (i == format_num)
5651 check_function_arguments_recurse (callback, ctx,
5652 TREE_VALUE (inner_args),
5654 found_format_arg = true;
5659 /* If we found a format_arg attribute and did a recursive check,
5660 we are done with checking this argument. Otherwise, we continue
5661 and this will be considered a non-literal. */
5662 if (found_format_arg)
5666 if (TREE_CODE (param) == COND_EXPR)
5668 /* Check both halves of the conditional expression. */
5669 check_function_arguments_recurse (callback, ctx,
5670 TREE_OPERAND (param, 1), param_num);
5671 check_function_arguments_recurse (callback, ctx,
5672 TREE_OPERAND (param, 2), param_num);
5676 (*callback) (ctx, param, param_num);
5679 /* Function to help qsort sort FIELD_DECLs by name order. */
5682 field_decl_cmp (const void *x_p, const void *y_p)
5684 const tree *const x = x_p;
5685 const tree *const y = y_p;
5686 if (DECL_NAME (*x) == DECL_NAME (*y))
5687 /* A nontype is "greater" than a type. */
5688 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5689 if (DECL_NAME (*x) == NULL_TREE)
5691 if (DECL_NAME (*y) == NULL_TREE)
5693 if (DECL_NAME (*x) < DECL_NAME (*y))
5699 gt_pointer_operator new_value;
5703 /* This routine compares two fields like field_decl_cmp but using the
5704 pointer operator in resort_data. */
5707 resort_field_decl_cmp (const void *x_p, const void *y_p)
5709 const tree *const x = x_p;
5710 const tree *const y = y_p;
5712 if (DECL_NAME (*x) == DECL_NAME (*y))
5713 /* A nontype is "greater" than a type. */
5714 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5715 if (DECL_NAME (*x) == NULL_TREE)
5717 if (DECL_NAME (*y) == NULL_TREE)
5720 tree d1 = DECL_NAME (*x);
5721 tree d2 = DECL_NAME (*y);
5722 resort_data.new_value (&d1, resort_data.cookie);
5723 resort_data.new_value (&d2, resort_data.cookie);
5730 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5733 resort_sorted_fields (void *obj,
5734 void *orig_obj ATTRIBUTE_UNUSED ,
5735 gt_pointer_operator new_value,
5738 struct sorted_fields_type *sf = obj;
5739 resort_data.new_value = new_value;
5740 resort_data.cookie = cookie;
5741 qsort (&sf->elts[0], sf->len, sizeof (tree),
5742 resort_field_decl_cmp);
5745 /* Used by estimate_num_insns. Estimate number of instructions seen
5746 by given statement. */
5748 c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
5753 if (TYPE_P (x) || DECL_P (x))
5758 /* Assume that constants and references counts nothing. These should
5759 be majorized by amount of operations among them we count later
5760 and are common target of CSE and similar optimizations. */
5761 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
5762 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
5764 switch (TREE_CODE (x))
5766 /* Recognize assignments of large structures and constructors of
5771 int size = int_size_in_bytes (TREE_TYPE (x));
5773 if (!size || size > MOVE_MAX_PIECES)
5776 *count += 2 * (size + MOVE_MAX - 1) / MOVE_MAX;
5780 /* Few special cases of expensive operations. This is usefull
5781 to avoid inlining on functions having too many of these. */
5782 case TRUNC_DIV_EXPR:
5784 case FLOOR_DIV_EXPR:
5785 case ROUND_DIV_EXPR:
5786 case TRUNC_MOD_EXPR:
5788 case FLOOR_MOD_EXPR:
5789 case ROUND_MOD_EXPR:
5794 /* Various containers that will produce no code themselves. */
5801 case IDENTIFIER_NODE:
5802 case PLACEHOLDER_EXPR:
5803 case WITH_CLEANUP_EXPR:
5804 case CLEANUP_POINT_EXPR:
5806 case VIEW_CONVERT_EXPR:
5812 case TRY_CATCH_EXPR:
5813 case TRY_FINALLY_EXPR:
5816 case LABELED_BLOCK_EXPR:
5817 case EXIT_BLOCK_EXPR:
5818 case EXPR_WITH_FILE_LOCATION:
5835 /* Do not account static initializers. */
5836 if (TREE_STATIC (TREE_OPERAND (x, 0)))
5845 /* Estimate number of instructions that will be created by expanding the body. */
5847 c_estimate_num_insns (tree decl)
5850 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl), c_estimate_num_insns_1, &num);
5854 /* Used by c_decl_uninit to find where expressions like x = x + 1; */
5857 c_decl_uninit_1 (tree *t, int *walk_sub_trees, void *x)
5859 /* If x = EXP(&x)EXP, then do not warn about the use of x. */
5860 if (TREE_CODE (*t) == ADDR_EXPR && TREE_OPERAND (*t, 0) == x)
5862 *walk_sub_trees = 0;
5870 /* Find out if a variable is uninitialized based on DECL_INITIAL. */
5873 c_decl_uninit (tree t)
5875 /* int x = x; is GCC extension to turn off this warning, only if warn_init_self is zero. */
5876 if (DECL_INITIAL (t) == t)
5877 return warn_init_self ? true : false;
5879 /* Walk the trees looking for the variable itself. */
5880 if (walk_tree_without_duplicates (&DECL_INITIAL (t), c_decl_uninit_1, t))
5885 /* Issue the error given by MSGID, indicating that it occurred before
5886 TOKEN, which had the associated VALUE. */
5889 c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5891 const char *string = _(msgid);
5893 if (token == CPP_EOF)
5894 error ("%s at end of input", string);
5895 else if (token == CPP_CHAR || token == CPP_WCHAR)
5897 unsigned int val = TREE_INT_CST_LOW (value);
5898 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5899 if (val <= UCHAR_MAX && ISGRAPH (val))
5900 error ("%s before %s'%c'", string, ell, val);
5902 error ("%s before %s'\\x%x'", string, ell, val);
5904 else if (token == CPP_STRING
5905 || token == CPP_WSTRING)
5906 error ("%s before string constant", string);
5907 else if (token == CPP_NUMBER)
5908 error ("%s before numeric constant", string);
5909 else if (token == CPP_NAME)
5910 error ("%s before \"%s\"", string, IDENTIFIER_POINTER (value));
5911 else if (token < N_TTYPES)
5912 error ("%s before '%s' token", string, cpp_type2name (token));
5914 error ("%s", string);
5917 #include "gt-c-common.h"