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;
1122 namep = xmalloc (strlen (name) + 1);
1123 namep = xstrdup (name);
1129 /* Return the VAR_DECL for a const char array naming the current
1130 function. If the VAR_DECL has not yet been created, create it
1131 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1132 ID is its name (unfortunately C and C++ hold the RID values of
1133 keywords in different places, so we can't derive RID from ID in
1134 this language independent code. */
1137 fname_decl (unsigned int rid, tree id)
1140 tree decl = NULL_TREE;
1142 for (ix = 0; fname_vars[ix].decl; ix++)
1143 if (fname_vars[ix].rid == rid)
1146 decl = *fname_vars[ix].decl;
1149 tree saved_last_tree = last_tree;
1150 /* If a tree is built here, it would normally have the lineno of
1151 the current statement. Later this tree will be moved to the
1152 beginning of the function and this line number will be wrong.
1153 To avoid this problem set the lineno to 0 here; that prevents
1154 it from appearing in the RTL. */
1155 int saved_lineno = input_line;
1158 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1159 if (last_tree != saved_last_tree)
1161 /* We created some statement tree for the decl. This belongs
1162 at the start of the function, so remove it now and reinsert
1163 it after the function is complete. */
1164 tree stmts = TREE_CHAIN (saved_last_tree);
1166 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1167 last_tree = saved_last_tree;
1168 saved_function_name_decls = tree_cons (decl, stmts,
1169 saved_function_name_decls);
1171 *fname_vars[ix].decl = decl;
1172 input_line = saved_lineno;
1174 if (!ix && !current_function_decl)
1175 pedwarn ("%J'%D' is not defined outside of function scope", decl, decl);
1180 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1183 fix_string_type (tree value)
1185 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1186 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1187 const int nchars_max = flag_isoc99 ? 4095 : 509;
1188 int length = TREE_STRING_LENGTH (value);
1191 /* Compute the number of elements, for the array type. */
1192 nchars = wide_flag ? length / wchar_bytes : length;
1194 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1195 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1196 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1198 /* Create the array type for the string constant.
1199 -Wwrite-strings says make the string constant an array of const char
1200 so that copying it to a non-const pointer will get a warning.
1201 For C++, this is the standard behavior. */
1202 if (flag_const_strings)
1205 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1208 = build_array_type (elements,
1209 build_index_type (build_int_2 (nchars - 1, 0)));
1213 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1214 build_index_type (build_int_2 (nchars - 1, 0)));
1216 TREE_CONSTANT (value) = 1;
1217 TREE_INVARIANT (value) = 1;
1218 TREE_READONLY (value) = 1;
1219 TREE_STATIC (value) = 1;
1223 /* Print a warning if a constant expression had overflow in folding.
1224 Invoke this function on every expression that the language
1225 requires to be a constant expression.
1226 Note the ANSI C standard says it is erroneous for a
1227 constant expression to overflow. */
1230 constant_expression_warning (tree value)
1232 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1233 || TREE_CODE (value) == VECTOR_CST
1234 || TREE_CODE (value) == COMPLEX_CST)
1235 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1236 pedwarn ("overflow in constant expression");
1239 /* Print a warning if an expression had overflow in folding.
1240 Invoke this function on every expression that
1241 (1) appears in the source code, and
1242 (2) might be a constant expression that overflowed, and
1243 (3) is not already checked by convert_and_check;
1244 however, do not invoke this function on operands of explicit casts. */
1247 overflow_warning (tree value)
1249 if ((TREE_CODE (value) == INTEGER_CST
1250 || (TREE_CODE (value) == COMPLEX_CST
1251 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1252 && TREE_OVERFLOW (value))
1254 TREE_OVERFLOW (value) = 0;
1255 if (skip_evaluation == 0)
1256 warning ("integer overflow in expression");
1258 else if ((TREE_CODE (value) == REAL_CST
1259 || (TREE_CODE (value) == COMPLEX_CST
1260 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1261 && TREE_OVERFLOW (value))
1263 TREE_OVERFLOW (value) = 0;
1264 if (skip_evaluation == 0)
1265 warning ("floating point overflow in expression");
1267 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1269 TREE_OVERFLOW (value) = 0;
1270 if (skip_evaluation == 0)
1271 warning ("vector overflow in expression");
1275 /* Print a warning if a large constant is truncated to unsigned,
1276 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1277 Invoke this function on every expression that might be implicitly
1278 converted to an unsigned type. */
1281 unsigned_conversion_warning (tree result, tree operand)
1283 tree type = TREE_TYPE (result);
1285 if (TREE_CODE (operand) == INTEGER_CST
1286 && TREE_CODE (type) == INTEGER_TYPE
1287 && TYPE_UNSIGNED (type)
1288 && skip_evaluation == 0
1289 && !int_fits_type_p (operand, type))
1291 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1292 /* This detects cases like converting -129 or 256 to unsigned char. */
1293 warning ("large integer implicitly truncated to unsigned type");
1294 else if (warn_conversion)
1295 warning ("negative integer implicitly converted to unsigned type");
1299 /* Nonzero if constant C has a value that is permissible
1300 for type TYPE (an INTEGER_TYPE). */
1303 constant_fits_type_p (tree c, tree type)
1305 if (TREE_CODE (c) == INTEGER_CST)
1306 return int_fits_type_p (c, type);
1308 c = convert (type, c);
1309 return !TREE_OVERFLOW (c);
1312 /* Nonzero if vector types T1 and T2 can be converted to each other
1313 without an explicit cast. */
1315 vector_types_convertible_p (tree t1, tree t2)
1317 return targetm.vector_opaque_p (t1)
1318 || targetm.vector_opaque_p (t2)
1319 || TYPE_MODE (t1) == TYPE_MODE (t2);
1322 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1323 Invoke this function on every expression that is converted implicitly,
1324 i.e. because of language rules and not because of an explicit cast. */
1327 convert_and_check (tree type, tree expr)
1329 tree t = convert (type, expr);
1330 if (TREE_CODE (t) == INTEGER_CST)
1332 if (TREE_OVERFLOW (t))
1334 TREE_OVERFLOW (t) = 0;
1336 /* Do not diagnose overflow in a constant expression merely
1337 because a conversion overflowed. */
1338 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1340 /* No warning for converting 0x80000000 to int. */
1341 if (!(TYPE_UNSIGNED (type) < TYPE_UNSIGNED (TREE_TYPE (expr))
1342 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1343 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1344 /* If EXPR fits in the unsigned version of TYPE,
1345 don't warn unless pedantic. */
1347 || TYPE_UNSIGNED (type)
1348 || ! constant_fits_type_p (expr,
1349 c_common_unsigned_type (type)))
1350 && skip_evaluation == 0)
1351 warning ("overflow in implicit constant conversion");
1354 unsigned_conversion_warning (t, expr);
1359 /* A node in a list that describes references to variables (EXPR), which are
1360 either read accesses if WRITER is zero, or write accesses, in which case
1361 WRITER is the parent of EXPR. */
1368 /* Used to implement a cache the results of a call to verify_tree. We only
1369 use this for SAVE_EXPRs. */
1372 struct tlist_cache *next;
1373 struct tlist *cache_before_sp;
1374 struct tlist *cache_after_sp;
1378 /* Obstack to use when allocating tlist structures, and corresponding
1380 static struct obstack tlist_obstack;
1381 static char *tlist_firstobj = 0;
1383 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1385 static struct tlist *warned_ids;
1386 /* SAVE_EXPRs need special treatment. We process them only once and then
1387 cache the results. */
1388 static struct tlist_cache *save_expr_cache;
1390 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1391 static void merge_tlist (struct tlist **, struct tlist *, int);
1392 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1393 static int warning_candidate_p (tree);
1394 static void warn_for_collisions (struct tlist *);
1395 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1396 static struct tlist *new_tlist (struct tlist *, tree, tree);
1397 static void verify_sequence_points (tree);
1399 /* Create a new struct tlist and fill in its fields. */
1400 static struct tlist *
1401 new_tlist (struct tlist *next, tree t, tree writer)
1404 l = obstack_alloc (&tlist_obstack, sizeof *l);
1411 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1412 is nonnull, we ignore any node we find which has a writer equal to it. */
1415 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1419 struct tlist *next = add->next;
1422 if (! exclude_writer || add->writer != exclude_writer)
1423 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1428 /* Merge the nodes of ADD into TO. This merging process is done so that for
1429 each variable that already exists in TO, no new node is added; however if
1430 there is a write access recorded in ADD, and an occurrence on TO is only
1431 a read access, then the occurrence in TO will be modified to record the
1435 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1437 struct tlist **end = to;
1440 end = &(*end)->next;
1446 struct tlist *next = add->next;
1448 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1449 if (tmp2->expr == add->expr)
1453 tmp2->writer = add->writer;
1457 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1458 end = &(*end)->next;
1465 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1466 references in list LIST conflict with it, excluding reads if ONLY writers
1470 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1475 /* Avoid duplicate warnings. */
1476 for (tmp = warned_ids; tmp; tmp = tmp->next)
1477 if (tmp->expr == written)
1482 if (list->expr == written
1483 && list->writer != writer
1484 && (! only_writes || list->writer))
1486 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1487 warning ("operation on `%s' may be undefined",
1488 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1494 /* Given a list LIST of references to variables, find whether any of these
1495 can cause conflicts due to missing sequence points. */
1498 warn_for_collisions (struct tlist *list)
1502 for (tmp = list; tmp; tmp = tmp->next)
1505 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1509 /* Return nonzero if X is a tree that can be verified by the sequence point
1512 warning_candidate_p (tree x)
1514 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1517 /* Walk the tree X, and record accesses to variables. If X is written by the
1518 parent tree, WRITER is the parent.
1519 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1520 expression or its only operand forces a sequence point, then everything up
1521 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1523 Once we return, we will have emitted warnings if any subexpression before
1524 such a sequence point could be undefined. On a higher level, however, the
1525 sequence point may not be relevant, and we'll merge the two lists.
1527 Example: (b++, a) + b;
1528 The call that processes the COMPOUND_EXPR will store the increment of B
1529 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1530 processes the PLUS_EXPR will need to merge the two lists so that
1531 eventually, all accesses end up on the same list (and we'll warn about the
1532 unordered subexpressions b++ and b.
1534 A note on merging. If we modify the former example so that our expression
1537 care must be taken not simply to add all three expressions into the final
1538 PNO_SP list. The function merge_tlist takes care of that by merging the
1539 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1540 way, so that no more than one access to B is recorded. */
1543 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1546 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1547 enum tree_code code;
1550 /* X may be NULL if it is the operand of an empty statement expression
1556 code = TREE_CODE (x);
1557 class = TREE_CODE_CLASS (code);
1559 if (warning_candidate_p (x))
1561 *pno_sp = new_tlist (*pno_sp, x, writer);
1571 case TRUTH_ANDIF_EXPR:
1572 case TRUTH_ORIF_EXPR:
1573 tmp_before = tmp_nosp = tmp_list3 = 0;
1574 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1575 warn_for_collisions (tmp_nosp);
1576 merge_tlist (pbefore_sp, tmp_before, 0);
1577 merge_tlist (pbefore_sp, tmp_nosp, 0);
1578 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1579 merge_tlist (pbefore_sp, tmp_list3, 0);
1583 tmp_before = tmp_list2 = 0;
1584 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1585 warn_for_collisions (tmp_list2);
1586 merge_tlist (pbefore_sp, tmp_before, 0);
1587 merge_tlist (pbefore_sp, tmp_list2, 1);
1589 tmp_list3 = tmp_nosp = 0;
1590 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1591 warn_for_collisions (tmp_nosp);
1592 merge_tlist (pbefore_sp, tmp_list3, 0);
1594 tmp_list3 = tmp_list2 = 0;
1595 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1596 warn_for_collisions (tmp_list2);
1597 merge_tlist (pbefore_sp, tmp_list3, 0);
1598 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1599 two first, to avoid warning for (a ? b++ : b++). */
1600 merge_tlist (&tmp_nosp, tmp_list2, 0);
1601 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1604 case PREDECREMENT_EXPR:
1605 case PREINCREMENT_EXPR:
1606 case POSTDECREMENT_EXPR:
1607 case POSTINCREMENT_EXPR:
1608 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1612 tmp_before = tmp_nosp = tmp_list3 = 0;
1613 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1614 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1615 /* Expressions inside the LHS are not ordered wrt. the sequence points
1616 in the RHS. Example:
1618 Despite the fact that the modification of "a" is in the before_sp
1619 list (tmp_before), it conflicts with the use of "a" in the LHS.
1620 We can handle this by adding the contents of tmp_list3
1621 to those of tmp_before, and redoing the collision warnings for that
1623 add_tlist (&tmp_before, tmp_list3, x, 1);
1624 warn_for_collisions (tmp_before);
1625 /* Exclude the LHS itself here; we first have to merge it into the
1626 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1627 didn't exclude the LHS, we'd get it twice, once as a read and once
1629 add_tlist (pno_sp, tmp_list3, x, 0);
1630 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1632 merge_tlist (pbefore_sp, tmp_before, 0);
1633 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1634 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1635 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1639 /* We need to warn about conflicts among arguments and conflicts between
1640 args and the function address. Side effects of the function address,
1641 however, are not ordered by the sequence point of the call. */
1642 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1643 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1644 if (TREE_OPERAND (x, 1))
1645 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1646 merge_tlist (&tmp_list3, tmp_list2, 0);
1647 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1648 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1649 warn_for_collisions (tmp_before);
1650 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1654 /* Scan all the list, e.g. indices of multi dimensional array. */
1657 tmp_before = tmp_nosp = 0;
1658 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1659 merge_tlist (&tmp_nosp, tmp_before, 0);
1660 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1667 struct tlist_cache *t;
1668 for (t = save_expr_cache; t; t = t->next)
1674 t = obstack_alloc (&tlist_obstack, sizeof *t);
1675 t->next = save_expr_cache;
1677 save_expr_cache = t;
1679 tmp_before = tmp_nosp = 0;
1680 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1681 warn_for_collisions (tmp_nosp);
1686 struct tlist *t = tmp_nosp;
1688 merge_tlist (&tmp_list3, t, 0);
1690 t->cache_before_sp = tmp_before;
1691 t->cache_after_sp = tmp_list3;
1693 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1694 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1703 if (first_rtl_op (code) == 0)
1705 x = TREE_OPERAND (x, 0);
1720 int max = first_rtl_op (TREE_CODE (x));
1721 for (lp = 0; lp < max; lp++)
1723 tmp_before = tmp_nosp = 0;
1724 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1725 merge_tlist (&tmp_nosp, tmp_before, 0);
1726 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1733 /* Try to warn for undefined behavior in EXPR due to missing sequence
1737 verify_sequence_points (tree expr)
1739 struct tlist *before_sp = 0, *after_sp = 0;
1742 save_expr_cache = 0;
1743 if (tlist_firstobj == 0)
1745 gcc_obstack_init (&tlist_obstack);
1746 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1749 verify_tree (expr, &before_sp, &after_sp, 0);
1750 warn_for_collisions (after_sp);
1751 obstack_free (&tlist_obstack, tlist_firstobj);
1755 c_expand_expr_stmt (tree expr)
1757 /* Do default conversion if safe and possibly important,
1758 in case within ({...}). */
1759 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1760 && (flag_isoc99 || lvalue_p (expr)))
1761 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1762 expr = default_conversion (expr);
1764 if (warn_sequence_point)
1765 verify_sequence_points (expr);
1767 if (TREE_TYPE (expr) != error_mark_node
1768 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1769 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1770 error ("expression statement has incomplete type");
1772 last_expr_type = TREE_TYPE (expr);
1773 return add_stmt (build_stmt (EXPR_STMT, expr));
1776 /* Validate the expression after `case' and apply default promotions. */
1779 check_case_value (tree value)
1781 if (value == NULL_TREE)
1784 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1785 STRIP_TYPE_NOPS (value);
1786 /* In C++, the following is allowed:
1789 switch (...) { case i: ... }
1791 So, we try to reduce the VALUE to a constant that way. */
1792 if (c_dialect_cxx ())
1794 value = decl_constant_value (value);
1795 STRIP_TYPE_NOPS (value);
1796 value = fold (value);
1799 if (TREE_CODE (value) != INTEGER_CST
1800 && value != error_mark_node)
1802 error ("case label does not reduce to an integer constant");
1803 value = error_mark_node;
1806 /* Promote char or short to int. */
1807 value = default_conversion (value);
1809 constant_expression_warning (value);
1814 /* Return an integer type with BITS bits of precision,
1815 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1818 c_common_type_for_size (unsigned int bits, int unsignedp)
1820 if (bits == TYPE_PRECISION (integer_type_node))
1821 return unsignedp ? unsigned_type_node : integer_type_node;
1823 if (bits == TYPE_PRECISION (signed_char_type_node))
1824 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1826 if (bits == TYPE_PRECISION (short_integer_type_node))
1827 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1829 if (bits == TYPE_PRECISION (long_integer_type_node))
1830 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1832 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1833 return (unsignedp ? long_long_unsigned_type_node
1834 : long_long_integer_type_node);
1836 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1837 return (unsignedp ? widest_unsigned_literal_type_node
1838 : widest_integer_literal_type_node);
1840 if (bits <= TYPE_PRECISION (intQI_type_node))
1841 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1843 if (bits <= TYPE_PRECISION (intHI_type_node))
1844 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1846 if (bits <= TYPE_PRECISION (intSI_type_node))
1847 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1849 if (bits <= TYPE_PRECISION (intDI_type_node))
1850 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1855 /* Used for communication between c_common_type_for_mode and
1856 c_register_builtin_type. */
1857 static GTY(()) tree registered_builtin_types;
1859 /* Return a data type that has machine mode MODE.
1860 If the mode is an integer,
1861 then UNSIGNEDP selects between signed and unsigned types. */
1864 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1868 if (mode == TYPE_MODE (integer_type_node))
1869 return unsignedp ? unsigned_type_node : integer_type_node;
1871 if (mode == TYPE_MODE (signed_char_type_node))
1872 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1874 if (mode == TYPE_MODE (short_integer_type_node))
1875 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1877 if (mode == TYPE_MODE (long_integer_type_node))
1878 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1880 if (mode == TYPE_MODE (long_long_integer_type_node))
1881 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1883 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1884 return unsignedp ? widest_unsigned_literal_type_node
1885 : widest_integer_literal_type_node;
1888 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1891 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1894 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1897 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1899 #if HOST_BITS_PER_WIDE_INT >= 64
1900 if (mode == TYPE_MODE (intTI_type_node))
1901 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1904 if (mode == TYPE_MODE (float_type_node))
1905 return float_type_node;
1907 if (mode == TYPE_MODE (double_type_node))
1908 return double_type_node;
1910 if (mode == TYPE_MODE (long_double_type_node))
1911 return long_double_type_node;
1913 if (mode == TYPE_MODE (void_type_node))
1914 return void_type_node;
1916 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1917 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1919 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1920 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1922 if (VECTOR_MODE_P (mode))
1924 enum machine_mode inner_mode = GET_MODE_INNER (mode);
1925 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1926 if (inner_type != NULL_TREE)
1927 return build_vector_type_for_mode (inner_type, mode);
1930 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1931 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1932 return TREE_VALUE (t);
1937 /* Return an unsigned type the same as TYPE in other respects. */
1939 c_common_unsigned_type (tree type)
1941 tree type1 = TYPE_MAIN_VARIANT (type);
1942 if (type1 == signed_char_type_node || type1 == char_type_node)
1943 return unsigned_char_type_node;
1944 if (type1 == integer_type_node)
1945 return unsigned_type_node;
1946 if (type1 == short_integer_type_node)
1947 return short_unsigned_type_node;
1948 if (type1 == long_integer_type_node)
1949 return long_unsigned_type_node;
1950 if (type1 == long_long_integer_type_node)
1951 return long_long_unsigned_type_node;
1952 if (type1 == widest_integer_literal_type_node)
1953 return widest_unsigned_literal_type_node;
1954 #if HOST_BITS_PER_WIDE_INT >= 64
1955 if (type1 == intTI_type_node)
1956 return unsigned_intTI_type_node;
1958 if (type1 == intDI_type_node)
1959 return unsigned_intDI_type_node;
1960 if (type1 == intSI_type_node)
1961 return unsigned_intSI_type_node;
1962 if (type1 == intHI_type_node)
1963 return unsigned_intHI_type_node;
1964 if (type1 == intQI_type_node)
1965 return unsigned_intQI_type_node;
1967 return c_common_signed_or_unsigned_type (1, type);
1970 /* Return a signed type the same as TYPE in other respects. */
1973 c_common_signed_type (tree type)
1975 tree type1 = TYPE_MAIN_VARIANT (type);
1976 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1977 return signed_char_type_node;
1978 if (type1 == unsigned_type_node)
1979 return integer_type_node;
1980 if (type1 == short_unsigned_type_node)
1981 return short_integer_type_node;
1982 if (type1 == long_unsigned_type_node)
1983 return long_integer_type_node;
1984 if (type1 == long_long_unsigned_type_node)
1985 return long_long_integer_type_node;
1986 if (type1 == widest_unsigned_literal_type_node)
1987 return widest_integer_literal_type_node;
1988 #if HOST_BITS_PER_WIDE_INT >= 64
1989 if (type1 == unsigned_intTI_type_node)
1990 return intTI_type_node;
1992 if (type1 == unsigned_intDI_type_node)
1993 return intDI_type_node;
1994 if (type1 == unsigned_intSI_type_node)
1995 return intSI_type_node;
1996 if (type1 == unsigned_intHI_type_node)
1997 return intHI_type_node;
1998 if (type1 == unsigned_intQI_type_node)
1999 return intQI_type_node;
2001 return c_common_signed_or_unsigned_type (0, type);
2004 /* Return a type the same as TYPE except unsigned or
2005 signed according to UNSIGNEDP. */
2008 c_common_signed_or_unsigned_type (int unsignedp, tree type)
2010 if (! INTEGRAL_TYPE_P (type)
2011 || TYPE_UNSIGNED (type) == unsignedp)
2014 /* Must check the mode of the types, not the precision. Enumeral types
2015 in C++ have precision set to match their range, but may use a wider
2016 mode to match an ABI. If we change modes, we may wind up with bad
2019 if (TYPE_MODE (type) == TYPE_MODE (signed_char_type_node))
2020 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2021 if (TYPE_MODE (type) == TYPE_MODE (integer_type_node))
2022 return unsignedp ? unsigned_type_node : integer_type_node;
2023 if (TYPE_MODE (type) == TYPE_MODE (short_integer_type_node))
2024 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2025 if (TYPE_MODE (type) == TYPE_MODE (long_integer_type_node))
2026 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2027 if (TYPE_MODE (type) == TYPE_MODE (long_long_integer_type_node))
2028 return (unsignedp ? long_long_unsigned_type_node
2029 : long_long_integer_type_node);
2030 if (TYPE_MODE (type) == TYPE_MODE (widest_integer_literal_type_node))
2031 return (unsignedp ? widest_unsigned_literal_type_node
2032 : widest_integer_literal_type_node);
2034 #if HOST_BITS_PER_WIDE_INT >= 64
2035 if (TYPE_MODE (type) == TYPE_MODE (intTI_type_node))
2036 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2038 if (TYPE_MODE (type) == TYPE_MODE (intDI_type_node))
2039 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2040 if (TYPE_MODE (type) == TYPE_MODE (intSI_type_node))
2041 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2042 if (TYPE_MODE (type) == TYPE_MODE (intHI_type_node))
2043 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2044 if (TYPE_MODE (type) == TYPE_MODE (intQI_type_node))
2045 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2050 /* The C version of the register_builtin_type langhook. */
2053 c_register_builtin_type (tree type, const char* name)
2057 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2058 DECL_ARTIFICIAL (decl) = 1;
2059 if (!TYPE_NAME (type))
2060 TYPE_NAME (type) = decl;
2063 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
2067 /* Return the minimum number of bits needed to represent VALUE in a
2068 signed or unsigned type, UNSIGNEDP says which. */
2071 min_precision (tree value, int unsignedp)
2075 /* If the value is negative, compute its negative minus 1. The latter
2076 adjustment is because the absolute value of the largest negative value
2077 is one larger than the largest positive value. This is equivalent to
2078 a bit-wise negation, so use that operation instead. */
2080 if (tree_int_cst_sgn (value) < 0)
2081 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2083 /* Return the number of bits needed, taking into account the fact
2084 that we need one more bit for a signed than unsigned type. */
2086 if (integer_zerop (value))
2089 log = tree_floor_log2 (value);
2091 return log + 1 + ! unsignedp;
2094 /* Print an error message for invalid operands to arith operation
2095 CODE. NOP_EXPR is used as a special case (see
2096 c_common_truthvalue_conversion). */
2099 binary_op_error (enum tree_code code)
2106 error ("invalid truth-value expression");
2110 opname = "+"; break;
2112 opname = "-"; break;
2114 opname = "*"; break;
2116 opname = "max"; break;
2118 opname = "min"; break;
2120 opname = "=="; break;
2122 opname = "!="; break;
2124 opname = "<="; break;
2126 opname = ">="; break;
2128 opname = "<"; break;
2130 opname = ">"; break;
2132 opname = "<<"; break;
2134 opname = ">>"; break;
2135 case TRUNC_MOD_EXPR:
2136 case FLOOR_MOD_EXPR:
2137 opname = "%"; break;
2138 case TRUNC_DIV_EXPR:
2139 case FLOOR_DIV_EXPR:
2140 opname = "/"; break;
2142 opname = "&"; break;
2144 opname = "|"; break;
2145 case TRUTH_ANDIF_EXPR:
2146 opname = "&&"; break;
2147 case TRUTH_ORIF_EXPR:
2148 opname = "||"; break;
2150 opname = "^"; break;
2153 opname = "rotate"; break;
2155 opname = "unknown"; break;
2157 error ("invalid operands to binary %s", opname);
2160 /* Subroutine of build_binary_op, used for comparison operations.
2161 See if the operands have both been converted from subword integer types
2162 and, if so, perhaps change them both back to their original type.
2163 This function is also responsible for converting the two operands
2164 to the proper common type for comparison.
2166 The arguments of this function are all pointers to local variables
2167 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2168 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2170 If this function returns nonzero, it means that the comparison has
2171 a constant value. What this function returns is an expression for
2175 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2176 enum tree_code *rescode_ptr)
2179 tree op0 = *op0_ptr;
2180 tree op1 = *op1_ptr;
2181 int unsignedp0, unsignedp1;
2183 tree primop0, primop1;
2184 enum tree_code code = *rescode_ptr;
2186 /* Throw away any conversions to wider types
2187 already present in the operands. */
2189 primop0 = get_narrower (op0, &unsignedp0);
2190 primop1 = get_narrower (op1, &unsignedp1);
2192 /* Handle the case that OP0 does not *contain* a conversion
2193 but it *requires* conversion to FINAL_TYPE. */
2195 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2196 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2197 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2198 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
2200 /* If one of the operands must be floated, we cannot optimize. */
2201 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2202 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2204 /* If first arg is constant, swap the args (changing operation
2205 so value is preserved), for canonicalization. Don't do this if
2206 the second arg is 0. */
2208 if (TREE_CONSTANT (primop0)
2209 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2212 int temi = unsignedp0;
2220 unsignedp0 = unsignedp1;
2243 *rescode_ptr = code;
2246 /* If comparing an integer against a constant more bits wide,
2247 maybe we can deduce a value of 1 or 0 independent of the data.
2248 Or else truncate the constant now
2249 rather than extend the variable at run time.
2251 This is only interesting if the constant is the wider arg.
2252 Also, it is not safe if the constant is unsigned and the
2253 variable arg is signed, since in this case the variable
2254 would be sign-extended and then regarded as unsigned.
2255 Our technique fails in this case because the lowest/highest
2256 possible unsigned results don't follow naturally from the
2257 lowest/highest possible values of the variable operand.
2258 For just EQ_EXPR and NE_EXPR there is another technique that
2259 could be used: see if the constant can be faithfully represented
2260 in the other operand's type, by truncating it and reextending it
2261 and see if that preserves the constant's value. */
2263 if (!real1 && !real2
2264 && TREE_CODE (primop1) == INTEGER_CST
2265 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2267 int min_gt, max_gt, min_lt, max_lt;
2268 tree maxval, minval;
2269 /* 1 if comparison is nominally unsigned. */
2270 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
2273 type = c_common_signed_or_unsigned_type (unsignedp0,
2274 TREE_TYPE (primop0));
2276 /* In C, if TYPE is an enumeration, then we need to get its
2277 min/max values from its underlying integral type, not the
2278 enumerated type itself. In C++, TYPE_MAX_VALUE and
2279 TYPE_MIN_VALUE have already been set correctly on the
2280 enumeration type. */
2281 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
2282 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2284 maxval = TYPE_MAX_VALUE (type);
2285 minval = TYPE_MIN_VALUE (type);
2287 if (unsignedp && !unsignedp0)
2288 *restype_ptr = c_common_signed_type (*restype_ptr);
2290 if (TREE_TYPE (primop1) != *restype_ptr)
2291 primop1 = convert (*restype_ptr, primop1);
2292 if (type != *restype_ptr)
2294 minval = convert (*restype_ptr, minval);
2295 maxval = convert (*restype_ptr, maxval);
2298 if (unsignedp && unsignedp0)
2300 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2301 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2302 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2303 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2307 min_gt = INT_CST_LT (primop1, minval);
2308 max_gt = INT_CST_LT (primop1, maxval);
2309 min_lt = INT_CST_LT (minval, primop1);
2310 max_lt = INT_CST_LT (maxval, primop1);
2314 /* This used to be a switch, but Genix compiler can't handle that. */
2315 if (code == NE_EXPR)
2317 if (max_lt || min_gt)
2318 val = truthvalue_true_node;
2320 else if (code == EQ_EXPR)
2322 if (max_lt || min_gt)
2323 val = truthvalue_false_node;
2325 else if (code == LT_EXPR)
2328 val = truthvalue_true_node;
2330 val = truthvalue_false_node;
2332 else if (code == GT_EXPR)
2335 val = truthvalue_true_node;
2337 val = truthvalue_false_node;
2339 else if (code == LE_EXPR)
2342 val = truthvalue_true_node;
2344 val = truthvalue_false_node;
2346 else if (code == GE_EXPR)
2349 val = truthvalue_true_node;
2351 val = truthvalue_false_node;
2354 /* If primop0 was sign-extended and unsigned comparison specd,
2355 we did a signed comparison above using the signed type bounds.
2356 But the comparison we output must be unsigned.
2358 Also, for inequalities, VAL is no good; but if the signed
2359 comparison had *any* fixed result, it follows that the
2360 unsigned comparison just tests the sign in reverse
2361 (positive values are LE, negative ones GE).
2362 So we can generate an unsigned comparison
2363 against an extreme value of the signed type. */
2365 if (unsignedp && !unsignedp0)
2372 primop1 = TYPE_MIN_VALUE (type);
2378 primop1 = TYPE_MAX_VALUE (type);
2385 type = c_common_unsigned_type (type);
2388 if (TREE_CODE (primop0) != INTEGER_CST)
2390 if (val == truthvalue_false_node)
2391 warning ("comparison is always false due to limited range of data type");
2392 if (val == truthvalue_true_node)
2393 warning ("comparison is always true due to limited range of data type");
2398 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2399 if (TREE_SIDE_EFFECTS (primop0))
2400 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2404 /* Value is not predetermined, but do the comparison
2405 in the type of the operand that is not constant.
2406 TYPE is already properly set. */
2408 else if (real1 && real2
2409 && (TYPE_PRECISION (TREE_TYPE (primop0))
2410 == TYPE_PRECISION (TREE_TYPE (primop1))))
2411 type = TREE_TYPE (primop0);
2413 /* If args' natural types are both narrower than nominal type
2414 and both extend in the same manner, compare them
2415 in the type of the wider arg.
2416 Otherwise must actually extend both to the nominal
2417 common type lest different ways of extending
2419 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2421 else if (unsignedp0 == unsignedp1 && real1 == real2
2422 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2423 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2425 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2426 type = c_common_signed_or_unsigned_type (unsignedp0
2427 || TYPE_UNSIGNED (*restype_ptr),
2429 /* Make sure shorter operand is extended the right way
2430 to match the longer operand. */
2432 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2433 TREE_TYPE (primop0)),
2436 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2437 TREE_TYPE (primop1)),
2442 /* Here we must do the comparison on the nominal type
2443 using the args exactly as we received them. */
2444 type = *restype_ptr;
2448 if (!real1 && !real2 && integer_zerop (primop1)
2449 && TYPE_UNSIGNED (*restype_ptr))
2455 /* All unsigned values are >= 0, so we warn if extra warnings
2456 are requested. However, if OP0 is a constant that is
2457 >= 0, the signedness of the comparison isn't an issue,
2458 so suppress the warning. */
2459 if (extra_warnings && !in_system_header
2460 && ! (TREE_CODE (primop0) == INTEGER_CST
2461 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2463 warning ("comparison of unsigned expression >= 0 is always true");
2464 value = truthvalue_true_node;
2468 if (extra_warnings && !in_system_header
2469 && ! (TREE_CODE (primop0) == INTEGER_CST
2470 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2472 warning ("comparison of unsigned expression < 0 is always false");
2473 value = truthvalue_false_node;
2482 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2483 if (TREE_SIDE_EFFECTS (primop0))
2484 return build (COMPOUND_EXPR, TREE_TYPE (value),
2491 *op0_ptr = convert (type, primop0);
2492 *op1_ptr = convert (type, primop1);
2494 *restype_ptr = truthvalue_type_node;
2499 /* Return a tree for the sum or difference (RESULTCODE says which)
2500 of pointer PTROP and integer INTOP. */
2503 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2507 /* The result is a pointer of the same type that is being added. */
2509 tree result_type = TREE_TYPE (ptrop);
2511 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2513 if (pedantic || warn_pointer_arith)
2514 pedwarn ("pointer of type `void *' used in arithmetic");
2515 size_exp = integer_one_node;
2517 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2519 if (pedantic || warn_pointer_arith)
2520 pedwarn ("pointer to a function used in arithmetic");
2521 size_exp = integer_one_node;
2523 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2525 if (pedantic || warn_pointer_arith)
2526 pedwarn ("pointer to member function used in arithmetic");
2527 size_exp = integer_one_node;
2530 size_exp = size_in_bytes (TREE_TYPE (result_type));
2532 /* If what we are about to multiply by the size of the elements
2533 contains a constant term, apply distributive law
2534 and multiply that constant term separately.
2535 This helps produce common subexpressions. */
2537 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2538 && ! TREE_CONSTANT (intop)
2539 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2540 && TREE_CONSTANT (size_exp)
2541 /* If the constant comes from pointer subtraction,
2542 skip this optimization--it would cause an error. */
2543 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2544 /* If the constant is unsigned, and smaller than the pointer size,
2545 then we must skip this optimization. This is because it could cause
2546 an overflow error if the constant is negative but INTOP is not. */
2547 && (! TYPE_UNSIGNED (TREE_TYPE (intop))
2548 || (TYPE_PRECISION (TREE_TYPE (intop))
2549 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2551 enum tree_code subcode = resultcode;
2552 tree int_type = TREE_TYPE (intop);
2553 if (TREE_CODE (intop) == MINUS_EXPR)
2554 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2555 /* Convert both subexpression types to the type of intop,
2556 because weird cases involving pointer arithmetic
2557 can result in a sum or difference with different type args. */
2558 ptrop = build_binary_op (subcode, ptrop,
2559 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2560 intop = convert (int_type, TREE_OPERAND (intop, 0));
2563 /* Convert the integer argument to a type the same size as sizetype
2564 so the multiply won't overflow spuriously. */
2566 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2567 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
2568 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2569 TYPE_UNSIGNED (sizetype)), intop);
2571 /* Replace the integer argument with a suitable product by the object size.
2572 Do this multiplication as signed, then convert to the appropriate
2573 pointer type (actually unsigned integral). */
2575 intop = convert (result_type,
2576 build_binary_op (MULT_EXPR, intop,
2577 convert (TREE_TYPE (intop), size_exp), 1));
2579 /* Create the sum or difference. */
2580 return fold (build (resultcode, result_type, ptrop, intop));
2583 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2584 or validate its data type for an `if' or `while' statement or ?..: exp.
2586 This preparation consists of taking the ordinary
2587 representation of an expression expr and producing a valid tree
2588 boolean expression describing whether expr is nonzero. We could
2589 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2590 but we optimize comparisons, &&, ||, and !.
2592 The resulting type should always be `truthvalue_type_node'. */
2595 c_common_truthvalue_conversion (tree expr)
2597 if (TREE_CODE (expr) == ERROR_MARK)
2600 if (TREE_CODE (expr) == FUNCTION_DECL)
2601 expr = build_unary_op (ADDR_EXPR, expr, 0);
2603 switch (TREE_CODE (expr))
2605 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
2606 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2607 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
2608 case ORDERED_EXPR: case UNORDERED_EXPR:
2609 case TRUTH_ANDIF_EXPR:
2610 case TRUTH_ORIF_EXPR:
2611 case TRUTH_AND_EXPR:
2613 case TRUTH_XOR_EXPR:
2614 case TRUTH_NOT_EXPR:
2615 TREE_TYPE (expr) = truthvalue_type_node;
2622 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2625 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2629 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2630 && ! DECL_WEAK (TREE_OPERAND (expr, 0)))
2632 /* Common Ada/Pascal programmer's mistake. We always warn
2633 about this since it is so bad. */
2634 warning ("the address of `%D', will always evaluate as `true'",
2635 TREE_OPERAND (expr, 0));
2636 return truthvalue_true_node;
2639 /* If we are taking the address of an external decl, it might be
2640 zero if it is weak, so we cannot optimize. */
2641 if (DECL_P (TREE_OPERAND (expr, 0))
2642 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2645 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2646 return build (COMPOUND_EXPR, truthvalue_type_node,
2647 TREE_OPERAND (expr, 0), truthvalue_true_node);
2649 return truthvalue_true_node;
2653 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2654 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2655 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)),
2656 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2662 /* These don't change whether an object is nonzero or zero. */
2663 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2667 /* These don't change whether an object is zero or nonzero, but
2668 we can't ignore them if their second arg has side-effects. */
2669 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2670 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2671 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)));
2673 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2676 /* Distribute the conversion into the arms of a COND_EXPR. */
2677 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2678 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2679 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 2))));
2682 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2683 since that affects how `default_conversion' will behave. */
2684 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2685 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2687 /* Fall through.... */
2689 /* If this is widening the argument, we can ignore it. */
2690 if (TYPE_PRECISION (TREE_TYPE (expr))
2691 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2692 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2696 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2697 aren't guaranteed to the be same for modes that can represent
2698 infinity, since if x and y are both +infinity, or both
2699 -infinity, then x - y is not a number.
2701 Note that this transformation is safe when x or y is NaN.
2702 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2704 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2706 /* Fall through.... */
2708 /* This and MINUS_EXPR can be changed into a comparison of the
2710 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2711 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2712 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2713 TREE_OPERAND (expr, 1), 1);
2714 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2715 fold (build1 (NOP_EXPR,
2716 TREE_TYPE (TREE_OPERAND (expr, 0)),
2717 TREE_OPERAND (expr, 1))), 1);
2720 if (integer_onep (TREE_OPERAND (expr, 1))
2721 && TREE_TYPE (expr) != truthvalue_type_node)
2722 /* Using convert here would cause infinite recursion. */
2723 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2727 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2728 warning ("suggest parentheses around assignment used as truth value");
2735 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2737 tree t = save_expr (expr);
2738 return (build_binary_op
2739 ((TREE_SIDE_EFFECTS (expr)
2740 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2741 lang_hooks.truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2742 lang_hooks.truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2746 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2749 static tree builtin_function_2 (const char *, const char *, tree, tree,
2750 int, enum built_in_class, int, int,
2753 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2754 down to the element type of an array. */
2757 c_build_qualified_type (tree type, int type_quals)
2759 if (type == error_mark_node)
2762 if (TREE_CODE (type) == ARRAY_TYPE)
2763 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2765 TYPE_DOMAIN (type));
2767 /* A restrict-qualified pointer type must be a pointer to object or
2768 incomplete type. Note that the use of POINTER_TYPE_P also allows
2769 REFERENCE_TYPEs, which is appropriate for C++. */
2770 if ((type_quals & TYPE_QUAL_RESTRICT)
2771 && (!POINTER_TYPE_P (type)
2772 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2774 error ("invalid use of `restrict'");
2775 type_quals &= ~TYPE_QUAL_RESTRICT;
2778 return build_qualified_type (type, type_quals);
2781 /* Apply the TYPE_QUALS to the new DECL. */
2784 c_apply_type_quals_to_decl (int type_quals, tree decl)
2786 tree type = TREE_TYPE (decl);
2788 if (type == error_mark_node)
2791 if (((type_quals & TYPE_QUAL_CONST)
2792 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2793 /* An object declared 'const' is only readonly after it is
2794 initialized. We don't have any way of expressing this currently,
2795 so we need to be conservative and unset TREE_READONLY for types
2796 with constructors. Otherwise aliasing code will ignore stores in
2797 an inline constructor. */
2798 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2799 TREE_READONLY (decl) = 1;
2800 if (type_quals & TYPE_QUAL_VOLATILE)
2802 TREE_SIDE_EFFECTS (decl) = 1;
2803 TREE_THIS_VOLATILE (decl) = 1;
2805 if (type_quals & TYPE_QUAL_RESTRICT)
2807 while (type && TREE_CODE (type) == ARRAY_TYPE)
2808 /* Allow 'restrict' on arrays of pointers.
2809 FIXME currently we just ignore it. */
2810 type = TREE_TYPE (type);
2812 || !POINTER_TYPE_P (type)
2813 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2814 error ("invalid use of `restrict'");
2815 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2816 /* Indicate we need to make a unique alias set for this pointer.
2817 We can't do it here because it might be pointing to an
2819 DECL_POINTER_ALIAS_SET (decl) = -2;
2823 /* Hash function for the problem of multiple type definitions in
2824 different files. This must hash all types that will compare
2825 equal via comptypes to the same value. In practice it hashes
2826 on some of the simple stuff and leaves the details to comptypes. */
2829 c_type_hash (const void *p)
2835 switch (TREE_CODE (t))
2837 /* For pointers, hash on pointee type plus some swizzling. */
2839 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
2840 /* Hash on number of elements and total size. */
2843 t2 = TYPE_VALUES (t);
2847 t2 = TYPE_FIELDS (t);
2849 case QUAL_UNION_TYPE:
2851 t2 = TYPE_FIELDS (t);
2855 t2 = TYPE_FIELDS (t);
2860 for (; t2; t2 = TREE_CHAIN (t2))
2862 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
2863 return ((size << 24) | (i << shift));
2866 /* Return the typed-based alias set for T, which may be an expression
2867 or a type. Return -1 if we don't do anything special. */
2870 c_common_get_alias_set (tree t)
2874 static htab_t type_hash_table;
2876 /* Permit type-punning when accessing a union, provided the access
2877 is directly through the union. For example, this code does not
2878 permit taking the address of a union member and then storing
2879 through it. Even the type-punning allowed here is a GCC
2880 extension, albeit a common and useful one; the C standard says
2881 that such accesses have implementation-defined behavior. */
2883 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2884 u = TREE_OPERAND (u, 0))
2885 if (TREE_CODE (u) == COMPONENT_REF
2886 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2889 /* That's all the expressions we handle specially. */
2893 /* The C standard guarantees that any object may be accessed via an
2894 lvalue that has character type. */
2895 if (t == char_type_node
2896 || t == signed_char_type_node
2897 || t == unsigned_char_type_node)
2900 /* If it has the may_alias attribute, it can alias anything. */
2901 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2904 /* The C standard specifically allows aliasing between signed and
2905 unsigned variants of the same type. We treat the signed
2906 variant as canonical. */
2907 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
2909 tree t1 = c_common_signed_type (t);
2911 /* t1 == t can happen for boolean nodes which are always unsigned. */
2913 return get_alias_set (t1);
2915 else if (POINTER_TYPE_P (t))
2919 /* Unfortunately, there is no canonical form of a pointer type.
2920 In particular, if we have `typedef int I', then `int *', and
2921 `I *' are different types. So, we have to pick a canonical
2922 representative. We do this below.
2924 Technically, this approach is actually more conservative that
2925 it needs to be. In particular, `const int *' and `int *'
2926 should be in different alias sets, according to the C and C++
2927 standard, since their types are not the same, and so,
2928 technically, an `int **' and `const int **' cannot point at
2931 But, the standard is wrong. In particular, this code is
2936 const int* const* cipp = ipp;
2938 And, it doesn't make sense for that to be legal unless you
2939 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2940 the pointed-to types. This issue has been reported to the
2942 t1 = build_type_no_quals (t);
2944 return get_alias_set (t1);
2947 /* Handle the case of multiple type nodes referring to "the same" type,
2948 which occurs with IMA. These share an alias set. FIXME: Currently only
2949 C90 is handled. (In C99 type compatibility is not transitive, which
2950 complicates things mightily. The alias set splay trees can theoretically
2951 represent this, but insertion is tricky when you consider all the
2952 different orders things might arrive in.) */
2954 if (c_language != clk_c || flag_isoc99)
2957 /* Save time if there's only one input file. */
2958 if (!current_file_decl || TREE_CHAIN (current_file_decl) == NULL_TREE)
2961 /* Pointers need special handling if they point to any type that
2962 needs special handling (below). */
2963 if (TREE_CODE (t) == POINTER_TYPE)
2966 /* Find bottom type under any nested POINTERs. */
2967 for (t2 = TREE_TYPE (t);
2968 TREE_CODE (t2) == POINTER_TYPE;
2969 t2 = TREE_TYPE (t2))
2971 if (TREE_CODE (t2) != RECORD_TYPE
2972 && TREE_CODE (t2) != ENUMERAL_TYPE
2973 && TREE_CODE (t2) != QUAL_UNION_TYPE
2974 && TREE_CODE (t2) != UNION_TYPE)
2976 if (TYPE_SIZE (t2) == 0)
2979 /* These are the only cases that need special handling. */
2980 if (TREE_CODE (t) != RECORD_TYPE
2981 && TREE_CODE (t) != ENUMERAL_TYPE
2982 && TREE_CODE (t) != QUAL_UNION_TYPE
2983 && TREE_CODE (t) != UNION_TYPE
2984 && TREE_CODE (t) != POINTER_TYPE)
2987 if (TYPE_SIZE (t) == 0)
2990 /* Look up t in hash table. Only one of the compatible types within each
2991 alias set is recorded in the table. */
2992 if (!type_hash_table)
2993 type_hash_table = htab_create (1021, c_type_hash,
2994 (htab_eq) lang_hooks.types_compatible_p,
2996 slot = htab_find_slot (type_hash_table, t, INSERT);
2998 return TYPE_ALIAS_SET ((tree)*slot);
3000 /* Our caller will assign and record (in t) a new alias set; all we need
3001 to do is remember t in the hash table. */
3007 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3008 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3009 flag controls whether we should diagnose possibly ill-formed
3010 constructs or not. */
3012 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
3014 const char *op_name;
3016 enum tree_code type_code = TREE_CODE (type);
3018 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
3019 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
3021 if (type_code == FUNCTION_TYPE)
3023 if (op == SIZEOF_EXPR)
3025 if (complain && (pedantic || warn_pointer_arith))
3026 pedwarn ("invalid application of `sizeof' to a function type");
3027 value = size_one_node;
3030 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
3032 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
3034 if (type_code == VOID_TYPE
3035 && complain && (pedantic || warn_pointer_arith))
3036 pedwarn ("invalid application of `%s' to a void type", op_name);
3037 value = size_one_node;
3039 else if (!COMPLETE_TYPE_P (type))
3042 error ("invalid application of `%s' to an incomplete type", op_name);
3043 value = size_zero_node;
3047 if (op == SIZEOF_EXPR)
3048 /* Convert in case a char is more than one unit. */
3049 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
3050 size_int (TYPE_PRECISION (char_type_node)
3053 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
3056 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3057 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3058 never happen. However, this node should really have type
3059 `size_t', which is just a typedef for an ordinary integer type. */
3060 value = fold (build1 (NOP_EXPR, size_type_node, value));
3061 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
3066 /* Implement the __alignof keyword: Return the minimum required
3067 alignment of EXPR, measured in bytes. For VAR_DECL's and
3068 FIELD_DECL's return DECL_ALIGN (which can be set from an
3069 "aligned" __attribute__ specification). */
3072 c_alignof_expr (tree expr)
3076 if (TREE_CODE (expr) == VAR_DECL)
3077 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
3079 else if (TREE_CODE (expr) == COMPONENT_REF
3080 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
3082 error ("`__alignof' applied to a bit-field");
3085 else if (TREE_CODE (expr) == COMPONENT_REF
3086 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
3087 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
3089 else if (TREE_CODE (expr) == INDIRECT_REF)
3091 tree t = TREE_OPERAND (expr, 0);
3093 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3095 while (TREE_CODE (t) == NOP_EXPR
3096 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3100 t = TREE_OPERAND (t, 0);
3101 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3102 if (thisalign > bestalign)
3103 best = t, bestalign = thisalign;
3105 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3108 return c_alignof (TREE_TYPE (expr));
3110 return fold (build1 (NOP_EXPR, size_type_node, t));
3113 /* Handle C and C++ default attributes. */
3115 enum built_in_attribute
3117 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3118 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3119 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3120 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3121 #include "builtin-attrs.def"
3122 #undef DEF_ATTR_NULL_TREE
3124 #undef DEF_ATTR_IDENT
3125 #undef DEF_ATTR_TREE_LIST
3129 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3131 static void c_init_attributes (void);
3133 /* Build tree nodes and builtin functions common to both C and C++ language
3137 c_common_nodes_and_builtins (void)
3141 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3142 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3143 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3144 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3145 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3146 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3147 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3148 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3149 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3150 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3151 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3152 #include "builtin-types.def"
3153 #undef DEF_PRIMITIVE_TYPE
3154 #undef DEF_FUNCTION_TYPE_0
3155 #undef DEF_FUNCTION_TYPE_1
3156 #undef DEF_FUNCTION_TYPE_2
3157 #undef DEF_FUNCTION_TYPE_3
3158 #undef DEF_FUNCTION_TYPE_4
3159 #undef DEF_FUNCTION_TYPE_VAR_0
3160 #undef DEF_FUNCTION_TYPE_VAR_1
3161 #undef DEF_FUNCTION_TYPE_VAR_2
3162 #undef DEF_FUNCTION_TYPE_VAR_3
3163 #undef DEF_POINTER_TYPE
3167 typedef enum builtin_type builtin_type;
3169 tree builtin_types[(int) BT_LAST];
3170 int wchar_type_size;
3171 tree array_domain_type;
3172 tree va_list_ref_type_node;
3173 tree va_list_arg_type_node;
3175 /* Define `int' and `char' first so that dbx will output them first. */
3176 record_builtin_type (RID_INT, NULL, integer_type_node);
3177 record_builtin_type (RID_CHAR, "char", char_type_node);
3179 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3180 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3181 but not C. Are the conditionals here needed? */
3182 if (c_dialect_cxx ())
3183 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3184 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3185 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3186 record_builtin_type (RID_MAX, "long unsigned int",
3187 long_unsigned_type_node);
3188 if (c_dialect_cxx ())
3189 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3190 record_builtin_type (RID_MAX, "long long int",
3191 long_long_integer_type_node);
3192 record_builtin_type (RID_MAX, "long long unsigned int",
3193 long_long_unsigned_type_node);
3194 if (c_dialect_cxx ())
3195 record_builtin_type (RID_MAX, "long long unsigned",
3196 long_long_unsigned_type_node);
3197 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3198 record_builtin_type (RID_MAX, "short unsigned int",
3199 short_unsigned_type_node);
3200 if (c_dialect_cxx ())
3201 record_builtin_type (RID_MAX, "unsigned short",
3202 short_unsigned_type_node);
3204 /* Define both `signed char' and `unsigned char'. */
3205 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3206 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3208 /* These are types that c_common_type_for_size and
3209 c_common_type_for_mode use. */
3210 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3212 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3214 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3216 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3218 #if HOST_BITS_PER_WIDE_INT >= 64
3219 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3220 get_identifier ("__int128_t"),
3223 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3224 unsigned_intQI_type_node));
3225 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3226 unsigned_intHI_type_node));
3227 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3228 unsigned_intSI_type_node));
3229 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3230 unsigned_intDI_type_node));
3231 #if HOST_BITS_PER_WIDE_INT >= 64
3232 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3233 get_identifier ("__uint128_t"),
3234 unsigned_intTI_type_node));
3237 /* Create the widest literal types. */
3238 widest_integer_literal_type_node
3239 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3240 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3241 widest_integer_literal_type_node));
3243 widest_unsigned_literal_type_node
3244 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3245 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3246 widest_unsigned_literal_type_node));
3248 /* `unsigned long' is the standard type for sizeof.
3249 Note that stddef.h uses `unsigned long',
3250 and this must agree, even if long and int are the same size. */
3252 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3253 signed_size_type_node = c_common_signed_type (size_type_node);
3254 set_sizetype (size_type_node);
3257 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
3259 build_common_tree_nodes_2 (flag_short_double);
3261 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3262 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3263 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3265 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3266 get_identifier ("complex int"),
3267 complex_integer_type_node));
3268 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3269 get_identifier ("complex float"),
3270 complex_float_type_node));
3271 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3272 get_identifier ("complex double"),
3273 complex_double_type_node));
3274 lang_hooks.decls.pushdecl
3275 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3276 complex_long_double_type_node));
3278 record_builtin_type (RID_VOID, NULL, void_type_node);
3280 void_zero_node = build_int_2 (0, 0);
3281 TREE_TYPE (void_zero_node) = void_type_node;
3283 void_list_node = build_void_list_node ();
3285 /* Make a type to be the domain of a few array types
3286 whose domains don't really matter.
3287 200 is small enough that it always fits in size_t
3288 and large enough that it can hold most function names for the
3289 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3290 array_domain_type = build_index_type (size_int (200));
3292 /* Make a type for arrays of characters.
3293 With luck nothing will ever really depend on the length of this
3295 char_array_type_node
3296 = build_array_type (char_type_node, array_domain_type);
3298 /* Likewise for arrays of ints. */
3300 = build_array_type (integer_type_node, array_domain_type);
3302 string_type_node = build_pointer_type (char_type_node);
3303 const_string_type_node
3304 = build_pointer_type (build_qualified_type
3305 (char_type_node, TYPE_QUAL_CONST));
3307 /* This is special for C++ so functions can be overloaded. */
3308 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3309 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3310 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3311 if (c_dialect_cxx ())
3313 if (TYPE_UNSIGNED (wchar_type_node))
3314 wchar_type_node = make_unsigned_type (wchar_type_size);
3316 wchar_type_node = make_signed_type (wchar_type_size);
3317 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3321 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3322 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3325 /* This is for wide string constants. */
3326 wchar_array_type_node
3327 = build_array_type (wchar_type_node, array_domain_type);
3330 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3333 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3335 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3337 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3339 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3340 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3342 lang_hooks.decls.pushdecl
3343 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3344 va_list_type_node));
3346 lang_hooks.decls.pushdecl
3347 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3348 ptrdiff_type_node));
3350 lang_hooks.decls.pushdecl
3351 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3354 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3356 va_list_arg_type_node = va_list_ref_type_node =
3357 build_pointer_type (TREE_TYPE (va_list_type_node));
3361 va_list_arg_type_node = va_list_type_node;
3362 va_list_ref_type_node = build_reference_type (va_list_type_node);
3365 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3366 builtin_types[(int) ENUM] = VALUE;
3367 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3368 builtin_types[(int) ENUM] \
3369 = build_function_type (builtin_types[(int) RETURN], \
3371 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3372 builtin_types[(int) ENUM] \
3373 = build_function_type (builtin_types[(int) RETURN], \
3374 tree_cons (NULL_TREE, \
3375 builtin_types[(int) ARG1], \
3377 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3378 builtin_types[(int) ENUM] \
3379 = build_function_type \
3380 (builtin_types[(int) RETURN], \
3381 tree_cons (NULL_TREE, \
3382 builtin_types[(int) ARG1], \
3383 tree_cons (NULL_TREE, \
3384 builtin_types[(int) ARG2], \
3386 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3387 builtin_types[(int) ENUM] \
3388 = build_function_type \
3389 (builtin_types[(int) RETURN], \
3390 tree_cons (NULL_TREE, \
3391 builtin_types[(int) ARG1], \
3392 tree_cons (NULL_TREE, \
3393 builtin_types[(int) ARG2], \
3394 tree_cons (NULL_TREE, \
3395 builtin_types[(int) ARG3], \
3397 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3398 builtin_types[(int) ENUM] \
3399 = build_function_type \
3400 (builtin_types[(int) RETURN], \
3401 tree_cons (NULL_TREE, \
3402 builtin_types[(int) ARG1], \
3403 tree_cons (NULL_TREE, \
3404 builtin_types[(int) ARG2], \
3407 builtin_types[(int) ARG3], \
3408 tree_cons (NULL_TREE, \
3409 builtin_types[(int) ARG4], \
3410 void_list_node)))));
3411 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3412 builtin_types[(int) ENUM] \
3413 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3414 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3415 builtin_types[(int) ENUM] \
3416 = build_function_type (builtin_types[(int) RETURN], \
3417 tree_cons (NULL_TREE, \
3418 builtin_types[(int) ARG1], \
3421 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3422 builtin_types[(int) ENUM] \
3423 = build_function_type \
3424 (builtin_types[(int) RETURN], \
3425 tree_cons (NULL_TREE, \
3426 builtin_types[(int) ARG1], \
3427 tree_cons (NULL_TREE, \
3428 builtin_types[(int) ARG2], \
3431 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3432 builtin_types[(int) ENUM] \
3433 = build_function_type \
3434 (builtin_types[(int) RETURN], \
3435 tree_cons (NULL_TREE, \
3436 builtin_types[(int) ARG1], \
3437 tree_cons (NULL_TREE, \
3438 builtin_types[(int) ARG2], \
3439 tree_cons (NULL_TREE, \
3440 builtin_types[(int) ARG3], \
3443 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3444 builtin_types[(int) ENUM] \
3445 = build_pointer_type (builtin_types[(int) TYPE]);
3446 #include "builtin-types.def"
3447 #undef DEF_PRIMITIVE_TYPE
3448 #undef DEF_FUNCTION_TYPE_1
3449 #undef DEF_FUNCTION_TYPE_2
3450 #undef DEF_FUNCTION_TYPE_3
3451 #undef DEF_FUNCTION_TYPE_4
3452 #undef DEF_FUNCTION_TYPE_VAR_0
3453 #undef DEF_FUNCTION_TYPE_VAR_1
3454 #undef DEF_FUNCTION_TYPE_VAR_2
3455 #undef DEF_FUNCTION_TYPE_VAR_3
3456 #undef DEF_POINTER_TYPE
3458 c_init_attributes ();
3460 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3461 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3466 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3470 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3473 ? (NAME + strlen ("__builtin_")) \
3475 built_in_attributes[(int) ATTRS]); \
3477 decl = builtin_function_2 (NAME, \
3478 NAME + strlen ("__builtin_"), \
3479 builtin_types[TYPE], \
3480 builtin_types[LIBTYPE], \
3485 built_in_attributes[(int) ATTRS]); \
3487 built_in_decls[(int) ENUM] = decl; \
3489 implicit_built_in_decls[(int) ENUM] = decl; \
3491 #include "builtins.def"
3494 targetm.init_builtins ();
3496 main_identifier_node = get_identifier ("main");
3500 build_va_arg (tree expr, tree type)
3502 return build1 (VA_ARG_EXPR, type, expr);
3506 /* Linked list of disabled built-in functions. */
3508 typedef struct disabled_builtin
3511 struct disabled_builtin *next;
3513 static disabled_builtin *disabled_builtins = NULL;
3515 static bool builtin_function_disabled_p (const char *);
3517 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3518 begins with "__builtin_", give an error. */
3521 disable_builtin_function (const char *name)
3523 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3524 error ("cannot disable built-in function `%s'", name);
3527 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3529 new->next = disabled_builtins;
3530 disabled_builtins = new;
3535 /* Return true if the built-in function NAME has been disabled, false
3539 builtin_function_disabled_p (const char *name)
3541 disabled_builtin *p;
3542 for (p = disabled_builtins; p != NULL; p = p->next)
3544 if (strcmp (name, p->name) == 0)
3551 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3552 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3553 of these may be NULL (though both being NULL is useless).
3554 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3555 TYPE is the type of the function with the ordinary name. These
3556 may differ if the ordinary name is declared with a looser type to avoid
3557 conflicts with headers. FUNCTION_CODE and CLASS are as for
3558 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3559 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3560 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3561 ATTRS is the tree list representing the builtin's function attributes.
3562 Returns the declaration of BUILTIN_NAME, if any, otherwise
3563 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3564 or if NONANSI_P and flag_no_nonansi_builtin. */
3567 builtin_function_2 (const char *builtin_name, const char *name,
3568 tree builtin_type, tree type, int function_code,
3569 enum built_in_class class, int library_name_p,
3570 int nonansi_p, tree attrs)
3572 tree bdecl = NULL_TREE;
3573 tree decl = NULL_TREE;
3575 if (builtin_name != 0)
3576 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3577 class, library_name_p ? name : NULL, attrs);
3579 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3580 && !(nonansi_p && flag_no_nonansi_builtin))
3581 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3583 return (bdecl != 0 ? bdecl : decl);
3586 /* Nonzero if the type T promotes to int. This is (nearly) the
3587 integral promotions defined in ISO C99 6.3.1.1/2. */
3590 c_promoting_integer_type_p (tree t)
3592 switch (TREE_CODE (t))
3595 return (TYPE_MAIN_VARIANT (t) == char_type_node
3596 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3597 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3598 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3599 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3600 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3603 /* ??? Technically all enumerations not larger than an int
3604 promote to an int. But this is used along code paths
3605 that only want to notice a size change. */
3606 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3616 /* Return 1 if PARMS specifies a fixed number of parameters
3617 and none of their types is affected by default promotions. */
3620 self_promoting_args_p (tree parms)
3623 for (t = parms; t; t = TREE_CHAIN (t))
3625 tree type = TREE_VALUE (t);
3627 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3633 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3636 if (c_promoting_integer_type_p (type))
3642 /* Recursively examines the array elements of TYPE, until a non-array
3643 element type is found. */
3646 strip_array_types (tree type)
3648 while (TREE_CODE (type) == ARRAY_TYPE)
3649 type = TREE_TYPE (type);
3654 /* Recursively remove any '*' or '&' operator from TYPE. */
3656 strip_pointer_operator (tree t)
3658 while (POINTER_TYPE_P (t))
3663 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3665 /* Expand a call to an unordered comparison function such as
3666 __builtin_isgreater(). FUNCTION is the function's declaration and
3667 PARAMS a list of the values passed. For __builtin_isunordered(),
3668 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3669 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3670 that give the opposite of the desired result. UNORDERED_CODE is
3671 used for modes that can hold NaNs and ORDERED_CODE is used for the
3675 expand_unordered_cmp (tree function, tree params,
3676 enum tree_code unordered_code,
3677 enum tree_code ordered_code)
3679 tree arg0, arg1, type;
3680 enum tree_code code0, code1;
3682 /* Check that we have exactly two arguments. */
3683 if (params == 0 || TREE_CHAIN (params) == 0)
3685 error ("too few arguments to function `%s'",
3686 IDENTIFIER_POINTER (DECL_NAME (function)));
3687 return error_mark_node;
3689 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3691 error ("too many arguments to function `%s'",
3692 IDENTIFIER_POINTER (DECL_NAME (function)));
3693 return error_mark_node;
3696 arg0 = TREE_VALUE (params);
3697 arg1 = TREE_VALUE (TREE_CHAIN (params));
3699 code0 = TREE_CODE (TREE_TYPE (arg0));
3700 code1 = TREE_CODE (TREE_TYPE (arg1));
3702 /* Make sure that the arguments have a common type of REAL. */
3704 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3705 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3706 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3708 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3710 error ("non-floating-point argument to function `%s'",
3711 IDENTIFIER_POINTER (DECL_NAME (function)));
3712 return error_mark_node;
3715 if (unordered_code == UNORDERED_EXPR)
3717 if (MODE_HAS_NANS (TYPE_MODE (type)))
3718 return build_binary_op (unordered_code,
3719 convert (type, arg0),
3720 convert (type, arg1),
3723 return integer_zero_node;
3726 return build_unary_op (TRUTH_NOT_EXPR,
3727 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3730 convert (type, arg0),
3731 convert (type, arg1),
3737 /* Recognize certain built-in functions so we can make tree-codes
3738 other than CALL_EXPR. We do this when it enables fold-const.c
3739 to do something useful. */
3740 /* ??? By rights this should go in builtins.c, but only C and C++
3741 implement build_{binary,unary}_op. Not exactly sure what bits
3742 of functionality are actually needed from those functions, or
3743 where the similar functionality exists in the other front ends. */
3746 expand_tree_builtin (tree function, tree params, tree coerced_params)
3748 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3751 switch (DECL_FUNCTION_CODE (function))
3755 case BUILT_IN_LLABS:
3756 case BUILT_IN_IMAXABS:
3758 case BUILT_IN_FABSL:
3759 case BUILT_IN_FABSF:
3760 if (coerced_params == 0)
3761 return integer_zero_node;
3762 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3765 case BUILT_IN_CONJF:
3766 case BUILT_IN_CONJL:
3767 if (coerced_params == 0)
3768 return integer_zero_node;
3769 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3771 case BUILT_IN_CREAL:
3772 case BUILT_IN_CREALF:
3773 case BUILT_IN_CREALL:
3774 if (coerced_params == 0)
3775 return integer_zero_node;
3776 return non_lvalue (build_unary_op (REALPART_EXPR,
3777 TREE_VALUE (coerced_params), 0));
3779 case BUILT_IN_CIMAG:
3780 case BUILT_IN_CIMAGF:
3781 case BUILT_IN_CIMAGL:
3782 if (coerced_params == 0)
3783 return integer_zero_node;
3784 return non_lvalue (build_unary_op (IMAGPART_EXPR,
3785 TREE_VALUE (coerced_params), 0));
3787 case BUILT_IN_ISGREATER:
3788 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3790 case BUILT_IN_ISGREATEREQUAL:
3791 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3793 case BUILT_IN_ISLESS:
3794 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3796 case BUILT_IN_ISLESSEQUAL:
3797 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3799 case BUILT_IN_ISLESSGREATER:
3800 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3802 case BUILT_IN_ISUNORDERED:
3803 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3812 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3813 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3814 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3815 value, the traversal is aborted, and the value returned by FUNC is
3816 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3817 the node being visited are not walked.
3819 We don't need a without_duplicates variant of this one because the
3820 statement tree is a tree, not a graph. */
3823 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3825 enum tree_code code;
3830 #define WALK_SUBTREE(NODE) \
3833 result = walk_stmt_tree (&(NODE), func, data); \
3839 /* Skip empty subtrees. */
3843 /* Skip subtrees below non-statement nodes. */
3844 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3847 /* Call the function. */
3849 result = (*func) (tp, &walk_subtrees, data);
3851 /* If we found something, return it. */
3855 /* FUNC may have modified the tree, recheck that we're looking at a
3857 code = TREE_CODE (*tp);
3858 if (!STATEMENT_CODE_P (code))
3861 /* Visit the subtrees unless FUNC decided that there was nothing
3862 interesting below this point in the tree. */
3865 /* Walk over all the sub-trees of this operand. Statement nodes
3866 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3867 len = TREE_CODE_LENGTH (code);
3869 /* Go through the subtrees. We need to do this in forward order so
3870 that the scope of a FOR_EXPR is handled properly. */
3871 for (i = 0; i < len; ++i)
3872 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3875 /* Finally visit the chain. This can be tail-recursion optimized if
3876 we write it this way. */
3877 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3882 /* Used to compare case labels. K1 and K2 are actually tree nodes
3883 representing case labels, or NULL_TREE for a `default' label.
3884 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3885 K2, and 0 if K1 and K2 are equal. */
3888 case_compare (splay_tree_key k1, splay_tree_key k2)
3890 /* Consider a NULL key (such as arises with a `default' label) to be
3891 smaller than anything else. */
3897 return tree_int_cst_compare ((tree) k1, (tree) k2);
3900 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3901 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3902 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3903 case label was declared using the usual C/C++ syntax, rather than
3904 the GNU case range extension. CASES is a tree containing all the
3905 case ranges processed so far; COND is the condition for the
3906 switch-statement itself. Returns the CASE_LABEL created, or
3907 ERROR_MARK_NODE if no CASE_LABEL is created. */
3910 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3916 splay_tree_node node;
3918 /* Create the LABEL_DECL itself. */
3919 label = create_artificial_label ();
3921 /* If there was an error processing the switch condition, bail now
3922 before we get more confused. */
3923 if (!cond || cond == error_mark_node)
3926 if ((low_value && TREE_TYPE (low_value)
3927 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3928 || (high_value && TREE_TYPE (high_value)
3929 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3930 error ("pointers are not permitted as case values");
3932 /* Case ranges are a GNU extension. */
3933 if (high_value && pedantic)
3934 pedwarn ("range expressions in switch statements are non-standard");
3936 type = TREE_TYPE (cond);
3939 low_value = check_case_value (low_value);
3940 low_value = convert_and_check (type, low_value);
3944 high_value = check_case_value (high_value);
3945 high_value = convert_and_check (type, high_value);
3948 /* If an error has occurred, bail out now. */
3949 if (low_value == error_mark_node || high_value == error_mark_node)
3952 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3953 really a case range, even though it was written that way. Remove
3954 the HIGH_VALUE to simplify later processing. */
3955 if (tree_int_cst_equal (low_value, high_value))
3956 high_value = NULL_TREE;
3957 if (low_value && high_value
3958 && !tree_int_cst_lt (low_value, high_value))
3959 warning ("empty range specified");
3961 /* Look up the LOW_VALUE in the table of case labels we already
3963 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3964 /* If there was not an exact match, check for overlapping ranges.
3965 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3966 that's a `default' label and the only overlap is an exact match. */
3967 if (!node && (low_value || high_value))
3969 splay_tree_node low_bound;
3970 splay_tree_node high_bound;
3972 /* Even though there wasn't an exact match, there might be an
3973 overlap between this case range and another case range.
3974 Since we've (inductively) not allowed any overlapping case
3975 ranges, we simply need to find the greatest low case label
3976 that is smaller that LOW_VALUE, and the smallest low case
3977 label that is greater than LOW_VALUE. If there is an overlap
3978 it will occur in one of these two ranges. */
3979 low_bound = splay_tree_predecessor (cases,
3980 (splay_tree_key) low_value);
3981 high_bound = splay_tree_successor (cases,
3982 (splay_tree_key) low_value);
3984 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3985 the LOW_VALUE, so there is no need to check unless the
3986 LOW_BOUND is in fact itself a case range. */
3988 && CASE_HIGH ((tree) low_bound->value)
3989 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3992 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3993 range is bigger than the low end of the current range, so we
3994 are only interested if the current range is a real range, and
3995 not an ordinary case label. */
3998 && (tree_int_cst_compare ((tree) high_bound->key,
4003 /* If there was an overlap, issue an error. */
4006 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
4010 error ("duplicate (or overlapping) case value");
4011 error ("%Jthis is the first entry overlapping that value", duplicate);
4015 error ("duplicate case value") ;
4016 error ("%Jpreviously used here", duplicate);
4020 error ("multiple default labels in one switch");
4021 error ("%Jthis is the first default label", duplicate);
4026 /* Add a CASE_LABEL to the statement-tree. */
4027 case_label = add_stmt (build_case_label (low_value, high_value, label));
4028 /* Register this case label in the splay tree. */
4029 splay_tree_insert (cases,
4030 (splay_tree_key) low_value,
4031 (splay_tree_value) case_label);
4036 /* Add a label so that the back-end doesn't think that the beginning o
4037 the switch is unreachable. Note that we do not add a case label, as
4038 that just leads to duplicates and thence to aborts later on. */
4041 tree t = create_artificial_label ();
4042 add_stmt (build_stmt (LABEL_STMT, t));
4044 return error_mark_node;
4047 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
4048 Used to verify that case values match up with enumerator values. */
4051 match_case_to_enum_1 (tree key, tree type, tree label)
4053 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
4055 /* ??? Not working too hard to print the double-word value.
4056 Should perhaps be done with %lwd in the diagnostic routines? */
4057 if (TREE_INT_CST_HIGH (key) == 0)
4058 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
4059 TREE_INT_CST_LOW (key));
4060 else if (!TYPE_UNSIGNED (type)
4061 && TREE_INT_CST_HIGH (key) == -1
4062 && TREE_INT_CST_LOW (key) != 0)
4063 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
4064 -TREE_INT_CST_LOW (key));
4066 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
4067 TREE_INT_CST_HIGH (key), TREE_INT_CST_LOW (key));
4069 if (TYPE_NAME (type) == 0)
4070 warning ("%Jcase value `%s' not in enumerated type",
4071 CASE_LABEL_DECL (label), buf);
4073 warning ("%Jcase value `%s' not in enumerated type `%T'",
4074 CASE_LABEL_DECL (label), buf, type);
4078 match_case_to_enum (splay_tree_node node, void *data)
4080 tree label = (tree) node->value;
4083 /* Skip default case. */
4084 if (!CASE_LOW (label))
4087 /* If TREE_ADDRESSABLE is not set, that means CASE_LOW did not appear
4088 when we did our enum->case scan. Reset our scratch bit after. */
4089 if (!TREE_ADDRESSABLE (label))
4090 match_case_to_enum_1 (CASE_LOW (label), type, label);
4092 TREE_ADDRESSABLE (label) = 0;
4094 /* If CASE_HIGH is non-null, we have a range. Here we must search.
4095 Note that the old code in stmt.c did not check for the values in
4096 the range either, just the endpoints. */
4097 if (CASE_HIGH (label))
4099 tree chain, key = CASE_HIGH (label);
4101 for (chain = TYPE_VALUES (type);
4102 chain && !tree_int_cst_equal (key, TREE_VALUE (chain));
4103 chain = TREE_CHAIN (chain))
4106 match_case_to_enum_1 (key, type, label);
4112 /* Handle -Wswitch*. Called from the front end after parsing the switch
4114 /* ??? Should probably be somewhere generic, since other languages besides
4115 C and C++ would want this. We'd want to agree on the datastructure,
4116 however, which is a problem. Alternately, we operate on gimplified
4117 switch_exprs, which I don't especially like. At the moment, however,
4118 C/C++ are the only tree-ssa languages that support enumerations at all,
4119 so the point is moot. */
4122 c_do_switch_warnings (splay_tree cases, tree switch_stmt)
4124 splay_tree_node default_node;
4125 location_t *switch_locus;
4128 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
4131 switch_locus = EXPR_LOCUS (switch_stmt);
4133 switch_locus = &input_location;
4134 type = SWITCH_TYPE (switch_stmt);
4136 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
4137 if (warn_switch_default && !default_node)
4138 warning ("%Hswitch missing default case", switch_locus);
4140 /* If the switch expression was an enumerated type, check that
4141 exactly all enumeration literals are covered by the cases.
4142 The check is made when -Wswitch was specified and there is no
4143 default case, or when -Wswitch-enum was specified. */
4144 if (((warn_switch && !default_node) || warn_switch_enum)
4145 && type && TREE_CODE (type) == ENUMERAL_TYPE
4146 && TREE_CODE (SWITCH_COND (switch_stmt)) != INTEGER_CST)
4150 /* The time complexity here is O(N*lg(N)) worst case, but for the
4151 common case of monotonically increasing enumerators, it is
4152 O(N), since the nature of the splay tree will keep the next
4153 element adjacent to the root at all times. */
4155 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
4157 splay_tree_node node
4158 = splay_tree_lookup (cases, (splay_tree_key) TREE_VALUE (chain));
4162 /* Mark the CASE_LOW part of the case entry as seen, so
4163 that we save time later. Choose TREE_ADDRESSABLE
4164 randomly as a bit that won't have been set to-date. */
4165 tree label = (tree) node->value;
4166 TREE_ADDRESSABLE (label) = 1;
4170 /* Warn if there are enumerators that don't correspond to
4171 case expressions. */
4172 warning ("%Henumeration value `%E' not handled in switch",
4173 switch_locus, TREE_PURPOSE (chain));
4177 /* Warn if there are case expressions that don't correspond to
4178 enumerators. This can occur since C and C++ don't enforce
4179 type-checking of assignments to enumeration variables.
4181 The time complexity here is O(N**2) worst case, since we've
4182 not sorted the enumeration values. However, in the absence
4183 of case ranges this is O(N), since all single cases that
4184 corresponded to enumerations have been marked above. */
4186 splay_tree_foreach (cases, match_case_to_enum, type);
4190 /* Finish an expression taking the address of LABEL (an
4191 IDENTIFIER_NODE). Returns an expression for the address. */
4194 finish_label_address_expr (tree label)
4199 pedwarn ("taking the address of a label is non-standard");
4201 if (label == error_mark_node)
4202 return error_mark_node;
4204 label = lookup_label (label);
4205 if (label == NULL_TREE)
4206 result = null_pointer_node;
4209 TREE_USED (label) = 1;
4210 result = build1 (ADDR_EXPR, ptr_type_node, label);
4211 /* The current function in not necessarily uninlinable.
4212 Computed gotos are incompatible with inlining, but the value
4213 here could be used only in a diagnostic, for example. */
4219 /* Hook used by expand_expr to expand language-specific tree codes. */
4220 /* The only things that should go here are bits needed to expand
4221 constant initalizers. Everything else should be handled by the
4222 gimplification routines. */
4225 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
4226 int modifier /* Actually enum_modifier. */,
4229 switch (TREE_CODE (exp))
4231 case COMPOUND_LITERAL_EXPR:
4233 /* Initialize the anonymous variable declared in the compound
4234 literal, then return the variable. */
4235 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4236 emit_local_var (decl);
4237 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
4245 /* Hook used by safe_from_p to handle language-specific tree codes. */
4248 c_safe_from_p (rtx target, tree exp)
4250 /* We can see statements here when processing the body of a
4251 statement-expression. For a declaration statement declaring a
4252 variable, look at the variable's initializer. */
4253 if (TREE_CODE (exp) == DECL_STMT)
4255 tree decl = DECL_STMT_DECL (exp);
4257 if (TREE_CODE (decl) == VAR_DECL
4258 && DECL_INITIAL (decl)
4259 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4263 /* For any statement, we must follow the statement-chain. */
4264 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4265 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4267 /* Assume everything else is safe. */
4271 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4274 c_common_unsafe_for_reeval (tree exp)
4276 /* Statement expressions may not be reevaluated, likewise compound
4278 if (TREE_CODE (exp) == STMT_EXPR
4279 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4282 /* Walk all other expressions. */
4286 /* Hook used by staticp to handle language-specific tree codes. */
4289 c_staticp (tree exp)
4291 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4292 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4298 /* Given a boolean expression ARG, return a tree representing an increment
4299 or decrement (as indicated by CODE) of ARG. The front end must check for
4300 invalid cases (e.g., decrement in C++). */
4302 boolean_increment (enum tree_code code, tree arg)
4305 tree true_res = boolean_true_node;
4307 arg = stabilize_reference (arg);
4310 case PREINCREMENT_EXPR:
4311 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4313 case POSTINCREMENT_EXPR:
4314 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4315 arg = save_expr (arg);
4316 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4317 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4319 case PREDECREMENT_EXPR:
4320 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4322 case POSTDECREMENT_EXPR:
4323 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4324 arg = save_expr (arg);
4325 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4326 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4331 TREE_SIDE_EFFECTS (val) = 1;
4335 /* Built-in macros for stddef.h, that require macros defined in this
4338 c_stddef_cpp_builtins(void)
4340 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4341 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4342 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4343 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4347 c_init_attributes (void)
4349 /* Fill in the built_in_attributes array. */
4350 #define DEF_ATTR_NULL_TREE(ENUM) \
4351 built_in_attributes[(int) ENUM] = NULL_TREE;
4352 #define DEF_ATTR_INT(ENUM, VALUE) \
4353 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4354 #define DEF_ATTR_IDENT(ENUM, STRING) \
4355 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4356 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4357 built_in_attributes[(int) ENUM] \
4358 = tree_cons (built_in_attributes[(int) PURPOSE], \
4359 built_in_attributes[(int) VALUE], \
4360 built_in_attributes[(int) CHAIN]);
4361 #include "builtin-attrs.def"
4362 #undef DEF_ATTR_NULL_TREE
4364 #undef DEF_ATTR_IDENT
4365 #undef DEF_ATTR_TREE_LIST
4368 /* Attribute handlers common to C front ends. */
4370 /* Handle a "packed" attribute; arguments as in
4371 struct attribute_spec.handler. */
4374 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4375 int flags, bool *no_add_attrs)
4379 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4380 *node = build_type_copy (*node);
4381 TYPE_PACKED (*node) = 1;
4382 if (TYPE_MAIN_VARIANT (*node) == *node)
4384 /* If it is the main variant, then pack the other variants
4385 too. This happens in,
4388 struct Foo const *ptr; // creates a variant w/o packed flag
4389 } __ attribute__((packed)); // packs it now.
4393 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4394 TYPE_PACKED (probe) = 1;
4398 else if (TREE_CODE (*node) == FIELD_DECL)
4399 DECL_PACKED (*node) = 1;
4400 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4401 used for DECL_REGISTER. It wouldn't mean anything anyway.
4402 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4403 that changes what the typedef is typing. */
4406 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4407 *no_add_attrs = true;
4413 /* Handle a "nocommon" attribute; arguments as in
4414 struct attribute_spec.handler. */
4417 handle_nocommon_attribute (tree *node, tree name,
4418 tree args ATTRIBUTE_UNUSED,
4419 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4421 if (TREE_CODE (*node) == VAR_DECL)
4422 DECL_COMMON (*node) = 0;
4425 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4426 *no_add_attrs = true;
4432 /* Handle a "common" attribute; arguments as in
4433 struct attribute_spec.handler. */
4436 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4437 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4439 if (TREE_CODE (*node) == VAR_DECL)
4440 DECL_COMMON (*node) = 1;
4443 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4444 *no_add_attrs = true;
4450 /* Handle a "noreturn" attribute; arguments as in
4451 struct attribute_spec.handler. */
4454 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4455 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4457 tree type = TREE_TYPE (*node);
4459 /* See FIXME comment in c_common_attribute_table. */
4460 if (TREE_CODE (*node) == FUNCTION_DECL)
4461 TREE_THIS_VOLATILE (*node) = 1;
4462 else if (TREE_CODE (type) == POINTER_TYPE
4463 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4465 = build_pointer_type
4466 (build_type_variant (TREE_TYPE (type),
4467 TYPE_READONLY (TREE_TYPE (type)), 1));
4470 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4471 *no_add_attrs = true;
4477 /* Handle a "noinline" attribute; arguments as in
4478 struct attribute_spec.handler. */
4481 handle_noinline_attribute (tree *node, tree name,
4482 tree args ATTRIBUTE_UNUSED,
4483 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4485 if (TREE_CODE (*node) == FUNCTION_DECL)
4486 DECL_UNINLINABLE (*node) = 1;
4489 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4490 *no_add_attrs = true;
4496 /* Handle a "always_inline" attribute; arguments as in
4497 struct attribute_spec.handler. */
4500 handle_always_inline_attribute (tree *node, tree name,
4501 tree args ATTRIBUTE_UNUSED,
4502 int flags ATTRIBUTE_UNUSED,
4505 if (TREE_CODE (*node) == FUNCTION_DECL)
4507 /* Do nothing else, just set the attribute. We'll get at
4508 it later with lookup_attribute. */
4512 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4513 *no_add_attrs = true;
4519 /* Handle a "used" attribute; arguments as in
4520 struct attribute_spec.handler. */
4523 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4524 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4528 if (TREE_CODE (node) == FUNCTION_DECL
4529 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4531 TREE_USED (node) = 1;
4535 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4536 *no_add_attrs = true;
4542 /* Handle a "unused" attribute; arguments as in
4543 struct attribute_spec.handler. */
4546 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4547 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4553 if (TREE_CODE (decl) == PARM_DECL
4554 || TREE_CODE (decl) == VAR_DECL
4555 || TREE_CODE (decl) == FUNCTION_DECL
4556 || TREE_CODE (decl) == LABEL_DECL
4557 || TREE_CODE (decl) == TYPE_DECL)
4558 TREE_USED (decl) = 1;
4561 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4562 *no_add_attrs = true;
4567 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4568 *node = build_type_copy (*node);
4569 TREE_USED (*node) = 1;
4575 /* Handle a "const" attribute; arguments as in
4576 struct attribute_spec.handler. */
4579 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4580 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4582 tree type = TREE_TYPE (*node);
4584 /* See FIXME comment on noreturn in c_common_attribute_table. */
4585 if (TREE_CODE (*node) == FUNCTION_DECL)
4586 TREE_READONLY (*node) = 1;
4587 else if (TREE_CODE (type) == POINTER_TYPE
4588 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4590 = build_pointer_type
4591 (build_type_variant (TREE_TYPE (type), 1,
4592 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4595 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4596 *no_add_attrs = true;
4602 /* Handle a "transparent_union" attribute; arguments as in
4603 struct attribute_spec.handler. */
4606 handle_transparent_union_attribute (tree *node, tree name,
4607 tree args ATTRIBUTE_UNUSED, int flags,
4610 tree decl = NULL_TREE;
4617 type = &TREE_TYPE (decl);
4618 is_type = TREE_CODE (*node) == TYPE_DECL;
4620 else if (TYPE_P (*node))
4621 type = node, is_type = 1;
4624 && TREE_CODE (*type) == UNION_TYPE
4626 || (TYPE_FIELDS (*type) != 0
4627 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4629 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4630 *type = build_type_copy (*type);
4631 TYPE_TRANSPARENT_UNION (*type) = 1;
4633 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4634 && TREE_CODE (*type) == UNION_TYPE
4635 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4636 DECL_TRANSPARENT_UNION (decl) = 1;
4639 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4640 *no_add_attrs = true;
4646 /* Handle a "constructor" attribute; arguments as in
4647 struct attribute_spec.handler. */
4650 handle_constructor_attribute (tree *node, tree name,
4651 tree args ATTRIBUTE_UNUSED,
4652 int flags ATTRIBUTE_UNUSED,
4656 tree type = TREE_TYPE (decl);
4658 if (TREE_CODE (decl) == FUNCTION_DECL
4659 && TREE_CODE (type) == FUNCTION_TYPE
4660 && decl_function_context (decl) == 0)
4662 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4663 TREE_USED (decl) = 1;
4667 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4668 *no_add_attrs = true;
4674 /* Handle a "destructor" attribute; arguments as in
4675 struct attribute_spec.handler. */
4678 handle_destructor_attribute (tree *node, tree name,
4679 tree args ATTRIBUTE_UNUSED,
4680 int flags ATTRIBUTE_UNUSED,
4684 tree type = TREE_TYPE (decl);
4686 if (TREE_CODE (decl) == FUNCTION_DECL
4687 && TREE_CODE (type) == FUNCTION_TYPE
4688 && decl_function_context (decl) == 0)
4690 DECL_STATIC_DESTRUCTOR (decl) = 1;
4691 TREE_USED (decl) = 1;
4695 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4696 *no_add_attrs = true;
4702 /* Handle a "mode" attribute; arguments as in
4703 struct attribute_spec.handler. */
4706 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4707 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4711 *no_add_attrs = true;
4713 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4714 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4718 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4719 int len = strlen (p);
4720 enum machine_mode mode = VOIDmode;
4724 if (len > 4 && p[0] == '_' && p[1] == '_'
4725 && p[len - 1] == '_' && p[len - 2] == '_')
4727 char *newp = alloca (len - 1);
4729 strcpy (newp, &p[2]);
4730 newp[len - 4] = '\0';
4734 /* Change this type to have a type with the specified mode.
4735 First check for the special modes. */
4736 if (! strcmp (p, "byte"))
4738 else if (!strcmp (p, "word"))
4740 else if (! strcmp (p, "pointer"))
4743 for (j = 0; j < NUM_MACHINE_MODES; j++)
4744 if (!strcmp (p, GET_MODE_NAME (j)))
4745 mode = (enum machine_mode) j;
4747 if (mode == VOIDmode)
4749 error ("unknown machine mode `%s'", p);
4753 if (VECTOR_MODE_P (mode))
4755 warning ("specifying vector types with __attribute__ ((mode)) "
4757 warning ("use __attribute__ ((vector_size)) instead");
4760 typefm = lang_hooks.types.type_for_mode (mode, TYPE_UNSIGNED (type));
4761 if (typefm == NULL_TREE)
4762 error ("no data type for mode `%s'", p);
4764 else if ((TREE_CODE (type) == POINTER_TYPE
4765 || TREE_CODE (type) == REFERENCE_TYPE)
4766 && !targetm.valid_pointer_mode (mode))
4767 error ("invalid pointer mode `%s'", p);
4770 /* If this is a vector, make sure we either have hardware
4771 support, or we can emulate it. */
4772 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4774 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4778 if (TREE_CODE (type) == POINTER_TYPE)
4780 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4784 else if (TREE_CODE (type) == REFERENCE_TYPE)
4786 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4792 /* No need to layout the type here. The caller should do this. */
4799 /* Handle a "section" attribute; arguments as in
4800 struct attribute_spec.handler. */
4803 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4804 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4808 if (targetm.have_named_sections)
4810 if ((TREE_CODE (decl) == FUNCTION_DECL
4811 || TREE_CODE (decl) == VAR_DECL)
4812 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4814 if (TREE_CODE (decl) == VAR_DECL
4815 && current_function_decl != NULL_TREE
4816 && ! TREE_STATIC (decl))
4818 error ("%Jsection attribute cannot be specified for "
4819 "local variables", decl);
4820 *no_add_attrs = true;
4823 /* The decl may have already been given a section attribute
4824 from a previous declaration. Ensure they match. */
4825 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4826 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4827 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4829 error ("%Jsection of '%D' conflicts with previous declaration",
4831 *no_add_attrs = true;
4834 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4838 error ("%Jsection attribute not allowed for '%D'", *node, *node);
4839 *no_add_attrs = true;
4844 error ("%Jsection attributes are not supported for this target", *node);
4845 *no_add_attrs = true;
4851 /* Handle a "aligned" attribute; arguments as in
4852 struct attribute_spec.handler. */
4855 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4856 int flags, bool *no_add_attrs)
4858 tree decl = NULL_TREE;
4861 tree align_expr = (args ? TREE_VALUE (args)
4862 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4868 type = &TREE_TYPE (decl);
4869 is_type = TREE_CODE (*node) == TYPE_DECL;
4871 else if (TYPE_P (*node))
4872 type = node, is_type = 1;
4874 /* Strip any NOPs of any kind. */
4875 while (TREE_CODE (align_expr) == NOP_EXPR
4876 || TREE_CODE (align_expr) == CONVERT_EXPR
4877 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4878 align_expr = TREE_OPERAND (align_expr, 0);
4880 if (TREE_CODE (align_expr) != INTEGER_CST)
4882 error ("requested alignment is not a constant");
4883 *no_add_attrs = true;
4885 else if ((i = tree_log2 (align_expr)) == -1)
4887 error ("requested alignment is not a power of 2");
4888 *no_add_attrs = true;
4890 else if (i > HOST_BITS_PER_INT - 2)
4892 error ("requested alignment is too large");
4893 *no_add_attrs = true;
4897 /* If we have a TYPE_DECL, then copy the type, so that we
4898 don't accidentally modify a builtin type. See pushdecl. */
4899 if (decl && TREE_TYPE (decl) != error_mark_node
4900 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4902 tree tt = TREE_TYPE (decl);
4903 *type = build_type_copy (*type);
4904 DECL_ORIGINAL_TYPE (decl) = tt;
4905 TYPE_NAME (*type) = decl;
4906 TREE_USED (*type) = TREE_USED (decl);
4907 TREE_TYPE (decl) = *type;
4909 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4910 *type = build_type_copy (*type);
4912 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4913 TYPE_USER_ALIGN (*type) = 1;
4915 else if (TREE_CODE (decl) != VAR_DECL
4916 && TREE_CODE (decl) != FIELD_DECL)
4918 error ("%Jalignment may not be specified for '%D'", decl, decl);
4919 *no_add_attrs = true;
4923 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4924 DECL_USER_ALIGN (decl) = 1;
4930 /* Handle a "weak" attribute; arguments as in
4931 struct attribute_spec.handler. */
4934 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
4935 tree args ATTRIBUTE_UNUSED,
4936 int flags ATTRIBUTE_UNUSED,
4937 bool *no_add_attrs ATTRIBUTE_UNUSED)
4939 declare_weak (*node);
4944 /* Handle an "alias" attribute; arguments as in
4945 struct attribute_spec.handler. */
4948 handle_alias_attribute (tree *node, tree name, tree args,
4949 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4953 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4954 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4956 error ("%J'%D' defined both normally and as an alias", decl, decl);
4957 *no_add_attrs = true;
4960 /* Note that the very first time we process a nested declaration,
4961 decl_function_context will not be set. Indeed, *would* never
4962 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4963 we do below. After such frobbery, pushdecl would set the context.
4964 In any case, this is never what we want. */
4965 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
4969 id = TREE_VALUE (args);
4970 if (TREE_CODE (id) != STRING_CST)
4972 error ("alias arg not a string");
4973 *no_add_attrs = true;
4976 id = get_identifier (TREE_STRING_POINTER (id));
4977 /* This counts as a use of the object pointed to. */
4980 if (TREE_CODE (decl) == FUNCTION_DECL)
4981 DECL_INITIAL (decl) = error_mark_node;
4984 DECL_EXTERNAL (decl) = 0;
4985 TREE_STATIC (decl) = 1;
4990 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4991 *no_add_attrs = true;
4997 /* Handle an "visibility" attribute; arguments as in
4998 struct attribute_spec.handler. */
5001 handle_visibility_attribute (tree *node, tree name, tree args,
5002 int flags ATTRIBUTE_UNUSED,
5006 tree id = TREE_VALUE (args);
5008 *no_add_attrs = true;
5010 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
5012 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5016 if (TREE_CODE (id) != STRING_CST)
5018 error ("visibility arg not a string");
5022 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
5023 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5024 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
5025 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
5026 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
5027 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
5028 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
5029 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
5031 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5036 /* Handle an "tls_model" attribute; arguments as in
5037 struct attribute_spec.handler. */
5040 handle_tls_model_attribute (tree *node, tree name, tree args,
5041 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5045 if (! DECL_THREAD_LOCAL (decl))
5047 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5048 *no_add_attrs = true;
5054 id = TREE_VALUE (args);
5055 if (TREE_CODE (id) != STRING_CST)
5057 error ("tls_model arg not a string");
5058 *no_add_attrs = true;
5061 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
5062 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
5063 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
5064 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
5066 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5067 *no_add_attrs = true;
5075 /* Handle a "no_instrument_function" attribute; arguments as in
5076 struct attribute_spec.handler. */
5079 handle_no_instrument_function_attribute (tree *node, tree name,
5080 tree args ATTRIBUTE_UNUSED,
5081 int flags ATTRIBUTE_UNUSED,
5086 if (TREE_CODE (decl) != FUNCTION_DECL)
5088 error ("%J'%E' attribute applies only to functions", decl, name);
5089 *no_add_attrs = true;
5091 else if (DECL_INITIAL (decl))
5093 error ("%Jcan't set '%E' attribute after definition", decl, name);
5094 *no_add_attrs = true;
5097 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5102 /* Handle a "malloc" attribute; arguments as in
5103 struct attribute_spec.handler. */
5106 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5107 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5109 if (TREE_CODE (*node) == FUNCTION_DECL)
5110 DECL_IS_MALLOC (*node) = 1;
5111 /* ??? TODO: Support types. */
5114 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5115 *no_add_attrs = true;
5121 /* Handle a "no_limit_stack" attribute; arguments as in
5122 struct attribute_spec.handler. */
5125 handle_no_limit_stack_attribute (tree *node, tree name,
5126 tree args ATTRIBUTE_UNUSED,
5127 int flags ATTRIBUTE_UNUSED,
5132 if (TREE_CODE (decl) != FUNCTION_DECL)
5134 error ("%J'%E' attribute applies only to functions", decl, name);
5135 *no_add_attrs = true;
5137 else if (DECL_INITIAL (decl))
5139 error ("%Jcan't set '%E' attribute after definition", decl, name);
5140 *no_add_attrs = true;
5143 DECL_NO_LIMIT_STACK (decl) = 1;
5148 /* Handle a "pure" attribute; arguments as in
5149 struct attribute_spec.handler. */
5152 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5153 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5155 if (TREE_CODE (*node) == FUNCTION_DECL)
5156 DECL_IS_PURE (*node) = 1;
5157 /* ??? TODO: Support types. */
5160 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5161 *no_add_attrs = true;
5167 /* Handle a "deprecated" attribute; arguments as in
5168 struct attribute_spec.handler. */
5171 handle_deprecated_attribute (tree *node, tree name,
5172 tree args ATTRIBUTE_UNUSED, int flags,
5175 tree type = NULL_TREE;
5177 const char *what = NULL;
5182 type = TREE_TYPE (decl);
5184 if (TREE_CODE (decl) == TYPE_DECL
5185 || TREE_CODE (decl) == PARM_DECL
5186 || TREE_CODE (decl) == VAR_DECL
5187 || TREE_CODE (decl) == FUNCTION_DECL
5188 || TREE_CODE (decl) == FIELD_DECL)
5189 TREE_DEPRECATED (decl) = 1;
5193 else if (TYPE_P (*node))
5195 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5196 *node = build_type_copy (*node);
5197 TREE_DEPRECATED (*node) = 1;
5205 *no_add_attrs = true;
5206 if (type && TYPE_NAME (type))
5208 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5209 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5210 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5211 && DECL_NAME (TYPE_NAME (type)))
5212 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5215 warning ("`%s' attribute ignored for `%s'",
5216 IDENTIFIER_POINTER (name), what);
5218 warning ("`%s' attribute ignored",
5219 IDENTIFIER_POINTER (name));
5225 /* Handle a "vector_size" attribute; arguments as in
5226 struct attribute_spec.handler. */
5229 handle_vector_size_attribute (tree *node, tree name, tree args,
5230 int flags ATTRIBUTE_UNUSED,
5233 unsigned HOST_WIDE_INT vecsize, nunits;
5234 enum machine_mode mode, orig_mode, new_mode;
5235 tree type = *node, new_type, size;
5237 *no_add_attrs = true;
5239 /* Stripping NON_LVALUE_EXPR allows declarations such as
5240 typedef short v4si __attribute__((vector_size (4 * sizeof(short)))). */
5241 size = TREE_VALUE (args);
5242 if (TREE_CODE (size) == NON_LVALUE_EXPR)
5243 size = TREE_OPERAND (size, 0);
5245 if (! host_integerp (size, 1))
5247 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5251 /* Get the vector size (in bytes). */
5252 vecsize = tree_low_cst (size, 1);
5254 /* We need to provide for vector pointers, vector arrays, and
5255 functions returning vectors. For example:
5257 __attribute__((vector_size(16))) short *foo;
5259 In this case, the mode is SI, but the type being modified is
5260 HI, so we need to look further. */
5262 while (POINTER_TYPE_P (type)
5263 || TREE_CODE (type) == FUNCTION_TYPE
5264 || TREE_CODE (type) == METHOD_TYPE
5265 || TREE_CODE (type) == ARRAY_TYPE)
5266 type = TREE_TYPE (type);
5268 /* Get the mode of the type being modified. */
5269 orig_mode = TYPE_MODE (type);
5271 if (TREE_CODE (type) == RECORD_TYPE
5272 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5273 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5274 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5276 error ("invalid vector type for attribute `%s'",
5277 IDENTIFIER_POINTER (name));
5281 /* Calculate how many units fit in the vector. */
5282 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5284 /* Find a suitably sized vector. */
5285 new_mode = VOIDmode;
5286 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5288 : MODE_VECTOR_FLOAT);
5290 mode = GET_MODE_WIDER_MODE (mode))
5291 if (vecsize == GET_MODE_SIZE (mode)
5292 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5298 if (new_mode == VOIDmode)
5300 error ("no vector mode with the size and type specified could be found");
5304 new_type = build_vector_type_for_mode (type, new_mode);
5306 /* Build back pointers if needed. */
5307 *node = reconstruct_complex_type (*node, new_type);
5312 /* Handle the "nonnull" attribute. */
5314 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5315 tree args, int flags ATTRIBUTE_UNUSED,
5319 unsigned HOST_WIDE_INT attr_arg_num;
5321 /* If no arguments are specified, all pointer arguments should be
5322 non-null. Verify a full prototype is given so that the arguments
5323 will have the correct types when we actually check them later. */
5326 if (! TYPE_ARG_TYPES (type))
5328 error ("nonnull attribute without arguments on a non-prototype");
5329 *no_add_attrs = true;
5334 /* Argument list specified. Verify that each argument number references
5335 a pointer argument. */
5336 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5339 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
5341 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5343 error ("nonnull argument has invalid operand number (arg %lu)",
5344 (unsigned long) attr_arg_num);
5345 *no_add_attrs = true;
5349 argument = TYPE_ARG_TYPES (type);
5352 for (ck_num = 1; ; ck_num++)
5354 if (! argument || ck_num == arg_num)
5356 argument = TREE_CHAIN (argument);
5360 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5362 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5363 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5364 *no_add_attrs = true;
5368 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5370 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5371 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5372 *no_add_attrs = true;
5381 /* Check the argument list of a function call for null in argument slots
5382 that are marked as requiring a non-null pointer argument. */
5385 check_function_nonnull (tree attrs, tree params)
5387 tree a, args, param;
5390 for (a = attrs; a; a = TREE_CHAIN (a))
5392 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5394 args = TREE_VALUE (a);
5396 /* Walk the argument list. If we encounter an argument number we
5397 should check for non-null, do it. If the attribute has no args,
5398 then every pointer argument is checked (in which case the check
5399 for pointer type is done in check_nonnull_arg). */
5400 for (param = params, param_num = 1; ;
5401 param_num++, param = TREE_CHAIN (param))
5405 if (! args || nonnull_check_p (args, param_num))
5406 check_function_arguments_recurse (check_nonnull_arg, NULL,
5414 /* Helper for check_function_nonnull; given a list of operands which
5415 must be non-null in ARGS, determine if operand PARAM_NUM should be
5419 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5421 unsigned HOST_WIDE_INT arg_num = 0;
5423 for (; args; args = TREE_CHAIN (args))
5425 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5428 if (arg_num == param_num)
5434 /* Check that the function argument PARAM (which is operand number
5435 PARAM_NUM) is non-null. This is called by check_function_nonnull
5436 via check_function_arguments_recurse. */
5439 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5440 unsigned HOST_WIDE_INT param_num)
5442 /* Just skip checking the argument if it's not a pointer. This can
5443 happen if the "nonnull" attribute was given without an operand
5444 list (which means to check every pointer argument). */
5446 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5449 if (integer_zerop (param))
5450 warning ("null argument where non-null required (arg %lu)",
5451 (unsigned long) param_num);
5454 /* Helper for nonnull attribute handling; fetch the operand number
5455 from the attribute argument list. */
5458 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5460 /* Strip any conversions from the arg number and verify they
5462 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5463 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5464 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5465 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5467 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5468 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5471 *valp = TREE_INT_CST_LOW (arg_num_expr);
5475 /* Handle a "nothrow" attribute; arguments as in
5476 struct attribute_spec.handler. */
5479 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5480 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5482 if (TREE_CODE (*node) == FUNCTION_DECL)
5483 TREE_NOTHROW (*node) = 1;
5484 /* ??? TODO: Support types. */
5487 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5488 *no_add_attrs = true;
5494 /* Handle a "cleanup" attribute; arguments as in
5495 struct attribute_spec.handler. */
5498 handle_cleanup_attribute (tree *node, tree name, tree args,
5499 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5502 tree cleanup_id, cleanup_decl;
5504 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5505 for global destructors in C++. This requires infrastructure that
5506 we don't have generically at the moment. It's also not a feature
5507 we'd be missing too much, since we do have attribute constructor. */
5508 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5510 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5511 *no_add_attrs = true;
5515 /* Verify that the argument is a function in scope. */
5516 /* ??? We could support pointers to functions here as well, if
5517 that was considered desirable. */
5518 cleanup_id = TREE_VALUE (args);
5519 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5521 error ("cleanup arg not an identifier");
5522 *no_add_attrs = true;
5525 cleanup_decl = lookup_name (cleanup_id);
5526 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5528 error ("cleanup arg not a function");
5529 *no_add_attrs = true;
5533 /* That the function has proper type is checked with the
5534 eventual call to build_function_call. */
5539 /* Handle a "warn_unused_result" attribute. No special handling. */
5542 handle_warn_unused_result_attribute (tree *node, tree name,
5543 tree args ATTRIBUTE_UNUSED,
5544 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5546 /* Ignore the attribute for functions not returning any value. */
5547 if (VOID_TYPE_P (TREE_TYPE (*node)))
5549 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5550 *no_add_attrs = true;
5556 /* Check for valid arguments being passed to a function. */
5558 check_function_arguments (tree attrs, tree params)
5560 /* Check for null being passed in a pointer argument that must be
5561 non-null. We also need to do this if format checking is enabled. */
5564 check_function_nonnull (attrs, params);
5566 /* Check for errors in format strings. */
5569 check_function_format (NULL, attrs, params);
5572 /* Generic argument checking recursion routine. PARAM is the argument to
5573 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5574 once the argument is resolved. CTX is context for the callback. */
5576 check_function_arguments_recurse (void (*callback)
5577 (void *, tree, unsigned HOST_WIDE_INT),
5578 void *ctx, tree param,
5579 unsigned HOST_WIDE_INT param_num)
5581 if (TREE_CODE (param) == NOP_EXPR)
5583 /* Strip coercion. */
5584 check_function_arguments_recurse (callback, ctx,
5585 TREE_OPERAND (param, 0), param_num);
5589 if (TREE_CODE (param) == CALL_EXPR)
5591 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5593 bool found_format_arg = false;
5595 /* See if this is a call to a known internationalization function
5596 that modifies a format arg. Such a function may have multiple
5597 format_arg attributes (for example, ngettext). */
5599 for (attrs = TYPE_ATTRIBUTES (type);
5601 attrs = TREE_CHAIN (attrs))
5602 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5605 tree format_num_expr;
5609 /* Extract the argument number, which was previously checked
5611 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5612 while (TREE_CODE (format_num_expr) == NOP_EXPR
5613 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5614 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5615 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5617 if (TREE_CODE (format_num_expr) != INTEGER_CST
5618 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5621 format_num = TREE_INT_CST_LOW (format_num_expr);
5623 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5625 inner_args = TREE_CHAIN (inner_args), i++)
5626 if (i == format_num)
5628 check_function_arguments_recurse (callback, ctx,
5629 TREE_VALUE (inner_args),
5631 found_format_arg = true;
5636 /* If we found a format_arg attribute and did a recursive check,
5637 we are done with checking this argument. Otherwise, we continue
5638 and this will be considered a non-literal. */
5639 if (found_format_arg)
5643 if (TREE_CODE (param) == COND_EXPR)
5645 /* Check both halves of the conditional expression. */
5646 check_function_arguments_recurse (callback, ctx,
5647 TREE_OPERAND (param, 1), param_num);
5648 check_function_arguments_recurse (callback, ctx,
5649 TREE_OPERAND (param, 2), param_num);
5653 (*callback) (ctx, param, param_num);
5656 /* C implementation of lang_hooks.tree_inlining.walk_subtrees. Tracks the
5657 locus from EXPR_LOCUS and handles DECL_STMT specially. */
5660 c_walk_subtrees (tree *tp, int *walk_subtrees_p ATTRIBUTE_UNUSED,
5661 walk_tree_fn func, void *data, void *htab)
5663 enum tree_code code = TREE_CODE (*tp);
5664 location_t save_locus;
5667 #define WALK_SUBTREE(NODE) \
5670 result = walk_tree (&(NODE), func, data, htab); \
5671 if (result) goto out; \
5675 if (code != DECL_STMT)
5678 /* Set input_location here so we get the right instantiation context
5679 if we call instantiate_decl from inlinable_function_p. */
5680 save_locus = input_location;
5681 if (EXPR_LOCUS (*tp))
5682 input_location = *EXPR_LOCUS (*tp);
5684 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
5685 into declarations that are just mentioned, rather than
5686 declared; they don't really belong to this part of the tree.
5687 And, we can see cycles: the initializer for a declaration can
5688 refer to the declaration itself. */
5689 WALK_SUBTREE (DECL_INITIAL (DECL_STMT_DECL (*tp)));
5690 WALK_SUBTREE (DECL_SIZE (DECL_STMT_DECL (*tp)));
5691 WALK_SUBTREE (DECL_SIZE_UNIT (DECL_STMT_DECL (*tp)));
5692 WALK_SUBTREE (TREE_CHAIN (*tp));
5693 *walk_subtrees_p = 0;
5695 /* We didn't find what we were looking for. */
5697 input_location = save_locus;
5703 /* C implementation of lang_hooks.tree_inlining.tree_chain_matters_p.
5704 Apart from TREE_LISTs, the only trees whose TREE_CHAIN we care about are
5708 c_tree_chain_matters_p (tree t)
5710 /* For statements, we also walk the chain so that we cover the
5711 entire statement tree. */
5712 return STATEMENT_CODE_P (TREE_CODE (t));
5715 /* Function to help qsort sort FIELD_DECLs by name order. */
5718 field_decl_cmp (const void *x_p, const void *y_p)
5720 const tree *const x = x_p;
5721 const tree *const y = y_p;
5722 if (DECL_NAME (*x) == DECL_NAME (*y))
5723 /* A nontype is "greater" than a type. */
5724 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5725 if (DECL_NAME (*x) == NULL_TREE)
5727 if (DECL_NAME (*y) == NULL_TREE)
5729 if (DECL_NAME (*x) < DECL_NAME (*y))
5735 gt_pointer_operator new_value;
5739 /* This routine compares two fields like field_decl_cmp but using the
5740 pointer operator in resort_data. */
5743 resort_field_decl_cmp (const void *x_p, const void *y_p)
5745 const tree *const x = x_p;
5746 const tree *const y = y_p;
5748 if (DECL_NAME (*x) == DECL_NAME (*y))
5749 /* A nontype is "greater" than a type. */
5750 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5751 if (DECL_NAME (*x) == NULL_TREE)
5753 if (DECL_NAME (*y) == NULL_TREE)
5756 tree d1 = DECL_NAME (*x);
5757 tree d2 = DECL_NAME (*y);
5758 resort_data.new_value (&d1, resort_data.cookie);
5759 resort_data.new_value (&d2, resort_data.cookie);
5766 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5769 resort_sorted_fields (void *obj,
5770 void *orig_obj ATTRIBUTE_UNUSED ,
5771 gt_pointer_operator new_value,
5774 struct sorted_fields_type *sf = obj;
5775 resort_data.new_value = new_value;
5776 resort_data.cookie = cookie;
5777 qsort (&sf->elts[0], sf->len, sizeof (tree),
5778 resort_field_decl_cmp);
5781 /* Issue the error given by MSGID, indicating that it occurred before
5782 TOKEN, which had the associated VALUE. */
5785 c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5787 const char *string = _(msgid);
5789 if (token == CPP_EOF)
5790 error ("%s at end of input", string);
5791 else if (token == CPP_CHAR || token == CPP_WCHAR)
5793 unsigned int val = TREE_INT_CST_LOW (value);
5794 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5795 if (val <= UCHAR_MAX && ISGRAPH (val))
5796 error ("%s before %s'%c'", string, ell, val);
5798 error ("%s before %s'\\x%x'", string, ell, val);
5800 else if (token == CPP_STRING
5801 || token == CPP_WSTRING)
5802 error ("%s before string constant", string);
5803 else if (token == CPP_NUMBER)
5804 error ("%s before numeric constant", string);
5805 else if (token == CPP_NAME)
5806 error ("%s before \"%s\"", string, IDENTIFIER_POINTER (value));
5807 else if (token < N_TTYPES)
5808 error ("%s before '%s' token", string, cpp_type2name (token));
5810 error ("%s", string);
5813 /* Walk a gimplified function and warn for functions whose return value is
5814 ignored and attribute((warn_unused_result)) is set. This is done before
5815 inlining, so we don't have to worry about that. */
5818 c_warn_unused_result (tree *top_p)
5821 tree_stmt_iterator i;
5824 switch (TREE_CODE (t))
5826 case STATEMENT_LIST:
5827 for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i))
5828 c_warn_unused_result (tsi_stmt_ptr (i));
5832 c_warn_unused_result (&COND_EXPR_THEN (t));
5833 c_warn_unused_result (&COND_EXPR_ELSE (t));
5836 c_warn_unused_result (&BIND_EXPR_BODY (t));
5838 case TRY_FINALLY_EXPR:
5839 case TRY_CATCH_EXPR:
5840 c_warn_unused_result (&TREE_OPERAND (t, 0));
5841 c_warn_unused_result (&TREE_OPERAND (t, 1));
5844 c_warn_unused_result (&CATCH_BODY (t));
5846 case EH_FILTER_EXPR:
5847 c_warn_unused_result (&EH_FILTER_FAILURE (t));
5851 /* This is a naked call, as opposed to a CALL_EXPR nested inside
5852 a MODIFY_EXPR. All calls whose value is ignored should be
5853 represented like this. Look for the attribute. */
5854 fdecl = get_callee_fndecl (t);
5856 ftype = TREE_TYPE (fdecl);
5859 ftype = TREE_TYPE (TREE_OPERAND (t, 0));
5860 /* Look past pointer-to-function to the function type itself. */
5861 ftype = TREE_TYPE (ftype);
5864 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
5867 warning ("%Hignoring return value of `%D', "
5868 "declared with attribute warn_unused_result",
5869 EXPR_LOCUS (t), fdecl);
5871 warning ("%Hignoring return value of function "
5872 "declared with attribute warn_unused_result",
5878 /* Not a container, not a call, or a call whose value is used. */
5883 #include "gt-c-common.h"