1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
36 #include "diagnostic.h"
41 #include "langhooks.h"
42 #include "tree-inline.h"
45 #include "tree-iterator.h"
48 cpp_reader *parse_in; /* Declared in c-pragma.h. */
50 /* We let tm.h override the types used here, to handle trivial differences
51 such as the choice of unsigned int or long unsigned int for size_t.
52 When machines start needing nontrivial differences in the size type,
53 it would be best to do something here to figure out automatically
54 from other information what type to use. */
57 #define SIZE_TYPE "long unsigned int"
61 #define PID_TYPE "int"
65 #define WCHAR_TYPE "int"
68 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
69 #define MODIFIED_WCHAR_TYPE \
70 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
73 #define PTRDIFF_TYPE "long int"
77 #define WINT_TYPE "unsigned int"
81 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
83 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
89 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
91 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
92 ? "long unsigned int" \
93 : "long long unsigned int"))
96 /* The following symbols are subsumed in the c_global_trees array, and
97 listed here individually for documentation purposes.
99 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
101 tree short_integer_type_node;
102 tree long_integer_type_node;
103 tree long_long_integer_type_node;
105 tree short_unsigned_type_node;
106 tree long_unsigned_type_node;
107 tree long_long_unsigned_type_node;
109 tree truthvalue_type_node;
110 tree truthvalue_false_node;
111 tree truthvalue_true_node;
113 tree ptrdiff_type_node;
115 tree unsigned_char_type_node;
116 tree signed_char_type_node;
117 tree wchar_type_node;
118 tree signed_wchar_type_node;
119 tree unsigned_wchar_type_node;
121 tree float_type_node;
122 tree double_type_node;
123 tree long_double_type_node;
125 tree complex_integer_type_node;
126 tree complex_float_type_node;
127 tree complex_double_type_node;
128 tree complex_long_double_type_node;
130 tree intQI_type_node;
131 tree intHI_type_node;
132 tree intSI_type_node;
133 tree intDI_type_node;
134 tree intTI_type_node;
136 tree unsigned_intQI_type_node;
137 tree unsigned_intHI_type_node;
138 tree unsigned_intSI_type_node;
139 tree unsigned_intDI_type_node;
140 tree unsigned_intTI_type_node;
142 tree widest_integer_literal_type_node;
143 tree widest_unsigned_literal_type_node;
145 Nodes for types `void *' and `const void *'.
147 tree ptr_type_node, const_ptr_type_node;
149 Nodes for types `char *' and `const char *'.
151 tree string_type_node, const_string_type_node;
153 Type `char[SOMENUMBER]'.
154 Used when an array of char is needed and the size is irrelevant.
156 tree char_array_type_node;
158 Type `int[SOMENUMBER]' or something like it.
159 Used when an array of int needed and the size is irrelevant.
161 tree int_array_type_node;
163 Type `wchar_t[SOMENUMBER]' or something like it.
164 Used when a wide string literal is created.
166 tree wchar_array_type_node;
168 Type `int ()' -- used for implicit declaration of functions.
170 tree default_function_type;
172 A VOID_TYPE node, packaged in a TREE_LIST.
176 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
177 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
178 VAR_DECLS, but C++ does.)
180 tree function_name_decl_node;
181 tree pretty_function_name_decl_node;
182 tree c99_function_name_decl_node;
184 Stack of nested function name VAR_DECLs.
186 tree saved_function_name_decls;
190 tree c_global_trees[CTI_MAX];
192 /* TRUE if a code represents a statement. The front end init
193 langhook should take care of initialization of this array. */
195 bool statement_code_p[MAX_TREE_CODES];
197 /* Switches common to the C front ends. */
199 /* Nonzero if prepreprocessing only. */
201 int flag_preprocess_only;
203 /* Nonzero means don't output line number information. */
205 char flag_no_line_commands;
207 /* Nonzero causes -E output not to be done, but directives such as
208 #define that have side effects are still obeyed. */
212 /* Nonzero means dump macros in some fashion. */
214 char flag_dump_macros;
216 /* Nonzero means pass #include lines through to the output. */
218 char flag_dump_includes;
220 /* The file name to which we should write a precompiled header, or
221 NULL if no header will be written in this compile. */
223 const char *pch_file;
225 /* Nonzero if an ISO standard was selected. It rejects macros in the
229 /* Nonzero if -undef was given. It suppresses target built-in macros
233 /* Nonzero means don't recognize the non-ANSI builtin functions. */
237 /* Nonzero means don't recognize the non-ANSI builtin functions.
240 int flag_no_nonansi_builtin;
242 /* Nonzero means give `double' the same size as `float'. */
244 int flag_short_double;
246 /* Nonzero means give `wchar_t' the same size as `short'. */
248 int flag_short_wchar;
250 /* Nonzero means allow Microsoft extensions without warnings or errors. */
251 int flag_ms_extensions;
253 /* Nonzero means don't recognize the keyword `asm'. */
257 /* Nonzero means give string constants the type `const char *', as mandated
260 int flag_const_strings;
262 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
264 int flag_signed_bitfields = 1;
265 int explicit_flag_signed_bitfields;
267 /* Nonzero means warn about pointer casts that can drop a type qualifier
268 from the pointer target type. */
272 /* Warn about functions which might be candidates for format attributes. */
274 int warn_missing_format_attribute;
276 /* Nonzero means warn about sizeof(function) or addition/subtraction
277 of function pointers. */
279 int warn_pointer_arith;
281 /* Nonzero means warn for any global function def
282 without separate previous prototype decl. */
284 int warn_missing_prototypes;
286 /* Warn if adding () is suggested. */
288 int warn_parentheses;
290 /* Warn if initializer is not completely bracketed. */
292 int warn_missing_braces;
294 /* Warn about comparison of signed and unsigned values.
295 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified
296 (in which case -Wextra gets to decide). */
298 int warn_sign_compare = -1;
300 /* Nonzero means warn about usage of long long when `-pedantic'. */
302 int warn_long_long = 1;
304 /* Nonzero means warn about deprecated conversion from string constant to
307 int warn_write_strings;
309 /* Nonzero means warn about multiple (redundant) decls for the same single
310 variable or function. */
312 int warn_redundant_decls;
314 /* Warn about testing equality of floating point numbers. */
316 int warn_float_equal;
318 /* Warn about a subscript that has type char. */
320 int warn_char_subscripts;
322 /* Warn if a type conversion is done that might have confusing results. */
326 /* Warn about #pragma directives that are not recognized. */
328 int warn_unknown_pragmas; /* Tri state variable. */
330 /* Warn about format/argument anomalies in calls to formatted I/O functions
331 (*printf, *scanf, strftime, strfmon, etc.). */
335 /* Warn about Y2K problems with strftime formats. */
339 /* Warn about excess arguments to formats. */
341 int warn_format_extra_args;
343 /* Warn about zero-length formats. */
345 int warn_format_zero_length;
347 /* Warn about non-literal format arguments. */
349 int warn_format_nonliteral;
351 /* Warn about possible security problems with calls to format functions. */
353 int warn_format_security;
355 /* Zero means that faster, ...NonNil variants of objc_msgSend...
356 calls will be used in ObjC; passing nil receivers to such calls
357 will most likely result in crashes. */
358 int flag_nil_receivers = 1;
360 /* Nonzero means that we will allow new ObjC exception syntax (@throw,
361 @try, etc.) in source code. */
362 int flag_objc_exceptions = 0;
364 /* Nonzero means that code generation will be altered to support
365 "zero-link" execution. This currently affects ObjC only, but may
366 affect other languages in the future. */
367 int flag_zero_link = 0;
369 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
370 unit. It will inform the ObjC runtime that class definition(s) herein
371 contained are to replace one(s) previously loaded. */
372 int flag_replace_objc_classes = 0;
374 /* C/ObjC language option variables. */
377 /* Nonzero means message about use of implicit function declarations;
378 1 means warning; 2 means error. */
380 int mesg_implicit_function_declaration = -1;
382 /* Nonzero means allow type mismatches in conditional expressions;
383 just make their values `void'. */
385 int flag_cond_mismatch;
387 /* Nonzero means enable C89 Amendment 1 features. */
391 /* Nonzero means use the ISO C99 dialect of C. */
395 /* Nonzero means that we have builtin functions, and main is an int. */
399 /* Nonzero means warn when casting a function call to a type that does
400 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
401 when there is no previous declaration of sqrt or malloc. */
403 int warn_bad_function_cast;
405 /* Warn about traditional constructs whose meanings changed in ANSI C. */
407 int warn_traditional;
409 /* Nonzero means warn for a declaration found after a statement. */
411 int warn_declaration_after_statement;
413 /* Nonzero means warn for non-prototype function decls
414 or non-prototyped defs without previous prototype. */
416 int warn_strict_prototypes;
418 /* Nonzero means warn for any global function def
419 without separate previous decl. */
421 int warn_missing_declarations;
423 /* Nonzero means warn about declarations of objects not at
424 file-scope level and about *all* declarations of functions (whether
425 or static) not at file-scope level. Note that we exclude
426 implicit function declarations. To get warnings about those, use
429 int warn_nested_externs;
431 /* Warn if main is suspicious. */
435 /* Nonzero means warn about possible violations of sequence point rules. */
437 int warn_sequence_point;
439 /* Nonzero means warn about uninitialized variable when it is initialized with itself.
440 For example: int i = i;, GCC will not warn about this when warn_init_self is nonzero. */
444 /* Nonzero means to warn about compile-time division by zero. */
445 int warn_div_by_zero = 1;
447 /* Nonzero means warn about use of implicit int. */
449 int warn_implicit_int;
451 /* Warn about NULL being passed to argument slots marked as requiring
456 /* Warn about old-style parameter declaration. */
458 int warn_old_style_definition;
461 /* ObjC language option variables. */
464 /* Open and close the file for outputting class declarations, if
467 int flag_gen_declaration;
469 /* Generate code for GNU or NeXT runtime environment. */
471 #ifdef NEXT_OBJC_RUNTIME
472 int flag_next_runtime = 1;
474 int flag_next_runtime = 0;
477 /* Tells the compiler that this is a special run. Do not perform any
478 compiling, instead we are to test some platform dependent features
479 and output a C header file with appropriate definitions. */
481 int print_struct_values;
483 /* ???. Undocumented. */
485 const char *constant_string_class_name;
487 /* Warn if multiple methods are seen for the same selector, but with
488 different argument types. Performs the check on the whole selector
489 table at the end of compilation. */
493 /* Warn if a @selector() is found, and no method with that selector
494 has been previously declared. The check is done on each
495 @selector() as soon as it is found - so it warns about forward
498 int warn_undeclared_selector;
500 /* Warn if methods required by a protocol are not implemented in the
501 class adopting it. When turned off, methods inherited to that
502 class are also considered implemented. */
504 int warn_protocol = 1;
507 /* C++ language option variables. */
510 /* Nonzero means don't recognize any extension keywords. */
512 int flag_no_gnu_keywords;
514 /* Nonzero means do emit exported implementations of functions even if
515 they can be inlined. */
517 int flag_implement_inlines = 1;
519 /* Nonzero means that implicit instantiations will be emitted if needed. */
521 int flag_implicit_templates = 1;
523 /* Nonzero means that implicit instantiations of inline templates will be
524 emitted if needed, even if instantiations of non-inline templates
527 int flag_implicit_inline_templates = 1;
529 /* Nonzero means generate separate instantiation control files and
530 juggle them at link time. */
532 int flag_use_repository;
534 /* Nonzero if we want to issue diagnostics that the standard says are not
537 int flag_optional_diags = 1;
539 /* Nonzero means we should attempt to elide constructors when possible. */
541 int flag_elide_constructors = 1;
543 /* Nonzero means that member functions defined in class scope are
544 inline by default. */
546 int flag_default_inline = 1;
548 /* Controls whether compiler generates 'type descriptor' that give
549 run-time type information. */
553 /* Nonzero if we want to conserve space in the .o files. We do this
554 by putting uninitialized data and runtime initialized data into
555 .common instead of .data at the expense of not flagging multiple
558 int flag_conserve_space;
560 /* Nonzero if we want to obey access control semantics. */
562 int flag_access_control = 1;
564 /* Nonzero if we want to check the return value of new and avoid calling
565 constructors if it is a null pointer. */
569 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
570 initialization variables.
571 0: Old rules, set by -fno-for-scope.
572 2: New ISO rules, set by -ffor-scope.
573 1: Try to implement new ISO rules, but with backup compatibility
574 (and warnings). This is the default, for now. */
576 int flag_new_for_scope = 1;
578 /* Nonzero if we want to emit defined symbols with common-like linkage as
579 weak symbols where possible, in order to conform to C++ semantics.
580 Otherwise, emit them as local symbols. */
584 /* 0 means we want the preprocessor to not emit line directives for
585 the current working directory. 1 means we want it to do it. -1
586 means we should decide depending on whether debugging information
587 is being emitted or not. */
589 int flag_working_directory = -1;
591 /* Nonzero to use __cxa_atexit, rather than atexit, to register
592 destructors for local statics and global objects. */
594 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
596 /* Nonzero means make the default pedwarns warnings instead of errors.
597 The value of this flag is ignored if -pedantic is specified. */
601 /* Nonzero means to implement standard semantics for exception
602 specifications, calling unexpected if an exception is thrown that
603 doesn't match the specification. Zero means to treat them as
604 assertions and optimize accordingly, but not check them. */
606 int flag_enforce_eh_specs = 1;
608 /* Nonzero means warn about things that will change when compiling
609 with an ABI-compliant compiler. */
613 /* Nonzero means warn about invalid uses of offsetof. */
615 int warn_invalid_offsetof = 1;
617 /* Nonzero means warn about implicit declarations. */
619 int warn_implicit = 1;
621 /* Nonzero means warn when all ctors or dtors are private, and the class
624 int warn_ctor_dtor_privacy = 0;
626 /* Nonzero means warn in function declared in derived class has the
627 same name as a virtual in the base class, but fails to match the
628 type signature of any virtual function in the base class. */
630 int warn_overloaded_virtual;
632 /* Nonzero means warn when declaring a class that has a non virtual
633 destructor, when it really ought to have a virtual one. */
637 /* Nonzero means warn when the compiler will reorder code. */
641 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
645 /* Nonzero means warn when we convert a pointer to member function
646 into a pointer to (void or function). */
648 int warn_pmf2ptr = 1;
650 /* Nonzero means warn about violation of some Effective C++ style rules. */
654 /* Nonzero means warn where overload resolution chooses a promotion from
655 unsigned to signed over a conversion to an unsigned of the same size. */
659 /* Nonzero means warn when an old-style cast is used. */
661 int warn_old_style_cast;
663 /* Nonzero means warn when non-templatized friend functions are
664 declared within a template */
666 int warn_nontemplate_friend = 1;
668 /* Nonzero means complain about deprecated features. */
670 int warn_deprecated = 1;
672 /* Maximum template instantiation depth. This limit is rather
673 arbitrary, but it exists to limit the time it takes to notice
674 infinite template instantiations. */
676 int max_tinst_depth = 500;
680 /* The elements of `ridpointers' are identifier nodes for the reserved
681 type names and storage classes. It is indexed by a RID_... value. */
684 tree (*make_fname_decl) (tree, int);
686 /* If non-NULL, the address of a language-specific function that
687 returns 1 for language-specific statement codes. */
688 int (*lang_statement_code_p) (enum tree_code);
690 /* If non-NULL, the address of a language-specific function that does any
691 language-specific gimplification for _STMT nodes and returns 1 iff
693 int (*lang_gimplify_stmt) (tree *, tree *);
695 /* If non-NULL, the address of a language-specific function that takes
696 any action required right before expand_function_end is called. */
697 void (*lang_expand_function_end) (void);
699 /* Nonzero means the expression being parsed will never be evaluated.
700 This is a count, since unevaluated expressions can nest. */
703 /* Information about how a function name is generated. */
706 tree *const decl; /* pointer to the VAR_DECL. */
707 const unsigned rid; /* RID number for the identifier. */
708 const int pretty; /* How pretty is it? */
711 /* The three ways of getting then name of the current function. */
713 const struct fname_var_t fname_vars[] =
715 /* C99 compliant __func__, must be first. */
716 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
717 /* GCC __FUNCTION__ compliant. */
718 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
719 /* GCC __PRETTY_FUNCTION__ compliant. */
720 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
724 static int constant_fits_type_p (tree, tree);
726 /* Keep a stack of if statements. We record the number of compound
727 statements seen up to the if keyword, as well as the line number
728 and file of the if. If a potentially ambiguous else is seen, that
729 fact is recorded; the warning is issued when we can be sure that
730 the enclosing if statement does not have an else branch. */
739 static if_elt *if_stack;
741 /* Amount of space in the if statement stack. */
742 static int if_stack_space = 0;
745 static int if_stack_pointer = 0;
747 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
748 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
749 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
750 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
751 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
752 static tree handle_always_inline_attribute (tree *, tree, tree, int,
754 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
755 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
756 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
757 static tree handle_transparent_union_attribute (tree *, tree, tree,
759 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
760 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
761 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
762 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
763 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
764 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
765 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
766 static tree handle_visibility_attribute (tree *, tree, tree, int,
768 static tree handle_tls_model_attribute (tree *, tree, tree, int,
770 static tree handle_no_instrument_function_attribute (tree *, tree,
772 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
773 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
775 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
776 static tree handle_deprecated_attribute (tree *, tree, tree, int,
778 static tree handle_vector_size_attribute (tree *, tree, tree, int,
780 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
781 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
782 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
783 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
786 static void check_function_nonnull (tree, tree);
787 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
788 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
789 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
790 static int resort_field_decl_cmp (const void *, const void *);
792 /* Table of machine-independent attributes common to all C-like languages. */
793 const struct attribute_spec c_common_attribute_table[] =
795 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
796 { "packed", 0, 0, false, false, false,
797 handle_packed_attribute },
798 { "nocommon", 0, 0, true, false, false,
799 handle_nocommon_attribute },
800 { "common", 0, 0, true, false, false,
801 handle_common_attribute },
802 /* FIXME: logically, noreturn attributes should be listed as
803 "false, true, true" and apply to function types. But implementing this
804 would require all the places in the compiler that use TREE_THIS_VOLATILE
805 on a decl to identify non-returning functions to be located and fixed
806 to check the function type instead. */
807 { "noreturn", 0, 0, true, false, false,
808 handle_noreturn_attribute },
809 { "volatile", 0, 0, true, false, false,
810 handle_noreturn_attribute },
811 { "noinline", 0, 0, true, false, false,
812 handle_noinline_attribute },
813 { "always_inline", 0, 0, true, false, false,
814 handle_always_inline_attribute },
815 { "used", 0, 0, true, false, false,
816 handle_used_attribute },
817 { "unused", 0, 0, false, false, false,
818 handle_unused_attribute },
819 /* The same comments as for noreturn attributes apply to const ones. */
820 { "const", 0, 0, true, false, false,
821 handle_const_attribute },
822 { "transparent_union", 0, 0, false, false, false,
823 handle_transparent_union_attribute },
824 { "constructor", 0, 0, true, false, false,
825 handle_constructor_attribute },
826 { "destructor", 0, 0, true, false, false,
827 handle_destructor_attribute },
828 { "mode", 1, 1, false, true, false,
829 handle_mode_attribute },
830 { "section", 1, 1, true, false, false,
831 handle_section_attribute },
832 { "aligned", 0, 1, false, false, false,
833 handle_aligned_attribute },
834 { "weak", 0, 0, true, false, false,
835 handle_weak_attribute },
836 { "alias", 1, 1, true, false, false,
837 handle_alias_attribute },
838 { "no_instrument_function", 0, 0, true, false, false,
839 handle_no_instrument_function_attribute },
840 { "malloc", 0, 0, true, false, false,
841 handle_malloc_attribute },
842 { "no_stack_limit", 0, 0, true, false, false,
843 handle_no_limit_stack_attribute },
844 { "pure", 0, 0, true, false, false,
845 handle_pure_attribute },
846 { "deprecated", 0, 0, false, false, false,
847 handle_deprecated_attribute },
848 { "vector_size", 1, 1, false, true, false,
849 handle_vector_size_attribute },
850 { "visibility", 1, 1, true, false, false,
851 handle_visibility_attribute },
852 { "tls_model", 1, 1, true, false, false,
853 handle_tls_model_attribute },
854 { "nonnull", 0, -1, false, true, true,
855 handle_nonnull_attribute },
856 { "nothrow", 0, 0, true, false, false,
857 handle_nothrow_attribute },
858 { "may_alias", 0, 0, false, true, false, NULL },
859 { "cleanup", 1, 1, true, false, false,
860 handle_cleanup_attribute },
861 { "warn_unused_result", 0, 0, false, true, true,
862 handle_warn_unused_result_attribute },
863 { NULL, 0, 0, false, false, false, NULL }
866 /* Give the specifications for the format attributes, used by C and all
869 const struct attribute_spec c_common_format_attribute_table[] =
871 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
872 { "format", 3, 3, false, true, true,
873 handle_format_attribute },
874 { "format_arg", 1, 1, false, true, true,
875 handle_format_arg_attribute },
876 { NULL, 0, 0, false, false, false, NULL }
879 /* Record the start of an if-then, and record the start of it
880 for ambiguous else detection.
882 COND is the condition for the if-then statement.
884 IF_STMT is the statement node that has already been created for
885 this if-then statement. It is created before parsing the
886 condition to keep line number information accurate. */
889 c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
891 /* Make sure there is enough space on the stack. */
892 if (if_stack_space == 0)
895 if_stack = xmalloc (10 * sizeof (if_elt));
897 else if (if_stack_space == if_stack_pointer)
899 if_stack_space += 10;
900 if_stack = xrealloc (if_stack, if_stack_space * sizeof (if_elt));
903 IF_COND (if_stmt) = cond;
906 /* Record this if statement. */
907 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
908 if_stack[if_stack_pointer].locus = input_location;
909 if_stack[if_stack_pointer].needs_warning = 0;
910 if_stack[if_stack_pointer].if_stmt = if_stmt;
914 /* Called after the then-clause for an if-statement is processed. */
919 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
920 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
923 /* Record the end of an if-then. Optionally warn if a nested
924 if statement had an ambiguous else clause. */
927 c_expand_end_cond (void)
930 if (if_stack[if_stack_pointer].needs_warning)
931 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
932 &if_stack[if_stack_pointer].locus);
933 last_expr_type = NULL_TREE;
936 /* Called between the then-clause and the else-clause
937 of an if-then-else. */
940 c_expand_start_else (void)
942 /* An ambiguous else warning must be generated for the enclosing if
943 statement, unless we see an else branch for that one, too. */
945 && if_stack_pointer > 1
946 && (if_stack[if_stack_pointer - 1].compstmt_count
947 == if_stack[if_stack_pointer - 2].compstmt_count))
948 if_stack[if_stack_pointer - 2].needs_warning = 1;
950 /* Even if a nested if statement had an else branch, it can't be
951 ambiguous if this one also has an else. So don't warn in that
952 case. Also don't warn for any if statements nested in this else. */
953 if_stack[if_stack_pointer - 1].needs_warning = 0;
954 if_stack[if_stack_pointer - 1].compstmt_count--;
957 /* Called after the else-clause for an if-statement is processed. */
962 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
963 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
966 /* Begin an if-statement. Returns a newly created IF_STMT if
969 Unlike the C++ front-end, we do not call add_stmt here; it is
970 probably safe to do so, but I am not very familiar with this
971 code so I am being extra careful not to change its behavior
972 beyond what is strictly necessary for correctness. */
975 c_begin_if_stmt (void)
978 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
982 /* Begin a while statement. Returns a newly created WHILE_STMT if
985 Unlike the C++ front-end, we do not call add_stmt here; it is
986 probably safe to do so, but I am not very familiar with this
987 code so I am being extra careful not to change its behavior
988 beyond what is strictly necessary for correctness. */
991 c_begin_while_stmt (void)
994 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
999 c_finish_while_stmt_cond (tree cond, tree while_stmt)
1001 WHILE_COND (while_stmt) = cond;
1004 /* Push current bindings for the function name VAR_DECLS. */
1007 start_fname_decls (void)
1010 tree saved = NULL_TREE;
1012 for (ix = 0; fname_vars[ix].decl; ix++)
1014 tree decl = *fname_vars[ix].decl;
1018 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
1019 *fname_vars[ix].decl = NULL_TREE;
1022 if (saved || saved_function_name_decls)
1023 /* Normally they'll have been NULL, so only push if we've got a
1024 stack, or they are non-NULL. */
1025 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1026 saved_function_name_decls);
1029 /* Finish up the current bindings, adding them into the
1030 current function's statement tree. This is done by wrapping the
1031 function's body in a COMPOUND_STMT containing these decls too. This
1032 must be done _before_ finish_stmt_tree is called. If there is no
1033 current function, we must be at file scope and no statements are
1034 involved. Pop the previous bindings. */
1037 finish_fname_decls (void)
1040 tree body = NULL_TREE;
1041 tree stack = saved_function_name_decls;
1043 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1044 body = chainon (TREE_VALUE (stack), body);
1048 /* They were called into existence, so add to statement tree. Add
1049 the DECL_STMTs inside the outermost scope. */
1050 tree *p = &DECL_SAVED_TREE (current_function_decl);
1051 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1052 while (TREE_CODE (*p) != COMPOUND_STMT)
1054 if (TREE_CODE (*p) == EXPR_STMT)
1055 p = &TREE_CHAIN (*p);
1057 p = &TREE_OPERAND(*p, 0);
1060 p = &COMPOUND_BODY (*p);
1061 if (TREE_CODE (*p) == SCOPE_STMT)
1062 p = &TREE_CHAIN (*p);
1064 body = chainon (body, *p);
1068 for (ix = 0; fname_vars[ix].decl; ix++)
1069 *fname_vars[ix].decl = NULL_TREE;
1073 /* We had saved values, restore them. */
1076 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1078 tree decl = TREE_PURPOSE (saved);
1079 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1081 *fname_vars[ix].decl = decl;
1083 stack = TREE_CHAIN (stack);
1085 saved_function_name_decls = stack;
1088 /* Return the text name of the current function, suitably prettified
1092 fname_as_string (int pretty_p)
1094 const char *name = "top level";
1103 if (current_function_decl)
1104 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
1109 /* Return the VAR_DECL for a const char array naming the current
1110 function. If the VAR_DECL has not yet been created, create it
1111 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1112 ID is its name (unfortunately C and C++ hold the RID values of
1113 keywords in different places, so we can't derive RID from ID in
1114 this language independent code. */
1117 fname_decl (unsigned int rid, tree id)
1120 tree decl = NULL_TREE;
1122 for (ix = 0; fname_vars[ix].decl; ix++)
1123 if (fname_vars[ix].rid == rid)
1126 decl = *fname_vars[ix].decl;
1129 tree saved_last_tree = last_tree;
1130 /* If a tree is built here, it would normally have the lineno of
1131 the current statement. Later this tree will be moved to the
1132 beginning of the function and this line number will be wrong.
1133 To avoid this problem set the lineno to 0 here; that prevents
1134 it from appearing in the RTL. */
1135 int saved_lineno = input_line;
1138 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1139 if (last_tree != saved_last_tree)
1141 /* We created some statement tree for the decl. This belongs
1142 at the start of the function, so remove it now and reinsert
1143 it after the function is complete. */
1144 tree stmts = TREE_CHAIN (saved_last_tree);
1146 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1147 last_tree = saved_last_tree;
1148 saved_function_name_decls = tree_cons (decl, stmts,
1149 saved_function_name_decls);
1151 *fname_vars[ix].decl = decl;
1152 input_line = saved_lineno;
1154 if (!ix && !current_function_decl)
1155 pedwarn ("%J'%D' is not defined outside of function scope", decl, decl);
1160 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1163 fix_string_type (tree value)
1165 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1166 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1167 const int nchars_max = flag_isoc99 ? 4095 : 509;
1168 int length = TREE_STRING_LENGTH (value);
1171 /* Compute the number of elements, for the array type. */
1172 nchars = wide_flag ? length / wchar_bytes : length;
1174 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1175 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1176 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1178 /* Create the array type for the string constant.
1179 -Wwrite-strings says make the string constant an array of const char
1180 so that copying it to a non-const pointer will get a warning.
1181 For C++, this is the standard behavior. */
1182 if (flag_const_strings)
1185 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1188 = build_array_type (elements,
1189 build_index_type (build_int_2 (nchars - 1, 0)));
1193 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1194 build_index_type (build_int_2 (nchars - 1, 0)));
1196 TREE_CONSTANT (value) = 1;
1197 TREE_INVARIANT (value) = 1;
1198 TREE_READONLY (value) = 1;
1199 TREE_STATIC (value) = 1;
1203 /* Print a warning if a constant expression had overflow in folding.
1204 Invoke this function on every expression that the language
1205 requires to be a constant expression.
1206 Note the ANSI C standard says it is erroneous for a
1207 constant expression to overflow. */
1210 constant_expression_warning (tree value)
1212 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1213 || TREE_CODE (value) == VECTOR_CST
1214 || TREE_CODE (value) == COMPLEX_CST)
1215 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1216 pedwarn ("overflow in constant expression");
1219 /* Print a warning if an expression had overflow in folding.
1220 Invoke this function on every expression that
1221 (1) appears in the source code, and
1222 (2) might be a constant expression that overflowed, and
1223 (3) is not already checked by convert_and_check;
1224 however, do not invoke this function on operands of explicit casts. */
1227 overflow_warning (tree value)
1229 if ((TREE_CODE (value) == INTEGER_CST
1230 || (TREE_CODE (value) == COMPLEX_CST
1231 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1232 && TREE_OVERFLOW (value))
1234 TREE_OVERFLOW (value) = 0;
1235 if (skip_evaluation == 0)
1236 warning ("integer overflow in expression");
1238 else if ((TREE_CODE (value) == REAL_CST
1239 || (TREE_CODE (value) == COMPLEX_CST
1240 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1241 && TREE_OVERFLOW (value))
1243 TREE_OVERFLOW (value) = 0;
1244 if (skip_evaluation == 0)
1245 warning ("floating point overflow in expression");
1247 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1249 TREE_OVERFLOW (value) = 0;
1250 if (skip_evaluation == 0)
1251 warning ("vector overflow in expression");
1255 /* Print a warning if a large constant is truncated to unsigned,
1256 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1257 Invoke this function on every expression that might be implicitly
1258 converted to an unsigned type. */
1261 unsigned_conversion_warning (tree result, tree operand)
1263 tree type = TREE_TYPE (result);
1265 if (TREE_CODE (operand) == INTEGER_CST
1266 && TREE_CODE (type) == INTEGER_TYPE
1267 && TYPE_UNSIGNED (type)
1268 && skip_evaluation == 0
1269 && !int_fits_type_p (operand, type))
1271 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1272 /* This detects cases like converting -129 or 256 to unsigned char. */
1273 warning ("large integer implicitly truncated to unsigned type");
1274 else if (warn_conversion)
1275 warning ("negative integer implicitly converted to unsigned type");
1279 /* Nonzero if constant C has a value that is permissible
1280 for type TYPE (an INTEGER_TYPE). */
1283 constant_fits_type_p (tree c, tree type)
1285 if (TREE_CODE (c) == INTEGER_CST)
1286 return int_fits_type_p (c, type);
1288 c = convert (type, c);
1289 return !TREE_OVERFLOW (c);
1292 /* Nonzero if vector types T1 and T2 can be converted to each other
1293 without an explicit cast. */
1295 vector_types_convertible_p (tree t1, tree t2)
1297 return targetm.vector_opaque_p (t1)
1298 || targetm.vector_opaque_p (t2)
1299 || TYPE_MODE (t1) == TYPE_MODE (t2);
1302 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1303 Invoke this function on every expression that is converted implicitly,
1304 i.e. because of language rules and not because of an explicit cast. */
1307 convert_and_check (tree type, tree expr)
1309 tree t = convert (type, expr);
1310 if (TREE_CODE (t) == INTEGER_CST)
1312 if (TREE_OVERFLOW (t))
1314 TREE_OVERFLOW (t) = 0;
1316 /* Do not diagnose overflow in a constant expression merely
1317 because a conversion overflowed. */
1318 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1320 /* No warning for converting 0x80000000 to int. */
1321 if (!(TYPE_UNSIGNED (type) < TYPE_UNSIGNED (TREE_TYPE (expr))
1322 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1323 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1324 /* If EXPR fits in the unsigned version of TYPE,
1325 don't warn unless pedantic. */
1327 || TYPE_UNSIGNED (type)
1328 || ! constant_fits_type_p (expr,
1329 c_common_unsigned_type (type)))
1330 && skip_evaluation == 0)
1331 warning ("overflow in implicit constant conversion");
1334 unsigned_conversion_warning (t, expr);
1339 /* A node in a list that describes references to variables (EXPR), which are
1340 either read accesses if WRITER is zero, or write accesses, in which case
1341 WRITER is the parent of EXPR. */
1348 /* Used to implement a cache the results of a call to verify_tree. We only
1349 use this for SAVE_EXPRs. */
1352 struct tlist_cache *next;
1353 struct tlist *cache_before_sp;
1354 struct tlist *cache_after_sp;
1358 /* Obstack to use when allocating tlist structures, and corresponding
1360 static struct obstack tlist_obstack;
1361 static char *tlist_firstobj = 0;
1363 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1365 static struct tlist *warned_ids;
1366 /* SAVE_EXPRs need special treatment. We process them only once and then
1367 cache the results. */
1368 static struct tlist_cache *save_expr_cache;
1370 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1371 static void merge_tlist (struct tlist **, struct tlist *, int);
1372 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1373 static int warning_candidate_p (tree);
1374 static void warn_for_collisions (struct tlist *);
1375 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1376 static struct tlist *new_tlist (struct tlist *, tree, tree);
1377 static void verify_sequence_points (tree);
1379 /* Create a new struct tlist and fill in its fields. */
1380 static struct tlist *
1381 new_tlist (struct tlist *next, tree t, tree writer)
1384 l = obstack_alloc (&tlist_obstack, sizeof *l);
1391 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1392 is nonnull, we ignore any node we find which has a writer equal to it. */
1395 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1399 struct tlist *next = add->next;
1402 if (! exclude_writer || add->writer != exclude_writer)
1403 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1408 /* Merge the nodes of ADD into TO. This merging process is done so that for
1409 each variable that already exists in TO, no new node is added; however if
1410 there is a write access recorded in ADD, and an occurrence on TO is only
1411 a read access, then the occurrence in TO will be modified to record the
1415 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1417 struct tlist **end = to;
1420 end = &(*end)->next;
1426 struct tlist *next = add->next;
1428 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1429 if (tmp2->expr == add->expr)
1433 tmp2->writer = add->writer;
1437 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1438 end = &(*end)->next;
1445 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1446 references in list LIST conflict with it, excluding reads if ONLY writers
1450 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1455 /* Avoid duplicate warnings. */
1456 for (tmp = warned_ids; tmp; tmp = tmp->next)
1457 if (tmp->expr == written)
1462 if (list->expr == written
1463 && list->writer != writer
1464 && (! only_writes || list->writer))
1466 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1467 warning ("operation on `%s' may be undefined",
1468 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1474 /* Given a list LIST of references to variables, find whether any of these
1475 can cause conflicts due to missing sequence points. */
1478 warn_for_collisions (struct tlist *list)
1482 for (tmp = list; tmp; tmp = tmp->next)
1485 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1489 /* Return nonzero if X is a tree that can be verified by the sequence point
1492 warning_candidate_p (tree x)
1494 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1497 /* Walk the tree X, and record accesses to variables. If X is written by the
1498 parent tree, WRITER is the parent.
1499 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1500 expression or its only operand forces a sequence point, then everything up
1501 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1503 Once we return, we will have emitted warnings if any subexpression before
1504 such a sequence point could be undefined. On a higher level, however, the
1505 sequence point may not be relevant, and we'll merge the two lists.
1507 Example: (b++, a) + b;
1508 The call that processes the COMPOUND_EXPR will store the increment of B
1509 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1510 processes the PLUS_EXPR will need to merge the two lists so that
1511 eventually, all accesses end up on the same list (and we'll warn about the
1512 unordered subexpressions b++ and b.
1514 A note on merging. If we modify the former example so that our expression
1517 care must be taken not simply to add all three expressions into the final
1518 PNO_SP list. The function merge_tlist takes care of that by merging the
1519 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1520 way, so that no more than one access to B is recorded. */
1523 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1526 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1527 enum tree_code code;
1530 /* X may be NULL if it is the operand of an empty statement expression
1536 code = TREE_CODE (x);
1537 class = TREE_CODE_CLASS (code);
1539 if (warning_candidate_p (x))
1541 *pno_sp = new_tlist (*pno_sp, x, writer);
1551 case TRUTH_ANDIF_EXPR:
1552 case TRUTH_ORIF_EXPR:
1553 tmp_before = tmp_nosp = tmp_list3 = 0;
1554 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1555 warn_for_collisions (tmp_nosp);
1556 merge_tlist (pbefore_sp, tmp_before, 0);
1557 merge_tlist (pbefore_sp, tmp_nosp, 0);
1558 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1559 merge_tlist (pbefore_sp, tmp_list3, 0);
1563 tmp_before = tmp_list2 = 0;
1564 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1565 warn_for_collisions (tmp_list2);
1566 merge_tlist (pbefore_sp, tmp_before, 0);
1567 merge_tlist (pbefore_sp, tmp_list2, 1);
1569 tmp_list3 = tmp_nosp = 0;
1570 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1571 warn_for_collisions (tmp_nosp);
1572 merge_tlist (pbefore_sp, tmp_list3, 0);
1574 tmp_list3 = tmp_list2 = 0;
1575 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1576 warn_for_collisions (tmp_list2);
1577 merge_tlist (pbefore_sp, tmp_list3, 0);
1578 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1579 two first, to avoid warning for (a ? b++ : b++). */
1580 merge_tlist (&tmp_nosp, tmp_list2, 0);
1581 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1584 case PREDECREMENT_EXPR:
1585 case PREINCREMENT_EXPR:
1586 case POSTDECREMENT_EXPR:
1587 case POSTINCREMENT_EXPR:
1588 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1592 tmp_before = tmp_nosp = tmp_list3 = 0;
1593 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1594 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1595 /* Expressions inside the LHS are not ordered wrt. the sequence points
1596 in the RHS. Example:
1598 Despite the fact that the modification of "a" is in the before_sp
1599 list (tmp_before), it conflicts with the use of "a" in the LHS.
1600 We can handle this by adding the contents of tmp_list3
1601 to those of tmp_before, and redoing the collision warnings for that
1603 add_tlist (&tmp_before, tmp_list3, x, 1);
1604 warn_for_collisions (tmp_before);
1605 /* Exclude the LHS itself here; we first have to merge it into the
1606 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1607 didn't exclude the LHS, we'd get it twice, once as a read and once
1609 add_tlist (pno_sp, tmp_list3, x, 0);
1610 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1612 merge_tlist (pbefore_sp, tmp_before, 0);
1613 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1614 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1615 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1619 /* We need to warn about conflicts among arguments and conflicts between
1620 args and the function address. Side effects of the function address,
1621 however, are not ordered by the sequence point of the call. */
1622 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1623 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1624 if (TREE_OPERAND (x, 1))
1625 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1626 merge_tlist (&tmp_list3, tmp_list2, 0);
1627 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1628 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1629 warn_for_collisions (tmp_before);
1630 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1634 /* Scan all the list, e.g. indices of multi dimensional array. */
1637 tmp_before = tmp_nosp = 0;
1638 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1639 merge_tlist (&tmp_nosp, tmp_before, 0);
1640 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1647 struct tlist_cache *t;
1648 for (t = save_expr_cache; t; t = t->next)
1654 t = obstack_alloc (&tlist_obstack, sizeof *t);
1655 t->next = save_expr_cache;
1657 save_expr_cache = t;
1659 tmp_before = tmp_nosp = 0;
1660 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1661 warn_for_collisions (tmp_nosp);
1666 struct tlist *t = tmp_nosp;
1668 merge_tlist (&tmp_list3, t, 0);
1670 t->cache_before_sp = tmp_before;
1671 t->cache_after_sp = tmp_list3;
1673 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1674 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1683 if (first_rtl_op (code) == 0)
1685 x = TREE_OPERAND (x, 0);
1700 int max = first_rtl_op (TREE_CODE (x));
1701 for (lp = 0; lp < max; lp++)
1703 tmp_before = tmp_nosp = 0;
1704 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1705 merge_tlist (&tmp_nosp, tmp_before, 0);
1706 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1713 /* Try to warn for undefined behavior in EXPR due to missing sequence
1717 verify_sequence_points (tree expr)
1719 struct tlist *before_sp = 0, *after_sp = 0;
1722 save_expr_cache = 0;
1723 if (tlist_firstobj == 0)
1725 gcc_obstack_init (&tlist_obstack);
1726 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1729 verify_tree (expr, &before_sp, &after_sp, 0);
1730 warn_for_collisions (after_sp);
1731 obstack_free (&tlist_obstack, tlist_firstobj);
1735 c_expand_expr_stmt (tree expr)
1737 /* Do default conversion if safe and possibly important,
1738 in case within ({...}). */
1739 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1740 && (flag_isoc99 || lvalue_p (expr)))
1741 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1742 expr = default_conversion (expr);
1744 if (warn_sequence_point)
1745 verify_sequence_points (expr);
1747 if (TREE_TYPE (expr) != error_mark_node
1748 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1749 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1750 error ("expression statement has incomplete type");
1752 last_expr_type = TREE_TYPE (expr);
1753 return add_stmt (build_stmt (EXPR_STMT, expr));
1756 /* Validate the expression after `case' and apply default promotions. */
1759 check_case_value (tree value)
1761 if (value == NULL_TREE)
1764 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1765 STRIP_TYPE_NOPS (value);
1766 /* In C++, the following is allowed:
1769 switch (...) { case i: ... }
1771 So, we try to reduce the VALUE to a constant that way. */
1772 if (c_dialect_cxx ())
1774 value = decl_constant_value (value);
1775 STRIP_TYPE_NOPS (value);
1776 value = fold (value);
1779 if (TREE_CODE (value) != INTEGER_CST
1780 && value != error_mark_node)
1782 error ("case label does not reduce to an integer constant");
1783 value = error_mark_node;
1786 /* Promote char or short to int. */
1787 value = default_conversion (value);
1789 constant_expression_warning (value);
1794 /* Return an integer type with BITS bits of precision,
1795 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1798 c_common_type_for_size (unsigned int bits, int unsignedp)
1800 if (bits == TYPE_PRECISION (integer_type_node))
1801 return unsignedp ? unsigned_type_node : integer_type_node;
1803 if (bits == TYPE_PRECISION (signed_char_type_node))
1804 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1806 if (bits == TYPE_PRECISION (short_integer_type_node))
1807 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1809 if (bits == TYPE_PRECISION (long_integer_type_node))
1810 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1812 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1813 return (unsignedp ? long_long_unsigned_type_node
1814 : long_long_integer_type_node);
1816 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1817 return (unsignedp ? widest_unsigned_literal_type_node
1818 : widest_integer_literal_type_node);
1820 if (bits <= TYPE_PRECISION (intQI_type_node))
1821 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1823 if (bits <= TYPE_PRECISION (intHI_type_node))
1824 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1826 if (bits <= TYPE_PRECISION (intSI_type_node))
1827 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1829 if (bits <= TYPE_PRECISION (intDI_type_node))
1830 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1835 /* Used for communication between c_common_type_for_mode and
1836 c_register_builtin_type. */
1837 static GTY(()) tree registered_builtin_types;
1839 /* Return a data type that has machine mode MODE.
1840 If the mode is an integer,
1841 then UNSIGNEDP selects between signed and unsigned types. */
1844 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1848 if (mode == TYPE_MODE (integer_type_node))
1849 return unsignedp ? unsigned_type_node : integer_type_node;
1851 if (mode == TYPE_MODE (signed_char_type_node))
1852 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1854 if (mode == TYPE_MODE (short_integer_type_node))
1855 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1857 if (mode == TYPE_MODE (long_integer_type_node))
1858 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1860 if (mode == TYPE_MODE (long_long_integer_type_node))
1861 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1863 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1864 return unsignedp ? widest_unsigned_literal_type_node
1865 : widest_integer_literal_type_node;
1868 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1871 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1874 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1877 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1879 #if HOST_BITS_PER_WIDE_INT >= 64
1880 if (mode == TYPE_MODE (intTI_type_node))
1881 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1884 if (mode == TYPE_MODE (float_type_node))
1885 return float_type_node;
1887 if (mode == TYPE_MODE (double_type_node))
1888 return double_type_node;
1890 if (mode == TYPE_MODE (long_double_type_node))
1891 return long_double_type_node;
1893 if (mode == TYPE_MODE (void_type_node))
1894 return void_type_node;
1896 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1897 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1899 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1900 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1902 if (VECTOR_MODE_P (mode))
1904 enum machine_mode inner_mode = GET_MODE_INNER (mode);
1905 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1906 if (inner_type != NULL_TREE)
1907 return build_vector_type_for_mode (inner_type, mode);
1910 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1911 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1912 return TREE_VALUE (t);
1917 /* Return an unsigned type the same as TYPE in other respects. */
1919 c_common_unsigned_type (tree type)
1921 tree type1 = TYPE_MAIN_VARIANT (type);
1922 if (type1 == signed_char_type_node || type1 == char_type_node)
1923 return unsigned_char_type_node;
1924 if (type1 == integer_type_node)
1925 return unsigned_type_node;
1926 if (type1 == short_integer_type_node)
1927 return short_unsigned_type_node;
1928 if (type1 == long_integer_type_node)
1929 return long_unsigned_type_node;
1930 if (type1 == long_long_integer_type_node)
1931 return long_long_unsigned_type_node;
1932 if (type1 == widest_integer_literal_type_node)
1933 return widest_unsigned_literal_type_node;
1934 #if HOST_BITS_PER_WIDE_INT >= 64
1935 if (type1 == intTI_type_node)
1936 return unsigned_intTI_type_node;
1938 if (type1 == intDI_type_node)
1939 return unsigned_intDI_type_node;
1940 if (type1 == intSI_type_node)
1941 return unsigned_intSI_type_node;
1942 if (type1 == intHI_type_node)
1943 return unsigned_intHI_type_node;
1944 if (type1 == intQI_type_node)
1945 return unsigned_intQI_type_node;
1947 return c_common_signed_or_unsigned_type (1, type);
1950 /* Return a signed type the same as TYPE in other respects. */
1953 c_common_signed_type (tree type)
1955 tree type1 = TYPE_MAIN_VARIANT (type);
1956 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1957 return signed_char_type_node;
1958 if (type1 == unsigned_type_node)
1959 return integer_type_node;
1960 if (type1 == short_unsigned_type_node)
1961 return short_integer_type_node;
1962 if (type1 == long_unsigned_type_node)
1963 return long_integer_type_node;
1964 if (type1 == long_long_unsigned_type_node)
1965 return long_long_integer_type_node;
1966 if (type1 == widest_unsigned_literal_type_node)
1967 return widest_integer_literal_type_node;
1968 #if HOST_BITS_PER_WIDE_INT >= 64
1969 if (type1 == unsigned_intTI_type_node)
1970 return intTI_type_node;
1972 if (type1 == unsigned_intDI_type_node)
1973 return intDI_type_node;
1974 if (type1 == unsigned_intSI_type_node)
1975 return intSI_type_node;
1976 if (type1 == unsigned_intHI_type_node)
1977 return intHI_type_node;
1978 if (type1 == unsigned_intQI_type_node)
1979 return intQI_type_node;
1981 return c_common_signed_or_unsigned_type (0, type);
1984 /* Return a type the same as TYPE except unsigned or
1985 signed according to UNSIGNEDP. */
1988 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1990 if (! INTEGRAL_TYPE_P (type)
1991 || TYPE_UNSIGNED (type) == unsignedp)
1994 /* Must check the mode of the types, not the precision. Enumeral types
1995 in C++ have precision set to match their range, but may use a wider
1996 mode to match an ABI. If we change modes, we may wind up with bad
1999 if (TYPE_MODE (type) == TYPE_MODE (signed_char_type_node))
2000 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2001 if (TYPE_MODE (type) == TYPE_MODE (integer_type_node))
2002 return unsignedp ? unsigned_type_node : integer_type_node;
2003 if (TYPE_MODE (type) == TYPE_MODE (short_integer_type_node))
2004 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2005 if (TYPE_MODE (type) == TYPE_MODE (long_integer_type_node))
2006 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2007 if (TYPE_MODE (type) == TYPE_MODE (long_long_integer_type_node))
2008 return (unsignedp ? long_long_unsigned_type_node
2009 : long_long_integer_type_node);
2010 if (TYPE_MODE (type) == TYPE_MODE (widest_integer_literal_type_node))
2011 return (unsignedp ? widest_unsigned_literal_type_node
2012 : widest_integer_literal_type_node);
2014 #if HOST_BITS_PER_WIDE_INT >= 64
2015 if (TYPE_MODE (type) == TYPE_MODE (intTI_type_node))
2016 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2018 if (TYPE_MODE (type) == TYPE_MODE (intDI_type_node))
2019 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2020 if (TYPE_MODE (type) == TYPE_MODE (intSI_type_node))
2021 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2022 if (TYPE_MODE (type) == TYPE_MODE (intHI_type_node))
2023 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2024 if (TYPE_MODE (type) == TYPE_MODE (intQI_type_node))
2025 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2030 /* The C version of the register_builtin_type langhook. */
2033 c_register_builtin_type (tree type, const char* name)
2037 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2038 DECL_ARTIFICIAL (decl) = 1;
2039 if (!TYPE_NAME (type))
2040 TYPE_NAME (type) = decl;
2043 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
2047 /* Return the minimum number of bits needed to represent VALUE in a
2048 signed or unsigned type, UNSIGNEDP says which. */
2051 min_precision (tree value, int unsignedp)
2055 /* If the value is negative, compute its negative minus 1. The latter
2056 adjustment is because the absolute value of the largest negative value
2057 is one larger than the largest positive value. This is equivalent to
2058 a bit-wise negation, so use that operation instead. */
2060 if (tree_int_cst_sgn (value) < 0)
2061 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2063 /* Return the number of bits needed, taking into account the fact
2064 that we need one more bit for a signed than unsigned type. */
2066 if (integer_zerop (value))
2069 log = tree_floor_log2 (value);
2071 return log + 1 + ! unsignedp;
2074 /* Print an error message for invalid operands to arith operation
2075 CODE. NOP_EXPR is used as a special case (see
2076 c_common_truthvalue_conversion). */
2079 binary_op_error (enum tree_code code)
2086 error ("invalid truth-value expression");
2090 opname = "+"; break;
2092 opname = "-"; break;
2094 opname = "*"; break;
2096 opname = "max"; break;
2098 opname = "min"; break;
2100 opname = "=="; break;
2102 opname = "!="; break;
2104 opname = "<="; break;
2106 opname = ">="; break;
2108 opname = "<"; break;
2110 opname = ">"; break;
2112 opname = "<<"; break;
2114 opname = ">>"; break;
2115 case TRUNC_MOD_EXPR:
2116 case FLOOR_MOD_EXPR:
2117 opname = "%"; break;
2118 case TRUNC_DIV_EXPR:
2119 case FLOOR_DIV_EXPR:
2120 opname = "/"; break;
2122 opname = "&"; break;
2124 opname = "|"; break;
2125 case TRUTH_ANDIF_EXPR:
2126 opname = "&&"; break;
2127 case TRUTH_ORIF_EXPR:
2128 opname = "||"; break;
2130 opname = "^"; break;
2133 opname = "rotate"; break;
2135 opname = "unknown"; break;
2137 error ("invalid operands to binary %s", opname);
2140 /* Subroutine of build_binary_op, used for comparison operations.
2141 See if the operands have both been converted from subword integer types
2142 and, if so, perhaps change them both back to their original type.
2143 This function is also responsible for converting the two operands
2144 to the proper common type for comparison.
2146 The arguments of this function are all pointers to local variables
2147 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2148 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2150 If this function returns nonzero, it means that the comparison has
2151 a constant value. What this function returns is an expression for
2155 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2156 enum tree_code *rescode_ptr)
2159 tree op0 = *op0_ptr;
2160 tree op1 = *op1_ptr;
2161 int unsignedp0, unsignedp1;
2163 tree primop0, primop1;
2164 enum tree_code code = *rescode_ptr;
2166 /* Throw away any conversions to wider types
2167 already present in the operands. */
2169 primop0 = get_narrower (op0, &unsignedp0);
2170 primop1 = get_narrower (op1, &unsignedp1);
2172 /* Handle the case that OP0 does not *contain* a conversion
2173 but it *requires* conversion to FINAL_TYPE. */
2175 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2176 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2177 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2178 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
2180 /* If one of the operands must be floated, we cannot optimize. */
2181 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2182 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2184 /* If first arg is constant, swap the args (changing operation
2185 so value is preserved), for canonicalization. Don't do this if
2186 the second arg is 0. */
2188 if (TREE_CONSTANT (primop0)
2189 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2192 int temi = unsignedp0;
2200 unsignedp0 = unsignedp1;
2223 *rescode_ptr = code;
2226 /* If comparing an integer against a constant more bits wide,
2227 maybe we can deduce a value of 1 or 0 independent of the data.
2228 Or else truncate the constant now
2229 rather than extend the variable at run time.
2231 This is only interesting if the constant is the wider arg.
2232 Also, it is not safe if the constant is unsigned and the
2233 variable arg is signed, since in this case the variable
2234 would be sign-extended and then regarded as unsigned.
2235 Our technique fails in this case because the lowest/highest
2236 possible unsigned results don't follow naturally from the
2237 lowest/highest possible values of the variable operand.
2238 For just EQ_EXPR and NE_EXPR there is another technique that
2239 could be used: see if the constant can be faithfully represented
2240 in the other operand's type, by truncating it and reextending it
2241 and see if that preserves the constant's value. */
2243 if (!real1 && !real2
2244 && TREE_CODE (primop1) == INTEGER_CST
2245 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2247 int min_gt, max_gt, min_lt, max_lt;
2248 tree maxval, minval;
2249 /* 1 if comparison is nominally unsigned. */
2250 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
2253 type = c_common_signed_or_unsigned_type (unsignedp0,
2254 TREE_TYPE (primop0));
2256 /* In C, if TYPE is an enumeration, then we need to get its
2257 min/max values from its underlying integral type, not the
2258 enumerated type itself. In C++, TYPE_MAX_VALUE and
2259 TYPE_MIN_VALUE have already been set correctly on the
2260 enumeration type. */
2261 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
2262 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2264 maxval = TYPE_MAX_VALUE (type);
2265 minval = TYPE_MIN_VALUE (type);
2267 if (unsignedp && !unsignedp0)
2268 *restype_ptr = c_common_signed_type (*restype_ptr);
2270 if (TREE_TYPE (primop1) != *restype_ptr)
2271 primop1 = convert (*restype_ptr, primop1);
2272 if (type != *restype_ptr)
2274 minval = convert (*restype_ptr, minval);
2275 maxval = convert (*restype_ptr, maxval);
2278 if (unsignedp && unsignedp0)
2280 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2281 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2282 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2283 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2287 min_gt = INT_CST_LT (primop1, minval);
2288 max_gt = INT_CST_LT (primop1, maxval);
2289 min_lt = INT_CST_LT (minval, primop1);
2290 max_lt = INT_CST_LT (maxval, primop1);
2294 /* This used to be a switch, but Genix compiler can't handle that. */
2295 if (code == NE_EXPR)
2297 if (max_lt || min_gt)
2298 val = truthvalue_true_node;
2300 else if (code == EQ_EXPR)
2302 if (max_lt || min_gt)
2303 val = truthvalue_false_node;
2305 else if (code == LT_EXPR)
2308 val = truthvalue_true_node;
2310 val = truthvalue_false_node;
2312 else if (code == GT_EXPR)
2315 val = truthvalue_true_node;
2317 val = truthvalue_false_node;
2319 else if (code == LE_EXPR)
2322 val = truthvalue_true_node;
2324 val = truthvalue_false_node;
2326 else if (code == GE_EXPR)
2329 val = truthvalue_true_node;
2331 val = truthvalue_false_node;
2334 /* If primop0 was sign-extended and unsigned comparison specd,
2335 we did a signed comparison above using the signed type bounds.
2336 But the comparison we output must be unsigned.
2338 Also, for inequalities, VAL is no good; but if the signed
2339 comparison had *any* fixed result, it follows that the
2340 unsigned comparison just tests the sign in reverse
2341 (positive values are LE, negative ones GE).
2342 So we can generate an unsigned comparison
2343 against an extreme value of the signed type. */
2345 if (unsignedp && !unsignedp0)
2352 primop1 = TYPE_MIN_VALUE (type);
2358 primop1 = TYPE_MAX_VALUE (type);
2365 type = c_common_unsigned_type (type);
2368 if (TREE_CODE (primop0) != INTEGER_CST)
2370 if (val == truthvalue_false_node)
2371 warning ("comparison is always false due to limited range of data type");
2372 if (val == truthvalue_true_node)
2373 warning ("comparison is always true due to limited range of data type");
2378 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2379 if (TREE_SIDE_EFFECTS (primop0))
2380 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2384 /* Value is not predetermined, but do the comparison
2385 in the type of the operand that is not constant.
2386 TYPE is already properly set. */
2388 else if (real1 && real2
2389 && (TYPE_PRECISION (TREE_TYPE (primop0))
2390 == TYPE_PRECISION (TREE_TYPE (primop1))))
2391 type = TREE_TYPE (primop0);
2393 /* If args' natural types are both narrower than nominal type
2394 and both extend in the same manner, compare them
2395 in the type of the wider arg.
2396 Otherwise must actually extend both to the nominal
2397 common type lest different ways of extending
2399 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2401 else if (unsignedp0 == unsignedp1 && real1 == real2
2402 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2403 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2405 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2406 type = c_common_signed_or_unsigned_type (unsignedp0
2407 || TYPE_UNSIGNED (*restype_ptr),
2409 /* Make sure shorter operand is extended the right way
2410 to match the longer operand. */
2412 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2413 TREE_TYPE (primop0)),
2416 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2417 TREE_TYPE (primop1)),
2422 /* Here we must do the comparison on the nominal type
2423 using the args exactly as we received them. */
2424 type = *restype_ptr;
2428 if (!real1 && !real2 && integer_zerop (primop1)
2429 && TYPE_UNSIGNED (*restype_ptr))
2435 /* All unsigned values are >= 0, so we warn if extra warnings
2436 are requested. However, if OP0 is a constant that is
2437 >= 0, the signedness of the comparison isn't an issue,
2438 so suppress the warning. */
2439 if (extra_warnings && !in_system_header
2440 && ! (TREE_CODE (primop0) == INTEGER_CST
2441 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2443 warning ("comparison of unsigned expression >= 0 is always true");
2444 value = truthvalue_true_node;
2448 if (extra_warnings && !in_system_header
2449 && ! (TREE_CODE (primop0) == INTEGER_CST
2450 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2452 warning ("comparison of unsigned expression < 0 is always false");
2453 value = truthvalue_false_node;
2462 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2463 if (TREE_SIDE_EFFECTS (primop0))
2464 return build (COMPOUND_EXPR, TREE_TYPE (value),
2471 *op0_ptr = convert (type, primop0);
2472 *op1_ptr = convert (type, primop1);
2474 *restype_ptr = truthvalue_type_node;
2479 /* Return a tree for the sum or difference (RESULTCODE says which)
2480 of pointer PTROP and integer INTOP. */
2483 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2487 /* The result is a pointer of the same type that is being added. */
2489 tree result_type = TREE_TYPE (ptrop);
2491 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2493 if (pedantic || warn_pointer_arith)
2494 pedwarn ("pointer of type `void *' used in arithmetic");
2495 size_exp = integer_one_node;
2497 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2499 if (pedantic || warn_pointer_arith)
2500 pedwarn ("pointer to a function used in arithmetic");
2501 size_exp = integer_one_node;
2503 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2505 if (pedantic || warn_pointer_arith)
2506 pedwarn ("pointer to member function used in arithmetic");
2507 size_exp = integer_one_node;
2510 size_exp = size_in_bytes (TREE_TYPE (result_type));
2512 /* If what we are about to multiply by the size of the elements
2513 contains a constant term, apply distributive law
2514 and multiply that constant term separately.
2515 This helps produce common subexpressions. */
2517 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2518 && ! TREE_CONSTANT (intop)
2519 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2520 && TREE_CONSTANT (size_exp)
2521 /* If the constant comes from pointer subtraction,
2522 skip this optimization--it would cause an error. */
2523 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2524 /* If the constant is unsigned, and smaller than the pointer size,
2525 then we must skip this optimization. This is because it could cause
2526 an overflow error if the constant is negative but INTOP is not. */
2527 && (! TYPE_UNSIGNED (TREE_TYPE (intop))
2528 || (TYPE_PRECISION (TREE_TYPE (intop))
2529 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2531 enum tree_code subcode = resultcode;
2532 tree int_type = TREE_TYPE (intop);
2533 if (TREE_CODE (intop) == MINUS_EXPR)
2534 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2535 /* Convert both subexpression types to the type of intop,
2536 because weird cases involving pointer arithmetic
2537 can result in a sum or difference with different type args. */
2538 ptrop = build_binary_op (subcode, ptrop,
2539 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2540 intop = convert (int_type, TREE_OPERAND (intop, 0));
2543 /* Convert the integer argument to a type the same size as sizetype
2544 so the multiply won't overflow spuriously. */
2546 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2547 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
2548 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2549 TYPE_UNSIGNED (sizetype)), intop);
2551 /* Replace the integer argument with a suitable product by the object size.
2552 Do this multiplication as signed, then convert to the appropriate
2553 pointer type (actually unsigned integral). */
2555 intop = convert (result_type,
2556 build_binary_op (MULT_EXPR, intop,
2557 convert (TREE_TYPE (intop), size_exp), 1));
2559 /* Create the sum or difference. */
2560 return fold (build (resultcode, result_type, ptrop, intop));
2563 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2564 or validate its data type for an `if' or `while' statement or ?..: exp.
2566 This preparation consists of taking the ordinary
2567 representation of an expression expr and producing a valid tree
2568 boolean expression describing whether expr is nonzero. We could
2569 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2570 but we optimize comparisons, &&, ||, and !.
2572 The resulting type should always be `truthvalue_type_node'. */
2575 c_common_truthvalue_conversion (tree expr)
2577 if (TREE_CODE (expr) == ERROR_MARK)
2580 if (TREE_CODE (expr) == FUNCTION_DECL)
2581 expr = build_unary_op (ADDR_EXPR, expr, 0);
2583 switch (TREE_CODE (expr))
2586 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2587 case TRUTH_ANDIF_EXPR:
2588 case TRUTH_ORIF_EXPR:
2589 case TRUTH_AND_EXPR:
2591 case TRUTH_XOR_EXPR:
2592 case TRUTH_NOT_EXPR:
2593 TREE_TYPE (expr) = truthvalue_type_node;
2600 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2603 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2607 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2608 && ! DECL_WEAK (TREE_OPERAND (expr, 0)))
2610 /* Common Ada/Pascal programmer's mistake. We always warn
2611 about this since it is so bad. */
2612 warning ("the address of `%D', will always evaluate as `true'",
2613 TREE_OPERAND (expr, 0));
2614 return truthvalue_true_node;
2617 /* If we are taking the address of an external decl, it might be
2618 zero if it is weak, so we cannot optimize. */
2619 if (DECL_P (TREE_OPERAND (expr, 0))
2620 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2623 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2624 return build (COMPOUND_EXPR, truthvalue_type_node,
2625 TREE_OPERAND (expr, 0), truthvalue_true_node);
2627 return truthvalue_true_node;
2631 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2632 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2633 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)),
2634 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2640 /* These don't change whether an object is nonzero or zero. */
2641 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2645 /* These don't change whether an object is zero or nonzero, but
2646 we can't ignore them if their second arg has side-effects. */
2647 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2648 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2649 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)));
2651 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2654 /* Distribute the conversion into the arms of a COND_EXPR. */
2655 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2656 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2657 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 2))));
2660 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2661 since that affects how `default_conversion' will behave. */
2662 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2663 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2665 /* Fall through.... */
2667 /* If this is widening the argument, we can ignore it. */
2668 if (TYPE_PRECISION (TREE_TYPE (expr))
2669 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2670 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2674 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2675 aren't guaranteed to the be same for modes that can represent
2676 infinity, since if x and y are both +infinity, or both
2677 -infinity, then x - y is not a number.
2679 Note that this transformation is safe when x or y is NaN.
2680 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2682 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2684 /* Fall through.... */
2686 /* This and MINUS_EXPR can be changed into a comparison of the
2688 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2689 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2690 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2691 TREE_OPERAND (expr, 1), 1);
2692 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2693 fold (build1 (NOP_EXPR,
2694 TREE_TYPE (TREE_OPERAND (expr, 0)),
2695 TREE_OPERAND (expr, 1))), 1);
2698 if (integer_onep (TREE_OPERAND (expr, 1))
2699 && TREE_TYPE (expr) != truthvalue_type_node)
2700 /* Using convert here would cause infinite recursion. */
2701 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2705 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2706 warning ("suggest parentheses around assignment used as truth value");
2713 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2715 tree t = save_expr (expr);
2716 return (build_binary_op
2717 ((TREE_SIDE_EFFECTS (expr)
2718 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2719 lang_hooks.truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2720 lang_hooks.truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2724 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2727 static tree builtin_function_2 (const char *, const char *, tree, tree,
2728 int, enum built_in_class, int, int,
2731 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2732 down to the element type of an array. */
2735 c_build_qualified_type (tree type, int type_quals)
2737 if (type == error_mark_node)
2740 if (TREE_CODE (type) == ARRAY_TYPE)
2741 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2743 TYPE_DOMAIN (type));
2745 /* A restrict-qualified pointer type must be a pointer to object or
2746 incomplete type. Note that the use of POINTER_TYPE_P also allows
2747 REFERENCE_TYPEs, which is appropriate for C++. */
2748 if ((type_quals & TYPE_QUAL_RESTRICT)
2749 && (!POINTER_TYPE_P (type)
2750 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2752 error ("invalid use of `restrict'");
2753 type_quals &= ~TYPE_QUAL_RESTRICT;
2756 return build_qualified_type (type, type_quals);
2759 /* Apply the TYPE_QUALS to the new DECL. */
2762 c_apply_type_quals_to_decl (int type_quals, tree decl)
2764 tree type = TREE_TYPE (decl);
2766 if (type == error_mark_node)
2769 if (((type_quals & TYPE_QUAL_CONST)
2770 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2771 /* An object declared 'const' is only readonly after it is
2772 initialized. We don't have any way of expressing this currently,
2773 so we need to be conservative and unset TREE_READONLY for types
2774 with constructors. Otherwise aliasing code will ignore stores in
2775 an inline constructor. */
2776 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2777 TREE_READONLY (decl) = 1;
2778 if (type_quals & TYPE_QUAL_VOLATILE)
2780 TREE_SIDE_EFFECTS (decl) = 1;
2781 TREE_THIS_VOLATILE (decl) = 1;
2783 if (type_quals & TYPE_QUAL_RESTRICT)
2785 while (type && TREE_CODE (type) == ARRAY_TYPE)
2786 /* Allow 'restrict' on arrays of pointers.
2787 FIXME currently we just ignore it. */
2788 type = TREE_TYPE (type);
2790 || !POINTER_TYPE_P (type)
2791 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2792 error ("invalid use of `restrict'");
2793 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2794 /* Indicate we need to make a unique alias set for this pointer.
2795 We can't do it here because it might be pointing to an
2797 DECL_POINTER_ALIAS_SET (decl) = -2;
2801 /* Hash function for the problem of multiple type definitions in
2802 different files. This must hash all types that will compare
2803 equal via comptypes to the same value. In practice it hashes
2804 on some of the simple stuff and leaves the details to comptypes. */
2807 c_type_hash (const void *p)
2813 switch (TREE_CODE (t))
2815 /* For pointers, hash on pointee type plus some swizzling. */
2817 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
2818 /* Hash on number of elements and total size. */
2821 t2 = TYPE_VALUES (t);
2825 t2 = TYPE_FIELDS (t);
2827 case QUAL_UNION_TYPE:
2829 t2 = TYPE_FIELDS (t);
2833 t2 = TYPE_FIELDS (t);
2838 for (; t2; t2 = TREE_CHAIN (t2))
2840 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
2841 return ((size << 24) | (i << shift));
2844 /* Return the typed-based alias set for T, which may be an expression
2845 or a type. Return -1 if we don't do anything special. */
2848 c_common_get_alias_set (tree t)
2852 static htab_t type_hash_table;
2854 /* Permit type-punning when accessing a union, provided the access
2855 is directly through the union. For example, this code does not
2856 permit taking the address of a union member and then storing
2857 through it. Even the type-punning allowed here is a GCC
2858 extension, albeit a common and useful one; the C standard says
2859 that such accesses have implementation-defined behavior. */
2861 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2862 u = TREE_OPERAND (u, 0))
2863 if (TREE_CODE (u) == COMPONENT_REF
2864 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2867 /* That's all the expressions we handle specially. */
2871 /* The C standard guarantees that any object may be accessed via an
2872 lvalue that has character type. */
2873 if (t == char_type_node
2874 || t == signed_char_type_node
2875 || t == unsigned_char_type_node)
2878 /* If it has the may_alias attribute, it can alias anything. */
2879 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2882 /* The C standard specifically allows aliasing between signed and
2883 unsigned variants of the same type. We treat the signed
2884 variant as canonical. */
2885 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
2887 tree t1 = c_common_signed_type (t);
2889 /* t1 == t can happen for boolean nodes which are always unsigned. */
2891 return get_alias_set (t1);
2893 else if (POINTER_TYPE_P (t))
2897 /* Unfortunately, there is no canonical form of a pointer type.
2898 In particular, if we have `typedef int I', then `int *', and
2899 `I *' are different types. So, we have to pick a canonical
2900 representative. We do this below.
2902 Technically, this approach is actually more conservative that
2903 it needs to be. In particular, `const int *' and `int *'
2904 should be in different alias sets, according to the C and C++
2905 standard, since their types are not the same, and so,
2906 technically, an `int **' and `const int **' cannot point at
2909 But, the standard is wrong. In particular, this code is
2914 const int* const* cipp = ipp;
2916 And, it doesn't make sense for that to be legal unless you
2917 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2918 the pointed-to types. This issue has been reported to the
2920 t1 = build_type_no_quals (t);
2922 return get_alias_set (t1);
2925 /* Handle the case of multiple type nodes referring to "the same" type,
2926 which occurs with IMA. These share an alias set. FIXME: Currently only
2927 C90 is handled. (In C99 type compatibility is not transitive, which
2928 complicates things mightily. The alias set splay trees can theoretically
2929 represent this, but insertion is tricky when you consider all the
2930 different orders things might arrive in.) */
2932 if (c_language != clk_c || flag_isoc99)
2935 /* Save time if there's only one input file. */
2936 if (!current_file_decl || TREE_CHAIN (current_file_decl) == NULL_TREE)
2939 /* Pointers need special handling if they point to any type that
2940 needs special handling (below). */
2941 if (TREE_CODE (t) == POINTER_TYPE)
2944 /* Find bottom type under any nested POINTERs. */
2945 for (t2 = TREE_TYPE (t);
2946 TREE_CODE (t2) == POINTER_TYPE;
2947 t2 = TREE_TYPE (t2))
2949 if (TREE_CODE (t2) != RECORD_TYPE
2950 && TREE_CODE (t2) != ENUMERAL_TYPE
2951 && TREE_CODE (t2) != QUAL_UNION_TYPE
2952 && TREE_CODE (t2) != UNION_TYPE)
2954 if (TYPE_SIZE (t2) == 0)
2957 /* These are the only cases that need special handling. */
2958 if (TREE_CODE (t) != RECORD_TYPE
2959 && TREE_CODE (t) != ENUMERAL_TYPE
2960 && TREE_CODE (t) != QUAL_UNION_TYPE
2961 && TREE_CODE (t) != UNION_TYPE
2962 && TREE_CODE (t) != POINTER_TYPE)
2965 if (TYPE_SIZE (t) == 0)
2968 /* Look up t in hash table. Only one of the compatible types within each
2969 alias set is recorded in the table. */
2970 if (!type_hash_table)
2971 type_hash_table = htab_create (1021, c_type_hash,
2972 (htab_eq) lang_hooks.types_compatible_p,
2974 slot = htab_find_slot (type_hash_table, t, INSERT);
2976 return TYPE_ALIAS_SET ((tree)*slot);
2978 /* Our caller will assign and record (in t) a new alias set; all we need
2979 to do is remember t in the hash table. */
2985 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2986 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2987 flag controls whether we should diagnose possibly ill-formed
2988 constructs or not. */
2990 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2992 const char *op_name;
2994 enum tree_code type_code = TREE_CODE (type);
2996 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2997 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2999 if (type_code == FUNCTION_TYPE)
3001 if (op == SIZEOF_EXPR)
3003 if (complain && (pedantic || warn_pointer_arith))
3004 pedwarn ("invalid application of `sizeof' to a function type");
3005 value = size_one_node;
3008 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
3010 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
3012 if (type_code == VOID_TYPE
3013 && complain && (pedantic || warn_pointer_arith))
3014 pedwarn ("invalid application of `%s' to a void type", op_name);
3015 value = size_one_node;
3017 else if (!COMPLETE_TYPE_P (type))
3020 error ("invalid application of `%s' to an incomplete type", op_name);
3021 value = size_zero_node;
3025 if (op == SIZEOF_EXPR)
3026 /* Convert in case a char is more than one unit. */
3027 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
3028 size_int (TYPE_PRECISION (char_type_node)
3031 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
3034 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3035 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3036 never happen. However, this node should really have type
3037 `size_t', which is just a typedef for an ordinary integer type. */
3038 value = fold (build1 (NOP_EXPR, size_type_node, value));
3039 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
3044 /* Implement the __alignof keyword: Return the minimum required
3045 alignment of EXPR, measured in bytes. For VAR_DECL's and
3046 FIELD_DECL's return DECL_ALIGN (which can be set from an
3047 "aligned" __attribute__ specification). */
3050 c_alignof_expr (tree expr)
3054 if (TREE_CODE (expr) == VAR_DECL)
3055 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
3057 else if (TREE_CODE (expr) == COMPONENT_REF
3058 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
3060 error ("`__alignof' applied to a bit-field");
3063 else if (TREE_CODE (expr) == COMPONENT_REF
3064 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
3065 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
3067 else if (TREE_CODE (expr) == INDIRECT_REF)
3069 tree t = TREE_OPERAND (expr, 0);
3071 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3073 while (TREE_CODE (t) == NOP_EXPR
3074 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3078 t = TREE_OPERAND (t, 0);
3079 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3080 if (thisalign > bestalign)
3081 best = t, bestalign = thisalign;
3083 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3086 return c_alignof (TREE_TYPE (expr));
3088 return fold (build1 (NOP_EXPR, size_type_node, t));
3091 /* Handle C and C++ default attributes. */
3093 enum built_in_attribute
3095 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3096 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3097 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3098 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3099 #include "builtin-attrs.def"
3100 #undef DEF_ATTR_NULL_TREE
3102 #undef DEF_ATTR_IDENT
3103 #undef DEF_ATTR_TREE_LIST
3107 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3109 static void c_init_attributes (void);
3111 /* Build tree nodes and builtin functions common to both C and C++ language
3115 c_common_nodes_and_builtins (void)
3119 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3120 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3121 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3122 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3123 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3124 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3125 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3126 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3127 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3128 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3129 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3130 #include "builtin-types.def"
3131 #undef DEF_PRIMITIVE_TYPE
3132 #undef DEF_FUNCTION_TYPE_0
3133 #undef DEF_FUNCTION_TYPE_1
3134 #undef DEF_FUNCTION_TYPE_2
3135 #undef DEF_FUNCTION_TYPE_3
3136 #undef DEF_FUNCTION_TYPE_4
3137 #undef DEF_FUNCTION_TYPE_VAR_0
3138 #undef DEF_FUNCTION_TYPE_VAR_1
3139 #undef DEF_FUNCTION_TYPE_VAR_2
3140 #undef DEF_FUNCTION_TYPE_VAR_3
3141 #undef DEF_POINTER_TYPE
3145 typedef enum builtin_type builtin_type;
3147 tree builtin_types[(int) BT_LAST];
3148 int wchar_type_size;
3149 tree array_domain_type;
3150 tree va_list_ref_type_node;
3151 tree va_list_arg_type_node;
3153 /* Define `int' and `char' first so that dbx will output them first. */
3154 record_builtin_type (RID_INT, NULL, integer_type_node);
3155 record_builtin_type (RID_CHAR, "char", char_type_node);
3157 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3158 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3159 but not C. Are the conditionals here needed? */
3160 if (c_dialect_cxx ())
3161 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3162 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3163 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3164 record_builtin_type (RID_MAX, "long unsigned int",
3165 long_unsigned_type_node);
3166 if (c_dialect_cxx ())
3167 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3168 record_builtin_type (RID_MAX, "long long int",
3169 long_long_integer_type_node);
3170 record_builtin_type (RID_MAX, "long long unsigned int",
3171 long_long_unsigned_type_node);
3172 if (c_dialect_cxx ())
3173 record_builtin_type (RID_MAX, "long long unsigned",
3174 long_long_unsigned_type_node);
3175 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3176 record_builtin_type (RID_MAX, "short unsigned int",
3177 short_unsigned_type_node);
3178 if (c_dialect_cxx ())
3179 record_builtin_type (RID_MAX, "unsigned short",
3180 short_unsigned_type_node);
3182 /* Define both `signed char' and `unsigned char'. */
3183 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3184 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3186 /* These are types that c_common_type_for_size and
3187 c_common_type_for_mode use. */
3188 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3190 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3192 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3194 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3196 #if HOST_BITS_PER_WIDE_INT >= 64
3197 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3198 get_identifier ("__int128_t"),
3201 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3202 unsigned_intQI_type_node));
3203 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3204 unsigned_intHI_type_node));
3205 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3206 unsigned_intSI_type_node));
3207 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3208 unsigned_intDI_type_node));
3209 #if HOST_BITS_PER_WIDE_INT >= 64
3210 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3211 get_identifier ("__uint128_t"),
3212 unsigned_intTI_type_node));
3215 /* Create the widest literal types. */
3216 widest_integer_literal_type_node
3217 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3218 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3219 widest_integer_literal_type_node));
3221 widest_unsigned_literal_type_node
3222 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3223 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3224 widest_unsigned_literal_type_node));
3226 /* `unsigned long' is the standard type for sizeof.
3227 Note that stddef.h uses `unsigned long',
3228 and this must agree, even if long and int are the same size. */
3230 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3231 signed_size_type_node = c_common_signed_type (size_type_node);
3232 set_sizetype (size_type_node);
3235 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
3237 build_common_tree_nodes_2 (flag_short_double);
3239 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3240 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3241 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3243 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3244 get_identifier ("complex int"),
3245 complex_integer_type_node));
3246 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3247 get_identifier ("complex float"),
3248 complex_float_type_node));
3249 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3250 get_identifier ("complex double"),
3251 complex_double_type_node));
3252 lang_hooks.decls.pushdecl
3253 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3254 complex_long_double_type_node));
3256 /* Types which are common to the fortran compiler and libf2c. When
3257 changing these, you also need to be concerned with f/com.h. */
3259 if (TYPE_PRECISION (float_type_node)
3260 == TYPE_PRECISION (long_integer_type_node))
3262 g77_integer_type_node = long_integer_type_node;
3263 g77_uinteger_type_node = long_unsigned_type_node;
3265 else if (TYPE_PRECISION (float_type_node)
3266 == TYPE_PRECISION (integer_type_node))
3268 g77_integer_type_node = integer_type_node;
3269 g77_uinteger_type_node = unsigned_type_node;
3272 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3274 if (g77_integer_type_node != NULL_TREE)
3276 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3277 get_identifier ("__g77_integer"),
3278 g77_integer_type_node));
3279 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3280 get_identifier ("__g77_uinteger"),
3281 g77_uinteger_type_node));
3284 if (TYPE_PRECISION (float_type_node) * 2
3285 == TYPE_PRECISION (long_integer_type_node))
3287 g77_longint_type_node = long_integer_type_node;
3288 g77_ulongint_type_node = long_unsigned_type_node;
3290 else if (TYPE_PRECISION (float_type_node) * 2
3291 == TYPE_PRECISION (long_long_integer_type_node))
3293 g77_longint_type_node = long_long_integer_type_node;
3294 g77_ulongint_type_node = long_long_unsigned_type_node;
3297 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3299 if (g77_longint_type_node != NULL_TREE)
3301 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3302 get_identifier ("__g77_longint"),
3303 g77_longint_type_node));
3304 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3305 get_identifier ("__g77_ulongint"),
3306 g77_ulongint_type_node));
3309 record_builtin_type (RID_VOID, NULL, void_type_node);
3311 void_zero_node = build_int_2 (0, 0);
3312 TREE_TYPE (void_zero_node) = void_type_node;
3314 void_list_node = build_void_list_node ();
3316 /* Make a type to be the domain of a few array types
3317 whose domains don't really matter.
3318 200 is small enough that it always fits in size_t
3319 and large enough that it can hold most function names for the
3320 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3321 array_domain_type = build_index_type (size_int (200));
3323 /* Make a type for arrays of characters.
3324 With luck nothing will ever really depend on the length of this
3326 char_array_type_node
3327 = build_array_type (char_type_node, array_domain_type);
3329 /* Likewise for arrays of ints. */
3331 = build_array_type (integer_type_node, array_domain_type);
3333 string_type_node = build_pointer_type (char_type_node);
3334 const_string_type_node
3335 = build_pointer_type (build_qualified_type
3336 (char_type_node, TYPE_QUAL_CONST));
3338 /* This is special for C++ so functions can be overloaded. */
3339 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3340 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3341 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3342 if (c_dialect_cxx ())
3344 if (TYPE_UNSIGNED (wchar_type_node))
3345 wchar_type_node = make_unsigned_type (wchar_type_size);
3347 wchar_type_node = make_signed_type (wchar_type_size);
3348 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3352 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3353 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3356 /* This is for wide string constants. */
3357 wchar_array_type_node
3358 = build_array_type (wchar_type_node, array_domain_type);
3361 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3364 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3366 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3368 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3370 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3371 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3373 lang_hooks.decls.pushdecl
3374 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3375 va_list_type_node));
3377 lang_hooks.decls.pushdecl
3378 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3379 ptrdiff_type_node));
3381 lang_hooks.decls.pushdecl
3382 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3385 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3387 va_list_arg_type_node = va_list_ref_type_node =
3388 build_pointer_type (TREE_TYPE (va_list_type_node));
3392 va_list_arg_type_node = va_list_type_node;
3393 va_list_ref_type_node = build_reference_type (va_list_type_node);
3396 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3397 builtin_types[(int) ENUM] = VALUE;
3398 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3399 builtin_types[(int) ENUM] \
3400 = build_function_type (builtin_types[(int) RETURN], \
3402 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3403 builtin_types[(int) ENUM] \
3404 = build_function_type (builtin_types[(int) RETURN], \
3405 tree_cons (NULL_TREE, \
3406 builtin_types[(int) ARG1], \
3408 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3409 builtin_types[(int) ENUM] \
3410 = build_function_type \
3411 (builtin_types[(int) RETURN], \
3412 tree_cons (NULL_TREE, \
3413 builtin_types[(int) ARG1], \
3414 tree_cons (NULL_TREE, \
3415 builtin_types[(int) ARG2], \
3417 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3418 builtin_types[(int) ENUM] \
3419 = build_function_type \
3420 (builtin_types[(int) RETURN], \
3421 tree_cons (NULL_TREE, \
3422 builtin_types[(int) ARG1], \
3423 tree_cons (NULL_TREE, \
3424 builtin_types[(int) ARG2], \
3425 tree_cons (NULL_TREE, \
3426 builtin_types[(int) ARG3], \
3428 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3429 builtin_types[(int) ENUM] \
3430 = build_function_type \
3431 (builtin_types[(int) RETURN], \
3432 tree_cons (NULL_TREE, \
3433 builtin_types[(int) ARG1], \
3434 tree_cons (NULL_TREE, \
3435 builtin_types[(int) ARG2], \
3438 builtin_types[(int) ARG3], \
3439 tree_cons (NULL_TREE, \
3440 builtin_types[(int) ARG4], \
3441 void_list_node)))));
3442 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3443 builtin_types[(int) ENUM] \
3444 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3445 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3446 builtin_types[(int) ENUM] \
3447 = build_function_type (builtin_types[(int) RETURN], \
3448 tree_cons (NULL_TREE, \
3449 builtin_types[(int) ARG1], \
3452 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3453 builtin_types[(int) ENUM] \
3454 = build_function_type \
3455 (builtin_types[(int) RETURN], \
3456 tree_cons (NULL_TREE, \
3457 builtin_types[(int) ARG1], \
3458 tree_cons (NULL_TREE, \
3459 builtin_types[(int) ARG2], \
3462 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3463 builtin_types[(int) ENUM] \
3464 = build_function_type \
3465 (builtin_types[(int) RETURN], \
3466 tree_cons (NULL_TREE, \
3467 builtin_types[(int) ARG1], \
3468 tree_cons (NULL_TREE, \
3469 builtin_types[(int) ARG2], \
3470 tree_cons (NULL_TREE, \
3471 builtin_types[(int) ARG3], \
3474 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3475 builtin_types[(int) ENUM] \
3476 = build_pointer_type (builtin_types[(int) TYPE]);
3477 #include "builtin-types.def"
3478 #undef DEF_PRIMITIVE_TYPE
3479 #undef DEF_FUNCTION_TYPE_1
3480 #undef DEF_FUNCTION_TYPE_2
3481 #undef DEF_FUNCTION_TYPE_3
3482 #undef DEF_FUNCTION_TYPE_4
3483 #undef DEF_FUNCTION_TYPE_VAR_0
3484 #undef DEF_FUNCTION_TYPE_VAR_1
3485 #undef DEF_FUNCTION_TYPE_VAR_2
3486 #undef DEF_FUNCTION_TYPE_VAR_3
3487 #undef DEF_POINTER_TYPE
3489 c_init_attributes ();
3491 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3492 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3497 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3501 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3504 ? (NAME + strlen ("__builtin_")) \
3506 built_in_attributes[(int) ATTRS]); \
3508 decl = builtin_function_2 (NAME, \
3509 NAME + strlen ("__builtin_"), \
3510 builtin_types[TYPE], \
3511 builtin_types[LIBTYPE], \
3516 built_in_attributes[(int) ATTRS]); \
3518 built_in_decls[(int) ENUM] = decl; \
3520 implicit_built_in_decls[(int) ENUM] = decl; \
3522 #include "builtins.def"
3525 targetm.init_builtins ();
3527 main_identifier_node = get_identifier ("main");
3531 build_va_arg (tree expr, tree type)
3533 return build1 (VA_ARG_EXPR, type, expr);
3537 /* Linked list of disabled built-in functions. */
3539 typedef struct disabled_builtin
3542 struct disabled_builtin *next;
3544 static disabled_builtin *disabled_builtins = NULL;
3546 static bool builtin_function_disabled_p (const char *);
3548 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3549 begins with "__builtin_", give an error. */
3552 disable_builtin_function (const char *name)
3554 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3555 error ("cannot disable built-in function `%s'", name);
3558 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3560 new->next = disabled_builtins;
3561 disabled_builtins = new;
3566 /* Return true if the built-in function NAME has been disabled, false
3570 builtin_function_disabled_p (const char *name)
3572 disabled_builtin *p;
3573 for (p = disabled_builtins; p != NULL; p = p->next)
3575 if (strcmp (name, p->name) == 0)
3582 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3583 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3584 of these may be NULL (though both being NULL is useless).
3585 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3586 TYPE is the type of the function with the ordinary name. These
3587 may differ if the ordinary name is declared with a looser type to avoid
3588 conflicts with headers. FUNCTION_CODE and CLASS are as for
3589 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3590 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3591 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3592 ATTRS is the tree list representing the builtin's function attributes.
3593 Returns the declaration of BUILTIN_NAME, if any, otherwise
3594 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3595 or if NONANSI_P and flag_no_nonansi_builtin. */
3598 builtin_function_2 (const char *builtin_name, const char *name,
3599 tree builtin_type, tree type, int function_code,
3600 enum built_in_class class, int library_name_p,
3601 int nonansi_p, tree attrs)
3603 tree bdecl = NULL_TREE;
3604 tree decl = NULL_TREE;
3606 if (builtin_name != 0)
3607 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3608 class, library_name_p ? name : NULL, attrs);
3610 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3611 && !(nonansi_p && flag_no_nonansi_builtin))
3612 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3614 return (bdecl != 0 ? bdecl : decl);
3617 /* Nonzero if the type T promotes to int. This is (nearly) the
3618 integral promotions defined in ISO C99 6.3.1.1/2. */
3621 c_promoting_integer_type_p (tree t)
3623 switch (TREE_CODE (t))
3626 return (TYPE_MAIN_VARIANT (t) == char_type_node
3627 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3628 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3629 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3630 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3631 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3634 /* ??? Technically all enumerations not larger than an int
3635 promote to an int. But this is used along code paths
3636 that only want to notice a size change. */
3637 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3647 /* Return 1 if PARMS specifies a fixed number of parameters
3648 and none of their types is affected by default promotions. */
3651 self_promoting_args_p (tree parms)
3654 for (t = parms; t; t = TREE_CHAIN (t))
3656 tree type = TREE_VALUE (t);
3658 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3664 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3667 if (c_promoting_integer_type_p (type))
3673 /* Recursively examines the array elements of TYPE, until a non-array
3674 element type is found. */
3677 strip_array_types (tree type)
3679 while (TREE_CODE (type) == ARRAY_TYPE)
3680 type = TREE_TYPE (type);
3685 /* Recursively remove any '*' or '&' operator from TYPE. */
3687 strip_pointer_operator (tree t)
3689 while (POINTER_TYPE_P (t))
3694 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3696 /* Expand a call to an unordered comparison function such as
3697 __builtin_isgreater(). FUNCTION is the function's declaration and
3698 PARAMS a list of the values passed. For __builtin_isunordered(),
3699 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3700 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3701 that give the opposite of the desired result. UNORDERED_CODE is
3702 used for modes that can hold NaNs and ORDERED_CODE is used for the
3706 expand_unordered_cmp (tree function, tree params,
3707 enum tree_code unordered_code,
3708 enum tree_code ordered_code)
3710 tree arg0, arg1, type;
3711 enum tree_code code0, code1;
3713 /* Check that we have exactly two arguments. */
3714 if (params == 0 || TREE_CHAIN (params) == 0)
3716 error ("too few arguments to function `%s'",
3717 IDENTIFIER_POINTER (DECL_NAME (function)));
3718 return error_mark_node;
3720 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3722 error ("too many arguments to function `%s'",
3723 IDENTIFIER_POINTER (DECL_NAME (function)));
3724 return error_mark_node;
3727 arg0 = TREE_VALUE (params);
3728 arg1 = TREE_VALUE (TREE_CHAIN (params));
3730 code0 = TREE_CODE (TREE_TYPE (arg0));
3731 code1 = TREE_CODE (TREE_TYPE (arg1));
3733 /* Make sure that the arguments have a common type of REAL. */
3735 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3736 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3737 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3739 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3741 error ("non-floating-point argument to function `%s'",
3742 IDENTIFIER_POINTER (DECL_NAME (function)));
3743 return error_mark_node;
3746 if (unordered_code == UNORDERED_EXPR)
3748 if (MODE_HAS_NANS (TYPE_MODE (type)))
3749 return build_binary_op (unordered_code,
3750 convert (type, arg0),
3751 convert (type, arg1),
3754 return integer_zero_node;
3757 return build_unary_op (TRUTH_NOT_EXPR,
3758 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3761 convert (type, arg0),
3762 convert (type, arg1),
3768 /* Recognize certain built-in functions so we can make tree-codes
3769 other than CALL_EXPR. We do this when it enables fold-const.c
3770 to do something useful. */
3771 /* ??? By rights this should go in builtins.c, but only C and C++
3772 implement build_{binary,unary}_op. Not exactly sure what bits
3773 of functionality are actually needed from those functions, or
3774 where the similar functionality exists in the other front ends. */
3777 expand_tree_builtin (tree function, tree params, tree coerced_params)
3779 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3782 switch (DECL_FUNCTION_CODE (function))
3786 case BUILT_IN_LLABS:
3787 case BUILT_IN_IMAXABS:
3789 case BUILT_IN_FABSL:
3790 case BUILT_IN_FABSF:
3791 if (coerced_params == 0)
3792 return integer_zero_node;
3793 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3796 case BUILT_IN_CONJF:
3797 case BUILT_IN_CONJL:
3798 if (coerced_params == 0)
3799 return integer_zero_node;
3800 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3802 case BUILT_IN_CREAL:
3803 case BUILT_IN_CREALF:
3804 case BUILT_IN_CREALL:
3805 if (coerced_params == 0)
3806 return integer_zero_node;
3807 return non_lvalue (build_unary_op (REALPART_EXPR,
3808 TREE_VALUE (coerced_params), 0));
3810 case BUILT_IN_CIMAG:
3811 case BUILT_IN_CIMAGF:
3812 case BUILT_IN_CIMAGL:
3813 if (coerced_params == 0)
3814 return integer_zero_node;
3815 return non_lvalue (build_unary_op (IMAGPART_EXPR,
3816 TREE_VALUE (coerced_params), 0));
3818 case BUILT_IN_ISGREATER:
3819 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3821 case BUILT_IN_ISGREATEREQUAL:
3822 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3824 case BUILT_IN_ISLESS:
3825 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3827 case BUILT_IN_ISLESSEQUAL:
3828 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3830 case BUILT_IN_ISLESSGREATER:
3831 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3833 case BUILT_IN_ISUNORDERED:
3834 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3843 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3844 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3845 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3846 value, the traversal is aborted, and the value returned by FUNC is
3847 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3848 the node being visited are not walked.
3850 We don't need a without_duplicates variant of this one because the
3851 statement tree is a tree, not a graph. */
3854 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3856 enum tree_code code;
3861 #define WALK_SUBTREE(NODE) \
3864 result = walk_stmt_tree (&(NODE), func, data); \
3870 /* Skip empty subtrees. */
3874 /* Skip subtrees below non-statement nodes. */
3875 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3878 /* Call the function. */
3880 result = (*func) (tp, &walk_subtrees, data);
3882 /* If we found something, return it. */
3886 /* FUNC may have modified the tree, recheck that we're looking at a
3888 code = TREE_CODE (*tp);
3889 if (!STATEMENT_CODE_P (code))
3892 /* Visit the subtrees unless FUNC decided that there was nothing
3893 interesting below this point in the tree. */
3896 /* Walk over all the sub-trees of this operand. Statement nodes
3897 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3898 len = TREE_CODE_LENGTH (code);
3900 /* Go through the subtrees. We need to do this in forward order so
3901 that the scope of a FOR_EXPR is handled properly. */
3902 for (i = 0; i < len; ++i)
3903 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3906 /* Finally visit the chain. This can be tail-recursion optimized if
3907 we write it this way. */
3908 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3913 /* Used to compare case labels. K1 and K2 are actually tree nodes
3914 representing case labels, or NULL_TREE for a `default' label.
3915 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3916 K2, and 0 if K1 and K2 are equal. */
3919 case_compare (splay_tree_key k1, splay_tree_key k2)
3921 /* Consider a NULL key (such as arises with a `default' label) to be
3922 smaller than anything else. */
3928 return tree_int_cst_compare ((tree) k1, (tree) k2);
3931 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3932 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3933 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3934 case label was declared using the usual C/C++ syntax, rather than
3935 the GNU case range extension. CASES is a tree containing all the
3936 case ranges processed so far; COND is the condition for the
3937 switch-statement itself. Returns the CASE_LABEL created, or
3938 ERROR_MARK_NODE if no CASE_LABEL is created. */
3941 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3947 splay_tree_node node;
3949 /* Create the LABEL_DECL itself. */
3950 label = create_artificial_label ();
3952 /* If there was an error processing the switch condition, bail now
3953 before we get more confused. */
3954 if (!cond || cond == error_mark_node)
3957 if ((low_value && TREE_TYPE (low_value)
3958 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3959 || (high_value && TREE_TYPE (high_value)
3960 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3961 error ("pointers are not permitted as case values");
3963 /* Case ranges are a GNU extension. */
3964 if (high_value && pedantic)
3965 pedwarn ("range expressions in switch statements are non-standard");
3967 type = TREE_TYPE (cond);
3970 low_value = check_case_value (low_value);
3971 low_value = convert_and_check (type, low_value);
3975 high_value = check_case_value (high_value);
3976 high_value = convert_and_check (type, high_value);
3979 /* If an error has occurred, bail out now. */
3980 if (low_value == error_mark_node || high_value == error_mark_node)
3983 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3984 really a case range, even though it was written that way. Remove
3985 the HIGH_VALUE to simplify later processing. */
3986 if (tree_int_cst_equal (low_value, high_value))
3987 high_value = NULL_TREE;
3988 if (low_value && high_value
3989 && !tree_int_cst_lt (low_value, high_value))
3990 warning ("empty range specified");
3992 /* Look up the LOW_VALUE in the table of case labels we already
3994 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3995 /* If there was not an exact match, check for overlapping ranges.
3996 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3997 that's a `default' label and the only overlap is an exact match. */
3998 if (!node && (low_value || high_value))
4000 splay_tree_node low_bound;
4001 splay_tree_node high_bound;
4003 /* Even though there wasn't an exact match, there might be an
4004 overlap between this case range and another case range.
4005 Since we've (inductively) not allowed any overlapping case
4006 ranges, we simply need to find the greatest low case label
4007 that is smaller that LOW_VALUE, and the smallest low case
4008 label that is greater than LOW_VALUE. If there is an overlap
4009 it will occur in one of these two ranges. */
4010 low_bound = splay_tree_predecessor (cases,
4011 (splay_tree_key) low_value);
4012 high_bound = splay_tree_successor (cases,
4013 (splay_tree_key) low_value);
4015 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4016 the LOW_VALUE, so there is no need to check unless the
4017 LOW_BOUND is in fact itself a case range. */
4019 && CASE_HIGH ((tree) low_bound->value)
4020 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
4023 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4024 range is bigger than the low end of the current range, so we
4025 are only interested if the current range is a real range, and
4026 not an ordinary case label. */
4029 && (tree_int_cst_compare ((tree) high_bound->key,
4034 /* If there was an overlap, issue an error. */
4037 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
4041 error ("duplicate (or overlapping) case value");
4042 error ("%Jthis is the first entry overlapping that value", duplicate);
4046 error ("duplicate case value") ;
4047 error ("%Jpreviously used here", duplicate);
4051 error ("multiple default labels in one switch");
4052 error ("%Jthis is the first default label", duplicate);
4057 /* Add a CASE_LABEL to the statement-tree. */
4058 case_label = add_stmt (build_case_label (low_value, high_value, label));
4059 /* Register this case label in the splay tree. */
4060 splay_tree_insert (cases,
4061 (splay_tree_key) low_value,
4062 (splay_tree_value) case_label);
4067 /* Add a label so that the back-end doesn't think that the beginning o
4068 the switch is unreachable. Note that we do not add a case label, as
4069 that just leads to duplicates and thence to aborts later on. */
4072 tree t = create_artificial_label ();
4073 add_stmt (build_stmt (LABEL_STMT, t));
4075 return error_mark_node;
4078 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
4079 Used to verify that case values match up with enumerator values. */
4082 match_case_to_enum_1 (tree key, tree type, tree label)
4084 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
4086 /* ??? Not working too hard to print the double-word value.
4087 Should perhaps be done with %lwd in the diagnostic routines? */
4088 if (TREE_INT_CST_HIGH (key) == 0)
4089 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
4090 TREE_INT_CST_LOW (key));
4091 else if (!TYPE_UNSIGNED (type)
4092 && TREE_INT_CST_HIGH (key) == -1
4093 && TREE_INT_CST_LOW (key) != 0)
4094 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
4095 -TREE_INT_CST_LOW (key));
4097 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
4098 TREE_INT_CST_HIGH (key), TREE_INT_CST_LOW (key));
4100 if (TYPE_NAME (type) == 0)
4101 warning ("%Jcase value `%s' not in enumerated type",
4102 CASE_LABEL_DECL (label), buf);
4104 warning ("%Jcase value `%s' not in enumerated type `%T'",
4105 CASE_LABEL_DECL (label), buf, type);
4109 match_case_to_enum (splay_tree_node node, void *data)
4111 tree label = (tree) node->value;
4114 /* Skip default case. */
4115 if (!CASE_LOW (label))
4118 /* If TREE_ADDRESSABLE is not set, that means CASE_LOW did not appear
4119 when we did our enum->case scan. Reset our scratch bit after. */
4120 if (!TREE_ADDRESSABLE (label))
4121 match_case_to_enum_1 (CASE_LOW (label), type, label);
4123 TREE_ADDRESSABLE (label) = 0;
4125 /* If CASE_HIGH is non-null, we have a range. Here we must search.
4126 Note that the old code in stmt.c did not check for the values in
4127 the range either, just the endpoints. */
4128 if (CASE_HIGH (label))
4130 tree chain, key = CASE_HIGH (label);
4132 for (chain = TYPE_VALUES (type);
4133 chain && !tree_int_cst_equal (key, TREE_VALUE (chain));
4134 chain = TREE_CHAIN (chain))
4137 match_case_to_enum_1 (key, type, label);
4143 /* Handle -Wswitch*. Called from the front end after parsing the switch
4145 /* ??? Should probably be somewhere generic, since other languages besides
4146 C and C++ would want this. We'd want to agree on the datastructure,
4147 however, which is a problem. Alternately, we operate on gimplified
4148 switch_exprs, which I don't especially like. At the moment, however,
4149 C/C++ are the only tree-ssa languages that support enumerations at all,
4150 so the point is moot. */
4153 c_do_switch_warnings (splay_tree cases, tree switch_stmt)
4155 splay_tree_node default_node;
4156 location_t *switch_locus;
4159 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
4162 switch_locus = EXPR_LOCUS (switch_stmt);
4164 switch_locus = &input_location;
4165 type = SWITCH_TYPE (switch_stmt);
4167 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
4168 if (warn_switch_default && !default_node)
4169 warning ("%Hswitch missing default case", switch_locus);
4171 /* If the switch expression was an enumerated type, check that
4172 exactly all enumeration literals are covered by the cases.
4173 The check is made when -Wswitch was specified and there is no
4174 default case, or when -Wswitch-enum was specified. */
4175 if (((warn_switch && !default_node) || warn_switch_enum)
4176 && type && TREE_CODE (type) == ENUMERAL_TYPE
4177 && TREE_CODE (SWITCH_COND (switch_stmt)) != INTEGER_CST)
4181 /* The time complexity here is O(N*lg(N)) worst case, but for the
4182 common case of monotonically increasing enumerators, it is
4183 O(N), since the nature of the splay tree will keep the next
4184 element adjacent to the root at all times. */
4186 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
4188 splay_tree_node node
4189 = splay_tree_lookup (cases, (splay_tree_key) TREE_VALUE (chain));
4193 /* Mark the CASE_LOW part of the case entry as seen, so
4194 that we save time later. Choose TREE_ADDRESSABLE
4195 randomly as a bit that won't have been set to-date. */
4196 tree label = (tree) node->value;
4197 TREE_ADDRESSABLE (label) = 1;
4201 /* Warn if there are enumerators that don't correspond to
4202 case expressions. */
4203 warning ("%Henumeration value `%E' not handled in switch",
4204 switch_locus, TREE_PURPOSE (chain));
4208 /* Warn if there are case expressions that don't correspond to
4209 enumerators. This can occur since C and C++ don't enforce
4210 type-checking of assignments to enumeration variables.
4212 The time complexity here is O(N**2) worst case, since we've
4213 not sorted the enumeration values. However, in the absence
4214 of case ranges this is O(N), since all single cases that
4215 corresponded to enumerations have been marked above. */
4217 splay_tree_foreach (cases, match_case_to_enum, type);
4221 /* Finish an expression taking the address of LABEL (an
4222 IDENTIFIER_NODE). Returns an expression for the address. */
4225 finish_label_address_expr (tree label)
4230 pedwarn ("taking the address of a label is non-standard");
4232 if (label == error_mark_node)
4233 return error_mark_node;
4235 label = lookup_label (label);
4236 if (label == NULL_TREE)
4237 result = null_pointer_node;
4240 TREE_USED (label) = 1;
4241 result = build1 (ADDR_EXPR, ptr_type_node, label);
4242 /* The current function in not necessarily uninlinable.
4243 Computed gotos are incompatible with inlining, but the value
4244 here could be used only in a diagnostic, for example. */
4250 /* Hook used by expand_expr to expand language-specific tree codes. */
4251 /* The only things that should go here are bits needed to expand
4252 constant initalizers. Everything else should be handled by the
4253 gimplification routines. */
4256 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
4257 int modifier /* Actually enum_modifier. */,
4260 switch (TREE_CODE (exp))
4262 case COMPOUND_LITERAL_EXPR:
4264 /* Initialize the anonymous variable declared in the compound
4265 literal, then return the variable. */
4266 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4267 emit_local_var (decl);
4268 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
4276 /* Hook used by safe_from_p to handle language-specific tree codes. */
4279 c_safe_from_p (rtx target, tree exp)
4281 /* We can see statements here when processing the body of a
4282 statement-expression. For a declaration statement declaring a
4283 variable, look at the variable's initializer. */
4284 if (TREE_CODE (exp) == DECL_STMT)
4286 tree decl = DECL_STMT_DECL (exp);
4288 if (TREE_CODE (decl) == VAR_DECL
4289 && DECL_INITIAL (decl)
4290 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4294 /* For any statement, we must follow the statement-chain. */
4295 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4296 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4298 /* Assume everything else is safe. */
4302 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4305 c_common_unsafe_for_reeval (tree exp)
4307 /* Statement expressions may not be reevaluated, likewise compound
4309 if (TREE_CODE (exp) == STMT_EXPR
4310 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4313 /* Walk all other expressions. */
4317 /* Hook used by staticp to handle language-specific tree codes. */
4320 c_staticp (tree exp)
4322 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4323 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4329 /* Given a boolean expression ARG, return a tree representing an increment
4330 or decrement (as indicated by CODE) of ARG. The front end must check for
4331 invalid cases (e.g., decrement in C++). */
4333 boolean_increment (enum tree_code code, tree arg)
4336 tree true_res = boolean_true_node;
4338 arg = stabilize_reference (arg);
4341 case PREINCREMENT_EXPR:
4342 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4344 case POSTINCREMENT_EXPR:
4345 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4346 arg = save_expr (arg);
4347 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4348 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4350 case PREDECREMENT_EXPR:
4351 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4353 case POSTDECREMENT_EXPR:
4354 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4355 arg = save_expr (arg);
4356 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4357 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4362 TREE_SIDE_EFFECTS (val) = 1;
4366 /* Built-in macros for stddef.h, that require macros defined in this
4369 c_stddef_cpp_builtins(void)
4371 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4372 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4373 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4374 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4378 c_init_attributes (void)
4380 /* Fill in the built_in_attributes array. */
4381 #define DEF_ATTR_NULL_TREE(ENUM) \
4382 built_in_attributes[(int) ENUM] = NULL_TREE;
4383 #define DEF_ATTR_INT(ENUM, VALUE) \
4384 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4385 #define DEF_ATTR_IDENT(ENUM, STRING) \
4386 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4387 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4388 built_in_attributes[(int) ENUM] \
4389 = tree_cons (built_in_attributes[(int) PURPOSE], \
4390 built_in_attributes[(int) VALUE], \
4391 built_in_attributes[(int) CHAIN]);
4392 #include "builtin-attrs.def"
4393 #undef DEF_ATTR_NULL_TREE
4395 #undef DEF_ATTR_IDENT
4396 #undef DEF_ATTR_TREE_LIST
4399 /* Attribute handlers common to C front ends. */
4401 /* Handle a "packed" attribute; arguments as in
4402 struct attribute_spec.handler. */
4405 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4406 int flags, bool *no_add_attrs)
4410 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4411 *node = build_type_copy (*node);
4412 TYPE_PACKED (*node) = 1;
4413 if (TYPE_MAIN_VARIANT (*node) == *node)
4415 /* If it is the main variant, then pack the other variants
4416 too. This happens in,
4419 struct Foo const *ptr; // creates a variant w/o packed flag
4420 } __ attribute__((packed)); // packs it now.
4424 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4425 TYPE_PACKED (probe) = 1;
4429 else if (TREE_CODE (*node) == FIELD_DECL)
4430 DECL_PACKED (*node) = 1;
4431 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4432 used for DECL_REGISTER. It wouldn't mean anything anyway.
4433 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4434 that changes what the typedef is typing. */
4437 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4438 *no_add_attrs = true;
4444 /* Handle a "nocommon" attribute; arguments as in
4445 struct attribute_spec.handler. */
4448 handle_nocommon_attribute (tree *node, tree name,
4449 tree args ATTRIBUTE_UNUSED,
4450 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4452 if (TREE_CODE (*node) == VAR_DECL)
4453 DECL_COMMON (*node) = 0;
4456 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4457 *no_add_attrs = true;
4463 /* Handle a "common" attribute; arguments as in
4464 struct attribute_spec.handler. */
4467 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4468 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4470 if (TREE_CODE (*node) == VAR_DECL)
4471 DECL_COMMON (*node) = 1;
4474 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4475 *no_add_attrs = true;
4481 /* Handle a "noreturn" attribute; arguments as in
4482 struct attribute_spec.handler. */
4485 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4486 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4488 tree type = TREE_TYPE (*node);
4490 /* See FIXME comment in c_common_attribute_table. */
4491 if (TREE_CODE (*node) == FUNCTION_DECL)
4492 TREE_THIS_VOLATILE (*node) = 1;
4493 else if (TREE_CODE (type) == POINTER_TYPE
4494 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4496 = build_pointer_type
4497 (build_type_variant (TREE_TYPE (type),
4498 TYPE_READONLY (TREE_TYPE (type)), 1));
4501 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4502 *no_add_attrs = true;
4508 /* Handle a "noinline" attribute; arguments as in
4509 struct attribute_spec.handler. */
4512 handle_noinline_attribute (tree *node, tree name,
4513 tree args ATTRIBUTE_UNUSED,
4514 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4516 if (TREE_CODE (*node) == FUNCTION_DECL)
4517 DECL_UNINLINABLE (*node) = 1;
4520 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4521 *no_add_attrs = true;
4527 /* Handle a "always_inline" attribute; arguments as in
4528 struct attribute_spec.handler. */
4531 handle_always_inline_attribute (tree *node, tree name,
4532 tree args ATTRIBUTE_UNUSED,
4533 int flags ATTRIBUTE_UNUSED,
4536 if (TREE_CODE (*node) == FUNCTION_DECL)
4538 /* Do nothing else, just set the attribute. We'll get at
4539 it later with lookup_attribute. */
4543 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4544 *no_add_attrs = true;
4550 /* Handle a "used" attribute; arguments as in
4551 struct attribute_spec.handler. */
4554 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4555 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4559 if (TREE_CODE (node) == FUNCTION_DECL
4560 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4562 TREE_USED (node) = 1;
4566 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4567 *no_add_attrs = true;
4573 /* Handle a "unused" attribute; arguments as in
4574 struct attribute_spec.handler. */
4577 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4578 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4584 if (TREE_CODE (decl) == PARM_DECL
4585 || TREE_CODE (decl) == VAR_DECL
4586 || TREE_CODE (decl) == FUNCTION_DECL
4587 || TREE_CODE (decl) == LABEL_DECL
4588 || TREE_CODE (decl) == TYPE_DECL)
4589 TREE_USED (decl) = 1;
4592 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4593 *no_add_attrs = true;
4598 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4599 *node = build_type_copy (*node);
4600 TREE_USED (*node) = 1;
4606 /* Handle a "const" attribute; arguments as in
4607 struct attribute_spec.handler. */
4610 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4611 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4613 tree type = TREE_TYPE (*node);
4615 /* See FIXME comment on noreturn in c_common_attribute_table. */
4616 if (TREE_CODE (*node) == FUNCTION_DECL)
4617 TREE_READONLY (*node) = 1;
4618 else if (TREE_CODE (type) == POINTER_TYPE
4619 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4621 = build_pointer_type
4622 (build_type_variant (TREE_TYPE (type), 1,
4623 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4626 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4627 *no_add_attrs = true;
4633 /* Handle a "transparent_union" attribute; arguments as in
4634 struct attribute_spec.handler. */
4637 handle_transparent_union_attribute (tree *node, tree name,
4638 tree args ATTRIBUTE_UNUSED, int flags,
4641 tree decl = NULL_TREE;
4648 type = &TREE_TYPE (decl);
4649 is_type = TREE_CODE (*node) == TYPE_DECL;
4651 else if (TYPE_P (*node))
4652 type = node, is_type = 1;
4655 && TREE_CODE (*type) == UNION_TYPE
4657 || (TYPE_FIELDS (*type) != 0
4658 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4660 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4661 *type = build_type_copy (*type);
4662 TYPE_TRANSPARENT_UNION (*type) = 1;
4664 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4665 && TREE_CODE (*type) == UNION_TYPE
4666 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4667 DECL_TRANSPARENT_UNION (decl) = 1;
4670 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4671 *no_add_attrs = true;
4677 /* Handle a "constructor" attribute; arguments as in
4678 struct attribute_spec.handler. */
4681 handle_constructor_attribute (tree *node, tree name,
4682 tree args ATTRIBUTE_UNUSED,
4683 int flags ATTRIBUTE_UNUSED,
4687 tree type = TREE_TYPE (decl);
4689 if (TREE_CODE (decl) == FUNCTION_DECL
4690 && TREE_CODE (type) == FUNCTION_TYPE
4691 && decl_function_context (decl) == 0)
4693 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4694 TREE_USED (decl) = 1;
4698 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4699 *no_add_attrs = true;
4705 /* Handle a "destructor" attribute; arguments as in
4706 struct attribute_spec.handler. */
4709 handle_destructor_attribute (tree *node, tree name,
4710 tree args ATTRIBUTE_UNUSED,
4711 int flags ATTRIBUTE_UNUSED,
4715 tree type = TREE_TYPE (decl);
4717 if (TREE_CODE (decl) == FUNCTION_DECL
4718 && TREE_CODE (type) == FUNCTION_TYPE
4719 && decl_function_context (decl) == 0)
4721 DECL_STATIC_DESTRUCTOR (decl) = 1;
4722 TREE_USED (decl) = 1;
4726 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4727 *no_add_attrs = true;
4733 /* Handle a "mode" attribute; arguments as in
4734 struct attribute_spec.handler. */
4737 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4738 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4742 *no_add_attrs = true;
4744 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4745 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4749 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4750 int len = strlen (p);
4751 enum machine_mode mode = VOIDmode;
4755 if (len > 4 && p[0] == '_' && p[1] == '_'
4756 && p[len - 1] == '_' && p[len - 2] == '_')
4758 char *newp = alloca (len - 1);
4760 strcpy (newp, &p[2]);
4761 newp[len - 4] = '\0';
4765 /* Change this type to have a type with the specified mode.
4766 First check for the special modes. */
4767 if (! strcmp (p, "byte"))
4769 else if (!strcmp (p, "word"))
4771 else if (! strcmp (p, "pointer"))
4774 for (j = 0; j < NUM_MACHINE_MODES; j++)
4775 if (!strcmp (p, GET_MODE_NAME (j)))
4776 mode = (enum machine_mode) j;
4778 if (mode == VOIDmode)
4780 error ("unknown machine mode `%s'", p);
4784 if (VECTOR_MODE_P (mode))
4786 warning ("specifying vector types with __attribute__ ((mode)) "
4788 warning ("use __attribute__ ((vector_size)) instead");
4791 typefm = lang_hooks.types.type_for_mode (mode, TYPE_UNSIGNED (type));
4792 if (typefm == NULL_TREE)
4793 error ("no data type for mode `%s'", p);
4795 else if ((TREE_CODE (type) == POINTER_TYPE
4796 || TREE_CODE (type) == REFERENCE_TYPE)
4797 && !targetm.valid_pointer_mode (mode))
4798 error ("invalid pointer mode `%s'", p);
4801 /* If this is a vector, make sure we either have hardware
4802 support, or we can emulate it. */
4803 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4805 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4809 if (TREE_CODE (type) == POINTER_TYPE)
4811 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4815 else if (TREE_CODE (type) == REFERENCE_TYPE)
4817 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4823 /* No need to layout the type here. The caller should do this. */
4830 /* Handle a "section" attribute; arguments as in
4831 struct attribute_spec.handler. */
4834 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4835 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4839 if (targetm.have_named_sections)
4841 if ((TREE_CODE (decl) == FUNCTION_DECL
4842 || TREE_CODE (decl) == VAR_DECL)
4843 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4845 if (TREE_CODE (decl) == VAR_DECL
4846 && current_function_decl != NULL_TREE
4847 && ! TREE_STATIC (decl))
4849 error ("%Jsection attribute cannot be specified for "
4850 "local variables", decl);
4851 *no_add_attrs = true;
4854 /* The decl may have already been given a section attribute
4855 from a previous declaration. Ensure they match. */
4856 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4857 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4858 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4860 error ("%Jsection of '%D' conflicts with previous declaration",
4862 *no_add_attrs = true;
4865 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4869 error ("%Jsection attribute not allowed for '%D'", *node, *node);
4870 *no_add_attrs = true;
4875 error ("%Jsection attributes are not supported for this target", *node);
4876 *no_add_attrs = true;
4882 /* Handle a "aligned" attribute; arguments as in
4883 struct attribute_spec.handler. */
4886 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4887 int flags, bool *no_add_attrs)
4889 tree decl = NULL_TREE;
4892 tree align_expr = (args ? TREE_VALUE (args)
4893 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4899 type = &TREE_TYPE (decl);
4900 is_type = TREE_CODE (*node) == TYPE_DECL;
4902 else if (TYPE_P (*node))
4903 type = node, is_type = 1;
4905 /* Strip any NOPs of any kind. */
4906 while (TREE_CODE (align_expr) == NOP_EXPR
4907 || TREE_CODE (align_expr) == CONVERT_EXPR
4908 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4909 align_expr = TREE_OPERAND (align_expr, 0);
4911 if (TREE_CODE (align_expr) != INTEGER_CST)
4913 error ("requested alignment is not a constant");
4914 *no_add_attrs = true;
4916 else if ((i = tree_log2 (align_expr)) == -1)
4918 error ("requested alignment is not a power of 2");
4919 *no_add_attrs = true;
4921 else if (i > HOST_BITS_PER_INT - 2)
4923 error ("requested alignment is too large");
4924 *no_add_attrs = true;
4928 /* If we have a TYPE_DECL, then copy the type, so that we
4929 don't accidentally modify a builtin type. See pushdecl. */
4930 if (decl && TREE_TYPE (decl) != error_mark_node
4931 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4933 tree tt = TREE_TYPE (decl);
4934 *type = build_type_copy (*type);
4935 DECL_ORIGINAL_TYPE (decl) = tt;
4936 TYPE_NAME (*type) = decl;
4937 TREE_USED (*type) = TREE_USED (decl);
4938 TREE_TYPE (decl) = *type;
4940 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4941 *type = build_type_copy (*type);
4943 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4944 TYPE_USER_ALIGN (*type) = 1;
4946 else if (TREE_CODE (decl) != VAR_DECL
4947 && TREE_CODE (decl) != FIELD_DECL)
4949 error ("%Jalignment may not be specified for '%D'", decl, decl);
4950 *no_add_attrs = true;
4954 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4955 DECL_USER_ALIGN (decl) = 1;
4961 /* Handle a "weak" attribute; arguments as in
4962 struct attribute_spec.handler. */
4965 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4966 tree args ATTRIBUTE_UNUSED,
4967 int flags ATTRIBUTE_UNUSED,
4968 bool *no_add_attrs ATTRIBUTE_UNUSED)
4970 declare_weak (*node);
4975 /* Handle an "alias" attribute; arguments as in
4976 struct attribute_spec.handler. */
4979 handle_alias_attribute (tree *node, tree name, tree args,
4980 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4984 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4985 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4987 error ("%J'%D' defined both normally and as an alias", decl, decl);
4988 *no_add_attrs = true;
4991 /* Note that the very first time we process a nested declaration,
4992 decl_function_context will not be set. Indeed, *would* never
4993 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4994 we do below. After such frobbery, pushdecl would set the context.
4995 In any case, this is never what we want. */
4996 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
5000 id = TREE_VALUE (args);
5001 if (TREE_CODE (id) != STRING_CST)
5003 error ("alias arg not a string");
5004 *no_add_attrs = true;
5007 id = get_identifier (TREE_STRING_POINTER (id));
5008 /* This counts as a use of the object pointed to. */
5011 if (TREE_CODE (decl) == FUNCTION_DECL)
5012 DECL_INITIAL (decl) = error_mark_node;
5015 DECL_EXTERNAL (decl) = 0;
5016 TREE_STATIC (decl) = 1;
5021 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5022 *no_add_attrs = true;
5028 /* Handle an "visibility" attribute; arguments as in
5029 struct attribute_spec.handler. */
5032 handle_visibility_attribute (tree *node, tree name, tree args,
5033 int flags ATTRIBUTE_UNUSED,
5037 tree id = TREE_VALUE (args);
5039 *no_add_attrs = true;
5041 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
5043 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5047 if (TREE_CODE (id) != STRING_CST)
5049 error ("visibility arg not a string");
5053 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
5054 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5055 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
5056 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
5057 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
5058 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
5059 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
5060 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
5062 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5067 /* Handle an "tls_model" attribute; arguments as in
5068 struct attribute_spec.handler. */
5071 handle_tls_model_attribute (tree *node, tree name, tree args,
5072 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5076 if (! DECL_THREAD_LOCAL (decl))
5078 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5079 *no_add_attrs = true;
5085 id = TREE_VALUE (args);
5086 if (TREE_CODE (id) != STRING_CST)
5088 error ("tls_model arg not a string");
5089 *no_add_attrs = true;
5092 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
5093 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
5094 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
5095 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
5097 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5098 *no_add_attrs = true;
5106 /* Handle a "no_instrument_function" attribute; arguments as in
5107 struct attribute_spec.handler. */
5110 handle_no_instrument_function_attribute (tree *node, tree name,
5111 tree args ATTRIBUTE_UNUSED,
5112 int flags ATTRIBUTE_UNUSED,
5117 if (TREE_CODE (decl) != FUNCTION_DECL)
5119 error ("%J'%E' attribute applies only to functions", decl, name);
5120 *no_add_attrs = true;
5122 else if (DECL_INITIAL (decl))
5124 error ("%Jcan't set '%E' attribute after definition", decl, name);
5125 *no_add_attrs = true;
5128 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5133 /* Handle a "malloc" attribute; arguments as in
5134 struct attribute_spec.handler. */
5137 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5138 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5140 if (TREE_CODE (*node) == FUNCTION_DECL)
5141 DECL_IS_MALLOC (*node) = 1;
5142 /* ??? TODO: Support types. */
5145 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5146 *no_add_attrs = true;
5152 /* Handle a "no_limit_stack" attribute; arguments as in
5153 struct attribute_spec.handler. */
5156 handle_no_limit_stack_attribute (tree *node, tree name,
5157 tree args ATTRIBUTE_UNUSED,
5158 int flags ATTRIBUTE_UNUSED,
5163 if (TREE_CODE (decl) != FUNCTION_DECL)
5165 error ("%J'%E' attribute applies only to functions", decl, name);
5166 *no_add_attrs = true;
5168 else if (DECL_INITIAL (decl))
5170 error ("%Jcan't set '%E' attribute after definition", decl, name);
5171 *no_add_attrs = true;
5174 DECL_NO_LIMIT_STACK (decl) = 1;
5179 /* Handle a "pure" attribute; arguments as in
5180 struct attribute_spec.handler. */
5183 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5184 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5186 if (TREE_CODE (*node) == FUNCTION_DECL)
5187 DECL_IS_PURE (*node) = 1;
5188 /* ??? TODO: Support types. */
5191 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5192 *no_add_attrs = true;
5198 /* Handle a "deprecated" attribute; arguments as in
5199 struct attribute_spec.handler. */
5202 handle_deprecated_attribute (tree *node, tree name,
5203 tree args ATTRIBUTE_UNUSED, int flags,
5206 tree type = NULL_TREE;
5208 const char *what = NULL;
5213 type = TREE_TYPE (decl);
5215 if (TREE_CODE (decl) == TYPE_DECL
5216 || TREE_CODE (decl) == PARM_DECL
5217 || TREE_CODE (decl) == VAR_DECL
5218 || TREE_CODE (decl) == FUNCTION_DECL
5219 || TREE_CODE (decl) == FIELD_DECL)
5220 TREE_DEPRECATED (decl) = 1;
5224 else if (TYPE_P (*node))
5226 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5227 *node = build_type_copy (*node);
5228 TREE_DEPRECATED (*node) = 1;
5236 *no_add_attrs = true;
5237 if (type && TYPE_NAME (type))
5239 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5240 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5241 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5242 && DECL_NAME (TYPE_NAME (type)))
5243 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5246 warning ("`%s' attribute ignored for `%s'",
5247 IDENTIFIER_POINTER (name), what);
5249 warning ("`%s' attribute ignored",
5250 IDENTIFIER_POINTER (name));
5256 /* Handle a "vector_size" attribute; arguments as in
5257 struct attribute_spec.handler. */
5260 handle_vector_size_attribute (tree *node, tree name, tree args,
5261 int flags ATTRIBUTE_UNUSED,
5264 unsigned HOST_WIDE_INT vecsize, nunits;
5265 enum machine_mode mode, orig_mode, new_mode;
5266 tree type = *node, new_type, size;
5268 *no_add_attrs = true;
5270 /* Stripping NON_LVALUE_EXPR allows declarations such as
5271 typedef short v4si __attribute__((vector_size (4 * sizeof(short)))). */
5272 size = TREE_VALUE (args);
5273 if (TREE_CODE (size) == NON_LVALUE_EXPR)
5274 size = TREE_OPERAND (size, 0);
5276 if (! host_integerp (size, 1))
5278 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5282 /* Get the vector size (in bytes). */
5283 vecsize = tree_low_cst (size, 1);
5285 /* We need to provide for vector pointers, vector arrays, and
5286 functions returning vectors. For example:
5288 __attribute__((vector_size(16))) short *foo;
5290 In this case, the mode is SI, but the type being modified is
5291 HI, so we need to look further. */
5293 while (POINTER_TYPE_P (type)
5294 || TREE_CODE (type) == FUNCTION_TYPE
5295 || TREE_CODE (type) == METHOD_TYPE
5296 || TREE_CODE (type) == ARRAY_TYPE)
5297 type = TREE_TYPE (type);
5299 /* Get the mode of the type being modified. */
5300 orig_mode = TYPE_MODE (type);
5302 if (TREE_CODE (type) == RECORD_TYPE
5303 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5304 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5305 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5307 error ("invalid vector type for attribute `%s'",
5308 IDENTIFIER_POINTER (name));
5312 /* Calculate how many units fit in the vector. */
5313 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5315 /* Find a suitably sized vector. */
5316 new_mode = VOIDmode;
5317 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5319 : MODE_VECTOR_FLOAT);
5321 mode = GET_MODE_WIDER_MODE (mode))
5322 if (vecsize == GET_MODE_SIZE (mode)
5323 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5329 if (new_mode == VOIDmode)
5331 error ("no vector mode with the size and type specified could be found");
5335 new_type = build_vector_type_for_mode (type, new_mode);
5337 /* Build back pointers if needed. */
5338 *node = reconstruct_complex_type (*node, new_type);
5343 /* Handle the "nonnull" attribute. */
5345 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5346 tree args, int flags ATTRIBUTE_UNUSED,
5350 unsigned HOST_WIDE_INT attr_arg_num;
5352 /* If no arguments are specified, all pointer arguments should be
5353 non-null. Verify a full prototype is given so that the arguments
5354 will have the correct types when we actually check them later. */
5357 if (! TYPE_ARG_TYPES (type))
5359 error ("nonnull attribute without arguments on a non-prototype");
5360 *no_add_attrs = true;
5365 /* Argument list specified. Verify that each argument number references
5366 a pointer argument. */
5367 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5370 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
5372 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5374 error ("nonnull argument has invalid operand number (arg %lu)",
5375 (unsigned long) attr_arg_num);
5376 *no_add_attrs = true;
5380 argument = TYPE_ARG_TYPES (type);
5383 for (ck_num = 1; ; ck_num++)
5385 if (! argument || ck_num == arg_num)
5387 argument = TREE_CHAIN (argument);
5391 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5393 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5394 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5395 *no_add_attrs = true;
5399 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5401 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5402 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5403 *no_add_attrs = true;
5412 /* Check the argument list of a function call for null in argument slots
5413 that are marked as requiring a non-null pointer argument. */
5416 check_function_nonnull (tree attrs, tree params)
5418 tree a, args, param;
5421 for (a = attrs; a; a = TREE_CHAIN (a))
5423 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5425 args = TREE_VALUE (a);
5427 /* Walk the argument list. If we encounter an argument number we
5428 should check for non-null, do it. If the attribute has no args,
5429 then every pointer argument is checked (in which case the check
5430 for pointer type is done in check_nonnull_arg). */
5431 for (param = params, param_num = 1; ;
5432 param_num++, param = TREE_CHAIN (param))
5436 if (! args || nonnull_check_p (args, param_num))
5437 check_function_arguments_recurse (check_nonnull_arg, NULL,
5445 /* Helper for check_function_nonnull; given a list of operands which
5446 must be non-null in ARGS, determine if operand PARAM_NUM should be
5450 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5452 unsigned HOST_WIDE_INT arg_num = 0;
5454 for (; args; args = TREE_CHAIN (args))
5456 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5459 if (arg_num == param_num)
5465 /* Check that the function argument PARAM (which is operand number
5466 PARAM_NUM) is non-null. This is called by check_function_nonnull
5467 via check_function_arguments_recurse. */
5470 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5471 unsigned HOST_WIDE_INT param_num)
5473 /* Just skip checking the argument if it's not a pointer. This can
5474 happen if the "nonnull" attribute was given without an operand
5475 list (which means to check every pointer argument). */
5477 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5480 if (integer_zerop (param))
5481 warning ("null argument where non-null required (arg %lu)",
5482 (unsigned long) param_num);
5485 /* Helper for nonnull attribute handling; fetch the operand number
5486 from the attribute argument list. */
5489 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5491 /* Strip any conversions from the arg number and verify they
5493 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5494 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5495 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5496 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5498 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5499 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5502 *valp = TREE_INT_CST_LOW (arg_num_expr);
5506 /* Handle a "nothrow" attribute; arguments as in
5507 struct attribute_spec.handler. */
5510 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5511 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5513 if (TREE_CODE (*node) == FUNCTION_DECL)
5514 TREE_NOTHROW (*node) = 1;
5515 /* ??? TODO: Support types. */
5518 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5519 *no_add_attrs = true;
5525 /* Handle a "cleanup" attribute; arguments as in
5526 struct attribute_spec.handler. */
5529 handle_cleanup_attribute (tree *node, tree name, tree args,
5530 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5533 tree cleanup_id, cleanup_decl;
5535 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5536 for global destructors in C++. This requires infrastructure that
5537 we don't have generically at the moment. It's also not a feature
5538 we'd be missing too much, since we do have attribute constructor. */
5539 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5541 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5542 *no_add_attrs = true;
5546 /* Verify that the argument is a function in scope. */
5547 /* ??? We could support pointers to functions here as well, if
5548 that was considered desirable. */
5549 cleanup_id = TREE_VALUE (args);
5550 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5552 error ("cleanup arg not an identifier");
5553 *no_add_attrs = true;
5556 cleanup_decl = lookup_name (cleanup_id);
5557 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5559 error ("cleanup arg not a function");
5560 *no_add_attrs = true;
5564 /* That the function has proper type is checked with the
5565 eventual call to build_function_call. */
5570 /* Handle a "warn_unused_result" attribute. No special handling. */
5573 handle_warn_unused_result_attribute (tree *node, tree name,
5574 tree args ATTRIBUTE_UNUSED,
5575 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5577 /* Ignore the attribute for functions not returning any value. */
5578 if (VOID_TYPE_P (TREE_TYPE (*node)))
5580 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5581 *no_add_attrs = true;
5587 /* Check for valid arguments being passed to a function. */
5589 check_function_arguments (tree attrs, tree params)
5591 /* Check for null being passed in a pointer argument that must be
5592 non-null. We also need to do this if format checking is enabled. */
5595 check_function_nonnull (attrs, params);
5597 /* Check for errors in format strings. */
5600 check_function_format (NULL, attrs, params);
5603 /* Generic argument checking recursion routine. PARAM is the argument to
5604 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5605 once the argument is resolved. CTX is context for the callback. */
5607 check_function_arguments_recurse (void (*callback)
5608 (void *, tree, unsigned HOST_WIDE_INT),
5609 void *ctx, tree param,
5610 unsigned HOST_WIDE_INT param_num)
5612 if (TREE_CODE (param) == NOP_EXPR)
5614 /* Strip coercion. */
5615 check_function_arguments_recurse (callback, ctx,
5616 TREE_OPERAND (param, 0), param_num);
5620 if (TREE_CODE (param) == CALL_EXPR)
5622 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5624 bool found_format_arg = false;
5626 /* See if this is a call to a known internationalization function
5627 that modifies a format arg. Such a function may have multiple
5628 format_arg attributes (for example, ngettext). */
5630 for (attrs = TYPE_ATTRIBUTES (type);
5632 attrs = TREE_CHAIN (attrs))
5633 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5636 tree format_num_expr;
5640 /* Extract the argument number, which was previously checked
5642 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5643 while (TREE_CODE (format_num_expr) == NOP_EXPR
5644 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5645 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5646 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5648 if (TREE_CODE (format_num_expr) != INTEGER_CST
5649 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5652 format_num = TREE_INT_CST_LOW (format_num_expr);
5654 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5656 inner_args = TREE_CHAIN (inner_args), i++)
5657 if (i == format_num)
5659 check_function_arguments_recurse (callback, ctx,
5660 TREE_VALUE (inner_args),
5662 found_format_arg = true;
5667 /* If we found a format_arg attribute and did a recursive check,
5668 we are done with checking this argument. Otherwise, we continue
5669 and this will be considered a non-literal. */
5670 if (found_format_arg)
5674 if (TREE_CODE (param) == COND_EXPR)
5676 /* Check both halves of the conditional expression. */
5677 check_function_arguments_recurse (callback, ctx,
5678 TREE_OPERAND (param, 1), param_num);
5679 check_function_arguments_recurse (callback, ctx,
5680 TREE_OPERAND (param, 2), param_num);
5684 (*callback) (ctx, param, param_num);
5687 /* C implementation of lang_hooks.tree_inlining.walk_subtrees. Tracks the
5688 locus from EXPR_LOCUS and handles DECL_STMT specially. */
5691 c_walk_subtrees (tree *tp, int *walk_subtrees_p ATTRIBUTE_UNUSED,
5692 walk_tree_fn func, void *data, void *htab)
5694 enum tree_code code = TREE_CODE (*tp);
5695 location_t save_locus;
5698 #define WALK_SUBTREE(NODE) \
5701 result = walk_tree (&(NODE), func, data, htab); \
5702 if (result) goto out; \
5706 if (code != DECL_STMT)
5709 /* Set input_location here so we get the right instantiation context
5710 if we call instantiate_decl from inlinable_function_p. */
5711 save_locus = input_location;
5712 if (EXPR_LOCUS (*tp))
5713 input_location = *EXPR_LOCUS (*tp);
5715 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
5716 into declarations that are just mentioned, rather than
5717 declared; they don't really belong to this part of the tree.
5718 And, we can see cycles: the initializer for a declaration can
5719 refer to the declaration itself. */
5720 WALK_SUBTREE (DECL_INITIAL (DECL_STMT_DECL (*tp)));
5721 WALK_SUBTREE (DECL_SIZE (DECL_STMT_DECL (*tp)));
5722 WALK_SUBTREE (DECL_SIZE_UNIT (DECL_STMT_DECL (*tp)));
5723 WALK_SUBTREE (TREE_CHAIN (*tp));
5724 *walk_subtrees_p = 0;
5726 /* We didn't find what we were looking for. */
5728 input_location = save_locus;
5734 /* C implementation of lang_hooks.tree_inlining.tree_chain_matters_p.
5735 Apart from TREE_LISTs, the only trees whose TREE_CHAIN we care about are
5739 c_tree_chain_matters_p (tree t)
5741 /* For statements, we also walk the chain so that we cover the
5742 entire statement tree. */
5743 return STATEMENT_CODE_P (TREE_CODE (t));
5746 /* Function to help qsort sort FIELD_DECLs by name order. */
5749 field_decl_cmp (const void *x_p, const void *y_p)
5751 const tree *const x = x_p;
5752 const tree *const y = y_p;
5753 if (DECL_NAME (*x) == DECL_NAME (*y))
5754 /* A nontype is "greater" than a type. */
5755 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5756 if (DECL_NAME (*x) == NULL_TREE)
5758 if (DECL_NAME (*y) == NULL_TREE)
5760 if (DECL_NAME (*x) < DECL_NAME (*y))
5766 gt_pointer_operator new_value;
5770 /* This routine compares two fields like field_decl_cmp but using the
5771 pointer operator in resort_data. */
5774 resort_field_decl_cmp (const void *x_p, const void *y_p)
5776 const tree *const x = x_p;
5777 const tree *const y = y_p;
5779 if (DECL_NAME (*x) == DECL_NAME (*y))
5780 /* A nontype is "greater" than a type. */
5781 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5782 if (DECL_NAME (*x) == NULL_TREE)
5784 if (DECL_NAME (*y) == NULL_TREE)
5787 tree d1 = DECL_NAME (*x);
5788 tree d2 = DECL_NAME (*y);
5789 resort_data.new_value (&d1, resort_data.cookie);
5790 resort_data.new_value (&d2, resort_data.cookie);
5797 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5800 resort_sorted_fields (void *obj,
5801 void *orig_obj ATTRIBUTE_UNUSED ,
5802 gt_pointer_operator new_value,
5805 struct sorted_fields_type *sf = obj;
5806 resort_data.new_value = new_value;
5807 resort_data.cookie = cookie;
5808 qsort (&sf->elts[0], sf->len, sizeof (tree),
5809 resort_field_decl_cmp);
5812 /* Used by estimate_num_insns. Estimate number of instructions seen
5813 by given statement. */
5815 c_estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
5820 if (TYPE_P (x) || DECL_P (x))
5825 /* Assume that constants and references counts nothing. These should
5826 be majorized by amount of operations among them we count later
5827 and are common target of CSE and similar optimizations. */
5828 if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c'
5829 || TREE_CODE_CLASS (TREE_CODE (x)) == 'r')
5831 switch (TREE_CODE (x))
5833 /* Recognize assignments of large structures and constructors of
5840 size = int_size_in_bytes (TREE_TYPE (x));
5842 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
5845 *count += ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
5850 tree decl = get_callee_fndecl (x);
5852 if (decl && DECL_BUILT_IN (decl))
5853 switch (DECL_FUNCTION_CODE (decl))
5855 case BUILT_IN_CONSTANT_P:
5858 case BUILT_IN_EXPECT:
5866 /* Few special cases of expensive operations. This is useful
5867 to avoid inlining on functions having too many of these. */
5868 case TRUNC_DIV_EXPR:
5870 case FLOOR_DIV_EXPR:
5871 case ROUND_DIV_EXPR:
5872 case TRUNC_MOD_EXPR:
5874 case FLOOR_MOD_EXPR:
5875 case ROUND_MOD_EXPR:
5879 /* Various containers that will produce no code themselves. */
5886 case IDENTIFIER_NODE:
5887 case PLACEHOLDER_EXPR:
5888 case WITH_CLEANUP_EXPR:
5889 case CLEANUP_POINT_EXPR:
5891 case VIEW_CONVERT_EXPR:
5897 case TRY_CATCH_EXPR:
5898 case TRY_FINALLY_EXPR:
5901 case LABELED_BLOCK_EXPR:
5902 case EXIT_BLOCK_EXPR:
5918 /* Do not account static initializers. */
5919 if (TREE_STATIC (TREE_OPERAND (x, 0)))
5928 /* Estimate number of instructions that will be created by expanding the body. */
5930 c_estimate_num_insns (tree decl)
5933 walk_tree_without_duplicates (&DECL_SAVED_TREE (decl), c_estimate_num_insns_1, &num);
5937 /* Issue the error given by MSGID, indicating that it occurred before
5938 TOKEN, which had the associated VALUE. */
5941 c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5943 const char *string = _(msgid);
5945 if (token == CPP_EOF)
5946 error ("%s at end of input", string);
5947 else if (token == CPP_CHAR || token == CPP_WCHAR)
5949 unsigned int val = TREE_INT_CST_LOW (value);
5950 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5951 if (val <= UCHAR_MAX && ISGRAPH (val))
5952 error ("%s before %s'%c'", string, ell, val);
5954 error ("%s before %s'\\x%x'", string, ell, val);
5956 else if (token == CPP_STRING
5957 || token == CPP_WSTRING)
5958 error ("%s before string constant", string);
5959 else if (token == CPP_NUMBER)
5960 error ("%s before numeric constant", string);
5961 else if (token == CPP_NAME)
5962 error ("%s before \"%s\"", string, IDENTIFIER_POINTER (value));
5963 else if (token < N_TTYPES)
5964 error ("%s before '%s' token", string, cpp_type2name (token));
5966 error ("%s", string);
5969 /* Walk a gimplified function and warn for functions whose return value is
5970 ignored and attribute((warn_unused_result)) is set. This is done before
5971 inlining, so we don't have to worry about that. */
5974 c_warn_unused_result (tree *top_p)
5977 tree_stmt_iterator i;
5980 switch (TREE_CODE (t))
5982 case STATEMENT_LIST:
5983 for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i))
5984 c_warn_unused_result (tsi_stmt_ptr (i));
5988 c_warn_unused_result (&COND_EXPR_THEN (t));
5989 c_warn_unused_result (&COND_EXPR_ELSE (t));
5992 c_warn_unused_result (&BIND_EXPR_BODY (t));
5994 case TRY_FINALLY_EXPR:
5995 case TRY_CATCH_EXPR:
5996 c_warn_unused_result (&TREE_OPERAND (t, 0));
5997 c_warn_unused_result (&TREE_OPERAND (t, 1));
6000 c_warn_unused_result (&CATCH_BODY (t));
6002 case EH_FILTER_EXPR:
6003 c_warn_unused_result (&EH_FILTER_FAILURE (t));
6007 /* This is a naked call, as opposed to a CALL_EXPR nested inside
6008 a MODIFY_EXPR. All calls whose value is ignored should be
6009 represented like this. Look for the attribute. */
6010 fdecl = get_callee_fndecl (t);
6012 ftype = TREE_TYPE (fdecl);
6015 ftype = TREE_TYPE (TREE_OPERAND (t, 0));
6016 /* Look past pointer-to-function to the function type itself. */
6017 ftype = TREE_TYPE (ftype);
6020 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
6023 warning ("%Hignoring return value of `%D', "
6024 "declared with attribute warn_unused_result",
6025 EXPR_LOCUS (t), fdecl);
6027 warning ("%Hignoring return value of function "
6028 "declared with attribute warn_unused_result",
6034 /* Not a container, not a call, or a call whose value is used. */
6039 #include "gt-c-common.h"