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 do emit exported implementations of templates, instead of
514 multiple static copies in each file that needs a definition. */
516 int flag_external_templates
;
518 /* Nonzero means that the decision to emit or not emit the implementation of a
519 template depends on where the template is instantiated, rather than where
522 int flag_alt_external_templates
;
524 /* Nonzero means that implicit instantiations will be emitted if needed. */
526 int flag_implicit_templates
= 1;
528 /* Nonzero means that implicit instantiations of inline templates will be
529 emitted if needed, even if instantiations of non-inline templates
532 int flag_implicit_inline_templates
= 1;
534 /* Nonzero means generate separate instantiation control files and
535 juggle them at link time. */
537 int flag_use_repository
;
539 /* Nonzero if we want to issue diagnostics that the standard says are not
542 int flag_optional_diags
= 1;
544 /* Nonzero means we should attempt to elide constructors when possible. */
546 int flag_elide_constructors
= 1;
548 /* Nonzero means that member functions defined in class scope are
549 inline by default. */
551 int flag_default_inline
= 1;
553 /* Controls whether compiler generates 'type descriptor' that give
554 run-time type information. */
558 /* Nonzero if we want to conserve space in the .o files. We do this
559 by putting uninitialized data and runtime initialized data into
560 .common instead of .data at the expense of not flagging multiple
563 int flag_conserve_space
;
565 /* Nonzero if we want to obey access control semantics. */
567 int flag_access_control
= 1;
569 /* Nonzero if we want to check the return value of new and avoid calling
570 constructors if it is a null pointer. */
574 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
575 initialization variables.
576 0: Old rules, set by -fno-for-scope.
577 2: New ISO rules, set by -ffor-scope.
578 1: Try to implement new ISO rules, but with backup compatibility
579 (and warnings). This is the default, for now. */
581 int flag_new_for_scope
= 1;
583 /* Nonzero if we want to emit defined symbols with common-like linkage as
584 weak symbols where possible, in order to conform to C++ semantics.
585 Otherwise, emit them as local symbols. */
589 /* 0 means we want the preprocessor to not emit line directives for
590 the current working directory. 1 means we want it to do it. -1
591 means we should decide depending on whether debugging information
592 is being emitted or not. */
594 int flag_working_directory
= -1;
596 /* Nonzero to use __cxa_atexit, rather than atexit, to register
597 destructors for local statics and global objects. */
599 int flag_use_cxa_atexit
= DEFAULT_USE_CXA_ATEXIT
;
601 /* Nonzero means make the default pedwarns warnings instead of errors.
602 The value of this flag is ignored if -pedantic is specified. */
606 /* Nonzero means to implement standard semantics for exception
607 specifications, calling unexpected if an exception is thrown that
608 doesn't match the specification. Zero means to treat them as
609 assertions and optimize accordingly, but not check them. */
611 int flag_enforce_eh_specs
= 1;
613 /* The version of the C++ ABI in use. The following values are
616 0: The version of the ABI believed most conformant with the
617 C++ ABI specification. This ABI may change as bugs are
618 discovered and fixed. Therefore, 0 will not necessarily
619 indicate the same ABI in different versions of G++.
621 1: The version of the ABI first used in G++ 3.2.
623 Additional positive integers will be assigned as new versions of
624 the ABI become the default version of the ABI. */
626 int flag_abi_version
= 1;
628 /* Nonzero means warn about things that will change when compiling
629 with an ABI-compliant compiler. */
633 /* Nonzero means warn about invalid uses of offsetof. */
635 int warn_invalid_offsetof
= 1;
637 /* Nonzero means warn about implicit declarations. */
639 int warn_implicit
= 1;
641 /* Nonzero means warn when all ctors or dtors are private, and the class
644 int warn_ctor_dtor_privacy
= 0;
646 /* Nonzero means warn in function declared in derived class has the
647 same name as a virtual in the base class, but fails to match the
648 type signature of any virtual function in the base class. */
650 int warn_overloaded_virtual
;
652 /* Nonzero means warn when declaring a class that has a non virtual
653 destructor, when it really ought to have a virtual one. */
657 /* Nonzero means warn when the compiler will reorder code. */
661 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
665 /* Nonzero means warn when we convert a pointer to member function
666 into a pointer to (void or function). */
668 int warn_pmf2ptr
= 1;
670 /* Nonzero means warn about violation of some Effective C++ style rules. */
674 /* Nonzero means warn where overload resolution chooses a promotion from
675 unsigned to signed over a conversion to an unsigned of the same size. */
679 /* Nonzero means warn when an old-style cast is used. */
681 int warn_old_style_cast
;
683 /* Nonzero means warn when non-templatized friend functions are
684 declared within a template */
686 int warn_nontemplate_friend
= 1;
688 /* Nonzero means complain about deprecated features. */
690 int warn_deprecated
= 1;
692 /* Maximum template instantiation depth. This limit is rather
693 arbitrary, but it exists to limit the time it takes to notice
694 infinite template instantiations. */
696 int max_tinst_depth
= 500;
700 /* The elements of `ridpointers' are identifier nodes for the reserved
701 type names and storage classes. It is indexed by a RID_... value. */
704 tree (*make_fname_decl
) (tree
, int);
706 /* If non-NULL, the address of a language-specific function that takes
707 any action required right before expand_function_end is called. */
708 void (*lang_expand_function_end
) (void);
710 /* Nonzero means the expression being parsed will never be evaluated.
711 This is a count, since unevaluated expressions can nest. */
714 /* Information about how a function name is generated. */
717 tree
*const decl
; /* pointer to the VAR_DECL. */
718 const unsigned rid
; /* RID number for the identifier. */
719 const int pretty
; /* How pretty is it? */
722 /* The three ways of getting then name of the current function. */
724 const struct fname_var_t fname_vars
[] =
726 /* C99 compliant __func__, must be first. */
727 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
728 /* GCC __FUNCTION__ compliant. */
729 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
730 /* GCC __PRETTY_FUNCTION__ compliant. */
731 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
735 static int constant_fits_type_p (tree
, tree
);
737 /* Keep a stack of if statements. We record the number of compound
738 statements seen up to the if keyword, as well as the line number
739 and file of the if. If a potentially ambiguous else is seen, that
740 fact is recorded; the warning is issued when we can be sure that
741 the enclosing if statement does not have an else branch. */
750 static if_elt
*if_stack
;
752 /* Amount of space in the if statement stack. */
753 static int if_stack_space
= 0;
756 static int if_stack_pointer
= 0;
758 static tree
handle_packed_attribute (tree
*, tree
, tree
, int, bool *);
759 static tree
handle_nocommon_attribute (tree
*, tree
, tree
, int, bool *);
760 static tree
handle_common_attribute (tree
*, tree
, tree
, int, bool *);
761 static tree
handle_noreturn_attribute (tree
*, tree
, tree
, int, bool *);
762 static tree
handle_noinline_attribute (tree
*, tree
, tree
, int, bool *);
763 static tree
handle_always_inline_attribute (tree
*, tree
, tree
, int,
765 static tree
handle_used_attribute (tree
*, tree
, tree
, int, bool *);
766 static tree
handle_unused_attribute (tree
*, tree
, tree
, int, bool *);
767 static tree
handle_const_attribute (tree
*, tree
, tree
, int, bool *);
768 static tree
handle_transparent_union_attribute (tree
*, tree
, tree
,
770 static tree
handle_constructor_attribute (tree
*, tree
, tree
, int, bool *);
771 static tree
handle_destructor_attribute (tree
*, tree
, tree
, int, bool *);
772 static tree
handle_mode_attribute (tree
*, tree
, tree
, int, bool *);
773 static tree
handle_section_attribute (tree
*, tree
, tree
, int, bool *);
774 static tree
handle_aligned_attribute (tree
*, tree
, tree
, int, bool *);
775 static tree
handle_weak_attribute (tree
*, tree
, tree
, int, bool *) ;
776 static tree
handle_alias_attribute (tree
*, tree
, tree
, int, bool *);
777 static tree
handle_visibility_attribute (tree
*, tree
, tree
, int,
779 static tree
handle_tls_model_attribute (tree
*, tree
, tree
, int,
781 static tree
handle_no_instrument_function_attribute (tree
*, tree
,
783 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
784 static tree
handle_no_limit_stack_attribute (tree
*, tree
, tree
, int,
786 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
787 static tree
handle_deprecated_attribute (tree
*, tree
, tree
, int,
789 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int,
791 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
792 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
793 static tree
handle_cleanup_attribute (tree
*, tree
, tree
, int, bool *);
794 static tree
handle_warn_unused_result_attribute (tree
*, tree
, tree
, int,
796 static tree
vector_size_helper (tree
, tree
);
798 static void check_function_nonnull (tree
, tree
);
799 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
800 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
801 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
802 static int resort_field_decl_cmp (const void *, const void *);
804 /* Table of machine-independent attributes common to all C-like languages. */
805 const struct attribute_spec c_common_attribute_table
[] =
807 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
808 { "packed", 0, 0, false, false, false,
809 handle_packed_attribute
},
810 { "nocommon", 0, 0, true, false, false,
811 handle_nocommon_attribute
},
812 { "common", 0, 0, true, false, false,
813 handle_common_attribute
},
814 /* FIXME: logically, noreturn attributes should be listed as
815 "false, true, true" and apply to function types. But implementing this
816 would require all the places in the compiler that use TREE_THIS_VOLATILE
817 on a decl to identify non-returning functions to be located and fixed
818 to check the function type instead. */
819 { "noreturn", 0, 0, true, false, false,
820 handle_noreturn_attribute
},
821 { "volatile", 0, 0, true, false, false,
822 handle_noreturn_attribute
},
823 { "noinline", 0, 0, true, false, false,
824 handle_noinline_attribute
},
825 { "always_inline", 0, 0, true, false, false,
826 handle_always_inline_attribute
},
827 { "used", 0, 0, true, false, false,
828 handle_used_attribute
},
829 { "unused", 0, 0, false, false, false,
830 handle_unused_attribute
},
831 /* The same comments as for noreturn attributes apply to const ones. */
832 { "const", 0, 0, true, false, false,
833 handle_const_attribute
},
834 { "transparent_union", 0, 0, false, false, false,
835 handle_transparent_union_attribute
},
836 { "constructor", 0, 0, true, false, false,
837 handle_constructor_attribute
},
838 { "destructor", 0, 0, true, false, false,
839 handle_destructor_attribute
},
840 { "mode", 1, 1, false, true, false,
841 handle_mode_attribute
},
842 { "section", 1, 1, true, false, false,
843 handle_section_attribute
},
844 { "aligned", 0, 1, false, false, false,
845 handle_aligned_attribute
},
846 { "weak", 0, 0, true, false, false,
847 handle_weak_attribute
},
848 { "alias", 1, 1, true, false, false,
849 handle_alias_attribute
},
850 { "no_instrument_function", 0, 0, true, false, false,
851 handle_no_instrument_function_attribute
},
852 { "malloc", 0, 0, true, false, false,
853 handle_malloc_attribute
},
854 { "no_stack_limit", 0, 0, true, false, false,
855 handle_no_limit_stack_attribute
},
856 { "pure", 0, 0, true, false, false,
857 handle_pure_attribute
},
858 { "deprecated", 0, 0, false, false, false,
859 handle_deprecated_attribute
},
860 { "vector_size", 1, 1, false, true, false,
861 handle_vector_size_attribute
},
862 { "visibility", 1, 1, true, false, false,
863 handle_visibility_attribute
},
864 { "tls_model", 1, 1, true, false, false,
865 handle_tls_model_attribute
},
866 { "nonnull", 0, -1, false, true, true,
867 handle_nonnull_attribute
},
868 { "nothrow", 0, 0, true, false, false,
869 handle_nothrow_attribute
},
870 { "may_alias", 0, 0, false, true, false, NULL
},
871 { "cleanup", 1, 1, true, false, false,
872 handle_cleanup_attribute
},
873 { "warn_unused_result", 0, 0, false, true, true,
874 handle_warn_unused_result_attribute
},
875 { NULL
, 0, 0, false, false, false, NULL
}
878 /* Give the specifications for the format attributes, used by C and all
881 const struct attribute_spec c_common_format_attribute_table
[] =
883 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
884 { "format", 3, 3, false, true, true,
885 handle_format_attribute
},
886 { "format_arg", 1, 1, false, true, true,
887 handle_format_arg_attribute
},
888 { NULL
, 0, 0, false, false, false, NULL
}
891 /* Record the start of an if-then, and record the start of it
892 for ambiguous else detection.
894 COND is the condition for the if-then statement.
896 IF_STMT is the statement node that has already been created for
897 this if-then statement. It is created before parsing the
898 condition to keep line number information accurate. */
901 c_expand_start_cond (tree cond
, int compstmt_count
, tree if_stmt
)
903 /* Make sure there is enough space on the stack. */
904 if (if_stack_space
== 0)
907 if_stack
= xmalloc (10 * sizeof (if_elt
));
909 else if (if_stack_space
== if_stack_pointer
)
911 if_stack_space
+= 10;
912 if_stack
= xrealloc (if_stack
, if_stack_space
* sizeof (if_elt
));
915 IF_COND (if_stmt
) = cond
;
918 /* Record this if statement. */
919 if_stack
[if_stack_pointer
].compstmt_count
= compstmt_count
;
920 if_stack
[if_stack_pointer
].locus
= input_location
;
921 if_stack
[if_stack_pointer
].needs_warning
= 0;
922 if_stack
[if_stack_pointer
].if_stmt
= if_stmt
;
926 /* Called after the then-clause for an if-statement is processed. */
931 tree if_stmt
= if_stack
[if_stack_pointer
- 1].if_stmt
;
932 RECHAIN_STMTS (if_stmt
, THEN_CLAUSE (if_stmt
));
935 /* Record the end of an if-then. Optionally warn if a nested
936 if statement had an ambiguous else clause. */
939 c_expand_end_cond (void)
942 if (if_stack
[if_stack_pointer
].needs_warning
)
943 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
944 &if_stack
[if_stack_pointer
].locus
);
945 last_expr_type
= NULL_TREE
;
948 /* Called between the then-clause and the else-clause
949 of an if-then-else. */
952 c_expand_start_else (void)
954 /* An ambiguous else warning must be generated for the enclosing if
955 statement, unless we see an else branch for that one, too. */
957 && if_stack_pointer
> 1
958 && (if_stack
[if_stack_pointer
- 1].compstmt_count
959 == if_stack
[if_stack_pointer
- 2].compstmt_count
))
960 if_stack
[if_stack_pointer
- 2].needs_warning
= 1;
962 /* Even if a nested if statement had an else branch, it can't be
963 ambiguous if this one also has an else. So don't warn in that
964 case. Also don't warn for any if statements nested in this else. */
965 if_stack
[if_stack_pointer
- 1].needs_warning
= 0;
966 if_stack
[if_stack_pointer
- 1].compstmt_count
--;
969 /* Called after the else-clause for an if-statement is processed. */
974 tree if_stmt
= if_stack
[if_stack_pointer
- 1].if_stmt
;
975 RECHAIN_STMTS (if_stmt
, ELSE_CLAUSE (if_stmt
));
978 /* Begin an if-statement. Returns a newly created IF_STMT if
981 Unlike the C++ front-end, we do not call add_stmt here; it is
982 probably safe to do so, but I am not very familiar with this
983 code so I am being extra careful not to change its behavior
984 beyond what is strictly necessary for correctness. */
987 c_begin_if_stmt (void)
990 r
= build_stmt (IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
994 /* Begin a while statement. Returns a newly created WHILE_STMT if
997 Unlike the C++ front-end, we do not call add_stmt here; it is
998 probably safe to do so, but I am not very familiar with this
999 code so I am being extra careful not to change its behavior
1000 beyond what is strictly necessary for correctness. */
1003 c_begin_while_stmt (void)
1006 r
= build_stmt (WHILE_STMT
, NULL_TREE
, NULL_TREE
);
1011 c_finish_while_stmt_cond (tree cond
, tree while_stmt
)
1013 WHILE_COND (while_stmt
) = cond
;
1016 /* Push current bindings for the function name VAR_DECLS. */
1019 start_fname_decls (void)
1022 tree saved
= NULL_TREE
;
1024 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1026 tree decl
= *fname_vars
[ix
].decl
;
1030 saved
= tree_cons (decl
, build_int_2 (ix
, 0), saved
);
1031 *fname_vars
[ix
].decl
= NULL_TREE
;
1034 if (saved
|| saved_function_name_decls
)
1035 /* Normally they'll have been NULL, so only push if we've got a
1036 stack, or they are non-NULL. */
1037 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
1038 saved_function_name_decls
);
1041 /* Finish up the current bindings, adding them into the
1042 current function's statement tree. This is done by wrapping the
1043 function's body in a COMPOUND_STMT containing these decls too. This
1044 must be done _before_ finish_stmt_tree is called. If there is no
1045 current function, we must be at file scope and no statements are
1046 involved. Pop the previous bindings. */
1049 finish_fname_decls (void)
1052 tree body
= NULL_TREE
;
1053 tree stack
= saved_function_name_decls
;
1055 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
1056 body
= chainon (TREE_VALUE (stack
), body
);
1060 /* They were called into existence, so add to statement tree. Add
1061 the DECL_STMTs inside the outermost scope. */
1062 tree
*p
= &DECL_SAVED_TREE (current_function_decl
);
1063 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1064 while (TREE_CODE (*p
) != COMPOUND_STMT
)
1065 p
= &TREE_CHAIN (*p
);
1066 p
= &COMPOUND_BODY (*p
);
1067 if (TREE_CODE (*p
) == SCOPE_STMT
)
1068 p
= &TREE_CHAIN (*p
);
1070 body
= chainon (body
, *p
);
1074 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1075 *fname_vars
[ix
].decl
= NULL_TREE
;
1079 /* We had saved values, restore them. */
1082 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
1084 tree decl
= TREE_PURPOSE (saved
);
1085 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
1087 *fname_vars
[ix
].decl
= decl
;
1089 stack
= TREE_CHAIN (stack
);
1091 saved_function_name_decls
= stack
;
1094 /* Return the text name of the current function, suitably prettified
1098 fname_as_string (int pretty_p
)
1100 const char *name
= "top level";
1109 if (current_function_decl
)
1110 name
= (*lang_hooks
.decl_printable_name
) (current_function_decl
, vrb
);
1115 /* Return the VAR_DECL for a const char array naming the current
1116 function. If the VAR_DECL has not yet been created, create it
1117 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1118 ID is its name (unfortunately C and C++ hold the RID values of
1119 keywords in different places, so we can't derive RID from ID in
1120 this language independent code. */
1123 fname_decl (unsigned int rid
, tree id
)
1126 tree decl
= NULL_TREE
;
1128 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1129 if (fname_vars
[ix
].rid
== rid
)
1132 decl
= *fname_vars
[ix
].decl
;
1135 tree saved_last_tree
= last_tree
;
1136 /* If a tree is built here, it would normally have the lineno of
1137 the current statement. Later this tree will be moved to the
1138 beginning of the function and this line number will be wrong.
1139 To avoid this problem set the lineno to 0 here; that prevents
1140 it from appearing in the RTL. */
1141 int saved_lineno
= input_line
;
1144 decl
= (*make_fname_decl
) (id
, fname_vars
[ix
].pretty
);
1145 if (last_tree
!= saved_last_tree
)
1147 /* We created some statement tree for the decl. This belongs
1148 at the start of the function, so remove it now and reinsert
1149 it after the function is complete. */
1150 tree stmts
= TREE_CHAIN (saved_last_tree
);
1152 TREE_CHAIN (saved_last_tree
) = NULL_TREE
;
1153 last_tree
= saved_last_tree
;
1154 saved_function_name_decls
= tree_cons (decl
, stmts
,
1155 saved_function_name_decls
);
1157 *fname_vars
[ix
].decl
= decl
;
1158 input_line
= saved_lineno
;
1160 if (!ix
&& !current_function_decl
)
1161 pedwarn ("%J'%D' is not defined outside of function scope", decl
, decl
);
1166 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1169 fix_string_type (tree value
)
1171 const int wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
1172 const int wide_flag
= TREE_TYPE (value
) == wchar_array_type_node
;
1173 const int nchars_max
= flag_isoc99
? 4095 : 509;
1174 int length
= TREE_STRING_LENGTH (value
);
1177 /* Compute the number of elements, for the array type. */
1178 nchars
= wide_flag
? length
/ wchar_bytes
: length
;
1180 if (pedantic
&& nchars
- 1 > nchars_max
&& !c_dialect_cxx ())
1181 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1182 nchars
- 1, nchars_max
, flag_isoc99
? 99 : 89);
1184 /* Create the array type for the string constant.
1185 -Wwrite-strings says make the string constant an array of const char
1186 so that copying it to a non-const pointer will get a warning.
1187 For C++, this is the standard behavior. */
1188 if (flag_const_strings
&& ! flag_writable_strings
)
1191 = build_type_variant (wide_flag
? wchar_type_node
: char_type_node
,
1194 = build_array_type (elements
,
1195 build_index_type (build_int_2 (nchars
- 1, 0)));
1199 = build_array_type (wide_flag
? wchar_type_node
: char_type_node
,
1200 build_index_type (build_int_2 (nchars
- 1, 0)));
1202 TREE_CONSTANT (value
) = 1;
1203 TREE_READONLY (value
) = ! flag_writable_strings
;
1204 TREE_STATIC (value
) = 1;
1208 /* Print a warning if a constant expression had overflow in folding.
1209 Invoke this function on every expression that the language
1210 requires to be a constant expression.
1211 Note the ANSI C standard says it is erroneous for a
1212 constant expression to overflow. */
1215 constant_expression_warning (tree value
)
1217 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1218 || TREE_CODE (value
) == VECTOR_CST
1219 || TREE_CODE (value
) == COMPLEX_CST
)
1220 && TREE_CONSTANT_OVERFLOW (value
) && pedantic
)
1221 pedwarn ("overflow in constant expression");
1224 /* Print a warning if an expression had overflow in folding.
1225 Invoke this function on every expression that
1226 (1) appears in the source code, and
1227 (2) might be a constant expression that overflowed, and
1228 (3) is not already checked by convert_and_check;
1229 however, do not invoke this function on operands of explicit casts. */
1232 overflow_warning (tree value
)
1234 if ((TREE_CODE (value
) == INTEGER_CST
1235 || (TREE_CODE (value
) == COMPLEX_CST
1236 && TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
))
1237 && TREE_OVERFLOW (value
))
1239 TREE_OVERFLOW (value
) = 0;
1240 if (skip_evaluation
== 0)
1241 warning ("integer overflow in expression");
1243 else if ((TREE_CODE (value
) == REAL_CST
1244 || (TREE_CODE (value
) == COMPLEX_CST
1245 && TREE_CODE (TREE_REALPART (value
)) == REAL_CST
))
1246 && TREE_OVERFLOW (value
))
1248 TREE_OVERFLOW (value
) = 0;
1249 if (skip_evaluation
== 0)
1250 warning ("floating point overflow in expression");
1252 else if (TREE_CODE (value
) == VECTOR_CST
&& TREE_OVERFLOW (value
))
1254 TREE_OVERFLOW (value
) = 0;
1255 if (skip_evaluation
== 0)
1256 warning ("vector overflow in expression");
1260 /* Print a warning if a large constant is truncated to unsigned,
1261 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1262 Invoke this function on every expression that might be implicitly
1263 converted to an unsigned type. */
1266 unsigned_conversion_warning (tree result
, tree operand
)
1268 tree type
= TREE_TYPE (result
);
1270 if (TREE_CODE (operand
) == INTEGER_CST
1271 && TREE_CODE (type
) == INTEGER_TYPE
1272 && TREE_UNSIGNED (type
)
1273 && skip_evaluation
== 0
1274 && !int_fits_type_p (operand
, type
))
1276 if (!int_fits_type_p (operand
, c_common_signed_type (type
)))
1277 /* This detects cases like converting -129 or 256 to unsigned char. */
1278 warning ("large integer implicitly truncated to unsigned type");
1279 else if (warn_conversion
)
1280 warning ("negative integer implicitly converted to unsigned type");
1284 /* Nonzero if constant C has a value that is permissible
1285 for type TYPE (an INTEGER_TYPE). */
1288 constant_fits_type_p (tree c
, tree type
)
1290 if (TREE_CODE (c
) == INTEGER_CST
)
1291 return int_fits_type_p (c
, type
);
1293 c
= convert (type
, c
);
1294 return !TREE_OVERFLOW (c
);
1297 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1298 Invoke this function on every expression that is converted implicitly,
1299 i.e. because of language rules and not because of an explicit cast. */
1302 convert_and_check (tree type
, tree expr
)
1304 tree t
= convert (type
, expr
);
1305 if (TREE_CODE (t
) == INTEGER_CST
)
1307 if (TREE_OVERFLOW (t
))
1309 TREE_OVERFLOW (t
) = 0;
1311 /* Do not diagnose overflow in a constant expression merely
1312 because a conversion overflowed. */
1313 TREE_CONSTANT_OVERFLOW (t
) = TREE_CONSTANT_OVERFLOW (expr
);
1315 /* No warning for converting 0x80000000 to int. */
1316 if (!(TREE_UNSIGNED (type
) < TREE_UNSIGNED (TREE_TYPE (expr
))
1317 && TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1318 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (expr
))))
1319 /* If EXPR fits in the unsigned version of TYPE,
1320 don't warn unless pedantic. */
1322 || TREE_UNSIGNED (type
)
1323 || ! constant_fits_type_p (expr
,
1324 c_common_unsigned_type (type
)))
1325 && skip_evaluation
== 0)
1326 warning ("overflow in implicit constant conversion");
1329 unsigned_conversion_warning (t
, expr
);
1334 /* A node in a list that describes references to variables (EXPR), which are
1335 either read accesses if WRITER is zero, or write accesses, in which case
1336 WRITER is the parent of EXPR. */
1343 /* Used to implement a cache the results of a call to verify_tree. We only
1344 use this for SAVE_EXPRs. */
1347 struct tlist_cache
*next
;
1348 struct tlist
*cache_before_sp
;
1349 struct tlist
*cache_after_sp
;
1353 /* Obstack to use when allocating tlist structures, and corresponding
1355 static struct obstack tlist_obstack
;
1356 static char *tlist_firstobj
= 0;
1358 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1360 static struct tlist
*warned_ids
;
1361 /* SAVE_EXPRs need special treatment. We process them only once and then
1362 cache the results. */
1363 static struct tlist_cache
*save_expr_cache
;
1365 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
1366 static void merge_tlist (struct tlist
**, struct tlist
*, int);
1367 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
1368 static int warning_candidate_p (tree
);
1369 static void warn_for_collisions (struct tlist
*);
1370 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
1371 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
1372 static void verify_sequence_points (tree
);
1374 /* Create a new struct tlist and fill in its fields. */
1375 static struct tlist
*
1376 new_tlist (struct tlist
*next
, tree t
, tree writer
)
1379 l
= obstack_alloc (&tlist_obstack
, sizeof *l
);
1386 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1387 is nonnull, we ignore any node we find which has a writer equal to it. */
1390 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
1394 struct tlist
*next
= add
->next
;
1397 if (! exclude_writer
|| add
->writer
!= exclude_writer
)
1398 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1403 /* Merge the nodes of ADD into TO. This merging process is done so that for
1404 each variable that already exists in TO, no new node is added; however if
1405 there is a write access recorded in ADD, and an occurrence on TO is only
1406 a read access, then the occurrence in TO will be modified to record the
1410 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
1412 struct tlist
**end
= to
;
1415 end
= &(*end
)->next
;
1421 struct tlist
*next
= add
->next
;
1423 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1424 if (tmp2
->expr
== add
->expr
)
1428 tmp2
->writer
= add
->writer
;
1432 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
1433 end
= &(*end
)->next
;
1440 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1441 references in list LIST conflict with it, excluding reads if ONLY writers
1445 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
1450 /* Avoid duplicate warnings. */
1451 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1452 if (tmp
->expr
== written
)
1457 if (list
->expr
== written
1458 && list
->writer
!= writer
1459 && (! only_writes
|| list
->writer
))
1461 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1462 warning ("operation on `%s' may be undefined",
1463 IDENTIFIER_POINTER (DECL_NAME (list
->expr
)));
1469 /* Given a list LIST of references to variables, find whether any of these
1470 can cause conflicts due to missing sequence points. */
1473 warn_for_collisions (struct tlist
*list
)
1477 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1480 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1484 /* Return nonzero if X is a tree that can be verified by the sequence point
1487 warning_candidate_p (tree x
)
1489 return TREE_CODE (x
) == VAR_DECL
|| TREE_CODE (x
) == PARM_DECL
;
1492 /* Walk the tree X, and record accesses to variables. If X is written by the
1493 parent tree, WRITER is the parent.
1494 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1495 expression or its only operand forces a sequence point, then everything up
1496 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1498 Once we return, we will have emitted warnings if any subexpression before
1499 such a sequence point could be undefined. On a higher level, however, the
1500 sequence point may not be relevant, and we'll merge the two lists.
1502 Example: (b++, a) + b;
1503 The call that processes the COMPOUND_EXPR will store the increment of B
1504 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1505 processes the PLUS_EXPR will need to merge the two lists so that
1506 eventually, all accesses end up on the same list (and we'll warn about the
1507 unordered subexpressions b++ and b.
1509 A note on merging. If we modify the former example so that our expression
1512 care must be taken not simply to add all three expressions into the final
1513 PNO_SP list. The function merge_tlist takes care of that by merging the
1514 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1515 way, so that no more than one access to B is recorded. */
1518 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
1521 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1522 enum tree_code code
;
1525 /* X may be NULL if it is the operand of an empty statement expression
1531 code
= TREE_CODE (x
);
1532 class = TREE_CODE_CLASS (code
);
1534 if (warning_candidate_p (x
))
1536 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
1546 case TRUTH_ANDIF_EXPR
:
1547 case TRUTH_ORIF_EXPR
:
1548 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1549 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1550 warn_for_collisions (tmp_nosp
);
1551 merge_tlist (pbefore_sp
, tmp_before
, 0);
1552 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
1553 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
1554 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1558 tmp_before
= tmp_list2
= 0;
1559 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
1560 warn_for_collisions (tmp_list2
);
1561 merge_tlist (pbefore_sp
, tmp_before
, 0);
1562 merge_tlist (pbefore_sp
, tmp_list2
, 1);
1564 tmp_list3
= tmp_nosp
= 0;
1565 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
1566 warn_for_collisions (tmp_nosp
);
1567 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1569 tmp_list3
= tmp_list2
= 0;
1570 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1571 warn_for_collisions (tmp_list2
);
1572 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1573 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1574 two first, to avoid warning for (a ? b++ : b++). */
1575 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
1576 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1579 case PREDECREMENT_EXPR
:
1580 case PREINCREMENT_EXPR
:
1581 case POSTDECREMENT_EXPR
:
1582 case POSTINCREMENT_EXPR
:
1583 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
1587 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1588 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1589 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
1590 /* Expressions inside the LHS are not ordered wrt. the sequence points
1591 in the RHS. Example:
1593 Despite the fact that the modification of "a" is in the before_sp
1594 list (tmp_before), it conflicts with the use of "a" in the LHS.
1595 We can handle this by adding the contents of tmp_list3
1596 to those of tmp_before, and redoing the collision warnings for that
1598 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
1599 warn_for_collisions (tmp_before
);
1600 /* Exclude the LHS itself here; we first have to merge it into the
1601 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1602 didn't exclude the LHS, we'd get it twice, once as a read and once
1604 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1605 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
1607 merge_tlist (pbefore_sp
, tmp_before
, 0);
1608 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
1609 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
1610 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
1614 /* We need to warn about conflicts among arguments and conflicts between
1615 args and the function address. Side effects of the function address,
1616 however, are not ordered by the sequence point of the call. */
1617 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
1618 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1619 if (TREE_OPERAND (x
, 1))
1620 verify_tree (TREE_OPERAND (x
, 1), &tmp_list2
, &tmp_list3
, NULL_TREE
);
1621 merge_tlist (&tmp_list3
, tmp_list2
, 0);
1622 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
1623 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
1624 warn_for_collisions (tmp_before
);
1625 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
1629 /* Scan all the list, e.g. indices of multi dimensional array. */
1632 tmp_before
= tmp_nosp
= 0;
1633 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1634 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1635 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1642 struct tlist_cache
*t
;
1643 for (t
= save_expr_cache
; t
; t
= t
->next
)
1649 t
= obstack_alloc (&tlist_obstack
, sizeof *t
);
1650 t
->next
= save_expr_cache
;
1652 save_expr_cache
= t
;
1654 tmp_before
= tmp_nosp
= 0;
1655 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1656 warn_for_collisions (tmp_nosp
);
1661 struct tlist
*t
= tmp_nosp
;
1663 merge_tlist (&tmp_list3
, t
, 0);
1665 t
->cache_before_sp
= tmp_before
;
1666 t
->cache_after_sp
= tmp_list3
;
1668 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1669 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1678 if (first_rtl_op (code
) == 0)
1680 x
= TREE_OPERAND (x
, 0);
1696 int max
= first_rtl_op (TREE_CODE (x
));
1697 for (lp
= 0; lp
< max
; lp
++)
1699 tmp_before
= tmp_nosp
= 0;
1700 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1701 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1702 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1709 /* Try to warn for undefined behavior in EXPR due to missing sequence
1713 verify_sequence_points (tree expr
)
1715 struct tlist
*before_sp
= 0, *after_sp
= 0;
1718 save_expr_cache
= 0;
1719 if (tlist_firstobj
== 0)
1721 gcc_obstack_init (&tlist_obstack
);
1722 tlist_firstobj
= obstack_alloc (&tlist_obstack
, 0);
1725 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1726 warn_for_collisions (after_sp
);
1727 obstack_free (&tlist_obstack
, tlist_firstobj
);
1731 c_expand_expr_stmt (tree expr
)
1733 /* Do default conversion if safe and possibly important,
1734 in case within ({...}). */
1735 if ((TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
1736 && (flag_isoc99
|| lvalue_p (expr
)))
1737 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
)
1738 expr
= default_conversion (expr
);
1740 if (warn_sequence_point
)
1741 verify_sequence_points (expr
);
1743 if (TREE_TYPE (expr
) != error_mark_node
1744 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr
))
1745 && TREE_CODE (TREE_TYPE (expr
)) != ARRAY_TYPE
)
1746 error ("expression statement has incomplete type");
1748 last_expr_type
= TREE_TYPE (expr
);
1749 return add_stmt (build_stmt (EXPR_STMT
, expr
));
1752 /* Validate the expression after `case' and apply default promotions. */
1755 check_case_value (tree value
)
1757 if (value
== NULL_TREE
)
1760 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1761 STRIP_TYPE_NOPS (value
);
1762 /* In C++, the following is allowed:
1765 switch (...) { case i: ... }
1767 So, we try to reduce the VALUE to a constant that way. */
1768 if (c_dialect_cxx ())
1770 value
= decl_constant_value (value
);
1771 STRIP_TYPE_NOPS (value
);
1772 value
= fold (value
);
1775 if (TREE_CODE (value
) != INTEGER_CST
1776 && value
!= error_mark_node
)
1778 error ("case label does not reduce to an integer constant");
1779 value
= error_mark_node
;
1782 /* Promote char or short to int. */
1783 value
= default_conversion (value
);
1785 constant_expression_warning (value
);
1790 /* Return an integer type with BITS bits of precision,
1791 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1794 c_common_type_for_size (unsigned int bits
, int unsignedp
)
1796 if (bits
== TYPE_PRECISION (integer_type_node
))
1797 return unsignedp
? unsigned_type_node
: integer_type_node
;
1799 if (bits
== TYPE_PRECISION (signed_char_type_node
))
1800 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1802 if (bits
== TYPE_PRECISION (short_integer_type_node
))
1803 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1805 if (bits
== TYPE_PRECISION (long_integer_type_node
))
1806 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1808 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
1809 return (unsignedp
? long_long_unsigned_type_node
1810 : long_long_integer_type_node
);
1812 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
1813 return (unsignedp
? widest_unsigned_literal_type_node
1814 : widest_integer_literal_type_node
);
1816 if (bits
<= TYPE_PRECISION (intQI_type_node
))
1817 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1819 if (bits
<= TYPE_PRECISION (intHI_type_node
))
1820 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1822 if (bits
<= TYPE_PRECISION (intSI_type_node
))
1823 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1825 if (bits
<= TYPE_PRECISION (intDI_type_node
))
1826 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1831 /* Used for communication between c_common_type_for_mode and
1832 c_register_builtin_type. */
1833 static GTY(()) tree registered_builtin_types
;
1835 /* Return a data type that has machine mode MODE.
1836 If the mode is an integer,
1837 then UNSIGNEDP selects between signed and unsigned types. */
1840 c_common_type_for_mode (enum machine_mode mode
, int unsignedp
)
1844 if (mode
== TYPE_MODE (integer_type_node
))
1845 return unsignedp
? unsigned_type_node
: integer_type_node
;
1847 if (mode
== TYPE_MODE (signed_char_type_node
))
1848 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1850 if (mode
== TYPE_MODE (short_integer_type_node
))
1851 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1853 if (mode
== TYPE_MODE (long_integer_type_node
))
1854 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1856 if (mode
== TYPE_MODE (long_long_integer_type_node
))
1857 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
1859 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
1860 return unsignedp
? widest_unsigned_literal_type_node
1861 : widest_integer_literal_type_node
;
1864 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1867 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1870 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1873 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1875 #if HOST_BITS_PER_WIDE_INT >= 64
1876 if (mode
== TYPE_MODE (intTI_type_node
))
1877 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
1880 if (mode
== TYPE_MODE (float_type_node
))
1881 return float_type_node
;
1883 if (mode
== TYPE_MODE (double_type_node
))
1884 return double_type_node
;
1886 if (mode
== TYPE_MODE (long_double_type_node
))
1887 return long_double_type_node
;
1889 if (mode
== TYPE_MODE (void_type_node
))
1890 return void_type_node
;
1892 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
1893 return unsignedp
? make_unsigned_type (mode
) : make_signed_type (mode
);
1895 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
1896 return unsignedp
? make_unsigned_type (mode
) : make_signed_type (mode
);
1901 return unsignedp
? unsigned_V16QI_type_node
: V16QI_type_node
;
1903 return unsignedp
? unsigned_V8HI_type_node
: V8HI_type_node
;
1905 return unsignedp
? unsigned_V4SI_type_node
: V4SI_type_node
;
1907 return unsignedp
? unsigned_V2DI_type_node
: V2DI_type_node
;
1909 return unsignedp
? unsigned_V2SI_type_node
: V2SI_type_node
;
1911 return unsignedp
? unsigned_V2HI_type_node
: V2HI_type_node
;
1913 return unsignedp
? unsigned_V4HI_type_node
: V4HI_type_node
;
1915 return unsignedp
? unsigned_V8QI_type_node
: V8QI_type_node
;
1917 return unsignedp
? unsigned_V1DI_type_node
: V1DI_type_node
;
1919 return V16SF_type_node
;
1921 return V4SF_type_node
;
1923 return V2SF_type_node
;
1925 return V2DF_type_node
;
1927 return V4DF_type_node
;
1932 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
1933 if (TYPE_MODE (TREE_VALUE (t
)) == mode
)
1934 return TREE_VALUE (t
);
1939 /* Return an unsigned type the same as TYPE in other respects. */
1941 c_common_unsigned_type (tree type
)
1943 tree type1
= TYPE_MAIN_VARIANT (type
);
1944 if (type1
== signed_char_type_node
|| type1
== char_type_node
)
1945 return unsigned_char_type_node
;
1946 if (type1
== integer_type_node
)
1947 return unsigned_type_node
;
1948 if (type1
== short_integer_type_node
)
1949 return short_unsigned_type_node
;
1950 if (type1
== long_integer_type_node
)
1951 return long_unsigned_type_node
;
1952 if (type1
== long_long_integer_type_node
)
1953 return long_long_unsigned_type_node
;
1954 if (type1
== widest_integer_literal_type_node
)
1955 return widest_unsigned_literal_type_node
;
1956 #if HOST_BITS_PER_WIDE_INT >= 64
1957 if (type1
== intTI_type_node
)
1958 return unsigned_intTI_type_node
;
1960 if (type1
== intDI_type_node
)
1961 return unsigned_intDI_type_node
;
1962 if (type1
== intSI_type_node
)
1963 return unsigned_intSI_type_node
;
1964 if (type1
== intHI_type_node
)
1965 return unsigned_intHI_type_node
;
1966 if (type1
== intQI_type_node
)
1967 return unsigned_intQI_type_node
;
1969 return c_common_signed_or_unsigned_type (1, type
);
1972 /* Return a signed type the same as TYPE in other respects. */
1975 c_common_signed_type (tree type
)
1977 tree type1
= TYPE_MAIN_VARIANT (type
);
1978 if (type1
== unsigned_char_type_node
|| type1
== char_type_node
)
1979 return signed_char_type_node
;
1980 if (type1
== unsigned_type_node
)
1981 return integer_type_node
;
1982 if (type1
== short_unsigned_type_node
)
1983 return short_integer_type_node
;
1984 if (type1
== long_unsigned_type_node
)
1985 return long_integer_type_node
;
1986 if (type1
== long_long_unsigned_type_node
)
1987 return long_long_integer_type_node
;
1988 if (type1
== widest_unsigned_literal_type_node
)
1989 return widest_integer_literal_type_node
;
1990 #if HOST_BITS_PER_WIDE_INT >= 64
1991 if (type1
== unsigned_intTI_type_node
)
1992 return intTI_type_node
;
1994 if (type1
== unsigned_intDI_type_node
)
1995 return intDI_type_node
;
1996 if (type1
== unsigned_intSI_type_node
)
1997 return intSI_type_node
;
1998 if (type1
== unsigned_intHI_type_node
)
1999 return intHI_type_node
;
2000 if (type1
== unsigned_intQI_type_node
)
2001 return intQI_type_node
;
2003 return c_common_signed_or_unsigned_type (0, type
);
2006 /* Return a type the same as TYPE except unsigned or
2007 signed according to UNSIGNEDP. */
2010 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
2012 if (! INTEGRAL_TYPE_P (type
)
2013 || TREE_UNSIGNED (type
) == unsignedp
)
2016 /* Must check the mode of the types, not the precision. Enumeral types
2017 in C++ have precision set to match their range, but may use a wider
2018 mode to match an ABI. If we change modes, we may wind up with bad
2021 if (TYPE_MODE (type
) == TYPE_MODE (signed_char_type_node
))
2022 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2023 if (TYPE_MODE (type
) == TYPE_MODE (integer_type_node
))
2024 return unsignedp
? unsigned_type_node
: integer_type_node
;
2025 if (TYPE_MODE (type
) == TYPE_MODE (short_integer_type_node
))
2026 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2027 if (TYPE_MODE (type
) == TYPE_MODE (long_integer_type_node
))
2028 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2029 if (TYPE_MODE (type
) == TYPE_MODE (long_long_integer_type_node
))
2030 return (unsignedp
? long_long_unsigned_type_node
2031 : long_long_integer_type_node
);
2032 if (TYPE_MODE (type
) == TYPE_MODE (widest_integer_literal_type_node
))
2033 return (unsignedp
? widest_unsigned_literal_type_node
2034 : widest_integer_literal_type_node
);
2036 #if HOST_BITS_PER_WIDE_INT >= 64
2037 if (TYPE_MODE (type
) == TYPE_MODE (intTI_type_node
))
2038 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2040 if (TYPE_MODE (type
) == TYPE_MODE (intDI_type_node
))
2041 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2042 if (TYPE_MODE (type
) == TYPE_MODE (intSI_type_node
))
2043 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2044 if (TYPE_MODE (type
) == TYPE_MODE (intHI_type_node
))
2045 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2046 if (TYPE_MODE (type
) == TYPE_MODE (intQI_type_node
))
2047 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2052 /* The C version of the register_builtin_type langhook. */
2055 c_register_builtin_type (tree type
, const char* name
)
2059 decl
= build_decl (TYPE_DECL
, get_identifier (name
), type
);
2060 DECL_ARTIFICIAL (decl
) = 1;
2061 if (!TYPE_NAME (type
))
2062 TYPE_NAME (type
) = decl
;
2065 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
2069 /* Return the minimum number of bits needed to represent VALUE in a
2070 signed or unsigned type, UNSIGNEDP says which. */
2073 min_precision (tree value
, int unsignedp
)
2077 /* If the value is negative, compute its negative minus 1. The latter
2078 adjustment is because the absolute value of the largest negative value
2079 is one larger than the largest positive value. This is equivalent to
2080 a bit-wise negation, so use that operation instead. */
2082 if (tree_int_cst_sgn (value
) < 0)
2083 value
= fold (build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
));
2085 /* Return the number of bits needed, taking into account the fact
2086 that we need one more bit for a signed than unsigned type. */
2088 if (integer_zerop (value
))
2091 log
= tree_floor_log2 (value
);
2093 return log
+ 1 + ! unsignedp
;
2096 /* Print an error message for invalid operands to arith operation
2097 CODE. NOP_EXPR is used as a special case (see
2098 c_common_truthvalue_conversion). */
2101 binary_op_error (enum tree_code code
)
2108 error ("invalid truth-value expression");
2112 opname
= "+"; break;
2114 opname
= "-"; break;
2116 opname
= "*"; break;
2118 opname
= "max"; break;
2120 opname
= "min"; break;
2122 opname
= "=="; break;
2124 opname
= "!="; break;
2126 opname
= "<="; break;
2128 opname
= ">="; break;
2130 opname
= "<"; break;
2132 opname
= ">"; break;
2134 opname
= "<<"; break;
2136 opname
= ">>"; break;
2137 case TRUNC_MOD_EXPR
:
2138 case FLOOR_MOD_EXPR
:
2139 opname
= "%"; break;
2140 case TRUNC_DIV_EXPR
:
2141 case FLOOR_DIV_EXPR
:
2142 opname
= "/"; break;
2144 opname
= "&"; break;
2146 opname
= "|"; break;
2147 case TRUTH_ANDIF_EXPR
:
2148 opname
= "&&"; break;
2149 case TRUTH_ORIF_EXPR
:
2150 opname
= "||"; break;
2152 opname
= "^"; break;
2155 opname
= "rotate"; break;
2157 opname
= "unknown"; break;
2159 error ("invalid operands to binary %s", opname
);
2162 /* Subroutine of build_binary_op, used for comparison operations.
2163 See if the operands have both been converted from subword integer types
2164 and, if so, perhaps change them both back to their original type.
2165 This function is also responsible for converting the two operands
2166 to the proper common type for comparison.
2168 The arguments of this function are all pointers to local variables
2169 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2170 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2172 If this function returns nonzero, it means that the comparison has
2173 a constant value. What this function returns is an expression for
2177 shorten_compare (tree
*op0_ptr
, tree
*op1_ptr
, tree
*restype_ptr
,
2178 enum tree_code
*rescode_ptr
)
2181 tree op0
= *op0_ptr
;
2182 tree op1
= *op1_ptr
;
2183 int unsignedp0
, unsignedp1
;
2185 tree primop0
, primop1
;
2186 enum tree_code code
= *rescode_ptr
;
2188 /* Throw away any conversions to wider types
2189 already present in the operands. */
2191 primop0
= get_narrower (op0
, &unsignedp0
);
2192 primop1
= get_narrower (op1
, &unsignedp1
);
2194 /* Handle the case that OP0 does not *contain* a conversion
2195 but it *requires* conversion to FINAL_TYPE. */
2197 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
2198 unsignedp0
= TREE_UNSIGNED (TREE_TYPE (op0
));
2199 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
2200 unsignedp1
= TREE_UNSIGNED (TREE_TYPE (op1
));
2202 /* If one of the operands must be floated, we cannot optimize. */
2203 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
2204 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
2206 /* If first arg is constant, swap the args (changing operation
2207 so value is preserved), for canonicalization. Don't do this if
2208 the second arg is 0. */
2210 if (TREE_CONSTANT (primop0
)
2211 && ! integer_zerop (primop1
) && ! real_zerop (primop1
))
2214 int temi
= unsignedp0
;
2222 unsignedp0
= unsignedp1
;
2245 *rescode_ptr
= code
;
2248 /* If comparing an integer against a constant more bits wide,
2249 maybe we can deduce a value of 1 or 0 independent of the data.
2250 Or else truncate the constant now
2251 rather than extend the variable at run time.
2253 This is only interesting if the constant is the wider arg.
2254 Also, it is not safe if the constant is unsigned and the
2255 variable arg is signed, since in this case the variable
2256 would be sign-extended and then regarded as unsigned.
2257 Our technique fails in this case because the lowest/highest
2258 possible unsigned results don't follow naturally from the
2259 lowest/highest possible values of the variable operand.
2260 For just EQ_EXPR and NE_EXPR there is another technique that
2261 could be used: see if the constant can be faithfully represented
2262 in the other operand's type, by truncating it and reextending it
2263 and see if that preserves the constant's value. */
2265 if (!real1
&& !real2
2266 && TREE_CODE (primop1
) == INTEGER_CST
2267 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
2269 int min_gt
, max_gt
, min_lt
, max_lt
;
2270 tree maxval
, minval
;
2271 /* 1 if comparison is nominally unsigned. */
2272 int unsignedp
= TREE_UNSIGNED (*restype_ptr
);
2275 type
= c_common_signed_or_unsigned_type (unsignedp0
,
2276 TREE_TYPE (primop0
));
2278 /* In C, if TYPE is an enumeration, then we need to get its
2279 min/max values from it's underlying integral type, not the
2280 enumerated type itself. In C++, TYPE_MAX_VALUE and
2281 TYPE_MIN_VALUE have already been set correctly on the
2282 enumeration type. */
2283 if (!c_dialect_cxx() && TREE_CODE (type
) == ENUMERAL_TYPE
)
2284 type
= c_common_type_for_size (TYPE_PRECISION (type
), unsignedp0
);
2286 maxval
= TYPE_MAX_VALUE (type
);
2287 minval
= TYPE_MIN_VALUE (type
);
2289 if (unsignedp
&& !unsignedp0
)
2290 *restype_ptr
= c_common_signed_type (*restype_ptr
);
2292 if (TREE_TYPE (primop1
) != *restype_ptr
)
2293 primop1
= convert (*restype_ptr
, primop1
);
2294 if (type
!= *restype_ptr
)
2296 minval
= convert (*restype_ptr
, minval
);
2297 maxval
= convert (*restype_ptr
, maxval
);
2300 if (unsignedp
&& unsignedp0
)
2302 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
2303 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
2304 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
2305 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
2309 min_gt
= INT_CST_LT (primop1
, minval
);
2310 max_gt
= INT_CST_LT (primop1
, maxval
);
2311 min_lt
= INT_CST_LT (minval
, primop1
);
2312 max_lt
= INT_CST_LT (maxval
, primop1
);
2316 /* This used to be a switch, but Genix compiler can't handle that. */
2317 if (code
== NE_EXPR
)
2319 if (max_lt
|| min_gt
)
2320 val
= truthvalue_true_node
;
2322 else if (code
== EQ_EXPR
)
2324 if (max_lt
|| min_gt
)
2325 val
= truthvalue_false_node
;
2327 else if (code
== LT_EXPR
)
2330 val
= truthvalue_true_node
;
2332 val
= truthvalue_false_node
;
2334 else if (code
== GT_EXPR
)
2337 val
= truthvalue_true_node
;
2339 val
= truthvalue_false_node
;
2341 else if (code
== LE_EXPR
)
2344 val
= truthvalue_true_node
;
2346 val
= truthvalue_false_node
;
2348 else if (code
== GE_EXPR
)
2351 val
= truthvalue_true_node
;
2353 val
= truthvalue_false_node
;
2356 /* If primop0 was sign-extended and unsigned comparison specd,
2357 we did a signed comparison above using the signed type bounds.
2358 But the comparison we output must be unsigned.
2360 Also, for inequalities, VAL is no good; but if the signed
2361 comparison had *any* fixed result, it follows that the
2362 unsigned comparison just tests the sign in reverse
2363 (positive values are LE, negative ones GE).
2364 So we can generate an unsigned comparison
2365 against an extreme value of the signed type. */
2367 if (unsignedp
&& !unsignedp0
)
2374 primop1
= TYPE_MIN_VALUE (type
);
2380 primop1
= TYPE_MAX_VALUE (type
);
2387 type
= c_common_unsigned_type (type
);
2390 if (TREE_CODE (primop0
) != INTEGER_CST
)
2392 if (val
== truthvalue_false_node
)
2393 warning ("comparison is always false due to limited range of data type");
2394 if (val
== truthvalue_true_node
)
2395 warning ("comparison is always true due to limited range of data type");
2400 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2401 if (TREE_SIDE_EFFECTS (primop0
))
2402 return build (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
2406 /* Value is not predetermined, but do the comparison
2407 in the type of the operand that is not constant.
2408 TYPE is already properly set. */
2410 else if (real1
&& real2
2411 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2412 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2413 type
= TREE_TYPE (primop0
);
2415 /* If args' natural types are both narrower than nominal type
2416 and both extend in the same manner, compare them
2417 in the type of the wider arg.
2418 Otherwise must actually extend both to the nominal
2419 common type lest different ways of extending
2421 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2423 else if (unsignedp0
== unsignedp1
&& real1
== real2
2424 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
2425 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
2427 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2428 type
= c_common_signed_or_unsigned_type (unsignedp0
2429 || TREE_UNSIGNED (*restype_ptr
),
2431 /* Make sure shorter operand is extended the right way
2432 to match the longer operand. */
2434 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
2435 TREE_TYPE (primop0
)),
2438 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
2439 TREE_TYPE (primop1
)),
2444 /* Here we must do the comparison on the nominal type
2445 using the args exactly as we received them. */
2446 type
= *restype_ptr
;
2450 if (!real1
&& !real2
&& integer_zerop (primop1
)
2451 && TREE_UNSIGNED (*restype_ptr
))
2457 /* All unsigned values are >= 0, so we warn if extra warnings
2458 are requested. However, if OP0 is a constant that is
2459 >= 0, the signedness of the comparison isn't an issue,
2460 so suppress the warning. */
2461 if (extra_warnings
&& !in_system_header
2462 && ! (TREE_CODE (primop0
) == INTEGER_CST
2463 && ! TREE_OVERFLOW (convert (c_common_signed_type (type
),
2465 warning ("comparison of unsigned expression >= 0 is always true");
2466 value
= truthvalue_true_node
;
2470 if (extra_warnings
&& !in_system_header
2471 && ! (TREE_CODE (primop0
) == INTEGER_CST
2472 && ! TREE_OVERFLOW (convert (c_common_signed_type (type
),
2474 warning ("comparison of unsigned expression < 0 is always false");
2475 value
= truthvalue_false_node
;
2484 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2485 if (TREE_SIDE_EFFECTS (primop0
))
2486 return build (COMPOUND_EXPR
, TREE_TYPE (value
),
2493 *op0_ptr
= convert (type
, primop0
);
2494 *op1_ptr
= convert (type
, primop1
);
2496 *restype_ptr
= truthvalue_type_node
;
2501 /* Return a tree for the sum or difference (RESULTCODE says which)
2502 of pointer PTROP and integer INTOP. */
2505 pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
2512 /* The result is a pointer of the same type that is being added. */
2514 tree result_type
= TREE_TYPE (ptrop
);
2516 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2518 if (pedantic
|| warn_pointer_arith
)
2519 pedwarn ("pointer of type `void *' used in arithmetic");
2520 size_exp
= integer_one_node
;
2522 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2524 if (pedantic
|| warn_pointer_arith
)
2525 pedwarn ("pointer to a function used in arithmetic");
2526 size_exp
= integer_one_node
;
2528 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
2530 if (pedantic
|| warn_pointer_arith
)
2531 pedwarn ("pointer to member function used in arithmetic");
2532 size_exp
= integer_one_node
;
2534 else if (TREE_CODE (TREE_TYPE (result_type
)) == OFFSET_TYPE
)
2536 if (pedantic
|| warn_pointer_arith
)
2537 pedwarn ("pointer to a member used in arithmetic");
2538 size_exp
= integer_one_node
;
2541 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
2543 /* If what we are about to multiply by the size of the elements
2544 contains a constant term, apply distributive law
2545 and multiply that constant term separately.
2546 This helps produce common subexpressions. */
2548 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
2549 && ! TREE_CONSTANT (intop
)
2550 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
2551 && TREE_CONSTANT (size_exp
)
2552 /* If the constant comes from pointer subtraction,
2553 skip this optimization--it would cause an error. */
2554 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
2555 /* If the constant is unsigned, and smaller than the pointer size,
2556 then we must skip this optimization. This is because it could cause
2557 an overflow error if the constant is negative but INTOP is not. */
2558 && (! TREE_UNSIGNED (TREE_TYPE (intop
))
2559 || (TYPE_PRECISION (TREE_TYPE (intop
))
2560 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
2562 enum tree_code subcode
= resultcode
;
2563 tree int_type
= TREE_TYPE (intop
);
2564 if (TREE_CODE (intop
) == MINUS_EXPR
)
2565 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
2566 /* Convert both subexpression types to the type of intop,
2567 because weird cases involving pointer arithmetic
2568 can result in a sum or difference with different type args. */
2569 ptrop
= build_binary_op (subcode
, ptrop
,
2570 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
2571 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
2574 /* Convert the integer argument to a type the same size as sizetype
2575 so the multiply won't overflow spuriously. */
2577 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
2578 || TREE_UNSIGNED (TREE_TYPE (intop
)) != TREE_UNSIGNED (sizetype
))
2579 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
2580 TREE_UNSIGNED (sizetype
)), intop
);
2582 /* Replace the integer argument with a suitable product by the object size.
2583 Do this multiplication as signed, then convert to the appropriate
2584 pointer type (actually unsigned integral). */
2586 intop
= convert (result_type
,
2587 build_binary_op (MULT_EXPR
, intop
,
2588 convert (TREE_TYPE (intop
), size_exp
), 1));
2590 /* Create the sum or difference. */
2592 result
= build (resultcode
, result_type
, ptrop
, intop
);
2594 folded
= fold (result
);
2595 if (folded
== result
)
2596 TREE_CONSTANT (folded
) = TREE_CONSTANT (ptrop
) & TREE_CONSTANT (intop
);
2600 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2601 or validate its data type for an `if' or `while' statement or ?..: exp.
2603 This preparation consists of taking the ordinary
2604 representation of an expression expr and producing a valid tree
2605 boolean expression describing whether expr is nonzero. We could
2606 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2607 but we optimize comparisons, &&, ||, and !.
2609 The resulting type should always be `truthvalue_type_node'. */
2612 c_common_truthvalue_conversion (tree expr
)
2614 if (TREE_CODE (expr
) == ERROR_MARK
)
2617 if (TREE_CODE (expr
) == FUNCTION_DECL
)
2618 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
2620 #if 0 /* This appears to be wrong for C++. */
2621 /* These really should return error_mark_node after 2.4 is stable.
2622 But not all callers handle ERROR_MARK properly. */
2623 switch (TREE_CODE (TREE_TYPE (expr
)))
2626 error ("struct type value used where scalar is required");
2627 return truthvalue_false_node
;
2630 error ("union type value used where scalar is required");
2631 return truthvalue_false_node
;
2634 error ("array type value used where scalar is required");
2635 return truthvalue_false_node
;
2642 switch (TREE_CODE (expr
))
2645 case NE_EXPR
: case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2646 case TRUTH_ANDIF_EXPR
:
2647 case TRUTH_ORIF_EXPR
:
2648 case TRUTH_AND_EXPR
:
2650 case TRUTH_XOR_EXPR
:
2651 case TRUTH_NOT_EXPR
:
2652 TREE_TYPE (expr
) = truthvalue_type_node
;
2659 return integer_zerop (expr
) ? truthvalue_false_node
: truthvalue_true_node
;
2662 return real_zerop (expr
) ? truthvalue_false_node
: truthvalue_true_node
;
2666 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == FUNCTION_DECL
2667 && ! DECL_WEAK (TREE_OPERAND (expr
, 0)))
2669 /* Common Ada/Pascal programmer's mistake. We always warn
2670 about this since it is so bad. */
2671 warning ("the address of `%D', will always evaluate as `true'",
2672 TREE_OPERAND (expr
, 0));
2673 return truthvalue_true_node
;
2676 /* If we are taking the address of an external decl, it might be
2677 zero if it is weak, so we cannot optimize. */
2678 if (DECL_P (TREE_OPERAND (expr
, 0))
2679 && DECL_EXTERNAL (TREE_OPERAND (expr
, 0)))
2682 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 0)))
2683 return build (COMPOUND_EXPR
, truthvalue_type_node
,
2684 TREE_OPERAND (expr
, 0), truthvalue_true_node
);
2686 return truthvalue_true_node
;
2690 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
2691 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2692 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2693 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2699 /* These don't change whether an object is nonzero or zero. */
2700 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2704 /* These don't change whether an object is zero or nonzero, but
2705 we can't ignore them if their second arg has side-effects. */
2706 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2707 return build (COMPOUND_EXPR
, truthvalue_type_node
, TREE_OPERAND (expr
, 1),
2708 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2710 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2713 /* Distribute the conversion into the arms of a COND_EXPR. */
2714 return fold (build (COND_EXPR
, truthvalue_type_node
, TREE_OPERAND (expr
, 0),
2715 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2716 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 2))));
2719 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2720 since that affects how `default_conversion' will behave. */
2721 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
2722 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2724 /* Fall through.... */
2726 /* If this is widening the argument, we can ignore it. */
2727 if (TYPE_PRECISION (TREE_TYPE (expr
))
2728 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2729 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2733 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2734 aren't guaranteed to the be same for modes that can represent
2735 infinity, since if x and y are both +infinity, or both
2736 -infinity, then x - y is not a number.
2738 Note that this transformation is safe when x or y is NaN.
2739 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2741 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
2743 /* Fall through.... */
2745 /* This and MINUS_EXPR can be changed into a comparison of the
2747 if (TREE_TYPE (TREE_OPERAND (expr
, 0))
2748 == TREE_TYPE (TREE_OPERAND (expr
, 1)))
2749 return build_binary_op (NE_EXPR
, TREE_OPERAND (expr
, 0),
2750 TREE_OPERAND (expr
, 1), 1);
2751 return build_binary_op (NE_EXPR
, TREE_OPERAND (expr
, 0),
2752 fold (build1 (NOP_EXPR
,
2753 TREE_TYPE (TREE_OPERAND (expr
, 0)),
2754 TREE_OPERAND (expr
, 1))), 1);
2757 if (integer_onep (TREE_OPERAND (expr
, 1))
2758 && TREE_TYPE (expr
) != truthvalue_type_node
)
2759 /* Using convert here would cause infinite recursion. */
2760 return build1 (NOP_EXPR
, truthvalue_type_node
, expr
);
2764 if (warn_parentheses
&& C_EXP_ORIGINAL_CODE (expr
) == MODIFY_EXPR
)
2765 warning ("suggest parentheses around assignment used as truth value");
2772 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
2774 tree t
= save_expr (expr
);
2775 return (build_binary_op
2776 ((TREE_SIDE_EFFECTS (expr
)
2777 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2778 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR
, t
, 0)),
2779 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR
, t
, 0)),
2783 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
2786 static tree
builtin_function_2 (const char *, const char *, tree
, tree
,
2787 int, enum built_in_class
, int, int,
2790 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2791 down to the element type of an array. */
2794 c_build_qualified_type (tree type
, int type_quals
)
2796 if (TREE_CODE (type
) == ARRAY_TYPE
)
2797 return build_array_type (c_build_qualified_type (TREE_TYPE (type
),
2799 TYPE_DOMAIN (type
));
2801 /* A restrict-qualified pointer type must be a pointer to object or
2802 incomplete type. Note that the use of POINTER_TYPE_P also allows
2803 REFERENCE_TYPEs, which is appropriate for C++. */
2804 if ((type_quals
& TYPE_QUAL_RESTRICT
)
2805 && (!POINTER_TYPE_P (type
)
2806 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
))))
2808 error ("invalid use of `restrict'");
2809 type_quals
&= ~TYPE_QUAL_RESTRICT
;
2812 return build_qualified_type (type
, type_quals
);
2815 /* Apply the TYPE_QUALS to the new DECL. */
2818 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
2820 tree type
= TREE_TYPE (decl
);
2822 if (((type_quals
& TYPE_QUAL_CONST
)
2823 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
2824 /* An object declared 'const' is only readonly after it is
2825 initialized. We don't have any way of expressing this currently,
2826 so we need to be conservative and unset TREE_READONLY for types
2827 with constructors. Otherwise aliasing code will ignore stores in
2828 an inline constructor. */
2829 && !(type
&& TYPE_NEEDS_CONSTRUCTING (type
)))
2830 TREE_READONLY (decl
) = 1;
2831 if (type_quals
& TYPE_QUAL_VOLATILE
)
2833 TREE_SIDE_EFFECTS (decl
) = 1;
2834 TREE_THIS_VOLATILE (decl
) = 1;
2836 if (type_quals
& TYPE_QUAL_RESTRICT
)
2838 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
2839 /* Allow 'restrict' on arrays of pointers.
2840 FIXME currently we just ignore it. */
2841 type
= TREE_TYPE (type
);
2843 || !POINTER_TYPE_P (type
)
2844 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
2845 error ("invalid use of `restrict'");
2846 else if (flag_strict_aliasing
&& type
== TREE_TYPE (decl
))
2847 /* Indicate we need to make a unique alias set for this pointer.
2848 We can't do it here because it might be pointing to an
2850 DECL_POINTER_ALIAS_SET (decl
) = -2;
2854 /* Return the typed-based alias set for T, which may be an expression
2855 or a type. Return -1 if we don't do anything special. */
2858 c_common_get_alias_set (tree t
)
2862 /* Permit type-punning when accessing a union, provided the access
2863 is directly through the union. For example, this code does not
2864 permit taking the address of a union member and then storing
2865 through it. Even the type-punning allowed here is a GCC
2866 extension, albeit a common and useful one; the C standard says
2867 that such accesses have implementation-defined behavior. */
2869 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
2870 u
= TREE_OPERAND (u
, 0))
2871 if (TREE_CODE (u
) == COMPONENT_REF
2872 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
2875 /* That's all the expressions we handle specially. */
2879 /* The C standard guarantees that any object may be accessed via an
2880 lvalue that has character type. */
2881 if (t
== char_type_node
2882 || t
== signed_char_type_node
2883 || t
== unsigned_char_type_node
)
2886 /* If it has the may_alias attribute, it can alias anything. */
2887 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t
)))
2890 /* The C standard specifically allows aliasing between signed and
2891 unsigned variants of the same type. We treat the signed
2892 variant as canonical. */
2893 if (TREE_CODE (t
) == INTEGER_TYPE
&& TREE_UNSIGNED (t
))
2895 tree t1
= c_common_signed_type (t
);
2897 /* t1 == t can happen for boolean nodes which are always unsigned. */
2899 return get_alias_set (t1
);
2901 else if (POINTER_TYPE_P (t
))
2905 /* Unfortunately, there is no canonical form of a pointer type.
2906 In particular, if we have `typedef int I', then `int *', and
2907 `I *' are different types. So, we have to pick a canonical
2908 representative. We do this below.
2910 Technically, this approach is actually more conservative that
2911 it needs to be. In particular, `const int *' and `int *'
2912 should be in different alias sets, according to the C and C++
2913 standard, since their types are not the same, and so,
2914 technically, an `int **' and `const int **' cannot point at
2917 But, the standard is wrong. In particular, this code is
2922 const int* const* cipp = &ipp;
2924 And, it doesn't make sense for that to be legal unless you
2925 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2926 the pointed-to types. This issue has been reported to the
2928 t1
= build_type_no_quals (t
);
2930 return get_alias_set (t1
);
2936 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2937 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2938 flag controls whether we should diagnose possibly ill-formed
2939 constructs or not. */
2941 c_sizeof_or_alignof_type (tree type
, enum tree_code op
, int complain
)
2943 const char *op_name
;
2945 enum tree_code type_code
= TREE_CODE (type
);
2947 my_friendly_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
, 20020720);
2948 op_name
= op
== SIZEOF_EXPR
? "sizeof" : "__alignof__";
2950 if (type_code
== FUNCTION_TYPE
)
2952 if (op
== SIZEOF_EXPR
)
2954 if (complain
&& (pedantic
|| warn_pointer_arith
))
2955 pedwarn ("invalid application of `sizeof' to a function type");
2956 value
= size_one_node
;
2959 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
2961 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
2963 if (type_code
== VOID_TYPE
2964 && complain
&& (pedantic
|| warn_pointer_arith
))
2965 pedwarn ("invalid application of `%s' to a void type", op_name
);
2966 value
= size_one_node
;
2968 else if (!COMPLETE_TYPE_P (type
))
2971 error ("invalid application of `%s' to an incomplete type", op_name
);
2972 value
= size_zero_node
;
2976 if (op
== SIZEOF_EXPR
)
2977 /* Convert in case a char is more than one unit. */
2978 value
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
2979 size_int (TYPE_PRECISION (char_type_node
)
2982 value
= size_int (TYPE_ALIGN (type
) / BITS_PER_UNIT
);
2985 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2986 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2987 never happen. However, this node should really have type
2988 `size_t', which is just a typedef for an ordinary integer type. */
2989 value
= fold (build1 (NOP_EXPR
, size_type_node
, value
));
2990 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)), 20001021);
2995 /* Implement the __alignof keyword: Return the minimum required
2996 alignment of EXPR, measured in bytes. For VAR_DECL's and
2997 FIELD_DECL's return DECL_ALIGN (which can be set from an
2998 "aligned" __attribute__ specification). */
3001 c_alignof_expr (tree expr
)
3005 if (TREE_CODE (expr
) == VAR_DECL
)
3006 t
= size_int (DECL_ALIGN (expr
) / BITS_PER_UNIT
);
3008 else if (TREE_CODE (expr
) == COMPONENT_REF
3009 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
3011 error ("`__alignof' applied to a bit-field");
3014 else if (TREE_CODE (expr
) == COMPONENT_REF
3015 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
3016 t
= size_int (DECL_ALIGN (TREE_OPERAND (expr
, 1)) / BITS_PER_UNIT
);
3018 else if (TREE_CODE (expr
) == INDIRECT_REF
)
3020 tree t
= TREE_OPERAND (expr
, 0);
3022 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3024 while (TREE_CODE (t
) == NOP_EXPR
3025 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
3029 t
= TREE_OPERAND (t
, 0);
3030 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3031 if (thisalign
> bestalign
)
3032 best
= t
, bestalign
= thisalign
;
3034 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
3037 return c_alignof (TREE_TYPE (expr
));
3039 return fold (build1 (NOP_EXPR
, size_type_node
, t
));
3042 /* Handle C and C++ default attributes. */
3044 enum built_in_attribute
3046 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3047 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3048 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3049 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3050 #include "builtin-attrs.def"
3051 #undef DEF_ATTR_NULL_TREE
3053 #undef DEF_ATTR_IDENT
3054 #undef DEF_ATTR_TREE_LIST
3058 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
3060 static void c_init_attributes (void);
3062 /* Build tree nodes and builtin functions common to both C and C++ language
3066 c_common_nodes_and_builtins (void)
3070 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3071 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3072 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3073 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3074 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3075 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3076 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3077 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3078 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3079 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3080 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3081 #include "builtin-types.def"
3082 #undef DEF_PRIMITIVE_TYPE
3083 #undef DEF_FUNCTION_TYPE_0
3084 #undef DEF_FUNCTION_TYPE_1
3085 #undef DEF_FUNCTION_TYPE_2
3086 #undef DEF_FUNCTION_TYPE_3
3087 #undef DEF_FUNCTION_TYPE_4
3088 #undef DEF_FUNCTION_TYPE_VAR_0
3089 #undef DEF_FUNCTION_TYPE_VAR_1
3090 #undef DEF_FUNCTION_TYPE_VAR_2
3091 #undef DEF_FUNCTION_TYPE_VAR_3
3092 #undef DEF_POINTER_TYPE
3096 typedef enum builtin_type builtin_type
;
3098 tree builtin_types
[(int) BT_LAST
];
3099 int wchar_type_size
;
3100 tree array_domain_type
;
3101 tree va_list_ref_type_node
;
3102 tree va_list_arg_type_node
;
3104 /* Define `int' and `char' first so that dbx will output them first. */
3105 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
3106 record_builtin_type (RID_CHAR
, "char", char_type_node
);
3108 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3109 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3110 but not C. Are the conditionals here needed? */
3111 if (c_dialect_cxx ())
3112 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
3113 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
3114 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
3115 record_builtin_type (RID_MAX
, "long unsigned int",
3116 long_unsigned_type_node
);
3117 if (c_dialect_cxx ())
3118 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
3119 record_builtin_type (RID_MAX
, "long long int",
3120 long_long_integer_type_node
);
3121 record_builtin_type (RID_MAX
, "long long unsigned int",
3122 long_long_unsigned_type_node
);
3123 if (c_dialect_cxx ())
3124 record_builtin_type (RID_MAX
, "long long unsigned",
3125 long_long_unsigned_type_node
);
3126 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
3127 record_builtin_type (RID_MAX
, "short unsigned int",
3128 short_unsigned_type_node
);
3129 if (c_dialect_cxx ())
3130 record_builtin_type (RID_MAX
, "unsigned short",
3131 short_unsigned_type_node
);
3133 /* Define both `signed char' and `unsigned char'. */
3134 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
3135 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
3137 /* These are types that c_common_type_for_size and
3138 c_common_type_for_mode use. */
3139 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3141 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3143 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3145 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3147 #if HOST_BITS_PER_WIDE_INT >= 64
3148 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3149 get_identifier ("__int128_t"),
3152 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3153 unsigned_intQI_type_node
));
3154 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3155 unsigned_intHI_type_node
));
3156 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3157 unsigned_intSI_type_node
));
3158 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3159 unsigned_intDI_type_node
));
3160 #if HOST_BITS_PER_WIDE_INT >= 64
3161 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3162 get_identifier ("__uint128_t"),
3163 unsigned_intTI_type_node
));
3166 /* Create the widest literal types. */
3167 widest_integer_literal_type_node
3168 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
3169 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3170 widest_integer_literal_type_node
));
3172 widest_unsigned_literal_type_node
3173 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
3174 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3175 widest_unsigned_literal_type_node
));
3177 /* `unsigned long' is the standard type for sizeof.
3178 Note that stddef.h uses `unsigned long',
3179 and this must agree, even if long and int are the same size. */
3181 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
3182 signed_size_type_node
= c_common_signed_type (size_type_node
);
3183 set_sizetype (size_type_node
);
3185 build_common_tree_nodes_2 (flag_short_double
);
3187 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
3188 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
3189 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
3191 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3192 get_identifier ("complex int"),
3193 complex_integer_type_node
));
3194 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3195 get_identifier ("complex float"),
3196 complex_float_type_node
));
3197 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3198 get_identifier ("complex double"),
3199 complex_double_type_node
));
3200 (*lang_hooks
.decls
.pushdecl
)
3201 (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
3202 complex_long_double_type_node
));
3204 /* Types which are common to the fortran compiler and libf2c. When
3205 changing these, you also need to be concerned with f/com.h. */
3207 if (TYPE_PRECISION (float_type_node
)
3208 == TYPE_PRECISION (long_integer_type_node
))
3210 g77_integer_type_node
= long_integer_type_node
;
3211 g77_uinteger_type_node
= long_unsigned_type_node
;
3213 else if (TYPE_PRECISION (float_type_node
)
3214 == TYPE_PRECISION (integer_type_node
))
3216 g77_integer_type_node
= integer_type_node
;
3217 g77_uinteger_type_node
= unsigned_type_node
;
3220 g77_integer_type_node
= g77_uinteger_type_node
= NULL_TREE
;
3222 if (g77_integer_type_node
!= NULL_TREE
)
3224 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3225 get_identifier ("__g77_integer"),
3226 g77_integer_type_node
));
3227 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3228 get_identifier ("__g77_uinteger"),
3229 g77_uinteger_type_node
));
3232 if (TYPE_PRECISION (float_type_node
) * 2
3233 == TYPE_PRECISION (long_integer_type_node
))
3235 g77_longint_type_node
= long_integer_type_node
;
3236 g77_ulongint_type_node
= long_unsigned_type_node
;
3238 else if (TYPE_PRECISION (float_type_node
) * 2
3239 == TYPE_PRECISION (long_long_integer_type_node
))
3241 g77_longint_type_node
= long_long_integer_type_node
;
3242 g77_ulongint_type_node
= long_long_unsigned_type_node
;
3245 g77_longint_type_node
= g77_ulongint_type_node
= NULL_TREE
;
3247 if (g77_longint_type_node
!= NULL_TREE
)
3249 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3250 get_identifier ("__g77_longint"),
3251 g77_longint_type_node
));
3252 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3253 get_identifier ("__g77_ulongint"),
3254 g77_ulongint_type_node
));
3257 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
3259 void_zero_node
= build_int_2 (0, 0);
3260 TREE_TYPE (void_zero_node
) = void_type_node
;
3262 void_list_node
= build_void_list_node ();
3264 /* Make a type to be the domain of a few array types
3265 whose domains don't really matter.
3266 200 is small enough that it always fits in size_t
3267 and large enough that it can hold most function names for the
3268 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3269 array_domain_type
= build_index_type (size_int (200));
3271 /* Make a type for arrays of characters.
3272 With luck nothing will ever really depend on the length of this
3274 char_array_type_node
3275 = build_array_type (char_type_node
, array_domain_type
);
3277 /* Likewise for arrays of ints. */
3279 = build_array_type (integer_type_node
, array_domain_type
);
3281 string_type_node
= build_pointer_type (char_type_node
);
3282 const_string_type_node
3283 = build_pointer_type (build_qualified_type
3284 (char_type_node
, TYPE_QUAL_CONST
));
3286 /* This is special for C++ so functions can be overloaded. */
3287 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
3288 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
3289 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
3290 if (c_dialect_cxx ())
3292 if (TREE_UNSIGNED (wchar_type_node
))
3293 wchar_type_node
= make_unsigned_type (wchar_type_size
);
3295 wchar_type_node
= make_signed_type (wchar_type_size
);
3296 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
3300 signed_wchar_type_node
= c_common_signed_type (wchar_type_node
);
3301 unsigned_wchar_type_node
= c_common_unsigned_type (wchar_type_node
);
3304 /* This is for wide string constants. */
3305 wchar_array_type_node
3306 = build_array_type (wchar_type_node
, array_domain_type
);
3309 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
3312 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
3314 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
3316 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
3318 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
3319 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
3321 (*lang_hooks
.decls
.pushdecl
)
3322 (build_decl (TYPE_DECL
, get_identifier ("__builtin_va_list"),
3323 va_list_type_node
));
3325 (*lang_hooks
.decls
.pushdecl
)
3326 (build_decl (TYPE_DECL
, get_identifier ("__builtin_ptrdiff_t"),
3327 ptrdiff_type_node
));
3329 (*lang_hooks
.decls
.pushdecl
)
3330 (build_decl (TYPE_DECL
, get_identifier ("__builtin_size_t"),
3333 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
3335 va_list_arg_type_node
= va_list_ref_type_node
=
3336 build_pointer_type (TREE_TYPE (va_list_type_node
));
3340 va_list_arg_type_node
= va_list_type_node
;
3341 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
3344 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3345 builtin_types[(int) ENUM] = VALUE;
3346 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3347 builtin_types[(int) ENUM] \
3348 = build_function_type (builtin_types[(int) RETURN], \
3350 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3351 builtin_types[(int) ENUM] \
3352 = build_function_type (builtin_types[(int) RETURN], \
3353 tree_cons (NULL_TREE, \
3354 builtin_types[(int) ARG1], \
3356 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3357 builtin_types[(int) ENUM] \
3358 = build_function_type \
3359 (builtin_types[(int) RETURN], \
3360 tree_cons (NULL_TREE, \
3361 builtin_types[(int) ARG1], \
3362 tree_cons (NULL_TREE, \
3363 builtin_types[(int) ARG2], \
3365 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
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], \
3373 tree_cons (NULL_TREE, \
3374 builtin_types[(int) ARG3], \
3376 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3377 builtin_types[(int) ENUM] \
3378 = build_function_type \
3379 (builtin_types[(int) RETURN], \
3380 tree_cons (NULL_TREE, \
3381 builtin_types[(int) ARG1], \
3382 tree_cons (NULL_TREE, \
3383 builtin_types[(int) ARG2], \
3386 builtin_types[(int) ARG3], \
3387 tree_cons (NULL_TREE, \
3388 builtin_types[(int) ARG4], \
3389 void_list_node)))));
3390 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3391 builtin_types[(int) ENUM] \
3392 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3393 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3394 builtin_types[(int) ENUM] \
3395 = build_function_type (builtin_types[(int) RETURN], \
3396 tree_cons (NULL_TREE, \
3397 builtin_types[(int) ARG1], \
3400 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3401 builtin_types[(int) ENUM] \
3402 = build_function_type \
3403 (builtin_types[(int) RETURN], \
3404 tree_cons (NULL_TREE, \
3405 builtin_types[(int) ARG1], \
3406 tree_cons (NULL_TREE, \
3407 builtin_types[(int) ARG2], \
3410 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3411 builtin_types[(int) ENUM] \
3412 = build_function_type \
3413 (builtin_types[(int) RETURN], \
3414 tree_cons (NULL_TREE, \
3415 builtin_types[(int) ARG1], \
3416 tree_cons (NULL_TREE, \
3417 builtin_types[(int) ARG2], \
3418 tree_cons (NULL_TREE, \
3419 builtin_types[(int) ARG3], \
3422 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3423 builtin_types[(int) ENUM] \
3424 = build_pointer_type (builtin_types[(int) TYPE]);
3425 #include "builtin-types.def"
3426 #undef DEF_PRIMITIVE_TYPE
3427 #undef DEF_FUNCTION_TYPE_1
3428 #undef DEF_FUNCTION_TYPE_2
3429 #undef DEF_FUNCTION_TYPE_3
3430 #undef DEF_FUNCTION_TYPE_4
3431 #undef DEF_FUNCTION_TYPE_VAR_0
3432 #undef DEF_FUNCTION_TYPE_VAR_1
3433 #undef DEF_FUNCTION_TYPE_VAR_2
3434 #undef DEF_FUNCTION_TYPE_VAR_3
3435 #undef DEF_POINTER_TYPE
3437 c_init_attributes ();
3439 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3440 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3445 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3449 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3452 ? (NAME + strlen ("__builtin_")) \
3454 built_in_attributes[(int) ATTRS]); \
3456 decl = builtin_function_2 (NAME, \
3457 NAME + strlen ("__builtin_"), \
3458 builtin_types[TYPE], \
3459 builtin_types[LIBTYPE], \
3464 built_in_attributes[(int) ATTRS]); \
3466 built_in_decls[(int) ENUM] = decl; \
3468 implicit_built_in_decls[(int) ENUM] = decl; \
3470 #include "builtins.def"
3473 (*targetm
.init_builtins
) ();
3475 main_identifier_node
= get_identifier ("main");
3479 build_va_arg (tree expr
, tree type
)
3481 return build1 (VA_ARG_EXPR
, type
, expr
);
3485 /* Linked list of disabled built-in functions. */
3487 typedef struct disabled_builtin
3490 struct disabled_builtin
*next
;
3492 static disabled_builtin
*disabled_builtins
= NULL
;
3494 static bool builtin_function_disabled_p (const char *);
3496 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3497 begins with "__builtin_", give an error. */
3500 disable_builtin_function (const char *name
)
3502 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
3503 error ("cannot disable built-in function `%s'", name
);
3506 disabled_builtin
*new = xmalloc (sizeof (disabled_builtin
));
3508 new->next
= disabled_builtins
;
3509 disabled_builtins
= new;
3514 /* Return true if the built-in function NAME has been disabled, false
3518 builtin_function_disabled_p (const char *name
)
3520 disabled_builtin
*p
;
3521 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
3523 if (strcmp (name
, p
->name
) == 0)
3530 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3531 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3532 of these may be NULL (though both being NULL is useless).
3533 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3534 TYPE is the type of the function with the ordinary name. These
3535 may differ if the ordinary name is declared with a looser type to avoid
3536 conflicts with headers. FUNCTION_CODE and CLASS are as for
3537 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3538 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3539 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3540 ATTRS is the tree list representing the builtin's function attributes.
3541 Returns the declaration of BUILTIN_NAME, if any, otherwise
3542 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3543 or if NONANSI_P and flag_no_nonansi_builtin. */
3546 builtin_function_2 (const char *builtin_name
, const char *name
,
3547 tree builtin_type
, tree type
, int function_code
,
3548 enum built_in_class
class, int library_name_p
,
3549 int nonansi_p
, tree attrs
)
3551 tree bdecl
= NULL_TREE
;
3552 tree decl
= NULL_TREE
;
3554 if (builtin_name
!= 0)
3555 bdecl
= builtin_function (builtin_name
, builtin_type
, function_code
,
3556 class, library_name_p
? name
: NULL
, attrs
);
3558 if (name
!= 0 && !flag_no_builtin
&& !builtin_function_disabled_p (name
)
3559 && !(nonansi_p
&& flag_no_nonansi_builtin
))
3560 decl
= builtin_function (name
, type
, function_code
, class, NULL
, attrs
);
3562 return (bdecl
!= 0 ? bdecl
: decl
);
3565 /* Nonzero if the type T promotes to int. This is (nearly) the
3566 integral promotions defined in ISO C99 6.3.1.1/2. */
3569 c_promoting_integer_type_p (tree t
)
3571 switch (TREE_CODE (t
))
3574 return (TYPE_MAIN_VARIANT (t
) == char_type_node
3575 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
3576 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
3577 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
3578 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
3579 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
3582 /* ??? Technically all enumerations not larger than an int
3583 promote to an int. But this is used along code paths
3584 that only want to notice a size change. */
3585 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
3595 /* Return 1 if PARMS specifies a fixed number of parameters
3596 and none of their types is affected by default promotions. */
3599 self_promoting_args_p (tree parms
)
3602 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
3604 tree type
= TREE_VALUE (t
);
3606 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
3612 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
3615 if (c_promoting_integer_type_p (type
))
3621 /* Recursively examines the array elements of TYPE, until a non-array
3622 element type is found. */
3625 strip_array_types (tree type
)
3627 while (TREE_CODE (type
) == ARRAY_TYPE
)
3628 type
= TREE_TYPE (type
);
3633 /* Recursively remove any '*' or '&' operator from TYPE. */
3635 strip_pointer_operator (tree t
)
3637 while (POINTER_TYPE_P (t
))
3642 static tree
expand_unordered_cmp (tree
, tree
, enum tree_code
, enum tree_code
);
3644 /* Expand a call to an unordered comparison function such as
3645 __builtin_isgreater(). FUNCTION is the function's declaration and
3646 PARAMS a list of the values passed. For __builtin_isunordered(),
3647 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3648 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3649 that give the opposite of the desired result. UNORDERED_CODE is
3650 used for modes that can hold NaNs and ORDERED_CODE is used for the
3654 expand_unordered_cmp (tree function
, tree params
,
3655 enum tree_code unordered_code
,
3656 enum tree_code ordered_code
)
3658 tree arg0
, arg1
, type
;
3659 enum tree_code code0
, code1
;
3661 /* Check that we have exactly two arguments. */
3662 if (params
== 0 || TREE_CHAIN (params
) == 0)
3664 error ("too few arguments to function `%s'",
3665 IDENTIFIER_POINTER (DECL_NAME (function
)));
3666 return error_mark_node
;
3668 else if (TREE_CHAIN (TREE_CHAIN (params
)) != 0)
3670 error ("too many arguments to function `%s'",
3671 IDENTIFIER_POINTER (DECL_NAME (function
)));
3672 return error_mark_node
;
3675 arg0
= TREE_VALUE (params
);
3676 arg1
= TREE_VALUE (TREE_CHAIN (params
));
3678 code0
= TREE_CODE (TREE_TYPE (arg0
));
3679 code1
= TREE_CODE (TREE_TYPE (arg1
));
3681 /* Make sure that the arguments have a common type of REAL. */
3683 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3684 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3685 type
= common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
));
3687 if (type
== 0 || TREE_CODE (type
) != REAL_TYPE
)
3689 error ("non-floating-point argument to function `%s'",
3690 IDENTIFIER_POINTER (DECL_NAME (function
)));
3691 return error_mark_node
;
3694 if (unordered_code
== UNORDERED_EXPR
)
3696 if (MODE_HAS_NANS (TYPE_MODE (type
)))
3697 return build_binary_op (unordered_code
,
3698 convert (type
, arg0
),
3699 convert (type
, arg1
),
3702 return integer_zero_node
;
3705 return build_unary_op (TRUTH_NOT_EXPR
,
3706 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type
))
3709 convert (type
, arg0
),
3710 convert (type
, arg1
),
3716 /* Recognize certain built-in functions so we can make tree-codes
3717 other than CALL_EXPR. We do this when it enables fold-const.c
3718 to do something useful. */
3719 /* ??? By rights this should go in builtins.c, but only C and C++
3720 implement build_{binary,unary}_op. Not exactly sure what bits
3721 of functionality are actually needed from those functions, or
3722 where the similar functionality exists in the other front ends. */
3725 expand_tree_builtin (tree function
, tree params
, tree coerced_params
)
3727 if (DECL_BUILT_IN_CLASS (function
) != BUILT_IN_NORMAL
)
3730 switch (DECL_FUNCTION_CODE (function
))
3734 case BUILT_IN_LLABS
:
3735 case BUILT_IN_IMAXABS
:
3737 case BUILT_IN_FABSL
:
3738 case BUILT_IN_FABSF
:
3739 if (coerced_params
== 0)
3740 return integer_zero_node
;
3741 return build_unary_op (ABS_EXPR
, TREE_VALUE (coerced_params
), 0);
3744 case BUILT_IN_CONJF
:
3745 case BUILT_IN_CONJL
:
3746 if (coerced_params
== 0)
3747 return integer_zero_node
;
3748 return build_unary_op (CONJ_EXPR
, TREE_VALUE (coerced_params
), 0);
3750 case BUILT_IN_CREAL
:
3751 case BUILT_IN_CREALF
:
3752 case BUILT_IN_CREALL
:
3753 if (coerced_params
== 0)
3754 return integer_zero_node
;
3755 return non_lvalue (build_unary_op (REALPART_EXPR
,
3756 TREE_VALUE (coerced_params
), 0));
3758 case BUILT_IN_CIMAG
:
3759 case BUILT_IN_CIMAGF
:
3760 case BUILT_IN_CIMAGL
:
3761 if (coerced_params
== 0)
3762 return integer_zero_node
;
3763 return non_lvalue (build_unary_op (IMAGPART_EXPR
,
3764 TREE_VALUE (coerced_params
), 0));
3766 case BUILT_IN_ISGREATER
:
3767 return expand_unordered_cmp (function
, params
, UNLE_EXPR
, LE_EXPR
);
3769 case BUILT_IN_ISGREATEREQUAL
:
3770 return expand_unordered_cmp (function
, params
, UNLT_EXPR
, LT_EXPR
);
3772 case BUILT_IN_ISLESS
:
3773 return expand_unordered_cmp (function
, params
, UNGE_EXPR
, GE_EXPR
);
3775 case BUILT_IN_ISLESSEQUAL
:
3776 return expand_unordered_cmp (function
, params
, UNGT_EXPR
, GT_EXPR
);
3778 case BUILT_IN_ISLESSGREATER
:
3779 return expand_unordered_cmp (function
, params
, UNEQ_EXPR
, EQ_EXPR
);
3781 case BUILT_IN_ISUNORDERED
:
3782 return expand_unordered_cmp (function
, params
, UNORDERED_EXPR
, NOP_EXPR
);
3791 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3792 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3793 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3794 value, the traversal is aborted, and the value returned by FUNC is
3795 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3796 the node being visited are not walked.
3798 We don't need a without_duplicates variant of this one because the
3799 statement tree is a tree, not a graph. */
3802 walk_stmt_tree (tree
*tp
, walk_tree_fn func
, void *data
)
3804 enum tree_code code
;
3809 #define WALK_SUBTREE(NODE) \
3812 result = walk_stmt_tree (&(NODE), func, data); \
3818 /* Skip empty subtrees. */
3822 /* Skip subtrees below non-statement nodes. */
3823 if (!STATEMENT_CODE_P (TREE_CODE (*tp
)))
3826 /* Call the function. */
3828 result
= (*func
) (tp
, &walk_subtrees
, data
);
3830 /* If we found something, return it. */
3834 /* FUNC may have modified the tree, recheck that we're looking at a
3836 code
= TREE_CODE (*tp
);
3837 if (!STATEMENT_CODE_P (code
))
3840 /* Visit the subtrees unless FUNC decided that there was nothing
3841 interesting below this point in the tree. */
3844 /* Walk over all the sub-trees of this operand. Statement nodes
3845 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3846 len
= TREE_CODE_LENGTH (code
);
3848 /* Go through the subtrees. We need to do this in forward order so
3849 that the scope of a FOR_EXPR is handled properly. */
3850 for (i
= 0; i
< len
; ++i
)
3851 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
3854 /* Finally visit the chain. This can be tail-recursion optimized if
3855 we write it this way. */
3856 return walk_stmt_tree (&TREE_CHAIN (*tp
), func
, data
);
3861 /* Used to compare case labels. K1 and K2 are actually tree nodes
3862 representing case labels, or NULL_TREE for a `default' label.
3863 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3864 K2, and 0 if K1 and K2 are equal. */
3867 case_compare (splay_tree_key k1
, splay_tree_key k2
)
3869 /* Consider a NULL key (such as arises with a `default' label) to be
3870 smaller than anything else. */
3876 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
3879 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3880 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3881 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3882 case label was declared using the usual C/C++ syntax, rather than
3883 the GNU case range extension. CASES is a tree containing all the
3884 case ranges processed so far; COND is the condition for the
3885 switch-statement itself. Returns the CASE_LABEL created, or
3886 ERROR_MARK_NODE if no CASE_LABEL is created. */
3889 c_add_case_label (splay_tree cases
, tree cond
, tree low_value
,
3895 splay_tree_node node
;
3897 /* Create the LABEL_DECL itself. */
3898 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
3899 DECL_CONTEXT (label
) = current_function_decl
;
3901 /* If there was an error processing the switch condition, bail now
3902 before we get more confused. */
3903 if (!cond
|| cond
== error_mark_node
)
3905 /* Add a label anyhow so that the back-end doesn't think that
3906 the beginning of the switch is unreachable. */
3908 add_stmt (build_case_label (NULL_TREE
, NULL_TREE
, label
));
3909 return error_mark_node
;
3912 if ((low_value
&& TREE_TYPE (low_value
)
3913 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
3914 || (high_value
&& TREE_TYPE (high_value
)
3915 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
3916 error ("pointers are not permitted as case values");
3918 /* Case ranges are a GNU extension. */
3919 if (high_value
&& pedantic
)
3920 pedwarn ("range expressions in switch statements are non-standard");
3922 type
= TREE_TYPE (cond
);
3925 low_value
= check_case_value (low_value
);
3926 low_value
= convert_and_check (type
, low_value
);
3930 high_value
= check_case_value (high_value
);
3931 high_value
= convert_and_check (type
, high_value
);
3934 /* If an error has occurred, bail out now. */
3935 if (low_value
== error_mark_node
|| high_value
== error_mark_node
)
3938 add_stmt (build_case_label (NULL_TREE
, NULL_TREE
, label
));
3939 return error_mark_node
;
3942 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3943 really a case range, even though it was written that way. Remove
3944 the HIGH_VALUE to simplify later processing. */
3945 if (tree_int_cst_equal (low_value
, high_value
))
3946 high_value
= NULL_TREE
;
3947 if (low_value
&& high_value
3948 && !tree_int_cst_lt (low_value
, high_value
))
3949 warning ("empty range specified");
3951 /* Look up the LOW_VALUE in the table of case labels we already
3953 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
3954 /* If there was not an exact match, check for overlapping ranges.
3955 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3956 that's a `default' label and the only overlap is an exact match. */
3957 if (!node
&& (low_value
|| high_value
))
3959 splay_tree_node low_bound
;
3960 splay_tree_node high_bound
;
3962 /* Even though there wasn't an exact match, there might be an
3963 overlap between this case range and another case range.
3964 Since we've (inductively) not allowed any overlapping case
3965 ranges, we simply need to find the greatest low case label
3966 that is smaller that LOW_VALUE, and the smallest low case
3967 label that is greater than LOW_VALUE. If there is an overlap
3968 it will occur in one of these two ranges. */
3969 low_bound
= splay_tree_predecessor (cases
,
3970 (splay_tree_key
) low_value
);
3971 high_bound
= splay_tree_successor (cases
,
3972 (splay_tree_key
) low_value
);
3974 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3975 the LOW_VALUE, so there is no need to check unless the
3976 LOW_BOUND is in fact itself a case range. */
3978 && CASE_HIGH ((tree
) low_bound
->value
)
3979 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
3982 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3983 range is bigger than the low end of the current range, so we
3984 are only interested if the current range is a real range, and
3985 not an ordinary case label. */
3988 && (tree_int_cst_compare ((tree
) high_bound
->key
,
3993 /* If there was an overlap, issue an error. */
3996 tree duplicate
= CASE_LABEL_DECL ((tree
) node
->value
);
4000 error ("duplicate (or overlapping) case value");
4001 error ("%Jthis is the first entry overlapping that value", duplicate
);
4005 error ("duplicate case value") ;
4006 error ("%Jpreviously used here", duplicate
);
4010 error ("multiple default labels in one switch");
4011 error ("%Jthis is the first default label", duplicate
);
4014 add_stmt (build_case_label (NULL_TREE
, NULL_TREE
, label
));
4017 /* Add a CASE_LABEL to the statement-tree. */
4018 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
4019 /* Register this case label in the splay tree. */
4020 splay_tree_insert (cases
,
4021 (splay_tree_key
) low_value
,
4022 (splay_tree_value
) case_label
);
4027 /* Finish an expression taking the address of LABEL (an
4028 IDENTIFIER_NODE). Returns an expression for the address. */
4031 finish_label_address_expr (tree label
)
4036 pedwarn ("taking the address of a label is non-standard");
4038 if (label
== error_mark_node
)
4039 return error_mark_node
;
4041 label
= lookup_label (label
);
4042 if (label
== NULL_TREE
)
4043 result
= null_pointer_node
;
4046 TREE_USED (label
) = 1;
4047 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
4048 TREE_CONSTANT (result
) = 1;
4049 /* The current function in not necessarily uninlinable.
4050 Computed gotos are incompatible with inlining, but the value
4051 here could be used only in a diagnostic, for example. */
4057 /* Hook used by expand_expr to expand language-specific tree codes. */
4060 c_expand_expr (tree exp
, rtx target
, enum machine_mode tmode
, int modifier
)
4061 /* Actually enum_modifier. */
4063 switch (TREE_CODE (exp
))
4069 bool preserve_result
= false;
4070 bool return_target
= false;
4072 if (STMT_EXPR_WARN_UNUSED_RESULT (exp
) && target
== const0_rtx
)
4074 tree stmt
= STMT_EXPR_STMT (exp
);
4077 for (scope
= COMPOUND_BODY (stmt
);
4078 scope
&& TREE_CODE (scope
) != SCOPE_STMT
;
4079 scope
= TREE_CHAIN (scope
));
4081 if (scope
&& SCOPE_STMT_BLOCK (scope
))
4082 warning ("%Hignoring return value of `%D', "
4083 "declared with attribute warn_unused_result",
4084 &expr_wfl_stack
->location
,
4085 BLOCK_ABSTRACT_ORIGIN (SCOPE_STMT_BLOCK (scope
)));
4087 warning ("%Hignoring return value of function "
4088 "declared with attribute warn_unused_result",
4089 &expr_wfl_stack
->location
);
4092 /* Since expand_expr_stmt calls free_temp_slots after every
4093 expression statement, we must call push_temp_slots here.
4094 Otherwise, any temporaries in use now would be considered
4095 out-of-scope after the first EXPR_STMT from within the
4098 rtl_expr
= expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp
));
4100 /* If we want the result of this expression, find the last
4101 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
4102 if (target
!= const0_rtx
4103 && TREE_CODE (STMT_EXPR_STMT (exp
)) == COMPOUND_STMT
4104 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp
))) == SCOPE_STMT
)
4106 tree expr
= COMPOUND_BODY (STMT_EXPR_STMT (exp
));
4107 tree last
= TREE_CHAIN (expr
);
4109 while (TREE_CHAIN (last
))
4112 last
= TREE_CHAIN (last
);
4115 if (TREE_CODE (last
) == SCOPE_STMT
4116 && TREE_CODE (expr
) == EXPR_STMT
)
4118 if (target
&& TREE_CODE (EXPR_STMT_EXPR (expr
)) == VAR_DECL
4119 && DECL_RTL_IF_SET (EXPR_STMT_EXPR (expr
)) == target
)
4120 /* If the last expression is a variable whose RTL is the
4121 same as our target, just return the target; if it
4122 isn't valid expanding the decl would produce different
4123 RTL, and store_expr would try to do a copy. */
4124 return_target
= true;
4127 /* Otherwise, note that we want the value from the last
4129 TREE_ADDRESSABLE (expr
) = 1;
4130 preserve_result
= true;
4135 expand_stmt (STMT_EXPR_STMT (exp
));
4136 expand_end_stmt_expr (rtl_expr
);
4138 result
= expand_expr (rtl_expr
, target
, tmode
, modifier
);
4141 else if (preserve_result
&& GET_CODE (result
) == MEM
)
4143 if (GET_MODE (result
) != BLKmode
)
4144 result
= copy_to_reg (result
);
4146 preserve_temp_slots (result
);
4149 /* If the statment-expression does not have a scope, then the
4150 new temporaries we created within it must live beyond the
4151 statement-expression. */
4152 if (STMT_EXPR_NO_SCOPE (exp
))
4153 preserve_temp_slots (NULL_RTX
);
4160 case COMPOUND_LITERAL_EXPR
:
4162 /* Initialize the anonymous variable declared in the compound
4163 literal, then return the variable. */
4164 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
4165 emit_local_var (decl
);
4166 return expand_expr (decl
, target
, tmode
, modifier
);
4177 /* Hook used by safe_from_p to handle language-specific tree codes. */
4180 c_safe_from_p (rtx target
, tree exp
)
4182 /* We can see statements here when processing the body of a
4183 statement-expression. For a declaration statement declaring a
4184 variable, look at the variable's initializer. */
4185 if (TREE_CODE (exp
) == DECL_STMT
)
4187 tree decl
= DECL_STMT_DECL (exp
);
4189 if (TREE_CODE (decl
) == VAR_DECL
4190 && DECL_INITIAL (decl
)
4191 && !safe_from_p (target
, DECL_INITIAL (decl
), /*top_p=*/0))
4195 /* For any statement, we must follow the statement-chain. */
4196 if (STATEMENT_CODE_P (TREE_CODE (exp
)) && TREE_CHAIN (exp
))
4197 return safe_from_p (target
, TREE_CHAIN (exp
), /*top_p=*/0);
4199 /* Assume everything else is safe. */
4203 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4206 c_common_unsafe_for_reeval (tree exp
)
4208 /* Statement expressions may not be reevaluated, likewise compound
4210 if (TREE_CODE (exp
) == STMT_EXPR
4211 || TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
)
4214 /* Walk all other expressions. */
4218 /* Hook used by staticp to handle language-specific tree codes. */
4221 c_staticp (tree exp
)
4223 if (TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
4224 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
)))
4230 /* Given a boolean expression ARG, return a tree representing an increment
4231 or decrement (as indicated by CODE) of ARG. The front end must check for
4232 invalid cases (e.g., decrement in C++). */
4234 boolean_increment (enum tree_code code
, tree arg
)
4237 tree true_res
= boolean_true_node
;
4239 arg
= stabilize_reference (arg
);
4242 case PREINCREMENT_EXPR
:
4243 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4245 case POSTINCREMENT_EXPR
:
4246 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4247 arg
= save_expr (arg
);
4248 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4249 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4251 case PREDECREMENT_EXPR
:
4252 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, invert_truthvalue (arg
));
4254 case POSTDECREMENT_EXPR
:
4255 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, invert_truthvalue (arg
));
4256 arg
= save_expr (arg
);
4257 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4258 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4263 TREE_SIDE_EFFECTS (val
) = 1;
4267 /* Built-in macros for stddef.h, that require macros defined in this
4270 c_stddef_cpp_builtins(void)
4272 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
4273 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
4274 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
4275 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
4279 c_init_attributes (void)
4281 /* Fill in the built_in_attributes array. */
4282 #define DEF_ATTR_NULL_TREE(ENUM) \
4283 built_in_attributes[(int) ENUM] = NULL_TREE;
4284 #define DEF_ATTR_INT(ENUM, VALUE) \
4285 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4286 #define DEF_ATTR_IDENT(ENUM, STRING) \
4287 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4288 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4289 built_in_attributes[(int) ENUM] \
4290 = tree_cons (built_in_attributes[(int) PURPOSE], \
4291 built_in_attributes[(int) VALUE], \
4292 built_in_attributes[(int) CHAIN]);
4293 #include "builtin-attrs.def"
4294 #undef DEF_ATTR_NULL_TREE
4296 #undef DEF_ATTR_IDENT
4297 #undef DEF_ATTR_TREE_LIST
4300 /* Output a -Wshadow warning MSGCODE about NAME, and give the location
4301 of the previous declaration DECL. */
4303 shadow_warning (enum sw_kind msgcode
, const char *name
, tree decl
)
4305 static const char *const msgs
[] = {
4306 /* SW_PARAM */ N_("declaration of \"%s\" shadows a parameter"),
4307 /* SW_LOCAL */ N_("declaration of \"%s\" shadows a previous local"),
4308 /* SW_GLOBAL */ N_("declaration of \"%s\" shadows a global declaration")
4311 warning (msgs
[msgcode
], name
);
4312 warning ("%Jshadowed declaration is here", decl
);
4315 /* Attribute handlers common to C front ends. */
4317 /* Handle a "packed" attribute; arguments as in
4318 struct attribute_spec.handler. */
4321 handle_packed_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
4322 int flags
, bool *no_add_attrs
)
4326 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4327 *node
= build_type_copy (*node
);
4328 TYPE_PACKED (*node
) = 1;
4329 if (TYPE_MAIN_VARIANT (*node
) == *node
)
4331 /* If it is the main variant, then pack the other variants
4332 too. This happens in,
4335 struct Foo const *ptr; // creates a variant w/o packed flag
4336 } __ attribute__((packed)); // packs it now.
4340 for (probe
= *node
; probe
; probe
= TYPE_NEXT_VARIANT (probe
))
4341 TYPE_PACKED (probe
) = 1;
4345 else if (TREE_CODE (*node
) == FIELD_DECL
)
4346 DECL_PACKED (*node
) = 1;
4347 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4348 used for DECL_REGISTER. It wouldn't mean anything anyway.
4349 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4350 that changes what the typedef is typing. */
4353 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4354 *no_add_attrs
= true;
4360 /* Handle a "nocommon" attribute; arguments as in
4361 struct attribute_spec.handler. */
4364 handle_nocommon_attribute (tree
*node
, tree name
,
4365 tree args ATTRIBUTE_UNUSED
,
4366 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4368 if (TREE_CODE (*node
) == VAR_DECL
)
4369 DECL_COMMON (*node
) = 0;
4372 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4373 *no_add_attrs
= true;
4379 /* Handle a "common" attribute; arguments as in
4380 struct attribute_spec.handler. */
4383 handle_common_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
4384 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4386 if (TREE_CODE (*node
) == VAR_DECL
)
4387 DECL_COMMON (*node
) = 1;
4390 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4391 *no_add_attrs
= true;
4397 /* Handle a "noreturn" attribute; arguments as in
4398 struct attribute_spec.handler. */
4401 handle_noreturn_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
4402 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4404 tree type
= TREE_TYPE (*node
);
4406 /* See FIXME comment in c_common_attribute_table. */
4407 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4408 TREE_THIS_VOLATILE (*node
) = 1;
4409 else if (TREE_CODE (type
) == POINTER_TYPE
4410 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4412 = build_pointer_type
4413 (build_type_variant (TREE_TYPE (type
),
4414 TREE_READONLY (TREE_TYPE (type
)), 1));
4417 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4418 *no_add_attrs
= true;
4424 /* Handle a "noinline" attribute; arguments as in
4425 struct attribute_spec.handler. */
4428 handle_noinline_attribute (tree
*node
, tree name
,
4429 tree args ATTRIBUTE_UNUSED
,
4430 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4432 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4433 DECL_UNINLINABLE (*node
) = 1;
4436 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4437 *no_add_attrs
= true;
4443 /* Handle a "always_inline" attribute; arguments as in
4444 struct attribute_spec.handler. */
4447 handle_always_inline_attribute (tree
*node
, tree name
,
4448 tree args ATTRIBUTE_UNUSED
,
4449 int flags ATTRIBUTE_UNUSED
,
4452 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4454 /* Do nothing else, just set the attribute. We'll get at
4455 it later with lookup_attribute. */
4459 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4460 *no_add_attrs
= true;
4466 /* Handle a "used" attribute; arguments as in
4467 struct attribute_spec.handler. */
4470 handle_used_attribute (tree
*pnode
, tree name
, tree args ATTRIBUTE_UNUSED
,
4471 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4475 if (TREE_CODE (node
) == FUNCTION_DECL
4476 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
)))
4478 TREE_USED (node
) = 1;
4482 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4483 *no_add_attrs
= true;
4489 /* Handle a "unused" attribute; arguments as in
4490 struct attribute_spec.handler. */
4493 handle_unused_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
4494 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4500 if (TREE_CODE (decl
) == PARM_DECL
4501 || TREE_CODE (decl
) == VAR_DECL
4502 || TREE_CODE (decl
) == FUNCTION_DECL
4503 || TREE_CODE (decl
) == LABEL_DECL
4504 || TREE_CODE (decl
) == TYPE_DECL
)
4505 TREE_USED (decl
) = 1;
4508 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4509 *no_add_attrs
= true;
4514 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4515 *node
= build_type_copy (*node
);
4516 TREE_USED (*node
) = 1;
4522 /* Handle a "const" attribute; arguments as in
4523 struct attribute_spec.handler. */
4526 handle_const_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
4527 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4529 tree type
= TREE_TYPE (*node
);
4531 /* See FIXME comment on noreturn in c_common_attribute_table. */
4532 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4533 TREE_READONLY (*node
) = 1;
4534 else if (TREE_CODE (type
) == POINTER_TYPE
4535 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4537 = build_pointer_type
4538 (build_type_variant (TREE_TYPE (type
), 1,
4539 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
4542 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4543 *no_add_attrs
= true;
4549 /* Handle a "transparent_union" attribute; arguments as in
4550 struct attribute_spec.handler. */
4553 handle_transparent_union_attribute (tree
*node
, tree name
,
4554 tree args ATTRIBUTE_UNUSED
, int flags
,
4557 tree decl
= NULL_TREE
;
4564 type
= &TREE_TYPE (decl
);
4565 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
4567 else if (TYPE_P (*node
))
4568 type
= node
, is_type
= 1;
4571 && TREE_CODE (*type
) == UNION_TYPE
4573 || (TYPE_FIELDS (*type
) != 0
4574 && TYPE_MODE (*type
) == DECL_MODE (TYPE_FIELDS (*type
)))))
4576 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4577 *type
= build_type_copy (*type
);
4578 TYPE_TRANSPARENT_UNION (*type
) = 1;
4580 else if (decl
!= 0 && TREE_CODE (decl
) == PARM_DECL
4581 && TREE_CODE (*type
) == UNION_TYPE
4582 && TYPE_MODE (*type
) == DECL_MODE (TYPE_FIELDS (*type
)))
4583 DECL_TRANSPARENT_UNION (decl
) = 1;
4586 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4587 *no_add_attrs
= true;
4593 /* Handle a "constructor" attribute; arguments as in
4594 struct attribute_spec.handler. */
4597 handle_constructor_attribute (tree
*node
, tree name
,
4598 tree args ATTRIBUTE_UNUSED
,
4599 int flags ATTRIBUTE_UNUSED
,
4603 tree type
= TREE_TYPE (decl
);
4605 if (TREE_CODE (decl
) == FUNCTION_DECL
4606 && TREE_CODE (type
) == FUNCTION_TYPE
4607 && decl_function_context (decl
) == 0)
4609 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
4610 TREE_USED (decl
) = 1;
4614 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4615 *no_add_attrs
= true;
4621 /* Handle a "destructor" attribute; arguments as in
4622 struct attribute_spec.handler. */
4625 handle_destructor_attribute (tree
*node
, tree name
,
4626 tree args ATTRIBUTE_UNUSED
,
4627 int flags ATTRIBUTE_UNUSED
,
4631 tree type
= TREE_TYPE (decl
);
4633 if (TREE_CODE (decl
) == FUNCTION_DECL
4634 && TREE_CODE (type
) == FUNCTION_TYPE
4635 && decl_function_context (decl
) == 0)
4637 DECL_STATIC_DESTRUCTOR (decl
) = 1;
4638 TREE_USED (decl
) = 1;
4642 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4643 *no_add_attrs
= true;
4649 /* Handle a "mode" attribute; arguments as in
4650 struct attribute_spec.handler. */
4653 handle_mode_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
4654 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4658 *no_add_attrs
= true;
4660 if (TREE_CODE (TREE_VALUE (args
)) != IDENTIFIER_NODE
)
4661 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4665 const char *p
= IDENTIFIER_POINTER (TREE_VALUE (args
));
4666 int len
= strlen (p
);
4667 enum machine_mode mode
= VOIDmode
;
4671 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
4672 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
4674 char *newp
= alloca (len
- 1);
4676 strcpy (newp
, &p
[2]);
4677 newp
[len
- 4] = '\0';
4681 /* Change this type to have a type with the specified mode.
4682 First check for the special modes. */
4683 if (! strcmp (p
, "byte"))
4685 else if (!strcmp (p
, "word"))
4687 else if (! strcmp (p
, "pointer"))
4690 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
4691 if (!strcmp (p
, GET_MODE_NAME (j
)))
4692 mode
= (enum machine_mode
) j
;
4694 if (mode
== VOIDmode
)
4695 error ("unknown machine mode `%s'", p
);
4696 else if (0 == (typefm
= (*lang_hooks
.types
.type_for_mode
)
4697 (mode
, TREE_UNSIGNED (type
))))
4698 error ("no data type for mode `%s'", p
);
4699 else if ((TREE_CODE (type
) == POINTER_TYPE
4700 || TREE_CODE (type
) == REFERENCE_TYPE
)
4701 && !(*targetm
.valid_pointer_mode
) (mode
))
4702 error ("invalid pointer mode `%s'", p
);
4705 /* If this is a vector, make sure we either have hardware
4706 support, or we can emulate it. */
4707 if (VECTOR_MODE_P (mode
) && !vector_mode_valid_p (mode
))
4709 error ("unable to emulate '%s'", GET_MODE_NAME (mode
));
4713 if (TREE_CODE (type
) == POINTER_TYPE
)
4715 ptr_type
= build_pointer_type_for_mode (TREE_TYPE (type
),
4719 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
4721 ptr_type
= build_reference_type_for_mode (TREE_TYPE (type
),
4727 /* No need to layout the type here. The caller should do this. */
4734 /* Handle a "section" attribute; arguments as in
4735 struct attribute_spec.handler. */
4738 handle_section_attribute (tree
*node
, tree name ATTRIBUTE_UNUSED
, tree args
,
4739 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4743 if (targetm
.have_named_sections
)
4745 if ((TREE_CODE (decl
) == FUNCTION_DECL
4746 || TREE_CODE (decl
) == VAR_DECL
)
4747 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
4749 if (TREE_CODE (decl
) == VAR_DECL
4750 && current_function_decl
!= NULL_TREE
4751 && ! TREE_STATIC (decl
))
4753 error ("%Jsection attribute cannot be specified for "
4754 "local variables", decl
);
4755 *no_add_attrs
= true;
4758 /* The decl may have already been given a section attribute
4759 from a previous declaration. Ensure they match. */
4760 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
4761 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
4762 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
4764 error ("%Jsection of '%D' conflicts with previous declaration",
4766 *no_add_attrs
= true;
4769 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
4773 error ("%Jsection attribute not allowed for '%D'", *node
, *node
);
4774 *no_add_attrs
= true;
4779 error ("%Jsection attributes are not supported for this target", *node
);
4780 *no_add_attrs
= true;
4786 /* Handle a "aligned" attribute; arguments as in
4787 struct attribute_spec.handler. */
4790 handle_aligned_attribute (tree
*node
, tree name ATTRIBUTE_UNUSED
, tree args
,
4791 int flags
, bool *no_add_attrs
)
4793 tree decl
= NULL_TREE
;
4796 tree align_expr
= (args
? TREE_VALUE (args
)
4797 : size_int (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
4803 type
= &TREE_TYPE (decl
);
4804 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
4806 else if (TYPE_P (*node
))
4807 type
= node
, is_type
= 1;
4809 /* Strip any NOPs of any kind. */
4810 while (TREE_CODE (align_expr
) == NOP_EXPR
4811 || TREE_CODE (align_expr
) == CONVERT_EXPR
4812 || TREE_CODE (align_expr
) == NON_LVALUE_EXPR
)
4813 align_expr
= TREE_OPERAND (align_expr
, 0);
4815 if (TREE_CODE (align_expr
) != INTEGER_CST
)
4817 error ("requested alignment is not a constant");
4818 *no_add_attrs
= true;
4820 else if ((i
= tree_log2 (align_expr
)) == -1)
4822 error ("requested alignment is not a power of 2");
4823 *no_add_attrs
= true;
4825 else if (i
> HOST_BITS_PER_INT
- 2)
4827 error ("requested alignment is too large");
4828 *no_add_attrs
= true;
4832 /* If we have a TYPE_DECL, then copy the type, so that we
4833 don't accidentally modify a builtin type. See pushdecl. */
4834 if (decl
&& TREE_TYPE (decl
) != error_mark_node
4835 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
4837 tree tt
= TREE_TYPE (decl
);
4838 *type
= build_type_copy (*type
);
4839 DECL_ORIGINAL_TYPE (decl
) = tt
;
4840 TYPE_NAME (*type
) = decl
;
4841 TREE_USED (*type
) = TREE_USED (decl
);
4842 TREE_TYPE (decl
) = *type
;
4844 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4845 *type
= build_type_copy (*type
);
4847 TYPE_ALIGN (*type
) = (1 << i
) * BITS_PER_UNIT
;
4848 TYPE_USER_ALIGN (*type
) = 1;
4850 else if (TREE_CODE (decl
) != VAR_DECL
4851 && TREE_CODE (decl
) != FIELD_DECL
)
4853 error ("%Jalignment may not be specified for '%D'", decl
, decl
);
4854 *no_add_attrs
= true;
4858 DECL_ALIGN (decl
) = (1 << i
) * BITS_PER_UNIT
;
4859 DECL_USER_ALIGN (decl
) = 1;
4865 /* Handle a "weak" attribute; arguments as in
4866 struct attribute_spec.handler. */
4869 handle_weak_attribute (tree
*node
, tree name ATTRIBUTE_UNUSED
,
4870 tree args ATTRIBUTE_UNUSED
,
4871 int flags ATTRIBUTE_UNUSED
,
4872 bool *no_add_attrs ATTRIBUTE_UNUSED
)
4874 declare_weak (*node
);
4879 /* Handle an "alias" attribute; arguments as in
4880 struct attribute_spec.handler. */
4883 handle_alias_attribute (tree
*node
, tree name
, tree args
,
4884 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4888 if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
4889 || (TREE_CODE (decl
) != FUNCTION_DECL
&& ! DECL_EXTERNAL (decl
)))
4891 error ("%J'%D' defined both normally and as an alias", decl
, decl
);
4892 *no_add_attrs
= true;
4894 else if (decl_function_context (decl
) == 0)
4898 id
= TREE_VALUE (args
);
4899 if (TREE_CODE (id
) != STRING_CST
)
4901 error ("alias arg not a string");
4902 *no_add_attrs
= true;
4905 id
= get_identifier (TREE_STRING_POINTER (id
));
4906 /* This counts as a use of the object pointed to. */
4909 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4910 DECL_INITIAL (decl
) = error_mark_node
;
4912 DECL_EXTERNAL (decl
) = 0;
4916 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4917 *no_add_attrs
= true;
4923 /* Handle an "visibility" attribute; arguments as in
4924 struct attribute_spec.handler. */
4927 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
4928 int flags ATTRIBUTE_UNUSED
,
4932 tree id
= TREE_VALUE (args
);
4934 *no_add_attrs
= true;
4936 if (decl_function_context (decl
) != 0 || ! TREE_PUBLIC (decl
))
4938 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4942 if (TREE_CODE (id
) != STRING_CST
)
4944 error ("visibility arg not a string");
4948 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
4949 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
4950 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
4951 DECL_VISIBILITY (decl
) = VISIBILITY_INTERNAL
;
4952 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
4953 DECL_VISIBILITY (decl
) = VISIBILITY_HIDDEN
;
4954 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
4955 DECL_VISIBILITY (decl
) = VISIBILITY_PROTECTED
;
4957 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4962 /* Handle an "tls_model" attribute; arguments as in
4963 struct attribute_spec.handler. */
4966 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
4967 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4971 if (! DECL_THREAD_LOCAL (decl
))
4973 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4974 *no_add_attrs
= true;
4980 id
= TREE_VALUE (args
);
4981 if (TREE_CODE (id
) != STRING_CST
)
4983 error ("tls_model arg not a string");
4984 *no_add_attrs
= true;
4987 if (strcmp (TREE_STRING_POINTER (id
), "local-exec")
4988 && strcmp (TREE_STRING_POINTER (id
), "initial-exec")
4989 && strcmp (TREE_STRING_POINTER (id
), "local-dynamic")
4990 && strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
4992 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4993 *no_add_attrs
= true;
5001 /* Handle a "no_instrument_function" attribute; arguments as in
5002 struct attribute_spec.handler. */
5005 handle_no_instrument_function_attribute (tree
*node
, tree name
,
5006 tree args ATTRIBUTE_UNUSED
,
5007 int flags ATTRIBUTE_UNUSED
,
5012 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5014 error ("%J'%E' attribute applies only to functions", decl
, name
);
5015 *no_add_attrs
= true;
5017 else if (DECL_INITIAL (decl
))
5019 error ("%Jcan't set '%E' attribute after definition", decl
, name
);
5020 *no_add_attrs
= true;
5023 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
5028 /* Handle a "malloc" attribute; arguments as in
5029 struct attribute_spec.handler. */
5032 handle_malloc_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
5033 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
5035 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5036 DECL_IS_MALLOC (*node
) = 1;
5037 /* ??? TODO: Support types. */
5040 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5041 *no_add_attrs
= true;
5047 /* Handle a "no_limit_stack" attribute; arguments as in
5048 struct attribute_spec.handler. */
5051 handle_no_limit_stack_attribute (tree
*node
, tree name
,
5052 tree args ATTRIBUTE_UNUSED
,
5053 int flags ATTRIBUTE_UNUSED
,
5058 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5060 error ("%J'%E' attribute applies only to functions", decl
, name
);
5061 *no_add_attrs
= true;
5063 else if (DECL_INITIAL (decl
))
5065 error ("%Jcan't set '%E' attribute after definition", decl
, name
);
5066 *no_add_attrs
= true;
5069 DECL_NO_LIMIT_STACK (decl
) = 1;
5074 /* Handle a "pure" attribute; arguments as in
5075 struct attribute_spec.handler. */
5078 handle_pure_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
5079 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
5081 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5082 DECL_IS_PURE (*node
) = 1;
5083 /* ??? TODO: Support types. */
5086 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5087 *no_add_attrs
= true;
5093 /* Handle a "deprecated" attribute; arguments as in
5094 struct attribute_spec.handler. */
5097 handle_deprecated_attribute (tree
*node
, tree name
,
5098 tree args ATTRIBUTE_UNUSED
, int flags
,
5101 tree type
= NULL_TREE
;
5103 const char *what
= NULL
;
5108 type
= TREE_TYPE (decl
);
5110 if (TREE_CODE (decl
) == TYPE_DECL
5111 || TREE_CODE (decl
) == PARM_DECL
5112 || TREE_CODE (decl
) == VAR_DECL
5113 || TREE_CODE (decl
) == FUNCTION_DECL
5114 || TREE_CODE (decl
) == FIELD_DECL
)
5115 TREE_DEPRECATED (decl
) = 1;
5119 else if (TYPE_P (*node
))
5121 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5122 *node
= build_type_copy (*node
);
5123 TREE_DEPRECATED (*node
) = 1;
5131 *no_add_attrs
= true;
5132 if (type
&& TYPE_NAME (type
))
5134 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
5135 what
= IDENTIFIER_POINTER (TYPE_NAME (*node
));
5136 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
5137 && DECL_NAME (TYPE_NAME (type
)))
5138 what
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
)));
5141 warning ("`%s' attribute ignored for `%s'",
5142 IDENTIFIER_POINTER (name
), what
);
5144 warning ("`%s' attribute ignored",
5145 IDENTIFIER_POINTER (name
));
5151 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5152 to prevent us from duplicating type nodes unnecessarily.
5153 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5154 since we want to distinguish types that are essentially identical (except
5155 for their debug representation), we use a local list here. */
5156 static GTY(()) tree vector_type_node_list
= 0;
5158 /* Handle a "vector_size" attribute; arguments as in
5159 struct attribute_spec.handler. */
5162 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
5163 int flags ATTRIBUTE_UNUSED
,
5166 unsigned HOST_WIDE_INT vecsize
, nunits
;
5167 enum machine_mode mode
, orig_mode
, new_mode
;
5168 tree type
= *node
, new_type
= NULL_TREE
;
5169 tree type_list_node
;
5171 *no_add_attrs
= true;
5173 if (! host_integerp (TREE_VALUE (args
), 1))
5175 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5179 /* Get the vector size (in bytes). */
5180 vecsize
= tree_low_cst (TREE_VALUE (args
), 1);
5182 /* We need to provide for vector pointers, vector arrays, and
5183 functions returning vectors. For example:
5185 __attribute__((vector_size(16))) short *foo;
5187 In this case, the mode is SI, but the type being modified is
5188 HI, so we need to look further. */
5190 while (POINTER_TYPE_P (type
)
5191 || TREE_CODE (type
) == FUNCTION_TYPE
5192 || TREE_CODE (type
) == METHOD_TYPE
5193 || TREE_CODE (type
) == ARRAY_TYPE
)
5194 type
= TREE_TYPE (type
);
5196 /* Get the mode of the type being modified. */
5197 orig_mode
= TYPE_MODE (type
);
5199 if (TREE_CODE (type
) == RECORD_TYPE
5200 || (GET_MODE_CLASS (orig_mode
) != MODE_FLOAT
5201 && GET_MODE_CLASS (orig_mode
) != MODE_INT
)
5202 || ! host_integerp (TYPE_SIZE_UNIT (type
), 1))
5204 error ("invalid vector type for attribute `%s'",
5205 IDENTIFIER_POINTER (name
));
5209 /* Calculate how many units fit in the vector. */
5210 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5212 /* Find a suitably sized vector. */
5213 new_mode
= VOIDmode
;
5214 for (mode
= GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode
) == MODE_INT
5216 : MODE_VECTOR_FLOAT
);
5218 mode
= GET_MODE_WIDER_MODE (mode
))
5219 if (vecsize
== GET_MODE_SIZE (mode
)
5220 && nunits
== (unsigned HOST_WIDE_INT
) GET_MODE_NUNITS (mode
))
5226 if (new_mode
== VOIDmode
)
5228 error ("no vector mode with the size and type specified could be found");
5232 for (type_list_node
= vector_type_node_list
; type_list_node
;
5233 type_list_node
= TREE_CHAIN (type_list_node
))
5235 tree other_type
= TREE_VALUE (type_list_node
);
5236 tree record
= TYPE_DEBUG_REPRESENTATION_TYPE (other_type
);
5237 tree fields
= TYPE_FIELDS (record
);
5238 tree field_type
= TREE_TYPE (fields
);
5239 tree array_type
= TREE_TYPE (field_type
);
5240 if (TREE_CODE (fields
) != FIELD_DECL
5241 || TREE_CODE (field_type
) != ARRAY_TYPE
)
5244 if (TYPE_MODE (other_type
) == mode
&& type
== array_type
)
5246 new_type
= other_type
;
5251 if (new_type
== NULL_TREE
)
5253 tree index
, array
, rt
, list_node
;
5255 new_type
= (*lang_hooks
.types
.type_for_mode
) (new_mode
,
5256 TREE_UNSIGNED (type
));
5260 error ("no vector mode with the size and type specified could be found");
5264 new_type
= build_type_copy (new_type
);
5266 /* If this is a vector, make sure we either have hardware
5267 support, or we can emulate it. */
5268 if ((GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
5269 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
5270 && !vector_mode_valid_p (mode
))
5272 error ("unable to emulate '%s'", GET_MODE_NAME (mode
));
5276 /* Set the debug information here, because this is the only
5277 place where we know the underlying type for a vector made
5278 with vector_size. For debugging purposes we pretend a vector
5279 is an array within a structure. */
5280 index
= build_int_2 (TYPE_VECTOR_SUBPARTS (new_type
) - 1, 0);
5281 array
= build_array_type (type
, build_index_type (index
));
5282 rt
= make_node (RECORD_TYPE
);
5284 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
5285 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
5287 TYPE_DEBUG_REPRESENTATION_TYPE (new_type
) = rt
;
5289 list_node
= build_tree_list (NULL
, new_type
);
5290 TREE_CHAIN (list_node
) = vector_type_node_list
;
5291 vector_type_node_list
= list_node
;
5294 /* Build back pointers if needed. */
5295 *node
= vector_size_helper (*node
, new_type
);
5300 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5303 If we requested a pointer to a vector, build up the pointers that
5304 we stripped off while looking for the inner type. Similarly for
5305 return values from functions.
5307 The argument "type" is the top of the chain, and "bottom" is the
5308 new type which we will point to. */
5311 vector_size_helper (tree type
, tree bottom
)
5315 if (POINTER_TYPE_P (type
))
5317 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
5318 outer
= build_pointer_type (inner
);
5320 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5322 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
5323 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
5325 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
5327 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
5328 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
5330 else if (TREE_CODE (type
) == METHOD_TYPE
)
5332 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
5333 outer
= build_method_type_directly (TYPE_METHOD_BASETYPE (type
),
5335 TYPE_ARG_TYPES (type
));
5340 TREE_READONLY (outer
) = TREE_READONLY (type
);
5341 TREE_THIS_VOLATILE (outer
) = TREE_THIS_VOLATILE (type
);
5346 /* Handle the "nonnull" attribute. */
5348 handle_nonnull_attribute (tree
*node
, tree name ATTRIBUTE_UNUSED
,
5349 tree args
, int flags ATTRIBUTE_UNUSED
,
5353 unsigned HOST_WIDE_INT attr_arg_num
;
5355 /* If no arguments are specified, all pointer arguments should be
5356 non-null. Verify a full prototype is given so that the arguments
5357 will have the correct types when we actually check them later. */
5360 if (! TYPE_ARG_TYPES (type
))
5362 error ("nonnull attribute without arguments on a non-prototype");
5363 *no_add_attrs
= true;
5368 /* Argument list specified. Verify that each argument number references
5369 a pointer argument. */
5370 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
5373 unsigned HOST_WIDE_INT arg_num
, ck_num
;
5375 if (! get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
5377 error ("nonnull argument has invalid operand number (arg %lu)",
5378 (unsigned long) attr_arg_num
);
5379 *no_add_attrs
= true;
5383 argument
= TYPE_ARG_TYPES (type
);
5386 for (ck_num
= 1; ; ck_num
++)
5388 if (! argument
|| ck_num
== arg_num
)
5390 argument
= TREE_CHAIN (argument
);
5394 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
5396 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5397 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5398 *no_add_attrs
= true;
5402 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
5404 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5405 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5406 *no_add_attrs
= true;
5415 /* Check the argument list of a function call for null in argument slots
5416 that are marked as requiring a non-null pointer argument. */
5419 check_function_nonnull (tree attrs
, tree params
)
5421 tree a
, args
, param
;
5424 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
5426 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
5428 args
= TREE_VALUE (a
);
5430 /* Walk the argument list. If we encounter an argument number we
5431 should check for non-null, do it. If the attribute has no args,
5432 then every pointer argument is checked (in which case the check
5433 for pointer type is done in check_nonnull_arg). */
5434 for (param
= params
, param_num
= 1; ;
5435 param_num
++, param
= TREE_CHAIN (param
))
5439 if (! args
|| nonnull_check_p (args
, param_num
))
5440 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
5448 /* Helper for check_function_nonnull; given a list of operands which
5449 must be non-null in ARGS, determine if operand PARAM_NUM should be
5453 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
5455 unsigned HOST_WIDE_INT arg_num
;
5457 for (; args
; args
= TREE_CHAIN (args
))
5459 if (! get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
5462 if (arg_num
== param_num
)
5468 /* Check that the function argument PARAM (which is operand number
5469 PARAM_NUM) is non-null. This is called by check_function_nonnull
5470 via check_function_arguments_recurse. */
5473 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED
, tree param
,
5474 unsigned HOST_WIDE_INT param_num
)
5476 /* Just skip checking the argument if it's not a pointer. This can
5477 happen if the "nonnull" attribute was given without an operand
5478 list (which means to check every pointer argument). */
5480 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
5483 if (integer_zerop (param
))
5484 warning ("null argument where non-null required (arg %lu)",
5485 (unsigned long) param_num
);
5488 /* Helper for nonnull attribute handling; fetch the operand number
5489 from the attribute argument list. */
5492 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
5494 /* Strip any conversions from the arg number and verify they
5496 while (TREE_CODE (arg_num_expr
) == NOP_EXPR
5497 || TREE_CODE (arg_num_expr
) == CONVERT_EXPR
5498 || TREE_CODE (arg_num_expr
) == NON_LVALUE_EXPR
)
5499 arg_num_expr
= TREE_OPERAND (arg_num_expr
, 0);
5501 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
5502 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
5505 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
5509 /* Handle a "nothrow" attribute; arguments as in
5510 struct attribute_spec.handler. */
5513 handle_nothrow_attribute (tree
*node
, tree name
, tree args ATTRIBUTE_UNUSED
,
5514 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
5516 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5517 TREE_NOTHROW (*node
) = 1;
5518 /* ??? TODO: Support types. */
5521 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5522 *no_add_attrs
= true;
5528 /* Handle a "cleanup" attribute; arguments as in
5529 struct attribute_spec.handler. */
5532 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
5533 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
5536 tree cleanup_id
, cleanup_decl
;
5538 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5539 for global destructors in C++. This requires infrastructure that
5540 we don't have generically at the moment. It's also not a feature
5541 we'd be missing too much, since we do have attribute constructor. */
5542 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
5544 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5545 *no_add_attrs
= true;
5549 /* Verify that the argument is a function in scope. */
5550 /* ??? We could support pointers to functions here as well, if
5551 that was considered desirable. */
5552 cleanup_id
= TREE_VALUE (args
);
5553 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
5555 error ("cleanup arg not an identifier");
5556 *no_add_attrs
= true;
5559 cleanup_decl
= lookup_name (cleanup_id
);
5560 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
5562 error ("cleanup arg not a function");
5563 *no_add_attrs
= true;
5567 /* That the function has proper type is checked with the
5568 eventual call to build_function_call. */
5573 /* Handle a "warn_unused_result" attribute. No special handling. */
5576 handle_warn_unused_result_attribute (tree
*node
, tree name
,
5577 tree args ATTRIBUTE_UNUSED
,
5578 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
5580 /* Ignore the attribute for functions not returning any value. */
5581 if (VOID_TYPE_P (TREE_TYPE (*node
)))
5583 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5584 *no_add_attrs
= true;
5590 /* Check for valid arguments being passed to a function. */
5592 check_function_arguments (tree attrs
, tree params
)
5594 /* Check for null being passed in a pointer argument that must be
5595 non-null. We also need to do this if format checking is enabled. */
5598 check_function_nonnull (attrs
, params
);
5600 /* Check for errors in format strings. */
5603 check_function_format (NULL
, attrs
, params
);
5606 /* Generic argument checking recursion routine. PARAM is the argument to
5607 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5608 once the argument is resolved. CTX is context for the callback. */
5610 check_function_arguments_recurse (void (*callback
)
5611 (void *, tree
, unsigned HOST_WIDE_INT
),
5612 void *ctx
, tree param
,
5613 unsigned HOST_WIDE_INT param_num
)
5615 if (TREE_CODE (param
) == NOP_EXPR
)
5617 /* Strip coercion. */
5618 check_function_arguments_recurse (callback
, ctx
,
5619 TREE_OPERAND (param
, 0), param_num
);
5623 if (TREE_CODE (param
) == CALL_EXPR
)
5625 tree type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (param
, 0)));
5627 bool found_format_arg
= false;
5629 /* See if this is a call to a known internationalization function
5630 that modifies a format arg. Such a function may have multiple
5631 format_arg attributes (for example, ngettext). */
5633 for (attrs
= TYPE_ATTRIBUTES (type
);
5635 attrs
= TREE_CHAIN (attrs
))
5636 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
5639 tree format_num_expr
;
5643 /* Extract the argument number, which was previously checked
5645 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
5646 while (TREE_CODE (format_num_expr
) == NOP_EXPR
5647 || TREE_CODE (format_num_expr
) == CONVERT_EXPR
5648 || TREE_CODE (format_num_expr
) == NON_LVALUE_EXPR
)
5649 format_num_expr
= TREE_OPERAND (format_num_expr
, 0);
5651 if (TREE_CODE (format_num_expr
) != INTEGER_CST
5652 || TREE_INT_CST_HIGH (format_num_expr
) != 0)
5655 format_num
= TREE_INT_CST_LOW (format_num_expr
);
5657 for (inner_args
= TREE_OPERAND (param
, 1), i
= 1;
5659 inner_args
= TREE_CHAIN (inner_args
), i
++)
5660 if (i
== format_num
)
5662 check_function_arguments_recurse (callback
, ctx
,
5663 TREE_VALUE (inner_args
),
5665 found_format_arg
= true;
5670 /* If we found a format_arg attribute and did a recursive check,
5671 we are done with checking this argument. Otherwise, we continue
5672 and this will be considered a non-literal. */
5673 if (found_format_arg
)
5677 if (TREE_CODE (param
) == COND_EXPR
)
5679 /* Check both halves of the conditional expression. */
5680 check_function_arguments_recurse (callback
, ctx
,
5681 TREE_OPERAND (param
, 1), param_num
);
5682 check_function_arguments_recurse (callback
, ctx
,
5683 TREE_OPERAND (param
, 2), param_num
);
5687 (*callback
) (ctx
, param
, param_num
);
5690 /* Function to help qsort sort FIELD_DECLs by name order. */
5693 field_decl_cmp (const void *x_p
, const void *y_p
)
5695 const tree
*const x
= x_p
;
5696 const tree
*const y
= y_p
;
5697 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5698 /* A nontype is "greater" than a type. */
5699 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5700 if (DECL_NAME (*x
) == NULL_TREE
)
5702 if (DECL_NAME (*y
) == NULL_TREE
)
5704 if (DECL_NAME (*x
) < DECL_NAME (*y
))
5710 gt_pointer_operator new_value
;
5714 /* This routine compares two fields like field_decl_cmp but using the
5715 pointer operator in resort_data. */
5718 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
5720 const tree
*const x
= x_p
;
5721 const tree
*const y
= y_p
;
5723 if (DECL_NAME (*x
) == DECL_NAME (*y
))
5724 /* A nontype is "greater" than a type. */
5725 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
5726 if (DECL_NAME (*x
) == NULL_TREE
)
5728 if (DECL_NAME (*y
) == NULL_TREE
)
5731 tree d1
= DECL_NAME (*x
);
5732 tree d2
= DECL_NAME (*y
);
5733 resort_data
.new_value (&d1
, resort_data
.cookie
);
5734 resort_data
.new_value (&d2
, resort_data
.cookie
);
5741 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5744 resort_sorted_fields (void *obj
,
5745 void *orig_obj ATTRIBUTE_UNUSED
,
5746 gt_pointer_operator new_value
,
5749 struct sorted_fields_type
*sf
= obj
;
5750 resort_data
.new_value
= new_value
;
5751 resort_data
.cookie
= cookie
;
5752 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
5753 resort_field_decl_cmp
);
5756 /* Used by estimate_num_insns. Estimate number of instructions seen
5757 by given statement. */
5759 c_estimate_num_insns_1 (tree
*tp
, int *walk_subtrees
, void *data
)
5764 if (TYPE_P (x
) || DECL_P (x
))
5769 /* Assume that constants and references counts nothing. These should
5770 be majorized by amount of operations among them we count later
5771 and are common target of CSE and similar optimizations. */
5772 if (TREE_CODE_CLASS (TREE_CODE (x
)) == 'c'
5773 || TREE_CODE_CLASS (TREE_CODE (x
)) == 'r')
5775 switch (TREE_CODE (x
))
5777 /* Reconginze assignments of large structures and constructors of
5782 int size
= int_size_in_bytes (TREE_TYPE (x
));
5784 if (!size
|| size
> MOVE_MAX_PIECES
)
5787 *count
+= 2 * (size
+ MOVE_MAX
- 1) / MOVE_MAX
;
5791 /* Few special cases of expensive operations. This is usefull
5792 to avoid inlining on functions having too many of these. */
5793 case TRUNC_DIV_EXPR
:
5795 case FLOOR_DIV_EXPR
:
5796 case ROUND_DIV_EXPR
:
5797 case TRUNC_MOD_EXPR
:
5799 case FLOOR_MOD_EXPR
:
5800 case ROUND_MOD_EXPR
:
5805 /* Various containers that will produce no code themselves. */
5812 case IDENTIFIER_NODE
:
5813 case PLACEHOLDER_EXPR
:
5814 case WITH_CLEANUP_EXPR
:
5815 case CLEANUP_POINT_EXPR
:
5817 case VIEW_CONVERT_EXPR
:
5823 case TRY_CATCH_EXPR
:
5824 case TRY_FINALLY_EXPR
:
5827 case LABELED_BLOCK_EXPR
:
5828 case EXIT_BLOCK_EXPR
:
5829 case EXPR_WITH_FILE_LOCATION
:
5846 /* Do not account static initializers. */
5847 if (TREE_STATIC (TREE_OPERAND (x
, 0)))
5856 /* Estimate number of instructions that will be created by expanding the body. */
5858 c_estimate_num_insns (tree decl
)
5861 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl
), c_estimate_num_insns_1
, &num
);
5865 /* Used by c_decl_uninit to find where expressions like x = x + 1; */
5868 c_decl_uninit_1 (tree
*t
, int *walk_sub_trees
, void *x
)
5870 /* If x = EXP(&x)EXP, then do not warn about the use of x. */
5871 if (TREE_CODE (*t
) == ADDR_EXPR
&& TREE_OPERAND (*t
, 0) == x
)
5873 *walk_sub_trees
= 0;
5881 /* Find out if a variable is uninitialized based on DECL_INITIAL. */
5884 c_decl_uninit (tree t
)
5886 /* int x = x; is GCC extension to turn off this warning, only if warn_init_self is zero. */
5887 if (DECL_INITIAL (t
) == t
)
5888 return warn_init_self
? true : false;
5890 /* Walk the trees looking for the variable itself. */
5891 if (walk_tree_without_duplicates (&DECL_INITIAL (t
), c_decl_uninit_1
, t
))
5896 #include "gt-c-common.h"