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
1089 by PRETTY_P. Return string must be freed by caller. */
1092 fname_as_string (int pretty_p)
1094 const char *name = "top level";
1104 if (current_function_decl)
1105 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
1107 if (c_lex_string_translate)
1109 int len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
1110 cpp_string cstr = { 0, 0 }, strname;
1112 namep = xmalloc (len);
1113 snprintf (namep, len, "\"%s\"", name);
1114 strname.text = (unsigned char *) namep;
1115 strname.len = len - 1;
1117 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, false))
1118 return (char *) cstr.text;
1121 namep = xstrdup (name);
1126 /* Expand DECL if it declares an entity not handled by the
1130 c_expand_decl (tree decl)
1132 if (TREE_CODE (decl) == VAR_DECL && !TREE_STATIC (decl))
1134 /* Let the back-end know about this variable. */
1135 if (!anon_aggr_type_p (TREE_TYPE (decl)))
1136 emit_local_var (decl);
1138 expand_anon_union_decl (decl, NULL_TREE,
1139 DECL_ANON_UNION_ELEMS (decl));
1141 else if (TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl))
1142 make_rtl_for_local_static (decl);
1150 /* Return the VAR_DECL for a const char array naming the current
1151 function. If the VAR_DECL has not yet been created, create it
1152 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1153 ID is its name (unfortunately C and C++ hold the RID values of
1154 keywords in different places, so we can't derive RID from ID in
1155 this language independent code. */
1158 fname_decl (unsigned int rid, tree id)
1161 tree decl = NULL_TREE;
1163 for (ix = 0; fname_vars[ix].decl; ix++)
1164 if (fname_vars[ix].rid == rid)
1167 decl = *fname_vars[ix].decl;
1170 tree saved_last_tree = last_tree;
1171 /* If a tree is built here, it would normally have the lineno of
1172 the current statement. Later this tree will be moved to the
1173 beginning of the function and this line number will be wrong.
1174 To avoid this problem set the lineno to 0 here; that prevents
1175 it from appearing in the RTL. */
1176 int saved_lineno = input_line;
1179 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1180 if (last_tree != saved_last_tree)
1182 /* We created some statement tree for the decl. This belongs
1183 at the start of the function, so remove it now and reinsert
1184 it after the function is complete. */
1185 tree stmts = TREE_CHAIN (saved_last_tree);
1187 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1188 last_tree = saved_last_tree;
1189 saved_function_name_decls = tree_cons (decl, stmts,
1190 saved_function_name_decls);
1192 *fname_vars[ix].decl = decl;
1193 input_line = saved_lineno;
1195 if (!ix && !current_function_decl)
1196 pedwarn ("%J'%D' is not defined outside of function scope", decl, decl);
1201 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1204 fix_string_type (tree value)
1206 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1207 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1208 const int nchars_max = flag_isoc99 ? 4095 : 509;
1209 int length = TREE_STRING_LENGTH (value);
1212 /* Compute the number of elements, for the array type. */
1213 nchars = wide_flag ? length / wchar_bytes : length;
1215 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1216 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1217 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1219 /* Create the array type for the string constant.
1220 -Wwrite-strings says make the string constant an array of const char
1221 so that copying it to a non-const pointer will get a warning.
1222 For C++, this is the standard behavior. */
1223 if (flag_const_strings)
1226 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1229 = build_array_type (elements,
1230 build_index_type (build_int_2 (nchars - 1, 0)));
1234 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1235 build_index_type (build_int_2 (nchars - 1, 0)));
1237 TREE_CONSTANT (value) = 1;
1238 TREE_INVARIANT (value) = 1;
1239 TREE_READONLY (value) = 1;
1240 TREE_STATIC (value) = 1;
1244 /* Print a warning if a constant expression had overflow in folding.
1245 Invoke this function on every expression that the language
1246 requires to be a constant expression.
1247 Note the ANSI C standard says it is erroneous for a
1248 constant expression to overflow. */
1251 constant_expression_warning (tree value)
1253 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1254 || TREE_CODE (value) == VECTOR_CST
1255 || TREE_CODE (value) == COMPLEX_CST)
1256 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1257 pedwarn ("overflow in constant expression");
1260 /* Print a warning if an expression had overflow in folding.
1261 Invoke this function on every expression that
1262 (1) appears in the source code, and
1263 (2) might be a constant expression that overflowed, and
1264 (3) is not already checked by convert_and_check;
1265 however, do not invoke this function on operands of explicit casts. */
1268 overflow_warning (tree value)
1270 if ((TREE_CODE (value) == INTEGER_CST
1271 || (TREE_CODE (value) == COMPLEX_CST
1272 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1273 && TREE_OVERFLOW (value))
1275 TREE_OVERFLOW (value) = 0;
1276 if (skip_evaluation == 0)
1277 warning ("integer overflow in expression");
1279 else if ((TREE_CODE (value) == REAL_CST
1280 || (TREE_CODE (value) == COMPLEX_CST
1281 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1282 && TREE_OVERFLOW (value))
1284 TREE_OVERFLOW (value) = 0;
1285 if (skip_evaluation == 0)
1286 warning ("floating point overflow in expression");
1288 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1290 TREE_OVERFLOW (value) = 0;
1291 if (skip_evaluation == 0)
1292 warning ("vector overflow in expression");
1296 /* Print a warning if a large constant is truncated to unsigned,
1297 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1298 Invoke this function on every expression that might be implicitly
1299 converted to an unsigned type. */
1302 unsigned_conversion_warning (tree result, tree operand)
1304 tree type = TREE_TYPE (result);
1306 if (TREE_CODE (operand) == INTEGER_CST
1307 && TREE_CODE (type) == INTEGER_TYPE
1308 && TYPE_UNSIGNED (type)
1309 && skip_evaluation == 0
1310 && !int_fits_type_p (operand, type))
1312 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1313 /* This detects cases like converting -129 or 256 to unsigned char. */
1314 warning ("large integer implicitly truncated to unsigned type");
1315 else if (warn_conversion)
1316 warning ("negative integer implicitly converted to unsigned type");
1320 /* Nonzero if constant C has a value that is permissible
1321 for type TYPE (an INTEGER_TYPE). */
1324 constant_fits_type_p (tree c, tree type)
1326 if (TREE_CODE (c) == INTEGER_CST)
1327 return int_fits_type_p (c, type);
1329 c = convert (type, c);
1330 return !TREE_OVERFLOW (c);
1333 /* Nonzero if vector types T1 and T2 can be converted to each other
1334 without an explicit cast. */
1336 vector_types_convertible_p (tree t1, tree t2)
1338 return targetm.vector_opaque_p (t1)
1339 || targetm.vector_opaque_p (t2)
1340 || TYPE_MODE (t1) == TYPE_MODE (t2);
1343 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1344 Invoke this function on every expression that is converted implicitly,
1345 i.e. because of language rules and not because of an explicit cast. */
1348 convert_and_check (tree type, tree expr)
1350 tree t = convert (type, expr);
1351 if (TREE_CODE (t) == INTEGER_CST)
1353 if (TREE_OVERFLOW (t))
1355 TREE_OVERFLOW (t) = 0;
1357 /* Do not diagnose overflow in a constant expression merely
1358 because a conversion overflowed. */
1359 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1361 /* No warning for converting 0x80000000 to int. */
1362 if (!(TYPE_UNSIGNED (type) < TYPE_UNSIGNED (TREE_TYPE (expr))
1363 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1364 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1365 /* If EXPR fits in the unsigned version of TYPE,
1366 don't warn unless pedantic. */
1368 || TYPE_UNSIGNED (type)
1369 || ! constant_fits_type_p (expr,
1370 c_common_unsigned_type (type)))
1371 && skip_evaluation == 0)
1372 warning ("overflow in implicit constant conversion");
1375 unsigned_conversion_warning (t, expr);
1380 /* A node in a list that describes references to variables (EXPR), which are
1381 either read accesses if WRITER is zero, or write accesses, in which case
1382 WRITER is the parent of EXPR. */
1389 /* Used to implement a cache the results of a call to verify_tree. We only
1390 use this for SAVE_EXPRs. */
1393 struct tlist_cache *next;
1394 struct tlist *cache_before_sp;
1395 struct tlist *cache_after_sp;
1399 /* Obstack to use when allocating tlist structures, and corresponding
1401 static struct obstack tlist_obstack;
1402 static char *tlist_firstobj = 0;
1404 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1406 static struct tlist *warned_ids;
1407 /* SAVE_EXPRs need special treatment. We process them only once and then
1408 cache the results. */
1409 static struct tlist_cache *save_expr_cache;
1411 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1412 static void merge_tlist (struct tlist **, struct tlist *, int);
1413 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1414 static int warning_candidate_p (tree);
1415 static void warn_for_collisions (struct tlist *);
1416 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1417 static struct tlist *new_tlist (struct tlist *, tree, tree);
1418 static void verify_sequence_points (tree);
1420 /* Create a new struct tlist and fill in its fields. */
1421 static struct tlist *
1422 new_tlist (struct tlist *next, tree t, tree writer)
1425 l = obstack_alloc (&tlist_obstack, sizeof *l);
1432 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1433 is nonnull, we ignore any node we find which has a writer equal to it. */
1436 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1440 struct tlist *next = add->next;
1443 if (! exclude_writer || add->writer != exclude_writer)
1444 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1449 /* Merge the nodes of ADD into TO. This merging process is done so that for
1450 each variable that already exists in TO, no new node is added; however if
1451 there is a write access recorded in ADD, and an occurrence on TO is only
1452 a read access, then the occurrence in TO will be modified to record the
1456 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1458 struct tlist **end = to;
1461 end = &(*end)->next;
1467 struct tlist *next = add->next;
1469 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1470 if (tmp2->expr == add->expr)
1474 tmp2->writer = add->writer;
1478 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1479 end = &(*end)->next;
1486 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1487 references in list LIST conflict with it, excluding reads if ONLY writers
1491 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1496 /* Avoid duplicate warnings. */
1497 for (tmp = warned_ids; tmp; tmp = tmp->next)
1498 if (tmp->expr == written)
1503 if (list->expr == written
1504 && list->writer != writer
1505 && (! only_writes || list->writer))
1507 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1508 warning ("operation on `%s' may be undefined",
1509 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1515 /* Given a list LIST of references to variables, find whether any of these
1516 can cause conflicts due to missing sequence points. */
1519 warn_for_collisions (struct tlist *list)
1523 for (tmp = list; tmp; tmp = tmp->next)
1526 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1530 /* Return nonzero if X is a tree that can be verified by the sequence point
1533 warning_candidate_p (tree x)
1535 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1538 /* Walk the tree X, and record accesses to variables. If X is written by the
1539 parent tree, WRITER is the parent.
1540 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1541 expression or its only operand forces a sequence point, then everything up
1542 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1544 Once we return, we will have emitted warnings if any subexpression before
1545 such a sequence point could be undefined. On a higher level, however, the
1546 sequence point may not be relevant, and we'll merge the two lists.
1548 Example: (b++, a) + b;
1549 The call that processes the COMPOUND_EXPR will store the increment of B
1550 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1551 processes the PLUS_EXPR will need to merge the two lists so that
1552 eventually, all accesses end up on the same list (and we'll warn about the
1553 unordered subexpressions b++ and b.
1555 A note on merging. If we modify the former example so that our expression
1558 care must be taken not simply to add all three expressions into the final
1559 PNO_SP list. The function merge_tlist takes care of that by merging the
1560 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1561 way, so that no more than one access to B is recorded. */
1564 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1567 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1568 enum tree_code code;
1571 /* X may be NULL if it is the operand of an empty statement expression
1577 code = TREE_CODE (x);
1578 class = TREE_CODE_CLASS (code);
1580 if (warning_candidate_p (x))
1582 *pno_sp = new_tlist (*pno_sp, x, writer);
1592 case TRUTH_ANDIF_EXPR:
1593 case TRUTH_ORIF_EXPR:
1594 tmp_before = tmp_nosp = tmp_list3 = 0;
1595 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1596 warn_for_collisions (tmp_nosp);
1597 merge_tlist (pbefore_sp, tmp_before, 0);
1598 merge_tlist (pbefore_sp, tmp_nosp, 0);
1599 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1600 merge_tlist (pbefore_sp, tmp_list3, 0);
1604 tmp_before = tmp_list2 = 0;
1605 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1606 warn_for_collisions (tmp_list2);
1607 merge_tlist (pbefore_sp, tmp_before, 0);
1608 merge_tlist (pbefore_sp, tmp_list2, 1);
1610 tmp_list3 = tmp_nosp = 0;
1611 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1612 warn_for_collisions (tmp_nosp);
1613 merge_tlist (pbefore_sp, tmp_list3, 0);
1615 tmp_list3 = tmp_list2 = 0;
1616 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1617 warn_for_collisions (tmp_list2);
1618 merge_tlist (pbefore_sp, tmp_list3, 0);
1619 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1620 two first, to avoid warning for (a ? b++ : b++). */
1621 merge_tlist (&tmp_nosp, tmp_list2, 0);
1622 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1625 case PREDECREMENT_EXPR:
1626 case PREINCREMENT_EXPR:
1627 case POSTDECREMENT_EXPR:
1628 case POSTINCREMENT_EXPR:
1629 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1633 tmp_before = tmp_nosp = tmp_list3 = 0;
1634 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1635 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1636 /* Expressions inside the LHS are not ordered wrt. the sequence points
1637 in the RHS. Example:
1639 Despite the fact that the modification of "a" is in the before_sp
1640 list (tmp_before), it conflicts with the use of "a" in the LHS.
1641 We can handle this by adding the contents of tmp_list3
1642 to those of tmp_before, and redoing the collision warnings for that
1644 add_tlist (&tmp_before, tmp_list3, x, 1);
1645 warn_for_collisions (tmp_before);
1646 /* Exclude the LHS itself here; we first have to merge it into the
1647 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1648 didn't exclude the LHS, we'd get it twice, once as a read and once
1650 add_tlist (pno_sp, tmp_list3, x, 0);
1651 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1653 merge_tlist (pbefore_sp, tmp_before, 0);
1654 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1655 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1656 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1660 /* We need to warn about conflicts among arguments and conflicts between
1661 args and the function address. Side effects of the function address,
1662 however, are not ordered by the sequence point of the call. */
1663 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1664 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1665 if (TREE_OPERAND (x, 1))
1666 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1667 merge_tlist (&tmp_list3, tmp_list2, 0);
1668 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1669 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1670 warn_for_collisions (tmp_before);
1671 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1675 /* Scan all the list, e.g. indices of multi dimensional array. */
1678 tmp_before = tmp_nosp = 0;
1679 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1680 merge_tlist (&tmp_nosp, tmp_before, 0);
1681 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1688 struct tlist_cache *t;
1689 for (t = save_expr_cache; t; t = t->next)
1695 t = obstack_alloc (&tlist_obstack, sizeof *t);
1696 t->next = save_expr_cache;
1698 save_expr_cache = t;
1700 tmp_before = tmp_nosp = 0;
1701 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1702 warn_for_collisions (tmp_nosp);
1707 struct tlist *t = tmp_nosp;
1709 merge_tlist (&tmp_list3, t, 0);
1711 t->cache_before_sp = tmp_before;
1712 t->cache_after_sp = tmp_list3;
1714 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1715 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1724 if (first_rtl_op (code) == 0)
1726 x = TREE_OPERAND (x, 0);
1741 int max = first_rtl_op (TREE_CODE (x));
1742 for (lp = 0; lp < max; lp++)
1744 tmp_before = tmp_nosp = 0;
1745 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1746 merge_tlist (&tmp_nosp, tmp_before, 0);
1747 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1754 /* Try to warn for undefined behavior in EXPR due to missing sequence
1758 verify_sequence_points (tree expr)
1760 struct tlist *before_sp = 0, *after_sp = 0;
1763 save_expr_cache = 0;
1764 if (tlist_firstobj == 0)
1766 gcc_obstack_init (&tlist_obstack);
1767 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1770 verify_tree (expr, &before_sp, &after_sp, 0);
1771 warn_for_collisions (after_sp);
1772 obstack_free (&tlist_obstack, tlist_firstobj);
1776 c_expand_expr_stmt (tree expr)
1778 /* Do default conversion if safe and possibly important,
1779 in case within ({...}). */
1780 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1781 && (flag_isoc99 || lvalue_p (expr)))
1782 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1783 expr = default_conversion (expr);
1785 if (warn_sequence_point)
1786 verify_sequence_points (expr);
1788 if (TREE_TYPE (expr) != error_mark_node
1789 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1790 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1791 error ("expression statement has incomplete type");
1793 last_expr_type = TREE_TYPE (expr);
1794 return add_stmt (build_stmt (EXPR_STMT, expr));
1797 /* Validate the expression after `case' and apply default promotions. */
1800 check_case_value (tree value)
1802 if (value == NULL_TREE)
1805 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1806 STRIP_TYPE_NOPS (value);
1807 /* In C++, the following is allowed:
1810 switch (...) { case i: ... }
1812 So, we try to reduce the VALUE to a constant that way. */
1813 if (c_dialect_cxx ())
1815 value = decl_constant_value (value);
1816 STRIP_TYPE_NOPS (value);
1817 value = fold (value);
1820 if (TREE_CODE (value) != INTEGER_CST
1821 && value != error_mark_node)
1823 error ("case label does not reduce to an integer constant");
1824 value = error_mark_node;
1827 /* Promote char or short to int. */
1828 value = default_conversion (value);
1830 constant_expression_warning (value);
1835 /* Return an integer type with BITS bits of precision,
1836 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1839 c_common_type_for_size (unsigned int bits, int unsignedp)
1841 if (bits == TYPE_PRECISION (integer_type_node))
1842 return unsignedp ? unsigned_type_node : integer_type_node;
1844 if (bits == TYPE_PRECISION (signed_char_type_node))
1845 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1847 if (bits == TYPE_PRECISION (short_integer_type_node))
1848 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1850 if (bits == TYPE_PRECISION (long_integer_type_node))
1851 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1853 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1854 return (unsignedp ? long_long_unsigned_type_node
1855 : long_long_integer_type_node);
1857 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1858 return (unsignedp ? widest_unsigned_literal_type_node
1859 : widest_integer_literal_type_node);
1861 if (bits <= TYPE_PRECISION (intQI_type_node))
1862 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1864 if (bits <= TYPE_PRECISION (intHI_type_node))
1865 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1867 if (bits <= TYPE_PRECISION (intSI_type_node))
1868 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1870 if (bits <= TYPE_PRECISION (intDI_type_node))
1871 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1876 /* Used for communication between c_common_type_for_mode and
1877 c_register_builtin_type. */
1878 static GTY(()) tree registered_builtin_types;
1880 /* Return a data type that has machine mode MODE.
1881 If the mode is an integer,
1882 then UNSIGNEDP selects between signed and unsigned types. */
1885 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1889 if (mode == TYPE_MODE (integer_type_node))
1890 return unsignedp ? unsigned_type_node : integer_type_node;
1892 if (mode == TYPE_MODE (signed_char_type_node))
1893 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1895 if (mode == TYPE_MODE (short_integer_type_node))
1896 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1898 if (mode == TYPE_MODE (long_integer_type_node))
1899 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1901 if (mode == TYPE_MODE (long_long_integer_type_node))
1902 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1904 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1905 return unsignedp ? widest_unsigned_literal_type_node
1906 : widest_integer_literal_type_node;
1909 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1912 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1915 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1918 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1920 #if HOST_BITS_PER_WIDE_INT >= 64
1921 if (mode == TYPE_MODE (intTI_type_node))
1922 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1925 if (mode == TYPE_MODE (float_type_node))
1926 return float_type_node;
1928 if (mode == TYPE_MODE (double_type_node))
1929 return double_type_node;
1931 if (mode == TYPE_MODE (long_double_type_node))
1932 return long_double_type_node;
1934 if (mode == TYPE_MODE (void_type_node))
1935 return void_type_node;
1937 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1938 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1940 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1941 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1943 if (VECTOR_MODE_P (mode))
1945 enum machine_mode inner_mode = GET_MODE_INNER (mode);
1946 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1947 if (inner_type != NULL_TREE)
1948 return build_vector_type_for_mode (inner_type, mode);
1951 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1952 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1953 return TREE_VALUE (t);
1958 /* Return an unsigned type the same as TYPE in other respects. */
1960 c_common_unsigned_type (tree type)
1962 tree type1 = TYPE_MAIN_VARIANT (type);
1963 if (type1 == signed_char_type_node || type1 == char_type_node)
1964 return unsigned_char_type_node;
1965 if (type1 == integer_type_node)
1966 return unsigned_type_node;
1967 if (type1 == short_integer_type_node)
1968 return short_unsigned_type_node;
1969 if (type1 == long_integer_type_node)
1970 return long_unsigned_type_node;
1971 if (type1 == long_long_integer_type_node)
1972 return long_long_unsigned_type_node;
1973 if (type1 == widest_integer_literal_type_node)
1974 return widest_unsigned_literal_type_node;
1975 #if HOST_BITS_PER_WIDE_INT >= 64
1976 if (type1 == intTI_type_node)
1977 return unsigned_intTI_type_node;
1979 if (type1 == intDI_type_node)
1980 return unsigned_intDI_type_node;
1981 if (type1 == intSI_type_node)
1982 return unsigned_intSI_type_node;
1983 if (type1 == intHI_type_node)
1984 return unsigned_intHI_type_node;
1985 if (type1 == intQI_type_node)
1986 return unsigned_intQI_type_node;
1988 return c_common_signed_or_unsigned_type (1, type);
1991 /* Return a signed type the same as TYPE in other respects. */
1994 c_common_signed_type (tree type)
1996 tree type1 = TYPE_MAIN_VARIANT (type);
1997 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1998 return signed_char_type_node;
1999 if (type1 == unsigned_type_node)
2000 return integer_type_node;
2001 if (type1 == short_unsigned_type_node)
2002 return short_integer_type_node;
2003 if (type1 == long_unsigned_type_node)
2004 return long_integer_type_node;
2005 if (type1 == long_long_unsigned_type_node)
2006 return long_long_integer_type_node;
2007 if (type1 == widest_unsigned_literal_type_node)
2008 return widest_integer_literal_type_node;
2009 #if HOST_BITS_PER_WIDE_INT >= 64
2010 if (type1 == unsigned_intTI_type_node)
2011 return intTI_type_node;
2013 if (type1 == unsigned_intDI_type_node)
2014 return intDI_type_node;
2015 if (type1 == unsigned_intSI_type_node)
2016 return intSI_type_node;
2017 if (type1 == unsigned_intHI_type_node)
2018 return intHI_type_node;
2019 if (type1 == unsigned_intQI_type_node)
2020 return intQI_type_node;
2022 return c_common_signed_or_unsigned_type (0, type);
2025 /* Return a type the same as TYPE except unsigned or
2026 signed according to UNSIGNEDP. */
2029 c_common_signed_or_unsigned_type (int unsignedp, tree type)
2031 if (! INTEGRAL_TYPE_P (type)
2032 || TYPE_UNSIGNED (type) == unsignedp)
2035 /* Must check the mode of the types, not the precision. Enumeral types
2036 in C++ have precision set to match their range, but may use a wider
2037 mode to match an ABI. If we change modes, we may wind up with bad
2040 if (TYPE_MODE (type) == TYPE_MODE (signed_char_type_node))
2041 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2042 if (TYPE_MODE (type) == TYPE_MODE (integer_type_node))
2043 return unsignedp ? unsigned_type_node : integer_type_node;
2044 if (TYPE_MODE (type) == TYPE_MODE (short_integer_type_node))
2045 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2046 if (TYPE_MODE (type) == TYPE_MODE (long_integer_type_node))
2047 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2048 if (TYPE_MODE (type) == TYPE_MODE (long_long_integer_type_node))
2049 return (unsignedp ? long_long_unsigned_type_node
2050 : long_long_integer_type_node);
2051 if (TYPE_MODE (type) == TYPE_MODE (widest_integer_literal_type_node))
2052 return (unsignedp ? widest_unsigned_literal_type_node
2053 : widest_integer_literal_type_node);
2055 #if HOST_BITS_PER_WIDE_INT >= 64
2056 if (TYPE_MODE (type) == TYPE_MODE (intTI_type_node))
2057 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2059 if (TYPE_MODE (type) == TYPE_MODE (intDI_type_node))
2060 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2061 if (TYPE_MODE (type) == TYPE_MODE (intSI_type_node))
2062 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2063 if (TYPE_MODE (type) == TYPE_MODE (intHI_type_node))
2064 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2065 if (TYPE_MODE (type) == TYPE_MODE (intQI_type_node))
2066 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2071 /* The C version of the register_builtin_type langhook. */
2074 c_register_builtin_type (tree type, const char* name)
2078 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2079 DECL_ARTIFICIAL (decl) = 1;
2080 if (!TYPE_NAME (type))
2081 TYPE_NAME (type) = decl;
2084 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
2088 /* Return the minimum number of bits needed to represent VALUE in a
2089 signed or unsigned type, UNSIGNEDP says which. */
2092 min_precision (tree value, int unsignedp)
2096 /* If the value is negative, compute its negative minus 1. The latter
2097 adjustment is because the absolute value of the largest negative value
2098 is one larger than the largest positive value. This is equivalent to
2099 a bit-wise negation, so use that operation instead. */
2101 if (tree_int_cst_sgn (value) < 0)
2102 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2104 /* Return the number of bits needed, taking into account the fact
2105 that we need one more bit for a signed than unsigned type. */
2107 if (integer_zerop (value))
2110 log = tree_floor_log2 (value);
2112 return log + 1 + ! unsignedp;
2115 /* Print an error message for invalid operands to arith operation
2116 CODE. NOP_EXPR is used as a special case (see
2117 c_common_truthvalue_conversion). */
2120 binary_op_error (enum tree_code code)
2127 error ("invalid truth-value expression");
2131 opname = "+"; break;
2133 opname = "-"; break;
2135 opname = "*"; break;
2137 opname = "max"; break;
2139 opname = "min"; break;
2141 opname = "=="; break;
2143 opname = "!="; break;
2145 opname = "<="; break;
2147 opname = ">="; break;
2149 opname = "<"; break;
2151 opname = ">"; break;
2153 opname = "<<"; break;
2155 opname = ">>"; break;
2156 case TRUNC_MOD_EXPR:
2157 case FLOOR_MOD_EXPR:
2158 opname = "%"; break;
2159 case TRUNC_DIV_EXPR:
2160 case FLOOR_DIV_EXPR:
2161 opname = "/"; break;
2163 opname = "&"; break;
2165 opname = "|"; break;
2166 case TRUTH_ANDIF_EXPR:
2167 opname = "&&"; break;
2168 case TRUTH_ORIF_EXPR:
2169 opname = "||"; break;
2171 opname = "^"; break;
2174 opname = "rotate"; break;
2176 opname = "unknown"; break;
2178 error ("invalid operands to binary %s", opname);
2181 /* Subroutine of build_binary_op, used for comparison operations.
2182 See if the operands have both been converted from subword integer types
2183 and, if so, perhaps change them both back to their original type.
2184 This function is also responsible for converting the two operands
2185 to the proper common type for comparison.
2187 The arguments of this function are all pointers to local variables
2188 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2189 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2191 If this function returns nonzero, it means that the comparison has
2192 a constant value. What this function returns is an expression for
2196 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2197 enum tree_code *rescode_ptr)
2200 tree op0 = *op0_ptr;
2201 tree op1 = *op1_ptr;
2202 int unsignedp0, unsignedp1;
2204 tree primop0, primop1;
2205 enum tree_code code = *rescode_ptr;
2207 /* Throw away any conversions to wider types
2208 already present in the operands. */
2210 primop0 = get_narrower (op0, &unsignedp0);
2211 primop1 = get_narrower (op1, &unsignedp1);
2213 /* Handle the case that OP0 does not *contain* a conversion
2214 but it *requires* conversion to FINAL_TYPE. */
2216 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2217 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2218 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2219 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
2221 /* If one of the operands must be floated, we cannot optimize. */
2222 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2223 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2225 /* If first arg is constant, swap the args (changing operation
2226 so value is preserved), for canonicalization. Don't do this if
2227 the second arg is 0. */
2229 if (TREE_CONSTANT (primop0)
2230 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2233 int temi = unsignedp0;
2241 unsignedp0 = unsignedp1;
2264 *rescode_ptr = code;
2267 /* If comparing an integer against a constant more bits wide,
2268 maybe we can deduce a value of 1 or 0 independent of the data.
2269 Or else truncate the constant now
2270 rather than extend the variable at run time.
2272 This is only interesting if the constant is the wider arg.
2273 Also, it is not safe if the constant is unsigned and the
2274 variable arg is signed, since in this case the variable
2275 would be sign-extended and then regarded as unsigned.
2276 Our technique fails in this case because the lowest/highest
2277 possible unsigned results don't follow naturally from the
2278 lowest/highest possible values of the variable operand.
2279 For just EQ_EXPR and NE_EXPR there is another technique that
2280 could be used: see if the constant can be faithfully represented
2281 in the other operand's type, by truncating it and reextending it
2282 and see if that preserves the constant's value. */
2284 if (!real1 && !real2
2285 && TREE_CODE (primop1) == INTEGER_CST
2286 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2288 int min_gt, max_gt, min_lt, max_lt;
2289 tree maxval, minval;
2290 /* 1 if comparison is nominally unsigned. */
2291 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
2294 type = c_common_signed_or_unsigned_type (unsignedp0,
2295 TREE_TYPE (primop0));
2297 /* In C, if TYPE is an enumeration, then we need to get its
2298 min/max values from its underlying integral type, not the
2299 enumerated type itself. In C++, TYPE_MAX_VALUE and
2300 TYPE_MIN_VALUE have already been set correctly on the
2301 enumeration type. */
2302 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
2303 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2305 maxval = TYPE_MAX_VALUE (type);
2306 minval = TYPE_MIN_VALUE (type);
2308 if (unsignedp && !unsignedp0)
2309 *restype_ptr = c_common_signed_type (*restype_ptr);
2311 if (TREE_TYPE (primop1) != *restype_ptr)
2312 primop1 = convert (*restype_ptr, primop1);
2313 if (type != *restype_ptr)
2315 minval = convert (*restype_ptr, minval);
2316 maxval = convert (*restype_ptr, maxval);
2319 if (unsignedp && unsignedp0)
2321 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2322 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2323 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2324 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2328 min_gt = INT_CST_LT (primop1, minval);
2329 max_gt = INT_CST_LT (primop1, maxval);
2330 min_lt = INT_CST_LT (minval, primop1);
2331 max_lt = INT_CST_LT (maxval, primop1);
2335 /* This used to be a switch, but Genix compiler can't handle that. */
2336 if (code == NE_EXPR)
2338 if (max_lt || min_gt)
2339 val = truthvalue_true_node;
2341 else if (code == EQ_EXPR)
2343 if (max_lt || min_gt)
2344 val = truthvalue_false_node;
2346 else if (code == LT_EXPR)
2349 val = truthvalue_true_node;
2351 val = truthvalue_false_node;
2353 else if (code == GT_EXPR)
2356 val = truthvalue_true_node;
2358 val = truthvalue_false_node;
2360 else if (code == LE_EXPR)
2363 val = truthvalue_true_node;
2365 val = truthvalue_false_node;
2367 else if (code == GE_EXPR)
2370 val = truthvalue_true_node;
2372 val = truthvalue_false_node;
2375 /* If primop0 was sign-extended and unsigned comparison specd,
2376 we did a signed comparison above using the signed type bounds.
2377 But the comparison we output must be unsigned.
2379 Also, for inequalities, VAL is no good; but if the signed
2380 comparison had *any* fixed result, it follows that the
2381 unsigned comparison just tests the sign in reverse
2382 (positive values are LE, negative ones GE).
2383 So we can generate an unsigned comparison
2384 against an extreme value of the signed type. */
2386 if (unsignedp && !unsignedp0)
2393 primop1 = TYPE_MIN_VALUE (type);
2399 primop1 = TYPE_MAX_VALUE (type);
2406 type = c_common_unsigned_type (type);
2409 if (TREE_CODE (primop0) != INTEGER_CST)
2411 if (val == truthvalue_false_node)
2412 warning ("comparison is always false due to limited range of data type");
2413 if (val == truthvalue_true_node)
2414 warning ("comparison is always true due to limited range of data type");
2419 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2420 if (TREE_SIDE_EFFECTS (primop0))
2421 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2425 /* Value is not predetermined, but do the comparison
2426 in the type of the operand that is not constant.
2427 TYPE is already properly set. */
2429 else if (real1 && real2
2430 && (TYPE_PRECISION (TREE_TYPE (primop0))
2431 == TYPE_PRECISION (TREE_TYPE (primop1))))
2432 type = TREE_TYPE (primop0);
2434 /* If args' natural types are both narrower than nominal type
2435 and both extend in the same manner, compare them
2436 in the type of the wider arg.
2437 Otherwise must actually extend both to the nominal
2438 common type lest different ways of extending
2440 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2442 else if (unsignedp0 == unsignedp1 && real1 == real2
2443 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2444 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2446 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2447 type = c_common_signed_or_unsigned_type (unsignedp0
2448 || TYPE_UNSIGNED (*restype_ptr),
2450 /* Make sure shorter operand is extended the right way
2451 to match the longer operand. */
2453 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2454 TREE_TYPE (primop0)),
2457 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2458 TREE_TYPE (primop1)),
2463 /* Here we must do the comparison on the nominal type
2464 using the args exactly as we received them. */
2465 type = *restype_ptr;
2469 if (!real1 && !real2 && integer_zerop (primop1)
2470 && TYPE_UNSIGNED (*restype_ptr))
2476 /* All unsigned values are >= 0, so we warn if extra warnings
2477 are requested. However, if OP0 is a constant that is
2478 >= 0, the signedness of the comparison isn't an issue,
2479 so suppress the warning. */
2480 if (extra_warnings && !in_system_header
2481 && ! (TREE_CODE (primop0) == INTEGER_CST
2482 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2484 warning ("comparison of unsigned expression >= 0 is always true");
2485 value = truthvalue_true_node;
2489 if (extra_warnings && !in_system_header
2490 && ! (TREE_CODE (primop0) == INTEGER_CST
2491 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2493 warning ("comparison of unsigned expression < 0 is always false");
2494 value = truthvalue_false_node;
2503 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2504 if (TREE_SIDE_EFFECTS (primop0))
2505 return build (COMPOUND_EXPR, TREE_TYPE (value),
2512 *op0_ptr = convert (type, primop0);
2513 *op1_ptr = convert (type, primop1);
2515 *restype_ptr = truthvalue_type_node;
2520 /* Return a tree for the sum or difference (RESULTCODE says which)
2521 of pointer PTROP and integer INTOP. */
2524 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2528 /* The result is a pointer of the same type that is being added. */
2530 tree result_type = TREE_TYPE (ptrop);
2532 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2534 if (pedantic || warn_pointer_arith)
2535 pedwarn ("pointer of type `void *' used in arithmetic");
2536 size_exp = integer_one_node;
2538 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2540 if (pedantic || warn_pointer_arith)
2541 pedwarn ("pointer to a function used in arithmetic");
2542 size_exp = integer_one_node;
2544 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2546 if (pedantic || warn_pointer_arith)
2547 pedwarn ("pointer to member function used in arithmetic");
2548 size_exp = integer_one_node;
2551 size_exp = size_in_bytes (TREE_TYPE (result_type));
2553 /* If what we are about to multiply by the size of the elements
2554 contains a constant term, apply distributive law
2555 and multiply that constant term separately.
2556 This helps produce common subexpressions. */
2558 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2559 && ! TREE_CONSTANT (intop)
2560 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2561 && TREE_CONSTANT (size_exp)
2562 /* If the constant comes from pointer subtraction,
2563 skip this optimization--it would cause an error. */
2564 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2565 /* If the constant is unsigned, and smaller than the pointer size,
2566 then we must skip this optimization. This is because it could cause
2567 an overflow error if the constant is negative but INTOP is not. */
2568 && (! TYPE_UNSIGNED (TREE_TYPE (intop))
2569 || (TYPE_PRECISION (TREE_TYPE (intop))
2570 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2572 enum tree_code subcode = resultcode;
2573 tree int_type = TREE_TYPE (intop);
2574 if (TREE_CODE (intop) == MINUS_EXPR)
2575 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2576 /* Convert both subexpression types to the type of intop,
2577 because weird cases involving pointer arithmetic
2578 can result in a sum or difference with different type args. */
2579 ptrop = build_binary_op (subcode, ptrop,
2580 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2581 intop = convert (int_type, TREE_OPERAND (intop, 0));
2584 /* Convert the integer argument to a type the same size as sizetype
2585 so the multiply won't overflow spuriously. */
2587 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2588 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
2589 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2590 TYPE_UNSIGNED (sizetype)), intop);
2592 /* Replace the integer argument with a suitable product by the object size.
2593 Do this multiplication as signed, then convert to the appropriate
2594 pointer type (actually unsigned integral). */
2596 intop = convert (result_type,
2597 build_binary_op (MULT_EXPR, intop,
2598 convert (TREE_TYPE (intop), size_exp), 1));
2600 /* Create the sum or difference. */
2601 return fold (build (resultcode, result_type, ptrop, intop));
2604 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2605 or validate its data type for an `if' or `while' statement or ?..: exp.
2607 This preparation consists of taking the ordinary
2608 representation of an expression expr and producing a valid tree
2609 boolean expression describing whether expr is nonzero. We could
2610 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2611 but we optimize comparisons, &&, ||, and !.
2613 The resulting type should always be `truthvalue_type_node'. */
2616 c_common_truthvalue_conversion (tree expr)
2618 if (TREE_CODE (expr) == ERROR_MARK)
2621 if (TREE_CODE (expr) == FUNCTION_DECL)
2622 expr = build_unary_op (ADDR_EXPR, expr, 0);
2624 switch (TREE_CODE (expr))
2626 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
2627 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2628 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
2629 case ORDERED_EXPR: case UNORDERED_EXPR:
2630 case TRUTH_ANDIF_EXPR:
2631 case TRUTH_ORIF_EXPR:
2632 case TRUTH_AND_EXPR:
2634 case TRUTH_XOR_EXPR:
2635 case TRUTH_NOT_EXPR:
2636 TREE_TYPE (expr) = truthvalue_type_node;
2643 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2646 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2650 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2651 && ! DECL_WEAK (TREE_OPERAND (expr, 0)))
2653 /* Common Ada/Pascal programmer's mistake. We always warn
2654 about this since it is so bad. */
2655 warning ("the address of `%D', will always evaluate as `true'",
2656 TREE_OPERAND (expr, 0));
2657 return truthvalue_true_node;
2660 /* If we are taking the address of an external decl, it might be
2661 zero if it is weak, so we cannot optimize. */
2662 if (DECL_P (TREE_OPERAND (expr, 0))
2663 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2666 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2667 return build (COMPOUND_EXPR, truthvalue_type_node,
2668 TREE_OPERAND (expr, 0), truthvalue_true_node);
2670 return truthvalue_true_node;
2674 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2675 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2676 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)),
2677 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2683 /* These don't change whether an object is nonzero or zero. */
2684 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2688 /* These don't change whether an object is zero or nonzero, but
2689 we can't ignore them if their second arg has side-effects. */
2690 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2691 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2692 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)));
2694 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2697 /* Distribute the conversion into the arms of a COND_EXPR. */
2698 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2699 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2700 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 2))));
2703 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2704 since that affects how `default_conversion' will behave. */
2705 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2706 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2708 /* Fall through.... */
2710 /* If this is widening the argument, we can ignore it. */
2711 if (TYPE_PRECISION (TREE_TYPE (expr))
2712 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2713 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2717 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2718 aren't guaranteed to the be same for modes that can represent
2719 infinity, since if x and y are both +infinity, or both
2720 -infinity, then x - y is not a number.
2722 Note that this transformation is safe when x or y is NaN.
2723 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2725 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2727 /* Fall through.... */
2729 /* This and MINUS_EXPR can be changed into a comparison of the
2731 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2732 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2733 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2734 TREE_OPERAND (expr, 1), 1);
2735 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2736 fold (build1 (NOP_EXPR,
2737 TREE_TYPE (TREE_OPERAND (expr, 0)),
2738 TREE_OPERAND (expr, 1))), 1);
2741 if (integer_onep (TREE_OPERAND (expr, 1))
2742 && TREE_TYPE (expr) != truthvalue_type_node)
2743 /* Using convert here would cause infinite recursion. */
2744 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2748 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2749 warning ("suggest parentheses around assignment used as truth value");
2756 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2758 tree t = save_expr (expr);
2759 return (build_binary_op
2760 ((TREE_SIDE_EFFECTS (expr)
2761 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2762 lang_hooks.truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2763 lang_hooks.truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2767 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2770 static tree builtin_function_2 (const char *, const char *, tree, tree,
2771 int, enum built_in_class, int, int,
2774 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2775 down to the element type of an array. */
2778 c_build_qualified_type (tree type, int type_quals)
2780 if (type == error_mark_node)
2783 if (TREE_CODE (type) == ARRAY_TYPE)
2784 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2786 TYPE_DOMAIN (type));
2788 /* A restrict-qualified pointer type must be a pointer to object or
2789 incomplete type. Note that the use of POINTER_TYPE_P also allows
2790 REFERENCE_TYPEs, which is appropriate for C++. */
2791 if ((type_quals & TYPE_QUAL_RESTRICT)
2792 && (!POINTER_TYPE_P (type)
2793 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2795 error ("invalid use of `restrict'");
2796 type_quals &= ~TYPE_QUAL_RESTRICT;
2799 return build_qualified_type (type, type_quals);
2802 /* Apply the TYPE_QUALS to the new DECL. */
2805 c_apply_type_quals_to_decl (int type_quals, tree decl)
2807 tree type = TREE_TYPE (decl);
2809 if (type == error_mark_node)
2812 if (((type_quals & TYPE_QUAL_CONST)
2813 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2814 /* An object declared 'const' is only readonly after it is
2815 initialized. We don't have any way of expressing this currently,
2816 so we need to be conservative and unset TREE_READONLY for types
2817 with constructors. Otherwise aliasing code will ignore stores in
2818 an inline constructor. */
2819 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2820 TREE_READONLY (decl) = 1;
2821 if (type_quals & TYPE_QUAL_VOLATILE)
2823 TREE_SIDE_EFFECTS (decl) = 1;
2824 TREE_THIS_VOLATILE (decl) = 1;
2826 if (type_quals & TYPE_QUAL_RESTRICT)
2828 while (type && TREE_CODE (type) == ARRAY_TYPE)
2829 /* Allow 'restrict' on arrays of pointers.
2830 FIXME currently we just ignore it. */
2831 type = TREE_TYPE (type);
2833 || !POINTER_TYPE_P (type)
2834 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2835 error ("invalid use of `restrict'");
2836 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2837 /* Indicate we need to make a unique alias set for this pointer.
2838 We can't do it here because it might be pointing to an
2840 DECL_POINTER_ALIAS_SET (decl) = -2;
2844 /* Hash function for the problem of multiple type definitions in
2845 different files. This must hash all types that will compare
2846 equal via comptypes to the same value. In practice it hashes
2847 on some of the simple stuff and leaves the details to comptypes. */
2850 c_type_hash (const void *p)
2856 switch (TREE_CODE (t))
2858 /* For pointers, hash on pointee type plus some swizzling. */
2860 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
2861 /* Hash on number of elements and total size. */
2864 t2 = TYPE_VALUES (t);
2868 t2 = TYPE_FIELDS (t);
2870 case QUAL_UNION_TYPE:
2872 t2 = TYPE_FIELDS (t);
2876 t2 = TYPE_FIELDS (t);
2881 for (; t2; t2 = TREE_CHAIN (t2))
2883 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
2884 return ((size << 24) | (i << shift));
2887 /* Return the typed-based alias set for T, which may be an expression
2888 or a type. Return -1 if we don't do anything special. */
2891 c_common_get_alias_set (tree t)
2895 static htab_t type_hash_table;
2897 /* Permit type-punning when accessing a union, provided the access
2898 is directly through the union. For example, this code does not
2899 permit taking the address of a union member and then storing
2900 through it. Even the type-punning allowed here is a GCC
2901 extension, albeit a common and useful one; the C standard says
2902 that such accesses have implementation-defined behavior. */
2904 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2905 u = TREE_OPERAND (u, 0))
2906 if (TREE_CODE (u) == COMPONENT_REF
2907 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2910 /* That's all the expressions we handle specially. */
2914 /* The C standard guarantees that any object may be accessed via an
2915 lvalue that has character type. */
2916 if (t == char_type_node
2917 || t == signed_char_type_node
2918 || t == unsigned_char_type_node)
2921 /* If it has the may_alias attribute, it can alias anything. */
2922 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2925 /* The C standard specifically allows aliasing between signed and
2926 unsigned variants of the same type. We treat the signed
2927 variant as canonical. */
2928 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
2930 tree t1 = c_common_signed_type (t);
2932 /* t1 == t can happen for boolean nodes which are always unsigned. */
2934 return get_alias_set (t1);
2936 else if (POINTER_TYPE_P (t))
2940 /* Unfortunately, there is no canonical form of a pointer type.
2941 In particular, if we have `typedef int I', then `int *', and
2942 `I *' are different types. So, we have to pick a canonical
2943 representative. We do this below.
2945 Technically, this approach is actually more conservative that
2946 it needs to be. In particular, `const int *' and `int *'
2947 should be in different alias sets, according to the C and C++
2948 standard, since their types are not the same, and so,
2949 technically, an `int **' and `const int **' cannot point at
2952 But, the standard is wrong. In particular, this code is
2957 const int* const* cipp = ipp;
2959 And, it doesn't make sense for that to be legal unless you
2960 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2961 the pointed-to types. This issue has been reported to the
2963 t1 = build_type_no_quals (t);
2965 return get_alias_set (t1);
2968 /* Handle the case of multiple type nodes referring to "the same" type,
2969 which occurs with IMA. These share an alias set. FIXME: Currently only
2970 C90 is handled. (In C99 type compatibility is not transitive, which
2971 complicates things mightily. The alias set splay trees can theoretically
2972 represent this, but insertion is tricky when you consider all the
2973 different orders things might arrive in.) */
2975 if (c_language != clk_c || flag_isoc99)
2978 /* Save time if there's only one input file. */
2979 if (!current_file_decl || TREE_CHAIN (current_file_decl) == NULL_TREE)
2982 /* Pointers need special handling if they point to any type that
2983 needs special handling (below). */
2984 if (TREE_CODE (t) == POINTER_TYPE)
2987 /* Find bottom type under any nested POINTERs. */
2988 for (t2 = TREE_TYPE (t);
2989 TREE_CODE (t2) == POINTER_TYPE;
2990 t2 = TREE_TYPE (t2))
2992 if (TREE_CODE (t2) != RECORD_TYPE
2993 && TREE_CODE (t2) != ENUMERAL_TYPE
2994 && TREE_CODE (t2) != QUAL_UNION_TYPE
2995 && TREE_CODE (t2) != UNION_TYPE)
2997 if (TYPE_SIZE (t2) == 0)
3000 /* These are the only cases that need special handling. */
3001 if (TREE_CODE (t) != RECORD_TYPE
3002 && TREE_CODE (t) != ENUMERAL_TYPE
3003 && TREE_CODE (t) != QUAL_UNION_TYPE
3004 && TREE_CODE (t) != UNION_TYPE
3005 && TREE_CODE (t) != POINTER_TYPE)
3008 if (TYPE_SIZE (t) == 0)
3011 /* Look up t in hash table. Only one of the compatible types within each
3012 alias set is recorded in the table. */
3013 if (!type_hash_table)
3014 type_hash_table = htab_create (1021, c_type_hash,
3015 (htab_eq) lang_hooks.types_compatible_p,
3017 slot = htab_find_slot (type_hash_table, t, INSERT);
3019 return TYPE_ALIAS_SET ((tree)*slot);
3021 /* Our caller will assign and record (in t) a new alias set; all we need
3022 to do is remember t in the hash table. */
3028 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3029 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3030 flag controls whether we should diagnose possibly ill-formed
3031 constructs or not. */
3033 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
3035 const char *op_name;
3037 enum tree_code type_code = TREE_CODE (type);
3039 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
3040 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
3042 if (type_code == FUNCTION_TYPE)
3044 if (op == SIZEOF_EXPR)
3046 if (complain && (pedantic || warn_pointer_arith))
3047 pedwarn ("invalid application of `sizeof' to a function type");
3048 value = size_one_node;
3051 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
3053 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
3055 if (type_code == VOID_TYPE
3056 && complain && (pedantic || warn_pointer_arith))
3057 pedwarn ("invalid application of `%s' to a void type", op_name);
3058 value = size_one_node;
3060 else if (!COMPLETE_TYPE_P (type))
3063 error ("invalid application of `%s' to an incomplete type", op_name);
3064 value = size_zero_node;
3068 if (op == SIZEOF_EXPR)
3069 /* Convert in case a char is more than one unit. */
3070 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
3071 size_int (TYPE_PRECISION (char_type_node)
3074 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
3077 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3078 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3079 never happen. However, this node should really have type
3080 `size_t', which is just a typedef for an ordinary integer type. */
3081 value = fold (build1 (NOP_EXPR, size_type_node, value));
3082 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
3087 /* Implement the __alignof keyword: Return the minimum required
3088 alignment of EXPR, measured in bytes. For VAR_DECL's and
3089 FIELD_DECL's return DECL_ALIGN (which can be set from an
3090 "aligned" __attribute__ specification). */
3093 c_alignof_expr (tree expr)
3097 if (TREE_CODE (expr) == VAR_DECL)
3098 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
3100 else if (TREE_CODE (expr) == COMPONENT_REF
3101 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
3103 error ("`__alignof' applied to a bit-field");
3106 else if (TREE_CODE (expr) == COMPONENT_REF
3107 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
3108 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
3110 else if (TREE_CODE (expr) == INDIRECT_REF)
3112 tree t = TREE_OPERAND (expr, 0);
3114 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3116 while (TREE_CODE (t) == NOP_EXPR
3117 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3121 t = TREE_OPERAND (t, 0);
3122 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3123 if (thisalign > bestalign)
3124 best = t, bestalign = thisalign;
3126 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3129 return c_alignof (TREE_TYPE (expr));
3131 return fold (build1 (NOP_EXPR, size_type_node, t));
3134 /* Handle C and C++ default attributes. */
3136 enum built_in_attribute
3138 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3139 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3140 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3141 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3142 #include "builtin-attrs.def"
3143 #undef DEF_ATTR_NULL_TREE
3145 #undef DEF_ATTR_IDENT
3146 #undef DEF_ATTR_TREE_LIST
3150 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3152 static void c_init_attributes (void);
3154 /* Build tree nodes and builtin functions common to both C and C++ language
3158 c_common_nodes_and_builtins (void)
3162 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3163 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3164 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3165 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3166 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3167 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3168 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3169 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3170 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3171 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3172 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3173 #include "builtin-types.def"
3174 #undef DEF_PRIMITIVE_TYPE
3175 #undef DEF_FUNCTION_TYPE_0
3176 #undef DEF_FUNCTION_TYPE_1
3177 #undef DEF_FUNCTION_TYPE_2
3178 #undef DEF_FUNCTION_TYPE_3
3179 #undef DEF_FUNCTION_TYPE_4
3180 #undef DEF_FUNCTION_TYPE_VAR_0
3181 #undef DEF_FUNCTION_TYPE_VAR_1
3182 #undef DEF_FUNCTION_TYPE_VAR_2
3183 #undef DEF_FUNCTION_TYPE_VAR_3
3184 #undef DEF_POINTER_TYPE
3188 typedef enum builtin_type builtin_type;
3190 tree builtin_types[(int) BT_LAST];
3191 int wchar_type_size;
3192 tree array_domain_type;
3193 tree va_list_ref_type_node;
3194 tree va_list_arg_type_node;
3196 /* Define `int' and `char' first so that dbx will output them first. */
3197 record_builtin_type (RID_INT, NULL, integer_type_node);
3198 record_builtin_type (RID_CHAR, "char", char_type_node);
3200 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3201 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3202 but not C. Are the conditionals here needed? */
3203 if (c_dialect_cxx ())
3204 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3205 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3206 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3207 record_builtin_type (RID_MAX, "long unsigned int",
3208 long_unsigned_type_node);
3209 if (c_dialect_cxx ())
3210 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3211 record_builtin_type (RID_MAX, "long long int",
3212 long_long_integer_type_node);
3213 record_builtin_type (RID_MAX, "long long unsigned int",
3214 long_long_unsigned_type_node);
3215 if (c_dialect_cxx ())
3216 record_builtin_type (RID_MAX, "long long unsigned",
3217 long_long_unsigned_type_node);
3218 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3219 record_builtin_type (RID_MAX, "short unsigned int",
3220 short_unsigned_type_node);
3221 if (c_dialect_cxx ())
3222 record_builtin_type (RID_MAX, "unsigned short",
3223 short_unsigned_type_node);
3225 /* Define both `signed char' and `unsigned char'. */
3226 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3227 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3229 /* These are types that c_common_type_for_size and
3230 c_common_type_for_mode use. */
3231 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3233 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3235 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3237 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3239 #if HOST_BITS_PER_WIDE_INT >= 64
3240 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3241 get_identifier ("__int128_t"),
3244 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3245 unsigned_intQI_type_node));
3246 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3247 unsigned_intHI_type_node));
3248 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3249 unsigned_intSI_type_node));
3250 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3251 unsigned_intDI_type_node));
3252 #if HOST_BITS_PER_WIDE_INT >= 64
3253 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3254 get_identifier ("__uint128_t"),
3255 unsigned_intTI_type_node));
3258 /* Create the widest literal types. */
3259 widest_integer_literal_type_node
3260 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3261 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3262 widest_integer_literal_type_node));
3264 widest_unsigned_literal_type_node
3265 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3266 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3267 widest_unsigned_literal_type_node));
3269 /* `unsigned long' is the standard type for sizeof.
3270 Note that stddef.h uses `unsigned long',
3271 and this must agree, even if long and int are the same size. */
3273 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3274 signed_size_type_node = c_common_signed_type (size_type_node);
3275 set_sizetype (size_type_node);
3278 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
3280 build_common_tree_nodes_2 (flag_short_double);
3282 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3283 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3284 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3286 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3287 get_identifier ("complex int"),
3288 complex_integer_type_node));
3289 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3290 get_identifier ("complex float"),
3291 complex_float_type_node));
3292 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3293 get_identifier ("complex double"),
3294 complex_double_type_node));
3295 lang_hooks.decls.pushdecl
3296 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3297 complex_long_double_type_node));
3299 record_builtin_type (RID_VOID, NULL, void_type_node);
3301 void_zero_node = build_int_2 (0, 0);
3302 TREE_TYPE (void_zero_node) = void_type_node;
3304 void_list_node = build_void_list_node ();
3306 /* Make a type to be the domain of a few array types
3307 whose domains don't really matter.
3308 200 is small enough that it always fits in size_t
3309 and large enough that it can hold most function names for the
3310 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3311 array_domain_type = build_index_type (size_int (200));
3313 /* Make a type for arrays of characters.
3314 With luck nothing will ever really depend on the length of this
3316 char_array_type_node
3317 = build_array_type (char_type_node, array_domain_type);
3319 /* Likewise for arrays of ints. */
3321 = build_array_type (integer_type_node, array_domain_type);
3323 string_type_node = build_pointer_type (char_type_node);
3324 const_string_type_node
3325 = build_pointer_type (build_qualified_type
3326 (char_type_node, TYPE_QUAL_CONST));
3328 /* This is special for C++ so functions can be overloaded. */
3329 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3330 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3331 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3332 if (c_dialect_cxx ())
3334 if (TYPE_UNSIGNED (wchar_type_node))
3335 wchar_type_node = make_unsigned_type (wchar_type_size);
3337 wchar_type_node = make_signed_type (wchar_type_size);
3338 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3342 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3343 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3346 /* This is for wide string constants. */
3347 wchar_array_type_node
3348 = build_array_type (wchar_type_node, array_domain_type);
3351 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3354 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3356 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3358 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3360 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3361 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3363 lang_hooks.decls.pushdecl
3364 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3365 va_list_type_node));
3367 lang_hooks.decls.pushdecl
3368 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3369 ptrdiff_type_node));
3371 lang_hooks.decls.pushdecl
3372 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3375 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3377 va_list_arg_type_node = va_list_ref_type_node =
3378 build_pointer_type (TREE_TYPE (va_list_type_node));
3382 va_list_arg_type_node = va_list_type_node;
3383 va_list_ref_type_node = build_reference_type (va_list_type_node);
3386 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3387 builtin_types[(int) ENUM] = VALUE;
3388 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3389 builtin_types[(int) ENUM] \
3390 = build_function_type (builtin_types[(int) RETURN], \
3392 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3393 builtin_types[(int) ENUM] \
3394 = build_function_type (builtin_types[(int) RETURN], \
3395 tree_cons (NULL_TREE, \
3396 builtin_types[(int) ARG1], \
3398 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3399 builtin_types[(int) ENUM] \
3400 = build_function_type \
3401 (builtin_types[(int) RETURN], \
3402 tree_cons (NULL_TREE, \
3403 builtin_types[(int) ARG1], \
3404 tree_cons (NULL_TREE, \
3405 builtin_types[(int) ARG2], \
3407 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3408 builtin_types[(int) ENUM] \
3409 = build_function_type \
3410 (builtin_types[(int) RETURN], \
3411 tree_cons (NULL_TREE, \
3412 builtin_types[(int) ARG1], \
3413 tree_cons (NULL_TREE, \
3414 builtin_types[(int) ARG2], \
3415 tree_cons (NULL_TREE, \
3416 builtin_types[(int) ARG3], \
3418 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3419 builtin_types[(int) ENUM] \
3420 = build_function_type \
3421 (builtin_types[(int) RETURN], \
3422 tree_cons (NULL_TREE, \
3423 builtin_types[(int) ARG1], \
3424 tree_cons (NULL_TREE, \
3425 builtin_types[(int) ARG2], \
3428 builtin_types[(int) ARG3], \
3429 tree_cons (NULL_TREE, \
3430 builtin_types[(int) ARG4], \
3431 void_list_node)))));
3432 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3433 builtin_types[(int) ENUM] \
3434 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3435 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3436 builtin_types[(int) ENUM] \
3437 = build_function_type (builtin_types[(int) RETURN], \
3438 tree_cons (NULL_TREE, \
3439 builtin_types[(int) ARG1], \
3442 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3443 builtin_types[(int) ENUM] \
3444 = build_function_type \
3445 (builtin_types[(int) RETURN], \
3446 tree_cons (NULL_TREE, \
3447 builtin_types[(int) ARG1], \
3448 tree_cons (NULL_TREE, \
3449 builtin_types[(int) ARG2], \
3452 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
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], \
3460 tree_cons (NULL_TREE, \
3461 builtin_types[(int) ARG3], \
3464 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3465 builtin_types[(int) ENUM] \
3466 = build_pointer_type (builtin_types[(int) TYPE]);
3467 #include "builtin-types.def"
3468 #undef DEF_PRIMITIVE_TYPE
3469 #undef DEF_FUNCTION_TYPE_1
3470 #undef DEF_FUNCTION_TYPE_2
3471 #undef DEF_FUNCTION_TYPE_3
3472 #undef DEF_FUNCTION_TYPE_4
3473 #undef DEF_FUNCTION_TYPE_VAR_0
3474 #undef DEF_FUNCTION_TYPE_VAR_1
3475 #undef DEF_FUNCTION_TYPE_VAR_2
3476 #undef DEF_FUNCTION_TYPE_VAR_3
3477 #undef DEF_POINTER_TYPE
3479 c_init_attributes ();
3481 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3482 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3487 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3491 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3494 ? (NAME + strlen ("__builtin_")) \
3496 built_in_attributes[(int) ATTRS]); \
3498 decl = builtin_function_2 (NAME, \
3499 NAME + strlen ("__builtin_"), \
3500 builtin_types[TYPE], \
3501 builtin_types[LIBTYPE], \
3506 built_in_attributes[(int) ATTRS]); \
3508 built_in_decls[(int) ENUM] = decl; \
3510 implicit_built_in_decls[(int) ENUM] = decl; \
3512 #include "builtins.def"
3515 targetm.init_builtins ();
3517 main_identifier_node = get_identifier ("main");
3521 build_va_arg (tree expr, tree type)
3523 return build1 (VA_ARG_EXPR, type, expr);
3527 /* Linked list of disabled built-in functions. */
3529 typedef struct disabled_builtin
3532 struct disabled_builtin *next;
3534 static disabled_builtin *disabled_builtins = NULL;
3536 static bool builtin_function_disabled_p (const char *);
3538 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3539 begins with "__builtin_", give an error. */
3542 disable_builtin_function (const char *name)
3544 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3545 error ("cannot disable built-in function `%s'", name);
3548 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3550 new->next = disabled_builtins;
3551 disabled_builtins = new;
3556 /* Return true if the built-in function NAME has been disabled, false
3560 builtin_function_disabled_p (const char *name)
3562 disabled_builtin *p;
3563 for (p = disabled_builtins; p != NULL; p = p->next)
3565 if (strcmp (name, p->name) == 0)
3572 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3573 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3574 of these may be NULL (though both being NULL is useless).
3575 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3576 TYPE is the type of the function with the ordinary name. These
3577 may differ if the ordinary name is declared with a looser type to avoid
3578 conflicts with headers. FUNCTION_CODE and CLASS are as for
3579 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3580 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3581 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3582 ATTRS is the tree list representing the builtin's function attributes.
3583 Returns the declaration of BUILTIN_NAME, if any, otherwise
3584 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3585 or if NONANSI_P and flag_no_nonansi_builtin. */
3588 builtin_function_2 (const char *builtin_name, const char *name,
3589 tree builtin_type, tree type, int function_code,
3590 enum built_in_class class, int library_name_p,
3591 int nonansi_p, tree attrs)
3593 tree bdecl = NULL_TREE;
3594 tree decl = NULL_TREE;
3596 if (builtin_name != 0)
3597 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3598 class, library_name_p ? name : NULL, attrs);
3600 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3601 && !(nonansi_p && flag_no_nonansi_builtin))
3602 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3604 return (bdecl != 0 ? bdecl : decl);
3607 /* Nonzero if the type T promotes to int. This is (nearly) the
3608 integral promotions defined in ISO C99 6.3.1.1/2. */
3611 c_promoting_integer_type_p (tree t)
3613 switch (TREE_CODE (t))
3616 return (TYPE_MAIN_VARIANT (t) == char_type_node
3617 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3618 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3619 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3620 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3621 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3624 /* ??? Technically all enumerations not larger than an int
3625 promote to an int. But this is used along code paths
3626 that only want to notice a size change. */
3627 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3637 /* Return 1 if PARMS specifies a fixed number of parameters
3638 and none of their types is affected by default promotions. */
3641 self_promoting_args_p (tree parms)
3644 for (t = parms; t; t = TREE_CHAIN (t))
3646 tree type = TREE_VALUE (t);
3648 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3654 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3657 if (c_promoting_integer_type_p (type))
3663 /* Recursively examines the array elements of TYPE, until a non-array
3664 element type is found. */
3667 strip_array_types (tree type)
3669 while (TREE_CODE (type) == ARRAY_TYPE)
3670 type = TREE_TYPE (type);
3675 /* Recursively remove any '*' or '&' operator from TYPE. */
3677 strip_pointer_operator (tree t)
3679 while (POINTER_TYPE_P (t))
3684 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3686 /* Expand a call to an unordered comparison function such as
3687 __builtin_isgreater(). FUNCTION is the function's declaration and
3688 PARAMS a list of the values passed. For __builtin_isunordered(),
3689 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3690 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3691 that give the opposite of the desired result. UNORDERED_CODE is
3692 used for modes that can hold NaNs and ORDERED_CODE is used for the
3696 expand_unordered_cmp (tree function, tree params,
3697 enum tree_code unordered_code,
3698 enum tree_code ordered_code)
3700 tree arg0, arg1, type;
3701 enum tree_code code0, code1;
3703 /* Check that we have exactly two arguments. */
3704 if (params == 0 || TREE_CHAIN (params) == 0)
3706 error ("too few arguments to function `%s'",
3707 IDENTIFIER_POINTER (DECL_NAME (function)));
3708 return error_mark_node;
3710 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3712 error ("too many arguments to function `%s'",
3713 IDENTIFIER_POINTER (DECL_NAME (function)));
3714 return error_mark_node;
3717 arg0 = TREE_VALUE (params);
3718 arg1 = TREE_VALUE (TREE_CHAIN (params));
3720 code0 = TREE_CODE (TREE_TYPE (arg0));
3721 code1 = TREE_CODE (TREE_TYPE (arg1));
3723 /* Make sure that the arguments have a common type of REAL. */
3725 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3726 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3727 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3729 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3731 error ("non-floating-point argument to function `%s'",
3732 IDENTIFIER_POINTER (DECL_NAME (function)));
3733 return error_mark_node;
3736 if (unordered_code == UNORDERED_EXPR)
3738 if (MODE_HAS_NANS (TYPE_MODE (type)))
3739 return build_binary_op (unordered_code,
3740 convert (type, arg0),
3741 convert (type, arg1),
3744 return integer_zero_node;
3747 return build_unary_op (TRUTH_NOT_EXPR,
3748 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3751 convert (type, arg0),
3752 convert (type, arg1),
3758 /* Recognize certain built-in functions so we can make tree-codes
3759 other than CALL_EXPR. We do this when it enables fold-const.c
3760 to do something useful. */
3761 /* ??? By rights this should go in builtins.c, but only C and C++
3762 implement build_{binary,unary}_op. Not exactly sure what bits
3763 of functionality are actually needed from those functions, or
3764 where the similar functionality exists in the other front ends. */
3767 expand_tree_builtin (tree function, tree params, tree coerced_params)
3769 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3772 switch (DECL_FUNCTION_CODE (function))
3776 case BUILT_IN_LLABS:
3777 case BUILT_IN_IMAXABS:
3779 case BUILT_IN_FABSL:
3780 case BUILT_IN_FABSF:
3781 if (coerced_params == 0)
3782 return integer_zero_node;
3783 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3786 case BUILT_IN_CONJF:
3787 case BUILT_IN_CONJL:
3788 if (coerced_params == 0)
3789 return integer_zero_node;
3790 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3792 case BUILT_IN_CREAL:
3793 case BUILT_IN_CREALF:
3794 case BUILT_IN_CREALL:
3795 if (coerced_params == 0)
3796 return integer_zero_node;
3797 return non_lvalue (build_unary_op (REALPART_EXPR,
3798 TREE_VALUE (coerced_params), 0));
3800 case BUILT_IN_CIMAG:
3801 case BUILT_IN_CIMAGF:
3802 case BUILT_IN_CIMAGL:
3803 if (coerced_params == 0)
3804 return integer_zero_node;
3805 return non_lvalue (build_unary_op (IMAGPART_EXPR,
3806 TREE_VALUE (coerced_params), 0));
3808 case BUILT_IN_ISGREATER:
3809 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3811 case BUILT_IN_ISGREATEREQUAL:
3812 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3814 case BUILT_IN_ISLESS:
3815 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3817 case BUILT_IN_ISLESSEQUAL:
3818 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3820 case BUILT_IN_ISLESSGREATER:
3821 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3823 case BUILT_IN_ISUNORDERED:
3824 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3833 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3834 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3835 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3836 value, the traversal is aborted, and the value returned by FUNC is
3837 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3838 the node being visited are not walked.
3840 We don't need a without_duplicates variant of this one because the
3841 statement tree is a tree, not a graph. */
3844 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3846 enum tree_code code;
3851 #define WALK_SUBTREE(NODE) \
3854 result = walk_stmt_tree (&(NODE), func, data); \
3860 /* Skip empty subtrees. */
3864 /* Skip subtrees below non-statement nodes. */
3865 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3868 /* Call the function. */
3870 result = (*func) (tp, &walk_subtrees, data);
3872 /* If we found something, return it. */
3876 /* FUNC may have modified the tree, recheck that we're looking at a
3878 code = TREE_CODE (*tp);
3879 if (!STATEMENT_CODE_P (code))
3882 /* Visit the subtrees unless FUNC decided that there was nothing
3883 interesting below this point in the tree. */
3886 /* Walk over all the sub-trees of this operand. Statement nodes
3887 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3888 len = TREE_CODE_LENGTH (code);
3890 /* Go through the subtrees. We need to do this in forward order so
3891 that the scope of a FOR_EXPR is handled properly. */
3892 for (i = 0; i < len; ++i)
3893 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3896 /* Finally visit the chain. This can be tail-recursion optimized if
3897 we write it this way. */
3898 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3903 /* Used to compare case labels. K1 and K2 are actually tree nodes
3904 representing case labels, or NULL_TREE for a `default' label.
3905 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3906 K2, and 0 if K1 and K2 are equal. */
3909 case_compare (splay_tree_key k1, splay_tree_key k2)
3911 /* Consider a NULL key (such as arises with a `default' label) to be
3912 smaller than anything else. */
3918 return tree_int_cst_compare ((tree) k1, (tree) k2);
3921 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3922 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3923 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3924 case label was declared using the usual C/C++ syntax, rather than
3925 the GNU case range extension. CASES is a tree containing all the
3926 case ranges processed so far; COND is the condition for the
3927 switch-statement itself. Returns the CASE_LABEL created, or
3928 ERROR_MARK_NODE if no CASE_LABEL is created. */
3931 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3937 splay_tree_node node;
3939 /* Create the LABEL_DECL itself. */
3940 label = create_artificial_label ();
3942 /* If there was an error processing the switch condition, bail now
3943 before we get more confused. */
3944 if (!cond || cond == error_mark_node)
3947 if ((low_value && TREE_TYPE (low_value)
3948 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3949 || (high_value && TREE_TYPE (high_value)
3950 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3951 error ("pointers are not permitted as case values");
3953 /* Case ranges are a GNU extension. */
3954 if (high_value && pedantic)
3955 pedwarn ("range expressions in switch statements are non-standard");
3957 type = TREE_TYPE (cond);
3960 low_value = check_case_value (low_value);
3961 low_value = convert_and_check (type, low_value);
3965 high_value = check_case_value (high_value);
3966 high_value = convert_and_check (type, high_value);
3969 /* If an error has occurred, bail out now. */
3970 if (low_value == error_mark_node || high_value == error_mark_node)
3973 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3974 really a case range, even though it was written that way. Remove
3975 the HIGH_VALUE to simplify later processing. */
3976 if (tree_int_cst_equal (low_value, high_value))
3977 high_value = NULL_TREE;
3978 if (low_value && high_value
3979 && !tree_int_cst_lt (low_value, high_value))
3980 warning ("empty range specified");
3982 /* Look up the LOW_VALUE in the table of case labels we already
3984 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3985 /* If there was not an exact match, check for overlapping ranges.
3986 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3987 that's a `default' label and the only overlap is an exact match. */
3988 if (!node && (low_value || high_value))
3990 splay_tree_node low_bound;
3991 splay_tree_node high_bound;
3993 /* Even though there wasn't an exact match, there might be an
3994 overlap between this case range and another case range.
3995 Since we've (inductively) not allowed any overlapping case
3996 ranges, we simply need to find the greatest low case label
3997 that is smaller that LOW_VALUE, and the smallest low case
3998 label that is greater than LOW_VALUE. If there is an overlap
3999 it will occur in one of these two ranges. */
4000 low_bound = splay_tree_predecessor (cases,
4001 (splay_tree_key) low_value);
4002 high_bound = splay_tree_successor (cases,
4003 (splay_tree_key) low_value);
4005 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4006 the LOW_VALUE, so there is no need to check unless the
4007 LOW_BOUND is in fact itself a case range. */
4009 && CASE_HIGH ((tree) low_bound->value)
4010 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
4013 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4014 range is bigger than the low end of the current range, so we
4015 are only interested if the current range is a real range, and
4016 not an ordinary case label. */
4019 && (tree_int_cst_compare ((tree) high_bound->key,
4024 /* If there was an overlap, issue an error. */
4027 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
4031 error ("duplicate (or overlapping) case value");
4032 error ("%Jthis is the first entry overlapping that value", duplicate);
4036 error ("duplicate case value") ;
4037 error ("%Jpreviously used here", duplicate);
4041 error ("multiple default labels in one switch");
4042 error ("%Jthis is the first default label", duplicate);
4047 /* Add a CASE_LABEL to the statement-tree. */
4048 case_label = add_stmt (build_case_label (low_value, high_value, label));
4049 /* Register this case label in the splay tree. */
4050 splay_tree_insert (cases,
4051 (splay_tree_key) low_value,
4052 (splay_tree_value) case_label);
4057 /* Add a label so that the back-end doesn't think that the beginning o
4058 the switch is unreachable. Note that we do not add a case label, as
4059 that just leads to duplicates and thence to aborts later on. */
4062 tree t = create_artificial_label ();
4063 add_stmt (build_stmt (LABEL_STMT, t));
4065 return error_mark_node;
4068 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
4069 Used to verify that case values match up with enumerator values. */
4072 match_case_to_enum_1 (tree key, tree type, tree label)
4074 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
4076 /* ??? Not working too hard to print the double-word value.
4077 Should perhaps be done with %lwd in the diagnostic routines? */
4078 if (TREE_INT_CST_HIGH (key) == 0)
4079 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
4080 TREE_INT_CST_LOW (key));
4081 else if (!TYPE_UNSIGNED (type)
4082 && TREE_INT_CST_HIGH (key) == -1
4083 && TREE_INT_CST_LOW (key) != 0)
4084 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
4085 -TREE_INT_CST_LOW (key));
4087 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
4088 TREE_INT_CST_HIGH (key), TREE_INT_CST_LOW (key));
4090 if (TYPE_NAME (type) == 0)
4091 warning ("%Jcase value `%s' not in enumerated type",
4092 CASE_LABEL_DECL (label), buf);
4094 warning ("%Jcase value `%s' not in enumerated type `%T'",
4095 CASE_LABEL_DECL (label), buf, type);
4099 match_case_to_enum (splay_tree_node node, void *data)
4101 tree label = (tree) node->value;
4104 /* Skip default case. */
4105 if (!CASE_LOW (label))
4108 /* If TREE_ADDRESSABLE is not set, that means CASE_LOW did not appear
4109 when we did our enum->case scan. Reset our scratch bit after. */
4110 if (!TREE_ADDRESSABLE (label))
4111 match_case_to_enum_1 (CASE_LOW (label), type, label);
4113 TREE_ADDRESSABLE (label) = 0;
4115 /* If CASE_HIGH is non-null, we have a range. Here we must search.
4116 Note that the old code in stmt.c did not check for the values in
4117 the range either, just the endpoints. */
4118 if (CASE_HIGH (label))
4120 tree chain, key = CASE_HIGH (label);
4122 for (chain = TYPE_VALUES (type);
4123 chain && !tree_int_cst_equal (key, TREE_VALUE (chain));
4124 chain = TREE_CHAIN (chain))
4127 match_case_to_enum_1 (key, type, label);
4133 /* Handle -Wswitch*. Called from the front end after parsing the switch
4135 /* ??? Should probably be somewhere generic, since other languages besides
4136 C and C++ would want this. We'd want to agree on the datastructure,
4137 however, which is a problem. Alternately, we operate on gimplified
4138 switch_exprs, which I don't especially like. At the moment, however,
4139 C/C++ are the only tree-ssa languages that support enumerations at all,
4140 so the point is moot. */
4143 c_do_switch_warnings (splay_tree cases, tree switch_stmt)
4145 splay_tree_node default_node;
4146 location_t *switch_locus;
4149 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
4152 switch_locus = EXPR_LOCUS (switch_stmt);
4154 switch_locus = &input_location;
4155 type = SWITCH_TYPE (switch_stmt);
4157 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
4158 if (warn_switch_default && !default_node)
4159 warning ("%Hswitch missing default case", switch_locus);
4161 /* If the switch expression was an enumerated type, check that
4162 exactly all enumeration literals are covered by the cases.
4163 The check is made when -Wswitch was specified and there is no
4164 default case, or when -Wswitch-enum was specified. */
4165 if (((warn_switch && !default_node) || warn_switch_enum)
4166 && type && TREE_CODE (type) == ENUMERAL_TYPE
4167 && TREE_CODE (SWITCH_COND (switch_stmt)) != INTEGER_CST)
4171 /* The time complexity here is O(N*lg(N)) worst case, but for the
4172 common case of monotonically increasing enumerators, it is
4173 O(N), since the nature of the splay tree will keep the next
4174 element adjacent to the root at all times. */
4176 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
4178 splay_tree_node node
4179 = splay_tree_lookup (cases, (splay_tree_key) TREE_VALUE (chain));
4183 /* Mark the CASE_LOW part of the case entry as seen, so
4184 that we save time later. Choose TREE_ADDRESSABLE
4185 randomly as a bit that won't have been set to-date. */
4186 tree label = (tree) node->value;
4187 TREE_ADDRESSABLE (label) = 1;
4191 /* Warn if there are enumerators that don't correspond to
4192 case expressions. */
4193 warning ("%Henumeration value `%E' not handled in switch",
4194 switch_locus, TREE_PURPOSE (chain));
4198 /* Warn if there are case expressions that don't correspond to
4199 enumerators. This can occur since C and C++ don't enforce
4200 type-checking of assignments to enumeration variables.
4202 The time complexity here is O(N**2) worst case, since we've
4203 not sorted the enumeration values. However, in the absence
4204 of case ranges this is O(N), since all single cases that
4205 corresponded to enumerations have been marked above. */
4207 splay_tree_foreach (cases, match_case_to_enum, type);
4211 /* Finish an expression taking the address of LABEL (an
4212 IDENTIFIER_NODE). Returns an expression for the address. */
4215 finish_label_address_expr (tree label)
4220 pedwarn ("taking the address of a label is non-standard");
4222 if (label == error_mark_node)
4223 return error_mark_node;
4225 label = lookup_label (label);
4226 if (label == NULL_TREE)
4227 result = null_pointer_node;
4230 TREE_USED (label) = 1;
4231 result = build1 (ADDR_EXPR, ptr_type_node, label);
4232 /* The current function in not necessarily uninlinable.
4233 Computed gotos are incompatible with inlining, but the value
4234 here could be used only in a diagnostic, for example. */
4240 /* Hook used by expand_expr to expand language-specific tree codes. */
4241 /* The only things that should go here are bits needed to expand
4242 constant initializers. Everything else should be handled by the
4243 gimplification routines. */
4246 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
4247 int modifier /* Actually enum_modifier. */,
4250 switch (TREE_CODE (exp))
4252 case COMPOUND_LITERAL_EXPR:
4254 /* Initialize the anonymous variable declared in the compound
4255 literal, then return the variable. */
4256 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4257 emit_local_var (decl);
4258 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
4266 /* Hook used by safe_from_p to handle language-specific tree codes. */
4269 c_safe_from_p (rtx target, tree exp)
4271 /* We can see statements here when processing the body of a
4272 statement-expression. For a declaration statement declaring a
4273 variable, look at the variable's initializer. */
4274 if (TREE_CODE (exp) == DECL_STMT)
4276 tree decl = DECL_STMT_DECL (exp);
4278 if (TREE_CODE (decl) == VAR_DECL
4279 && DECL_INITIAL (decl)
4280 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4284 /* For any statement, we must follow the statement-chain. */
4285 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4286 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4288 /* Assume everything else is safe. */
4292 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4295 c_common_unsafe_for_reeval (tree exp)
4297 /* Statement expressions may not be reevaluated, likewise compound
4299 if (TREE_CODE (exp) == STMT_EXPR
4300 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4303 /* Walk all other expressions. */
4307 /* Hook used by staticp to handle language-specific tree codes. */
4310 c_staticp (tree exp)
4312 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4313 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4319 /* Given a boolean expression ARG, return a tree representing an increment
4320 or decrement (as indicated by CODE) of ARG. The front end must check for
4321 invalid cases (e.g., decrement in C++). */
4323 boolean_increment (enum tree_code code, tree arg)
4326 tree true_res = boolean_true_node;
4328 arg = stabilize_reference (arg);
4331 case PREINCREMENT_EXPR:
4332 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4334 case POSTINCREMENT_EXPR:
4335 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4336 arg = save_expr (arg);
4337 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4338 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4340 case PREDECREMENT_EXPR:
4341 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4343 case POSTDECREMENT_EXPR:
4344 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4345 arg = save_expr (arg);
4346 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4347 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4352 TREE_SIDE_EFFECTS (val) = 1;
4356 /* Built-in macros for stddef.h, that require macros defined in this
4359 c_stddef_cpp_builtins(void)
4361 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4362 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4363 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4364 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4368 c_init_attributes (void)
4370 /* Fill in the built_in_attributes array. */
4371 #define DEF_ATTR_NULL_TREE(ENUM) \
4372 built_in_attributes[(int) ENUM] = NULL_TREE;
4373 #define DEF_ATTR_INT(ENUM, VALUE) \
4374 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4375 #define DEF_ATTR_IDENT(ENUM, STRING) \
4376 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4377 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4378 built_in_attributes[(int) ENUM] \
4379 = tree_cons (built_in_attributes[(int) PURPOSE], \
4380 built_in_attributes[(int) VALUE], \
4381 built_in_attributes[(int) CHAIN]);
4382 #include "builtin-attrs.def"
4383 #undef DEF_ATTR_NULL_TREE
4385 #undef DEF_ATTR_IDENT
4386 #undef DEF_ATTR_TREE_LIST
4389 /* Attribute handlers common to C front ends. */
4391 /* Handle a "packed" attribute; arguments as in
4392 struct attribute_spec.handler. */
4395 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4396 int flags, bool *no_add_attrs)
4400 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4401 *node = build_type_copy (*node);
4402 TYPE_PACKED (*node) = 1;
4403 if (TYPE_MAIN_VARIANT (*node) == *node)
4405 /* If it is the main variant, then pack the other variants
4406 too. This happens in,
4409 struct Foo const *ptr; // creates a variant w/o packed flag
4410 } __ attribute__((packed)); // packs it now.
4414 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4415 TYPE_PACKED (probe) = 1;
4419 else if (TREE_CODE (*node) == FIELD_DECL)
4420 DECL_PACKED (*node) = 1;
4421 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4422 used for DECL_REGISTER. It wouldn't mean anything anyway.
4423 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4424 that changes what the typedef is typing. */
4427 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4428 *no_add_attrs = true;
4434 /* Handle a "nocommon" attribute; arguments as in
4435 struct attribute_spec.handler. */
4438 handle_nocommon_attribute (tree *node, tree name,
4439 tree args ATTRIBUTE_UNUSED,
4440 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4442 if (TREE_CODE (*node) == VAR_DECL)
4443 DECL_COMMON (*node) = 0;
4446 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4447 *no_add_attrs = true;
4453 /* Handle a "common" attribute; arguments as in
4454 struct attribute_spec.handler. */
4457 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4458 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4460 if (TREE_CODE (*node) == VAR_DECL)
4461 DECL_COMMON (*node) = 1;
4464 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4465 *no_add_attrs = true;
4471 /* Handle a "noreturn" attribute; arguments as in
4472 struct attribute_spec.handler. */
4475 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4476 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4478 tree type = TREE_TYPE (*node);
4480 /* See FIXME comment in c_common_attribute_table. */
4481 if (TREE_CODE (*node) == FUNCTION_DECL)
4482 TREE_THIS_VOLATILE (*node) = 1;
4483 else if (TREE_CODE (type) == POINTER_TYPE
4484 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4486 = build_pointer_type
4487 (build_type_variant (TREE_TYPE (type),
4488 TYPE_READONLY (TREE_TYPE (type)), 1));
4491 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4492 *no_add_attrs = true;
4498 /* Handle a "noinline" attribute; arguments as in
4499 struct attribute_spec.handler. */
4502 handle_noinline_attribute (tree *node, tree name,
4503 tree args ATTRIBUTE_UNUSED,
4504 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4506 if (TREE_CODE (*node) == FUNCTION_DECL)
4507 DECL_UNINLINABLE (*node) = 1;
4510 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4511 *no_add_attrs = true;
4517 /* Handle a "always_inline" attribute; arguments as in
4518 struct attribute_spec.handler. */
4521 handle_always_inline_attribute (tree *node, tree name,
4522 tree args ATTRIBUTE_UNUSED,
4523 int flags ATTRIBUTE_UNUSED,
4526 if (TREE_CODE (*node) == FUNCTION_DECL)
4528 /* Do nothing else, just set the attribute. We'll get at
4529 it later with lookup_attribute. */
4533 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4534 *no_add_attrs = true;
4540 /* Handle a "used" attribute; arguments as in
4541 struct attribute_spec.handler. */
4544 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4545 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4549 if (TREE_CODE (node) == FUNCTION_DECL
4550 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4552 TREE_USED (node) = 1;
4556 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4557 *no_add_attrs = true;
4563 /* Handle a "unused" attribute; arguments as in
4564 struct attribute_spec.handler. */
4567 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4568 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4574 if (TREE_CODE (decl) == PARM_DECL
4575 || TREE_CODE (decl) == VAR_DECL
4576 || TREE_CODE (decl) == FUNCTION_DECL
4577 || TREE_CODE (decl) == LABEL_DECL
4578 || TREE_CODE (decl) == TYPE_DECL)
4579 TREE_USED (decl) = 1;
4582 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4583 *no_add_attrs = true;
4588 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4589 *node = build_type_copy (*node);
4590 TREE_USED (*node) = 1;
4596 /* Handle a "const" attribute; arguments as in
4597 struct attribute_spec.handler. */
4600 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4601 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4603 tree type = TREE_TYPE (*node);
4605 /* See FIXME comment on noreturn in c_common_attribute_table. */
4606 if (TREE_CODE (*node) == FUNCTION_DECL)
4607 TREE_READONLY (*node) = 1;
4608 else if (TREE_CODE (type) == POINTER_TYPE
4609 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4611 = build_pointer_type
4612 (build_type_variant (TREE_TYPE (type), 1,
4613 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4616 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4617 *no_add_attrs = true;
4623 /* Handle a "transparent_union" attribute; arguments as in
4624 struct attribute_spec.handler. */
4627 handle_transparent_union_attribute (tree *node, tree name,
4628 tree args ATTRIBUTE_UNUSED, int flags,
4631 tree decl = NULL_TREE;
4638 type = &TREE_TYPE (decl);
4639 is_type = TREE_CODE (*node) == TYPE_DECL;
4641 else if (TYPE_P (*node))
4642 type = node, is_type = 1;
4645 && TREE_CODE (*type) == UNION_TYPE
4647 || (TYPE_FIELDS (*type) != 0
4648 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4650 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4651 *type = build_type_copy (*type);
4652 TYPE_TRANSPARENT_UNION (*type) = 1;
4654 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4655 && TREE_CODE (*type) == UNION_TYPE
4656 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4657 DECL_TRANSPARENT_UNION (decl) = 1;
4660 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4661 *no_add_attrs = true;
4667 /* Handle a "constructor" attribute; arguments as in
4668 struct attribute_spec.handler. */
4671 handle_constructor_attribute (tree *node, tree name,
4672 tree args ATTRIBUTE_UNUSED,
4673 int flags ATTRIBUTE_UNUSED,
4677 tree type = TREE_TYPE (decl);
4679 if (TREE_CODE (decl) == FUNCTION_DECL
4680 && TREE_CODE (type) == FUNCTION_TYPE
4681 && decl_function_context (decl) == 0)
4683 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4684 TREE_USED (decl) = 1;
4688 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4689 *no_add_attrs = true;
4695 /* Handle a "destructor" attribute; arguments as in
4696 struct attribute_spec.handler. */
4699 handle_destructor_attribute (tree *node, tree name,
4700 tree args ATTRIBUTE_UNUSED,
4701 int flags ATTRIBUTE_UNUSED,
4705 tree type = TREE_TYPE (decl);
4707 if (TREE_CODE (decl) == FUNCTION_DECL
4708 && TREE_CODE (type) == FUNCTION_TYPE
4709 && decl_function_context (decl) == 0)
4711 DECL_STATIC_DESTRUCTOR (decl) = 1;
4712 TREE_USED (decl) = 1;
4716 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4717 *no_add_attrs = true;
4723 /* Handle a "mode" attribute; arguments as in
4724 struct attribute_spec.handler. */
4727 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4728 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4732 *no_add_attrs = true;
4734 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4735 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4739 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4740 int len = strlen (p);
4741 enum machine_mode mode = VOIDmode;
4745 if (len > 4 && p[0] == '_' && p[1] == '_'
4746 && p[len - 1] == '_' && p[len - 2] == '_')
4748 char *newp = alloca (len - 1);
4750 strcpy (newp, &p[2]);
4751 newp[len - 4] = '\0';
4755 /* Change this type to have a type with the specified mode.
4756 First check for the special modes. */
4757 if (! strcmp (p, "byte"))
4759 else if (!strcmp (p, "word"))
4761 else if (! strcmp (p, "pointer"))
4764 for (j = 0; j < NUM_MACHINE_MODES; j++)
4765 if (!strcmp (p, GET_MODE_NAME (j)))
4766 mode = (enum machine_mode) j;
4768 if (mode == VOIDmode)
4770 error ("unknown machine mode `%s'", p);
4774 if (VECTOR_MODE_P (mode))
4776 warning ("specifying vector types with __attribute__ ((mode)) "
4778 warning ("use __attribute__ ((vector_size)) instead");
4781 typefm = lang_hooks.types.type_for_mode (mode, TYPE_UNSIGNED (type));
4782 if (typefm == NULL_TREE)
4783 error ("no data type for mode `%s'", p);
4785 else if ((TREE_CODE (type) == POINTER_TYPE
4786 || TREE_CODE (type) == REFERENCE_TYPE)
4787 && !targetm.valid_pointer_mode (mode))
4788 error ("invalid pointer mode `%s'", p);
4791 /* If this is a vector, make sure we either have hardware
4792 support, or we can emulate it. */
4793 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4795 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4799 if (TREE_CODE (type) == POINTER_TYPE)
4801 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4805 else if (TREE_CODE (type) == REFERENCE_TYPE)
4807 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4813 /* No need to layout the type here. The caller should do this. */
4820 /* Handle a "section" attribute; arguments as in
4821 struct attribute_spec.handler. */
4824 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4825 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4829 if (targetm.have_named_sections)
4831 if ((TREE_CODE (decl) == FUNCTION_DECL
4832 || TREE_CODE (decl) == VAR_DECL)
4833 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4835 if (TREE_CODE (decl) == VAR_DECL
4836 && current_function_decl != NULL_TREE
4837 && ! TREE_STATIC (decl))
4839 error ("%Jsection attribute cannot be specified for "
4840 "local variables", decl);
4841 *no_add_attrs = true;
4844 /* The decl may have already been given a section attribute
4845 from a previous declaration. Ensure they match. */
4846 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4847 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4848 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4850 error ("%Jsection of '%D' conflicts with previous declaration",
4852 *no_add_attrs = true;
4855 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4859 error ("%Jsection attribute not allowed for '%D'", *node, *node);
4860 *no_add_attrs = true;
4865 error ("%Jsection attributes are not supported for this target", *node);
4866 *no_add_attrs = true;
4872 /* Handle a "aligned" attribute; arguments as in
4873 struct attribute_spec.handler. */
4876 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4877 int flags, bool *no_add_attrs)
4879 tree decl = NULL_TREE;
4882 tree align_expr = (args ? TREE_VALUE (args)
4883 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4889 type = &TREE_TYPE (decl);
4890 is_type = TREE_CODE (*node) == TYPE_DECL;
4892 else if (TYPE_P (*node))
4893 type = node, is_type = 1;
4895 /* Strip any NOPs of any kind. */
4896 while (TREE_CODE (align_expr) == NOP_EXPR
4897 || TREE_CODE (align_expr) == CONVERT_EXPR
4898 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4899 align_expr = TREE_OPERAND (align_expr, 0);
4901 if (TREE_CODE (align_expr) != INTEGER_CST)
4903 error ("requested alignment is not a constant");
4904 *no_add_attrs = true;
4906 else if ((i = tree_log2 (align_expr)) == -1)
4908 error ("requested alignment is not a power of 2");
4909 *no_add_attrs = true;
4911 else if (i > HOST_BITS_PER_INT - 2)
4913 error ("requested alignment is too large");
4914 *no_add_attrs = true;
4918 /* If we have a TYPE_DECL, then copy the type, so that we
4919 don't accidentally modify a builtin type. See pushdecl. */
4920 if (decl && TREE_TYPE (decl) != error_mark_node
4921 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4923 tree tt = TREE_TYPE (decl);
4924 *type = build_type_copy (*type);
4925 DECL_ORIGINAL_TYPE (decl) = tt;
4926 TYPE_NAME (*type) = decl;
4927 TREE_USED (*type) = TREE_USED (decl);
4928 TREE_TYPE (decl) = *type;
4930 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4931 *type = build_type_copy (*type);
4933 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4934 TYPE_USER_ALIGN (*type) = 1;
4936 else if (TREE_CODE (decl) != VAR_DECL
4937 && TREE_CODE (decl) != FIELD_DECL)
4939 error ("%Jalignment may not be specified for '%D'", decl, decl);
4940 *no_add_attrs = true;
4944 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4945 DECL_USER_ALIGN (decl) = 1;
4951 /* Handle a "weak" attribute; arguments as in
4952 struct attribute_spec.handler. */
4955 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4956 tree args ATTRIBUTE_UNUSED,
4957 int flags ATTRIBUTE_UNUSED,
4958 bool *no_add_attrs ATTRIBUTE_UNUSED)
4960 declare_weak (*node);
4965 /* Handle an "alias" attribute; arguments as in
4966 struct attribute_spec.handler. */
4969 handle_alias_attribute (tree *node, tree name, tree args,
4970 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4974 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4975 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4977 error ("%J'%D' defined both normally and as an alias", decl, decl);
4978 *no_add_attrs = true;
4981 /* Note that the very first time we process a nested declaration,
4982 decl_function_context will not be set. Indeed, *would* never
4983 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4984 we do below. After such frobbery, pushdecl would set the context.
4985 In any case, this is never what we want. */
4986 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
4990 id = TREE_VALUE (args);
4991 if (TREE_CODE (id) != STRING_CST)
4993 error ("alias arg not a string");
4994 *no_add_attrs = true;
4997 id = get_identifier (TREE_STRING_POINTER (id));
4998 /* This counts as a use of the object pointed to. */
5001 if (TREE_CODE (decl) == FUNCTION_DECL)
5002 DECL_INITIAL (decl) = error_mark_node;
5005 DECL_EXTERNAL (decl) = 0;
5006 TREE_STATIC (decl) = 1;
5011 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5012 *no_add_attrs = true;
5018 /* Handle an "visibility" attribute; arguments as in
5019 struct attribute_spec.handler. */
5022 handle_visibility_attribute (tree *node, tree name, tree args,
5023 int flags ATTRIBUTE_UNUSED,
5027 tree id = TREE_VALUE (args);
5029 *no_add_attrs = true;
5031 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
5033 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5037 if (TREE_CODE (id) != STRING_CST)
5039 error ("visibility arg not a string");
5043 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
5044 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5045 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
5046 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
5047 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
5048 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
5049 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
5050 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
5052 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5057 /* Handle an "tls_model" attribute; arguments as in
5058 struct attribute_spec.handler. */
5061 handle_tls_model_attribute (tree *node, tree name, tree args,
5062 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5066 if (! DECL_THREAD_LOCAL (decl))
5068 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5069 *no_add_attrs = true;
5075 id = TREE_VALUE (args);
5076 if (TREE_CODE (id) != STRING_CST)
5078 error ("tls_model arg not a string");
5079 *no_add_attrs = true;
5082 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
5083 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
5084 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
5085 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
5087 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5088 *no_add_attrs = true;
5096 /* Handle a "no_instrument_function" attribute; arguments as in
5097 struct attribute_spec.handler. */
5100 handle_no_instrument_function_attribute (tree *node, tree name,
5101 tree args ATTRIBUTE_UNUSED,
5102 int flags ATTRIBUTE_UNUSED,
5107 if (TREE_CODE (decl) != FUNCTION_DECL)
5109 error ("%J'%E' attribute applies only to functions", decl, name);
5110 *no_add_attrs = true;
5112 else if (DECL_INITIAL (decl))
5114 error ("%Jcan't set '%E' attribute after definition", decl, name);
5115 *no_add_attrs = true;
5118 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5123 /* Handle a "malloc" attribute; arguments as in
5124 struct attribute_spec.handler. */
5127 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5128 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5130 if (TREE_CODE (*node) == FUNCTION_DECL)
5131 DECL_IS_MALLOC (*node) = 1;
5132 /* ??? TODO: Support types. */
5135 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5136 *no_add_attrs = true;
5142 /* Handle a "no_limit_stack" attribute; arguments as in
5143 struct attribute_spec.handler. */
5146 handle_no_limit_stack_attribute (tree *node, tree name,
5147 tree args ATTRIBUTE_UNUSED,
5148 int flags ATTRIBUTE_UNUSED,
5153 if (TREE_CODE (decl) != FUNCTION_DECL)
5155 error ("%J'%E' attribute applies only to functions", decl, name);
5156 *no_add_attrs = true;
5158 else if (DECL_INITIAL (decl))
5160 error ("%Jcan't set '%E' attribute after definition", decl, name);
5161 *no_add_attrs = true;
5164 DECL_NO_LIMIT_STACK (decl) = 1;
5169 /* Handle a "pure" attribute; arguments as in
5170 struct attribute_spec.handler. */
5173 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5174 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5176 if (TREE_CODE (*node) == FUNCTION_DECL)
5177 DECL_IS_PURE (*node) = 1;
5178 /* ??? TODO: Support types. */
5181 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5182 *no_add_attrs = true;
5188 /* Handle a "deprecated" attribute; arguments as in
5189 struct attribute_spec.handler. */
5192 handle_deprecated_attribute (tree *node, tree name,
5193 tree args ATTRIBUTE_UNUSED, int flags,
5196 tree type = NULL_TREE;
5198 const char *what = NULL;
5203 type = TREE_TYPE (decl);
5205 if (TREE_CODE (decl) == TYPE_DECL
5206 || TREE_CODE (decl) == PARM_DECL
5207 || TREE_CODE (decl) == VAR_DECL
5208 || TREE_CODE (decl) == FUNCTION_DECL
5209 || TREE_CODE (decl) == FIELD_DECL)
5210 TREE_DEPRECATED (decl) = 1;
5214 else if (TYPE_P (*node))
5216 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5217 *node = build_type_copy (*node);
5218 TREE_DEPRECATED (*node) = 1;
5226 *no_add_attrs = true;
5227 if (type && TYPE_NAME (type))
5229 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5230 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5231 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5232 && DECL_NAME (TYPE_NAME (type)))
5233 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5236 warning ("`%s' attribute ignored for `%s'",
5237 IDENTIFIER_POINTER (name), what);
5239 warning ("`%s' attribute ignored",
5240 IDENTIFIER_POINTER (name));
5246 /* Handle a "vector_size" attribute; arguments as in
5247 struct attribute_spec.handler. */
5250 handle_vector_size_attribute (tree *node, tree name, tree args,
5251 int flags ATTRIBUTE_UNUSED,
5254 unsigned HOST_WIDE_INT vecsize, nunits;
5255 enum machine_mode mode, orig_mode, new_mode;
5256 tree type = *node, new_type, size;
5258 *no_add_attrs = true;
5260 /* Stripping NON_LVALUE_EXPR allows declarations such as
5261 typedef short v4si __attribute__((vector_size (4 * sizeof(short)))). */
5262 size = TREE_VALUE (args);
5263 if (TREE_CODE (size) == NON_LVALUE_EXPR)
5264 size = TREE_OPERAND (size, 0);
5266 if (! host_integerp (size, 1))
5268 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5272 /* Get the vector size (in bytes). */
5273 vecsize = tree_low_cst (size, 1);
5275 /* We need to provide for vector pointers, vector arrays, and
5276 functions returning vectors. For example:
5278 __attribute__((vector_size(16))) short *foo;
5280 In this case, the mode is SI, but the type being modified is
5281 HI, so we need to look further. */
5283 while (POINTER_TYPE_P (type)
5284 || TREE_CODE (type) == FUNCTION_TYPE
5285 || TREE_CODE (type) == METHOD_TYPE
5286 || TREE_CODE (type) == ARRAY_TYPE)
5287 type = TREE_TYPE (type);
5289 /* Get the mode of the type being modified. */
5290 orig_mode = TYPE_MODE (type);
5292 if (TREE_CODE (type) == RECORD_TYPE
5293 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5294 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5295 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5297 error ("invalid vector type for attribute `%s'",
5298 IDENTIFIER_POINTER (name));
5302 /* Calculate how many units fit in the vector. */
5303 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5305 /* Find a suitably sized vector. */
5306 new_mode = VOIDmode;
5307 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5309 : MODE_VECTOR_FLOAT);
5311 mode = GET_MODE_WIDER_MODE (mode))
5312 if (vecsize == GET_MODE_SIZE (mode)
5313 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5319 if (new_mode == VOIDmode)
5321 error ("no vector mode with the size and type specified could be found");
5325 new_type = build_vector_type_for_mode (type, new_mode);
5327 /* Build back pointers if needed. */
5328 *node = reconstruct_complex_type (*node, new_type);
5333 /* Handle the "nonnull" attribute. */
5335 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5336 tree args, int flags ATTRIBUTE_UNUSED,
5340 unsigned HOST_WIDE_INT attr_arg_num;
5342 /* If no arguments are specified, all pointer arguments should be
5343 non-null. Verify a full prototype is given so that the arguments
5344 will have the correct types when we actually check them later. */
5347 if (! TYPE_ARG_TYPES (type))
5349 error ("nonnull attribute without arguments on a non-prototype");
5350 *no_add_attrs = true;
5355 /* Argument list specified. Verify that each argument number references
5356 a pointer argument. */
5357 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5360 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
5362 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5364 error ("nonnull argument has invalid operand number (arg %lu)",
5365 (unsigned long) attr_arg_num);
5366 *no_add_attrs = true;
5370 argument = TYPE_ARG_TYPES (type);
5373 for (ck_num = 1; ; ck_num++)
5375 if (! argument || ck_num == arg_num)
5377 argument = TREE_CHAIN (argument);
5381 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5383 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5384 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5385 *no_add_attrs = true;
5389 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5391 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5392 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5393 *no_add_attrs = true;
5402 /* Check the argument list of a function call for null in argument slots
5403 that are marked as requiring a non-null pointer argument. */
5406 check_function_nonnull (tree attrs, tree params)
5408 tree a, args, param;
5411 for (a = attrs; a; a = TREE_CHAIN (a))
5413 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5415 args = TREE_VALUE (a);
5417 /* Walk the argument list. If we encounter an argument number we
5418 should check for non-null, do it. If the attribute has no args,
5419 then every pointer argument is checked (in which case the check
5420 for pointer type is done in check_nonnull_arg). */
5421 for (param = params, param_num = 1; ;
5422 param_num++, param = TREE_CHAIN (param))
5426 if (! args || nonnull_check_p (args, param_num))
5427 check_function_arguments_recurse (check_nonnull_arg, NULL,
5435 /* Helper for check_function_nonnull; given a list of operands which
5436 must be non-null in ARGS, determine if operand PARAM_NUM should be
5440 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5442 unsigned HOST_WIDE_INT arg_num = 0;
5444 for (; args; args = TREE_CHAIN (args))
5446 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5449 if (arg_num == param_num)
5455 /* Check that the function argument PARAM (which is operand number
5456 PARAM_NUM) is non-null. This is called by check_function_nonnull
5457 via check_function_arguments_recurse. */
5460 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5461 unsigned HOST_WIDE_INT param_num)
5463 /* Just skip checking the argument if it's not a pointer. This can
5464 happen if the "nonnull" attribute was given without an operand
5465 list (which means to check every pointer argument). */
5467 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5470 if (integer_zerop (param))
5471 warning ("null argument where non-null required (arg %lu)",
5472 (unsigned long) param_num);
5475 /* Helper for nonnull attribute handling; fetch the operand number
5476 from the attribute argument list. */
5479 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5481 /* Strip any conversions from the arg number and verify they
5483 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5484 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5485 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5486 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5488 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5489 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5492 *valp = TREE_INT_CST_LOW (arg_num_expr);
5496 /* Handle a "nothrow" attribute; arguments as in
5497 struct attribute_spec.handler. */
5500 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5501 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5503 if (TREE_CODE (*node) == FUNCTION_DECL)
5504 TREE_NOTHROW (*node) = 1;
5505 /* ??? TODO: Support types. */
5508 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5509 *no_add_attrs = true;
5515 /* Handle a "cleanup" attribute; arguments as in
5516 struct attribute_spec.handler. */
5519 handle_cleanup_attribute (tree *node, tree name, tree args,
5520 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5523 tree cleanup_id, cleanup_decl;
5525 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5526 for global destructors in C++. This requires infrastructure that
5527 we don't have generically at the moment. It's also not a feature
5528 we'd be missing too much, since we do have attribute constructor. */
5529 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5531 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5532 *no_add_attrs = true;
5536 /* Verify that the argument is a function in scope. */
5537 /* ??? We could support pointers to functions here as well, if
5538 that was considered desirable. */
5539 cleanup_id = TREE_VALUE (args);
5540 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5542 error ("cleanup arg not an identifier");
5543 *no_add_attrs = true;
5546 cleanup_decl = lookup_name (cleanup_id);
5547 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5549 error ("cleanup arg not a function");
5550 *no_add_attrs = true;
5554 /* That the function has proper type is checked with the
5555 eventual call to build_function_call. */
5560 /* Handle a "warn_unused_result" attribute. No special handling. */
5563 handle_warn_unused_result_attribute (tree *node, tree name,
5564 tree args ATTRIBUTE_UNUSED,
5565 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5567 /* Ignore the attribute for functions not returning any value. */
5568 if (VOID_TYPE_P (TREE_TYPE (*node)))
5570 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5571 *no_add_attrs = true;
5577 /* Check for valid arguments being passed to a function. */
5579 check_function_arguments (tree attrs, tree params)
5581 /* Check for null being passed in a pointer argument that must be
5582 non-null. We also need to do this if format checking is enabled. */
5585 check_function_nonnull (attrs, params);
5587 /* Check for errors in format strings. */
5590 check_function_format (NULL, attrs, params);
5593 /* Generic argument checking recursion routine. PARAM is the argument to
5594 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5595 once the argument is resolved. CTX is context for the callback. */
5597 check_function_arguments_recurse (void (*callback)
5598 (void *, tree, unsigned HOST_WIDE_INT),
5599 void *ctx, tree param,
5600 unsigned HOST_WIDE_INT param_num)
5602 if (TREE_CODE (param) == NOP_EXPR)
5604 /* Strip coercion. */
5605 check_function_arguments_recurse (callback, ctx,
5606 TREE_OPERAND (param, 0), param_num);
5610 if (TREE_CODE (param) == CALL_EXPR)
5612 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5614 bool found_format_arg = false;
5616 /* See if this is a call to a known internationalization function
5617 that modifies a format arg. Such a function may have multiple
5618 format_arg attributes (for example, ngettext). */
5620 for (attrs = TYPE_ATTRIBUTES (type);
5622 attrs = TREE_CHAIN (attrs))
5623 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5626 tree format_num_expr;
5630 /* Extract the argument number, which was previously checked
5632 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5633 while (TREE_CODE (format_num_expr) == NOP_EXPR
5634 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5635 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5636 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5638 if (TREE_CODE (format_num_expr) != INTEGER_CST
5639 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5642 format_num = TREE_INT_CST_LOW (format_num_expr);
5644 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5646 inner_args = TREE_CHAIN (inner_args), i++)
5647 if (i == format_num)
5649 check_function_arguments_recurse (callback, ctx,
5650 TREE_VALUE (inner_args),
5652 found_format_arg = true;
5657 /* If we found a format_arg attribute and did a recursive check,
5658 we are done with checking this argument. Otherwise, we continue
5659 and this will be considered a non-literal. */
5660 if (found_format_arg)
5664 if (TREE_CODE (param) == COND_EXPR)
5666 /* Check both halves of the conditional expression. */
5667 check_function_arguments_recurse (callback, ctx,
5668 TREE_OPERAND (param, 1), param_num);
5669 check_function_arguments_recurse (callback, ctx,
5670 TREE_OPERAND (param, 2), param_num);
5674 (*callback) (ctx, param, param_num);
5677 /* C implementation of lang_hooks.tree_inlining.walk_subtrees. Tracks the
5678 locus from EXPR_LOCUS and handles DECL_STMT specially. */
5681 c_walk_subtrees (tree *tp, int *walk_subtrees_p ATTRIBUTE_UNUSED,
5682 walk_tree_fn func, void *data, void *htab)
5684 enum tree_code code = TREE_CODE (*tp);
5685 location_t save_locus;
5688 #define WALK_SUBTREE(NODE) \
5691 result = walk_tree (&(NODE), func, data, htab); \
5692 if (result) goto out; \
5696 if (code != DECL_STMT)
5699 /* Set input_location here so we get the right instantiation context
5700 if we call instantiate_decl from inlinable_function_p. */
5701 save_locus = input_location;
5702 if (EXPR_LOCUS (*tp))
5703 input_location = *EXPR_LOCUS (*tp);
5705 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
5706 into declarations that are just mentioned, rather than
5707 declared; they don't really belong to this part of the tree.
5708 And, we can see cycles: the initializer for a declaration can
5709 refer to the declaration itself. */
5710 WALK_SUBTREE (DECL_INITIAL (DECL_STMT_DECL (*tp)));
5711 WALK_SUBTREE (DECL_SIZE (DECL_STMT_DECL (*tp)));
5712 WALK_SUBTREE (DECL_SIZE_UNIT (DECL_STMT_DECL (*tp)));
5713 WALK_SUBTREE (TREE_CHAIN (*tp));
5714 *walk_subtrees_p = 0;
5716 /* We didn't find what we were looking for. */
5718 input_location = save_locus;
5724 /* C implementation of lang_hooks.tree_inlining.tree_chain_matters_p.
5725 Apart from TREE_LISTs, the only trees whose TREE_CHAIN we care about are
5729 c_tree_chain_matters_p (tree t)
5731 /* For statements, we also walk the chain so that we cover the
5732 entire statement tree. */
5733 return STATEMENT_CODE_P (TREE_CODE (t));
5736 /* Function to help qsort sort FIELD_DECLs by name order. */
5739 field_decl_cmp (const void *x_p, const void *y_p)
5741 const tree *const x = x_p;
5742 const tree *const y = y_p;
5743 if (DECL_NAME (*x) == DECL_NAME (*y))
5744 /* A nontype is "greater" than a type. */
5745 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5746 if (DECL_NAME (*x) == NULL_TREE)
5748 if (DECL_NAME (*y) == NULL_TREE)
5750 if (DECL_NAME (*x) < DECL_NAME (*y))
5756 gt_pointer_operator new_value;
5760 /* This routine compares two fields like field_decl_cmp but using the
5761 pointer operator in resort_data. */
5764 resort_field_decl_cmp (const void *x_p, const void *y_p)
5766 const tree *const x = x_p;
5767 const tree *const y = y_p;
5769 if (DECL_NAME (*x) == DECL_NAME (*y))
5770 /* A nontype is "greater" than a type. */
5771 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5772 if (DECL_NAME (*x) == NULL_TREE)
5774 if (DECL_NAME (*y) == NULL_TREE)
5777 tree d1 = DECL_NAME (*x);
5778 tree d2 = DECL_NAME (*y);
5779 resort_data.new_value (&d1, resort_data.cookie);
5780 resort_data.new_value (&d2, resort_data.cookie);
5787 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5790 resort_sorted_fields (void *obj,
5791 void *orig_obj ATTRIBUTE_UNUSED ,
5792 gt_pointer_operator new_value,
5795 struct sorted_fields_type *sf = obj;
5796 resort_data.new_value = new_value;
5797 resort_data.cookie = cookie;
5798 qsort (&sf->elts[0], sf->len, sizeof (tree),
5799 resort_field_decl_cmp);
5802 /* Issue the error given by MSGID, indicating that it occurred before
5803 TOKEN, which had the associated VALUE. */
5806 c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5808 const char *string = _(msgid);
5810 if (token == CPP_EOF)
5811 error ("%s at end of input", string);
5812 else if (token == CPP_CHAR || token == CPP_WCHAR)
5814 unsigned int val = TREE_INT_CST_LOW (value);
5815 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5816 if (val <= UCHAR_MAX && ISGRAPH (val))
5817 error ("%s before %s'%c'", string, ell, val);
5819 error ("%s before %s'\\x%x'", string, ell, val);
5821 else if (token == CPP_STRING
5822 || token == CPP_WSTRING)
5823 error ("%s before string constant", string);
5824 else if (token == CPP_NUMBER)
5825 error ("%s before numeric constant", string);
5826 else if (token == CPP_NAME)
5827 error ("%s before \"%s\"", string, IDENTIFIER_POINTER (value));
5828 else if (token < N_TTYPES)
5829 error ("%s before '%s' token", string, cpp_type2name (token));
5831 error ("%s", string);
5834 /* Walk a gimplified function and warn for functions whose return value is
5835 ignored and attribute((warn_unused_result)) is set. This is done before
5836 inlining, so we don't have to worry about that. */
5839 c_warn_unused_result (tree *top_p)
5842 tree_stmt_iterator i;
5845 switch (TREE_CODE (t))
5847 case STATEMENT_LIST:
5848 for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i))
5849 c_warn_unused_result (tsi_stmt_ptr (i));
5853 c_warn_unused_result (&COND_EXPR_THEN (t));
5854 c_warn_unused_result (&COND_EXPR_ELSE (t));
5857 c_warn_unused_result (&BIND_EXPR_BODY (t));
5859 case TRY_FINALLY_EXPR:
5860 case TRY_CATCH_EXPR:
5861 c_warn_unused_result (&TREE_OPERAND (t, 0));
5862 c_warn_unused_result (&TREE_OPERAND (t, 1));
5865 c_warn_unused_result (&CATCH_BODY (t));
5867 case EH_FILTER_EXPR:
5868 c_warn_unused_result (&EH_FILTER_FAILURE (t));
5872 /* This is a naked call, as opposed to a CALL_EXPR nested inside
5873 a MODIFY_EXPR. All calls whose value is ignored should be
5874 represented like this. Look for the attribute. */
5875 fdecl = get_callee_fndecl (t);
5877 ftype = TREE_TYPE (fdecl);
5880 ftype = TREE_TYPE (TREE_OPERAND (t, 0));
5881 /* Look past pointer-to-function to the function type itself. */
5882 ftype = TREE_TYPE (ftype);
5885 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
5888 warning ("%Hignoring return value of `%D', "
5889 "declared with attribute warn_unused_result",
5890 EXPR_LOCUS (t), fdecl);
5892 warning ("%Hignoring return value of function "
5893 "declared with attribute warn_unused_result",
5899 /* Not a container, not a call, or a call whose value is used. */
5904 #include "gt-c-common.h"