1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
37 #include "diagnostic.h"
42 #include "langhooks.h"
43 #include "tree-inline.h"
46 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
48 /* We let tm.h override the types used here, to handle trivial differences
49 such as the choice of unsigned int or long unsigned int for size_t.
50 When machines start needing nontrivial differences in the size type,
51 it would be best to do something here to figure out automatically
52 from other information what type to use. */
55 #define SIZE_TYPE "long unsigned int"
59 #define WCHAR_TYPE "int"
62 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
63 #define MODIFIED_WCHAR_TYPE \
64 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
67 #define PTRDIFF_TYPE "long int"
71 #define WINT_TYPE "unsigned int"
75 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
77 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
83 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
85 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
86 ? "long unsigned int" \
87 : "long long unsigned int"))
90 /* The variant of the C language being processed. */
92 enum c_language_kind c_language
;
94 /* The following symbols are subsumed in the c_global_trees array, and
95 listed here individually for documentation purposes.
97 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
99 tree short_integer_type_node;
100 tree long_integer_type_node;
101 tree long_long_integer_type_node;
103 tree short_unsigned_type_node;
104 tree long_unsigned_type_node;
105 tree long_long_unsigned_type_node;
107 tree boolean_type_node;
108 tree boolean_false_node;
109 tree boolean_true_node;
111 tree ptrdiff_type_node;
113 tree unsigned_char_type_node;
114 tree signed_char_type_node;
115 tree wchar_type_node;
116 tree signed_wchar_type_node;
117 tree unsigned_wchar_type_node;
119 tree float_type_node;
120 tree double_type_node;
121 tree long_double_type_node;
123 tree complex_integer_type_node;
124 tree complex_float_type_node;
125 tree complex_double_type_node;
126 tree complex_long_double_type_node;
128 tree intQI_type_node;
129 tree intHI_type_node;
130 tree intSI_type_node;
131 tree intDI_type_node;
132 tree intTI_type_node;
134 tree unsigned_intQI_type_node;
135 tree unsigned_intHI_type_node;
136 tree unsigned_intSI_type_node;
137 tree unsigned_intDI_type_node;
138 tree unsigned_intTI_type_node;
140 tree widest_integer_literal_type_node;
141 tree widest_unsigned_literal_type_node;
143 Nodes for types `void *' and `const void *'.
145 tree ptr_type_node, const_ptr_type_node;
147 Nodes for types `char *' and `const char *'.
149 tree string_type_node, const_string_type_node;
151 Type `char[SOMENUMBER]'.
152 Used when an array of char is needed and the size is irrelevant.
154 tree char_array_type_node;
156 Type `int[SOMENUMBER]' or something like it.
157 Used when an array of int needed and the size is irrelevant.
159 tree int_array_type_node;
161 Type `wchar_t[SOMENUMBER]' or something like it.
162 Used when a wide string literal is created.
164 tree wchar_array_type_node;
166 Type `int ()' -- used for implicit declaration of functions.
168 tree default_function_type;
170 A VOID_TYPE node, packaged in a TREE_LIST.
174 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
175 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
176 VAR_DECLS, but C++ does.)
178 tree function_name_decl_node;
179 tree pretty_function_name_decl_node;
180 tree c99_function_name_decl_node;
182 Stack of nested function name VAR_DECLs.
184 tree saved_function_name_decls;
188 tree c_global_trees
[CTI_MAX
];
190 /* TRUE if a code represents a statement. The front end init
191 langhook should take care of initialization of this array. */
193 bool statement_code_p
[MAX_TREE_CODES
];
195 /* Nonzero if we can read a PCH file now. */
199 /* Switches common to the C front ends. */
201 /* Nonzero if prepreprocessing only. */
203 int flag_preprocess_only
;
205 /* Nonzero means don't output line number information. */
207 char flag_no_line_commands
;
209 /* Nonzero causes -E output not to be done, but directives such as
210 #define that have side effects are still obeyed. */
214 /* Nonzero means dump macros in some fashion. */
216 char flag_dump_macros
;
218 /* Nonzero means pass #include lines through to the output. */
220 char flag_dump_includes
;
222 /* The file name to which we should write a precompiled header, or
223 NULL if no header will be written in this compile. */
225 const char *pch_file
;
227 /* Nonzero if an ISO standard was selected. It rejects macros in the
231 /* Nonzero whenever Objective-C functionality is being used. */
234 /* Nonzero if -undef was given. It suppresses target built-in macros
238 /* Nonzero means don't recognize the non-ANSI builtin functions. */
242 /* Nonzero means don't recognize the non-ANSI builtin functions.
245 int flag_no_nonansi_builtin
;
247 /* Nonzero means give `double' the same size as `float'. */
249 int flag_short_double
;
251 /* Nonzero means give `wchar_t' the same size as `short'. */
253 int flag_short_wchar
;
255 /* Nonzero means allow Microsoft extensions without warnings or errors. */
256 int flag_ms_extensions
;
258 /* Nonzero means don't recognize the keyword `asm'. */
262 /* Nonzero means give string constants the type `const char *', as mandated
265 int flag_const_strings
;
267 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
269 int flag_signed_bitfields
= 1;
270 int explicit_flag_signed_bitfields
;
272 /* Nonzero means warn about pointer casts that can drop a type qualifier
273 from the pointer target type. */
277 /* Warn about functions which might be candidates for format attributes. */
279 int warn_missing_format_attribute
;
281 /* Nonzero means warn about sizeof(function) or addition/subtraction
282 of function pointers. */
284 int warn_pointer_arith
;
286 /* Nonzero means warn for any global function def
287 without separate previous prototype decl. */
289 int warn_missing_prototypes
;
291 /* Warn if adding () is suggested. */
293 int warn_parentheses
;
295 /* Warn if initializer is not completely bracketed. */
297 int warn_missing_braces
;
299 /* Warn about comparison of signed and unsigned values.
300 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified
301 (in which case -Wextra gets to decide). */
303 int warn_sign_compare
= -1;
305 /* Nonzero means warn about usage of long long when `-pedantic'. */
307 int warn_long_long
= 1;
309 /* Nonzero means warn about deprecated conversion from string constant to
312 int warn_write_strings
;
314 /* Nonzero means warn about multiple (redundant) decls for the same single
315 variable or function. */
317 int warn_redundant_decls
;
319 /* Warn about testing equality of floating point numbers. */
321 int warn_float_equal
;
323 /* Warn about a subscript that has type char. */
325 int warn_char_subscripts
;
327 /* Warn if a type conversion is done that might have confusing results. */
331 /* Warn about #pragma directives that are not recognized. */
333 int warn_unknown_pragmas
; /* Tri state variable. */
335 /* Warn about format/argument anomalies in calls to formatted I/O functions
336 (*printf, *scanf, strftime, strfmon, etc.). */
340 /* Warn about Y2K problems with strftime formats. */
344 /* Warn about excess arguments to formats. */
346 int warn_format_extra_args
;
348 /* Warn about zero-length formats. */
350 int warn_format_zero_length
;
352 /* Warn about non-literal format arguments. */
354 int warn_format_nonliteral
;
356 /* Warn about possible security problems with calls to format functions. */
358 int warn_format_security
;
361 /* C/ObjC language option variables. */
364 /* Nonzero means message about use of implicit function declarations;
365 1 means warning; 2 means error. */
367 int mesg_implicit_function_declaration
= -1;
369 /* Nonzero means allow type mismatches in conditional expressions;
370 just make their values `void'. */
372 int flag_cond_mismatch
;
374 /* Nonzero means enable C89 Amendment 1 features. */
378 /* Nonzero means use the ISO C99 dialect of C. */
382 /* Nonzero means that we have builtin functions, and main is an int */
386 /* Nonzero means add default format_arg attributes for functions not
389 int flag_noniso_default_format_attributes
= 1;
391 /* Nonzero means warn when casting a function call to a type that does
392 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
393 when there is no previous declaration of sqrt or malloc. */
395 int warn_bad_function_cast
;
397 /* Warn about traditional constructs whose meanings changed in ANSI C. */
399 int warn_traditional
;
401 /* Nonzero means warn for non-prototype function decls
402 or non-prototyped defs without previous prototype. */
404 int warn_strict_prototypes
;
406 /* Nonzero means warn for any global function def
407 without separate previous decl. */
409 int warn_missing_declarations
;
411 /* Nonzero means warn about declarations of objects not at
412 file-scope level and about *all* declarations of functions (whether
413 or static) not at file-scope level. Note that we exclude
414 implicit function declarations. To get warnings about those, use
417 int warn_nested_externs
;
419 /* Warn if main is suspicious. */
423 /* Nonzero means warn about possible violations of sequence point rules. */
425 int warn_sequence_point
;
427 /* Nonzero means to warn about compile-time division by zero. */
428 int warn_div_by_zero
= 1;
430 /* Nonzero means warn about use of implicit int. */
432 int warn_implicit_int
;
434 /* Warn about NULL being passed to argument slots marked as requiring
440 /* ObjC language option variables. */
443 /* Open and close the file for outputting class declarations, if
446 int flag_gen_declaration
;
448 /* Generate code for GNU or NeXT runtime environment. */
450 #ifdef NEXT_OBJC_RUNTIME
451 int flag_next_runtime
= 1;
453 int flag_next_runtime
= 0;
456 /* Tells the compiler that this is a special run. Do not perform any
457 compiling, instead we are to test some platform dependent features
458 and output a C header file with appropriate definitions. */
460 int print_struct_values
;
462 /* ???. Undocumented. */
464 const char *constant_string_class_name
;
466 /* Warn if multiple methods are seen for the same selector, but with
467 different argument types. Performs the check on the whole selector
468 table at the end of compilation. */
472 /* Warn if a @selector() is found, and no method with that selector
473 has been previously declared. The check is done on each
474 @selector() as soon as it is found - so it warns about forward
477 int warn_undeclared_selector
;
479 /* Warn if methods required by a protocol are not implemented in the
480 class adopting it. When turned off, methods inherited to that
481 class are also considered implemented. */
483 int warn_protocol
= 1;
486 /* C++ language option variables. */
489 /* Nonzero means don't recognize any extension keywords. */
491 int flag_no_gnu_keywords
;
493 /* Nonzero means do emit exported implementations of functions even if
494 they can be inlined. */
496 int flag_implement_inlines
= 1;
498 /* Nonzero means do emit exported implementations of templates, instead of
499 multiple static copies in each file that needs a definition. */
501 int flag_external_templates
;
503 /* Nonzero means that the decision to emit or not emit the implementation of a
504 template depends on where the template is instantiated, rather than where
507 int flag_alt_external_templates
;
509 /* Nonzero means that implicit instantiations will be emitted if needed. */
511 int flag_implicit_templates
= 1;
513 /* Nonzero means that implicit instantiations of inline templates will be
514 emitted if needed, even if instantiations of non-inline templates
517 int flag_implicit_inline_templates
= 1;
519 /* Nonzero means generate separate instantiation control files and
520 juggle them at link time. */
522 int flag_use_repository
;
524 /* Nonzero if we want to issue diagnostics that the standard says are not
527 int flag_optional_diags
= 1;
529 /* Nonzero means we should attempt to elide constructors when possible. */
531 int flag_elide_constructors
= 1;
533 /* Nonzero means that member functions defined in class scope are
534 inline by default. */
536 int flag_default_inline
= 1;
538 /* Controls whether compiler generates 'type descriptor' that give
539 run-time type information. */
543 /* Nonzero if we want to conserve space in the .o files. We do this
544 by putting uninitialized data and runtime initialized data into
545 .common instead of .data at the expense of not flagging multiple
548 int flag_conserve_space
;
550 /* Nonzero if we want to obey access control semantics. */
552 int flag_access_control
= 1;
554 /* Nonzero if we want to check the return value of new and avoid calling
555 constructors if it is a null pointer. */
559 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
560 initialization variables.
561 0: Old rules, set by -fno-for-scope.
562 2: New ISO rules, set by -ffor-scope.
563 1: Try to implement new ISO rules, but with backup compatibility
564 (and warnings). This is the default, for now. */
566 int flag_new_for_scope
= 1;
568 /* Nonzero if we want to emit defined symbols with common-like linkage as
569 weak symbols where possible, in order to conform to C++ semantics.
570 Otherwise, emit them as local symbols. */
574 /* Nonzero to use __cxa_atexit, rather than atexit, to register
575 destructors for local statics and global objects. */
577 int flag_use_cxa_atexit
= DEFAULT_USE_CXA_ATEXIT
;
579 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
583 /* Nonzero means make the default pedwarns warnings instead of errors.
584 The value of this flag is ignored if -pedantic is specified. */
588 /* Nonzero means to implement standard semantics for exception
589 specifications, calling unexpected if an exception is thrown that
590 doesn't match the specification. Zero means to treat them as
591 assertions and optimize accordingly, but not check them. */
593 int flag_enforce_eh_specs
= 1;
595 /* The version of the C++ ABI in use. The following values are
598 0: The version of the ABI believed most conformant with the
599 C++ ABI specification. This ABI may change as bugs are
600 discovered and fixed. Therefore, 0 will not necessarily
601 indicate the same ABI in different versions of G++.
603 1: The version of the ABI first used in G++ 3.2.
605 Additional positive integers will be assigned as new versions of
606 the ABI become the default version of the ABI. */
608 int flag_abi_version
= 1;
610 /* Nonzero means warn about things that will change when compiling
611 with an ABI-compliant compiler. */
615 /* Nonzero means warn about invalid uses of offsetof. */
617 int warn_invalid_offsetof
= 1;
619 /* Nonzero means warn about implicit declarations. */
621 int warn_implicit
= 1;
623 /* Nonzero means warn when all ctors or dtors are private, and the class
626 int warn_ctor_dtor_privacy
= 0;
628 /* Nonzero means warn in function declared in derived class has the
629 same name as a virtual in the base class, but fails to match the
630 type signature of any virtual function in the base class. */
632 int warn_overloaded_virtual
;
634 /* Nonzero means warn when declaring a class that has a non virtual
635 destructor, when it really ought to have a virtual one. */
639 /* Nonzero means warn when the compiler will reorder code. */
643 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
647 /* Nonzero means warn when we convert a pointer to member function
648 into a pointer to (void or function). */
650 int warn_pmf2ptr
= 1;
652 /* Nonzero means warn about violation of some Effective C++ style rules. */
656 /* Nonzero means warn where overload resolution chooses a promotion from
657 unsigned to signed over a conversion to an unsigned of the same size. */
661 /* Nonzero means warn when an old-style cast is used. */
663 int warn_old_style_cast
;
665 /* Nonzero means warn when non-templatized friend functions are
666 declared within a template */
668 int warn_nontemplate_friend
= 1;
670 /* Nonzero means complain about deprecated features. */
672 int warn_deprecated
= 1;
674 /* Maximum template instantiation depth. This limit is rather
675 arbitrary, but it exists to limit the time it takes to notice
676 infinite template instantiations. */
678 int max_tinst_depth
= 500;
682 /* The elements of `ridpointers' are identifier nodes for the reserved
683 type names and storage classes. It is indexed by a RID_... value. */
686 tree (*make_fname_decl
) PARAMS ((tree
, int));
688 /* If non-NULL, the address of a language-specific function that takes
689 any action required right before expand_function_end is called. */
690 void (*lang_expand_function_end
) PARAMS ((void));
692 /* Nonzero means the expression being parsed will never be evaluated.
693 This is a count, since unevaluated expressions can nest. */
696 /* Information about how a function name is generated. */
699 tree
*const decl
; /* pointer to the VAR_DECL. */
700 const unsigned rid
; /* RID number for the identifier. */
701 const int pretty
; /* How pretty is it? */
704 /* The three ways of getting then name of the current function. */
706 const struct fname_var_t fname_vars
[] =
708 /* C99 compliant __func__, must be first. */
709 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
710 /* GCC __FUNCTION__ compliant. */
711 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
712 /* GCC __PRETTY_FUNCTION__ compliant. */
713 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
717 static int constant_fits_type_p
PARAMS ((tree
, tree
));
719 /* Keep a stack of if statements. We record the number of compound
720 statements seen up to the if keyword, as well as the line number
721 and file of the if. If a potentially ambiguous else is seen, that
722 fact is recorded; the warning is issued when we can be sure that
723 the enclosing if statement does not have an else branch. */
732 static if_elt
*if_stack
;
734 /* Amount of space in the if statement stack. */
735 static int if_stack_space
= 0;
738 static int if_stack_pointer
= 0;
740 static tree handle_packed_attribute
PARAMS ((tree
*, tree
, tree
, int,
742 static tree handle_nocommon_attribute
PARAMS ((tree
*, tree
, tree
, int,
744 static tree handle_common_attribute
PARAMS ((tree
*, tree
, tree
, int,
746 static tree handle_noreturn_attribute
PARAMS ((tree
*, tree
, tree
, int,
748 static tree handle_noinline_attribute
PARAMS ((tree
*, tree
, tree
, int,
750 static tree handle_always_inline_attribute
PARAMS ((tree
*, tree
, tree
, int,
752 static tree handle_used_attribute
PARAMS ((tree
*, tree
, tree
, int,
754 static tree handle_unused_attribute
PARAMS ((tree
*, tree
, tree
, int,
756 static tree handle_const_attribute
PARAMS ((tree
*, tree
, tree
, int,
758 static tree handle_transparent_union_attribute
PARAMS ((tree
*, tree
, tree
,
760 static tree handle_constructor_attribute
PARAMS ((tree
*, tree
, tree
, int,
762 static tree handle_destructor_attribute
PARAMS ((tree
*, tree
, tree
, int,
764 static tree handle_mode_attribute
PARAMS ((tree
*, tree
, tree
, int,
766 static tree handle_section_attribute
PARAMS ((tree
*, tree
, tree
, int,
768 static tree handle_aligned_attribute
PARAMS ((tree
*, tree
, tree
, int,
770 static tree handle_weak_attribute
PARAMS ((tree
*, tree
, tree
, int,
772 static tree handle_alias_attribute
PARAMS ((tree
*, tree
, tree
, int,
774 static tree handle_visibility_attribute
PARAMS ((tree
*, tree
, tree
, int,
776 static tree handle_tls_model_attribute
PARAMS ((tree
*, tree
, tree
, int,
778 static tree handle_no_instrument_function_attribute
PARAMS ((tree
*, tree
,
781 static tree handle_malloc_attribute
PARAMS ((tree
*, tree
, tree
, int,
783 static tree handle_no_limit_stack_attribute
PARAMS ((tree
*, tree
, tree
, int,
785 static tree handle_pure_attribute
PARAMS ((tree
*, tree
, tree
, int,
787 static tree handle_deprecated_attribute
PARAMS ((tree
*, tree
, tree
, int,
789 static tree handle_vector_size_attribute
PARAMS ((tree
*, tree
, tree
, int,
791 static tree handle_nonnull_attribute
PARAMS ((tree
*, tree
, tree
, int,
793 static tree handle_nothrow_attribute
PARAMS ((tree
*, tree
, tree
, int,
795 static tree vector_size_helper
PARAMS ((tree
, tree
));
797 static void check_function_nonnull
PARAMS ((tree
, tree
));
798 static void check_nonnull_arg
PARAMS ((void *, tree
,
799 unsigned HOST_WIDE_INT
));
800 static bool nonnull_check_p
PARAMS ((tree
, unsigned HOST_WIDE_INT
));
801 static bool get_nonnull_operand
PARAMS ((tree
,
802 unsigned HOST_WIDE_INT
*));
804 /* Table of machine-independent attributes common to all C-like languages. */
805 const struct attribute_spec c_common_attribute_table
[] =
807 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
808 { "packed", 0, 0, false, false, false,
809 handle_packed_attribute
},
810 { "nocommon", 0, 0, true, false, false,
811 handle_nocommon_attribute
},
812 { "common", 0, 0, true, false, false,
813 handle_common_attribute
},
814 /* FIXME: logically, noreturn attributes should be listed as
815 "false, true, true" and apply to function types. But implementing this
816 would require all the places in the compiler that use TREE_THIS_VOLATILE
817 on a decl to identify non-returning functions to be located and fixed
818 to check the function type instead. */
819 { "noreturn", 0, 0, true, false, false,
820 handle_noreturn_attribute
},
821 { "volatile", 0, 0, true, false, false,
822 handle_noreturn_attribute
},
823 { "noinline", 0, 0, true, false, false,
824 handle_noinline_attribute
},
825 { "always_inline", 0, 0, true, false, false,
826 handle_always_inline_attribute
},
827 { "used", 0, 0, true, false, false,
828 handle_used_attribute
},
829 { "unused", 0, 0, false, false, false,
830 handle_unused_attribute
},
831 /* The same comments as for noreturn attributes apply to const ones. */
832 { "const", 0, 0, true, false, false,
833 handle_const_attribute
},
834 { "transparent_union", 0, 0, false, false, false,
835 handle_transparent_union_attribute
},
836 { "constructor", 0, 0, true, false, false,
837 handle_constructor_attribute
},
838 { "destructor", 0, 0, true, false, false,
839 handle_destructor_attribute
},
840 { "mode", 1, 1, false, true, false,
841 handle_mode_attribute
},
842 { "section", 1, 1, true, false, false,
843 handle_section_attribute
},
844 { "aligned", 0, 1, false, false, false,
845 handle_aligned_attribute
},
846 { "weak", 0, 0, true, false, false,
847 handle_weak_attribute
},
848 { "alias", 1, 1, true, false, false,
849 handle_alias_attribute
},
850 { "no_instrument_function", 0, 0, true, false, false,
851 handle_no_instrument_function_attribute
},
852 { "malloc", 0, 0, true, false, false,
853 handle_malloc_attribute
},
854 { "no_stack_limit", 0, 0, true, false, false,
855 handle_no_limit_stack_attribute
},
856 { "pure", 0, 0, true, false, false,
857 handle_pure_attribute
},
858 { "deprecated", 0, 0, false, false, false,
859 handle_deprecated_attribute
},
860 { "vector_size", 1, 1, false, true, false,
861 handle_vector_size_attribute
},
862 { "visibility", 1, 1, true, false, false,
863 handle_visibility_attribute
},
864 { "tls_model", 1, 1, true, false, false,
865 handle_tls_model_attribute
},
866 { "nonnull", 0, -1, false, true, true,
867 handle_nonnull_attribute
},
868 { "nothrow", 0, 0, true, false, false,
869 handle_nothrow_attribute
},
870 { "may_alias", 0, 0, false, true, false, NULL
},
871 { NULL
, 0, 0, false, false, false, NULL
}
874 /* Give the specifications for the format attributes, used by C and all
877 const struct attribute_spec c_common_format_attribute_table
[] =
879 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
880 { "format", 3, 3, false, true, true,
881 handle_format_attribute
},
882 { "format_arg", 1, 1, false, true, true,
883 handle_format_arg_attribute
},
884 { NULL
, 0, 0, false, false, false, NULL
}
887 /* Record the start of an if-then, and record the start of it
888 for ambiguous else detection.
890 COND is the condition for the if-then statement.
892 IF_STMT is the statement node that has already been created for
893 this if-then statement. It is created before parsing the
894 condition to keep line number information accurate. */
897 c_expand_start_cond (cond
, compstmt_count
, if_stmt
)
902 /* Make sure there is enough space on the stack. */
903 if (if_stack_space
== 0)
906 if_stack
= (if_elt
*) xmalloc (10 * sizeof (if_elt
));
908 else if (if_stack_space
== if_stack_pointer
)
910 if_stack_space
+= 10;
911 if_stack
= (if_elt
*) xrealloc (if_stack
, if_stack_space
* sizeof (if_elt
));
914 IF_COND (if_stmt
) = cond
;
917 /* Record this if statement. */
918 if_stack
[if_stack_pointer
].compstmt_count
= compstmt_count
;
919 if_stack
[if_stack_pointer
].locus
= input_location
;
920 if_stack
[if_stack_pointer
].needs_warning
= 0;
921 if_stack
[if_stack_pointer
].if_stmt
= if_stmt
;
925 /* Called after the then-clause for an if-statement is processed. */
930 tree if_stmt
= if_stack
[if_stack_pointer
- 1].if_stmt
;
931 RECHAIN_STMTS (if_stmt
, THEN_CLAUSE (if_stmt
));
934 /* Record the end of an if-then. Optionally warn if a nested
935 if statement had an ambiguous else clause. */
941 if (if_stack
[if_stack_pointer
].needs_warning
)
942 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
943 &if_stack
[if_stack_pointer
].locus
);
944 last_expr_type
= NULL_TREE
;
947 /* Called between the then-clause and the else-clause
948 of an if-then-else. */
951 c_expand_start_else ()
953 /* An ambiguous else warning must be generated for the enclosing if
954 statement, unless we see an else branch for that one, too. */
956 && if_stack_pointer
> 1
957 && (if_stack
[if_stack_pointer
- 1].compstmt_count
958 == if_stack
[if_stack_pointer
- 2].compstmt_count
))
959 if_stack
[if_stack_pointer
- 2].needs_warning
= 1;
961 /* Even if a nested if statement had an else branch, it can't be
962 ambiguous if this one also has an else. So don't warn in that
963 case. Also don't warn for any if statements nested in this else. */
964 if_stack
[if_stack_pointer
- 1].needs_warning
= 0;
965 if_stack
[if_stack_pointer
- 1].compstmt_count
--;
968 /* Called after the else-clause for an if-statement is processed. */
973 tree if_stmt
= if_stack
[if_stack_pointer
- 1].if_stmt
;
974 RECHAIN_STMTS (if_stmt
, ELSE_CLAUSE (if_stmt
));
977 /* Begin an if-statement. Returns a newly created IF_STMT if
980 Unlike the C++ front-end, we do not call add_stmt here; it is
981 probably safe to do so, but I am not very familiar with this
982 code so I am being extra careful not to change its behavior
983 beyond what is strictly necessary for correctness. */
989 r
= build_stmt (IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
993 /* Begin a while statement. Returns a newly created WHILE_STMT if
996 Unlike the C++ front-end, we do not call add_stmt here; it is
997 probably safe to do so, but I am not very familiar with this
998 code so I am being extra careful not to change its behavior
999 beyond what is strictly necessary for correctness. */
1002 c_begin_while_stmt ()
1005 r
= build_stmt (WHILE_STMT
, NULL_TREE
, NULL_TREE
);
1010 c_finish_while_stmt_cond (cond
, while_stmt
)
1014 WHILE_COND (while_stmt
) = cond
;
1017 /* Push current bindings for the function name VAR_DECLS. */
1020 start_fname_decls ()
1023 tree saved
= NULL_TREE
;
1025 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1027 tree decl
= *fname_vars
[ix
].decl
;
1031 saved
= tree_cons (decl
, build_int_2 (ix
, 0), saved
);
1032 *fname_vars
[ix
].decl
= NULL_TREE
;
1035 if (saved
|| saved_function_name_decls
)
1036 /* Normally they'll have been NULL, so only push if we've got a
1037 stack, or they are non-NULL. */
1038 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
1039 saved_function_name_decls
);
1042 /* Finish up the current bindings, adding them into the
1043 current function's statement tree. This is done by wrapping the
1044 function's body in a COMPOUND_STMT containing these decls too. This
1045 must be done _before_ finish_stmt_tree is called. If there is no
1046 current function, we must be at file scope and no statements are
1047 involved. Pop the previous bindings. */
1050 finish_fname_decls ()
1053 tree body
= NULL_TREE
;
1054 tree stack
= saved_function_name_decls
;
1056 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
1057 body
= chainon (TREE_VALUE (stack
), body
);
1061 /* They were called into existence, so add to statement tree. Add
1062 the DECL_STMTs inside the outermost scope. */
1063 tree
*p
= &DECL_SAVED_TREE (current_function_decl
);
1064 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1065 while (TREE_CODE (*p
) != COMPOUND_STMT
)
1066 p
= &TREE_CHAIN (*p
);
1067 p
= &COMPOUND_BODY (*p
);
1068 if (TREE_CODE (*p
) == SCOPE_STMT
)
1069 p
= &TREE_CHAIN (*p
);
1071 body
= chainon (body
, *p
);
1075 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1076 *fname_vars
[ix
].decl
= NULL_TREE
;
1080 /* We had saved values, restore them. */
1083 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
1085 tree decl
= TREE_PURPOSE (saved
);
1086 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
1088 *fname_vars
[ix
].decl
= decl
;
1090 stack
= TREE_CHAIN (stack
);
1092 saved_function_name_decls
= stack
;
1095 /* Return the text name of the current function, suitably prettified
1099 fname_as_string (pretty_p
)
1102 const char *name
= NULL
;
1105 name
= (current_function_decl
1106 ? (*lang_hooks
.decl_printable_name
) (current_function_decl
, 2)
1108 else if (current_function_decl
&& DECL_NAME (current_function_decl
))
1109 name
= IDENTIFIER_POINTER (DECL_NAME (current_function_decl
));
1115 /* Return the text name of the current function, formatted as
1116 required by the supplied RID value. */
1124 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1125 if (fname_vars
[ix
].rid
== rid
)
1127 return fname_as_string (fname_vars
[ix
].pretty
);
1130 /* Return the VAR_DECL for a const char array naming the current
1131 function. If the VAR_DECL has not yet been created, create it
1132 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1133 ID is its name (unfortunately C and C++ hold the RID values of
1134 keywords in different places, so we can't derive RID from ID in
1135 this language independent code. */
1138 fname_decl (rid
, id
)
1143 tree decl
= NULL_TREE
;
1145 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1146 if (fname_vars
[ix
].rid
== rid
)
1149 decl
= *fname_vars
[ix
].decl
;
1152 tree saved_last_tree
= last_tree
;
1153 /* If a tree is built here, it would normally have the lineno of
1154 the current statement. Later this tree will be moved to the
1155 beginning of the function and this line number will be wrong.
1156 To avoid this problem set the lineno to 0 here; that prevents
1157 it from appearing in the RTL. */
1158 int saved_lineno
= input_line
;
1161 decl
= (*make_fname_decl
) (id
, fname_vars
[ix
].pretty
);
1162 if (last_tree
!= saved_last_tree
)
1164 /* We created some statement tree for the decl. This belongs
1165 at the start of the function, so remove it now and reinsert
1166 it after the function is complete. */
1167 tree stmts
= TREE_CHAIN (saved_last_tree
);
1169 TREE_CHAIN (saved_last_tree
) = NULL_TREE
;
1170 last_tree
= saved_last_tree
;
1171 saved_function_name_decls
= tree_cons (decl
, stmts
,
1172 saved_function_name_decls
);
1174 *fname_vars
[ix
].decl
= decl
;
1175 input_line
= saved_lineno
;
1177 if (!ix
&& !current_function_decl
)
1178 pedwarn_with_decl (decl
, "`%s' is not defined outside of function scope");
1183 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1186 fix_string_type (value
)
1189 const int wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
1190 const int wide_flag
= TREE_TYPE (value
) == wchar_array_type_node
;
1191 const int nchars_max
= flag_isoc99
? 4095 : 509;
1192 int length
= TREE_STRING_LENGTH (value
);
1195 /* Compute the number of elements, for the array type. */
1196 nchars
= wide_flag
? length
/ wchar_bytes
: length
;
1198 if (pedantic
&& nchars
- 1 > nchars_max
&& c_language
== clk_c
)
1199 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1200 nchars
- 1, nchars_max
, flag_isoc99
? 99 : 89);
1202 /* Create the array type for the string constant.
1203 -Wwrite-strings says make the string constant an array of const char
1204 so that copying it to a non-const pointer will get a warning.
1205 For C++, this is the standard behavior. */
1206 if (flag_const_strings
&& ! flag_writable_strings
)
1209 = build_type_variant (wide_flag
? wchar_type_node
: char_type_node
,
1212 = build_array_type (elements
,
1213 build_index_type (build_int_2 (nchars
- 1, 0)));
1217 = build_array_type (wide_flag
? wchar_type_node
: char_type_node
,
1218 build_index_type (build_int_2 (nchars
- 1, 0)));
1220 TREE_CONSTANT (value
) = 1;
1221 TREE_READONLY (value
) = ! flag_writable_strings
;
1222 TREE_STATIC (value
) = 1;
1226 /* Given a VARRAY of STRING_CST nodes, concatenate them into one
1230 combine_strings (strings
)
1231 varray_type strings
;
1233 const int wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
1234 const int nstrings
= VARRAY_ACTIVE_SIZE (strings
);
1237 int wide_length
= 0;
1242 /* Don't include the \0 at the end of each substring. Count wide
1243 strings and ordinary strings separately. */
1244 for (i
= 0; i
< nstrings
; ++i
)
1246 t
= VARRAY_TREE (strings
, i
);
1248 if (TREE_TYPE (t
) == wchar_array_type_node
)
1250 wide_length
+= TREE_STRING_LENGTH (t
) - wchar_bytes
;
1255 length
+= (TREE_STRING_LENGTH (t
) - 1);
1256 if (C_ARTIFICIAL_STRING_P (t
) && !in_system_header
)
1257 warning ("concatenation of string literals with __FUNCTION__ is deprecated");
1261 /* If anything is wide, the non-wides will be converted,
1262 which makes them take more space. */
1264 length
= length
* wchar_bytes
+ wide_length
;
1266 p
= xmalloc (length
);
1268 /* Copy the individual strings into the new combined string.
1269 If the combined string is wide, convert the chars to ints
1270 for any individual strings that are not wide. */
1273 for (i
= 0; i
< nstrings
; ++i
)
1277 t
= VARRAY_TREE (strings
, i
);
1278 this_wide
= TREE_TYPE (t
) == wchar_array_type_node
;
1279 len
= TREE_STRING_LENGTH (t
) - (this_wide
? wchar_bytes
: 1);
1280 if (this_wide
== wide_flag
)
1282 memcpy (q
, TREE_STRING_POINTER (t
), len
);
1287 const int nzeros
= (TYPE_PRECISION (wchar_type_node
)
1288 / BITS_PER_UNIT
) - 1;
1291 if (BYTES_BIG_ENDIAN
)
1293 for (k
= 0; k
< len
; k
++)
1295 for (j
= 0; j
< nzeros
; j
++)
1297 *q
++ = TREE_STRING_POINTER (t
)[k
];
1302 for (k
= 0; k
< len
; k
++)
1304 *q
++ = TREE_STRING_POINTER (t
)[k
];
1305 for (j
= 0; j
< nzeros
; j
++)
1312 /* Nul terminate the string. */
1315 for (i
= 0; i
< wchar_bytes
; i
++)
1321 value
= build_string (length
, p
);
1325 TREE_TYPE (value
) = wchar_array_type_node
;
1327 TREE_TYPE (value
) = char_array_type_node
;
1332 static int is_valid_printf_arglist
PARAMS ((tree
));
1333 static rtx c_expand_builtin
PARAMS ((tree
, rtx
, enum machine_mode
, enum expand_modifier
));
1334 static rtx c_expand_builtin_printf
PARAMS ((tree
, rtx
, enum machine_mode
,
1335 enum expand_modifier
, int, int));
1336 static rtx c_expand_builtin_fprintf
PARAMS ((tree
, rtx
, enum machine_mode
,
1337 enum expand_modifier
, int, int));
1339 /* Print a warning if a constant expression had overflow in folding.
1340 Invoke this function on every expression that the language
1341 requires to be a constant expression.
1342 Note the ANSI C standard says it is erroneous for a
1343 constant expression to overflow. */
1346 constant_expression_warning (value
)
1349 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1350 || TREE_CODE (value
) == VECTOR_CST
1351 || TREE_CODE (value
) == COMPLEX_CST
)
1352 && TREE_CONSTANT_OVERFLOW (value
) && pedantic
)
1353 pedwarn ("overflow in constant expression");
1356 /* Print a warning if an expression had overflow in folding.
1357 Invoke this function on every expression that
1358 (1) appears in the source code, and
1359 (2) might be a constant expression that overflowed, and
1360 (3) is not already checked by convert_and_check;
1361 however, do not invoke this function on operands of explicit casts. */
1364 overflow_warning (value
)
1367 if ((TREE_CODE (value
) == INTEGER_CST
1368 || (TREE_CODE (value
) == COMPLEX_CST
1369 && TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
))
1370 && TREE_OVERFLOW (value
))
1372 TREE_OVERFLOW (value
) = 0;
1373 if (skip_evaluation
== 0)
1374 warning ("integer overflow in expression");
1376 else if ((TREE_CODE (value
) == REAL_CST
1377 || (TREE_CODE (value
) == COMPLEX_CST
1378 && TREE_CODE (TREE_REALPART (value
)) == REAL_CST
))
1379 && TREE_OVERFLOW (value
))
1381 TREE_OVERFLOW (value
) = 0;
1382 if (skip_evaluation
== 0)
1383 warning ("floating point overflow in expression");
1385 else if (TREE_CODE (value
) == VECTOR_CST
&& TREE_OVERFLOW (value
))
1387 TREE_OVERFLOW (value
) = 0;
1388 if (skip_evaluation
== 0)
1389 warning ("vector overflow in expression");
1393 /* Print a warning if a large constant is truncated to unsigned,
1394 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1395 Invoke this function on every expression that might be implicitly
1396 converted to an unsigned type. */
1399 unsigned_conversion_warning (result
, operand
)
1400 tree result
, operand
;
1402 tree type
= TREE_TYPE (result
);
1404 if (TREE_CODE (operand
) == INTEGER_CST
1405 && TREE_CODE (type
) == INTEGER_TYPE
1406 && TREE_UNSIGNED (type
)
1407 && skip_evaluation
== 0
1408 && !int_fits_type_p (operand
, type
))
1410 if (!int_fits_type_p (operand
, c_common_signed_type (type
)))
1411 /* This detects cases like converting -129 or 256 to unsigned char. */
1412 warning ("large integer implicitly truncated to unsigned type");
1413 else if (warn_conversion
)
1414 warning ("negative integer implicitly converted to unsigned type");
1418 /* Nonzero if constant C has a value that is permissible
1419 for type TYPE (an INTEGER_TYPE). */
1422 constant_fits_type_p (c
, type
)
1425 if (TREE_CODE (c
) == INTEGER_CST
)
1426 return int_fits_type_p (c
, type
);
1428 c
= convert (type
, c
);
1429 return !TREE_OVERFLOW (c
);
1432 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1433 Invoke this function on every expression that is converted implicitly,
1434 i.e. because of language rules and not because of an explicit cast. */
1437 convert_and_check (type
, expr
)
1440 tree t
= convert (type
, expr
);
1441 if (TREE_CODE (t
) == INTEGER_CST
)
1443 if (TREE_OVERFLOW (t
))
1445 TREE_OVERFLOW (t
) = 0;
1447 /* Do not diagnose overflow in a constant expression merely
1448 because a conversion overflowed. */
1449 TREE_CONSTANT_OVERFLOW (t
) = TREE_CONSTANT_OVERFLOW (expr
);
1451 /* No warning for converting 0x80000000 to int. */
1452 if (!(TREE_UNSIGNED (type
) < TREE_UNSIGNED (TREE_TYPE (expr
))
1453 && TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1454 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (expr
))))
1455 /* If EXPR fits in the unsigned version of TYPE,
1456 don't warn unless pedantic. */
1458 || TREE_UNSIGNED (type
)
1459 || ! constant_fits_type_p (expr
,
1460 c_common_unsigned_type (type
)))
1461 && skip_evaluation
== 0)
1462 warning ("overflow in implicit constant conversion");
1465 unsigned_conversion_warning (t
, expr
);
1470 /* A node in a list that describes references to variables (EXPR), which are
1471 either read accesses if WRITER is zero, or write accesses, in which case
1472 WRITER is the parent of EXPR. */
1479 /* Used to implement a cache the results of a call to verify_tree. We only
1480 use this for SAVE_EXPRs. */
1483 struct tlist_cache
*next
;
1484 struct tlist
*cache_before_sp
;
1485 struct tlist
*cache_after_sp
;
1489 /* Obstack to use when allocating tlist structures, and corresponding
1491 static struct obstack tlist_obstack
;
1492 static char *tlist_firstobj
= 0;
1494 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1496 static struct tlist
*warned_ids
;
1497 /* SAVE_EXPRs need special treatment. We process them only once and then
1498 cache the results. */
1499 static struct tlist_cache
*save_expr_cache
;
1501 static void add_tlist
PARAMS ((struct tlist
**, struct tlist
*, tree
, int));
1502 static void merge_tlist
PARAMS ((struct tlist
**, struct tlist
*, int));
1503 static void verify_tree
PARAMS ((tree
, struct tlist
**, struct tlist
**, tree
));
1504 static int warning_candidate_p
PARAMS ((tree
));
1505 static void warn_for_collisions
PARAMS ((struct tlist
*));
1506 static void warn_for_collisions_1
PARAMS ((tree
, tree
, struct tlist
*, int));
1507 static struct tlist
*new_tlist
PARAMS ((struct tlist
*, tree
, tree
));
1508 static void verify_sequence_points
PARAMS ((tree
));
1510 /* Create a new struct tlist and fill in its fields. */
1511 static struct tlist
*
1512 new_tlist (next
, t
, writer
)
1518 l
= (struct tlist
*) obstack_alloc (&tlist_obstack
, sizeof *l
);
1525 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1526 is nonnull, we ignore any node we find which has a writer equal to it. */
1529 add_tlist (to
, add
, exclude_writer
, copy
)
1532 tree exclude_writer
;
1537 struct tlist
*next
= add
->next
;
1540 if (! exclude_writer
|| add
->writer
!= exclude_writer
)
1541 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1546 /* Merge the nodes of ADD into TO. This merging process is done so that for
1547 each variable that already exists in TO, no new node is added; however if
1548 there is a write access recorded in ADD, and an occurrence on TO is only
1549 a read access, then the occurrence in TO will be modified to record the
1553 merge_tlist (to
, add
, copy
)
1558 struct tlist
**end
= to
;
1561 end
= &(*end
)->next
;
1567 struct tlist
*next
= add
->next
;
1569 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1570 if (tmp2
->expr
== add
->expr
)
1574 tmp2
->writer
= add
->writer
;
1578 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
1579 end
= &(*end
)->next
;
1586 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1587 references in list LIST conflict with it, excluding reads if ONLY writers
1591 warn_for_collisions_1 (written
, writer
, list
, only_writes
)
1592 tree written
, writer
;
1598 /* Avoid duplicate warnings. */
1599 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1600 if (tmp
->expr
== written
)
1605 if (list
->expr
== written
1606 && list
->writer
!= writer
1607 && (! only_writes
|| list
->writer
))
1609 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1610 warning ("operation on `%s' may be undefined",
1611 IDENTIFIER_POINTER (DECL_NAME (list
->expr
)));
1617 /* Given a list LIST of references to variables, find whether any of these
1618 can cause conflicts due to missing sequence points. */
1621 warn_for_collisions (list
)
1626 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1629 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1633 /* Return nonzero if X is a tree that can be verified by the sequence point
1636 warning_candidate_p (x
)
1639 return TREE_CODE (x
) == VAR_DECL
|| TREE_CODE (x
) == PARM_DECL
;
1642 /* Walk the tree X, and record accesses to variables. If X is written by the
1643 parent tree, WRITER is the parent.
1644 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1645 expression or its only operand forces a sequence point, then everything up
1646 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1648 Once we return, we will have emitted warnings if any subexpression before
1649 such a sequence point could be undefined. On a higher level, however, the
1650 sequence point may not be relevant, and we'll merge the two lists.
1652 Example: (b++, a) + b;
1653 The call that processes the COMPOUND_EXPR will store the increment of B
1654 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1655 processes the PLUS_EXPR will need to merge the two lists so that
1656 eventually, all accesses end up on the same list (and we'll warn about the
1657 unordered subexpressions b++ and b.
1659 A note on merging. If we modify the former example so that our expression
1662 care must be taken not simply to add all three expressions into the final
1663 PNO_SP list. The function merge_tlist takes care of that by merging the
1664 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1665 way, so that no more than one access to B is recorded. */
1668 verify_tree (x
, pbefore_sp
, pno_sp
, writer
)
1670 struct tlist
**pbefore_sp
, **pno_sp
;
1673 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1674 enum tree_code code
;
1677 /* X may be NULL if it is the operand of an empty statement expression
1683 code
= TREE_CODE (x
);
1684 class = TREE_CODE_CLASS (code
);
1686 if (warning_candidate_p (x
))
1688 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
1698 case TRUTH_ANDIF_EXPR
:
1699 case TRUTH_ORIF_EXPR
:
1700 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1701 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1702 warn_for_collisions (tmp_nosp
);
1703 merge_tlist (pbefore_sp
, tmp_before
, 0);
1704 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
1705 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
1706 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1710 tmp_before
= tmp_list2
= 0;
1711 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
1712 warn_for_collisions (tmp_list2
);
1713 merge_tlist (pbefore_sp
, tmp_before
, 0);
1714 merge_tlist (pbefore_sp
, tmp_list2
, 1);
1716 tmp_list3
= tmp_nosp
= 0;
1717 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
1718 warn_for_collisions (tmp_nosp
);
1719 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1721 tmp_list3
= tmp_list2
= 0;
1722 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1723 warn_for_collisions (tmp_list2
);
1724 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1725 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1726 two first, to avoid warning for (a ? b++ : b++). */
1727 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
1728 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1731 case PREDECREMENT_EXPR
:
1732 case PREINCREMENT_EXPR
:
1733 case POSTDECREMENT_EXPR
:
1734 case POSTINCREMENT_EXPR
:
1735 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
1739 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1740 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1741 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
1742 /* Expressions inside the LHS are not ordered wrt. the sequence points
1743 in the RHS. Example:
1745 Despite the fact that the modification of "a" is in the before_sp
1746 list (tmp_before), it conflicts with the use of "a" in the LHS.
1747 We can handle this by adding the contents of tmp_list3
1748 to those of tmp_before, and redoing the collision warnings for that
1750 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
1751 warn_for_collisions (tmp_before
);
1752 /* Exclude the LHS itself here; we first have to merge it into the
1753 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1754 didn't exclude the LHS, we'd get it twice, once as a read and once
1756 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1757 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
1759 merge_tlist (pbefore_sp
, tmp_before
, 0);
1760 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
1761 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
1762 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
1766 /* We need to warn about conflicts among arguments and conflicts between
1767 args and the function address. Side effects of the function address,
1768 however, are not ordered by the sequence point of the call. */
1769 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
1770 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1771 if (TREE_OPERAND (x
, 1))
1772 verify_tree (TREE_OPERAND (x
, 1), &tmp_list2
, &tmp_list3
, NULL_TREE
);
1773 merge_tlist (&tmp_list3
, tmp_list2
, 0);
1774 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
1775 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
1776 warn_for_collisions (tmp_before
);
1777 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
1781 /* Scan all the list, e.g. indices of multi dimensional array. */
1784 tmp_before
= tmp_nosp
= 0;
1785 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1786 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1787 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1794 struct tlist_cache
*t
;
1795 for (t
= save_expr_cache
; t
; t
= t
->next
)
1801 t
= (struct tlist_cache
*) obstack_alloc (&tlist_obstack
,
1803 t
->next
= save_expr_cache
;
1805 save_expr_cache
= t
;
1807 tmp_before
= tmp_nosp
= 0;
1808 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1809 warn_for_collisions (tmp_nosp
);
1814 struct tlist
*t
= tmp_nosp
;
1816 merge_tlist (&tmp_list3
, t
, 0);
1818 t
->cache_before_sp
= tmp_before
;
1819 t
->cache_after_sp
= tmp_list3
;
1821 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1822 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1831 if (first_rtl_op (code
) == 0)
1833 x
= TREE_OPERAND (x
, 0);
1849 int max
= first_rtl_op (TREE_CODE (x
));
1850 for (lp
= 0; lp
< max
; lp
++)
1852 tmp_before
= tmp_nosp
= 0;
1853 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1854 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1855 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1862 /* Try to warn for undefined behavior in EXPR due to missing sequence
1866 verify_sequence_points (expr
)
1869 struct tlist
*before_sp
= 0, *after_sp
= 0;
1872 save_expr_cache
= 0;
1873 if (tlist_firstobj
== 0)
1875 gcc_obstack_init (&tlist_obstack
);
1876 tlist_firstobj
= obstack_alloc (&tlist_obstack
, 0);
1879 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1880 warn_for_collisions (after_sp
);
1881 obstack_free (&tlist_obstack
, tlist_firstobj
);
1885 c_expand_expr_stmt (expr
)
1888 /* Do default conversion if safe and possibly important,
1889 in case within ({...}). */
1890 if ((TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
1891 && (flag_isoc99
|| lvalue_p (expr
)))
1892 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
)
1893 expr
= default_conversion (expr
);
1895 if (warn_sequence_point
)
1896 verify_sequence_points (expr
);
1898 if (TREE_TYPE (expr
) != error_mark_node
1899 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr
))
1900 && TREE_CODE (TREE_TYPE (expr
)) != ARRAY_TYPE
)
1901 error ("expression statement has incomplete type");
1903 last_expr_type
= TREE_TYPE (expr
);
1904 return add_stmt (build_stmt (EXPR_STMT
, expr
));
1907 /* Validate the expression after `case' and apply default promotions. */
1910 check_case_value (value
)
1913 if (value
== NULL_TREE
)
1916 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1917 STRIP_TYPE_NOPS (value
);
1918 /* In C++, the following is allowed:
1921 switch (...) { case i: ... }
1923 So, we try to reduce the VALUE to a constant that way. */
1924 if (c_language
== clk_cplusplus
)
1926 value
= decl_constant_value (value
);
1927 STRIP_TYPE_NOPS (value
);
1928 value
= fold (value
);
1931 if (TREE_CODE (value
) != INTEGER_CST
1932 && value
!= error_mark_node
)
1934 error ("case label does not reduce to an integer constant");
1935 value
= error_mark_node
;
1938 /* Promote char or short to int. */
1939 value
= default_conversion (value
);
1941 constant_expression_warning (value
);
1946 /* Return an integer type with BITS bits of precision,
1947 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1950 c_common_type_for_size (bits
, unsignedp
)
1954 if (bits
== TYPE_PRECISION (integer_type_node
))
1955 return unsignedp
? unsigned_type_node
: integer_type_node
;
1957 if (bits
== TYPE_PRECISION (signed_char_type_node
))
1958 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1960 if (bits
== TYPE_PRECISION (short_integer_type_node
))
1961 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1963 if (bits
== TYPE_PRECISION (long_integer_type_node
))
1964 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1966 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
1967 return (unsignedp
? long_long_unsigned_type_node
1968 : long_long_integer_type_node
);
1970 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
1971 return (unsignedp
? widest_unsigned_literal_type_node
1972 : widest_integer_literal_type_node
);
1974 if (bits
<= TYPE_PRECISION (intQI_type_node
))
1975 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1977 if (bits
<= TYPE_PRECISION (intHI_type_node
))
1978 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1980 if (bits
<= TYPE_PRECISION (intSI_type_node
))
1981 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1983 if (bits
<= TYPE_PRECISION (intDI_type_node
))
1984 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1989 /* Return a data type that has machine mode MODE.
1990 If the mode is an integer,
1991 then UNSIGNEDP selects between signed and unsigned types. */
1994 c_common_type_for_mode (mode
, unsignedp
)
1995 enum machine_mode mode
;
1998 if (mode
== TYPE_MODE (integer_type_node
))
1999 return unsignedp
? unsigned_type_node
: integer_type_node
;
2001 if (mode
== TYPE_MODE (signed_char_type_node
))
2002 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2004 if (mode
== TYPE_MODE (short_integer_type_node
))
2005 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2007 if (mode
== TYPE_MODE (long_integer_type_node
))
2008 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2010 if (mode
== TYPE_MODE (long_long_integer_type_node
))
2011 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2013 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
2014 return unsignedp
? widest_unsigned_literal_type_node
2015 : widest_integer_literal_type_node
;
2018 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2021 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2024 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2027 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2029 #if HOST_BITS_PER_WIDE_INT >= 64
2030 if (mode
== TYPE_MODE (intTI_type_node
))
2031 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2034 if (mode
== TYPE_MODE (float_type_node
))
2035 return float_type_node
;
2037 if (mode
== TYPE_MODE (double_type_node
))
2038 return double_type_node
;
2040 if (mode
== TYPE_MODE (long_double_type_node
))
2041 return long_double_type_node
;
2043 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
2044 return build_pointer_type (char_type_node
);
2046 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
2047 return build_pointer_type (integer_type_node
);
2052 return unsignedp
? unsigned_V16QI_type_node
: V16QI_type_node
;
2054 return unsignedp
? unsigned_V8HI_type_node
: V8HI_type_node
;
2056 return unsignedp
? unsigned_V4SI_type_node
: V4SI_type_node
;
2058 return unsignedp
? unsigned_V2DI_type_node
: V2DI_type_node
;
2060 return unsignedp
? unsigned_V2SI_type_node
: V2SI_type_node
;
2062 return unsignedp
? unsigned_V2HI_type_node
: V2HI_type_node
;
2064 return unsignedp
? unsigned_V4HI_type_node
: V4HI_type_node
;
2066 return unsignedp
? unsigned_V8QI_type_node
: V8QI_type_node
;
2068 return unsignedp
? unsigned_V1DI_type_node
: V1DI_type_node
;
2070 return V16SF_type_node
;
2072 return V4SF_type_node
;
2074 return V2SF_type_node
;
2076 return V2DF_type_node
;
2084 /* Return an unsigned type the same as TYPE in other respects. */
2086 c_common_unsigned_type (type
)
2089 tree type1
= TYPE_MAIN_VARIANT (type
);
2090 if (type1
== signed_char_type_node
|| type1
== char_type_node
)
2091 return unsigned_char_type_node
;
2092 if (type1
== integer_type_node
)
2093 return unsigned_type_node
;
2094 if (type1
== short_integer_type_node
)
2095 return short_unsigned_type_node
;
2096 if (type1
== long_integer_type_node
)
2097 return long_unsigned_type_node
;
2098 if (type1
== long_long_integer_type_node
)
2099 return long_long_unsigned_type_node
;
2100 if (type1
== widest_integer_literal_type_node
)
2101 return widest_unsigned_literal_type_node
;
2102 #if HOST_BITS_PER_WIDE_INT >= 64
2103 if (type1
== intTI_type_node
)
2104 return unsigned_intTI_type_node
;
2106 if (type1
== intDI_type_node
)
2107 return unsigned_intDI_type_node
;
2108 if (type1
== intSI_type_node
)
2109 return unsigned_intSI_type_node
;
2110 if (type1
== intHI_type_node
)
2111 return unsigned_intHI_type_node
;
2112 if (type1
== intQI_type_node
)
2113 return unsigned_intQI_type_node
;
2115 return c_common_signed_or_unsigned_type (1, type
);
2118 /* Return a signed type the same as TYPE in other respects. */
2121 c_common_signed_type (type
)
2124 tree type1
= TYPE_MAIN_VARIANT (type
);
2125 if (type1
== unsigned_char_type_node
|| type1
== char_type_node
)
2126 return signed_char_type_node
;
2127 if (type1
== unsigned_type_node
)
2128 return integer_type_node
;
2129 if (type1
== short_unsigned_type_node
)
2130 return short_integer_type_node
;
2131 if (type1
== long_unsigned_type_node
)
2132 return long_integer_type_node
;
2133 if (type1
== long_long_unsigned_type_node
)
2134 return long_long_integer_type_node
;
2135 if (type1
== widest_unsigned_literal_type_node
)
2136 return widest_integer_literal_type_node
;
2137 #if HOST_BITS_PER_WIDE_INT >= 64
2138 if (type1
== unsigned_intTI_type_node
)
2139 return intTI_type_node
;
2141 if (type1
== unsigned_intDI_type_node
)
2142 return intDI_type_node
;
2143 if (type1
== unsigned_intSI_type_node
)
2144 return intSI_type_node
;
2145 if (type1
== unsigned_intHI_type_node
)
2146 return intHI_type_node
;
2147 if (type1
== unsigned_intQI_type_node
)
2148 return intQI_type_node
;
2150 return c_common_signed_or_unsigned_type (0, type
);
2153 /* Return a type the same as TYPE except unsigned or
2154 signed according to UNSIGNEDP. */
2157 c_common_signed_or_unsigned_type (unsignedp
, type
)
2161 if (! INTEGRAL_TYPE_P (type
)
2162 || TREE_UNSIGNED (type
) == unsignedp
)
2165 if (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
))
2166 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2167 if (TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
))
2168 return unsignedp
? unsigned_type_node
: integer_type_node
;
2169 if (TYPE_PRECISION (type
) == TYPE_PRECISION (short_integer_type_node
))
2170 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2171 if (TYPE_PRECISION (type
) == TYPE_PRECISION (long_integer_type_node
))
2172 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2173 if (TYPE_PRECISION (type
) == TYPE_PRECISION (long_long_integer_type_node
))
2174 return (unsignedp
? long_long_unsigned_type_node
2175 : long_long_integer_type_node
);
2176 if (TYPE_PRECISION (type
) == TYPE_PRECISION (widest_integer_literal_type_node
))
2177 return (unsignedp
? widest_unsigned_literal_type_node
2178 : widest_integer_literal_type_node
);
2180 #if HOST_BITS_PER_WIDE_INT >= 64
2181 if (TYPE_PRECISION (type
) == TYPE_PRECISION (intTI_type_node
))
2182 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2184 if (TYPE_PRECISION (type
) == TYPE_PRECISION (intDI_type_node
))
2185 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2186 if (TYPE_PRECISION (type
) == TYPE_PRECISION (intSI_type_node
))
2187 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2188 if (TYPE_PRECISION (type
) == TYPE_PRECISION (intHI_type_node
))
2189 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2190 if (TYPE_PRECISION (type
) == TYPE_PRECISION (intQI_type_node
))
2191 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2196 /* Return the minimum number of bits needed to represent VALUE in a
2197 signed or unsigned type, UNSIGNEDP says which. */
2200 min_precision (value
, unsignedp
)
2206 /* If the value is negative, compute its negative minus 1. The latter
2207 adjustment is because the absolute value of the largest negative value
2208 is one larger than the largest positive value. This is equivalent to
2209 a bit-wise negation, so use that operation instead. */
2211 if (tree_int_cst_sgn (value
) < 0)
2212 value
= fold (build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
));
2214 /* Return the number of bits needed, taking into account the fact
2215 that we need one more bit for a signed than unsigned type. */
2217 if (integer_zerop (value
))
2220 log
= tree_floor_log2 (value
);
2222 return log
+ 1 + ! unsignedp
;
2225 /* Print an error message for invalid operands to arith operation
2226 CODE. NOP_EXPR is used as a special case (see
2227 c_common_truthvalue_conversion). */
2230 binary_op_error (code
)
2231 enum tree_code code
;
2238 error ("invalid truth-value expression");
2242 opname
= "+"; break;
2244 opname
= "-"; break;
2246 opname
= "*"; break;
2248 opname
= "max"; break;
2250 opname
= "min"; break;
2252 opname
= "=="; break;
2254 opname
= "!="; break;
2256 opname
= "<="; break;
2258 opname
= ">="; break;
2260 opname
= "<"; break;
2262 opname
= ">"; break;
2264 opname
= "<<"; break;
2266 opname
= ">>"; break;
2267 case TRUNC_MOD_EXPR
:
2268 case FLOOR_MOD_EXPR
:
2269 opname
= "%"; break;
2270 case TRUNC_DIV_EXPR
:
2271 case FLOOR_DIV_EXPR
:
2272 opname
= "/"; break;
2274 opname
= "&"; break;
2276 opname
= "|"; break;
2277 case TRUTH_ANDIF_EXPR
:
2278 opname
= "&&"; break;
2279 case TRUTH_ORIF_EXPR
:
2280 opname
= "||"; break;
2282 opname
= "^"; break;
2285 opname
= "rotate"; break;
2287 opname
= "unknown"; break;
2289 error ("invalid operands to binary %s", opname
);
2292 /* Subroutine of build_binary_op, used for comparison operations.
2293 See if the operands have both been converted from subword integer types
2294 and, if so, perhaps change them both back to their original type.
2295 This function is also responsible for converting the two operands
2296 to the proper common type for comparison.
2298 The arguments of this function are all pointers to local variables
2299 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2300 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2302 If this function returns nonzero, it means that the comparison has
2303 a constant value. What this function returns is an expression for
2307 shorten_compare (op0_ptr
, op1_ptr
, restype_ptr
, rescode_ptr
)
2308 tree
*op0_ptr
, *op1_ptr
;
2310 enum tree_code
*rescode_ptr
;
2313 tree op0
= *op0_ptr
;
2314 tree op1
= *op1_ptr
;
2315 int unsignedp0
, unsignedp1
;
2317 tree primop0
, primop1
;
2318 enum tree_code code
= *rescode_ptr
;
2320 /* Throw away any conversions to wider types
2321 already present in the operands. */
2323 primop0
= get_narrower (op0
, &unsignedp0
);
2324 primop1
= get_narrower (op1
, &unsignedp1
);
2326 /* Handle the case that OP0 does not *contain* a conversion
2327 but it *requires* conversion to FINAL_TYPE. */
2329 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
2330 unsignedp0
= TREE_UNSIGNED (TREE_TYPE (op0
));
2331 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
2332 unsignedp1
= TREE_UNSIGNED (TREE_TYPE (op1
));
2334 /* If one of the operands must be floated, we cannot optimize. */
2335 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
2336 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
2338 /* If first arg is constant, swap the args (changing operation
2339 so value is preserved), for canonicalization. Don't do this if
2340 the second arg is 0. */
2342 if (TREE_CONSTANT (primop0
)
2343 && ! integer_zerop (primop1
) && ! real_zerop (primop1
))
2346 int temi
= unsignedp0
;
2354 unsignedp0
= unsignedp1
;
2377 *rescode_ptr
= code
;
2380 /* If comparing an integer against a constant more bits wide,
2381 maybe we can deduce a value of 1 or 0 independent of the data.
2382 Or else truncate the constant now
2383 rather than extend the variable at run time.
2385 This is only interesting if the constant is the wider arg.
2386 Also, it is not safe if the constant is unsigned and the
2387 variable arg is signed, since in this case the variable
2388 would be sign-extended and then regarded as unsigned.
2389 Our technique fails in this case because the lowest/highest
2390 possible unsigned results don't follow naturally from the
2391 lowest/highest possible values of the variable operand.
2392 For just EQ_EXPR and NE_EXPR there is another technique that
2393 could be used: see if the constant can be faithfully represented
2394 in the other operand's type, by truncating it and reextending it
2395 and see if that preserves the constant's value. */
2397 if (!real1
&& !real2
2398 && TREE_CODE (primop1
) == INTEGER_CST
2399 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
2401 int min_gt
, max_gt
, min_lt
, max_lt
;
2402 tree maxval
, minval
;
2403 /* 1 if comparison is nominally unsigned. */
2404 int unsignedp
= TREE_UNSIGNED (*restype_ptr
);
2407 type
= c_common_signed_or_unsigned_type (unsignedp0
,
2408 TREE_TYPE (primop0
));
2410 /* If TYPE is an enumeration, then we need to get its min/max
2411 values from it's underlying integral type, not the enumerated
2413 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
2414 type
= c_common_type_for_size (TYPE_PRECISION (type
), unsignedp0
);
2416 maxval
= TYPE_MAX_VALUE (type
);
2417 minval
= TYPE_MIN_VALUE (type
);
2419 if (unsignedp
&& !unsignedp0
)
2420 *restype_ptr
= c_common_signed_type (*restype_ptr
);
2422 if (TREE_TYPE (primop1
) != *restype_ptr
)
2423 primop1
= convert (*restype_ptr
, primop1
);
2424 if (type
!= *restype_ptr
)
2426 minval
= convert (*restype_ptr
, minval
);
2427 maxval
= convert (*restype_ptr
, maxval
);
2430 if (unsignedp
&& unsignedp0
)
2432 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
2433 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
2434 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
2435 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
2439 min_gt
= INT_CST_LT (primop1
, minval
);
2440 max_gt
= INT_CST_LT (primop1
, maxval
);
2441 min_lt
= INT_CST_LT (minval
, primop1
);
2442 max_lt
= INT_CST_LT (maxval
, primop1
);
2446 /* This used to be a switch, but Genix compiler can't handle that. */
2447 if (code
== NE_EXPR
)
2449 if (max_lt
|| min_gt
)
2450 val
= boolean_true_node
;
2452 else if (code
== EQ_EXPR
)
2454 if (max_lt
|| min_gt
)
2455 val
= boolean_false_node
;
2457 else if (code
== LT_EXPR
)
2460 val
= boolean_true_node
;
2462 val
= boolean_false_node
;
2464 else if (code
== GT_EXPR
)
2467 val
= boolean_true_node
;
2469 val
= boolean_false_node
;
2471 else if (code
== LE_EXPR
)
2474 val
= boolean_true_node
;
2476 val
= boolean_false_node
;
2478 else if (code
== GE_EXPR
)
2481 val
= boolean_true_node
;
2483 val
= boolean_false_node
;
2486 /* If primop0 was sign-extended and unsigned comparison specd,
2487 we did a signed comparison above using the signed type bounds.
2488 But the comparison we output must be unsigned.
2490 Also, for inequalities, VAL is no good; but if the signed
2491 comparison had *any* fixed result, it follows that the
2492 unsigned comparison just tests the sign in reverse
2493 (positive values are LE, negative ones GE).
2494 So we can generate an unsigned comparison
2495 against an extreme value of the signed type. */
2497 if (unsignedp
&& !unsignedp0
)
2504 primop1
= TYPE_MIN_VALUE (type
);
2510 primop1
= TYPE_MAX_VALUE (type
);
2517 type
= c_common_unsigned_type (type
);
2520 if (TREE_CODE (primop0
) != INTEGER_CST
)
2522 if (val
== boolean_false_node
)
2523 warning ("comparison is always false due to limited range of data type");
2524 if (val
== boolean_true_node
)
2525 warning ("comparison is always true due to limited range of data type");
2530 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2531 if (TREE_SIDE_EFFECTS (primop0
))
2532 return build (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
2536 /* Value is not predetermined, but do the comparison
2537 in the type of the operand that is not constant.
2538 TYPE is already properly set. */
2540 else if (real1
&& real2
2541 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2542 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2543 type
= TREE_TYPE (primop0
);
2545 /* If args' natural types are both narrower than nominal type
2546 and both extend in the same manner, compare them
2547 in the type of the wider arg.
2548 Otherwise must actually extend both to the nominal
2549 common type lest different ways of extending
2551 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2553 else if (unsignedp0
== unsignedp1
&& real1
== real2
2554 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
2555 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
2557 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2558 type
= c_common_signed_or_unsigned_type (unsignedp0
2559 || TREE_UNSIGNED (*restype_ptr
),
2561 /* Make sure shorter operand is extended the right way
2562 to match the longer operand. */
2564 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
2565 TREE_TYPE (primop0
)),
2568 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
2569 TREE_TYPE (primop1
)),
2574 /* Here we must do the comparison on the nominal type
2575 using the args exactly as we received them. */
2576 type
= *restype_ptr
;
2580 if (!real1
&& !real2
&& integer_zerop (primop1
)
2581 && TREE_UNSIGNED (*restype_ptr
))
2587 /* All unsigned values are >= 0, so we warn if extra warnings
2588 are requested. However, if OP0 is a constant that is
2589 >= 0, the signedness of the comparison isn't an issue,
2590 so suppress the warning. */
2591 if (extra_warnings
&& !in_system_header
2592 && ! (TREE_CODE (primop0
) == INTEGER_CST
2593 && ! TREE_OVERFLOW (convert (c_common_signed_type (type
),
2595 warning ("comparison of unsigned expression >= 0 is always true");
2596 value
= boolean_true_node
;
2600 if (extra_warnings
&& !in_system_header
2601 && ! (TREE_CODE (primop0
) == INTEGER_CST
2602 && ! TREE_OVERFLOW (convert (c_common_signed_type (type
),
2604 warning ("comparison of unsigned expression < 0 is always false");
2605 value
= boolean_false_node
;
2614 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2615 if (TREE_SIDE_EFFECTS (primop0
))
2616 return build (COMPOUND_EXPR
, TREE_TYPE (value
),
2623 *op0_ptr
= convert (type
, primop0
);
2624 *op1_ptr
= convert (type
, primop1
);
2626 *restype_ptr
= boolean_type_node
;
2631 /* Return a tree for the sum or difference (RESULTCODE says which)
2632 of pointer PTROP and integer INTOP. */
2635 pointer_int_sum (resultcode
, ptrop
, intop
)
2636 enum tree_code resultcode
;
2644 /* The result is a pointer of the same type that is being added. */
2646 tree result_type
= TREE_TYPE (ptrop
);
2648 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2650 if (pedantic
|| warn_pointer_arith
)
2651 pedwarn ("pointer of type `void *' used in arithmetic");
2652 size_exp
= integer_one_node
;
2654 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2656 if (pedantic
|| warn_pointer_arith
)
2657 pedwarn ("pointer to a function used in arithmetic");
2658 size_exp
= integer_one_node
;
2660 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
2662 if (pedantic
|| warn_pointer_arith
)
2663 pedwarn ("pointer to member function used in arithmetic");
2664 size_exp
= integer_one_node
;
2666 else if (TREE_CODE (TREE_TYPE (result_type
)) == OFFSET_TYPE
)
2668 if (pedantic
|| warn_pointer_arith
)
2669 pedwarn ("pointer to a member used in arithmetic");
2670 size_exp
= integer_one_node
;
2673 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
2675 /* If what we are about to multiply by the size of the elements
2676 contains a constant term, apply distributive law
2677 and multiply that constant term separately.
2678 This helps produce common subexpressions. */
2680 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
2681 && ! TREE_CONSTANT (intop
)
2682 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
2683 && TREE_CONSTANT (size_exp
)
2684 /* If the constant comes from pointer subtraction,
2685 skip this optimization--it would cause an error. */
2686 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
2687 /* If the constant is unsigned, and smaller than the pointer size,
2688 then we must skip this optimization. This is because it could cause
2689 an overflow error if the constant is negative but INTOP is not. */
2690 && (! TREE_UNSIGNED (TREE_TYPE (intop
))
2691 || (TYPE_PRECISION (TREE_TYPE (intop
))
2692 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
2694 enum tree_code subcode
= resultcode
;
2695 tree int_type
= TREE_TYPE (intop
);
2696 if (TREE_CODE (intop
) == MINUS_EXPR
)
2697 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
2698 /* Convert both subexpression types to the type of intop,
2699 because weird cases involving pointer arithmetic
2700 can result in a sum or difference with different type args. */
2701 ptrop
= build_binary_op (subcode
, ptrop
,
2702 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
2703 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
2706 /* Convert the integer argument to a type the same size as sizetype
2707 so the multiply won't overflow spuriously. */
2709 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
2710 || TREE_UNSIGNED (TREE_TYPE (intop
)) != TREE_UNSIGNED (sizetype
))
2711 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
2712 TREE_UNSIGNED (sizetype
)), intop
);
2714 /* Replace the integer argument with a suitable product by the object size.
2715 Do this multiplication as signed, then convert to the appropriate
2716 pointer type (actually unsigned integral). */
2718 intop
= convert (result_type
,
2719 build_binary_op (MULT_EXPR
, intop
,
2720 convert (TREE_TYPE (intop
), size_exp
), 1));
2722 /* Create the sum or difference. */
2724 result
= build (resultcode
, result_type
, ptrop
, intop
);
2726 folded
= fold (result
);
2727 if (folded
== result
)
2728 TREE_CONSTANT (folded
) = TREE_CONSTANT (ptrop
) & TREE_CONSTANT (intop
);
2732 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2733 or validate its data type for an `if' or `while' statement or ?..: exp.
2735 This preparation consists of taking the ordinary
2736 representation of an expression expr and producing a valid tree
2737 boolean expression describing whether expr is nonzero. We could
2738 simply always do build_binary_op (NE_EXPR, expr, boolean_false_node, 1),
2739 but we optimize comparisons, &&, ||, and !.
2741 The resulting type should always be `boolean_type_node'. */
2744 c_common_truthvalue_conversion (expr
)
2747 if (TREE_CODE (expr
) == ERROR_MARK
)
2750 #if 0 /* This appears to be wrong for C++. */
2751 /* These really should return error_mark_node after 2.4 is stable.
2752 But not all callers handle ERROR_MARK properly. */
2753 switch (TREE_CODE (TREE_TYPE (expr
)))
2756 error ("struct type value used where scalar is required");
2757 return boolean_false_node
;
2760 error ("union type value used where scalar is required");
2761 return boolean_false_node
;
2764 error ("array type value used where scalar is required");
2765 return boolean_false_node
;
2772 switch (TREE_CODE (expr
))
2775 case NE_EXPR
: case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2776 case TRUTH_ANDIF_EXPR
:
2777 case TRUTH_ORIF_EXPR
:
2778 case TRUTH_AND_EXPR
:
2780 case TRUTH_XOR_EXPR
:
2781 case TRUTH_NOT_EXPR
:
2782 TREE_TYPE (expr
) = boolean_type_node
;
2789 return integer_zerop (expr
) ? boolean_false_node
: boolean_true_node
;
2792 return real_zerop (expr
) ? boolean_false_node
: boolean_true_node
;
2795 /* If we are taking the address of an external decl, it might be zero
2796 if it is weak, so we cannot optimize. */
2797 if (DECL_P (TREE_OPERAND (expr
, 0))
2798 && DECL_EXTERNAL (TREE_OPERAND (expr
, 0)))
2801 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 0)))
2802 return build (COMPOUND_EXPR
, boolean_type_node
,
2803 TREE_OPERAND (expr
, 0), boolean_true_node
);
2805 return boolean_true_node
;
2808 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
2809 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2810 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2811 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2819 /* These don't change whether an object is nonzero or zero. */
2820 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2824 /* These don't change whether an object is zero or nonzero, but
2825 we can't ignore them if their second arg has side-effects. */
2826 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2827 return build (COMPOUND_EXPR
, boolean_type_node
, TREE_OPERAND (expr
, 1),
2828 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2830 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2833 /* Distribute the conversion into the arms of a COND_EXPR. */
2834 return fold (build (COND_EXPR
, boolean_type_node
, TREE_OPERAND (expr
, 0),
2835 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2836 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 2))));
2839 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2840 since that affects how `default_conversion' will behave. */
2841 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
2842 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2844 /* fall through... */
2846 /* If this is widening the argument, we can ignore it. */
2847 if (TYPE_PRECISION (TREE_TYPE (expr
))
2848 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2849 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2853 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2854 aren't guaranteed to the be same for modes that can represent
2855 infinity, since if x and y are both +infinity, or both
2856 -infinity, then x - y is not a number.
2858 Note that this transformation is safe when x or y is NaN.
2859 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2861 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
2863 /* fall through... */
2865 /* This and MINUS_EXPR can be changed into a comparison of the
2867 if (TREE_TYPE (TREE_OPERAND (expr
, 0))
2868 == TREE_TYPE (TREE_OPERAND (expr
, 1)))
2869 return build_binary_op (NE_EXPR
, TREE_OPERAND (expr
, 0),
2870 TREE_OPERAND (expr
, 1), 1);
2871 return build_binary_op (NE_EXPR
, TREE_OPERAND (expr
, 0),
2872 fold (build1 (NOP_EXPR
,
2873 TREE_TYPE (TREE_OPERAND (expr
, 0)),
2874 TREE_OPERAND (expr
, 1))), 1);
2877 if (integer_onep (TREE_OPERAND (expr
, 1))
2878 && TREE_TYPE (expr
) != boolean_type_node
)
2879 /* Using convert here would cause infinite recursion. */
2880 return build1 (NOP_EXPR
, boolean_type_node
, expr
);
2884 if (warn_parentheses
&& C_EXP_ORIGINAL_CODE (expr
) == MODIFY_EXPR
)
2885 warning ("suggest parentheses around assignment used as truth value");
2892 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
2894 tree t
= save_expr (expr
);
2895 return (build_binary_op
2896 ((TREE_SIDE_EFFECTS (expr
)
2897 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2898 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR
, t
, 0)),
2899 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR
, t
, 0)),
2903 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
2906 static tree builtin_function_2
PARAMS ((const char *, const char *, tree
, tree
,
2907 int, enum built_in_class
, int, int,
2910 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2911 down to the element type of an array. */
2914 c_build_qualified_type (type
, type_quals
)
2918 /* A restrict-qualified pointer type must be a pointer to object or
2919 incomplete type. Note that the use of POINTER_TYPE_P also allows
2920 REFERENCE_TYPEs, which is appropriate for C++. Unfortunately,
2921 the C++ front-end also use POINTER_TYPE for pointer-to-member
2922 values, so even though it should be illegal to use `restrict'
2923 with such an entity we don't flag that here. Thus, special case
2924 code for that case is required in the C++ front-end. */
2925 if ((type_quals
& TYPE_QUAL_RESTRICT
)
2926 && (!POINTER_TYPE_P (type
)
2927 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
))))
2929 error ("invalid use of `restrict'");
2930 type_quals
&= ~TYPE_QUAL_RESTRICT
;
2933 if (TREE_CODE (type
) == ARRAY_TYPE
)
2934 return build_array_type (c_build_qualified_type (TREE_TYPE (type
),
2936 TYPE_DOMAIN (type
));
2937 return build_qualified_type (type
, type_quals
);
2940 /* Apply the TYPE_QUALS to the new DECL. */
2943 c_apply_type_quals_to_decl (type_quals
, decl
)
2947 if ((type_quals
& TYPE_QUAL_CONST
)
2948 || (TREE_TYPE (decl
)
2949 && TREE_CODE (TREE_TYPE (decl
)) == REFERENCE_TYPE
))
2950 TREE_READONLY (decl
) = 1;
2951 if (type_quals
& TYPE_QUAL_VOLATILE
)
2953 TREE_SIDE_EFFECTS (decl
) = 1;
2954 TREE_THIS_VOLATILE (decl
) = 1;
2956 if (type_quals
& TYPE_QUAL_RESTRICT
)
2958 if (!TREE_TYPE (decl
)
2959 || !POINTER_TYPE_P (TREE_TYPE (decl
))
2960 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (TREE_TYPE (decl
))))
2961 error ("invalid use of `restrict'");
2962 else if (flag_strict_aliasing
)
2963 /* Indicate we need to make a unique alias set for this pointer.
2964 We can't do it here because it might be pointing to an
2966 DECL_POINTER_ALIAS_SET (decl
) = -2;
2970 /* Return the typed-based alias set for T, which may be an expression
2971 or a type. Return -1 if we don't do anything special. */
2974 c_common_get_alias_set (t
)
2979 /* Permit type-punning when accessing a union, provided the access
2980 is directly through the union. For example, this code does not
2981 permit taking the address of a union member and then storing
2982 through it. Even the type-punning allowed here is a GCC
2983 extension, albeit a common and useful one; the C standard says
2984 that such accesses have implementation-defined behavior. */
2986 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
2987 u
= TREE_OPERAND (u
, 0))
2988 if (TREE_CODE (u
) == COMPONENT_REF
2989 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
2992 /* That's all the expressions we handle specially. */
2996 /* The C standard guarantees that any object may be accessed via an
2997 lvalue that has character type. */
2998 if (t
== char_type_node
2999 || t
== signed_char_type_node
3000 || t
== unsigned_char_type_node
)
3003 /* If it has the may_alias attribute, it can alias anything. */
3004 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t
)))
3007 /* The C standard specifically allows aliasing between signed and
3008 unsigned variants of the same type. We treat the signed
3009 variant as canonical. */
3010 if (TREE_CODE (t
) == INTEGER_TYPE
&& TREE_UNSIGNED (t
))
3012 tree t1
= c_common_signed_type (t
);
3014 /* t1 == t can happen for boolean nodes which are always unsigned. */
3016 return get_alias_set (t1
);
3018 else if (POINTER_TYPE_P (t
))
3022 /* Unfortunately, there is no canonical form of a pointer type.
3023 In particular, if we have `typedef int I', then `int *', and
3024 `I *' are different types. So, we have to pick a canonical
3025 representative. We do this below.
3027 Technically, this approach is actually more conservative that
3028 it needs to be. In particular, `const int *' and `int *'
3029 should be in different alias sets, according to the C and C++
3030 standard, since their types are not the same, and so,
3031 technically, an `int **' and `const int **' cannot point at
3034 But, the standard is wrong. In particular, this code is
3039 const int* const* cipp = &ipp;
3041 And, it doesn't make sense for that to be legal unless you
3042 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
3043 the pointed-to types. This issue has been reported to the
3045 t1
= build_type_no_quals (t
);
3047 return get_alias_set (t1
);
3053 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3054 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3055 flag controls whether we should diagnose possibly ill-formed
3056 constructs or not. */
3058 c_sizeof_or_alignof_type (type
, op
, complain
)
3063 const char *op_name
;
3065 enum tree_code type_code
= TREE_CODE (type
);
3067 my_friendly_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
, 20020720);
3068 op_name
= op
== SIZEOF_EXPR
? "sizeof" : "__alignof__";
3070 if (type_code
== FUNCTION_TYPE
)
3072 if (op
== SIZEOF_EXPR
)
3074 if (complain
&& (pedantic
|| warn_pointer_arith
))
3075 pedwarn ("invalid application of `sizeof' to a function type");
3076 value
= size_one_node
;
3079 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
3081 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
3083 if (type_code
== VOID_TYPE
3084 && complain
&& (pedantic
|| warn_pointer_arith
))
3085 pedwarn ("invalid application of `%s' to a void type", op_name
);
3086 value
= size_one_node
;
3088 else if (!COMPLETE_TYPE_P (type
))
3091 error ("invalid application of `%s' to an incomplete type", op_name
);
3092 value
= size_zero_node
;
3096 if (op
== SIZEOF_EXPR
)
3097 /* Convert in case a char is more than one unit. */
3098 value
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
3099 size_int (TYPE_PRECISION (char_type_node
)
3102 value
= size_int (TYPE_ALIGN (type
) / BITS_PER_UNIT
);
3105 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3106 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3107 never happen. However, this node should really have type
3108 `size_t', which is just a typedef for an ordinary integer type. */
3109 value
= fold (build1 (NOP_EXPR
, size_type_node
, value
));
3110 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)), 20001021);
3115 /* Implement the __alignof keyword: Return the minimum required
3116 alignment of EXPR, measured in bytes. For VAR_DECL's and
3117 FIELD_DECL's return DECL_ALIGN (which can be set from an
3118 "aligned" __attribute__ specification). */
3121 c_alignof_expr (expr
)
3126 if (TREE_CODE (expr
) == VAR_DECL
)
3127 t
= size_int (DECL_ALIGN (expr
) / BITS_PER_UNIT
);
3129 else if (TREE_CODE (expr
) == COMPONENT_REF
3130 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
3132 error ("`__alignof' applied to a bit-field");
3135 else if (TREE_CODE (expr
) == COMPONENT_REF
3136 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
3137 t
= size_int (DECL_ALIGN (TREE_OPERAND (expr
, 1)) / BITS_PER_UNIT
);
3139 else if (TREE_CODE (expr
) == INDIRECT_REF
)
3141 tree t
= TREE_OPERAND (expr
, 0);
3143 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3145 while (TREE_CODE (t
) == NOP_EXPR
3146 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
3150 t
= TREE_OPERAND (t
, 0);
3151 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3152 if (thisalign
> bestalign
)
3153 best
= t
, bestalign
= thisalign
;
3155 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
3158 return c_alignof (TREE_TYPE (expr
));
3160 return fold (build1 (NOP_EXPR
, size_type_node
, t
));
3163 /* Handle C and C++ default attributes. */
3165 enum built_in_attribute
3167 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3168 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3169 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3170 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3171 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No entry needed in enum. */
3172 #include "builtin-attrs.def"
3173 #undef DEF_ATTR_NULL_TREE
3175 #undef DEF_ATTR_IDENT
3176 #undef DEF_ATTR_TREE_LIST
3181 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
3183 static bool c_attrs_initialized
= false;
3185 static void c_init_attributes
PARAMS ((void));
3187 /* Build tree nodes and builtin functions common to both C and C++ language
3191 c_common_nodes_and_builtins ()
3195 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3196 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3197 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3198 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3199 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3200 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3201 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3202 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3203 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3204 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3205 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3206 #include "builtin-types.def"
3207 #undef DEF_PRIMITIVE_TYPE
3208 #undef DEF_FUNCTION_TYPE_0
3209 #undef DEF_FUNCTION_TYPE_1
3210 #undef DEF_FUNCTION_TYPE_2
3211 #undef DEF_FUNCTION_TYPE_3
3212 #undef DEF_FUNCTION_TYPE_4
3213 #undef DEF_FUNCTION_TYPE_VAR_0
3214 #undef DEF_FUNCTION_TYPE_VAR_1
3215 #undef DEF_FUNCTION_TYPE_VAR_2
3216 #undef DEF_FUNCTION_TYPE_VAR_3
3217 #undef DEF_POINTER_TYPE
3221 typedef enum builtin_type builtin_type
;
3223 tree builtin_types
[(int) BT_LAST
];
3224 int wchar_type_size
;
3225 tree array_domain_type
;
3226 tree va_list_ref_type_node
;
3227 tree va_list_arg_type_node
;
3229 /* Define `int' and `char' first so that dbx will output them first. */
3230 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
3231 record_builtin_type (RID_CHAR
, "char", char_type_node
);
3233 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3234 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3235 but not C. Are the conditionals here needed? */
3236 if (c_language
== clk_cplusplus
)
3237 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
3238 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
3239 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
3240 record_builtin_type (RID_MAX
, "long unsigned int",
3241 long_unsigned_type_node
);
3242 if (c_language
== clk_cplusplus
)
3243 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
3244 record_builtin_type (RID_MAX
, "long long int",
3245 long_long_integer_type_node
);
3246 record_builtin_type (RID_MAX
, "long long unsigned int",
3247 long_long_unsigned_type_node
);
3248 if (c_language
== clk_cplusplus
)
3249 record_builtin_type (RID_MAX
, "long long unsigned",
3250 long_long_unsigned_type_node
);
3251 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
3252 record_builtin_type (RID_MAX
, "short unsigned int",
3253 short_unsigned_type_node
);
3254 if (c_language
== clk_cplusplus
)
3255 record_builtin_type (RID_MAX
, "unsigned short",
3256 short_unsigned_type_node
);
3258 /* Define both `signed char' and `unsigned char'. */
3259 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
3260 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
3262 /* These are types that c_common_type_for_size and
3263 c_common_type_for_mode use. */
3264 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3266 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3268 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3270 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3272 #if HOST_BITS_PER_WIDE_INT >= 64
3273 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3274 get_identifier ("__int128_t"),
3277 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3278 unsigned_intQI_type_node
));
3279 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3280 unsigned_intHI_type_node
));
3281 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3282 unsigned_intSI_type_node
));
3283 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3284 unsigned_intDI_type_node
));
3285 #if HOST_BITS_PER_WIDE_INT >= 64
3286 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3287 get_identifier ("__uint128_t"),
3288 unsigned_intTI_type_node
));
3291 /* Create the widest literal types. */
3292 widest_integer_literal_type_node
3293 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
3294 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3295 widest_integer_literal_type_node
));
3297 widest_unsigned_literal_type_node
3298 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
3299 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
, NULL_TREE
,
3300 widest_unsigned_literal_type_node
));
3302 /* `unsigned long' is the standard type for sizeof.
3303 Note that stddef.h uses `unsigned long',
3304 and this must agree, even if long and int are the same size. */
3306 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
3307 signed_size_type_node
= c_common_signed_type (size_type_node
);
3308 set_sizetype (size_type_node
);
3310 build_common_tree_nodes_2 (flag_short_double
);
3312 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
3313 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
3314 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
3316 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3317 get_identifier ("complex int"),
3318 complex_integer_type_node
));
3319 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3320 get_identifier ("complex float"),
3321 complex_float_type_node
));
3322 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3323 get_identifier ("complex double"),
3324 complex_double_type_node
));
3325 (*lang_hooks
.decls
.pushdecl
)
3326 (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
3327 complex_long_double_type_node
));
3329 /* Types which are common to the fortran compiler and libf2c. When
3330 changing these, you also need to be concerned with f/com.h. */
3332 if (TYPE_PRECISION (float_type_node
)
3333 == TYPE_PRECISION (long_integer_type_node
))
3335 g77_integer_type_node
= long_integer_type_node
;
3336 g77_uinteger_type_node
= long_unsigned_type_node
;
3338 else if (TYPE_PRECISION (float_type_node
)
3339 == TYPE_PRECISION (integer_type_node
))
3341 g77_integer_type_node
= integer_type_node
;
3342 g77_uinteger_type_node
= unsigned_type_node
;
3345 g77_integer_type_node
= g77_uinteger_type_node
= NULL_TREE
;
3347 if (g77_integer_type_node
!= NULL_TREE
)
3349 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3350 get_identifier ("__g77_integer"),
3351 g77_integer_type_node
));
3352 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3353 get_identifier ("__g77_uinteger"),
3354 g77_uinteger_type_node
));
3357 if (TYPE_PRECISION (float_type_node
) * 2
3358 == TYPE_PRECISION (long_integer_type_node
))
3360 g77_longint_type_node
= long_integer_type_node
;
3361 g77_ulongint_type_node
= long_unsigned_type_node
;
3363 else if (TYPE_PRECISION (float_type_node
) * 2
3364 == TYPE_PRECISION (long_long_integer_type_node
))
3366 g77_longint_type_node
= long_long_integer_type_node
;
3367 g77_ulongint_type_node
= long_long_unsigned_type_node
;
3370 g77_longint_type_node
= g77_ulongint_type_node
= NULL_TREE
;
3372 if (g77_longint_type_node
!= NULL_TREE
)
3374 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3375 get_identifier ("__g77_longint"),
3376 g77_longint_type_node
));
3377 (*lang_hooks
.decls
.pushdecl
) (build_decl (TYPE_DECL
,
3378 get_identifier ("__g77_ulongint"),
3379 g77_ulongint_type_node
));
3382 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
3384 void_zero_node
= build_int_2 (0, 0);
3385 TREE_TYPE (void_zero_node
) = void_type_node
;
3387 void_list_node
= build_void_list_node ();
3389 /* Make a type to be the domain of a few array types
3390 whose domains don't really matter.
3391 200 is small enough that it always fits in size_t
3392 and large enough that it can hold most function names for the
3393 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3394 array_domain_type
= build_index_type (size_int (200));
3396 /* Make a type for arrays of characters.
3397 With luck nothing will ever really depend on the length of this
3399 char_array_type_node
3400 = build_array_type (char_type_node
, array_domain_type
);
3402 /* Likewise for arrays of ints. */
3404 = build_array_type (integer_type_node
, array_domain_type
);
3406 string_type_node
= build_pointer_type (char_type_node
);
3407 const_string_type_node
3408 = build_pointer_type (build_qualified_type
3409 (char_type_node
, TYPE_QUAL_CONST
));
3411 /* This is special for C++ so functions can be overloaded. */
3412 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
3413 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
3414 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
3415 if (c_language
== clk_cplusplus
)
3417 if (TREE_UNSIGNED (wchar_type_node
))
3418 wchar_type_node
= make_unsigned_type (wchar_type_size
);
3420 wchar_type_node
= make_signed_type (wchar_type_size
);
3421 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
3425 signed_wchar_type_node
= c_common_signed_type (wchar_type_node
);
3426 unsigned_wchar_type_node
= c_common_unsigned_type (wchar_type_node
);
3429 /* This is for wide string constants. */
3430 wchar_array_type_node
3431 = build_array_type (wchar_type_node
, array_domain_type
);
3434 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
3437 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
3439 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
3441 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
3443 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
3444 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
3446 (*lang_hooks
.decls
.pushdecl
)
3447 (build_decl (TYPE_DECL
, get_identifier ("__builtin_va_list"),
3448 va_list_type_node
));
3450 (*lang_hooks
.decls
.pushdecl
)
3451 (build_decl (TYPE_DECL
, get_identifier ("__builtin_ptrdiff_t"),
3452 ptrdiff_type_node
));
3454 (*lang_hooks
.decls
.pushdecl
)
3455 (build_decl (TYPE_DECL
, get_identifier ("__builtin_size_t"),
3458 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
3460 va_list_arg_type_node
= va_list_ref_type_node
=
3461 build_pointer_type (TREE_TYPE (va_list_type_node
));
3465 va_list_arg_type_node
= va_list_type_node
;
3466 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
3469 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3470 builtin_types[(int) ENUM] = VALUE;
3471 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3472 builtin_types[(int) ENUM] \
3473 = build_function_type (builtin_types[(int) RETURN], \
3475 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3476 builtin_types[(int) ENUM] \
3477 = build_function_type (builtin_types[(int) RETURN], \
3478 tree_cons (NULL_TREE, \
3479 builtin_types[(int) ARG1], \
3481 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3482 builtin_types[(int) ENUM] \
3483 = build_function_type \
3484 (builtin_types[(int) RETURN], \
3485 tree_cons (NULL_TREE, \
3486 builtin_types[(int) ARG1], \
3487 tree_cons (NULL_TREE, \
3488 builtin_types[(int) ARG2], \
3490 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3491 builtin_types[(int) ENUM] \
3492 = build_function_type \
3493 (builtin_types[(int) RETURN], \
3494 tree_cons (NULL_TREE, \
3495 builtin_types[(int) ARG1], \
3496 tree_cons (NULL_TREE, \
3497 builtin_types[(int) ARG2], \
3498 tree_cons (NULL_TREE, \
3499 builtin_types[(int) ARG3], \
3501 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3502 builtin_types[(int) ENUM] \
3503 = build_function_type \
3504 (builtin_types[(int) RETURN], \
3505 tree_cons (NULL_TREE, \
3506 builtin_types[(int) ARG1], \
3507 tree_cons (NULL_TREE, \
3508 builtin_types[(int) ARG2], \
3511 builtin_types[(int) ARG3], \
3512 tree_cons (NULL_TREE, \
3513 builtin_types[(int) ARG4], \
3514 void_list_node)))));
3515 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3516 builtin_types[(int) ENUM] \
3517 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3518 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3519 builtin_types[(int) ENUM] \
3520 = build_function_type (builtin_types[(int) RETURN], \
3521 tree_cons (NULL_TREE, \
3522 builtin_types[(int) ARG1], \
3525 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3526 builtin_types[(int) ENUM] \
3527 = build_function_type \
3528 (builtin_types[(int) RETURN], \
3529 tree_cons (NULL_TREE, \
3530 builtin_types[(int) ARG1], \
3531 tree_cons (NULL_TREE, \
3532 builtin_types[(int) ARG2], \
3535 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3536 builtin_types[(int) ENUM] \
3537 = build_function_type \
3538 (builtin_types[(int) RETURN], \
3539 tree_cons (NULL_TREE, \
3540 builtin_types[(int) ARG1], \
3541 tree_cons (NULL_TREE, \
3542 builtin_types[(int) ARG2], \
3543 tree_cons (NULL_TREE, \
3544 builtin_types[(int) ARG3], \
3547 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3548 builtin_types[(int) ENUM] \
3549 = build_pointer_type (builtin_types[(int) TYPE]);
3550 #include "builtin-types.def"
3551 #undef DEF_PRIMITIVE_TYPE
3552 #undef DEF_FUNCTION_TYPE_1
3553 #undef DEF_FUNCTION_TYPE_2
3554 #undef DEF_FUNCTION_TYPE_3
3555 #undef DEF_FUNCTION_TYPE_4
3556 #undef DEF_FUNCTION_TYPE_VAR_0
3557 #undef DEF_FUNCTION_TYPE_VAR_1
3558 #undef DEF_FUNCTION_TYPE_VAR_2
3559 #undef DEF_FUNCTION_TYPE_VAR_3
3560 #undef DEF_POINTER_TYPE
3562 if (!c_attrs_initialized
)
3563 c_init_attributes ();
3565 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3566 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3571 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3575 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3578 ? (NAME + strlen ("__builtin_")) \
3580 built_in_attributes[(int) ATTRS]); \
3582 decl = builtin_function_2 (NAME, \
3583 NAME + strlen ("__builtin_"), \
3584 builtin_types[TYPE], \
3585 builtin_types[LIBTYPE], \
3590 built_in_attributes[(int) ATTRS]); \
3592 built_in_decls[(int) ENUM] = decl; \
3594 implicit_built_in_decls[(int) ENUM] = decl; \
3596 #include "builtins.def"
3599 (*targetm
.init_builtins
) ();
3601 main_identifier_node
= get_identifier ("main");
3605 build_va_arg (expr
, type
)
3608 return build1 (VA_ARG_EXPR
, type
, expr
);
3612 /* Linked list of disabled built-in functions. */
3614 typedef struct disabled_builtin
3617 struct disabled_builtin
*next
;
3619 static disabled_builtin
*disabled_builtins
= NULL
;
3621 static bool builtin_function_disabled_p
PARAMS ((const char *));
3623 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3624 begins with "__builtin_", give an error. */
3627 disable_builtin_function (name
)
3630 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
3631 error ("cannot disable built-in function `%s'", name
);
3634 disabled_builtin
*new = xmalloc (sizeof (disabled_builtin
));
3636 new->next
= disabled_builtins
;
3637 disabled_builtins
= new;
3642 /* Return true if the built-in function NAME has been disabled, false
3646 builtin_function_disabled_p (name
)
3649 disabled_builtin
*p
;
3650 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
3652 if (strcmp (name
, p
->name
) == 0)
3659 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3660 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3661 of these may be NULL (though both being NULL is useless).
3662 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3663 TYPE is the type of the function with the ordinary name. These
3664 may differ if the ordinary name is declared with a looser type to avoid
3665 conflicts with headers. FUNCTION_CODE and CLASS are as for
3666 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3667 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3668 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3669 ATTRS is the tree list representing the builtin's function attributes.
3670 Returns the declaration of BUILTIN_NAME, if any, otherwise
3671 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3672 or if NONANSI_P and flag_no_nonansi_builtin. */
3675 builtin_function_2 (builtin_name
, name
, builtin_type
, type
, function_code
,
3676 class, library_name_p
, nonansi_p
, attrs
)
3677 const char *builtin_name
;
3682 enum built_in_class
class;
3687 tree bdecl
= NULL_TREE
;
3688 tree decl
= NULL_TREE
;
3690 if (builtin_name
!= 0)
3691 bdecl
= builtin_function (builtin_name
, builtin_type
, function_code
,
3692 class, library_name_p
? name
: NULL
, attrs
);
3694 if (name
!= 0 && !flag_no_builtin
&& !builtin_function_disabled_p (name
)
3695 && !(nonansi_p
&& flag_no_nonansi_builtin
))
3696 decl
= builtin_function (name
, type
, function_code
, class, NULL
, attrs
);
3698 return (bdecl
!= 0 ? bdecl
: decl
);
3701 /* Nonzero if the type T promotes to int. This is (nearly) the
3702 integral promotions defined in ISO C99 6.3.1.1/2. */
3705 c_promoting_integer_type_p (t
)
3708 switch (TREE_CODE (t
))
3711 return (TYPE_MAIN_VARIANT (t
) == char_type_node
3712 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
3713 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
3714 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
3715 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
3716 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
3719 /* ??? Technically all enumerations not larger than an int
3720 promote to an int. But this is used along code paths
3721 that only want to notice a size change. */
3722 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
3732 /* Return 1 if PARMS specifies a fixed number of parameters
3733 and none of their types is affected by default promotions. */
3736 self_promoting_args_p (parms
)
3740 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
3742 tree type
= TREE_VALUE (t
);
3744 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
3750 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
3753 if (c_promoting_integer_type_p (type
))
3759 /* Recursively examines the array elements of TYPE, until a non-array
3760 element type is found. */
3763 strip_array_types (type
)
3766 while (TREE_CODE (type
) == ARRAY_TYPE
)
3767 type
= TREE_TYPE (type
);
3772 static tree expand_unordered_cmp
PARAMS ((tree
, tree
, enum tree_code
,
3775 /* Expand a call to an unordered comparison function such as
3776 __builtin_isgreater(). FUNCTION is the function's declaration and
3777 PARAMS a list of the values passed. For __builtin_isunordered(),
3778 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3779 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3780 that give the opposite of the desired result. UNORDERED_CODE is
3781 used for modes that can hold NaNs and ORDERED_CODE is used for the
3785 expand_unordered_cmp (function
, params
, unordered_code
, ordered_code
)
3786 tree function
, params
;
3787 enum tree_code unordered_code
, ordered_code
;
3789 tree arg0
, arg1
, type
;
3790 enum tree_code code0
, code1
;
3792 /* Check that we have exactly two arguments. */
3793 if (params
== 0 || TREE_CHAIN (params
) == 0)
3795 error ("too few arguments to function `%s'",
3796 IDENTIFIER_POINTER (DECL_NAME (function
)));
3797 return error_mark_node
;
3799 else if (TREE_CHAIN (TREE_CHAIN (params
)) != 0)
3801 error ("too many arguments to function `%s'",
3802 IDENTIFIER_POINTER (DECL_NAME (function
)));
3803 return error_mark_node
;
3806 arg0
= TREE_VALUE (params
);
3807 arg1
= TREE_VALUE (TREE_CHAIN (params
));
3809 code0
= TREE_CODE (TREE_TYPE (arg0
));
3810 code1
= TREE_CODE (TREE_TYPE (arg1
));
3812 /* Make sure that the arguments have a common type of REAL. */
3814 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3815 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3816 type
= common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
));
3818 if (type
== 0 || TREE_CODE (type
) != REAL_TYPE
)
3820 error ("non-floating-point argument to function `%s'",
3821 IDENTIFIER_POINTER (DECL_NAME (function
)));
3822 return error_mark_node
;
3825 if (unordered_code
== UNORDERED_EXPR
)
3827 if (MODE_HAS_NANS (TYPE_MODE (type
)))
3828 return build_binary_op (unordered_code
,
3829 convert (type
, arg0
),
3830 convert (type
, arg1
),
3833 return integer_zero_node
;
3836 return build_unary_op (TRUTH_NOT_EXPR
,
3837 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type
))
3840 convert (type
, arg0
),
3841 convert (type
, arg1
),
3847 /* Recognize certain built-in functions so we can make tree-codes
3848 other than CALL_EXPR. We do this when it enables fold-const.c
3849 to do something useful. */
3850 /* ??? By rights this should go in builtins.c, but only C and C++
3851 implement build_{binary,unary}_op. Not exactly sure what bits
3852 of functionality are actually needed from those functions, or
3853 where the similar functionality exists in the other front ends. */
3856 expand_tree_builtin (function
, params
, coerced_params
)
3857 tree function
, params
, coerced_params
;
3859 if (DECL_BUILT_IN_CLASS (function
) != BUILT_IN_NORMAL
)
3862 switch (DECL_FUNCTION_CODE (function
))
3866 case BUILT_IN_LLABS
:
3867 case BUILT_IN_IMAXABS
:
3869 case BUILT_IN_FABSL
:
3870 case BUILT_IN_FABSF
:
3871 if (coerced_params
== 0)
3872 return integer_zero_node
;
3873 return build_unary_op (ABS_EXPR
, TREE_VALUE (coerced_params
), 0);
3876 case BUILT_IN_CONJF
:
3877 case BUILT_IN_CONJL
:
3878 if (coerced_params
== 0)
3879 return integer_zero_node
;
3880 return build_unary_op (CONJ_EXPR
, TREE_VALUE (coerced_params
), 0);
3882 case BUILT_IN_CREAL
:
3883 case BUILT_IN_CREALF
:
3884 case BUILT_IN_CREALL
:
3885 if (coerced_params
== 0)
3886 return integer_zero_node
;
3887 return build_unary_op (REALPART_EXPR
, TREE_VALUE (coerced_params
), 0);
3889 case BUILT_IN_CIMAG
:
3890 case BUILT_IN_CIMAGF
:
3891 case BUILT_IN_CIMAGL
:
3892 if (coerced_params
== 0)
3893 return integer_zero_node
;
3894 return build_unary_op (IMAGPART_EXPR
, TREE_VALUE (coerced_params
), 0);
3896 case BUILT_IN_ISGREATER
:
3897 return expand_unordered_cmp (function
, params
, UNLE_EXPR
, LE_EXPR
);
3899 case BUILT_IN_ISGREATEREQUAL
:
3900 return expand_unordered_cmp (function
, params
, UNLT_EXPR
, LT_EXPR
);
3902 case BUILT_IN_ISLESS
:
3903 return expand_unordered_cmp (function
, params
, UNGE_EXPR
, GE_EXPR
);
3905 case BUILT_IN_ISLESSEQUAL
:
3906 return expand_unordered_cmp (function
, params
, UNGT_EXPR
, GT_EXPR
);
3908 case BUILT_IN_ISLESSGREATER
:
3909 return expand_unordered_cmp (function
, params
, UNEQ_EXPR
, EQ_EXPR
);
3911 case BUILT_IN_ISUNORDERED
:
3912 return expand_unordered_cmp (function
, params
, UNORDERED_EXPR
, NOP_EXPR
);
3921 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3922 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3923 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3924 value, the traversal is aborted, and the value returned by FUNC is
3925 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3926 the node being visited are not walked.
3928 We don't need a without_duplicates variant of this one because the
3929 statement tree is a tree, not a graph. */
3932 walk_stmt_tree (tp
, func
, data
)
3937 enum tree_code code
;
3942 #define WALK_SUBTREE(NODE) \
3945 result = walk_stmt_tree (&(NODE), func, data); \
3951 /* Skip empty subtrees. */
3955 /* Skip subtrees below non-statement nodes. */
3956 if (!STATEMENT_CODE_P (TREE_CODE (*tp
)))
3959 /* Call the function. */
3961 result
= (*func
) (tp
, &walk_subtrees
, data
);
3963 /* If we found something, return it. */
3967 /* FUNC may have modified the tree, recheck that we're looking at a
3969 code
= TREE_CODE (*tp
);
3970 if (!STATEMENT_CODE_P (code
))
3973 /* Visit the subtrees unless FUNC decided that there was nothing
3974 interesting below this point in the tree. */
3977 /* Walk over all the sub-trees of this operand. Statement nodes
3978 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3979 len
= TREE_CODE_LENGTH (code
);
3981 /* Go through the subtrees. We need to do this in forward order so
3982 that the scope of a FOR_EXPR is handled properly. */
3983 for (i
= 0; i
< len
; ++i
)
3984 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
3987 /* Finally visit the chain. This can be tail-recursion optimized if
3988 we write it this way. */
3989 return walk_stmt_tree (&TREE_CHAIN (*tp
), func
, data
);
3994 /* Used to compare case labels. K1 and K2 are actually tree nodes
3995 representing case labels, or NULL_TREE for a `default' label.
3996 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3997 K2, and 0 if K1 and K2 are equal. */
4000 case_compare (k1
, k2
)
4004 /* Consider a NULL key (such as arises with a `default' label) to be
4005 smaller than anything else. */
4011 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
4014 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
4015 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
4016 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
4017 case label was declared using the usual C/C++ syntax, rather than
4018 the GNU case range extension. CASES is a tree containing all the
4019 case ranges processed so far; COND is the condition for the
4020 switch-statement itself. Returns the CASE_LABEL created, or
4021 ERROR_MARK_NODE if no CASE_LABEL is created. */
4024 c_add_case_label (cases
, cond
, low_value
, high_value
)
4033 splay_tree_node node
;
4035 /* Create the LABEL_DECL itself. */
4036 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
4037 DECL_CONTEXT (label
) = current_function_decl
;
4039 /* If there was an error processing the switch condition, bail now
4040 before we get more confused. */
4041 if (!cond
|| cond
== error_mark_node
)
4043 /* Add a label anyhow so that the back-end doesn't think that
4044 the beginning of the switch is unreachable. */
4046 add_stmt (build_case_label (NULL_TREE
, NULL_TREE
, label
));
4047 return error_mark_node
;
4050 if ((low_value
&& TREE_TYPE (low_value
)
4051 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
4052 || (high_value
&& TREE_TYPE (high_value
)
4053 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
4054 error ("pointers are not permitted as case values");
4056 /* Case ranges are a GNU extension. */
4057 if (high_value
&& pedantic
)
4059 if (c_language
== clk_cplusplus
)
4060 pedwarn ("ISO C++ forbids range expressions in switch statements");
4062 pedwarn ("ISO C forbids range expressions in switch statements");
4065 type
= TREE_TYPE (cond
);
4068 low_value
= check_case_value (low_value
);
4069 low_value
= convert_and_check (type
, low_value
);
4073 high_value
= check_case_value (high_value
);
4074 high_value
= convert_and_check (type
, high_value
);
4077 /* If an error has occurred, bail out now. */
4078 if (low_value
== error_mark_node
|| high_value
== error_mark_node
)
4081 add_stmt (build_case_label (NULL_TREE
, NULL_TREE
, label
));
4082 return error_mark_node
;
4085 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
4086 really a case range, even though it was written that way. Remove
4087 the HIGH_VALUE to simplify later processing. */
4088 if (tree_int_cst_equal (low_value
, high_value
))
4089 high_value
= NULL_TREE
;
4090 if (low_value
&& high_value
4091 && !tree_int_cst_lt (low_value
, high_value
))
4092 warning ("empty range specified");
4094 /* Look up the LOW_VALUE in the table of case labels we already
4096 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
4097 /* If there was not an exact match, check for overlapping ranges.
4098 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
4099 that's a `default' label and the only overlap is an exact match. */
4100 if (!node
&& (low_value
|| high_value
))
4102 splay_tree_node low_bound
;
4103 splay_tree_node high_bound
;
4105 /* Even though there wasn't an exact match, there might be an
4106 overlap between this case range and another case range.
4107 Since we've (inductively) not allowed any overlapping case
4108 ranges, we simply need to find the greatest low case label
4109 that is smaller that LOW_VALUE, and the smallest low case
4110 label that is greater than LOW_VALUE. If there is an overlap
4111 it will occur in one of these two ranges. */
4112 low_bound
= splay_tree_predecessor (cases
,
4113 (splay_tree_key
) low_value
);
4114 high_bound
= splay_tree_successor (cases
,
4115 (splay_tree_key
) low_value
);
4117 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4118 the LOW_VALUE, so there is no need to check unless the
4119 LOW_BOUND is in fact itself a case range. */
4121 && CASE_HIGH ((tree
) low_bound
->value
)
4122 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
4125 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4126 range is bigger than the low end of the current range, so we
4127 are only interested if the current range is a real range, and
4128 not an ordinary case label. */
4131 && (tree_int_cst_compare ((tree
) high_bound
->key
,
4136 /* If there was an overlap, issue an error. */
4139 tree duplicate
= CASE_LABEL_DECL ((tree
) node
->value
);
4143 error ("duplicate (or overlapping) case value");
4144 error_with_decl (duplicate
,
4145 "this is the first entry overlapping that value");
4149 error ("duplicate case value") ;
4150 error_with_decl (duplicate
, "previously used here");
4154 error ("multiple default labels in one switch");
4155 error_with_decl (duplicate
, "this is the first default label");
4158 add_stmt (build_case_label (NULL_TREE
, NULL_TREE
, label
));
4161 /* Add a CASE_LABEL to the statement-tree. */
4162 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
4163 /* Register this case label in the splay tree. */
4164 splay_tree_insert (cases
,
4165 (splay_tree_key
) low_value
,
4166 (splay_tree_value
) case_label
);
4171 /* Finish an expression taking the address of LABEL (an
4172 IDENTIFIER_NODE). Returns an expression for the address. */
4175 finish_label_address_expr (label
)
4182 if (c_language
== clk_cplusplus
)
4183 pedwarn ("ISO C++ forbids taking the address of a label");
4185 pedwarn ("ISO C forbids taking the address of a label");
4188 if (label
== error_mark_node
)
4189 return error_mark_node
;
4191 label
= lookup_label (label
);
4192 if (label
== NULL_TREE
)
4193 result
= null_pointer_node
;
4196 TREE_USED (label
) = 1;
4197 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
4198 TREE_CONSTANT (result
) = 1;
4199 /* The current function in not necessarily uninlinable.
4200 Computed gotos are incompatible with inlining, but the value
4201 here could be used only in a diagnostic, for example. */
4207 /* Hook used by expand_expr to expand language-specific tree codes. */
4210 c_expand_expr (exp
, target
, tmode
, modifier
)
4213 enum machine_mode tmode
;
4214 int modifier
; /* Actually enum_modifier. */
4216 switch (TREE_CODE (exp
))
4222 bool preserve_result
= false;
4223 bool return_target
= false;
4225 /* Since expand_expr_stmt calls free_temp_slots after every
4226 expression statement, we must call push_temp_slots here.
4227 Otherwise, any temporaries in use now would be considered
4228 out-of-scope after the first EXPR_STMT from within the
4231 rtl_expr
= expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp
));
4233 /* If we want the result of this expression, find the last
4234 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
4235 if (target
!= const0_rtx
4236 && TREE_CODE (STMT_EXPR_STMT (exp
)) == COMPOUND_STMT
4237 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp
))) == SCOPE_STMT
)
4239 tree expr
= COMPOUND_BODY (STMT_EXPR_STMT (exp
));
4240 tree last
= TREE_CHAIN (expr
);
4242 while (TREE_CHAIN (last
))
4245 last
= TREE_CHAIN (last
);
4248 if (TREE_CODE (last
) == SCOPE_STMT
4249 && TREE_CODE (expr
) == EXPR_STMT
)
4251 if (target
&& TREE_CODE (EXPR_STMT_EXPR (expr
)) == VAR_DECL
4252 && DECL_RTL_IF_SET (EXPR_STMT_EXPR (expr
)) == target
)
4253 /* If the last expression is a variable whose RTL is the
4254 same as our target, just return the target; if it
4255 isn't valid expanding the decl would produce different
4256 RTL, and store_expr would try to do a copy. */
4257 return_target
= true;
4260 /* Otherwise, note that we want the value from the last
4262 TREE_ADDRESSABLE (expr
) = 1;
4263 preserve_result
= true;
4268 expand_stmt (STMT_EXPR_STMT (exp
));
4269 expand_end_stmt_expr (rtl_expr
);
4271 result
= expand_expr (rtl_expr
, target
, tmode
, modifier
);
4274 else if (preserve_result
&& GET_CODE (result
) == MEM
)
4276 if (GET_MODE (result
) != BLKmode
)
4277 result
= copy_to_reg (result
);
4279 preserve_temp_slots (result
);
4282 /* If the statment-expression does not have a scope, then the
4283 new temporaries we created within it must live beyond the
4284 statement-expression. */
4285 if (STMT_EXPR_NO_SCOPE (exp
))
4286 preserve_temp_slots (NULL_RTX
);
4295 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
4296 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
4298 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
4299 && (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
4300 == BUILT_IN_FRONTEND
))
4301 return c_expand_builtin (exp
, target
, tmode
, modifier
);
4307 case COMPOUND_LITERAL_EXPR
:
4309 /* Initialize the anonymous variable declared in the compound
4310 literal, then return the variable. */
4311 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
4312 emit_local_var (decl
);
4313 return expand_expr (decl
, target
, tmode
, modifier
);
4324 /* Hook used by safe_from_p to handle language-specific tree codes. */
4327 c_safe_from_p (target
, exp
)
4331 /* We can see statements here when processing the body of a
4332 statement-expression. For a declaration statement declaring a
4333 variable, look at the variable's initializer. */
4334 if (TREE_CODE (exp
) == DECL_STMT
)
4336 tree decl
= DECL_STMT_DECL (exp
);
4338 if (TREE_CODE (decl
) == VAR_DECL
4339 && DECL_INITIAL (decl
)
4340 && !safe_from_p (target
, DECL_INITIAL (decl
), /*top_p=*/0))
4344 /* For any statement, we must follow the statement-chain. */
4345 if (STATEMENT_CODE_P (TREE_CODE (exp
)) && TREE_CHAIN (exp
))
4346 return safe_from_p (target
, TREE_CHAIN (exp
), /*top_p=*/0);
4348 /* Assume everything else is safe. */
4352 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4355 c_common_unsafe_for_reeval (exp
)
4358 /* Statement expressions may not be reevaluated, likewise compound
4360 if (TREE_CODE (exp
) == STMT_EXPR
4361 || TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
)
4364 /* Walk all other expressions. */
4368 /* Hook used by staticp to handle language-specific tree codes. */
4374 if (TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
4375 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
)))
4380 #define CALLED_AS_BUILT_IN(NODE) \
4381 (!strncmp (IDENTIFIER_POINTER (DECL_NAME (NODE)), "__builtin_", 10))
4384 c_expand_builtin (exp
, target
, tmode
, modifier
)
4387 enum machine_mode tmode
;
4388 enum expand_modifier modifier
;
4390 tree type
= TREE_TYPE (exp
);
4391 tree fndecl
= TREE_OPERAND (TREE_OPERAND (exp
, 0), 0);
4392 tree arglist
= TREE_OPERAND (exp
, 1);
4393 enum built_in_function fcode
= DECL_FUNCTION_CODE (fndecl
);
4394 enum tree_code code
= TREE_CODE (exp
);
4395 const int ignore
= (target
== const0_rtx
4396 || ((code
== NON_LVALUE_EXPR
|| code
== NOP_EXPR
4397 || code
== CONVERT_EXPR
|| code
== REFERENCE_EXPR
4398 || code
== COND_EXPR
)
4399 && TREE_CODE (type
) == VOID_TYPE
));
4401 if (! optimize
&& ! CALLED_AS_BUILT_IN (fndecl
))
4402 return expand_call (exp
, target
, ignore
);
4406 case BUILT_IN_PRINTF
:
4407 target
= c_expand_builtin_printf (arglist
, target
, tmode
,
4408 modifier
, ignore
, /*unlocked=*/ 0);
4413 case BUILT_IN_PRINTF_UNLOCKED
:
4414 target
= c_expand_builtin_printf (arglist
, target
, tmode
,
4415 modifier
, ignore
, /*unlocked=*/ 1);
4420 case BUILT_IN_FPRINTF
:
4421 target
= c_expand_builtin_fprintf (arglist
, target
, tmode
,
4422 modifier
, ignore
, /*unlocked=*/ 0);
4427 case BUILT_IN_FPRINTF_UNLOCKED
:
4428 target
= c_expand_builtin_fprintf (arglist
, target
, tmode
,
4429 modifier
, ignore
, /*unlocked=*/ 1);
4434 default: /* just do library call, if unknown builtin */
4435 error ("built-in function `%s' not currently supported",
4436 IDENTIFIER_POINTER (DECL_NAME (fndecl
)));
4439 /* The switch statement above can drop through to cause the function
4440 to be called normally. */
4441 return expand_call (exp
, target
, ignore
);
4444 /* Check an arglist to *printf for problems. The arglist should start
4445 at the format specifier, with the remaining arguments immediately
4448 is_valid_printf_arglist (arglist
)
4451 /* Save this value so we can restore it later. */
4452 const int SAVE_pedantic
= pedantic
;
4453 int diagnostic_occurred
= 0;
4456 /* Set this to a known value so the user setting won't affect code
4459 /* Check to make sure there are no format specifier errors. */
4460 attrs
= tree_cons (get_identifier ("format"),
4461 tree_cons (NULL_TREE
,
4462 get_identifier ("printf"),
4463 tree_cons (NULL_TREE
,
4465 tree_cons (NULL_TREE
,
4469 check_function_format (&diagnostic_occurred
, attrs
, arglist
);
4471 /* Restore the value of `pedantic'. */
4472 pedantic
= SAVE_pedantic
;
4474 /* If calling `check_function_format_ptr' produces a warning, we
4475 return false, otherwise we return true. */
4476 return ! diagnostic_occurred
;
4479 /* If the arguments passed to printf are suitable for optimizations,
4480 we attempt to transform the call. */
4482 c_expand_builtin_printf (arglist
, target
, tmode
, modifier
, ignore
, unlocked
)
4485 enum machine_mode tmode
;
4486 enum expand_modifier modifier
;
4490 tree fn_putchar
= unlocked
?
4491 implicit_built_in_decls
[BUILT_IN_PUTCHAR_UNLOCKED
] : implicit_built_in_decls
[BUILT_IN_PUTCHAR
];
4492 tree fn_puts
= unlocked
?
4493 implicit_built_in_decls
[BUILT_IN_PUTS_UNLOCKED
] : implicit_built_in_decls
[BUILT_IN_PUTS
];
4494 tree fn
, format_arg
, stripped_string
;
4496 /* If the return value is used, or the replacement _DECL isn't
4497 initialized, don't do the transformation. */
4498 if (!ignore
|| !fn_putchar
|| !fn_puts
)
4501 /* Verify the required arguments in the original call. */
4503 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist
))) != POINTER_TYPE
))
4506 /* Check the specifier vs. the parameters. */
4507 if (!is_valid_printf_arglist (arglist
))
4510 format_arg
= TREE_VALUE (arglist
);
4511 stripped_string
= format_arg
;
4512 STRIP_NOPS (stripped_string
);
4513 if (stripped_string
&& TREE_CODE (stripped_string
) == ADDR_EXPR
)
4514 stripped_string
= TREE_OPERAND (stripped_string
, 0);
4516 /* If the format specifier isn't a STRING_CST, punt. */
4517 if (TREE_CODE (stripped_string
) != STRING_CST
)
4520 /* OK! We can attempt optimization. */
4522 /* If the format specifier was "%s\n", call __builtin_puts(arg2). */
4523 if (strcmp (TREE_STRING_POINTER (stripped_string
), "%s\n") == 0)
4525 arglist
= TREE_CHAIN (arglist
);
4528 /* If the format specifier was "%c", call __builtin_putchar (arg2). */
4529 else if (strcmp (TREE_STRING_POINTER (stripped_string
), "%c") == 0)
4531 arglist
= TREE_CHAIN (arglist
);
4536 /* We can't handle anything else with % args or %% ... yet. */
4537 if (strchr (TREE_STRING_POINTER (stripped_string
), '%'))
4540 /* If the resulting constant string has a length of 1, call
4541 putchar. Note, TREE_STRING_LENGTH includes the terminating
4542 NULL in its count. */
4543 if (TREE_STRING_LENGTH (stripped_string
) == 2)
4545 /* Given printf("c"), (where c is any one character,)
4546 convert "c"[0] to an int and pass that to the replacement
4548 arglist
= build_int_2 (TREE_STRING_POINTER (stripped_string
)[0], 0);
4549 arglist
= build_tree_list (NULL_TREE
, arglist
);
4553 /* If the resulting constant was "string\n", call
4554 __builtin_puts("string"). Ensure "string" has at least one
4555 character besides the trailing \n. Note, TREE_STRING_LENGTH
4556 includes the terminating NULL in its count. */
4557 else if (TREE_STRING_LENGTH (stripped_string
) > 2
4558 && TREE_STRING_POINTER (stripped_string
)
4559 [TREE_STRING_LENGTH (stripped_string
) - 2] == '\n')
4561 /* Create a NULL-terminated string that's one char shorter
4562 than the original, stripping off the trailing '\n'. */
4563 const int newlen
= TREE_STRING_LENGTH (stripped_string
) - 1;
4564 char *newstr
= (char *) alloca (newlen
);
4565 memcpy (newstr
, TREE_STRING_POINTER (stripped_string
), newlen
- 1);
4566 newstr
[newlen
- 1] = 0;
4568 arglist
= fix_string_type (build_string (newlen
, newstr
));
4569 arglist
= build_tree_list (NULL_TREE
, arglist
);
4573 /* We'd like to arrange to call fputs(string) here, but we
4574 need stdout and don't have a way to get it ... yet. */
4578 return expand_expr (build_function_call (fn
, arglist
),
4579 (ignore
? const0_rtx
: target
),
4583 /* If the arguments passed to fprintf are suitable for optimizations,
4584 we attempt to transform the call. */
4586 c_expand_builtin_fprintf (arglist
, target
, tmode
, modifier
, ignore
, unlocked
)
4589 enum machine_mode tmode
;
4590 enum expand_modifier modifier
;
4594 tree fn_fputc
= unlocked
?
4595 implicit_built_in_decls
[BUILT_IN_FPUTC_UNLOCKED
] : implicit_built_in_decls
[BUILT_IN_FPUTC
];
4596 tree fn_fputs
= unlocked
?
4597 implicit_built_in_decls
[BUILT_IN_FPUTS_UNLOCKED
] : implicit_built_in_decls
[BUILT_IN_FPUTS
];
4598 tree fn
, format_arg
, stripped_string
;
4600 /* If the return value is used, or the replacement _DECL isn't
4601 initialized, don't do the transformation. */
4602 if (!ignore
|| !fn_fputc
|| !fn_fputs
)
4605 /* Verify the required arguments in the original call. */
4607 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist
))) != POINTER_TYPE
)
4608 || (TREE_CHAIN (arglist
) == 0)
4609 || (TREE_CODE (TREE_TYPE (TREE_VALUE (TREE_CHAIN (arglist
)))) !=
4613 /* Check the specifier vs. the parameters. */
4614 if (!is_valid_printf_arglist (TREE_CHAIN (arglist
)))
4617 format_arg
= TREE_VALUE (TREE_CHAIN (arglist
));
4618 stripped_string
= format_arg
;
4619 STRIP_NOPS (stripped_string
);
4620 if (stripped_string
&& TREE_CODE (stripped_string
) == ADDR_EXPR
)
4621 stripped_string
= TREE_OPERAND (stripped_string
, 0);
4623 /* If the format specifier isn't a STRING_CST, punt. */
4624 if (TREE_CODE (stripped_string
) != STRING_CST
)
4627 /* OK! We can attempt optimization. */
4629 /* If the format specifier was "%s", call __builtin_fputs(arg3, arg1). */
4630 if (strcmp (TREE_STRING_POINTER (stripped_string
), "%s") == 0)
4632 tree newarglist
= build_tree_list (NULL_TREE
, TREE_VALUE (arglist
));
4633 arglist
= tree_cons (NULL_TREE
,
4634 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
))),
4638 /* If the format specifier was "%c", call __builtin_fputc (arg3, arg1). */
4639 else if (strcmp (TREE_STRING_POINTER (stripped_string
), "%c") == 0)
4641 tree newarglist
= build_tree_list (NULL_TREE
, TREE_VALUE (arglist
));
4642 arglist
= tree_cons (NULL_TREE
,
4643 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist
))),
4649 /* We can't handle anything else with % args or %% ... yet. */
4650 if (strchr (TREE_STRING_POINTER (stripped_string
), '%'))
4653 /* When "string" doesn't contain %, replace all cases of
4654 fprintf(stream,string) with fputs(string,stream). The fputs
4655 builtin will take take of special cases like length==1. */
4656 arglist
= tree_cons (NULL_TREE
, TREE_VALUE (TREE_CHAIN (arglist
)),
4657 build_tree_list (NULL_TREE
, TREE_VALUE (arglist
)));
4661 return expand_expr (build_function_call (fn
, arglist
),
4662 (ignore
? const0_rtx
: target
),
4667 /* Given a boolean expression ARG, return a tree representing an increment
4668 or decrement (as indicated by CODE) of ARG. The front end must check for
4669 invalid cases (e.g., decrement in C++). */
4671 boolean_increment (code
, arg
)
4672 enum tree_code code
;
4676 tree true_res
= (c_language
== clk_cplusplus
4678 : c_bool_true_node
);
4679 arg
= stabilize_reference (arg
);
4682 case PREINCREMENT_EXPR
:
4683 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4685 case POSTINCREMENT_EXPR
:
4686 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4687 arg
= save_expr (arg
);
4688 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4689 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4691 case PREDECREMENT_EXPR
:
4692 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, invert_truthvalue (arg
));
4694 case POSTDECREMENT_EXPR
:
4695 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, invert_truthvalue (arg
));
4696 arg
= save_expr (arg
);
4697 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4698 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4703 TREE_SIDE_EFFECTS (val
) = 1;
4707 /* Built-in macros for stddef.h, that require macros defined in this
4710 c_stddef_cpp_builtins()
4712 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
4713 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
4714 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
4715 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
4719 c_init_attributes ()
4721 /* Fill in the built_in_attributes array. */
4722 #define DEF_ATTR_NULL_TREE(ENUM) \
4723 built_in_attributes[(int) ENUM] = NULL_TREE;
4724 #define DEF_ATTR_INT(ENUM, VALUE) \
4725 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4726 #define DEF_ATTR_IDENT(ENUM, STRING) \
4727 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4728 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4729 built_in_attributes[(int) ENUM] \
4730 = tree_cons (built_in_attributes[(int) PURPOSE], \
4731 built_in_attributes[(int) VALUE], \
4732 built_in_attributes[(int) CHAIN]);
4733 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No initialization needed. */
4734 #include "builtin-attrs.def"
4735 #undef DEF_ATTR_NULL_TREE
4737 #undef DEF_ATTR_IDENT
4738 #undef DEF_ATTR_TREE_LIST
4740 c_attrs_initialized
= true;
4743 /* Depending on the name of DECL, apply default attributes to it. */
4746 c_common_insert_default_attributes (decl
)
4749 tree name
= DECL_NAME (decl
);
4751 if (!c_attrs_initialized
)
4752 c_init_attributes ();
4754 #define DEF_ATTR_NULL_TREE(ENUM) /* Nothing needed after initialization. */
4755 #define DEF_ATTR_INT(ENUM, VALUE)
4756 #define DEF_ATTR_IDENT(ENUM, STRING)
4757 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN)
4758 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) \
4759 if ((PREDICATE) && name == built_in_attributes[(int) NAME]) \
4760 decl_attributes (&decl, built_in_attributes[(int) ATTRS], \
4761 ATTR_FLAG_BUILT_IN);
4762 #include "builtin-attrs.def"
4763 #undef DEF_ATTR_NULL_TREE
4765 #undef DEF_ATTR_IDENT
4766 #undef DEF_ATTR_TREE_LIST
4770 /* Output a -Wshadow warning MSGCODE about NAME, and give the location
4771 of the previous declaration DECL. */
4773 shadow_warning (msgcode
, name
, decl
)
4774 enum sw_kind msgcode
;
4778 static const char *const msgs
[] = {
4779 /* SW_PARAM */ N_("declaration of \"%s\" shadows a parameter"),
4780 /* SW_LOCAL */ N_("declaration of \"%s\" shadows a previous local"),
4781 /* SW_GLOBAL */ N_("declaration of \"%s\" shadows a global declaration")
4784 warning (msgs
[msgcode
], name
);
4785 warning ("%Hshadowed declaration is here", &DECL_SOURCE_LOCATION (decl
));
4788 /* Attribute handlers common to C front ends. */
4790 /* Handle a "packed" attribute; arguments as in
4791 struct attribute_spec.handler. */
4794 handle_packed_attribute (node
, name
, args
, flags
, no_add_attrs
)
4797 tree args ATTRIBUTE_UNUSED
;
4804 if (TREE_CODE (*node
) == TYPE_DECL
)
4805 type
= &TREE_TYPE (*node
);
4812 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4813 *type
= build_type_copy (*type
);
4814 TYPE_PACKED (*type
) = 1;
4816 else if (TREE_CODE (*node
) == FIELD_DECL
)
4817 DECL_PACKED (*node
) = 1;
4818 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4819 used for DECL_REGISTER. It wouldn't mean anything anyway. */
4822 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4823 *no_add_attrs
= true;
4829 /* Handle a "nocommon" attribute; arguments as in
4830 struct attribute_spec.handler. */
4833 handle_nocommon_attribute (node
, name
, args
, flags
, no_add_attrs
)
4836 tree args ATTRIBUTE_UNUSED
;
4837 int flags ATTRIBUTE_UNUSED
;
4840 if (TREE_CODE (*node
) == VAR_DECL
)
4841 DECL_COMMON (*node
) = 0;
4844 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4845 *no_add_attrs
= true;
4851 /* Handle a "common" attribute; arguments as in
4852 struct attribute_spec.handler. */
4855 handle_common_attribute (node
, name
, args
, flags
, no_add_attrs
)
4858 tree args ATTRIBUTE_UNUSED
;
4859 int flags ATTRIBUTE_UNUSED
;
4862 if (TREE_CODE (*node
) == VAR_DECL
)
4863 DECL_COMMON (*node
) = 1;
4866 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4867 *no_add_attrs
= true;
4873 /* Handle a "noreturn" attribute; arguments as in
4874 struct attribute_spec.handler. */
4877 handle_noreturn_attribute (node
, name
, args
, flags
, no_add_attrs
)
4880 tree args ATTRIBUTE_UNUSED
;
4881 int flags ATTRIBUTE_UNUSED
;
4884 tree type
= TREE_TYPE (*node
);
4886 /* See FIXME comment in c_common_attribute_table. */
4887 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4888 TREE_THIS_VOLATILE (*node
) = 1;
4889 else if (TREE_CODE (type
) == POINTER_TYPE
4890 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4892 = build_pointer_type
4893 (build_type_variant (TREE_TYPE (type
),
4894 TREE_READONLY (TREE_TYPE (type
)), 1));
4897 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4898 *no_add_attrs
= true;
4904 /* Handle a "noinline" attribute; arguments as in
4905 struct attribute_spec.handler. */
4908 handle_noinline_attribute (node
, name
, args
, flags
, no_add_attrs
)
4911 tree args ATTRIBUTE_UNUSED
;
4912 int flags ATTRIBUTE_UNUSED
;
4915 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4916 DECL_UNINLINABLE (*node
) = 1;
4919 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4920 *no_add_attrs
= true;
4926 /* Handle a "always_inline" attribute; arguments as in
4927 struct attribute_spec.handler. */
4930 handle_always_inline_attribute (node
, name
, args
, flags
, no_add_attrs
)
4933 tree args ATTRIBUTE_UNUSED
;
4934 int flags ATTRIBUTE_UNUSED
;
4937 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4939 /* Do nothing else, just set the attribute. We'll get at
4940 it later with lookup_attribute. */
4944 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4945 *no_add_attrs
= true;
4951 /* Handle a "used" attribute; arguments as in
4952 struct attribute_spec.handler. */
4955 handle_used_attribute (pnode
, name
, args
, flags
, no_add_attrs
)
4958 tree args ATTRIBUTE_UNUSED
;
4959 int flags ATTRIBUTE_UNUSED
;
4964 if (TREE_CODE (node
) == FUNCTION_DECL
4965 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
)))
4966 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (node
))
4967 = TREE_USED (node
) = 1;
4970 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
4971 *no_add_attrs
= true;
4977 /* Handle a "unused" attribute; arguments as in
4978 struct attribute_spec.handler. */
4981 handle_unused_attribute (node
, name
, args
, flags
, no_add_attrs
)
4984 tree args ATTRIBUTE_UNUSED
;
4992 if (TREE_CODE (decl
) == PARM_DECL
4993 || TREE_CODE (decl
) == VAR_DECL
4994 || TREE_CODE (decl
) == FUNCTION_DECL
4995 || TREE_CODE (decl
) == LABEL_DECL
4996 || TREE_CODE (decl
) == TYPE_DECL
)
4997 TREE_USED (decl
) = 1;
5000 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5001 *no_add_attrs
= true;
5006 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5007 *node
= build_type_copy (*node
);
5008 TREE_USED (*node
) = 1;
5014 /* Handle a "const" attribute; arguments as in
5015 struct attribute_spec.handler. */
5018 handle_const_attribute (node
, name
, args
, flags
, no_add_attrs
)
5021 tree args ATTRIBUTE_UNUSED
;
5022 int flags ATTRIBUTE_UNUSED
;
5025 tree type
= TREE_TYPE (*node
);
5027 /* See FIXME comment on noreturn in c_common_attribute_table. */
5028 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5029 TREE_READONLY (*node
) = 1;
5030 else if (TREE_CODE (type
) == POINTER_TYPE
5031 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
5033 = build_pointer_type
5034 (build_type_variant (TREE_TYPE (type
), 1,
5035 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
5038 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5039 *no_add_attrs
= true;
5045 /* Handle a "transparent_union" attribute; arguments as in
5046 struct attribute_spec.handler. */
5049 handle_transparent_union_attribute (node
, name
, args
, flags
, no_add_attrs
)
5052 tree args ATTRIBUTE_UNUSED
;
5056 tree decl
= NULL_TREE
;
5063 type
= &TREE_TYPE (decl
);
5064 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
5066 else if (TYPE_P (*node
))
5067 type
= node
, is_type
= 1;
5070 && TREE_CODE (*type
) == UNION_TYPE
5072 || (TYPE_FIELDS (*type
) != 0
5073 && TYPE_MODE (*type
) == DECL_MODE (TYPE_FIELDS (*type
)))))
5075 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5076 *type
= build_type_copy (*type
);
5077 TYPE_TRANSPARENT_UNION (*type
) = 1;
5079 else if (decl
!= 0 && TREE_CODE (decl
) == PARM_DECL
5080 && TREE_CODE (*type
) == UNION_TYPE
5081 && TYPE_MODE (*type
) == DECL_MODE (TYPE_FIELDS (*type
)))
5082 DECL_TRANSPARENT_UNION (decl
) = 1;
5085 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5086 *no_add_attrs
= true;
5092 /* Handle a "constructor" attribute; arguments as in
5093 struct attribute_spec.handler. */
5096 handle_constructor_attribute (node
, name
, args
, flags
, no_add_attrs
)
5099 tree args ATTRIBUTE_UNUSED
;
5100 int flags ATTRIBUTE_UNUSED
;
5104 tree type
= TREE_TYPE (decl
);
5106 if (TREE_CODE (decl
) == FUNCTION_DECL
5107 && TREE_CODE (type
) == FUNCTION_TYPE
5108 && decl_function_context (decl
) == 0)
5110 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
5111 TREE_USED (decl
) = 1;
5115 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5116 *no_add_attrs
= true;
5122 /* Handle a "destructor" attribute; arguments as in
5123 struct attribute_spec.handler. */
5126 handle_destructor_attribute (node
, name
, args
, flags
, no_add_attrs
)
5129 tree args ATTRIBUTE_UNUSED
;
5130 int flags ATTRIBUTE_UNUSED
;
5134 tree type
= TREE_TYPE (decl
);
5136 if (TREE_CODE (decl
) == FUNCTION_DECL
5137 && TREE_CODE (type
) == FUNCTION_TYPE
5138 && decl_function_context (decl
) == 0)
5140 DECL_STATIC_DESTRUCTOR (decl
) = 1;
5141 TREE_USED (decl
) = 1;
5145 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5146 *no_add_attrs
= true;
5152 /* Handle a "mode" attribute; arguments as in
5153 struct attribute_spec.handler. */
5156 handle_mode_attribute (node
, name
, args
, flags
, no_add_attrs
)
5160 int flags ATTRIBUTE_UNUSED
;
5165 *no_add_attrs
= true;
5167 if (TREE_CODE (TREE_VALUE (args
)) != IDENTIFIER_NODE
)
5168 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5172 const char *p
= IDENTIFIER_POINTER (TREE_VALUE (args
));
5173 int len
= strlen (p
);
5174 enum machine_mode mode
= VOIDmode
;
5178 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
5179 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
5181 char *newp
= (char *) alloca (len
- 1);
5183 strcpy (newp
, &p
[2]);
5184 newp
[len
- 4] = '\0';
5188 /* Change this type to have a type with the specified mode.
5189 First check for the special modes. */
5190 if (! strcmp (p
, "byte"))
5192 else if (!strcmp (p
, "word"))
5194 else if (! strcmp (p
, "pointer"))
5197 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
5198 if (!strcmp (p
, GET_MODE_NAME (j
)))
5199 mode
= (enum machine_mode
) j
;
5201 if (mode
== VOIDmode
)
5202 error ("unknown machine mode `%s'", p
);
5203 else if (0 == (typefm
= (*lang_hooks
.types
.type_for_mode
)
5204 (mode
, TREE_UNSIGNED (type
))))
5205 error ("no data type for mode `%s'", p
);
5206 else if ((TREE_CODE (type
) == POINTER_TYPE
5207 || TREE_CODE (type
) == REFERENCE_TYPE
)
5208 && !(*targetm
.valid_pointer_mode
) (mode
))
5209 error ("invalid pointer mode `%s'", p
);
5212 /* If this is a vector, make sure we either have hardware
5213 support, or we can emulate it. */
5214 if ((GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
5215 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
5216 && !vector_mode_valid_p (mode
))
5218 error ("unable to emulate '%s'", GET_MODE_NAME (mode
));
5222 if (TREE_CODE (type
) == POINTER_TYPE
)
5224 ptr_type
= build_pointer_type_for_mode (TREE_TYPE (type
),
5228 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
5230 ptr_type
= build_reference_type_for_mode (TREE_TYPE (type
),
5236 /* No need to layout the type here. The caller should do this. */
5243 /* Handle a "section" attribute; arguments as in
5244 struct attribute_spec.handler. */
5247 handle_section_attribute (node
, name
, args
, flags
, no_add_attrs
)
5249 tree name ATTRIBUTE_UNUSED
;
5251 int flags ATTRIBUTE_UNUSED
;
5256 if (targetm
.have_named_sections
)
5258 if ((TREE_CODE (decl
) == FUNCTION_DECL
5259 || TREE_CODE (decl
) == VAR_DECL
)
5260 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
5262 if (TREE_CODE (decl
) == VAR_DECL
5263 && current_function_decl
!= NULL_TREE
5264 && ! TREE_STATIC (decl
))
5266 error_with_decl (decl
,
5267 "section attribute cannot be specified for local variables");
5268 *no_add_attrs
= true;
5271 /* The decl may have already been given a section attribute
5272 from a previous declaration. Ensure they match. */
5273 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
5274 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
5275 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
5277 error_with_decl (*node
,
5278 "section of `%s' conflicts with previous declaration");
5279 *no_add_attrs
= true;
5282 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
5286 error_with_decl (*node
,
5287 "section attribute not allowed for `%s'");
5288 *no_add_attrs
= true;
5293 error_with_decl (*node
,
5294 "section attributes are not supported for this target");
5295 *no_add_attrs
= true;
5301 /* Handle a "aligned" attribute; arguments as in
5302 struct attribute_spec.handler. */
5305 handle_aligned_attribute (node
, name
, args
, flags
, no_add_attrs
)
5307 tree name ATTRIBUTE_UNUSED
;
5312 tree decl
= NULL_TREE
;
5315 tree align_expr
= (args
? TREE_VALUE (args
)
5316 : size_int (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
5322 type
= &TREE_TYPE (decl
);
5323 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
5325 else if (TYPE_P (*node
))
5326 type
= node
, is_type
= 1;
5328 /* Strip any NOPs of any kind. */
5329 while (TREE_CODE (align_expr
) == NOP_EXPR
5330 || TREE_CODE (align_expr
) == CONVERT_EXPR
5331 || TREE_CODE (align_expr
) == NON_LVALUE_EXPR
)
5332 align_expr
= TREE_OPERAND (align_expr
, 0);
5334 if (TREE_CODE (align_expr
) != INTEGER_CST
)
5336 error ("requested alignment is not a constant");
5337 *no_add_attrs
= true;
5339 else if ((i
= tree_log2 (align_expr
)) == -1)
5341 error ("requested alignment is not a power of 2");
5342 *no_add_attrs
= true;
5344 else if (i
> HOST_BITS_PER_INT
- 2)
5346 error ("requested alignment is too large");
5347 *no_add_attrs
= true;
5351 /* If we have a TYPE_DECL, then copy the type, so that we
5352 don't accidentally modify a builtin type. See pushdecl. */
5353 if (decl
&& TREE_TYPE (decl
) != error_mark_node
5354 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
5356 tree tt
= TREE_TYPE (decl
);
5357 *type
= build_type_copy (*type
);
5358 DECL_ORIGINAL_TYPE (decl
) = tt
;
5359 TYPE_NAME (*type
) = decl
;
5360 TREE_USED (*type
) = TREE_USED (decl
);
5361 TREE_TYPE (decl
) = *type
;
5363 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5364 *type
= build_type_copy (*type
);
5366 TYPE_ALIGN (*type
) = (1 << i
) * BITS_PER_UNIT
;
5367 TYPE_USER_ALIGN (*type
) = 1;
5369 else if (TREE_CODE (decl
) != VAR_DECL
5370 && TREE_CODE (decl
) != FIELD_DECL
)
5372 error_with_decl (decl
,
5373 "alignment may not be specified for `%s'");
5374 *no_add_attrs
= true;
5378 DECL_ALIGN (decl
) = (1 << i
) * BITS_PER_UNIT
;
5379 DECL_USER_ALIGN (decl
) = 1;
5385 /* Handle a "weak" attribute; arguments as in
5386 struct attribute_spec.handler. */
5389 handle_weak_attribute (node
, name
, args
, flags
, no_add_attrs
)
5391 tree name ATTRIBUTE_UNUSED
;
5392 tree args ATTRIBUTE_UNUSED
;
5393 int flags ATTRIBUTE_UNUSED
;
5394 bool *no_add_attrs ATTRIBUTE_UNUSED
;
5396 declare_weak (*node
);
5401 /* Handle an "alias" attribute; arguments as in
5402 struct attribute_spec.handler. */
5405 handle_alias_attribute (node
, name
, args
, flags
, no_add_attrs
)
5409 int flags ATTRIBUTE_UNUSED
;
5414 if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
5415 || (TREE_CODE (decl
) != FUNCTION_DECL
&& ! DECL_EXTERNAL (decl
)))
5417 error_with_decl (decl
,
5418 "`%s' defined both normally and as an alias");
5419 *no_add_attrs
= true;
5421 else if (decl_function_context (decl
) == 0)
5425 id
= TREE_VALUE (args
);
5426 if (TREE_CODE (id
) != STRING_CST
)
5428 error ("alias arg not a string");
5429 *no_add_attrs
= true;
5432 id
= get_identifier (TREE_STRING_POINTER (id
));
5433 /* This counts as a use of the object pointed to. */
5436 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5437 DECL_INITIAL (decl
) = error_mark_node
;
5439 DECL_EXTERNAL (decl
) = 0;
5443 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5444 *no_add_attrs
= true;
5450 /* Handle an "visibility" attribute; arguments as in
5451 struct attribute_spec.handler. */
5454 handle_visibility_attribute (node
, name
, args
, flags
, no_add_attrs
)
5458 int flags ATTRIBUTE_UNUSED
;
5463 if (decl_function_context (decl
) != 0 || ! TREE_PUBLIC (decl
))
5465 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5466 *no_add_attrs
= true;
5472 id
= TREE_VALUE (args
);
5473 if (TREE_CODE (id
) != STRING_CST
)
5475 error ("visibility arg not a string");
5476 *no_add_attrs
= true;
5479 if (strcmp (TREE_STRING_POINTER (id
), "hidden")
5480 && strcmp (TREE_STRING_POINTER (id
), "protected")
5481 && strcmp (TREE_STRING_POINTER (id
), "internal")
5482 && strcmp (TREE_STRING_POINTER (id
), "default"))
5484 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5485 *no_add_attrs
= true;
5493 /* Handle an "tls_model" attribute; arguments as in
5494 struct attribute_spec.handler. */
5497 handle_tls_model_attribute (node
, name
, args
, flags
, no_add_attrs
)
5501 int flags ATTRIBUTE_UNUSED
;
5506 if (! DECL_THREAD_LOCAL (decl
))
5508 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5509 *no_add_attrs
= true;
5515 id
= TREE_VALUE (args
);
5516 if (TREE_CODE (id
) != STRING_CST
)
5518 error ("tls_model arg not a string");
5519 *no_add_attrs
= true;
5522 if (strcmp (TREE_STRING_POINTER (id
), "local-exec")
5523 && strcmp (TREE_STRING_POINTER (id
), "initial-exec")
5524 && strcmp (TREE_STRING_POINTER (id
), "local-dynamic")
5525 && strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
5527 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5528 *no_add_attrs
= true;
5536 /* Handle a "no_instrument_function" attribute; arguments as in
5537 struct attribute_spec.handler. */
5540 handle_no_instrument_function_attribute (node
, name
, args
, flags
, no_add_attrs
)
5543 tree args ATTRIBUTE_UNUSED
;
5544 int flags ATTRIBUTE_UNUSED
;
5549 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5551 error_with_decl (decl
,
5552 "`%s' attribute applies only to functions",
5553 IDENTIFIER_POINTER (name
));
5554 *no_add_attrs
= true;
5556 else if (DECL_INITIAL (decl
))
5558 error_with_decl (decl
,
5559 "can't set `%s' attribute after definition",
5560 IDENTIFIER_POINTER (name
));
5561 *no_add_attrs
= true;
5564 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
5569 /* Handle a "malloc" attribute; arguments as in
5570 struct attribute_spec.handler. */
5573 handle_malloc_attribute (node
, name
, args
, flags
, no_add_attrs
)
5576 tree args ATTRIBUTE_UNUSED
;
5577 int flags ATTRIBUTE_UNUSED
;
5580 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5581 DECL_IS_MALLOC (*node
) = 1;
5582 /* ??? TODO: Support types. */
5585 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5586 *no_add_attrs
= true;
5592 /* Handle a "no_limit_stack" attribute; arguments as in
5593 struct attribute_spec.handler. */
5596 handle_no_limit_stack_attribute (node
, name
, args
, flags
, no_add_attrs
)
5599 tree args ATTRIBUTE_UNUSED
;
5600 int flags ATTRIBUTE_UNUSED
;
5605 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5607 error_with_decl (decl
,
5608 "`%s' attribute applies only to functions",
5609 IDENTIFIER_POINTER (name
));
5610 *no_add_attrs
= true;
5612 else if (DECL_INITIAL (decl
))
5614 error_with_decl (decl
,
5615 "can't set `%s' attribute after definition",
5616 IDENTIFIER_POINTER (name
));
5617 *no_add_attrs
= true;
5620 DECL_NO_LIMIT_STACK (decl
) = 1;
5625 /* Handle a "pure" attribute; arguments as in
5626 struct attribute_spec.handler. */
5629 handle_pure_attribute (node
, name
, args
, flags
, no_add_attrs
)
5632 tree args ATTRIBUTE_UNUSED
;
5633 int flags ATTRIBUTE_UNUSED
;
5636 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5637 DECL_IS_PURE (*node
) = 1;
5638 /* ??? TODO: Support types. */
5641 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5642 *no_add_attrs
= true;
5648 /* Handle a "deprecated" attribute; arguments as in
5649 struct attribute_spec.handler. */
5652 handle_deprecated_attribute (node
, name
, args
, flags
, no_add_attrs
)
5655 tree args ATTRIBUTE_UNUSED
;
5659 tree type
= NULL_TREE
;
5661 const char *what
= NULL
;
5666 type
= TREE_TYPE (decl
);
5668 if (TREE_CODE (decl
) == TYPE_DECL
5669 || TREE_CODE (decl
) == PARM_DECL
5670 || TREE_CODE (decl
) == VAR_DECL
5671 || TREE_CODE (decl
) == FUNCTION_DECL
5672 || TREE_CODE (decl
) == FIELD_DECL
)
5673 TREE_DEPRECATED (decl
) = 1;
5677 else if (TYPE_P (*node
))
5679 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5680 *node
= build_type_copy (*node
);
5681 TREE_DEPRECATED (*node
) = 1;
5689 *no_add_attrs
= true;
5690 if (type
&& TYPE_NAME (type
))
5692 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
5693 what
= IDENTIFIER_POINTER (TYPE_NAME (*node
));
5694 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
5695 && DECL_NAME (TYPE_NAME (type
)))
5696 what
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
)));
5699 warning ("`%s' attribute ignored for `%s'",
5700 IDENTIFIER_POINTER (name
), what
);
5702 warning ("`%s' attribute ignored",
5703 IDENTIFIER_POINTER (name
));
5709 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5710 to prevent us from duplicating type nodes unnecessarily.
5711 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5712 since we want to distinguish types that are essentially identical (except
5713 for their debug representation), we use a local list here. */
5714 static GTY(()) tree vector_type_node_list
= 0;
5716 /* Handle a "vector_size" attribute; arguments as in
5717 struct attribute_spec.handler. */
5720 handle_vector_size_attribute (node
, name
, args
, flags
, no_add_attrs
)
5724 int flags ATTRIBUTE_UNUSED
;
5727 unsigned HOST_WIDE_INT vecsize
, nunits
;
5728 enum machine_mode mode
, orig_mode
, new_mode
;
5729 tree type
= *node
, new_type
= NULL_TREE
;
5730 tree type_list_node
;
5732 *no_add_attrs
= true;
5734 if (! host_integerp (TREE_VALUE (args
), 1))
5736 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
5740 /* Get the vector size (in bytes). */
5741 vecsize
= tree_low_cst (TREE_VALUE (args
), 1);
5743 /* We need to provide for vector pointers, vector arrays, and
5744 functions returning vectors. For example:
5746 __attribute__((vector_size(16))) short *foo;
5748 In this case, the mode is SI, but the type being modified is
5749 HI, so we need to look further. */
5751 while (POINTER_TYPE_P (type
)
5752 || TREE_CODE (type
) == FUNCTION_TYPE
5753 || TREE_CODE (type
) == ARRAY_TYPE
)
5754 type
= TREE_TYPE (type
);
5756 /* Get the mode of the type being modified. */
5757 orig_mode
= TYPE_MODE (type
);
5759 if (TREE_CODE (type
) == RECORD_TYPE
5760 || (GET_MODE_CLASS (orig_mode
) != MODE_FLOAT
5761 && GET_MODE_CLASS (orig_mode
) != MODE_INT
)
5762 || ! host_integerp (TYPE_SIZE_UNIT (type
), 1))
5764 error ("invalid vector type for attribute `%s'",
5765 IDENTIFIER_POINTER (name
));
5769 /* Calculate how many units fit in the vector. */
5770 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5772 /* Find a suitably sized vector. */
5773 new_mode
= VOIDmode
;
5774 for (mode
= GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode
) == MODE_INT
5776 : MODE_VECTOR_FLOAT
);
5778 mode
= GET_MODE_WIDER_MODE (mode
))
5779 if (vecsize
== GET_MODE_SIZE (mode
)
5780 && nunits
== (unsigned HOST_WIDE_INT
) GET_MODE_NUNITS (mode
))
5786 if (new_mode
== VOIDmode
)
5788 error ("no vector mode with the size and type specified could be found");
5792 for (type_list_node
= vector_type_node_list
; type_list_node
;
5793 type_list_node
= TREE_CHAIN (type_list_node
))
5795 tree other_type
= TREE_VALUE (type_list_node
);
5796 tree record
= TYPE_DEBUG_REPRESENTATION_TYPE (other_type
);
5797 tree fields
= TYPE_FIELDS (record
);
5798 tree field_type
= TREE_TYPE (fields
);
5799 tree array_type
= TREE_TYPE (field_type
);
5800 if (TREE_CODE (fields
) != FIELD_DECL
5801 || TREE_CODE (field_type
) != ARRAY_TYPE
)
5804 if (TYPE_MODE (other_type
) == mode
&& type
== array_type
)
5806 new_type
= other_type
;
5811 if (new_type
== NULL_TREE
)
5813 tree index
, array
, rt
, list_node
;
5815 new_type
= (*lang_hooks
.types
.type_for_mode
) (new_mode
,
5816 TREE_UNSIGNED (type
));
5820 error ("no vector mode with the size and type specified could be found");
5824 new_type
= build_type_copy (new_type
);
5826 /* If this is a vector, make sure we either have hardware
5827 support, or we can emulate it. */
5828 if ((GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
5829 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
5830 && !vector_mode_valid_p (mode
))
5832 error ("unable to emulate '%s'", GET_MODE_NAME (mode
));
5836 /* Set the debug information here, because this is the only
5837 place where we know the underlying type for a vector made
5838 with vector_size. For debugging purposes we pretend a vector
5839 is an array within a structure. */
5840 index
= build_int_2 (TYPE_VECTOR_SUBPARTS (new_type
) - 1, 0);
5841 array
= build_array_type (type
, build_index_type (index
));
5842 rt
= make_node (RECORD_TYPE
);
5844 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
5845 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
5847 TYPE_DEBUG_REPRESENTATION_TYPE (new_type
) = rt
;
5849 list_node
= build_tree_list (NULL
, new_type
);
5850 TREE_CHAIN (list_node
) = vector_type_node_list
;
5851 vector_type_node_list
= list_node
;
5854 /* Build back pointers if needed. */
5855 *node
= vector_size_helper (*node
, new_type
);
5860 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5863 If we requested a pointer to a vector, build up the pointers that
5864 we stripped off while looking for the inner type. Similarly for
5865 return values from functions.
5867 The argument "type" is the top of the chain, and "bottom" is the
5868 new type which we will point to. */
5871 vector_size_helper (type
, bottom
)
5876 if (POINTER_TYPE_P (type
))
5878 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
5879 outer
= build_pointer_type (inner
);
5881 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5883 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
5884 outer
= build_array_type (inner
, TYPE_VALUES (type
));
5886 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
5888 inner
= vector_size_helper (TREE_TYPE (type
), bottom
);
5889 outer
= build_function_type (inner
, TYPE_VALUES (type
));
5894 TREE_READONLY (outer
) = TREE_READONLY (type
);
5895 TREE_THIS_VOLATILE (outer
) = TREE_THIS_VOLATILE (type
);
5900 /* Handle the "nonnull" attribute. */
5902 handle_nonnull_attribute (node
, name
, args
, flags
, no_add_attrs
)
5904 tree name ATTRIBUTE_UNUSED
;
5906 int flags ATTRIBUTE_UNUSED
;
5910 unsigned HOST_WIDE_INT attr_arg_num
;
5912 /* If no arguments are specified, all pointer arguments should be
5913 non-null. Verify a full prototype is given so that the arguments
5914 will have the correct types when we actually check them later. */
5917 if (! TYPE_ARG_TYPES (type
))
5919 error ("nonnull attribute without arguments on a non-prototype");
5920 *no_add_attrs
= true;
5925 /* Argument list specified. Verify that each argument number references
5926 a pointer argument. */
5927 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
5930 unsigned HOST_WIDE_INT arg_num
, ck_num
;
5932 if (! get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
5934 error ("nonnull argument has invalid operand number (arg %lu)",
5935 (unsigned long) attr_arg_num
);
5936 *no_add_attrs
= true;
5940 argument
= TYPE_ARG_TYPES (type
);
5943 for (ck_num
= 1; ; ck_num
++)
5945 if (! argument
|| ck_num
== arg_num
)
5947 argument
= TREE_CHAIN (argument
);
5951 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
5953 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5954 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5955 *no_add_attrs
= true;
5959 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
5961 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5962 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5963 *no_add_attrs
= true;
5972 /* Check the argument list of a function call for null in argument slots
5973 that are marked as requiring a non-null pointer argument. */
5976 check_function_nonnull (attrs
, params
)
5980 tree a
, args
, param
;
5983 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
5985 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
5987 args
= TREE_VALUE (a
);
5989 /* Walk the argument list. If we encounter an argument number we
5990 should check for non-null, do it. If the attribute has no args,
5991 then every pointer argument is checked (in which case the check
5992 for pointer type is done in check_nonnull_arg). */
5993 for (param
= params
, param_num
= 1; ;
5994 param_num
++, param
= TREE_CHAIN (param
))
5998 if (! args
|| nonnull_check_p (args
, param_num
))
5999 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
6007 /* Helper for check_function_nonnull; given a list of operands which
6008 must be non-null in ARGS, determine if operand PARAM_NUM should be
6012 nonnull_check_p (args
, param_num
)
6014 unsigned HOST_WIDE_INT param_num
;
6016 unsigned HOST_WIDE_INT arg_num
;
6018 for (; args
; args
= TREE_CHAIN (args
))
6020 if (! get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
6023 if (arg_num
== param_num
)
6029 /* Check that the function argument PARAM (which is operand number
6030 PARAM_NUM) is non-null. This is called by check_function_nonnull
6031 via check_function_arguments_recurse. */
6034 check_nonnull_arg (ctx
, param
, param_num
)
6035 void *ctx ATTRIBUTE_UNUSED
;
6037 unsigned HOST_WIDE_INT param_num
;
6039 /* Just skip checking the argument if it's not a pointer. This can
6040 happen if the "nonnull" attribute was given without an operand
6041 list (which means to check every pointer argument). */
6043 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
6046 if (integer_zerop (param
))
6047 warning ("null argument where non-null required (arg %lu)",
6048 (unsigned long) param_num
);
6051 /* Helper for nonnull attribute handling; fetch the operand number
6052 from the attribute argument list. */
6055 get_nonnull_operand (arg_num_expr
, valp
)
6057 unsigned HOST_WIDE_INT
*valp
;
6059 /* Strip any conversions from the arg number and verify they
6061 while (TREE_CODE (arg_num_expr
) == NOP_EXPR
6062 || TREE_CODE (arg_num_expr
) == CONVERT_EXPR
6063 || TREE_CODE (arg_num_expr
) == NON_LVALUE_EXPR
)
6064 arg_num_expr
= TREE_OPERAND (arg_num_expr
, 0);
6066 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
6067 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
6070 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
6074 /* Handle a "nothrow" attribute; arguments as in
6075 struct attribute_spec.handler. */
6078 handle_nothrow_attribute (node
, name
, args
, flags
, no_add_attrs
)
6081 tree args ATTRIBUTE_UNUSED
;
6082 int flags ATTRIBUTE_UNUSED
;
6085 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6086 TREE_NOTHROW (*node
) = 1;
6087 /* ??? TODO: Support types. */
6090 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name
));
6091 *no_add_attrs
= true;
6097 /* Check for valid arguments being passed to a function. */
6099 check_function_arguments (attrs
, params
)
6103 /* Check for null being passed in a pointer argument that must be
6104 non-null. We also need to do this if format checking is enabled. */
6107 check_function_nonnull (attrs
, params
);
6109 /* Check for errors in format strings. */
6112 check_function_format (NULL
, attrs
, params
);
6115 /* Generic argument checking recursion routine. PARAM is the argument to
6116 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
6117 once the argument is resolved. CTX is context for the callback. */
6119 check_function_arguments_recurse (callback
, ctx
, param
, param_num
)
6120 void (*callback
) PARAMS ((void *, tree
, unsigned HOST_WIDE_INT
));
6123 unsigned HOST_WIDE_INT param_num
;
6125 if (TREE_CODE (param
) == NOP_EXPR
)
6127 /* Strip coercion. */
6128 check_function_arguments_recurse (callback
, ctx
,
6129 TREE_OPERAND (param
, 0), param_num
);
6133 if (TREE_CODE (param
) == CALL_EXPR
)
6135 tree type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (param
, 0)));
6137 bool found_format_arg
= false;
6139 /* See if this is a call to a known internationalization function
6140 that modifies a format arg. Such a function may have multiple
6141 format_arg attributes (for example, ngettext). */
6143 for (attrs
= TYPE_ATTRIBUTES (type
);
6145 attrs
= TREE_CHAIN (attrs
))
6146 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
6149 tree format_num_expr
;
6153 /* Extract the argument number, which was previously checked
6155 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
6156 while (TREE_CODE (format_num_expr
) == NOP_EXPR
6157 || TREE_CODE (format_num_expr
) == CONVERT_EXPR
6158 || TREE_CODE (format_num_expr
) == NON_LVALUE_EXPR
)
6159 format_num_expr
= TREE_OPERAND (format_num_expr
, 0);
6161 if (TREE_CODE (format_num_expr
) != INTEGER_CST
6162 || TREE_INT_CST_HIGH (format_num_expr
) != 0)
6165 format_num
= TREE_INT_CST_LOW (format_num_expr
);
6167 for (inner_args
= TREE_OPERAND (param
, 1), i
= 1;
6169 inner_args
= TREE_CHAIN (inner_args
), i
++)
6170 if (i
== format_num
)
6172 check_function_arguments_recurse (callback
, ctx
,
6173 TREE_VALUE (inner_args
),
6175 found_format_arg
= true;
6180 /* If we found a format_arg attribute and did a recursive check,
6181 we are done with checking this argument. Otherwise, we continue
6182 and this will be considered a non-literal. */
6183 if (found_format_arg
)
6187 if (TREE_CODE (param
) == COND_EXPR
)
6189 /* Check both halves of the conditional expression. */
6190 check_function_arguments_recurse (callback
, ctx
,
6191 TREE_OPERAND (param
, 1), param_num
);
6192 check_function_arguments_recurse (callback
, ctx
,
6193 TREE_OPERAND (param
, 2), param_num
);
6197 (*callback
) (ctx
, param
, param_num
);
6200 #include "gt-c-common.h"