1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
33 #include "expr.h" /* For vector_mode_valid_p */
39 #include "langhooks.h"
40 #include "tree-inline.h"
43 #include "diagnostic.h"
44 #include "tree-iterator.h"
46 #include "tree-mudflap.h"
49 #include "target-def.h"
52 cpp_reader *parse_in; /* Declared in c-pragma.h. */
54 /* The following symbols are subsumed in the c_global_trees array, and
55 listed here individually for documentation purposes.
57 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
59 tree short_integer_type_node;
60 tree long_integer_type_node;
61 tree long_long_integer_type_node;
63 tree short_unsigned_type_node;
64 tree long_unsigned_type_node;
65 tree long_long_unsigned_type_node;
67 tree truthvalue_type_node;
68 tree truthvalue_false_node;
69 tree truthvalue_true_node;
71 tree ptrdiff_type_node;
73 tree unsigned_char_type_node;
74 tree signed_char_type_node;
77 tree char16_type_node;
78 tree char32_type_node;
81 tree double_type_node;
82 tree long_double_type_node;
84 tree complex_integer_type_node;
85 tree complex_float_type_node;
86 tree complex_double_type_node;
87 tree complex_long_double_type_node;
89 tree dfloat32_type_node;
90 tree dfloat64_type_node;
91 tree_dfloat128_type_node;
99 tree unsigned_intQI_type_node;
100 tree unsigned_intHI_type_node;
101 tree unsigned_intSI_type_node;
102 tree unsigned_intDI_type_node;
103 tree unsigned_intTI_type_node;
105 tree widest_integer_literal_type_node;
106 tree widest_unsigned_literal_type_node;
108 Nodes for types `void *' and `const void *'.
110 tree ptr_type_node, const_ptr_type_node;
112 Nodes for types `char *' and `const char *'.
114 tree string_type_node, const_string_type_node;
116 Type `char[SOMENUMBER]'.
117 Used when an array of char is needed and the size is irrelevant.
119 tree char_array_type_node;
121 Type `int[SOMENUMBER]' or something like it.
122 Used when an array of int needed and the size is irrelevant.
124 tree int_array_type_node;
126 Type `wchar_t[SOMENUMBER]' or something like it.
127 Used when a wide string literal is created.
129 tree wchar_array_type_node;
131 Type `char16_t[SOMENUMBER]' or something like it.
132 Used when a UTF-16 string literal is created.
134 tree char16_array_type_node;
136 Type `char32_t[SOMENUMBER]' or something like it.
137 Used when a UTF-32 string literal is created.
139 tree char32_array_type_node;
141 Type `int ()' -- used for implicit declaration of functions.
143 tree default_function_type;
145 A VOID_TYPE node, packaged in a TREE_LIST.
149 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
150 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
151 VAR_DECLS, but C++ does.)
153 tree function_name_decl_node;
154 tree pretty_function_name_decl_node;
155 tree c99_function_name_decl_node;
157 Stack of nested function name VAR_DECLs.
159 tree saved_function_name_decls;
163 tree c_global_trees[CTI_MAX];
165 /* Switches common to the C front ends. */
167 /* Nonzero if preprocessing only. */
169 int flag_preprocess_only;
171 /* Nonzero means don't output line number information. */
173 char flag_no_line_commands;
175 /* Nonzero causes -E output not to be done, but directives such as
176 #define that have side effects are still obeyed. */
180 /* Nonzero means dump macros in some fashion. */
182 char flag_dump_macros;
184 /* Nonzero means pass #include lines through to the output. */
186 char flag_dump_includes;
188 /* Nonzero means process PCH files while preprocessing. */
190 bool flag_pch_preprocess;
192 /* The file name to which we should write a precompiled header, or
193 NULL if no header will be written in this compile. */
195 const char *pch_file;
197 /* Nonzero if an ISO standard was selected. It rejects macros in the
201 /* Nonzero if -undef was given. It suppresses target built-in macros
205 /* Nonzero means don't recognize the non-ANSI builtin functions. */
209 /* Nonzero means don't recognize the non-ANSI builtin functions.
212 int flag_no_nonansi_builtin;
214 /* Nonzero means give `double' the same size as `float'. */
216 int flag_short_double;
218 /* Nonzero means give `wchar_t' the same size as `short'. */
220 int flag_short_wchar;
222 /* Nonzero means allow implicit conversions between vectors with
223 differing numbers of subparts and/or differing element types. */
224 int flag_lax_vector_conversions;
226 /* Nonzero means allow Microsoft extensions without warnings or errors. */
227 int flag_ms_extensions;
229 /* Nonzero means don't recognize the keyword `asm'. */
233 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
235 int flag_signed_bitfields = 1;
237 /* Warn about #pragma directives that are not recognized. */
239 int warn_unknown_pragmas; /* Tri state variable. */
241 /* Warn about format/argument anomalies in calls to formatted I/O functions
242 (*printf, *scanf, strftime, strfmon, etc.). */
246 /* Warn about using __null (as NULL in C++) as sentinel. For code compiled
247 with GCC this doesn't matter as __null is guaranteed to have the right
250 int warn_strict_null_sentinel;
252 /* Zero means that faster, ...NonNil variants of objc_msgSend...
253 calls will be used in ObjC; passing nil receivers to such calls
254 will most likely result in crashes. */
255 int flag_nil_receivers = 1;
257 /* Nonzero means that code generation will be altered to support
258 "zero-link" execution. This currently affects ObjC only, but may
259 affect other languages in the future. */
260 int flag_zero_link = 0;
262 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
263 unit. It will inform the ObjC runtime that class definition(s) herein
264 contained are to replace one(s) previously loaded. */
265 int flag_replace_objc_classes = 0;
267 /* C/ObjC language option variables. */
270 /* Nonzero means allow type mismatches in conditional expressions;
271 just make their values `void'. */
273 int flag_cond_mismatch;
275 /* Nonzero means enable C89 Amendment 1 features. */
279 /* Nonzero means use the ISO C99 (or C1X) dialect of C. */
283 /* Nonzero means use the ISO C1X dialect of C. */
287 /* Nonzero means that we have builtin functions, and main is an int. */
292 /* ObjC language option variables. */
295 /* Open and close the file for outputting class declarations, if
298 int flag_gen_declaration;
300 /* Tells the compiler that this is a special run. Do not perform any
301 compiling, instead we are to test some platform dependent features
302 and output a C header file with appropriate definitions. */
304 int print_struct_values;
306 /* Tells the compiler what is the constant string class for ObjC. */
308 const char *constant_string_class_name;
311 /* C++ language option variables. */
314 /* Nonzero means don't recognize any extension keywords. */
316 int flag_no_gnu_keywords;
318 /* Nonzero means do emit exported implementations of functions even if
319 they can be inlined. */
321 int flag_implement_inlines = 1;
323 /* Nonzero means that implicit instantiations will be emitted if needed. */
325 int flag_implicit_templates = 1;
327 /* Nonzero means that implicit instantiations of inline templates will be
328 emitted if needed, even if instantiations of non-inline templates
331 int flag_implicit_inline_templates = 1;
333 /* Nonzero means generate separate instantiation control files and
334 juggle them at link time. */
336 int flag_use_repository;
338 /* Nonzero if we want to issue diagnostics that the standard says are not
341 int flag_optional_diags = 1;
343 /* Nonzero means we should attempt to elide constructors when possible. */
345 int flag_elide_constructors = 1;
347 /* Nonzero means that member functions defined in class scope are
348 inline by default. */
350 int flag_default_inline = 1;
352 /* Controls whether compiler generates 'type descriptor' that give
353 run-time type information. */
357 /* Nonzero if we want to conserve space in the .o files. We do this
358 by putting uninitialized data and runtime initialized data into
359 .common instead of .data at the expense of not flagging multiple
362 int flag_conserve_space;
364 /* Nonzero if we want to obey access control semantics. */
366 int flag_access_control = 1;
368 /* Nonzero if we want to check the return value of new and avoid calling
369 constructors if it is a null pointer. */
373 /* The C++ dialect being used. C++98 is the default. */
375 enum cxx_dialect cxx_dialect = cxx98;
377 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
378 initialization variables.
379 0: Old rules, set by -fno-for-scope.
380 2: New ISO rules, set by -ffor-scope.
381 1: Try to implement new ISO rules, but with backup compatibility
382 (and warnings). This is the default, for now. */
384 int flag_new_for_scope = 1;
386 /* Nonzero if we want to emit defined symbols with common-like linkage as
387 weak symbols where possible, in order to conform to C++ semantics.
388 Otherwise, emit them as local symbols. */
392 /* 0 means we want the preprocessor to not emit line directives for
393 the current working directory. 1 means we want it to do it. -1
394 means we should decide depending on whether debugging information
395 is being emitted or not. */
397 int flag_working_directory = -1;
399 /* Nonzero to use __cxa_atexit, rather than atexit, to register
400 destructors for local statics and global objects. '2' means it has been
401 set nonzero as a default, not by a command-line flag. */
403 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
405 /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling
406 code. '2' means it has not been set explicitly on the command line. */
408 int flag_use_cxa_get_exception_ptr = 2;
410 /* Nonzero means to implement standard semantics for exception
411 specifications, calling unexpected if an exception is thrown that
412 doesn't match the specification. Zero means to treat them as
413 assertions and optimize accordingly, but not check them. */
415 int flag_enforce_eh_specs = 1;
417 /* Nonzero means to generate thread-safe code for initializing local
420 int flag_threadsafe_statics = 1;
422 /* Nonzero if we want to pretty-print template specializations as the
423 template signature followed by the arguments. */
425 int flag_pretty_templates = 1;
427 /* Maximum template instantiation depth. This limit exists to limit the
428 time it takes to notice infinite template instantiations; the default
429 value of 1024 is likely to be in the next C++ standard. */
431 int max_tinst_depth = 1024;
435 /* The elements of `ridpointers' are identifier nodes for the reserved
436 type names and storage classes. It is indexed by a RID_... value. */
439 tree (*make_fname_decl) (location_t, tree, int);
441 /* Nonzero means don't warn about problems that occur when the code is
443 int c_inhibit_evaluation_warnings;
445 /* Whether lexing has been completed, so subsequent preprocessor
446 errors should use the compiler's input_location. */
447 bool done_lexing = false;
449 /* Information about how a function name is generated. */
452 tree *const decl; /* pointer to the VAR_DECL. */
453 const unsigned rid; /* RID number for the identifier. */
454 const int pretty; /* How pretty is it? */
457 /* The three ways of getting then name of the current function. */
459 const struct fname_var_t fname_vars[] =
461 /* C99 compliant __func__, must be first. */
462 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
463 /* GCC __FUNCTION__ compliant. */
464 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
465 /* GCC __PRETTY_FUNCTION__ compliant. */
466 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
470 static tree c_fully_fold_internal (tree expr, bool, bool *, bool *);
471 static tree check_case_value (tree);
472 static bool check_case_bounds (tree, tree, tree *, tree *);
474 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
475 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
476 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
477 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
478 static tree handle_hot_attribute (tree *, tree, tree, int, bool *);
479 static tree handle_cold_attribute (tree *, tree, tree, int, bool *);
480 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
481 static tree handle_noclone_attribute (tree *, tree, tree, int, bool *);
482 static tree handle_always_inline_attribute (tree *, tree, tree, int,
484 static tree handle_gnu_inline_attribute (tree *, tree, tree, int, bool *);
485 static tree handle_artificial_attribute (tree *, tree, tree, int, bool *);
486 static tree handle_flatten_attribute (tree *, tree, tree, int, bool *);
487 static tree handle_error_attribute (tree *, tree, tree, int, bool *);
488 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
489 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
490 static tree handle_externally_visible_attribute (tree *, tree, tree, int,
492 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
493 static tree handle_transparent_union_attribute (tree *, tree, tree,
495 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
496 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
497 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
498 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
499 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
500 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
501 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
502 static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ;
503 static tree handle_visibility_attribute (tree *, tree, tree, int,
505 static tree handle_tls_model_attribute (tree *, tree, tree, int,
507 static tree handle_no_instrument_function_attribute (tree *, tree,
509 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
510 static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *);
511 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
513 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
514 static tree handle_novops_attribute (tree *, tree, tree, int, bool *);
515 static tree handle_deprecated_attribute (tree *, tree, tree, int,
517 static tree handle_vector_size_attribute (tree *, tree, tree, int,
519 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
520 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
521 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
522 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
524 static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
525 static tree handle_type_generic_attribute (tree *, tree, tree, int, bool *);
526 static tree handle_alloc_size_attribute (tree *, tree, tree, int, bool *);
527 static tree handle_target_attribute (tree *, tree, tree, int, bool *);
528 static tree handle_optimize_attribute (tree *, tree, tree, int, bool *);
529 static tree handle_fnspec_attribute (tree *, tree, tree, int, bool *);
531 static void check_function_nonnull (tree, int, tree *);
532 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
533 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
534 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
535 static int resort_field_decl_cmp (const void *, const void *);
537 /* Reserved words. The third field is a mask: keywords are disabled
538 if they match the mask.
541 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
542 C --std=c99: D_CXXONLY | D_OBJC
543 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
544 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
545 C++ --std=c0x: D_CONLY | D_OBJC
546 ObjC++ is like C++ except that D_OBJC is not set
548 If -fno-asm is used, D_ASM is added to the mask. If
549 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
550 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
551 In C with -Wc++-compat, we warn if D_CXXWARN is set. */
553 const struct c_common_resword c_common_reswords[] =
555 { "_Bool", RID_BOOL, D_CONLY },
556 { "_Complex", RID_COMPLEX, 0 },
557 { "_Imaginary", RID_IMAGINARY, D_CONLY },
558 { "_Decimal32", RID_DFLOAT32, D_CONLY | D_EXT },
559 { "_Decimal64", RID_DFLOAT64, D_CONLY | D_EXT },
560 { "_Decimal128", RID_DFLOAT128, D_CONLY | D_EXT },
561 { "_Fract", RID_FRACT, D_CONLY | D_EXT },
562 { "_Accum", RID_ACCUM, D_CONLY | D_EXT },
563 { "_Sat", RID_SAT, D_CONLY | D_EXT },
564 { "_Static_assert", RID_STATIC_ASSERT, D_CONLY },
565 { "__FUNCTION__", RID_FUNCTION_NAME, 0 },
566 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME, 0 },
567 { "__alignof", RID_ALIGNOF, 0 },
568 { "__alignof__", RID_ALIGNOF, 0 },
569 { "__asm", RID_ASM, 0 },
570 { "__asm__", RID_ASM, 0 },
571 { "__attribute", RID_ATTRIBUTE, 0 },
572 { "__attribute__", RID_ATTRIBUTE, 0 },
573 { "__builtin_choose_expr", RID_CHOOSE_EXPR, D_CONLY },
574 { "__builtin_offsetof", RID_OFFSETOF, 0 },
575 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P, D_CONLY },
576 { "__builtin_va_arg", RID_VA_ARG, 0 },
577 { "__complex", RID_COMPLEX, 0 },
578 { "__complex__", RID_COMPLEX, 0 },
579 { "__const", RID_CONST, 0 },
580 { "__const__", RID_CONST, 0 },
581 { "__decltype", RID_DECLTYPE, D_CXXONLY },
582 { "__extension__", RID_EXTENSION, 0 },
583 { "__func__", RID_C99_FUNCTION_NAME, 0 },
584 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN, D_CXXONLY },
585 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR, D_CXXONLY },
586 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY, D_CXXONLY },
587 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN, D_CXXONLY },
588 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR, D_CXXONLY },
589 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY, D_CXXONLY },
590 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR, D_CXXONLY },
591 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR, D_CXXONLY },
592 { "__is_abstract", RID_IS_ABSTRACT, D_CXXONLY },
593 { "__is_base_of", RID_IS_BASE_OF, D_CXXONLY },
594 { "__is_class", RID_IS_CLASS, D_CXXONLY },
595 { "__is_convertible_to", RID_IS_CONVERTIBLE_TO, D_CXXONLY },
596 { "__is_empty", RID_IS_EMPTY, D_CXXONLY },
597 { "__is_enum", RID_IS_ENUM, D_CXXONLY },
598 { "__is_pod", RID_IS_POD, D_CXXONLY },
599 { "__is_polymorphic", RID_IS_POLYMORPHIC, D_CXXONLY },
600 { "__is_standard_layout", RID_IS_STD_LAYOUT, D_CXXONLY },
601 { "__is_trivial", RID_IS_TRIVIAL, D_CXXONLY },
602 { "__is_union", RID_IS_UNION, D_CXXONLY },
603 { "__imag", RID_IMAGPART, 0 },
604 { "__imag__", RID_IMAGPART, 0 },
605 { "__inline", RID_INLINE, 0 },
606 { "__inline__", RID_INLINE, 0 },
607 { "__label__", RID_LABEL, 0 },
608 { "__null", RID_NULL, 0 },
609 { "__real", RID_REALPART, 0 },
610 { "__real__", RID_REALPART, 0 },
611 { "__restrict", RID_RESTRICT, 0 },
612 { "__restrict__", RID_RESTRICT, 0 },
613 { "__signed", RID_SIGNED, 0 },
614 { "__signed__", RID_SIGNED, 0 },
615 { "__thread", RID_THREAD, 0 },
616 { "__typeof", RID_TYPEOF, 0 },
617 { "__typeof__", RID_TYPEOF, 0 },
618 { "__volatile", RID_VOLATILE, 0 },
619 { "__volatile__", RID_VOLATILE, 0 },
620 { "alignof", RID_ALIGNOF, D_CXXONLY | D_CXX0X | D_CXXWARN },
621 { "asm", RID_ASM, D_ASM },
622 { "auto", RID_AUTO, 0 },
623 { "bool", RID_BOOL, D_CXXONLY | D_CXXWARN },
624 { "break", RID_BREAK, 0 },
625 { "case", RID_CASE, 0 },
626 { "catch", RID_CATCH, D_CXX_OBJC | D_CXXWARN },
627 { "char", RID_CHAR, 0 },
628 { "char16_t", RID_CHAR16, D_CXXONLY | D_CXX0X | D_CXXWARN },
629 { "char32_t", RID_CHAR32, D_CXXONLY | D_CXX0X | D_CXXWARN },
630 { "class", RID_CLASS, D_CXX_OBJC | D_CXXWARN },
631 { "const", RID_CONST, 0 },
632 { "constexpr", RID_CONSTEXPR, D_CXXONLY | D_CXX0X | D_CXXWARN },
633 { "const_cast", RID_CONSTCAST, D_CXXONLY | D_CXXWARN },
634 { "continue", RID_CONTINUE, 0 },
635 { "decltype", RID_DECLTYPE, D_CXXONLY | D_CXX0X | D_CXXWARN },
636 { "default", RID_DEFAULT, 0 },
637 { "delete", RID_DELETE, D_CXXONLY | D_CXXWARN },
639 { "double", RID_DOUBLE, 0 },
640 { "dynamic_cast", RID_DYNCAST, D_CXXONLY | D_CXXWARN },
641 { "else", RID_ELSE, 0 },
642 { "enum", RID_ENUM, 0 },
643 { "explicit", RID_EXPLICIT, D_CXXONLY | D_CXXWARN },
644 { "export", RID_EXPORT, D_CXXONLY | D_CXXWARN },
645 { "extern", RID_EXTERN, 0 },
646 { "false", RID_FALSE, D_CXXONLY | D_CXXWARN },
647 { "float", RID_FLOAT, 0 },
648 { "for", RID_FOR, 0 },
649 { "friend", RID_FRIEND, D_CXXONLY | D_CXXWARN },
650 { "goto", RID_GOTO, 0 },
652 { "inline", RID_INLINE, D_EXT89 },
653 { "int", RID_INT, 0 },
654 { "long", RID_LONG, 0 },
655 { "mutable", RID_MUTABLE, D_CXXONLY | D_CXXWARN },
656 { "namespace", RID_NAMESPACE, D_CXXONLY | D_CXXWARN },
657 { "new", RID_NEW, D_CXXONLY | D_CXXWARN },
658 { "nullptr", RID_NULLPTR, D_CXXONLY | D_CXX0X | D_CXXWARN },
659 { "operator", RID_OPERATOR, D_CXXONLY | D_CXXWARN },
660 { "private", RID_PRIVATE, D_CXX_OBJC | D_CXXWARN },
661 { "protected", RID_PROTECTED, D_CXX_OBJC | D_CXXWARN },
662 { "public", RID_PUBLIC, D_CXX_OBJC | D_CXXWARN },
663 { "register", RID_REGISTER, 0 },
664 { "reinterpret_cast", RID_REINTCAST, D_CXXONLY | D_CXXWARN },
665 { "restrict", RID_RESTRICT, D_CONLY | D_C99 },
666 { "return", RID_RETURN, 0 },
667 { "short", RID_SHORT, 0 },
668 { "signed", RID_SIGNED, 0 },
669 { "sizeof", RID_SIZEOF, 0 },
670 { "static", RID_STATIC, 0 },
671 { "static_assert", RID_STATIC_ASSERT, D_CXXONLY | D_CXX0X | D_CXXWARN },
672 { "static_cast", RID_STATCAST, D_CXXONLY | D_CXXWARN },
673 { "struct", RID_STRUCT, 0 },
674 { "switch", RID_SWITCH, 0 },
675 { "template", RID_TEMPLATE, D_CXXONLY | D_CXXWARN },
676 { "this", RID_THIS, D_CXXONLY | D_CXXWARN },
677 { "throw", RID_THROW, D_CXX_OBJC | D_CXXWARN },
678 { "true", RID_TRUE, D_CXXONLY | D_CXXWARN },
679 { "try", RID_TRY, D_CXX_OBJC | D_CXXWARN },
680 { "typedef", RID_TYPEDEF, 0 },
681 { "typename", RID_TYPENAME, D_CXXONLY | D_CXXWARN },
682 { "typeid", RID_TYPEID, D_CXXONLY | D_CXXWARN },
683 { "typeof", RID_TYPEOF, D_ASM | D_EXT },
684 { "union", RID_UNION, 0 },
685 { "unsigned", RID_UNSIGNED, 0 },
686 { "using", RID_USING, D_CXXONLY | D_CXXWARN },
687 { "virtual", RID_VIRTUAL, D_CXXONLY | D_CXXWARN },
688 { "void", RID_VOID, 0 },
689 { "volatile", RID_VOLATILE, 0 },
690 { "wchar_t", RID_WCHAR, D_CXXONLY },
691 { "while", RID_WHILE, 0 },
692 /* These Objective-C keywords are recognized only immediately after
694 { "compatibility_alias", RID_AT_ALIAS, D_OBJC },
695 { "defs", RID_AT_DEFS, D_OBJC },
696 { "encode", RID_AT_ENCODE, D_OBJC },
697 { "end", RID_AT_END, D_OBJC },
698 { "implementation", RID_AT_IMPLEMENTATION, D_OBJC },
699 { "interface", RID_AT_INTERFACE, D_OBJC },
700 { "protocol", RID_AT_PROTOCOL, D_OBJC },
701 { "selector", RID_AT_SELECTOR, D_OBJC },
702 { "finally", RID_AT_FINALLY, D_OBJC },
703 { "synchronized", RID_AT_SYNCHRONIZED, D_OBJC },
704 /* These are recognized only in protocol-qualifier context
706 { "bycopy", RID_BYCOPY, D_OBJC },
707 { "byref", RID_BYREF, D_OBJC },
708 { "in", RID_IN, D_OBJC },
709 { "inout", RID_INOUT, D_OBJC },
710 { "oneway", RID_ONEWAY, D_OBJC },
711 { "out", RID_OUT, D_OBJC },
713 #ifdef TARGET_ADDR_SPACE_KEYWORDS
714 /* Any address space keywords recognized by the target. */
715 TARGET_ADDR_SPACE_KEYWORDS,
719 const unsigned int num_c_common_reswords =
720 sizeof c_common_reswords / sizeof (struct c_common_resword);
722 /* Table of machine-independent attributes common to all C-like languages. */
723 const struct attribute_spec c_common_attribute_table[] =
725 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
726 { "packed", 0, 0, false, false, false,
727 handle_packed_attribute },
728 { "nocommon", 0, 0, true, false, false,
729 handle_nocommon_attribute },
730 { "common", 0, 0, true, false, false,
731 handle_common_attribute },
732 /* FIXME: logically, noreturn attributes should be listed as
733 "false, true, true" and apply to function types. But implementing this
734 would require all the places in the compiler that use TREE_THIS_VOLATILE
735 on a decl to identify non-returning functions to be located and fixed
736 to check the function type instead. */
737 { "noreturn", 0, 0, true, false, false,
738 handle_noreturn_attribute },
739 { "volatile", 0, 0, true, false, false,
740 handle_noreturn_attribute },
741 { "noinline", 0, 0, true, false, false,
742 handle_noinline_attribute },
743 { "noclone", 0, 0, true, false, false,
744 handle_noclone_attribute },
745 { "always_inline", 0, 0, true, false, false,
746 handle_always_inline_attribute },
747 { "gnu_inline", 0, 0, true, false, false,
748 handle_gnu_inline_attribute },
749 { "artificial", 0, 0, true, false, false,
750 handle_artificial_attribute },
751 { "flatten", 0, 0, true, false, false,
752 handle_flatten_attribute },
753 { "used", 0, 0, true, false, false,
754 handle_used_attribute },
755 { "unused", 0, 0, false, false, false,
756 handle_unused_attribute },
757 { "externally_visible", 0, 0, true, false, false,
758 handle_externally_visible_attribute },
759 /* The same comments as for noreturn attributes apply to const ones. */
760 { "const", 0, 0, true, false, false,
761 handle_const_attribute },
762 { "transparent_union", 0, 0, false, false, false,
763 handle_transparent_union_attribute },
764 { "constructor", 0, 1, true, false, false,
765 handle_constructor_attribute },
766 { "destructor", 0, 1, true, false, false,
767 handle_destructor_attribute },
768 { "mode", 1, 1, false, true, false,
769 handle_mode_attribute },
770 { "section", 1, 1, true, false, false,
771 handle_section_attribute },
772 { "aligned", 0, 1, false, false, false,
773 handle_aligned_attribute },
774 { "weak", 0, 0, true, false, false,
775 handle_weak_attribute },
776 { "alias", 1, 1, true, false, false,
777 handle_alias_attribute },
778 { "weakref", 0, 1, true, false, false,
779 handle_weakref_attribute },
780 { "no_instrument_function", 0, 0, true, false, false,
781 handle_no_instrument_function_attribute },
782 { "malloc", 0, 0, true, false, false,
783 handle_malloc_attribute },
784 { "returns_twice", 0, 0, true, false, false,
785 handle_returns_twice_attribute },
786 { "no_stack_limit", 0, 0, true, false, false,
787 handle_no_limit_stack_attribute },
788 { "pure", 0, 0, true, false, false,
789 handle_pure_attribute },
790 /* For internal use (marking of builtins) only. The name contains space
791 to prevent its usage in source code. */
792 { "no vops", 0, 0, true, false, false,
793 handle_novops_attribute },
794 { "deprecated", 0, 1, false, false, false,
795 handle_deprecated_attribute },
796 { "vector_size", 1, 1, false, true, false,
797 handle_vector_size_attribute },
798 { "visibility", 1, 1, false, false, false,
799 handle_visibility_attribute },
800 { "tls_model", 1, 1, true, false, false,
801 handle_tls_model_attribute },
802 { "nonnull", 0, -1, false, true, true,
803 handle_nonnull_attribute },
804 { "nothrow", 0, 0, true, false, false,
805 handle_nothrow_attribute },
806 { "may_alias", 0, 0, false, true, false, NULL },
807 { "cleanup", 1, 1, true, false, false,
808 handle_cleanup_attribute },
809 { "warn_unused_result", 0, 0, false, true, true,
810 handle_warn_unused_result_attribute },
811 { "sentinel", 0, 1, false, true, true,
812 handle_sentinel_attribute },
813 /* For internal use (marking of builtins) only. The name contains space
814 to prevent its usage in source code. */
815 { "type generic", 0, 0, false, true, true,
816 handle_type_generic_attribute },
817 { "alloc_size", 1, 2, false, true, true,
818 handle_alloc_size_attribute },
819 { "cold", 0, 0, true, false, false,
820 handle_cold_attribute },
821 { "hot", 0, 0, true, false, false,
822 handle_hot_attribute },
823 { "warning", 1, 1, true, false, false,
824 handle_error_attribute },
825 { "error", 1, 1, true, false, false,
826 handle_error_attribute },
827 { "target", 1, -1, true, false, false,
828 handle_target_attribute },
829 { "optimize", 1, -1, true, false, false,
830 handle_optimize_attribute },
831 /* For internal use (marking of builtins and runtime functions) only.
832 The name contains space to prevent its usage in source code. */
833 { "fn spec", 1, 1, false, true, true,
834 handle_fnspec_attribute },
835 { NULL, 0, 0, false, false, false, NULL }
838 /* Give the specifications for the format attributes, used by C and all
841 const struct attribute_spec c_common_format_attribute_table[] =
843 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
844 { "format", 3, 3, false, true, true,
845 handle_format_attribute },
846 { "format_arg", 1, 1, false, true, true,
847 handle_format_arg_attribute },
848 { NULL, 0, 0, false, false, false, NULL }
851 /* Return identifier for address space AS. */
853 c_addr_space_name (addr_space_t as)
857 for (i = 0; i < num_c_common_reswords; i++)
858 if (c_common_reswords[i].rid == RID_FIRST_ADDR_SPACE + as)
859 return c_common_reswords[i].word;
864 /* Push current bindings for the function name VAR_DECLS. */
867 start_fname_decls (void)
870 tree saved = NULL_TREE;
872 for (ix = 0; fname_vars[ix].decl; ix++)
874 tree decl = *fname_vars[ix].decl;
878 saved = tree_cons (decl, build_int_cst (NULL_TREE, ix), saved);
879 *fname_vars[ix].decl = NULL_TREE;
882 if (saved || saved_function_name_decls)
883 /* Normally they'll have been NULL, so only push if we've got a
884 stack, or they are non-NULL. */
885 saved_function_name_decls = tree_cons (saved, NULL_TREE,
886 saved_function_name_decls);
889 /* Finish up the current bindings, adding them into the current function's
890 statement tree. This must be done _before_ finish_stmt_tree is called.
891 If there is no current function, we must be at file scope and no statements
892 are involved. Pop the previous bindings. */
895 finish_fname_decls (void)
898 tree stmts = NULL_TREE;
899 tree stack = saved_function_name_decls;
901 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
902 append_to_statement_list (TREE_VALUE (stack), &stmts);
906 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
908 if (TREE_CODE (*bodyp) == BIND_EXPR)
909 bodyp = &BIND_EXPR_BODY (*bodyp);
911 append_to_statement_list_force (*bodyp, &stmts);
915 for (ix = 0; fname_vars[ix].decl; ix++)
916 *fname_vars[ix].decl = NULL_TREE;
920 /* We had saved values, restore them. */
923 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
925 tree decl = TREE_PURPOSE (saved);
926 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
928 *fname_vars[ix].decl = decl;
930 stack = TREE_CHAIN (stack);
932 saved_function_name_decls = stack;
935 /* Return the text name of the current function, suitably prettified
936 by PRETTY_P. Return string must be freed by caller. */
939 fname_as_string (int pretty_p)
941 const char *name = "top level";
944 cpp_string cstr = { 0, 0 }, strname;
952 if (current_function_decl)
953 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
955 len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
957 namep = XNEWVEC (char, len);
958 snprintf (namep, len, "\"%s\"", name);
959 strname.text = (unsigned char *) namep;
960 strname.len = len - 1;
962 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, CPP_STRING))
965 return (const char *) cstr.text;
971 /* Return the VAR_DECL for a const char array naming the current
972 function. If the VAR_DECL has not yet been created, create it
973 now. RID indicates how it should be formatted and IDENTIFIER_NODE
974 ID is its name (unfortunately C and C++ hold the RID values of
975 keywords in different places, so we can't derive RID from ID in
976 this language independent code. LOC is the location of the
980 fname_decl (location_t loc, unsigned int rid, tree id)
983 tree decl = NULL_TREE;
985 for (ix = 0; fname_vars[ix].decl; ix++)
986 if (fname_vars[ix].rid == rid)
989 decl = *fname_vars[ix].decl;
992 /* If a tree is built here, it would normally have the lineno of
993 the current statement. Later this tree will be moved to the
994 beginning of the function and this line number will be wrong.
995 To avoid this problem set the lineno to 0 here; that prevents
996 it from appearing in the RTL. */
998 location_t saved_location = input_location;
999 input_location = UNKNOWN_LOCATION;
1001 stmts = push_stmt_list ();
1002 decl = (*make_fname_decl) (loc, id, fname_vars[ix].pretty);
1003 stmts = pop_stmt_list (stmts);
1004 if (!IS_EMPTY_STMT (stmts))
1005 saved_function_name_decls
1006 = tree_cons (decl, stmts, saved_function_name_decls);
1007 *fname_vars[ix].decl = decl;
1008 input_location = saved_location;
1010 if (!ix && !current_function_decl)
1011 pedwarn (loc, 0, "%qD is not defined outside of function scope", decl);
1016 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1019 fix_string_type (tree value)
1021 int length = TREE_STRING_LENGTH (value);
1023 tree e_type, i_type, a_type;
1025 /* Compute the number of elements, for the array type. */
1026 if (TREE_TYPE (value) == char_array_type_node || !TREE_TYPE (value))
1029 e_type = char_type_node;
1031 else if (TREE_TYPE (value) == char16_array_type_node)
1033 nchars = length / (TYPE_PRECISION (char16_type_node) / BITS_PER_UNIT);
1034 e_type = char16_type_node;
1036 else if (TREE_TYPE (value) == char32_array_type_node)
1038 nchars = length / (TYPE_PRECISION (char32_type_node) / BITS_PER_UNIT);
1039 e_type = char32_type_node;
1043 nchars = length / (TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT);
1044 e_type = wchar_type_node;
1047 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1048 limit in C++98 Annex B is very large (65536) and is not normative,
1049 so we do not diagnose it (warn_overlength_strings is forced off
1050 in c_common_post_options). */
1051 if (warn_overlength_strings)
1053 const int nchars_max = flag_isoc99 ? 4095 : 509;
1054 const int relevant_std = flag_isoc99 ? 99 : 90;
1055 if (nchars - 1 > nchars_max)
1056 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1057 separate the %d from the 'C'. 'ISO' should not be
1058 translated, but it may be moved after 'C%d' in languages
1059 where modifiers follow nouns. */
1060 pedwarn (input_location, OPT_Woverlength_strings,
1061 "string length %qd is greater than the length %qd "
1062 "ISO C%d compilers are required to support",
1063 nchars - 1, nchars_max, relevant_std);
1066 /* Create the array type for the string constant. The ISO C++
1067 standard says that a string literal has type `const char[N]' or
1068 `const wchar_t[N]'. We use the same logic when invoked as a C
1069 front-end with -Wwrite-strings.
1070 ??? We should change the type of an expression depending on the
1071 state of a warning flag. We should just be warning -- see how
1072 this is handled in the C++ front-end for the deprecated implicit
1073 conversion from string literals to `char*' or `wchar_t*'.
1075 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1076 array type being the unqualified version of that type.
1077 Therefore, if we are constructing an array of const char, we must
1078 construct the matching unqualified array type first. The C front
1079 end does not require this, but it does no harm, so we do it
1081 i_type = build_index_type (build_int_cst (NULL_TREE, nchars - 1));
1082 a_type = build_array_type (e_type, i_type);
1083 if (c_dialect_cxx() || warn_write_strings)
1084 a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
1086 TREE_TYPE (value) = a_type;
1087 TREE_CONSTANT (value) = 1;
1088 TREE_READONLY (value) = 1;
1089 TREE_STATIC (value) = 1;
1093 /* Fully fold EXPR, an expression that was not folded (beyond integer
1094 constant expressions and null pointer constants) when being built
1095 up. If IN_INIT, this is in a static initializer and certain
1096 changes are made to the folding done. Clear *MAYBE_CONST if
1097 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1098 expression because it contains an evaluated operator (in C99) or an
1099 operator outside of sizeof returning an integer constant (in C90)
1100 not permitted in constant expressions, or because it contains an
1101 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1102 set to true by callers before calling this function.) Return the
1103 folded expression. Function arguments have already been folded
1104 before calling this function, as have the contents of SAVE_EXPR,
1105 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1106 C_MAYBE_CONST_EXPR. */
1109 c_fully_fold (tree expr, bool in_init, bool *maybe_const)
1112 tree eptype = NULL_TREE;
1114 bool maybe_const_itself = true;
1115 location_t loc = EXPR_LOCATION (expr);
1117 /* This function is not relevant to C++ because C++ folds while
1118 parsing, and may need changes to be correct for C++ when C++
1119 stops folding while parsing. */
1120 if (c_dialect_cxx ())
1124 maybe_const = &dummy;
1125 if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
1127 eptype = TREE_TYPE (expr);
1128 expr = TREE_OPERAND (expr, 0);
1130 ret = c_fully_fold_internal (expr, in_init, maybe_const,
1131 &maybe_const_itself);
1133 ret = fold_convert_loc (loc, eptype, ret);
1134 *maybe_const &= maybe_const_itself;
1138 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1139 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1140 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1141 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1142 both evaluated and unevaluated subexpressions while
1143 *MAYBE_CONST_ITSELF is carried from only evaluated
1147 c_fully_fold_internal (tree expr, bool in_init, bool *maybe_const_operands,
1148 bool *maybe_const_itself)
1151 enum tree_code code = TREE_CODE (expr);
1152 enum tree_code_class kind = TREE_CODE_CLASS (code);
1153 location_t loc = EXPR_LOCATION (expr);
1154 tree op0, op1, op2, op3;
1155 tree orig_op0, orig_op1, orig_op2;
1156 bool op0_const = true, op1_const = true, op2_const = true;
1157 bool op0_const_self = true, op1_const_self = true, op2_const_self = true;
1158 bool nowarning = TREE_NO_WARNING (expr);
1161 /* This function is not relevant to C++ because C++ folds while
1162 parsing, and may need changes to be correct for C++ when C++
1163 stops folding while parsing. */
1164 if (c_dialect_cxx ())
1167 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1168 anything else not counted as an expression cannot usefully be
1169 folded further at this point. */
1170 if (!IS_EXPR_CODE_CLASS (kind)
1171 || kind == tcc_statement
1172 || code == SAVE_EXPR)
1175 /* Operands of variable-length expressions (function calls) have
1176 already been folded, as have __builtin_* function calls, and such
1177 expressions cannot occur in constant expressions. */
1178 if (kind == tcc_vl_exp)
1180 *maybe_const_operands = false;
1185 if (code == C_MAYBE_CONST_EXPR)
1187 tree pre = C_MAYBE_CONST_EXPR_PRE (expr);
1188 tree inner = C_MAYBE_CONST_EXPR_EXPR (expr);
1189 if (C_MAYBE_CONST_EXPR_NON_CONST (expr))
1190 *maybe_const_operands = false;
1191 if (C_MAYBE_CONST_EXPR_INT_OPERANDS (expr))
1192 *maybe_const_itself = false;
1193 if (pre && !in_init)
1194 ret = build2 (COMPOUND_EXPR, TREE_TYPE (expr), pre, inner);
1200 /* Assignment, increment, decrement, function call and comma
1201 operators, and statement expressions, cannot occur in constant
1202 expressions if evaluated / outside of sizeof. (Function calls
1203 were handled above, though VA_ARG_EXPR is treated like a function
1204 call here, and statement expressions are handled through
1205 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1209 case PREDECREMENT_EXPR:
1210 case PREINCREMENT_EXPR:
1211 case POSTDECREMENT_EXPR:
1212 case POSTINCREMENT_EXPR:
1214 *maybe_const_operands = false;
1221 *maybe_const_operands = false;
1229 /* Fold individual tree codes as appropriate. */
1232 case COMPOUND_LITERAL_EXPR:
1233 /* Any non-constancy will have been marked in a containing
1234 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1238 orig_op0 = op0 = TREE_OPERAND (expr, 0);
1239 op1 = TREE_OPERAND (expr, 1);
1240 op2 = TREE_OPERAND (expr, 2);
1241 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
1242 maybe_const_itself);
1243 STRIP_TYPE_NOPS (op0);
1244 if (op0 != orig_op0)
1245 ret = build3 (COMPONENT_REF, TREE_TYPE (expr), op0, op1, op2);
1248 TREE_READONLY (ret) = TREE_READONLY (expr);
1249 TREE_THIS_VOLATILE (ret) = TREE_THIS_VOLATILE (expr);
1254 orig_op0 = op0 = TREE_OPERAND (expr, 0);
1255 orig_op1 = op1 = TREE_OPERAND (expr, 1);
1256 op2 = TREE_OPERAND (expr, 2);
1257 op3 = TREE_OPERAND (expr, 3);
1258 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
1259 maybe_const_itself);
1260 STRIP_TYPE_NOPS (op0);
1261 op1 = c_fully_fold_internal (op1, in_init, maybe_const_operands,
1262 maybe_const_itself);
1263 STRIP_TYPE_NOPS (op1);
1264 op1 = decl_constant_value_for_optimization (op1);
1265 if (op0 != orig_op0 || op1 != orig_op1)
1266 ret = build4 (ARRAY_REF, TREE_TYPE (expr), op0, op1, op2, op3);
1269 TREE_READONLY (ret) = TREE_READONLY (expr);
1270 TREE_SIDE_EFFECTS (ret) = TREE_SIDE_EFFECTS (expr);
1271 TREE_THIS_VOLATILE (ret) = TREE_THIS_VOLATILE (expr);
1278 case PREDECREMENT_EXPR:
1279 case PREINCREMENT_EXPR:
1280 case POSTDECREMENT_EXPR:
1281 case POSTINCREMENT_EXPR:
1285 case POINTER_PLUS_EXPR:
1286 case TRUNC_DIV_EXPR:
1288 case FLOOR_DIV_EXPR:
1289 case TRUNC_MOD_EXPR:
1291 case EXACT_DIV_EXPR:
1304 case TRUTH_AND_EXPR:
1306 case TRUTH_XOR_EXPR:
1307 case UNORDERED_EXPR:
1314 /* Binary operations evaluating both arguments (increment and
1315 decrement are binary internally in GCC). */
1316 orig_op0 = op0 = TREE_OPERAND (expr, 0);
1317 orig_op1 = op1 = TREE_OPERAND (expr, 1);
1318 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
1319 maybe_const_itself);
1320 STRIP_TYPE_NOPS (op0);
1321 if (code != MODIFY_EXPR
1322 && code != PREDECREMENT_EXPR
1323 && code != PREINCREMENT_EXPR
1324 && code != POSTDECREMENT_EXPR
1325 && code != POSTINCREMENT_EXPR)
1326 op0 = decl_constant_value_for_optimization (op0);
1327 /* The RHS of a MODIFY_EXPR was fully folded when building that
1328 expression for the sake of conversion warnings. */
1329 if (code != MODIFY_EXPR)
1330 op1 = c_fully_fold_internal (op1, in_init, maybe_const_operands,
1331 maybe_const_itself);
1332 STRIP_TYPE_NOPS (op1);
1333 op1 = decl_constant_value_for_optimization (op1);
1334 if (op0 != orig_op0 || op1 != orig_op1 || in_init)
1336 ? fold_build2_initializer_loc (loc, code, TREE_TYPE (expr), op0, op1)
1337 : fold_build2_loc (loc, code, TREE_TYPE (expr), op0, op1);
1340 if (TREE_OVERFLOW_P (ret)
1341 && !TREE_OVERFLOW_P (op0)
1342 && !TREE_OVERFLOW_P (op1))
1343 overflow_warning (EXPR_LOCATION (expr), ret);
1347 case FIX_TRUNC_EXPR:
1350 case NON_LVALUE_EXPR:
1353 case TRUTH_NOT_EXPR:
1358 /* Unary operations. */
1359 orig_op0 = op0 = TREE_OPERAND (expr, 0);
1360 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
1361 maybe_const_itself);
1362 STRIP_TYPE_NOPS (op0);
1363 if (code != ADDR_EXPR && code != REALPART_EXPR && code != IMAGPART_EXPR)
1364 op0 = decl_constant_value_for_optimization (op0);
1365 if (op0 != orig_op0 || in_init)
1367 ? fold_build1_initializer_loc (loc, code, TREE_TYPE (expr), op0)
1368 : fold_build1_loc (loc, code, TREE_TYPE (expr), op0);
1371 if (code == INDIRECT_REF
1373 && TREE_CODE (ret) == INDIRECT_REF)
1375 TREE_READONLY (ret) = TREE_READONLY (expr);
1376 TREE_SIDE_EFFECTS (ret) = TREE_SIDE_EFFECTS (expr);
1377 TREE_THIS_VOLATILE (ret) = TREE_THIS_VOLATILE (expr);
1381 case FIX_TRUNC_EXPR:
1384 /* Don't warn about explicit conversions. We will already
1385 have warned about suspect implicit conversions. */
1389 if (TREE_OVERFLOW_P (ret) && !TREE_OVERFLOW_P (op0))
1390 overflow_warning (EXPR_LOCATION (expr), ret);
1395 case TRUTH_ANDIF_EXPR:
1396 case TRUTH_ORIF_EXPR:
1397 /* Binary operations not necessarily evaluating both
1399 orig_op0 = op0 = TREE_OPERAND (expr, 0);
1400 orig_op1 = op1 = TREE_OPERAND (expr, 1);
1401 op0 = c_fully_fold_internal (op0, in_init, &op0_const, &op0_const_self);
1402 STRIP_TYPE_NOPS (op0);
1404 unused_p = (op0 == (code == TRUTH_ANDIF_EXPR
1405 ? truthvalue_false_node
1406 : truthvalue_true_node));
1407 c_inhibit_evaluation_warnings += unused_p;
1408 op1 = c_fully_fold_internal (op1, in_init, &op1_const, &op1_const_self);
1409 STRIP_TYPE_NOPS (op1);
1410 c_inhibit_evaluation_warnings -= unused_p;
1412 if (op0 != orig_op0 || op1 != orig_op1 || in_init)
1414 ? fold_build2_initializer_loc (loc, code, TREE_TYPE (expr), op0, op1)
1415 : fold_build2_loc (loc, code, TREE_TYPE (expr), op0, op1);
1418 *maybe_const_operands &= op0_const;
1419 *maybe_const_itself &= op0_const_self;
1423 && (code == TRUTH_ANDIF_EXPR
1424 ? op0 == truthvalue_false_node
1425 : op0 == truthvalue_true_node)))
1426 *maybe_const_operands &= op1_const;
1429 && (code == TRUTH_ANDIF_EXPR
1430 ? op0 == truthvalue_false_node
1431 : op0 == truthvalue_true_node)))
1432 *maybe_const_itself &= op1_const_self;
1436 orig_op0 = op0 = TREE_OPERAND (expr, 0);
1437 orig_op1 = op1 = TREE_OPERAND (expr, 1);
1438 orig_op2 = op2 = TREE_OPERAND (expr, 2);
1439 op0 = c_fully_fold_internal (op0, in_init, &op0_const, &op0_const_self);
1441 STRIP_TYPE_NOPS (op0);
1442 c_inhibit_evaluation_warnings += (op0 == truthvalue_false_node);
1443 op1 = c_fully_fold_internal (op1, in_init, &op1_const, &op1_const_self);
1444 STRIP_TYPE_NOPS (op1);
1445 c_inhibit_evaluation_warnings -= (op0 == truthvalue_false_node);
1447 c_inhibit_evaluation_warnings += (op0 == truthvalue_true_node);
1448 op2 = c_fully_fold_internal (op2, in_init, &op2_const, &op2_const_self);
1449 STRIP_TYPE_NOPS (op2);
1450 c_inhibit_evaluation_warnings -= (op0 == truthvalue_true_node);
1452 if (op0 != orig_op0 || op1 != orig_op1 || op2 != orig_op2)
1453 ret = fold_build3_loc (loc, code, TREE_TYPE (expr), op0, op1, op2);
1456 *maybe_const_operands &= op0_const;
1457 *maybe_const_itself &= op0_const_self;
1461 && op0 == truthvalue_false_node))
1462 *maybe_const_operands &= op1_const;
1465 && op0 == truthvalue_false_node))
1466 *maybe_const_itself &= op1_const_self;
1470 && op0 == truthvalue_true_node))
1471 *maybe_const_operands &= op2_const;
1474 && op0 == truthvalue_true_node))
1475 *maybe_const_itself &= op2_const_self;
1478 case EXCESS_PRECISION_EXPR:
1479 /* Each case where an operand with excess precision may be
1480 encountered must remove the EXCESS_PRECISION_EXPR around
1481 inner operands and possibly put one around the whole
1482 expression or possibly convert to the semantic type (which
1483 c_fully_fold does); we cannot tell at this stage which is
1484 appropriate in any particular case. */
1488 /* Various codes may appear through folding built-in functions
1489 and their arguments. */
1494 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1495 have been done by this point, so remove them again. */
1496 nowarning |= TREE_NO_WARNING (ret);
1497 STRIP_TYPE_NOPS (ret);
1498 if (nowarning && !TREE_NO_WARNING (ret))
1500 if (!CAN_HAVE_LOCATION_P (ret))
1501 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
1502 TREE_NO_WARNING (ret) = 1;
1505 protected_set_expr_location (ret, loc);
1509 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1510 return EXP. Otherwise, return either EXP or its known constant
1511 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1512 Is the BLKmode test appropriate? */
1515 decl_constant_value_for_optimization (tree exp)
1519 /* This function is only used by C, for c_fully_fold and other
1520 optimization, and may not be correct for C++. */
1521 if (c_dialect_cxx ())
1525 || TREE_CODE (exp) != VAR_DECL
1526 || TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE
1527 || DECL_MODE (exp) == BLKmode)
1530 ret = decl_constant_value (exp);
1531 /* Avoid unwanted tree sharing between the initializer and current
1532 function's body where the tree can be modified e.g. by the
1534 if (ret != exp && TREE_STATIC (exp))
1535 ret = unshare_expr (ret);
1539 /* Print a warning if a constant expression had overflow in folding.
1540 Invoke this function on every expression that the language
1541 requires to be a constant expression.
1542 Note the ANSI C standard says it is erroneous for a
1543 constant expression to overflow. */
1546 constant_expression_warning (tree value)
1548 if (warn_overflow && pedantic
1549 && (TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1550 || TREE_CODE (value) == FIXED_CST
1551 || TREE_CODE (value) == VECTOR_CST
1552 || TREE_CODE (value) == COMPLEX_CST)
1553 && TREE_OVERFLOW (value))
1554 pedwarn (input_location, OPT_Woverflow, "overflow in constant expression");
1557 /* The same as above but print an unconditional error. */
1559 constant_expression_error (tree value)
1561 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1562 || TREE_CODE (value) == FIXED_CST
1563 || TREE_CODE (value) == VECTOR_CST
1564 || TREE_CODE (value) == COMPLEX_CST)
1565 && TREE_OVERFLOW (value))
1566 error ("overflow in constant expression");
1569 /* Print a warning if an expression had overflow in folding and its
1572 Invoke this function on every expression that
1573 (1) appears in the source code, and
1574 (2) is a constant expression that overflowed, and
1575 (3) is not already checked by convert_and_check;
1576 however, do not invoke this function on operands of explicit casts
1577 or when the expression is the result of an operator and any operand
1578 already overflowed. */
1581 overflow_warning (location_t loc, tree value)
1583 if (c_inhibit_evaluation_warnings != 0)
1586 switch (TREE_CODE (value))
1589 warning_at (loc, OPT_Woverflow, "integer overflow in expression");
1593 warning_at (loc, OPT_Woverflow,
1594 "floating point overflow in expression");
1598 warning_at (loc, OPT_Woverflow, "fixed-point overflow in expression");
1602 warning_at (loc, OPT_Woverflow, "vector overflow in expression");
1606 if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST)
1607 warning_at (loc, OPT_Woverflow,
1608 "complex integer overflow in expression");
1609 else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST)
1610 warning_at (loc, OPT_Woverflow,
1611 "complex floating point overflow in expression");
1619 /* Warn about uses of logical || / && operator in a context where it
1620 is likely that the bitwise equivalent was intended by the
1621 programmer. We have seen an expression in which CODE is a binary
1622 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1623 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1625 warn_logical_operator (location_t location, enum tree_code code, tree type,
1626 enum tree_code code_left, tree op_left,
1627 enum tree_code ARG_UNUSED (code_right), tree op_right)
1629 int or_op = (code == TRUTH_ORIF_EXPR || code == TRUTH_OR_EXPR);
1630 int in0_p, in1_p, in_p;
1631 tree low0, low1, low, high0, high1, high, lhs, rhs, tem;
1632 bool strict_overflow_p = false;
1634 if (code != TRUTH_ANDIF_EXPR
1635 && code != TRUTH_AND_EXPR
1636 && code != TRUTH_ORIF_EXPR
1637 && code != TRUTH_OR_EXPR)
1640 /* Warn if &&/|| are being used in a context where it is
1641 likely that the bitwise equivalent was intended by the
1642 programmer. That is, an expression such as op && MASK
1643 where op should not be any boolean expression, nor a
1644 constant, and mask seems to be a non-boolean integer constant. */
1645 if (!truth_value_p (code_left)
1646 && INTEGRAL_TYPE_P (TREE_TYPE (op_left))
1647 && !CONSTANT_CLASS_P (op_left)
1648 && !TREE_NO_WARNING (op_left)
1649 && TREE_CODE (op_right) == INTEGER_CST
1650 && !integer_zerop (op_right)
1651 && !integer_onep (op_right))
1654 warning_at (location, OPT_Wlogical_op, "logical %<or%>"
1655 " applied to non-boolean constant");
1657 warning_at (location, OPT_Wlogical_op, "logical %<and%>"
1658 " applied to non-boolean constant");
1659 TREE_NO_WARNING (op_left) = true;
1663 /* We do not warn for constants because they are typical of macro
1664 expansions that test for features. */
1665 if (CONSTANT_CLASS_P (op_left) || CONSTANT_CLASS_P (op_right))
1668 /* This warning only makes sense with logical operands. */
1669 if (!(truth_value_p (TREE_CODE (op_left))
1670 || INTEGRAL_TYPE_P (TREE_TYPE (op_left)))
1671 || !(truth_value_p (TREE_CODE (op_right))
1672 || INTEGRAL_TYPE_P (TREE_TYPE (op_right))))
1675 lhs = make_range (op_left, &in0_p, &low0, &high0, &strict_overflow_p);
1676 rhs = make_range (op_right, &in1_p, &low1, &high1, &strict_overflow_p);
1678 if (lhs && TREE_CODE (lhs) == C_MAYBE_CONST_EXPR)
1679 lhs = C_MAYBE_CONST_EXPR_EXPR (lhs);
1681 if (rhs && TREE_CODE (rhs) == C_MAYBE_CONST_EXPR)
1682 rhs = C_MAYBE_CONST_EXPR_EXPR (rhs);
1684 /* If this is an OR operation, invert both sides; we will invert
1685 again at the end. */
1687 in0_p = !in0_p, in1_p = !in1_p;
1689 /* If both expressions are the same, if we can merge the ranges, and we
1690 can build the range test, return it or it inverted. */
1691 if (lhs && rhs && operand_equal_p (lhs, rhs, 0)
1692 && merge_ranges (&in_p, &low, &high, in0_p, low0, high0,
1694 && 0 != (tem = build_range_check (UNKNOWN_LOCATION,
1695 type, lhs, in_p, low, high)))
1697 if (TREE_CODE (tem) != INTEGER_CST)
1701 warning_at (location, OPT_Wlogical_op,
1703 "of collectively exhaustive tests is always true");
1705 warning_at (location, OPT_Wlogical_op,
1707 "of mutually exclusive tests is always false");
1712 /* Print a warning about casts that might indicate violation
1713 of strict aliasing rules if -Wstrict-aliasing is used and
1714 strict aliasing mode is in effect. OTYPE is the original
1715 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1718 strict_aliasing_warning (tree otype, tree type, tree expr)
1720 /* Strip pointer conversion chains and get to the correct original type. */
1722 otype = TREE_TYPE (expr);
1724 if (!(flag_strict_aliasing
1725 && POINTER_TYPE_P (type)
1726 && POINTER_TYPE_P (otype)
1727 && !VOID_TYPE_P (TREE_TYPE (type)))
1728 /* If the type we are casting to is a ref-all pointer
1729 dereferencing it is always valid. */
1730 || TYPE_REF_CAN_ALIAS_ALL (type))
1733 if ((warn_strict_aliasing > 1) && TREE_CODE (expr) == ADDR_EXPR
1734 && (DECL_P (TREE_OPERAND (expr, 0))
1735 || handled_component_p (TREE_OPERAND (expr, 0))))
1737 /* Casting the address of an object to non void pointer. Warn
1738 if the cast breaks type based aliasing. */
1739 if (!COMPLETE_TYPE_P (TREE_TYPE (type)) && warn_strict_aliasing == 2)
1741 warning (OPT_Wstrict_aliasing, "type-punning to incomplete type "
1742 "might break strict-aliasing rules");
1747 /* warn_strict_aliasing >= 3. This includes the default (3).
1748 Only warn if the cast is dereferenced immediately. */
1749 alias_set_type set1 =
1750 get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
1751 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
1753 if (set1 != set2 && set2 != 0
1754 && (set1 == 0 || !alias_sets_conflict_p (set1, set2)))
1756 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1757 "pointer will break strict-aliasing rules");
1760 else if (warn_strict_aliasing == 2
1761 && !alias_sets_must_conflict_p (set1, set2))
1763 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1764 "pointer might break strict-aliasing rules");
1770 if ((warn_strict_aliasing == 1) && !VOID_TYPE_P (TREE_TYPE (otype)))
1772 /* At this level, warn for any conversions, even if an address is
1773 not taken in the same statement. This will likely produce many
1774 false positives, but could be useful to pinpoint problems that
1775 are not revealed at higher levels. */
1776 alias_set_type set1 = get_alias_set (TREE_TYPE (otype));
1777 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
1778 if (!COMPLETE_TYPE_P (type)
1779 || !alias_sets_must_conflict_p (set1, set2))
1781 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1782 "pointer might break strict-aliasing rules");
1790 /* Warn for unlikely, improbable, or stupid DECL declarations
1794 check_main_parameter_types (tree decl)
1799 for (args = TYPE_ARG_TYPES (TREE_TYPE (decl)); args;
1800 args = TREE_CHAIN (args))
1802 tree type = args ? TREE_VALUE (args) : 0;
1804 if (type == void_type_node || type == error_mark_node )
1811 if (TYPE_MAIN_VARIANT (type) != integer_type_node)
1812 pedwarn (input_location, OPT_Wmain, "first argument of %q+D should be %<int%>",
1817 if (TREE_CODE (type) != POINTER_TYPE
1818 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1819 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1821 pedwarn (input_location, OPT_Wmain, "second argument of %q+D should be %<char **%>",
1826 if (TREE_CODE (type) != POINTER_TYPE
1827 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1828 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1830 pedwarn (input_location, OPT_Wmain, "third argument of %q+D should probably be "
1831 "%<char **%>", decl);
1836 /* It is intentional that this message does not mention the third
1837 argument because it's only mentioned in an appendix of the
1839 if (argct > 0 && (argct < 2 || argct > 3))
1840 pedwarn (input_location, OPT_Wmain, "%q+D takes only zero or two arguments", decl);
1843 /* True if pointers to distinct types T1 and T2 can be converted to
1844 each other without an explicit cast. Only returns true for opaque
1847 vector_targets_convertible_p (const_tree t1, const_tree t2)
1849 if (TREE_CODE (t1) == VECTOR_TYPE && TREE_CODE (t2) == VECTOR_TYPE
1850 && (TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2))
1851 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
1857 /* True if vector types T1 and T2 can be converted to each other
1858 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1859 can only be converted with -flax-vector-conversions yet that is not
1860 in effect, emit a note telling the user about that option if such
1861 a note has not previously been emitted. */
1863 vector_types_convertible_p (const_tree t1, const_tree t2, bool emit_lax_note)
1865 static bool emitted_lax_note = false;
1866 bool convertible_lax;
1868 if ((TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2))
1869 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
1873 (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
1874 && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE ||
1875 TYPE_PRECISION (t1) == TYPE_PRECISION (t2))
1876 && (INTEGRAL_TYPE_P (TREE_TYPE (t1))
1877 == INTEGRAL_TYPE_P (TREE_TYPE (t2))));
1879 if (!convertible_lax || flag_lax_vector_conversions)
1880 return convertible_lax;
1882 if (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1883 && lang_hooks.types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1886 if (emit_lax_note && !emitted_lax_note)
1888 emitted_lax_note = true;
1889 inform (input_location, "use -flax-vector-conversions to permit "
1890 "conversions between vectors with differing "
1891 "element types or numbers of subparts");
1897 /* This is a helper function of build_binary_op.
1899 For certain operations if both args were extended from the same
1900 smaller type, do the arithmetic in that type and then extend.
1902 BITWISE indicates a bitwise operation.
1903 For them, this optimization is safe only if
1904 both args are zero-extended or both are sign-extended.
1905 Otherwise, we might change the result.
1906 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1907 but calculated in (unsigned short) it would be (unsigned short)-1.
1909 tree shorten_binary_op (tree result_type, tree op0, tree op1, bool bitwise)
1911 int unsigned0, unsigned1;
1916 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1917 excessive narrowing when we call get_narrower below. For
1918 example, suppose that OP0 is of unsigned int extended
1919 from signed char and that RESULT_TYPE is long long int.
1920 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1923 (long long int) (unsigned int) signed_char
1925 which get_narrower would narrow down to
1927 (unsigned int) signed char
1929 If we do not cast OP0 first, get_narrower would return
1930 signed_char, which is inconsistent with the case of the
1932 op0 = convert (result_type, op0);
1933 op1 = convert (result_type, op1);
1935 arg0 = get_narrower (op0, &unsigned0);
1936 arg1 = get_narrower (op1, &unsigned1);
1938 /* UNS is 1 if the operation to be done is an unsigned one. */
1939 uns = TYPE_UNSIGNED (result_type);
1941 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1942 but it *requires* conversion to FINAL_TYPE. */
1944 if ((TYPE_PRECISION (TREE_TYPE (op0))
1945 == TYPE_PRECISION (TREE_TYPE (arg0)))
1946 && TREE_TYPE (op0) != result_type)
1947 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
1948 if ((TYPE_PRECISION (TREE_TYPE (op1))
1949 == TYPE_PRECISION (TREE_TYPE (arg1)))
1950 && TREE_TYPE (op1) != result_type)
1951 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
1953 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1955 /* For bitwise operations, signedness of nominal type
1956 does not matter. Consider only how operands were extended. */
1960 /* Note that in all three cases below we refrain from optimizing
1961 an unsigned operation on sign-extended args.
1962 That would not be valid. */
1964 /* Both args variable: if both extended in same way
1965 from same width, do it in that width.
1966 Do it unsigned if args were zero-extended. */
1967 if ((TYPE_PRECISION (TREE_TYPE (arg0))
1968 < TYPE_PRECISION (result_type))
1969 && (TYPE_PRECISION (TREE_TYPE (arg1))
1970 == TYPE_PRECISION (TREE_TYPE (arg0)))
1971 && unsigned0 == unsigned1
1972 && (unsigned0 || !uns))
1973 return c_common_signed_or_unsigned_type
1974 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
1976 else if (TREE_CODE (arg0) == INTEGER_CST
1977 && (unsigned1 || !uns)
1978 && (TYPE_PRECISION (TREE_TYPE (arg1))
1979 < TYPE_PRECISION (result_type))
1981 = c_common_signed_or_unsigned_type (unsigned1,
1983 && !POINTER_TYPE_P (type)
1984 && int_fits_type_p (arg0, type))
1987 else if (TREE_CODE (arg1) == INTEGER_CST
1988 && (unsigned0 || !uns)
1989 && (TYPE_PRECISION (TREE_TYPE (arg0))
1990 < TYPE_PRECISION (result_type))
1992 = c_common_signed_or_unsigned_type (unsigned0,
1994 && !POINTER_TYPE_P (type)
1995 && int_fits_type_p (arg1, type))
2001 /* Warns if the conversion of EXPR to TYPE may alter a value.
2002 This is a helper function for warnings_for_convert_and_check. */
2005 conversion_warning (tree type, tree expr)
2007 bool give_warning = false;
2010 const int expr_num_operands = TREE_OPERAND_LENGTH (expr);
2011 tree expr_type = TREE_TYPE (expr);
2013 if (!warn_conversion && !warn_sign_conversion)
2016 /* If any operand is artificial, then this expression was generated
2017 by the compiler and we do not warn. */
2018 for (i = 0; i < expr_num_operands; i++)
2020 tree op = TREE_OPERAND (expr, i);
2021 if (op && DECL_P (op) && DECL_ARTIFICIAL (op))
2025 switch (TREE_CODE (expr))
2033 case TRUTH_ANDIF_EXPR:
2034 case TRUTH_ORIF_EXPR:
2035 case TRUTH_AND_EXPR:
2037 case TRUTH_XOR_EXPR:
2038 case TRUTH_NOT_EXPR:
2039 /* Conversion from boolean to a signed:1 bit-field (which only
2040 can hold the values 0 and -1) doesn't lose information - but
2041 it does change the value. */
2042 if (TYPE_PRECISION (type) == 1 && !TYPE_UNSIGNED (type))
2043 warning (OPT_Wconversion,
2044 "conversion to %qT from boolean expression", type);
2050 /* Warn for real constant that is not an exact integer converted
2052 if (TREE_CODE (expr_type) == REAL_TYPE
2053 && TREE_CODE (type) == INTEGER_TYPE)
2055 if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (expr_type)))
2056 give_warning = true;
2058 /* Warn for an integer constant that does not fit into integer type. */
2059 else if (TREE_CODE (expr_type) == INTEGER_TYPE
2060 && TREE_CODE (type) == INTEGER_TYPE
2061 && !int_fits_type_p (expr, type))
2063 if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)
2064 && tree_int_cst_sgn (expr) < 0)
2065 warning (OPT_Wsign_conversion,
2066 "negative integer implicitly converted to unsigned type");
2067 else if (!TYPE_UNSIGNED (type) && TYPE_UNSIGNED (expr_type))
2068 warning (OPT_Wsign_conversion, "conversion of unsigned constant "
2069 "value to negative integer");
2071 give_warning = true;
2073 else if (TREE_CODE (type) == REAL_TYPE)
2075 /* Warn for an integer constant that does not fit into real type. */
2076 if (TREE_CODE (expr_type) == INTEGER_TYPE)
2078 REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr);
2079 if (!exact_real_truncate (TYPE_MODE (type), &a))
2080 give_warning = true;
2082 /* Warn for a real constant that does not fit into a smaller
2084 else if (TREE_CODE (expr_type) == REAL_TYPE
2085 && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
2087 REAL_VALUE_TYPE a = TREE_REAL_CST (expr);
2088 if (!exact_real_truncate (TYPE_MODE (type), &a))
2089 give_warning = true;
2094 warning (OPT_Wconversion,
2095 "conversion to %qT alters %qT constant value",
2102 /* In case of COND_EXPR, if both operands are constants or
2103 COND_EXPR, then we do not care about the type of COND_EXPR,
2104 only about the conversion of each operand. */
2105 tree op1 = TREE_OPERAND (expr, 1);
2106 tree op2 = TREE_OPERAND (expr, 2);
2108 if ((TREE_CODE (op1) == REAL_CST || TREE_CODE (op1) == INTEGER_CST
2109 || TREE_CODE (op1) == COND_EXPR)
2110 && (TREE_CODE (op2) == REAL_CST || TREE_CODE (op2) == INTEGER_CST
2111 || TREE_CODE (op2) == COND_EXPR))
2113 conversion_warning (type, op1);
2114 conversion_warning (type, op2);
2120 default: /* 'expr' is not a constant. */
2122 /* Warn for real types converted to integer types. */
2123 if (TREE_CODE (expr_type) == REAL_TYPE
2124 && TREE_CODE (type) == INTEGER_TYPE)
2125 give_warning = true;
2127 else if (TREE_CODE (expr_type) == INTEGER_TYPE
2128 && TREE_CODE (type) == INTEGER_TYPE)
2130 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2131 expr = get_unwidened (expr, 0);
2132 expr_type = TREE_TYPE (expr);
2134 /* Don't warn for short y; short x = ((int)y & 0xff); */
2135 if (TREE_CODE (expr) == BIT_AND_EXPR
2136 || TREE_CODE (expr) == BIT_IOR_EXPR
2137 || TREE_CODE (expr) == BIT_XOR_EXPR)
2139 /* If both args were extended from a shortest type,
2140 use that type if that is safe. */
2141 expr_type = shorten_binary_op (expr_type,
2142 TREE_OPERAND (expr, 0),
2143 TREE_OPERAND (expr, 1),
2146 if (TREE_CODE (expr) == BIT_AND_EXPR)
2148 tree op0 = TREE_OPERAND (expr, 0);
2149 tree op1 = TREE_OPERAND (expr, 1);
2150 bool unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2151 bool unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
2153 /* If one of the operands is a non-negative constant
2154 that fits in the target type, then the type of the
2155 other operand does not matter. */
2156 if ((TREE_CODE (op0) == INTEGER_CST
2157 && int_fits_type_p (op0, c_common_signed_type (type))
2158 && int_fits_type_p (op0, c_common_unsigned_type (type)))
2159 || (TREE_CODE (op1) == INTEGER_CST
2160 && int_fits_type_p (op1, c_common_signed_type (type))
2161 && int_fits_type_p (op1,
2162 c_common_unsigned_type (type))))
2164 /* If constant is unsigned and fits in the target
2165 type, then the result will also fit. */
2166 else if ((TREE_CODE (op0) == INTEGER_CST
2168 && int_fits_type_p (op0, type))
2169 || (TREE_CODE (op1) == INTEGER_CST
2171 && int_fits_type_p (op1, type)))
2175 /* Warn for integer types converted to smaller integer types. */
2176 if (TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
2177 give_warning = true;
2179 /* When they are the same width but different signedness,
2180 then the value may change. */
2181 else if ((TYPE_PRECISION (type) == TYPE_PRECISION (expr_type)
2182 && TYPE_UNSIGNED (expr_type) != TYPE_UNSIGNED (type))
2183 /* Even when converted to a bigger type, if the type is
2184 unsigned but expr is signed, then negative values
2186 || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)))
2187 warning (OPT_Wsign_conversion, "conversion to %qT from %qT "
2188 "may change the sign of the result",
2192 /* Warn for integer types converted to real types if and only if
2193 all the range of values of the integer type cannot be
2194 represented by the real type. */
2195 else if (TREE_CODE (expr_type) == INTEGER_TYPE
2196 && TREE_CODE (type) == REAL_TYPE)
2198 tree type_low_bound, type_high_bound;
2199 REAL_VALUE_TYPE real_low_bound, real_high_bound;
2201 /* Don't warn about char y = 0xff; float x = (int) y; */
2202 expr = get_unwidened (expr, 0);
2203 expr_type = TREE_TYPE (expr);
2205 type_low_bound = TYPE_MIN_VALUE (expr_type);
2206 type_high_bound = TYPE_MAX_VALUE (expr_type);
2207 real_low_bound = real_value_from_int_cst (0, type_low_bound);
2208 real_high_bound = real_value_from_int_cst (0, type_high_bound);
2210 if (!exact_real_truncate (TYPE_MODE (type), &real_low_bound)
2211 || !exact_real_truncate (TYPE_MODE (type), &real_high_bound))
2212 give_warning = true;
2215 /* Warn for real types converted to smaller real types. */
2216 else if (TREE_CODE (expr_type) == REAL_TYPE
2217 && TREE_CODE (type) == REAL_TYPE
2218 && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
2219 give_warning = true;
2223 warning (OPT_Wconversion,
2224 "conversion to %qT from %qT may alter its value",
2229 /* Produce warnings after a conversion. RESULT is the result of
2230 converting EXPR to TYPE. This is a helper function for
2231 convert_and_check and cp_convert_and_check. */
2234 warnings_for_convert_and_check (tree type, tree expr, tree result)
2236 if (TREE_CODE (expr) == INTEGER_CST
2237 && (TREE_CODE (type) == INTEGER_TYPE
2238 || TREE_CODE (type) == ENUMERAL_TYPE)
2239 && !int_fits_type_p (expr, type))
2241 /* Do not diagnose overflow in a constant expression merely
2242 because a conversion overflowed. */
2243 if (TREE_OVERFLOW (result))
2244 TREE_OVERFLOW (result) = TREE_OVERFLOW (expr);
2246 if (TYPE_UNSIGNED (type))
2248 /* This detects cases like converting -129 or 256 to
2250 if (!int_fits_type_p (expr, c_common_signed_type (type)))
2251 warning (OPT_Woverflow,
2252 "large integer implicitly truncated to unsigned type");
2254 conversion_warning (type, expr);
2256 else if (!int_fits_type_p (expr, c_common_unsigned_type (type)))
2257 warning (OPT_Woverflow,
2258 "overflow in implicit constant conversion");
2259 /* No warning for converting 0x80000000 to int. */
2261 && (TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE
2262 || TYPE_PRECISION (TREE_TYPE (expr))
2263 != TYPE_PRECISION (type)))
2264 warning (OPT_Woverflow,
2265 "overflow in implicit constant conversion");
2268 conversion_warning (type, expr);
2270 else if ((TREE_CODE (result) == INTEGER_CST
2271 || TREE_CODE (result) == FIXED_CST) && TREE_OVERFLOW (result))
2272 warning (OPT_Woverflow,
2273 "overflow in implicit constant conversion");
2275 conversion_warning (type, expr);
2279 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2280 Invoke this function on every expression that is converted implicitly,
2281 i.e. because of language rules and not because of an explicit cast. */
2284 convert_and_check (tree type, tree expr)
2287 tree expr_for_warning;
2289 /* Convert from a value with possible excess precision rather than
2290 via the semantic type, but do not warn about values not fitting
2291 exactly in the semantic type. */
2292 if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
2294 tree orig_type = TREE_TYPE (expr);
2295 expr = TREE_OPERAND (expr, 0);
2296 expr_for_warning = convert (orig_type, expr);
2297 if (orig_type == type)
2298 return expr_for_warning;
2301 expr_for_warning = expr;
2303 if (TREE_TYPE (expr) == type)
2306 result = convert (type, expr);
2308 if (c_inhibit_evaluation_warnings == 0
2309 && !TREE_OVERFLOW_P (expr)
2310 && result != error_mark_node)
2311 warnings_for_convert_and_check (type, expr_for_warning, result);
2316 /* A node in a list that describes references to variables (EXPR), which are
2317 either read accesses if WRITER is zero, or write accesses, in which case
2318 WRITER is the parent of EXPR. */
2325 /* Used to implement a cache the results of a call to verify_tree. We only
2326 use this for SAVE_EXPRs. */
2329 struct tlist_cache *next;
2330 struct tlist *cache_before_sp;
2331 struct tlist *cache_after_sp;
2335 /* Obstack to use when allocating tlist structures, and corresponding
2337 static struct obstack tlist_obstack;
2338 static char *tlist_firstobj = 0;
2340 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2342 static struct tlist *warned_ids;
2343 /* SAVE_EXPRs need special treatment. We process them only once and then
2344 cache the results. */
2345 static struct tlist_cache *save_expr_cache;
2347 static void add_tlist (struct tlist **, struct tlist *, tree, int);
2348 static void merge_tlist (struct tlist **, struct tlist *, int);
2349 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
2350 static int warning_candidate_p (tree);
2351 static bool candidate_equal_p (const_tree, const_tree);
2352 static void warn_for_collisions (struct tlist *);
2353 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
2354 static struct tlist *new_tlist (struct tlist *, tree, tree);
2356 /* Create a new struct tlist and fill in its fields. */
2357 static struct tlist *
2358 new_tlist (struct tlist *next, tree t, tree writer)
2361 l = XOBNEW (&tlist_obstack, struct tlist);
2368 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2369 is nonnull, we ignore any node we find which has a writer equal to it. */
2372 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
2376 struct tlist *next = add->next;
2379 if (!exclude_writer || !candidate_equal_p (add->writer, exclude_writer))
2380 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
2385 /* Merge the nodes of ADD into TO. This merging process is done so that for
2386 each variable that already exists in TO, no new node is added; however if
2387 there is a write access recorded in ADD, and an occurrence on TO is only
2388 a read access, then the occurrence in TO will be modified to record the
2392 merge_tlist (struct tlist **to, struct tlist *add, int copy)
2394 struct tlist **end = to;
2397 end = &(*end)->next;
2403 struct tlist *next = add->next;
2405 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
2406 if (candidate_equal_p (tmp2->expr, add->expr))
2410 tmp2->writer = add->writer;
2414 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
2415 end = &(*end)->next;
2422 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2423 references in list LIST conflict with it, excluding reads if ONLY writers
2427 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
2432 /* Avoid duplicate warnings. */
2433 for (tmp = warned_ids; tmp; tmp = tmp->next)
2434 if (candidate_equal_p (tmp->expr, written))
2439 if (candidate_equal_p (list->expr, written)
2440 && !candidate_equal_p (list->writer, writer)
2441 && (!only_writes || list->writer))
2443 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
2444 warning_at (EXPR_HAS_LOCATION (writer)
2445 ? EXPR_LOCATION (writer) : input_location,
2446 OPT_Wsequence_point, "operation on %qE may be undefined",
2453 /* Given a list LIST of references to variables, find whether any of these
2454 can cause conflicts due to missing sequence points. */
2457 warn_for_collisions (struct tlist *list)
2461 for (tmp = list; tmp; tmp = tmp->next)
2464 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
2468 /* Return nonzero if X is a tree that can be verified by the sequence point
2471 warning_candidate_p (tree x)
2473 /* !VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2474 (lvalue_p) crash on TRY/CATCH. */
2475 return !(DECL_P (x) && DECL_ARTIFICIAL (x))
2476 && TREE_TYPE (x) && !VOID_TYPE_P (TREE_TYPE (x)) && lvalue_p (x);
2479 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2481 candidate_equal_p (const_tree x, const_tree y)
2483 return (x == y) || (x && y && operand_equal_p (x, y, 0));
2486 /* Walk the tree X, and record accesses to variables. If X is written by the
2487 parent tree, WRITER is the parent.
2488 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2489 expression or its only operand forces a sequence point, then everything up
2490 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2492 Once we return, we will have emitted warnings if any subexpression before
2493 such a sequence point could be undefined. On a higher level, however, the
2494 sequence point may not be relevant, and we'll merge the two lists.
2496 Example: (b++, a) + b;
2497 The call that processes the COMPOUND_EXPR will store the increment of B
2498 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2499 processes the PLUS_EXPR will need to merge the two lists so that
2500 eventually, all accesses end up on the same list (and we'll warn about the
2501 unordered subexpressions b++ and b.
2503 A note on merging. If we modify the former example so that our expression
2506 care must be taken not simply to add all three expressions into the final
2507 PNO_SP list. The function merge_tlist takes care of that by merging the
2508 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2509 way, so that no more than one access to B is recorded. */
2512 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
2515 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
2516 enum tree_code code;
2517 enum tree_code_class cl;
2519 /* X may be NULL if it is the operand of an empty statement expression
2525 code = TREE_CODE (x);
2526 cl = TREE_CODE_CLASS (code);
2528 if (warning_candidate_p (x))
2529 *pno_sp = new_tlist (*pno_sp, x, writer);
2537 case TRUTH_ANDIF_EXPR:
2538 case TRUTH_ORIF_EXPR:
2539 tmp_before = tmp_nosp = tmp_list3 = 0;
2540 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
2541 warn_for_collisions (tmp_nosp);
2542 merge_tlist (pbefore_sp, tmp_before, 0);
2543 merge_tlist (pbefore_sp, tmp_nosp, 0);
2544 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
2545 merge_tlist (pbefore_sp, tmp_list3, 0);
2549 tmp_before = tmp_list2 = 0;
2550 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
2551 warn_for_collisions (tmp_list2);
2552 merge_tlist (pbefore_sp, tmp_before, 0);
2553 merge_tlist (pbefore_sp, tmp_list2, 1);
2555 tmp_list3 = tmp_nosp = 0;
2556 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
2557 warn_for_collisions (tmp_nosp);
2558 merge_tlist (pbefore_sp, tmp_list3, 0);
2560 tmp_list3 = tmp_list2 = 0;
2561 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
2562 warn_for_collisions (tmp_list2);
2563 merge_tlist (pbefore_sp, tmp_list3, 0);
2564 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2565 two first, to avoid warning for (a ? b++ : b++). */
2566 merge_tlist (&tmp_nosp, tmp_list2, 0);
2567 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
2570 case PREDECREMENT_EXPR:
2571 case PREINCREMENT_EXPR:
2572 case POSTDECREMENT_EXPR:
2573 case POSTINCREMENT_EXPR:
2574 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
2578 tmp_before = tmp_nosp = tmp_list3 = 0;
2579 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
2580 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
2581 /* Expressions inside the LHS are not ordered wrt. the sequence points
2582 in the RHS. Example:
2584 Despite the fact that the modification of "a" is in the before_sp
2585 list (tmp_before), it conflicts with the use of "a" in the LHS.
2586 We can handle this by adding the contents of tmp_list3
2587 to those of tmp_before, and redoing the collision warnings for that
2589 add_tlist (&tmp_before, tmp_list3, x, 1);
2590 warn_for_collisions (tmp_before);
2591 /* Exclude the LHS itself here; we first have to merge it into the
2592 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2593 didn't exclude the LHS, we'd get it twice, once as a read and once
2595 add_tlist (pno_sp, tmp_list3, x, 0);
2596 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
2598 merge_tlist (pbefore_sp, tmp_before, 0);
2599 if (warning_candidate_p (TREE_OPERAND (x, 0)))
2600 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
2601 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
2605 /* We need to warn about conflicts among arguments and conflicts between
2606 args and the function address. Side effects of the function address,
2607 however, are not ordered by the sequence point of the call. */
2609 call_expr_arg_iterator iter;
2611 tmp_before = tmp_nosp = 0;
2612 verify_tree (CALL_EXPR_FN (x), &tmp_before, &tmp_nosp, NULL_TREE);
2613 FOR_EACH_CALL_EXPR_ARG (arg, iter, x)
2615 tmp_list2 = tmp_list3 = 0;
2616 verify_tree (arg, &tmp_list2, &tmp_list3, NULL_TREE);
2617 merge_tlist (&tmp_list3, tmp_list2, 0);
2618 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
2620 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
2621 warn_for_collisions (tmp_before);
2622 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
2627 /* Scan all the list, e.g. indices of multi dimensional array. */
2630 tmp_before = tmp_nosp = 0;
2631 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
2632 merge_tlist (&tmp_nosp, tmp_before, 0);
2633 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
2640 struct tlist_cache *t;
2641 for (t = save_expr_cache; t; t = t->next)
2642 if (candidate_equal_p (t->expr, x))
2647 t = XOBNEW (&tlist_obstack, struct tlist_cache);
2648 t->next = save_expr_cache;
2650 save_expr_cache = t;
2652 tmp_before = tmp_nosp = 0;
2653 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
2654 warn_for_collisions (tmp_nosp);
2659 struct tlist *t = tmp_nosp;
2661 merge_tlist (&tmp_list3, t, 0);
2663 t->cache_before_sp = tmp_before;
2664 t->cache_after_sp = tmp_list3;
2666 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
2667 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
2672 x = TREE_OPERAND (x, 0);
2679 /* For other expressions, simply recurse on their operands.
2680 Manual tail recursion for unary expressions.
2681 Other non-expressions need not be processed. */
2682 if (cl == tcc_unary)
2684 x = TREE_OPERAND (x, 0);
2688 else if (IS_EXPR_CODE_CLASS (cl))
2691 int max = TREE_OPERAND_LENGTH (x);
2692 for (lp = 0; lp < max; lp++)
2694 tmp_before = tmp_nosp = 0;
2695 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0);
2696 merge_tlist (&tmp_nosp, tmp_before, 0);
2697 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
2704 /* Try to warn for undefined behavior in EXPR due to missing sequence
2708 verify_sequence_points (tree expr)
2710 struct tlist *before_sp = 0, *after_sp = 0;
2713 save_expr_cache = 0;
2714 if (tlist_firstobj == 0)
2716 gcc_obstack_init (&tlist_obstack);
2717 tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
2720 verify_tree (expr, &before_sp, &after_sp, 0);
2721 warn_for_collisions (after_sp);
2722 obstack_free (&tlist_obstack, tlist_firstobj);
2725 /* Validate the expression after `case' and apply default promotions. */
2728 check_case_value (tree value)
2730 if (value == NULL_TREE)
2733 /* ??? Can we ever get nops here for a valid case value? We
2735 STRIP_TYPE_NOPS (value);
2736 /* In C++, the following is allowed:
2739 switch (...) { case i: ... }
2741 So, we try to reduce the VALUE to a constant that way. */
2742 if (c_dialect_cxx ())
2744 value = decl_constant_value (value);
2745 STRIP_TYPE_NOPS (value);
2746 value = fold (value);
2749 if (TREE_CODE (value) == INTEGER_CST)
2750 /* Promote char or short to int. */
2751 value = perform_integral_promotions (value);
2752 else if (value != error_mark_node)
2754 error ("case label does not reduce to an integer constant");
2755 value = error_mark_node;
2758 constant_expression_warning (value);
2763 /* See if the case values LOW and HIGH are in the range of the original
2764 type (i.e. before the default conversion to int) of the switch testing
2766 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2767 the type before promoting it. CASE_LOW_P is a pointer to the lower
2768 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2769 if the case is not a case range.
2770 The caller has to make sure that we are not called with NULL for
2771 CASE_LOW_P (i.e. the default case).
2772 Returns true if the case label is in range of ORIG_TYPE (saturated or
2773 untouched) or false if the label is out of range. */
2776 check_case_bounds (tree type, tree orig_type,
2777 tree *case_low_p, tree *case_high_p)
2779 tree min_value, max_value;
2780 tree case_low = *case_low_p;
2781 tree case_high = case_high_p ? *case_high_p : case_low;
2783 /* If there was a problem with the original type, do nothing. */
2784 if (orig_type == error_mark_node)
2787 min_value = TYPE_MIN_VALUE (orig_type);
2788 max_value = TYPE_MAX_VALUE (orig_type);
2790 /* Case label is less than minimum for type. */
2791 if (tree_int_cst_compare (case_low, min_value) < 0
2792 && tree_int_cst_compare (case_high, min_value) < 0)
2794 warning (0, "case label value is less than minimum value for type");
2798 /* Case value is greater than maximum for type. */
2799 if (tree_int_cst_compare (case_low, max_value) > 0
2800 && tree_int_cst_compare (case_high, max_value) > 0)
2802 warning (0, "case label value exceeds maximum value for type");
2806 /* Saturate lower case label value to minimum. */
2807 if (tree_int_cst_compare (case_high, min_value) >= 0
2808 && tree_int_cst_compare (case_low, min_value) < 0)
2810 warning (0, "lower value in case label range"
2811 " less than minimum value for type");
2812 case_low = min_value;
2815 /* Saturate upper case label value to maximum. */
2816 if (tree_int_cst_compare (case_low, max_value) <= 0
2817 && tree_int_cst_compare (case_high, max_value) > 0)
2819 warning (0, "upper value in case label range"
2820 " exceeds maximum value for type");
2821 case_high = max_value;
2824 if (*case_low_p != case_low)
2825 *case_low_p = convert (type, case_low);
2826 if (case_high_p && *case_high_p != case_high)
2827 *case_high_p = convert (type, case_high);
2832 /* Return an integer type with BITS bits of precision,
2833 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2836 c_common_type_for_size (unsigned int bits, int unsignedp)
2838 if (bits == TYPE_PRECISION (integer_type_node))
2839 return unsignedp ? unsigned_type_node : integer_type_node;
2841 if (bits == TYPE_PRECISION (signed_char_type_node))
2842 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2844 if (bits == TYPE_PRECISION (short_integer_type_node))
2845 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2847 if (bits == TYPE_PRECISION (long_integer_type_node))
2848 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2850 if (bits == TYPE_PRECISION (long_long_integer_type_node))
2851 return (unsignedp ? long_long_unsigned_type_node
2852 : long_long_integer_type_node);
2854 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
2855 return (unsignedp ? widest_unsigned_literal_type_node
2856 : widest_integer_literal_type_node);
2858 if (bits <= TYPE_PRECISION (intQI_type_node))
2859 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2861 if (bits <= TYPE_PRECISION (intHI_type_node))
2862 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2864 if (bits <= TYPE_PRECISION (intSI_type_node))
2865 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2867 if (bits <= TYPE_PRECISION (intDI_type_node))
2868 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2873 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2874 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2875 and saturating if SATP is nonzero, otherwise not saturating. */
2878 c_common_fixed_point_type_for_size (unsigned int ibit, unsigned int fbit,
2879 int unsignedp, int satp)
2881 enum machine_mode mode;
2883 mode = unsignedp ? UQQmode : QQmode;
2885 mode = unsignedp ? UHAmode : HAmode;
2887 for (; mode != VOIDmode; mode = GET_MODE_WIDER_MODE (mode))
2888 if (GET_MODE_IBIT (mode) >= ibit && GET_MODE_FBIT (mode) >= fbit)
2891 if (mode == VOIDmode || !targetm.scalar_mode_supported_p (mode))
2893 sorry ("GCC cannot support operators with integer types and "
2894 "fixed-point types that have too many integral and "
2895 "fractional bits together");
2899 return c_common_type_for_mode (mode, satp);
2902 /* Used for communication between c_common_type_for_mode and
2903 c_register_builtin_type. */
2904 static GTY(()) tree registered_builtin_types;
2906 /* Return a data type that has machine mode MODE.
2907 If the mode is an integer,
2908 then UNSIGNEDP selects between signed and unsigned types.
2909 If the mode is a fixed-point mode,
2910 then UNSIGNEDP selects between saturating and nonsaturating types. */
2913 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
2917 if (mode == TYPE_MODE (integer_type_node))
2918 return unsignedp ? unsigned_type_node : integer_type_node;
2920 if (mode == TYPE_MODE (signed_char_type_node))
2921 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2923 if (mode == TYPE_MODE (short_integer_type_node))
2924 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2926 if (mode == TYPE_MODE (long_integer_type_node))
2927 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2929 if (mode == TYPE_MODE (long_long_integer_type_node))
2930 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
2932 if (mode == TYPE_MODE (widest_integer_literal_type_node))
2933 return unsignedp ? widest_unsigned_literal_type_node
2934 : widest_integer_literal_type_node;
2937 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2940 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2943 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2946 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2948 #if HOST_BITS_PER_WIDE_INT >= 64
2949 if (mode == TYPE_MODE (intTI_type_node))
2950 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2953 if (mode == TYPE_MODE (float_type_node))
2954 return float_type_node;
2956 if (mode == TYPE_MODE (double_type_node))
2957 return double_type_node;
2959 if (mode == TYPE_MODE (long_double_type_node))
2960 return long_double_type_node;
2962 if (mode == TYPE_MODE (void_type_node))
2963 return void_type_node;
2965 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
2967 ? make_unsigned_type (GET_MODE_PRECISION (mode))
2968 : make_signed_type (GET_MODE_PRECISION (mode)));
2970 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
2972 ? make_unsigned_type (GET_MODE_PRECISION (mode))
2973 : make_signed_type (GET_MODE_PRECISION (mode)));
2975 if (COMPLEX_MODE_P (mode))
2977 enum machine_mode inner_mode;
2980 if (mode == TYPE_MODE (complex_float_type_node))
2981 return complex_float_type_node;
2982 if (mode == TYPE_MODE (complex_double_type_node))
2983 return complex_double_type_node;
2984 if (mode == TYPE_MODE (complex_long_double_type_node))
2985 return complex_long_double_type_node;
2987 if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp)
2988 return complex_integer_type_node;
2990 inner_mode = GET_MODE_INNER (mode);
2991 inner_type = c_common_type_for_mode (inner_mode, unsignedp);
2992 if (inner_type != NULL_TREE)
2993 return build_complex_type (inner_type);
2995 else if (VECTOR_MODE_P (mode))
2997 enum machine_mode inner_mode = GET_MODE_INNER (mode);
2998 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
2999 if (inner_type != NULL_TREE)
3000 return build_vector_type_for_mode (inner_type, mode);
3003 if (mode == TYPE_MODE (dfloat32_type_node))
3004 return dfloat32_type_node;
3005 if (mode == TYPE_MODE (dfloat64_type_node))
3006 return dfloat64_type_node;
3007 if (mode == TYPE_MODE (dfloat128_type_node))
3008 return dfloat128_type_node;
3010 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode))
3012 if (mode == TYPE_MODE (short_fract_type_node))
3013 return unsignedp ? sat_short_fract_type_node : short_fract_type_node;
3014 if (mode == TYPE_MODE (fract_type_node))
3015 return unsignedp ? sat_fract_type_node : fract_type_node;
3016 if (mode == TYPE_MODE (long_fract_type_node))
3017 return unsignedp ? sat_long_fract_type_node : long_fract_type_node;
3018 if (mode == TYPE_MODE (long_long_fract_type_node))
3019 return unsignedp ? sat_long_long_fract_type_node
3020 : long_long_fract_type_node;
3022 if (mode == TYPE_MODE (unsigned_short_fract_type_node))
3023 return unsignedp ? sat_unsigned_short_fract_type_node
3024 : unsigned_short_fract_type_node;
3025 if (mode == TYPE_MODE (unsigned_fract_type_node))
3026 return unsignedp ? sat_unsigned_fract_type_node
3027 : unsigned_fract_type_node;
3028 if (mode == TYPE_MODE (unsigned_long_fract_type_node))
3029 return unsignedp ? sat_unsigned_long_fract_type_node
3030 : unsigned_long_fract_type_node;
3031 if (mode == TYPE_MODE (unsigned_long_long_fract_type_node))
3032 return unsignedp ? sat_unsigned_long_long_fract_type_node
3033 : unsigned_long_long_fract_type_node;
3035 if (mode == TYPE_MODE (short_accum_type_node))
3036 return unsignedp ? sat_short_accum_type_node : short_accum_type_node;
3037 if (mode == TYPE_MODE (accum_type_node))
3038 return unsignedp ? sat_accum_type_node : accum_type_node;
3039 if (mode == TYPE_MODE (long_accum_type_node))
3040 return unsignedp ? sat_long_accum_type_node : long_accum_type_node;
3041 if (mode == TYPE_MODE (long_long_accum_type_node))
3042 return unsignedp ? sat_long_long_accum_type_node
3043 : long_long_accum_type_node;
3045 if (mode == TYPE_MODE (unsigned_short_accum_type_node))
3046 return unsignedp ? sat_unsigned_short_accum_type_node
3047 : unsigned_short_accum_type_node;
3048 if (mode == TYPE_MODE (unsigned_accum_type_node))
3049 return unsignedp ? sat_unsigned_accum_type_node
3050 : unsigned_accum_type_node;
3051 if (mode == TYPE_MODE (unsigned_long_accum_type_node))
3052 return unsignedp ? sat_unsigned_long_accum_type_node
3053 : unsigned_long_accum_type_node;
3054 if (mode == TYPE_MODE (unsigned_long_long_accum_type_node))
3055 return unsignedp ? sat_unsigned_long_long_accum_type_node
3056 : unsigned_long_long_accum_type_node;
3059 return unsignedp ? sat_qq_type_node : qq_type_node;
3061 return unsignedp ? sat_hq_type_node : hq_type_node;
3063 return unsignedp ? sat_sq_type_node : sq_type_node;
3065 return unsignedp ? sat_dq_type_node : dq_type_node;
3067 return unsignedp ? sat_tq_type_node : tq_type_node;
3069 if (mode == UQQmode)
3070 return unsignedp ? sat_uqq_type_node : uqq_type_node;
3071 if (mode == UHQmode)
3072 return unsignedp ? sat_uhq_type_node : uhq_type_node;
3073 if (mode == USQmode)
3074 return unsignedp ? sat_usq_type_node : usq_type_node;
3075 if (mode == UDQmode)
3076 return unsignedp ? sat_udq_type_node : udq_type_node;
3077 if (mode == UTQmode)
3078 return unsignedp ? sat_utq_type_node : utq_type_node;
3081 return unsignedp ? sat_ha_type_node : ha_type_node;
3083 return unsignedp ? sat_sa_type_node : sa_type_node;
3085 return unsignedp ? sat_da_type_node : da_type_node;
3087 return unsignedp ? sat_ta_type_node : ta_type_node;
3089 if (mode == UHAmode)
3090 return unsignedp ? sat_uha_type_node : uha_type_node;
3091 if (mode == USAmode)
3092 return unsignedp ? sat_usa_type_node : usa_type_node;
3093 if (mode == UDAmode)
3094 return unsignedp ? sat_uda_type_node : uda_type_node;
3095 if (mode == UTAmode)
3096 return unsignedp ? sat_uta_type_node : uta_type_node;
3099 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
3100 if (TYPE_MODE (TREE_VALUE (t)) == mode)
3101 return TREE_VALUE (t);
3107 c_common_unsigned_type (tree type)
3109 return c_common_signed_or_unsigned_type (1, type);
3112 /* Return a signed type the same as TYPE in other respects. */
3115 c_common_signed_type (tree type)
3117 return c_common_signed_or_unsigned_type (0, type);
3120 /* Return a type the same as TYPE except unsigned or
3121 signed according to UNSIGNEDP. */
3124 c_common_signed_or_unsigned_type (int unsignedp, tree type)
3128 /* This block of code emulates the behavior of the old
3129 c_common_unsigned_type. In particular, it returns
3130 long_unsigned_type_node if passed a long, even when a int would
3131 have the same size. This is necessary for warnings to work
3132 correctly in archs where sizeof(int) == sizeof(long) */
3134 type1 = TYPE_MAIN_VARIANT (type);
3135 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3136 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
3137 if (type1 == integer_type_node || type1 == unsigned_type_node)
3138 return unsignedp ? unsigned_type_node : integer_type_node;
3139 if (type1 == short_integer_type_node || type1 == short_unsigned_type_node)
3140 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
3141 if (type1 == long_integer_type_node || type1 == long_unsigned_type_node)
3142 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
3143 if (type1 == long_long_integer_type_node || type1 == long_long_unsigned_type_node)
3144 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
3145 if (type1 == widest_integer_literal_type_node || type1 == widest_unsigned_literal_type_node)
3146 return unsignedp ? widest_unsigned_literal_type_node : widest_integer_literal_type_node;
3147 #if HOST_BITS_PER_WIDE_INT >= 64
3148 if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node)
3149 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
3151 if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node)
3152 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
3153 if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node)
3154 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
3155 if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node)
3156 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
3157 if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node)
3158 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
3160 #define C_COMMON_FIXED_TYPES(NAME) \
3161 if (type1 == short_ ## NAME ## _type_node \
3162 || type1 == unsigned_short_ ## NAME ## _type_node) \
3163 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3164 : short_ ## NAME ## _type_node; \
3165 if (type1 == NAME ## _type_node \
3166 || type1 == unsigned_ ## NAME ## _type_node) \
3167 return unsignedp ? unsigned_ ## NAME ## _type_node \
3168 : NAME ## _type_node; \
3169 if (type1 == long_ ## NAME ## _type_node \
3170 || type1 == unsigned_long_ ## NAME ## _type_node) \
3171 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3172 : long_ ## NAME ## _type_node; \
3173 if (type1 == long_long_ ## NAME ## _type_node \
3174 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3175 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3176 : long_long_ ## NAME ## _type_node;
3178 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3179 if (type1 == NAME ## _type_node \
3180 || type1 == u ## NAME ## _type_node) \
3181 return unsignedp ? u ## NAME ## _type_node \
3182 : NAME ## _type_node;
3184 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3185 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3186 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3187 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3188 : sat_ ## short_ ## NAME ## _type_node; \
3189 if (type1 == sat_ ## NAME ## _type_node \
3190 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3191 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3192 : sat_ ## NAME ## _type_node; \
3193 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3194 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3195 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3196 : sat_ ## long_ ## NAME ## _type_node; \
3197 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3198 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3199 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3200 : sat_ ## long_long_ ## NAME ## _type_node;
3202 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3203 if (type1 == sat_ ## NAME ## _type_node \
3204 || type1 == sat_ ## u ## NAME ## _type_node) \
3205 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3206 : sat_ ## NAME ## _type_node;
3208 C_COMMON_FIXED_TYPES (fract);
3209 C_COMMON_FIXED_TYPES_SAT (fract);
3210 C_COMMON_FIXED_TYPES (accum);
3211 C_COMMON_FIXED_TYPES_SAT (accum);
3213 C_COMMON_FIXED_MODE_TYPES (qq);
3214 C_COMMON_FIXED_MODE_TYPES (hq);
3215 C_COMMON_FIXED_MODE_TYPES (sq);
3216 C_COMMON_FIXED_MODE_TYPES (dq);
3217 C_COMMON_FIXED_MODE_TYPES (tq);
3218 C_COMMON_FIXED_MODE_TYPES_SAT (qq);
3219 C_COMMON_FIXED_MODE_TYPES_SAT (hq);
3220 C_COMMON_FIXED_MODE_TYPES_SAT (sq);
3221 C_COMMON_FIXED_MODE_TYPES_SAT (dq);
3222 C_COMMON_FIXED_MODE_TYPES_SAT (tq);
3223 C_COMMON_FIXED_MODE_TYPES (ha);
3224 C_COMMON_FIXED_MODE_TYPES (sa);
3225 C_COMMON_FIXED_MODE_TYPES (da);
3226 C_COMMON_FIXED_MODE_TYPES (ta);
3227 C_COMMON_FIXED_MODE_TYPES_SAT (ha);
3228 C_COMMON_FIXED_MODE_TYPES_SAT (sa);
3229 C_COMMON_FIXED_MODE_TYPES_SAT (da);
3230 C_COMMON_FIXED_MODE_TYPES_SAT (ta);
3232 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3233 the precision; they have precision set to match their range, but
3234 may use a wider mode to match an ABI. If we change modes, we may
3235 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3236 the precision as well, so as to yield correct results for
3237 bit-field types. C++ does not have these separate bit-field
3238 types, and producing a signed or unsigned variant of an
3239 ENUMERAL_TYPE may cause other problems as well. */
3241 if (!INTEGRAL_TYPE_P (type)
3242 || TYPE_UNSIGNED (type) == unsignedp)
3245 #define TYPE_OK(node) \
3246 (TYPE_MODE (type) == TYPE_MODE (node) \
3247 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3248 if (TYPE_OK (signed_char_type_node))
3249 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
3250 if (TYPE_OK (integer_type_node))
3251 return unsignedp ? unsigned_type_node : integer_type_node;
3252 if (TYPE_OK (short_integer_type_node))
3253 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
3254 if (TYPE_OK (long_integer_type_node))
3255 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
3256 if (TYPE_OK (long_long_integer_type_node))
3257 return (unsignedp ? long_long_unsigned_type_node
3258 : long_long_integer_type_node);
3259 if (TYPE_OK (widest_integer_literal_type_node))
3260 return (unsignedp ? widest_unsigned_literal_type_node
3261 : widest_integer_literal_type_node);
3263 #if HOST_BITS_PER_WIDE_INT >= 64
3264 if (TYPE_OK (intTI_type_node))
3265 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
3267 if (TYPE_OK (intDI_type_node))
3268 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
3269 if (TYPE_OK (intSI_type_node))
3270 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
3271 if (TYPE_OK (intHI_type_node))
3272 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
3273 if (TYPE_OK (intQI_type_node))
3274 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
3277 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
3280 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3283 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp)
3285 /* Extended integer types of the same width as a standard type have
3286 lesser rank, so those of the same width as int promote to int or
3287 unsigned int and are valid for printf formats expecting int or
3288 unsigned int. To avoid such special cases, avoid creating
3289 extended integer types for bit-fields if a standard integer type
3291 if (width == TYPE_PRECISION (integer_type_node))
3292 return unsignedp ? unsigned_type_node : integer_type_node;
3293 if (width == TYPE_PRECISION (signed_char_type_node))
3294 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
3295 if (width == TYPE_PRECISION (short_integer_type_node))
3296 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
3297 if (width == TYPE_PRECISION (long_integer_type_node))
3298 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
3299 if (width == TYPE_PRECISION (long_long_integer_type_node))
3300 return (unsignedp ? long_long_unsigned_type_node
3301 : long_long_integer_type_node);
3302 return build_nonstandard_integer_type (width, unsignedp);
3305 /* The C version of the register_builtin_type langhook. */
3308 c_register_builtin_type (tree type, const char* name)
3312 decl = build_decl (UNKNOWN_LOCATION,
3313 TYPE_DECL, get_identifier (name), type);
3314 DECL_ARTIFICIAL (decl) = 1;
3315 if (!TYPE_NAME (type))
3316 TYPE_NAME (type) = decl;
3319 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
3322 /* Print an error message for invalid operands to arith operation
3323 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3324 LOCATION is the location of the message. */
3327 binary_op_error (location_t location, enum tree_code code,
3328 tree type0, tree type1)
3335 opname = "+"; break;
3337 opname = "-"; break;
3339 opname = "*"; break;
3341 opname = "max"; break;
3343 opname = "min"; break;
3345 opname = "=="; break;
3347 opname = "!="; break;
3349 opname = "<="; break;
3351 opname = ">="; break;
3353 opname = "<"; break;
3355 opname = ">"; break;
3357 opname = "<<"; break;
3359 opname = ">>"; break;
3360 case TRUNC_MOD_EXPR:
3361 case FLOOR_MOD_EXPR:
3362 opname = "%"; break;
3363 case TRUNC_DIV_EXPR:
3364 case FLOOR_DIV_EXPR:
3365 opname = "/"; break;
3367 opname = "&"; break;
3369 opname = "|"; break;
3370 case TRUTH_ANDIF_EXPR:
3371 opname = "&&"; break;
3372 case TRUTH_ORIF_EXPR:
3373 opname = "||"; break;
3375 opname = "^"; break;
3380 "invalid operands to binary %s (have %qT and %qT)", opname,
3384 /* Subroutine of build_binary_op, used for comparison operations.
3385 See if the operands have both been converted from subword integer types
3386 and, if so, perhaps change them both back to their original type.
3387 This function is also responsible for converting the two operands
3388 to the proper common type for comparison.
3390 The arguments of this function are all pointers to local variables
3391 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3392 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3394 If this function returns nonzero, it means that the comparison has
3395 a constant value. What this function returns is an expression for
3399 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
3400 enum tree_code *rescode_ptr)
3403 tree op0 = *op0_ptr;
3404 tree op1 = *op1_ptr;
3405 int unsignedp0, unsignedp1;
3407 tree primop0, primop1;
3408 enum tree_code code = *rescode_ptr;
3410 /* Throw away any conversions to wider types
3411 already present in the operands. */
3413 primop0 = get_narrower (op0, &unsignedp0);
3414 primop1 = get_narrower (op1, &unsignedp1);
3416 /* Handle the case that OP0 does not *contain* a conversion
3417 but it *requires* conversion to FINAL_TYPE. */
3419 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
3420 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
3421 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
3422 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
3424 /* If one of the operands must be floated, we cannot optimize. */
3425 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
3426 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
3428 /* If first arg is constant, swap the args (changing operation
3429 so value is preserved), for canonicalization. Don't do this if
3430 the second arg is 0. */
3432 if (TREE_CONSTANT (primop0)
3433 && !integer_zerop (primop1) && !real_zerop (primop1)
3434 && !fixed_zerop (primop1))
3437 int temi = unsignedp0;
3445 unsignedp0 = unsignedp1;
3468 *rescode_ptr = code;
3471 /* If comparing an integer against a constant more bits wide,
3472 maybe we can deduce a value of 1 or 0 independent of the data.
3473 Or else truncate the constant now
3474 rather than extend the variable at run time.
3476 This is only interesting if the constant is the wider arg.
3477 Also, it is not safe if the constant is unsigned and the
3478 variable arg is signed, since in this case the variable
3479 would be sign-extended and then regarded as unsigned.
3480 Our technique fails in this case because the lowest/highest
3481 possible unsigned results don't follow naturally from the
3482 lowest/highest possible values of the variable operand.
3483 For just EQ_EXPR and NE_EXPR there is another technique that
3484 could be used: see if the constant can be faithfully represented
3485 in the other operand's type, by truncating it and reextending it
3486 and see if that preserves the constant's value. */
3488 if (!real1 && !real2
3489 && TREE_CODE (TREE_TYPE (primop0)) != FIXED_POINT_TYPE
3490 && TREE_CODE (primop1) == INTEGER_CST
3491 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
3493 int min_gt, max_gt, min_lt, max_lt;
3494 tree maxval, minval;
3495 /* 1 if comparison is nominally unsigned. */
3496 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
3499 type = c_common_signed_or_unsigned_type (unsignedp0,
3500 TREE_TYPE (primop0));
3502 maxval = TYPE_MAX_VALUE (type);
3503 minval = TYPE_MIN_VALUE (type);
3505 if (unsignedp && !unsignedp0)
3506 *restype_ptr = c_common_signed_type (*restype_ptr);
3508 if (TREE_TYPE (primop1) != *restype_ptr)
3510 /* Convert primop1 to target type, but do not introduce
3511 additional overflow. We know primop1 is an int_cst. */
3512 primop1 = force_fit_type_double (*restype_ptr,
3513 TREE_INT_CST_LOW (primop1),
3514 TREE_INT_CST_HIGH (primop1), 0,
3515 TREE_OVERFLOW (primop1));
3517 if (type != *restype_ptr)
3519 minval = convert (*restype_ptr, minval);
3520 maxval = convert (*restype_ptr, maxval);
3523 if (unsignedp && unsignedp0)
3525 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
3526 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
3527 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
3528 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
3532 min_gt = INT_CST_LT (primop1, minval);
3533 max_gt = INT_CST_LT (primop1, maxval);
3534 min_lt = INT_CST_LT (minval, primop1);
3535 max_lt = INT_CST_LT (maxval, primop1);
3539 /* This used to be a switch, but Genix compiler can't handle that. */
3540 if (code == NE_EXPR)
3542 if (max_lt || min_gt)
3543 val = truthvalue_true_node;
3545 else if (code == EQ_EXPR)
3547 if (max_lt || min_gt)
3548 val = truthvalue_false_node;
3550 else if (code == LT_EXPR)
3553 val = truthvalue_true_node;
3555 val = truthvalue_false_node;
3557 else if (code == GT_EXPR)
3560 val = truthvalue_true_node;
3562 val = truthvalue_false_node;
3564 else if (code == LE_EXPR)
3567 val = truthvalue_true_node;
3569 val = truthvalue_false_node;
3571 else if (code == GE_EXPR)
3574 val = truthvalue_true_node;
3576 val = truthvalue_false_node;
3579 /* If primop0 was sign-extended and unsigned comparison specd,
3580 we did a signed comparison above using the signed type bounds.
3581 But the comparison we output must be unsigned.
3583 Also, for inequalities, VAL is no good; but if the signed
3584 comparison had *any* fixed result, it follows that the
3585 unsigned comparison just tests the sign in reverse
3586 (positive values are LE, negative ones GE).
3587 So we can generate an unsigned comparison
3588 against an extreme value of the signed type. */
3590 if (unsignedp && !unsignedp0)
3597 primop1 = TYPE_MIN_VALUE (type);
3603 primop1 = TYPE_MAX_VALUE (type);
3610 type = c_common_unsigned_type (type);
3613 if (TREE_CODE (primop0) != INTEGER_CST)
3615 if (val == truthvalue_false_node)
3616 warning (OPT_Wtype_limits, "comparison is always false due to limited range of data type");
3617 if (val == truthvalue_true_node)
3618 warning (OPT_Wtype_limits, "comparison is always true due to limited range of data type");
3623 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3624 if (TREE_SIDE_EFFECTS (primop0))
3625 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
3629 /* Value is not predetermined, but do the comparison
3630 in the type of the operand that is not constant.
3631 TYPE is already properly set. */
3634 /* If either arg is decimal float and the other is float, find the
3635 proper common type to use for comparison. */
3636 else if (real1 && real2
3637 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
3638 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))))
3639 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
3641 else if (real1 && real2
3642 && (TYPE_PRECISION (TREE_TYPE (primop0))
3643 == TYPE_PRECISION (TREE_TYPE (primop1))))
3644 type = TREE_TYPE (primop0);
3646 /* If args' natural types are both narrower than nominal type
3647 and both extend in the same manner, compare them
3648 in the type of the wider arg.
3649 Otherwise must actually extend both to the nominal
3650 common type lest different ways of extending
3652 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
3654 else if (unsignedp0 == unsignedp1 && real1 == real2
3655 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
3656 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
3658 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
3659 type = c_common_signed_or_unsigned_type (unsignedp0
3660 || TYPE_UNSIGNED (*restype_ptr),
3662 /* Make sure shorter operand is extended the right way
3663 to match the longer operand. */
3665 = convert (c_common_signed_or_unsigned_type (unsignedp0,
3666 TREE_TYPE (primop0)),
3669 = convert (c_common_signed_or_unsigned_type (unsignedp1,
3670 TREE_TYPE (primop1)),
3675 /* Here we must do the comparison on the nominal type
3676 using the args exactly as we received them. */
3677 type = *restype_ptr;
3681 if (!real1 && !real2 && integer_zerop (primop1)
3682 && TYPE_UNSIGNED (*restype_ptr))
3688 /* All unsigned values are >= 0, so we warn. However,
3689 if OP0 is a constant that is >= 0, the signedness of
3690 the comparison isn't an issue, so suppress the
3692 if (warn_type_limits && !in_system_header
3693 && !(TREE_CODE (primop0) == INTEGER_CST
3694 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
3696 warning (OPT_Wtype_limits,
3697 "comparison of unsigned expression >= 0 is always true");
3698 value = truthvalue_true_node;
3702 if (warn_type_limits && !in_system_header
3703 && !(TREE_CODE (primop0) == INTEGER_CST
3704 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
3706 warning (OPT_Wtype_limits,
3707 "comparison of unsigned expression < 0 is always false");
3708 value = truthvalue_false_node;
3717 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3718 if (TREE_SIDE_EFFECTS (primop0))
3719 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
3726 *op0_ptr = convert (type, primop0);
3727 *op1_ptr = convert (type, primop1);
3729 *restype_ptr = truthvalue_type_node;
3734 /* Return a tree for the sum or difference (RESULTCODE says which)
3735 of pointer PTROP and integer INTOP. */
3738 pointer_int_sum (location_t loc, enum tree_code resultcode,
3739 tree ptrop, tree intop)
3743 /* The result is a pointer of the same type that is being added. */
3744 tree result_type = TREE_TYPE (ptrop);
3746 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
3748 pedwarn (loc, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3749 "pointer of type %<void *%> used in arithmetic");
3750 size_exp = integer_one_node;
3752 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
3754 pedwarn (loc, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3755 "pointer to a function used in arithmetic");
3756 size_exp = integer_one_node;
3758 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
3760 pedwarn (loc, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3761 "pointer to member function used in arithmetic");
3762 size_exp = integer_one_node;
3765 size_exp = size_in_bytes (TREE_TYPE (result_type));
3767 /* We are manipulating pointer values, so we don't need to warn
3768 about relying on undefined signed overflow. We disable the
3769 warning here because we use integer types so fold won't know that
3770 they are really pointers. */
3771 fold_defer_overflow_warnings ();
3773 /* If what we are about to multiply by the size of the elements
3774 contains a constant term, apply distributive law
3775 and multiply that constant term separately.
3776 This helps produce common subexpressions. */
3777 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
3778 && !TREE_CONSTANT (intop)
3779 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
3780 && TREE_CONSTANT (size_exp)
3781 /* If the constant comes from pointer subtraction,
3782 skip this optimization--it would cause an error. */
3783 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
3784 /* If the constant is unsigned, and smaller than the pointer size,
3785 then we must skip this optimization. This is because it could cause
3786 an overflow error if the constant is negative but INTOP is not. */
3787 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
3788 || (TYPE_PRECISION (TREE_TYPE (intop))
3789 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
3791 enum tree_code subcode = resultcode;
3792 tree int_type = TREE_TYPE (intop);
3793 if (TREE_CODE (intop) == MINUS_EXPR)
3794 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
3795 /* Convert both subexpression types to the type of intop,
3796 because weird cases involving pointer arithmetic
3797 can result in a sum or difference with different type args. */
3798 ptrop = build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop, 1)),
3800 convert (int_type, TREE_OPERAND (intop, 1)), 1);
3801 intop = convert (int_type, TREE_OPERAND (intop, 0));
3804 /* Convert the integer argument to a type the same size as sizetype
3805 so the multiply won't overflow spuriously. */
3806 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
3807 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
3808 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
3809 TYPE_UNSIGNED (sizetype)), intop);
3811 /* Replace the integer argument with a suitable product by the object size.
3812 Do this multiplication as signed, then convert to the appropriate type
3813 for the pointer operation and disregard an overflow that occured only
3814 because of the sign-extension change in the latter conversion. */
3816 tree t = build_binary_op (loc,
3818 convert (TREE_TYPE (intop), size_exp), 1);
3819 intop = convert (sizetype, t);
3820 if (TREE_OVERFLOW_P (intop) && !TREE_OVERFLOW (t))
3821 intop = build_int_cst_wide (TREE_TYPE (intop), TREE_INT_CST_LOW (intop),
3822 TREE_INT_CST_HIGH (intop));
3825 /* Create the sum or difference. */
3826 if (resultcode == MINUS_EXPR)
3827 intop = fold_build1_loc (loc, NEGATE_EXPR, sizetype, intop);
3829 ret = fold_build2_loc (loc, POINTER_PLUS_EXPR, result_type, ptrop, intop);
3831 fold_undefer_and_ignore_overflow_warnings ();
3836 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
3837 and if NON_CONST is known not to be permitted in an evaluated part
3838 of a constant expression. */
3841 c_wrap_maybe_const (tree expr, bool non_const)
3843 bool nowarning = TREE_NO_WARNING (expr);
3844 location_t loc = EXPR_LOCATION (expr);
3846 /* This should never be called for C++. */
3847 if (c_dialect_cxx ())
3850 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
3851 STRIP_TYPE_NOPS (expr);
3852 expr = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (expr), NULL, expr);
3853 C_MAYBE_CONST_EXPR_NON_CONST (expr) = non_const;
3855 TREE_NO_WARNING (expr) = 1;
3856 protected_set_expr_location (expr, loc);
3861 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
3862 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
3863 around the SAVE_EXPR if needed so that c_fully_fold does not need
3864 to look inside SAVE_EXPRs. */
3867 c_save_expr (tree expr)
3869 bool maybe_const = true;
3870 if (c_dialect_cxx ())
3871 return save_expr (expr);
3872 expr = c_fully_fold (expr, false, &maybe_const);
3873 expr = save_expr (expr);
3875 expr = c_wrap_maybe_const (expr, true);
3879 /* Return whether EXPR is a declaration whose address can never be
3883 decl_with_nonnull_addr_p (const_tree expr)
3885 return (DECL_P (expr)
3886 && (TREE_CODE (expr) == PARM_DECL
3887 || TREE_CODE (expr) == LABEL_DECL
3888 || !DECL_WEAK (expr)));
3891 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3892 or for an `if' or `while' statement or ?..: exp. It should already
3893 have been validated to be of suitable type; otherwise, a bad
3894 diagnostic may result.
3896 The EXPR is located at LOCATION.
3898 This preparation consists of taking the ordinary
3899 representation of an expression expr and producing a valid tree
3900 boolean expression describing whether expr is nonzero. We could
3901 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3902 but we optimize comparisons, &&, ||, and !.
3904 The resulting type should always be `truthvalue_type_node'. */
3907 c_common_truthvalue_conversion (location_t location, tree expr)
3909 switch (TREE_CODE (expr))
3911 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
3912 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
3913 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
3914 case ORDERED_EXPR: case UNORDERED_EXPR:
3915 if (TREE_TYPE (expr) == truthvalue_type_node)
3917 expr = build2 (TREE_CODE (expr), truthvalue_type_node,
3918 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
3921 case TRUTH_ANDIF_EXPR:
3922 case TRUTH_ORIF_EXPR:
3923 case TRUTH_AND_EXPR:
3925 case TRUTH_XOR_EXPR:
3926 if (TREE_TYPE (expr) == truthvalue_type_node)
3928 expr = build2 (TREE_CODE (expr), truthvalue_type_node,
3929 c_common_truthvalue_conversion (location,
3930 TREE_OPERAND (expr, 0)),
3931 c_common_truthvalue_conversion (location,
3932 TREE_OPERAND (expr, 1)));
3935 case TRUTH_NOT_EXPR:
3936 if (TREE_TYPE (expr) == truthvalue_type_node)
3938 expr = build1 (TREE_CODE (expr), truthvalue_type_node,
3939 c_common_truthvalue_conversion (location,
3940 TREE_OPERAND (expr, 0)));
3947 return integer_zerop (expr) ? truthvalue_false_node
3948 : truthvalue_true_node;
3951 return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
3952 ? truthvalue_true_node
3953 : truthvalue_false_node;
3956 return fixed_compare (NE_EXPR, &TREE_FIXED_CST (expr),
3957 &FCONST0 (TYPE_MODE (TREE_TYPE (expr))))
3958 ? truthvalue_true_node
3959 : truthvalue_false_node;
3962 expr = build_unary_op (location, ADDR_EXPR, expr, 0);
3967 tree inner = TREE_OPERAND (expr, 0);
3968 if (decl_with_nonnull_addr_p (inner))
3970 /* Common Ada/Pascal programmer's mistake. */
3971 warning_at (location,
3973 "the address of %qD will always evaluate as %<true%>",
3975 return truthvalue_true_node;
3978 /* If we still have a decl, it is possible for its address to
3979 be NULL, so we cannot optimize. */
3982 gcc_assert (DECL_WEAK (inner));
3986 if (TREE_SIDE_EFFECTS (inner))
3988 expr = build2 (COMPOUND_EXPR, truthvalue_type_node,
3989 inner, truthvalue_true_node);
3993 return truthvalue_true_node;
3997 expr = build_binary_op (EXPR_LOCATION (expr),
3998 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
3999 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
4000 c_common_truthvalue_conversion (location,
4001 TREE_OPERAND (expr, 0)),
4002 c_common_truthvalue_conversion (location,
4003 TREE_OPERAND (expr, 1)),
4010 case EXCESS_PRECISION_EXPR:
4011 /* These don't change whether an object is nonzero or zero. */
4012 return c_common_truthvalue_conversion (location, TREE_OPERAND (expr, 0));
4016 /* These don't change whether an object is zero or nonzero, but
4017 we can't ignore them if their second arg has side-effects. */
4018 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
4020 expr = build2 (COMPOUND_EXPR, truthvalue_type_node,
4021 TREE_OPERAND (expr, 1),
4022 c_common_truthvalue_conversion
4023 (location, TREE_OPERAND (expr, 0)));
4027 return c_common_truthvalue_conversion (location,
4028 TREE_OPERAND (expr, 0));
4031 /* Distribute the conversion into the arms of a COND_EXPR. */
4032 if (c_dialect_cxx ())
4034 expr = fold_build3_loc (location, COND_EXPR, truthvalue_type_node,
4035 TREE_OPERAND (expr, 0),
4036 c_common_truthvalue_conversion (location,
4039 c_common_truthvalue_conversion (location,
4046 /* Folding will happen later for C. */
4047 expr = build3 (COND_EXPR, truthvalue_type_node,
4048 TREE_OPERAND (expr, 0),
4049 c_common_truthvalue_conversion (location,
4050 TREE_OPERAND (expr, 1)),
4051 c_common_truthvalue_conversion (location,
4052 TREE_OPERAND (expr, 2)));
4057 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4058 since that affects how `default_conversion' will behave. */
4059 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
4060 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
4062 /* If this is widening the argument, we can ignore it. */
4063 if (TYPE_PRECISION (TREE_TYPE (expr))
4064 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
4065 return c_common_truthvalue_conversion (location,
4066 TREE_OPERAND (expr, 0));
4070 if (!TREE_NO_WARNING (expr)
4071 && warn_parentheses)
4073 warning (OPT_Wparentheses,
4074 "suggest parentheses around assignment used as truth value");
4075 TREE_NO_WARNING (expr) = 1;
4083 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
4085 tree t = c_save_expr (expr);
4086 expr = (build_binary_op
4087 (EXPR_LOCATION (expr),
4088 (TREE_SIDE_EFFECTS (expr)
4089 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
4090 c_common_truthvalue_conversion
4092 build_unary_op (location, REALPART_EXPR, t, 0)),
4093 c_common_truthvalue_conversion
4095 build_unary_op (location, IMAGPART_EXPR, t, 0)),
4100 if (TREE_CODE (TREE_TYPE (expr)) == FIXED_POINT_TYPE)
4102 tree fixed_zero_node = build_fixed (TREE_TYPE (expr),
4104 (TREE_TYPE (expr))));
4105 return build_binary_op (location, NE_EXPR, expr, fixed_zero_node, 1);
4108 return build_binary_op (location, NE_EXPR, expr, integer_zero_node, 1);
4111 protected_set_expr_location (expr, location);
4115 static void def_builtin_1 (enum built_in_function fncode,
4117 enum built_in_class fnclass,
4118 tree fntype, tree libtype,
4119 bool both_p, bool fallback_p, bool nonansi_p,
4120 tree fnattrs, bool implicit_p);
4123 /* Apply the TYPE_QUALS to the new DECL. */
4126 c_apply_type_quals_to_decl (int type_quals, tree decl)
4128 tree type = TREE_TYPE (decl);
4130 if (type == error_mark_node)
4133 if (((type_quals & TYPE_QUAL_CONST)
4134 || (type && TREE_CODE (type) == REFERENCE_TYPE))
4135 /* An object declared 'const' is only readonly after it is
4136 initialized. We don't have any way of expressing this currently,
4137 so we need to be conservative and unset TREE_READONLY for types
4138 with constructors. Otherwise aliasing code will ignore stores in
4139 an inline constructor. */
4140 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
4141 TREE_READONLY (decl) = 1;
4142 if (type_quals & TYPE_QUAL_VOLATILE)
4144 TREE_SIDE_EFFECTS (decl) = 1;
4145 TREE_THIS_VOLATILE (decl) = 1;
4147 if (type_quals & TYPE_QUAL_RESTRICT)
4149 while (type && TREE_CODE (type) == ARRAY_TYPE)
4150 /* Allow 'restrict' on arrays of pointers.
4151 FIXME currently we just ignore it. */
4152 type = TREE_TYPE (type);
4154 || !POINTER_TYPE_P (type)
4155 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
4156 error ("invalid use of %<restrict%>");
4160 /* Hash function for the problem of multiple type definitions in
4161 different files. This must hash all types that will compare
4162 equal via comptypes to the same value. In practice it hashes
4163 on some of the simple stuff and leaves the details to comptypes. */
4166 c_type_hash (const void *p)
4170 const_tree const t = (const_tree) p;
4172 switch (TREE_CODE (t))
4174 /* For pointers, hash on pointee type plus some swizzling. */
4176 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
4177 /* Hash on number of elements and total size. */
4180 t2 = TYPE_VALUES (t);
4184 t2 = TYPE_FIELDS (t);
4186 case QUAL_UNION_TYPE:
4188 t2 = TYPE_FIELDS (t);
4192 t2 = TYPE_FIELDS (t);
4197 for (; t2; t2 = TREE_CHAIN (t2))
4199 /* We might have a VLA here. */
4200 if (TREE_CODE (TYPE_SIZE (t)) != INTEGER_CST)
4203 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
4204 return ((size << 24) | (i << shift));
4207 static GTY((param_is (union tree_node))) htab_t type_hash_table;
4209 /* Return the typed-based alias set for T, which may be an expression
4210 or a type. Return -1 if we don't do anything special. */
4213 c_common_get_alias_set (tree t)
4218 /* For VLAs, use the alias set of the element type rather than the
4219 default of alias set 0 for types compared structurally. */
4220 if (TYPE_P (t) && TYPE_STRUCTURAL_EQUALITY_P (t))
4222 if (TREE_CODE (t) == ARRAY_TYPE)
4223 return get_alias_set (TREE_TYPE (t));
4227 /* Permit type-punning when accessing a union, provided the access
4228 is directly through the union. For example, this code does not
4229 permit taking the address of a union member and then storing
4230 through it. Even the type-punning allowed here is a GCC
4231 extension, albeit a common and useful one; the C standard says
4232 that such accesses have implementation-defined behavior. */
4234 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
4235 u = TREE_OPERAND (u, 0))
4236 if (TREE_CODE (u) == COMPONENT_REF
4237 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
4240 /* That's all the expressions we handle specially. */
4244 /* The C standard guarantees that any object may be accessed via an
4245 lvalue that has character type. */
4246 if (t == char_type_node
4247 || t == signed_char_type_node
4248 || t == unsigned_char_type_node)
4251 /* The C standard specifically allows aliasing between signed and
4252 unsigned variants of the same type. We treat the signed
4253 variant as canonical. */
4254 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
4256 tree t1 = c_common_signed_type (t);
4258 /* t1 == t can happen for boolean nodes which are always unsigned. */
4260 return get_alias_set (t1);
4262 else if (POINTER_TYPE_P (t))
4266 /* Unfortunately, there is no canonical form of a pointer type.
4267 In particular, if we have `typedef int I', then `int *', and
4268 `I *' are different types. So, we have to pick a canonical
4269 representative. We do this below.
4271 Technically, this approach is actually more conservative that
4272 it needs to be. In particular, `const int *' and `int *'
4273 should be in different alias sets, according to the C and C++
4274 standard, since their types are not the same, and so,
4275 technically, an `int **' and `const int **' cannot point at
4278 But, the standard is wrong. In particular, this code is
4283 const int* const* cipp = ipp;
4285 And, it doesn't make sense for that to be legal unless you
4286 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
4287 the pointed-to types. This issue has been reported to the
4289 t1 = build_type_no_quals (t);
4291 return get_alias_set (t1);
4294 /* Handle the case of multiple type nodes referring to "the same" type,
4295 which occurs with IMA. These share an alias set. FIXME: Currently only
4296 C90 is handled. (In C99 type compatibility is not transitive, which
4297 complicates things mightily. The alias set splay trees can theoretically
4298 represent this, but insertion is tricky when you consider all the
4299 different orders things might arrive in.) */
4301 if (c_language != clk_c || flag_isoc99)
4304 /* Save time if there's only one input file. */
4305 if (num_in_fnames == 1)
4308 /* Pointers need special handling if they point to any type that
4309 needs special handling (below). */
4310 if (TREE_CODE (t) == POINTER_TYPE)
4313 /* Find bottom type under any nested POINTERs. */
4314 for (t2 = TREE_TYPE (t);
4315 TREE_CODE (t2) == POINTER_TYPE;
4316 t2 = TREE_TYPE (t2))
4318 if (TREE_CODE (t2) != RECORD_TYPE
4319 && TREE_CODE (t2) != ENUMERAL_TYPE
4320 && TREE_CODE (t2) != QUAL_UNION_TYPE
4321 && TREE_CODE (t2) != UNION_TYPE)
4323 if (TYPE_SIZE (t2) == 0)
4326 /* These are the only cases that need special handling. */
4327 if (TREE_CODE (t) != RECORD_TYPE
4328 && TREE_CODE (t) != ENUMERAL_TYPE
4329 && TREE_CODE (t) != QUAL_UNION_TYPE
4330 && TREE_CODE (t) != UNION_TYPE
4331 && TREE_CODE (t) != POINTER_TYPE)
4334 if (TYPE_SIZE (t) == 0)
4337 /* Look up t in hash table. Only one of the compatible types within each
4338 alias set is recorded in the table. */
4339 if (!type_hash_table)
4340 type_hash_table = htab_create_ggc (1021, c_type_hash,
4341 (htab_eq) lang_hooks.types_compatible_p,
4343 slot = htab_find_slot (type_hash_table, t, INSERT);
4346 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
4347 return TYPE_ALIAS_SET ((tree)*slot);
4350 /* Our caller will assign and record (in t) a new alias set; all we need
4351 to do is remember t in the hash table. */
4357 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4358 the second parameter indicates which OPERATOR is being applied.
4359 The COMPLAIN flag controls whether we should diagnose possibly
4360 ill-formed constructs or not. LOC is the location of the SIZEOF or
4364 c_sizeof_or_alignof_type (location_t loc,
4365 tree type, bool is_sizeof, int complain)
4367 const char *op_name;
4369 enum tree_code type_code = TREE_CODE (type);
4371 op_name = is_sizeof ? "sizeof" : "__alignof__";
4373 if (type_code == FUNCTION_TYPE)
4377 if (complain && (pedantic || warn_pointer_arith))
4378 pedwarn (loc, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
4379 "invalid application of %<sizeof%> to a function type");
4381 return error_mark_node;
4382 value = size_one_node;
4385 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
4387 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
4389 if (type_code == VOID_TYPE
4390 && complain && (pedantic || warn_pointer_arith))
4391 pedwarn (loc, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
4392 "invalid application of %qs to a void type", op_name);
4394 return error_mark_node;
4395 value = size_one_node;
4397 else if (!COMPLETE_TYPE_P (type))
4400 error_at (loc, "invalid application of %qs to incomplete type %qT ",
4402 return error_mark_node;
4407 /* Convert in case a char is more than one unit. */
4408 value = size_binop_loc (loc, CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
4409 size_int (TYPE_PRECISION (char_type_node)
4412 value = size_int (TYPE_ALIGN_UNIT (type));
4415 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
4416 TYPE_IS_SIZETYPE means that certain things (like overflow) will
4417 never happen. However, this node should really have type
4418 `size_t', which is just a typedef for an ordinary integer type. */
4419 value = fold_convert_loc (loc, size_type_node, value);
4420 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)));
4425 /* Implement the __alignof keyword: Return the minimum required
4426 alignment of EXPR, measured in bytes. For VAR_DECLs,
4427 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4428 from an "aligned" __attribute__ specification). LOC is the
4429 location of the ALIGNOF operator. */
4432 c_alignof_expr (location_t loc, tree expr)
4436 if (VAR_OR_FUNCTION_DECL_P (expr))
4437 t = size_int (DECL_ALIGN_UNIT (expr));
4439 else if (TREE_CODE (expr) == COMPONENT_REF
4440 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
4442 error_at (loc, "%<__alignof%> applied to a bit-field");
4445 else if (TREE_CODE (expr) == COMPONENT_REF
4446 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
4447 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
4449 else if (TREE_CODE (expr) == INDIRECT_REF)
4451 tree t = TREE_OPERAND (expr, 0);
4453 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
4455 while (CONVERT_EXPR_P (t)
4456 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
4460 t = TREE_OPERAND (t, 0);
4461 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
4462 if (thisalign > bestalign)
4463 best = t, bestalign = thisalign;
4465 return c_alignof (loc, TREE_TYPE (TREE_TYPE (best)));
4468 return c_alignof (loc, TREE_TYPE (expr));
4470 return fold_convert_loc (loc, size_type_node, t);
4473 /* Handle C and C++ default attributes. */
4475 enum built_in_attribute
4477 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4478 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4479 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4480 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4481 #include "builtin-attrs.def"
4482 #undef DEF_ATTR_NULL_TREE
4484 #undef DEF_ATTR_IDENT
4485 #undef DEF_ATTR_TREE_LIST
4489 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
4491 static void c_init_attributes (void);
4495 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4496 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4497 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4498 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4499 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4500 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4501 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4502 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4503 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
4504 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4505 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4506 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
4507 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4508 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4509 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4511 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4512 #include "builtin-types.def"
4513 #undef DEF_PRIMITIVE_TYPE
4514 #undef DEF_FUNCTION_TYPE_0
4515 #undef DEF_FUNCTION_TYPE_1
4516 #undef DEF_FUNCTION_TYPE_2
4517 #undef DEF_FUNCTION_TYPE_3
4518 #undef DEF_FUNCTION_TYPE_4
4519 #undef DEF_FUNCTION_TYPE_5
4520 #undef DEF_FUNCTION_TYPE_6
4521 #undef DEF_FUNCTION_TYPE_7
4522 #undef DEF_FUNCTION_TYPE_VAR_0
4523 #undef DEF_FUNCTION_TYPE_VAR_1
4524 #undef DEF_FUNCTION_TYPE_VAR_2
4525 #undef DEF_FUNCTION_TYPE_VAR_3
4526 #undef DEF_FUNCTION_TYPE_VAR_4
4527 #undef DEF_FUNCTION_TYPE_VAR_5
4528 #undef DEF_POINTER_TYPE
4532 typedef enum c_builtin_type builtin_type;
4534 /* A temporary array for c_common_nodes_and_builtins. Used in
4535 communication with def_fn_type. */
4536 static tree builtin_types[(int) BT_LAST + 1];
4538 /* A helper function for c_common_nodes_and_builtins. Build function type
4539 for DEF with return type RET and N arguments. If VAR is true, then the
4540 function should be variadic after those N arguments.
4542 Takes special care not to ICE if any of the types involved are
4543 error_mark_node, which indicates that said type is not in fact available
4544 (see builtin_type_for_size). In which case the function type as a whole
4545 should be error_mark_node. */
4548 def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...)
4550 tree args = NULL, t;
4555 for (i = 0; i < n; ++i)
4557 builtin_type a = (builtin_type) va_arg (list, int);
4558 t = builtin_types[a];
4559 if (t == error_mark_node)
4561 args = tree_cons (NULL_TREE, t, args);
4565 args = nreverse (args);
4567 args = chainon (args, void_list_node);
4569 t = builtin_types[ret];
4570 if (t == error_mark_node)
4572 t = build_function_type (t, args);
4575 builtin_types[def] = t;
4578 /* Build builtin functions common to both C and C++ language
4582 c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node)
4584 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4585 builtin_types[ENUM] = VALUE;
4586 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4587 def_fn_type (ENUM, RETURN, 0, 0);
4588 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4589 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4590 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4591 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4592 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4593 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4594 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4595 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4596 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4597 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4598 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4600 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4601 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4603 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4604 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4605 def_fn_type (ENUM, RETURN, 1, 0);
4606 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4607 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4608 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4609 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4610 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4611 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4612 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4613 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4614 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4615 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4616 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4617 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4619 #include "builtin-types.def"
4621 #undef DEF_PRIMITIVE_TYPE
4622 #undef DEF_FUNCTION_TYPE_1
4623 #undef DEF_FUNCTION_TYPE_2
4624 #undef DEF_FUNCTION_TYPE_3
4625 #undef DEF_FUNCTION_TYPE_4
4626 #undef DEF_FUNCTION_TYPE_5
4627 #undef DEF_FUNCTION_TYPE_6
4628 #undef DEF_FUNCTION_TYPE_VAR_0
4629 #undef DEF_FUNCTION_TYPE_VAR_1
4630 #undef DEF_FUNCTION_TYPE_VAR_2
4631 #undef DEF_FUNCTION_TYPE_VAR_3
4632 #undef DEF_FUNCTION_TYPE_VAR_4
4633 #undef DEF_FUNCTION_TYPE_VAR_5
4634 #undef DEF_POINTER_TYPE
4635 builtin_types[(int) BT_LAST] = NULL_TREE;
4637 c_init_attributes ();
4639 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4640 NONANSI_P, ATTRS, IMPLICIT, COND) \
4642 def_builtin_1 (ENUM, NAME, CLASS, \
4643 builtin_types[(int) TYPE], \
4644 builtin_types[(int) LIBTYPE], \
4645 BOTH_P, FALLBACK_P, NONANSI_P, \
4646 built_in_attributes[(int) ATTRS], IMPLICIT);
4647 #include "builtins.def"
4650 targetm.init_builtins ();
4652 build_common_builtin_nodes ();
4658 /* Like get_identifier, but avoid warnings about null arguments when
4659 the argument may be NULL for targets where GCC lacks stdint.h type
4663 c_get_ident (const char *id)
4665 return get_identifier (id);
4668 /* Build tree nodes and builtin functions common to both C and C++ language
4672 c_common_nodes_and_builtins (void)
4674 int char16_type_size;
4675 int char32_type_size;
4676 int wchar_type_size;
4677 tree array_domain_type;
4678 tree va_list_ref_type_node;
4679 tree va_list_arg_type_node;
4681 /* Define `int' and `char' first so that dbx will output them first. */
4682 record_builtin_type (RID_INT, NULL, integer_type_node);
4683 record_builtin_type (RID_CHAR, "char", char_type_node);
4685 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4686 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4687 but not C. Are the conditionals here needed? */
4688 if (c_dialect_cxx ())
4689 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
4690 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
4691 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
4692 record_builtin_type (RID_MAX, "long unsigned int",
4693 long_unsigned_type_node);
4694 if (c_dialect_cxx ())
4695 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
4696 record_builtin_type (RID_MAX, "long long int",
4697 long_long_integer_type_node);
4698 record_builtin_type (RID_MAX, "long long unsigned int",
4699 long_long_unsigned_type_node);
4700 if (c_dialect_cxx ())
4701 record_builtin_type (RID_MAX, "long long unsigned",
4702 long_long_unsigned_type_node);
4703 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
4704 record_builtin_type (RID_MAX, "short unsigned int",
4705 short_unsigned_type_node);
4706 if (c_dialect_cxx ())
4707 record_builtin_type (RID_MAX, "unsigned short",
4708 short_unsigned_type_node);
4710 /* Define both `signed char' and `unsigned char'. */
4711 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
4712 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
4714 /* These are types that c_common_type_for_size and
4715 c_common_type_for_mode use. */
4716 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4717 TYPE_DECL, NULL_TREE,
4719 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4720 TYPE_DECL, NULL_TREE,
4722 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4723 TYPE_DECL, NULL_TREE,
4725 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4726 TYPE_DECL, NULL_TREE,
4728 #if HOST_BITS_PER_WIDE_INT >= 64
4729 if (targetm.scalar_mode_supported_p (TImode))
4730 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4732 get_identifier ("__int128_t"),
4735 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4736 TYPE_DECL, NULL_TREE,
4737 unsigned_intQI_type_node));
4738 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4739 TYPE_DECL, NULL_TREE,
4740 unsigned_intHI_type_node));
4741 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4742 TYPE_DECL, NULL_TREE,
4743 unsigned_intSI_type_node));
4744 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4745 TYPE_DECL, NULL_TREE,
4746 unsigned_intDI_type_node));
4747 #if HOST_BITS_PER_WIDE_INT >= 64
4748 if (targetm.scalar_mode_supported_p (TImode))
4749 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4751 get_identifier ("__uint128_t"),
4752 unsigned_intTI_type_node));
4755 /* Create the widest literal types. */
4756 widest_integer_literal_type_node
4757 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
4758 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4759 TYPE_DECL, NULL_TREE,
4760 widest_integer_literal_type_node));
4762 widest_unsigned_literal_type_node
4763 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
4764 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4765 TYPE_DECL, NULL_TREE,
4766 widest_unsigned_literal_type_node));
4768 /* `unsigned long' is the standard type for sizeof.
4769 Note that stddef.h uses `unsigned long',
4770 and this must agree, even if long and int are the same size. */
4772 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
4773 signed_size_type_node = c_common_signed_type (size_type_node);
4774 set_sizetype (size_type_node);
4777 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
4779 build_common_tree_nodes_2 (flag_short_double);
4781 record_builtin_type (RID_FLOAT, NULL, float_type_node);
4782 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
4783 record_builtin_type (RID_MAX, "long double", long_double_type_node);
4785 /* Only supported decimal floating point extension if the target
4786 actually supports underlying modes. */
4787 if (targetm.scalar_mode_supported_p (SDmode)
4788 && targetm.scalar_mode_supported_p (DDmode)
4789 && targetm.scalar_mode_supported_p (TDmode))
4791 record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node);
4792 record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node);
4793 record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node);
4796 if (targetm.fixed_point_supported_p ())
4798 record_builtin_type (RID_MAX, "short _Fract", short_fract_type_node);
4799 record_builtin_type (RID_FRACT, NULL, fract_type_node);
4800 record_builtin_type (RID_MAX, "long _Fract", long_fract_type_node);
4801 record_builtin_type (RID_MAX, "long long _Fract",
4802 long_long_fract_type_node);
4803 record_builtin_type (RID_MAX, "unsigned short _Fract",
4804 unsigned_short_fract_type_node);
4805 record_builtin_type (RID_MAX, "unsigned _Fract",
4806 unsigned_fract_type_node);
4807 record_builtin_type (RID_MAX, "unsigned long _Fract",
4808 unsigned_long_fract_type_node);
4809 record_builtin_type (RID_MAX, "unsigned long long _Fract",
4810 unsigned_long_long_fract_type_node);
4811 record_builtin_type (RID_MAX, "_Sat short _Fract",
4812 sat_short_fract_type_node);
4813 record_builtin_type (RID_MAX, "_Sat _Fract", sat_fract_type_node);
4814 record_builtin_type (RID_MAX, "_Sat long _Fract",
4815 sat_long_fract_type_node);
4816 record_builtin_type (RID_MAX, "_Sat long long _Fract",
4817 sat_long_long_fract_type_node);
4818 record_builtin_type (RID_MAX, "_Sat unsigned short _Fract",
4819 sat_unsigned_short_fract_type_node);
4820 record_builtin_type (RID_MAX, "_Sat unsigned _Fract",
4821 sat_unsigned_fract_type_node);
4822 record_builtin_type (RID_MAX, "_Sat unsigned long _Fract",
4823 sat_unsigned_long_fract_type_node);
4824 record_builtin_type (RID_MAX, "_Sat unsigned long long _Fract",
4825 sat_unsigned_long_long_fract_type_node);
4826 record_builtin_type (RID_MAX, "short _Accum", short_accum_type_node);
4827 record_builtin_type (RID_ACCUM, NULL, accum_type_node);
4828 record_builtin_type (RID_MAX, "long _Accum", long_accum_type_node);
4829 record_builtin_type (RID_MAX, "long long _Accum",
4830 long_long_accum_type_node);
4831 record_builtin_type (RID_MAX, "unsigned short _Accum",
4832 unsigned_short_accum_type_node);
4833 record_builtin_type (RID_MAX, "unsigned _Accum",
4834 unsigned_accum_type_node);
4835 record_builtin_type (RID_MAX, "unsigned long _Accum",
4836 unsigned_long_accum_type_node);
4837 record_builtin_type (RID_MAX, "unsigned long long _Accum",
4838 unsigned_long_long_accum_type_node);
4839 record_builtin_type (RID_MAX, "_Sat short _Accum",
4840 sat_short_accum_type_node);
4841 record_builtin_type (RID_MAX, "_Sat _Accum", sat_accum_type_node);
4842 record_builtin_type (RID_MAX, "_Sat long _Accum",
4843 sat_long_accum_type_node);
4844 record_builtin_type (RID_MAX, "_Sat long long _Accum",
4845 sat_long_long_accum_type_node);
4846 record_builtin_type (RID_MAX, "_Sat unsigned short _Accum",
4847 sat_unsigned_short_accum_type_node);
4848 record_builtin_type (RID_MAX, "_Sat unsigned _Accum",
4849 sat_unsigned_accum_type_node);
4850 record_builtin_type (RID_MAX, "_Sat unsigned long _Accum",
4851 sat_unsigned_long_accum_type_node);
4852 record_builtin_type (RID_MAX, "_Sat unsigned long long _Accum",
4853 sat_unsigned_long_long_accum_type_node);
4857 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4859 get_identifier ("complex int"),
4860 complex_integer_type_node));
4861 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4863 get_identifier ("complex float"),
4864 complex_float_type_node));
4865 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
4867 get_identifier ("complex double"),
4868 complex_double_type_node));
4869 lang_hooks.decls.pushdecl
4870 (build_decl (UNKNOWN_LOCATION,
4871 TYPE_DECL, get_identifier ("complex long double"),
4872 complex_long_double_type_node));
4874 if (c_dialect_cxx ())
4875 /* For C++, make fileptr_type_node a distinct void * type until
4876 FILE type is defined. */
4877 fileptr_type_node = build_variant_type_copy (ptr_type_node);
4879 record_builtin_type (RID_VOID, NULL, void_type_node);
4881 /* Set the TYPE_NAME for any variants that were built before
4882 record_builtin_type gave names to the built-in types. */
4884 tree void_name = TYPE_NAME (void_type_node);
4885 TYPE_NAME (void_type_node) = NULL_TREE;
4886 TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST))
4888 TYPE_NAME (void_type_node) = void_name;
4891 /* This node must not be shared. */
4892 void_zero_node = make_node (INTEGER_CST);
4893 TREE_TYPE (void_zero_node) = void_type_node;
4895 void_list_node = build_void_list_node ();
4897 /* Make a type to be the domain of a few array types
4898 whose domains don't really matter.
4899 200 is small enough that it always fits in size_t
4900 and large enough that it can hold most function names for the
4901 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4902 array_domain_type = build_index_type (size_int (200));
4904 /* Make a type for arrays of characters.
4905 With luck nothing will ever really depend on the length of this
4907 char_array_type_node
4908 = build_array_type (char_type_node, array_domain_type);
4910 /* Likewise for arrays of ints. */
4912 = build_array_type (integer_type_node, array_domain_type);
4914 string_type_node = build_pointer_type (char_type_node);
4915 const_string_type_node
4916 = build_pointer_type (build_qualified_type
4917 (char_type_node, TYPE_QUAL_CONST));
4919 /* This is special for C++ so functions can be overloaded. */
4920 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
4921 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
4922 wchar_type_size = TYPE_PRECISION (wchar_type_node);
4923 underlying_wchar_type_node = wchar_type_node;
4924 if (c_dialect_cxx ())
4926 if (TYPE_UNSIGNED (wchar_type_node))
4927 wchar_type_node = make_unsigned_type (wchar_type_size);
4929 wchar_type_node = make_signed_type (wchar_type_size);
4930 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
4933 /* This is for wide string constants. */
4934 wchar_array_type_node
4935 = build_array_type (wchar_type_node, array_domain_type);
4937 /* Define 'char16_t'. */
4938 char16_type_node = get_identifier (CHAR16_TYPE);
4939 char16_type_node = TREE_TYPE (identifier_global_value (char16_type_node));
4940 char16_type_size = TYPE_PRECISION (char16_type_node);
4941 if (c_dialect_cxx ())
4943 char16_type_node = make_unsigned_type (char16_type_size);
4945 if (cxx_dialect == cxx0x)
4946 record_builtin_type (RID_CHAR16, "char16_t", char16_type_node);
4949 /* This is for UTF-16 string constants. */
4950 char16_array_type_node
4951 = build_array_type (char16_type_node, array_domain_type);
4953 /* Define 'char32_t'. */
4954 char32_type_node = get_identifier (CHAR32_TYPE);
4955 char32_type_node = TREE_TYPE (identifier_global_value (char32_type_node));
4956 char32_type_size = TYPE_PRECISION (char32_type_node);
4957 if (c_dialect_cxx ())
4959 char32_type_node = make_unsigned_type (char32_type_size);
4961 if (cxx_dialect == cxx0x)
4962 record_builtin_type (RID_CHAR32, "char32_t", char32_type_node);
4965 /* This is for UTF-32 string constants. */
4966 char32_array_type_node
4967 = build_array_type (char32_type_node, array_domain_type);
4970 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
4973 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
4975 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
4977 if (SIG_ATOMIC_TYPE)
4978 sig_atomic_type_node =
4979 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE)));
4982 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE)));
4985 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE)));
4988 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE)));
4991 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE)));
4994 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE)));
4997 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE)));
4999 c_uint32_type_node =
5000 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE)));
5002 c_uint64_type_node =
5003 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE)));
5004 if (INT_LEAST8_TYPE)
5005 int_least8_type_node =
5006 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE)));
5007 if (INT_LEAST16_TYPE)
5008 int_least16_type_node =
5009 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE)));
5010 if (INT_LEAST32_TYPE)
5011 int_least32_type_node =
5012 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE)));
5013 if (INT_LEAST64_TYPE)
5014 int_least64_type_node =
5015 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE)));
5016 if (UINT_LEAST8_TYPE)
5017 uint_least8_type_node =
5018 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE)));
5019 if (UINT_LEAST16_TYPE)
5020 uint_least16_type_node =
5021 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE)));
5022 if (UINT_LEAST32_TYPE)
5023 uint_least32_type_node =
5024 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE)));
5025 if (UINT_LEAST64_TYPE)
5026 uint_least64_type_node =
5027 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE)));
5029 int_fast8_type_node =
5030 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE)));
5031 if (INT_FAST16_TYPE)
5032 int_fast16_type_node =
5033 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE)));
5034 if (INT_FAST32_TYPE)
5035 int_fast32_type_node =
5036 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE)));
5037 if (INT_FAST64_TYPE)
5038 int_fast64_type_node =
5039 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE)));
5040 if (UINT_FAST8_TYPE)
5041 uint_fast8_type_node =
5042 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE)));
5043 if (UINT_FAST16_TYPE)
5044 uint_fast16_type_node =
5045 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE)));
5046 if (UINT_FAST32_TYPE)
5047 uint_fast32_type_node =
5048 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE)));
5049 if (UINT_FAST64_TYPE)
5050 uint_fast64_type_node =
5051 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE)));
5054 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE)));
5057 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE)));
5059 default_function_type = build_function_type (integer_type_node, NULL_TREE);
5061 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
5062 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
5064 lang_hooks.decls.pushdecl
5065 (build_decl (UNKNOWN_LOCATION,
5066 TYPE_DECL, get_identifier ("__builtin_va_list"),
5067 va_list_type_node));
5068 #ifdef TARGET_ENUM_VA_LIST
5073 for (l = 0; TARGET_ENUM_VA_LIST (l, &pname, &ptype); ++l)
5075 lang_hooks.decls.pushdecl
5076 (build_decl (UNKNOWN_LOCATION,
5077 TYPE_DECL, get_identifier (pname),
5084 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
5086 va_list_arg_type_node = va_list_ref_type_node =
5087 build_pointer_type (TREE_TYPE (va_list_type_node));
5091 va_list_arg_type_node = va_list_type_node;
5092 va_list_ref_type_node = build_reference_type (va_list_type_node);
5095 if (!flag_preprocess_only)
5096 c_define_builtins (va_list_ref_type_node, va_list_arg_type_node);
5098 main_identifier_node = get_identifier ("main");
5100 /* Create the built-in __null node. It is important that this is
5102 null_node = make_node (INTEGER_CST);
5103 TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0);
5105 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5106 memset (builtin_types, 0, sizeof (builtin_types));
5109 /* The number of named compound-literals generated thus far. */
5110 static GTY(()) int compound_literal_number;
5112 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5115 set_compound_literal_name (tree decl)
5118 ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal",
5119 compound_literal_number);
5120 compound_literal_number++;
5121 DECL_NAME (decl) = get_identifier (name);
5125 build_va_arg (location_t loc, tree expr, tree type)
5127 expr = build1 (VA_ARG_EXPR, type, expr);
5128 SET_EXPR_LOCATION (expr, loc);
5133 /* Linked list of disabled built-in functions. */
5135 typedef struct disabled_builtin
5138 struct disabled_builtin *next;
5140 static disabled_builtin *disabled_builtins = NULL;
5142 static bool builtin_function_disabled_p (const char *);
5144 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5145 begins with "__builtin_", give an error. */
5148 disable_builtin_function (const char *name)
5150 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
5151 error ("cannot disable built-in function %qs", name);
5154 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
5155 new_disabled_builtin->name = name;
5156 new_disabled_builtin->next = disabled_builtins;
5157 disabled_builtins = new_disabled_builtin;
5162 /* Return true if the built-in function NAME has been disabled, false
5166 builtin_function_disabled_p (const char *name)
5168 disabled_builtin *p;
5169 for (p = disabled_builtins; p != NULL; p = p->next)
5171 if (strcmp (name, p->name) == 0)
5178 /* Worker for DEF_BUILTIN.
5179 Possibly define a builtin function with one or two names.
5180 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5181 nonansi_p and flag_no_nonansi_builtin. */
5184 def_builtin_1 (enum built_in_function fncode,
5186 enum built_in_class fnclass,
5187 tree fntype, tree libtype,
5188 bool both_p, bool fallback_p, bool nonansi_p,
5189 tree fnattrs, bool implicit_p)
5192 const char *libname;
5194 if (fntype == error_mark_node)
5197 gcc_assert ((!both_p && !fallback_p)
5198 || !strncmp (name, "__builtin_",
5199 strlen ("__builtin_")));
5201 libname = name + strlen ("__builtin_");
5202 decl = add_builtin_function (name, fntype, fncode, fnclass,
5203 (fallback_p ? libname : NULL),
5206 && !flag_no_builtin && !builtin_function_disabled_p (libname)
5207 && !(nonansi_p && flag_no_nonansi_builtin))
5208 add_builtin_function (libname, libtype, fncode, fnclass,
5211 built_in_decls[(int) fncode] = decl;
5213 implicit_built_in_decls[(int) fncode] = decl;
5216 /* Nonzero if the type T promotes to int. This is (nearly) the
5217 integral promotions defined in ISO C99 6.3.1.1/2. */
5220 c_promoting_integer_type_p (const_tree t)
5222 switch (TREE_CODE (t))
5225 return (TYPE_MAIN_VARIANT (t) == char_type_node
5226 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
5227 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
5228 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
5229 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
5230 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
5233 /* ??? Technically all enumerations not larger than an int
5234 promote to an int. But this is used along code paths
5235 that only want to notice a size change. */
5236 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
5246 /* Return 1 if PARMS specifies a fixed number of parameters
5247 and none of their types is affected by default promotions. */
5250 self_promoting_args_p (const_tree parms)
5253 for (t = parms; t; t = TREE_CHAIN (t))
5255 tree type = TREE_VALUE (t);
5257 if (type == error_mark_node)
5260 if (TREE_CHAIN (t) == 0 && type != void_type_node)
5266 if (TYPE_MAIN_VARIANT (type) == float_type_node)
5269 if (c_promoting_integer_type_p (type))
5275 /* Recursively remove any '*' or '&' operator from TYPE. */
5277 strip_pointer_operator (tree t)
5279 while (POINTER_TYPE_P (t))
5284 /* Recursively remove pointer or array type from TYPE. */
5286 strip_pointer_or_array_types (tree t)
5288 while (TREE_CODE (t) == ARRAY_TYPE || POINTER_TYPE_P (t))
5293 /* Used to compare case labels. K1 and K2 are actually tree nodes
5294 representing case labels, or NULL_TREE for a `default' label.
5295 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5296 K2, and 0 if K1 and K2 are equal. */
5299 case_compare (splay_tree_key k1, splay_tree_key k2)
5301 /* Consider a NULL key (such as arises with a `default' label) to be
5302 smaller than anything else. */
5308 return tree_int_cst_compare ((tree) k1, (tree) k2);
5311 /* Process a case label, located at LOC, for the range LOW_VALUE
5312 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5313 then this case label is actually a `default' label. If only
5314 HIGH_VALUE is NULL_TREE, then case label was declared using the
5315 usual C/C++ syntax, rather than the GNU case range extension.
5316 CASES is a tree containing all the case ranges processed so far;
5317 COND is the condition for the switch-statement itself. Returns the
5318 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5322 c_add_case_label (location_t loc, splay_tree cases, tree cond, tree orig_type,
5323 tree low_value, tree high_value)
5328 splay_tree_node node;
5330 /* Create the LABEL_DECL itself. */
5331 label = create_artificial_label (loc);
5333 /* If there was an error processing the switch condition, bail now
5334 before we get more confused. */
5335 if (!cond || cond == error_mark_node)
5338 if ((low_value && TREE_TYPE (low_value)
5339 && POINTER_TYPE_P (TREE_TYPE (low_value)))
5340 || (high_value && TREE_TYPE (high_value)
5341 && POINTER_TYPE_P (TREE_TYPE (high_value))))
5343 error_at (loc, "pointers are not permitted as case values");
5347 /* Case ranges are a GNU extension. */
5349 pedwarn (loc, OPT_pedantic,
5350 "range expressions in switch statements are non-standard");
5352 type = TREE_TYPE (cond);
5355 low_value = check_case_value (low_value);
5356 low_value = convert_and_check (type, low_value);
5357 if (low_value == error_mark_node)
5362 high_value = check_case_value (high_value);
5363 high_value = convert_and_check (type, high_value);
5364 if (high_value == error_mark_node)
5368 if (low_value && high_value)
5370 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5371 really a case range, even though it was written that way.
5372 Remove the HIGH_VALUE to simplify later processing. */
5373 if (tree_int_cst_equal (low_value, high_value))
5374 high_value = NULL_TREE;
5375 else if (!tree_int_cst_lt (low_value, high_value))
5376 warning_at (loc, 0, "empty range specified");
5379 /* See if the case is in range of the type of the original testing
5380 expression. If both low_value and high_value are out of range,
5381 don't insert the case label and return NULL_TREE. */
5383 && !check_case_bounds (type, orig_type,
5384 &low_value, high_value ? &high_value : NULL))
5387 /* Look up the LOW_VALUE in the table of case labels we already
5389 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
5390 /* If there was not an exact match, check for overlapping ranges.
5391 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5392 that's a `default' label and the only overlap is an exact match. */
5393 if (!node && (low_value || high_value))
5395 splay_tree_node low_bound;
5396 splay_tree_node high_bound;
5398 /* Even though there wasn't an exact match, there might be an
5399 overlap between this case range and another case range.
5400 Since we've (inductively) not allowed any overlapping case
5401 ranges, we simply need to find the greatest low case label
5402 that is smaller that LOW_VALUE, and the smallest low case
5403 label that is greater than LOW_VALUE. If there is an overlap
5404 it will occur in one of these two ranges. */
5405 low_bound = splay_tree_predecessor (cases,
5406 (splay_tree_key) low_value);
5407 high_bound = splay_tree_successor (cases,
5408 (splay_tree_key) low_value);
5410 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5411 the LOW_VALUE, so there is no need to check unless the
5412 LOW_BOUND is in fact itself a case range. */
5414 && CASE_HIGH ((tree) low_bound->value)
5415 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
5418 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5419 range is bigger than the low end of the current range, so we
5420 are only interested if the current range is a real range, and
5421 not an ordinary case label. */
5424 && (tree_int_cst_compare ((tree) high_bound->key,
5429 /* If there was an overlap, issue an error. */
5432 tree duplicate = CASE_LABEL ((tree) node->value);
5436 error_at (loc, "duplicate (or overlapping) case value");
5437 error_at (DECL_SOURCE_LOCATION (duplicate),
5438 "this is the first entry overlapping that value");
5442 error_at (loc, "duplicate case value") ;
5443 error_at (DECL_SOURCE_LOCATION (duplicate), "previously used here");
5447 error_at (loc, "multiple default labels in one switch");
5448 error_at (DECL_SOURCE_LOCATION (duplicate),
5449 "this is the first default label");
5454 /* Add a CASE_LABEL to the statement-tree. */
5455 case_label = add_stmt (build_case_label (loc, low_value, high_value, label));
5456 /* Register this case label in the splay tree. */
5457 splay_tree_insert (cases,
5458 (splay_tree_key) low_value,
5459 (splay_tree_value) case_label);
5464 /* Add a label so that the back-end doesn't think that the beginning of
5465 the switch is unreachable. Note that we do not add a case label, as
5466 that just leads to duplicates and thence to failure later on. */
5469 tree t = create_artificial_label (loc);
5470 add_stmt (build_stmt (loc, LABEL_EXPR, t));
5472 return error_mark_node;
5475 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5476 Used to verify that case values match up with enumerator values. */
5479 match_case_to_enum_1 (tree key, tree type, tree label)
5481 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
5483 /* ??? Not working too hard to print the double-word value.
5484 Should perhaps be done with %lwd in the diagnostic routines? */
5485 if (TREE_INT_CST_HIGH (key) == 0)
5486 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
5487 TREE_INT_CST_LOW (key));
5488 else if (!TYPE_UNSIGNED (type)
5489 && TREE_INT_CST_HIGH (key) == -1
5490 && TREE_INT_CST_LOW (key) != 0)
5491 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
5492 -TREE_INT_CST_LOW (key));
5494 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
5495 (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (key),
5496 (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (key));
5498 if (TYPE_NAME (type) == 0)
5499 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label)),
5500 warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
5501 "case value %qs not in enumerated type",
5504 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label)),
5505 warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
5506 "case value %qs not in enumerated type %qT",
5510 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
5511 Used to verify that case values match up with enumerator values. */
5514 match_case_to_enum (splay_tree_node node, void *data)
5516 tree label = (tree) node->value;
5517 tree type = (tree) data;
5519 /* Skip default case. */
5520 if (!CASE_LOW (label))
5523 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
5524 when we did our enum->case scan. Reset our scratch bit after. */
5525 if (!CASE_LOW_SEEN (label))
5526 match_case_to_enum_1 (CASE_LOW (label), type, label);
5528 CASE_LOW_SEEN (label) = 0;
5530 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
5531 not set, that means that CASE_HIGH did not appear when we did our
5532 enum->case scan. Reset our scratch bit after. */
5533 if (CASE_HIGH (label))
5535 if (!CASE_HIGH_SEEN (label))
5536 match_case_to_enum_1 (CASE_HIGH (label), type, label);
5538 CASE_HIGH_SEEN (label) = 0;
5544 /* Handle -Wswitch*. Called from the front end after parsing the
5545 switch construct. */
5546 /* ??? Should probably be somewhere generic, since other languages
5547 besides C and C++ would want this. At the moment, however, C/C++
5548 are the only tree-ssa languages that support enumerations at all,
5549 so the point is moot. */
5552 c_do_switch_warnings (splay_tree cases, location_t switch_location,
5553 tree type, tree cond)
5555 splay_tree_node default_node;
5556 splay_tree_node node;
5559 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
5562 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
5564 warning_at (switch_location, OPT_Wswitch_default,
5565 "switch missing default case");
5567 /* From here on, we only care about about enumerated types. */
5568 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
5571 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
5572 if (!warn_switch_enum && !warn_switch)
5575 /* Check the cases. Warn about case values which are not members of
5576 the enumerated type. For -Wswitch-enum, or for -Wswitch when
5577 there is no default case, check that exactly all enumeration
5578 literals are covered by the cases. */
5580 /* Clearing COND if it is not an integer constant simplifies
5581 the tests inside the loop below. */
5582 if (TREE_CODE (cond) != INTEGER_CST)
5585 /* The time complexity here is O(N*lg(N)) worst case, but for the
5586 common case of monotonically increasing enumerators, it is
5587 O(N), since the nature of the splay tree will keep the next
5588 element adjacent to the root at all times. */
5590 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
5592 tree value = TREE_VALUE (chain);
5593 if (TREE_CODE (value) == CONST_DECL)
5594 value = DECL_INITIAL (value);
5595 node = splay_tree_lookup (cases, (splay_tree_key) value);
5598 /* Mark the CASE_LOW part of the case entry as seen. */
5599 tree label = (tree) node->value;
5600 CASE_LOW_SEEN (label) = 1;
5604 /* Even though there wasn't an exact match, there might be a
5605 case range which includes the enumerator's value. */
5606 node = splay_tree_predecessor (cases, (splay_tree_key) value);
5607 if (node && CASE_HIGH ((tree) node->value))
5609 tree label = (tree) node->value;
5610 int cmp = tree_int_cst_compare (CASE_HIGH (label), value);
5613 /* If we match the upper bound exactly, mark the CASE_HIGH
5614 part of the case entry as seen. */
5616 CASE_HIGH_SEEN (label) = 1;
5621 /* We've now determined that this enumerated literal isn't
5622 handled by the case labels of the switch statement. */
5624 /* If the switch expression is a constant, we only really care
5625 about whether that constant is handled by the switch. */
5626 if (cond && tree_int_cst_compare (cond, value))
5629 /* If there is a default_node, the only relevant option is
5630 Wswitch-enum. Otherwise, if both are enabled then we prefer
5631 to warn using -Wswitch because -Wswitch is enabled by -Wall
5632 while -Wswitch-enum is explicit. */
5633 warning_at (switch_location,
5634 (default_node || !warn_switch
5637 "enumeration value %qE not handled in switch",
5638 TREE_PURPOSE (chain));
5641 /* Warn if there are case expressions that don't correspond to
5642 enumerators. This can occur since C and C++ don't enforce
5643 type-checking of assignments to enumeration variables.
5645 The time complexity here is now always O(N) worst case, since
5646 we should have marked both the lower bound and upper bound of
5647 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
5648 above. This scan also resets those fields. */
5650 splay_tree_foreach (cases, match_case_to_enum, type);
5653 /* Finish an expression taking the address of LABEL (an
5654 IDENTIFIER_NODE). Returns an expression for the address.
5656 LOC is the location for the expression returned. */
5659 finish_label_address_expr (tree label, location_t loc)
5663 pedwarn (input_location, OPT_pedantic, "taking the address of a label is non-standard");
5665 if (label == error_mark_node)
5666 return error_mark_node;
5668 label = lookup_label (label);
5669 if (label == NULL_TREE)
5670 result = null_pointer_node;
5673 TREE_USED (label) = 1;
5674 result = build1 (ADDR_EXPR, ptr_type_node, label);
5675 /* The current function is not necessarily uninlinable.
5676 Computed gotos are incompatible with inlining, but the value
5677 here could be used only in a diagnostic, for example. */
5678 protected_set_expr_location (result, loc);
5685 /* Given a boolean expression ARG, return a tree representing an increment
5686 or decrement (as indicated by CODE) of ARG. The front end must check for
5687 invalid cases (e.g., decrement in C++). */
5689 boolean_increment (enum tree_code code, tree arg)
5692 tree true_res = build_int_cst (TREE_TYPE (arg), 1);
5694 arg = stabilize_reference (arg);
5697 case PREINCREMENT_EXPR:
5698 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
5700 case POSTINCREMENT_EXPR:
5701 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
5702 arg = save_expr (arg);
5703 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
5704 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
5706 case PREDECREMENT_EXPR:
5707 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
5708 invert_truthvalue_loc (input_location, arg));
5710 case POSTDECREMENT_EXPR:
5711 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
5712 invert_truthvalue_loc (input_location, arg));
5713 arg = save_expr (arg);
5714 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
5715 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
5720 TREE_SIDE_EFFECTS (val) = 1;
5724 /* Built-in macros for stddef.h and stdint.h, that require macros
5725 defined in this file. */
5727 c_stddef_cpp_builtins(void)
5729 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
5730 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
5731 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
5732 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
5733 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
5734 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
5735 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE, 0);
5736 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE, 0);
5737 if (SIG_ATOMIC_TYPE)
5738 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE, 0);
5740 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE, 0);
5742 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE, 0);
5744 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE, 0);
5746 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE, 0);
5748 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE, 0);
5750 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE, 0);
5752 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE, 0);
5754 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE, 0);
5755 if (INT_LEAST8_TYPE)
5756 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE, 0);
5757 if (INT_LEAST16_TYPE)
5758 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE, 0);
5759 if (INT_LEAST32_TYPE)
5760 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE, 0);
5761 if (INT_LEAST64_TYPE)
5762 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE, 0);
5763 if (UINT_LEAST8_TYPE)
5764 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE, 0);
5765 if (UINT_LEAST16_TYPE)
5766 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE, 0);
5767 if (UINT_LEAST32_TYPE)
5768 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE, 0);
5769 if (UINT_LEAST64_TYPE)
5770 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE, 0);
5772 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE, 0);
5773 if (INT_FAST16_TYPE)
5774 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE, 0);
5775 if (INT_FAST32_TYPE)
5776 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE, 0);
5777 if (INT_FAST64_TYPE)
5778 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE, 0);
5779 if (UINT_FAST8_TYPE)
5780 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE, 0);
5781 if (UINT_FAST16_TYPE)
5782 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE, 0);
5783 if (UINT_FAST32_TYPE)
5784 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE, 0);
5785 if (UINT_FAST64_TYPE)
5786 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE, 0);
5788 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE, 0);
5790 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE, 0);
5794 c_init_attributes (void)
5796 /* Fill in the built_in_attributes array. */
5797 #define DEF_ATTR_NULL_TREE(ENUM) \
5798 built_in_attributes[(int) ENUM] = NULL_TREE;
5799 #define DEF_ATTR_INT(ENUM, VALUE) \
5800 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
5801 #define DEF_ATTR_IDENT(ENUM, STRING) \
5802 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5803 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5804 built_in_attributes[(int) ENUM] \
5805 = tree_cons (built_in_attributes[(int) PURPOSE], \
5806 built_in_attributes[(int) VALUE], \
5807 built_in_attributes[(int) CHAIN]);
5808 #include "builtin-attrs.def"
5809 #undef DEF_ATTR_NULL_TREE
5811 #undef DEF_ATTR_IDENT
5812 #undef DEF_ATTR_TREE_LIST
5815 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
5816 identifier as an argument, so the front end shouldn't look it up. */
5819 attribute_takes_identifier_p (const_tree attr_id)
5821 if (is_attribute_p ("mode", attr_id)
5822 || is_attribute_p ("format", attr_id)
5823 || is_attribute_p ("cleanup", attr_id))
5826 return targetm.attribute_takes_identifier_p (attr_id);
5829 /* Attribute handlers common to C front ends. */
5831 /* Handle a "packed" attribute; arguments as in
5832 struct attribute_spec.handler. */
5835 handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5836 int flags, bool *no_add_attrs)
5840 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5841 *node = build_variant_type_copy (*node);
5842 TYPE_PACKED (*node) = 1;
5844 else if (TREE_CODE (*node) == FIELD_DECL)
5846 if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT
5847 /* Still pack bitfields. */
5848 && ! DECL_INITIAL (*node))
5849 warning (OPT_Wattributes,
5850 "%qE attribute ignored for field of type %qT",
5851 name, TREE_TYPE (*node));
5853 DECL_PACKED (*node) = 1;
5855 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
5856 used for DECL_REGISTER. It wouldn't mean anything anyway.
5857 We can't set DECL_PACKED on the type of a TYPE_DECL, because
5858 that changes what the typedef is typing. */
5861 warning (OPT_Wattributes, "%qE attribute ignored", name);
5862 *no_add_attrs = true;
5868 /* Handle a "nocommon" attribute; arguments as in
5869 struct attribute_spec.handler. */
5872 handle_nocommon_attribute (tree *node, tree name,
5873 tree ARG_UNUSED (args),
5874 int ARG_UNUSED (flags), bool *no_add_attrs)
5876 if (TREE_CODE (*node) == VAR_DECL)
5877 DECL_COMMON (*node) = 0;
5880 warning (OPT_Wattributes, "%qE attribute ignored", name);
5881 *no_add_attrs = true;
5887 /* Handle a "common" attribute; arguments as in
5888 struct attribute_spec.handler. */
5891 handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5892 int ARG_UNUSED (flags), bool *no_add_attrs)
5894 if (TREE_CODE (*node) == VAR_DECL)
5895 DECL_COMMON (*node) = 1;
5898 warning (OPT_Wattributes, "%qE attribute ignored", name);
5899 *no_add_attrs = true;
5905 /* Handle a "noreturn" attribute; arguments as in
5906 struct attribute_spec.handler. */
5909 handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5910 int ARG_UNUSED (flags), bool *no_add_attrs)
5912 tree type = TREE_TYPE (*node);
5914 /* See FIXME comment in c_common_attribute_table. */
5915 if (TREE_CODE (*node) == FUNCTION_DECL)
5916 TREE_THIS_VOLATILE (*node) = 1;
5917 else if (TREE_CODE (type) == POINTER_TYPE
5918 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
5920 = build_pointer_type
5921 (build_type_variant (TREE_TYPE (type),
5922 TYPE_READONLY (TREE_TYPE (type)), 1));
5925 warning (OPT_Wattributes, "%qE attribute ignored", name);
5926 *no_add_attrs = true;
5932 /* Handle a "hot" and attribute; arguments as in
5933 struct attribute_spec.handler. */
5936 handle_hot_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5937 int ARG_UNUSED (flags), bool *no_add_attrs)
5939 if (TREE_CODE (*node) == FUNCTION_DECL)
5941 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node)) != NULL)
5943 warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s",
5945 *no_add_attrs = true;
5947 /* Most of the rest of the hot processing is done later with
5948 lookup_attribute. */
5952 warning (OPT_Wattributes, "%qE attribute ignored", name);
5953 *no_add_attrs = true;
5958 /* Handle a "cold" and attribute; arguments as in
5959 struct attribute_spec.handler. */
5962 handle_cold_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5963 int ARG_UNUSED (flags), bool *no_add_attrs)
5965 if (TREE_CODE (*node) == FUNCTION_DECL)
5967 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node)) != NULL)
5969 warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s",
5971 *no_add_attrs = true;
5973 /* Most of the rest of the cold processing is done later with
5974 lookup_attribute. */
5978 warning (OPT_Wattributes, "%qE attribute ignored", name);
5979 *no_add_attrs = true;
5985 /* Handle a "noinline" attribute; arguments as in
5986 struct attribute_spec.handler. */
5989 handle_noinline_attribute (tree *node, tree name,
5990 tree ARG_UNUSED (args),
5991 int ARG_UNUSED (flags), bool *no_add_attrs)
5993 if (TREE_CODE (*node) == FUNCTION_DECL)
5994 DECL_UNINLINABLE (*node) = 1;
5997 warning (OPT_Wattributes, "%qE attribute ignored", name);
5998 *no_add_attrs = true;
6004 /* Handle a "noclone" attribute; arguments as in
6005 struct attribute_spec.handler. */
6008 handle_noclone_attribute (tree *node, tree name,
6009 tree ARG_UNUSED (args),
6010 int ARG_UNUSED (flags), bool *no_add_attrs)
6012 if (TREE_CODE (*node) != FUNCTION_DECL)
6014 warning (OPT_Wattributes, "%qE attribute ignored", name);
6015 *no_add_attrs = true;
6021 /* Handle a "always_inline" attribute; arguments as in
6022 struct attribute_spec.handler. */
6025 handle_always_inline_attribute (tree *node, tree name,
6026 tree ARG_UNUSED (args),
6027 int ARG_UNUSED (flags),
6030 if (TREE_CODE (*node) == FUNCTION_DECL)
6032 /* Set the attribute and mark it for disregarding inline
6034 DECL_DISREGARD_INLINE_LIMITS (*node) = 1;
6038 warning (OPT_Wattributes, "%qE attribute ignored", name);
6039 *no_add_attrs = true;
6045 /* Handle a "gnu_inline" attribute; arguments as in
6046 struct attribute_spec.handler. */
6049 handle_gnu_inline_attribute (tree *node, tree name,
6050 tree ARG_UNUSED (args),
6051 int ARG_UNUSED (flags),
6054 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
6056 /* Do nothing else, just set the attribute. We'll get at
6057 it later with lookup_attribute. */
6061 warning (OPT_Wattributes, "%qE attribute ignored", name);
6062 *no_add_attrs = true;
6068 /* Handle an "artificial" attribute; arguments as in
6069 struct attribute_spec.handler. */
6072 handle_artificial_attribute (tree *node, tree name,
6073 tree ARG_UNUSED (args),
6074 int ARG_UNUSED (flags),
6077 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
6079 /* Do nothing else, just set the attribute. We'll get at
6080 it later with lookup_attribute. */
6084 warning (OPT_Wattributes, "%qE attribute ignored", name);
6085 *no_add_attrs = true;
6091 /* Handle a "flatten" attribute; arguments as in
6092 struct attribute_spec.handler. */
6095 handle_flatten_attribute (tree *node, tree name,
6096 tree args ATTRIBUTE_UNUSED,
6097 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
6099 if (TREE_CODE (*node) == FUNCTION_DECL)
6100 /* Do nothing else, just set the attribute. We'll get at
6101 it later with lookup_attribute. */
6105 warning (OPT_Wattributes, "%qE attribute ignored", name);
6106 *no_add_attrs = true;
6112 /* Handle a "warning" or "error" attribute; arguments as in
6113 struct attribute_spec.handler. */
6116 handle_error_attribute (tree *node, tree name, tree args,
6117 int ARG_UNUSED (flags), bool *no_add_attrs)
6119 if (TREE_CODE (*node) == FUNCTION_DECL
6120 || TREE_CODE (TREE_VALUE (args)) == STRING_CST)
6121 /* Do nothing else, just set the attribute. We'll get at
6122 it later with lookup_attribute. */
6126 warning (OPT_Wattributes, "%qE attribute ignored", name);
6127 *no_add_attrs = true;
6133 /* Handle a "used" attribute; arguments as in
6134 struct attribute_spec.handler. */
6137 handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
6138 int ARG_UNUSED (flags), bool *no_add_attrs)
6142 if (TREE_CODE (node) == FUNCTION_DECL
6143 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
6145 TREE_USED (node) = 1;
6146 DECL_PRESERVE_P (node) = 1;
6147 if (TREE_CODE (node) == VAR_DECL)
6148 DECL_READ_P (node) = 1;
6152 warning (OPT_Wattributes, "%qE attribute ignored", name);
6153 *no_add_attrs = true;
6159 /* Handle a "unused" attribute; arguments as in
6160 struct attribute_spec.handler. */
6163 handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6164 int flags, bool *no_add_attrs)
6170 if (TREE_CODE (decl) == PARM_DECL
6171 || TREE_CODE (decl) == VAR_DECL
6172 || TREE_CODE (decl) == FUNCTION_DECL
6173 || TREE_CODE (decl) == LABEL_DECL
6174 || TREE_CODE (decl) == TYPE_DECL)
6176 TREE_USED (decl) = 1;
6177 if (TREE_CODE (decl) == VAR_DECL
6178 || TREE_CODE (decl) == PARM_DECL)
6179 DECL_READ_P (decl) = 1;
6183 warning (OPT_Wattributes, "%qE attribute ignored", name);
6184 *no_add_attrs = true;
6189 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
6190 *node = build_variant_type_copy (*node);
6191 TREE_USED (*node) = 1;
6197 /* Handle a "externally_visible" attribute; arguments as in
6198 struct attribute_spec.handler. */
6201 handle_externally_visible_attribute (tree *pnode, tree name,
6202 tree ARG_UNUSED (args),
6203 int ARG_UNUSED (flags),
6208 if (TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL)
6210 if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL
6211 && !DECL_EXTERNAL (node)) || !TREE_PUBLIC (node))
6213 warning (OPT_Wattributes,
6214 "%qE attribute have effect only on public objects", name);
6215 *no_add_attrs = true;
6220 warning (OPT_Wattributes, "%qE attribute ignored", name);
6221 *no_add_attrs = true;
6227 /* Handle a "const" attribute; arguments as in
6228 struct attribute_spec.handler. */
6231 handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6232 int ARG_UNUSED (flags), bool *no_add_attrs)
6234 tree type = TREE_TYPE (*node);
6236 /* See FIXME comment on noreturn in c_common_attribute_table. */
6237 if (TREE_CODE (*node) == FUNCTION_DECL)
6238 TREE_READONLY (*node) = 1;
6239 else if (TREE_CODE (type) == POINTER_TYPE
6240 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
6242 = build_pointer_type
6243 (build_type_variant (TREE_TYPE (type), 1,
6244 TREE_THIS_VOLATILE (TREE_TYPE (type))));
6247 warning (OPT_Wattributes, "%qE attribute ignored", name);
6248 *no_add_attrs = true;
6254 /* Handle a "transparent_union" attribute; arguments as in
6255 struct attribute_spec.handler. */
6258 handle_transparent_union_attribute (tree *node, tree name,
6259 tree ARG_UNUSED (args), int flags,
6264 *no_add_attrs = true;
6266 if (TREE_CODE (*node) == TYPE_DECL)
6267 node = &TREE_TYPE (*node);
6270 if (TREE_CODE (type) == UNION_TYPE)
6272 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
6273 the code in finish_struct. */
6274 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
6276 if (TYPE_FIELDS (type) == NULL_TREE
6277 || TYPE_MODE (type) != DECL_MODE (TYPE_FIELDS (type)))
6280 /* A type variant isn't good enough, since we don't a cast
6281 to such a type removed as a no-op. */
6282 *node = type = build_duplicate_type (type);
6285 TYPE_TRANSPARENT_AGGR (type) = 1;
6290 warning (OPT_Wattributes, "%qE attribute ignored", name);
6294 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6295 get the requested priority for a constructor or destructor,
6296 possibly issuing diagnostics for invalid or reserved
6299 static priority_type
6300 get_priority (tree args, bool is_destructor)
6306 return DEFAULT_INIT_PRIORITY;
6308 if (!SUPPORTS_INIT_PRIORITY)
6311 error ("destructor priorities are not supported");
6313 error ("constructor priorities are not supported");
6314 return DEFAULT_INIT_PRIORITY;
6317 arg = TREE_VALUE (args);
6318 if (!host_integerp (arg, /*pos=*/0)
6319 || !INTEGRAL_TYPE_P (TREE_TYPE (arg)))
6322 pri = tree_low_cst (TREE_VALUE (args), /*pos=*/0);
6323 if (pri < 0 || pri > MAX_INIT_PRIORITY)
6326 if (pri <= MAX_RESERVED_INIT_PRIORITY)
6330 "destructor priorities from 0 to %d are reserved "
6331 "for the implementation",
6332 MAX_RESERVED_INIT_PRIORITY);
6335 "constructor priorities from 0 to %d are reserved "
6336 "for the implementation",
6337 MAX_RESERVED_INIT_PRIORITY);
6343 error ("destructor priorities must be integers from 0 to %d inclusive",
6346 error ("constructor priorities must be integers from 0 to %d inclusive",
6348 return DEFAULT_INIT_PRIORITY;
6351 /* Handle a "constructor" attribute; arguments as in
6352 struct attribute_spec.handler. */
6355 handle_constructor_attribute (tree *node, tree name, tree args,
6356 int ARG_UNUSED (flags),
6360 tree type = TREE_TYPE (decl);
6362 if (TREE_CODE (decl) == FUNCTION_DECL
6363 && TREE_CODE (type) == FUNCTION_TYPE
6364 && decl_function_context (decl) == 0)
6366 priority_type priority;
6367 DECL_STATIC_CONSTRUCTOR (decl) = 1;
6368 priority = get_priority (args, /*is_destructor=*/false);
6369 SET_DECL_INIT_PRIORITY (decl, priority);
6370 TREE_USED (decl) = 1;
6374 warning (OPT_Wattributes, "%qE attribute ignored", name);
6375 *no_add_attrs = true;
6381 /* Handle a "destructor" attribute; arguments as in
6382 struct attribute_spec.handler. */
6385 handle_destructor_attribute (tree *node, tree name, tree args,
6386 int ARG_UNUSED (flags),
6390 tree type = TREE_TYPE (decl);
6392 if (TREE_CODE (decl) == FUNCTION_DECL
6393 && TREE_CODE (type) == FUNCTION_TYPE
6394 && decl_function_context (decl) == 0)
6396 priority_type priority;
6397 DECL_STATIC_DESTRUCTOR (decl) = 1;
6398 priority = get_priority (args, /*is_destructor=*/true);
6399 SET_DECL_FINI_PRIORITY (decl, priority);
6400 TREE_USED (decl) = 1;
6404 warning (OPT_Wattributes, "%qE attribute ignored", name);
6405 *no_add_attrs = true;
6411 /* Handle a "mode" attribute; arguments as in
6412 struct attribute_spec.handler. */
6415 handle_mode_attribute (tree *node, tree name, tree args,
6416 int ARG_UNUSED (flags), bool *no_add_attrs)
6419 tree ident = TREE_VALUE (args);
6421 *no_add_attrs = true;
6423 if (TREE_CODE (ident) != IDENTIFIER_NODE)
6424 warning (OPT_Wattributes, "%qE attribute ignored", name);
6428 const char *p = IDENTIFIER_POINTER (ident);
6429 int len = strlen (p);
6430 enum machine_mode mode = VOIDmode;
6434 if (len > 4 && p[0] == '_' && p[1] == '_'
6435 && p[len - 1] == '_' && p[len - 2] == '_')
6437 char *newp = (char *) alloca (len - 1);
6439 strcpy (newp, &p[2]);
6440 newp[len - 4] = '\0';
6444 /* Change this type to have a type with the specified mode.
6445 First check for the special modes. */
6446 if (!strcmp (p, "byte"))
6448 else if (!strcmp (p, "word"))
6450 else if (!strcmp (p, "pointer"))
6452 else if (!strcmp (p, "libgcc_cmp_return"))
6453 mode = targetm.libgcc_cmp_return_mode ();
6454 else if (!strcmp (p, "libgcc_shift_count"))
6455 mode = targetm.libgcc_shift_count_mode ();
6456 else if (!strcmp (p, "unwind_word"))
6457 mode = targetm.unwind_word_mode ();
6459 for (j = 0; j < NUM_MACHINE_MODES; j++)
6460 if (!strcmp (p, GET_MODE_NAME (j)))
6462 mode = (enum machine_mode) j;
6466 if (mode == VOIDmode)
6468 error ("unknown machine mode %qE", ident);
6473 switch (GET_MODE_CLASS (mode))
6476 case MODE_PARTIAL_INT:
6478 case MODE_DECIMAL_FLOAT:
6483 valid_mode = targetm.scalar_mode_supported_p (mode);
6486 case MODE_COMPLEX_INT:
6487 case MODE_COMPLEX_FLOAT:
6488 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
6491 case MODE_VECTOR_INT:
6492 case MODE_VECTOR_FLOAT:
6493 case MODE_VECTOR_FRACT:
6494 case MODE_VECTOR_UFRACT:
6495 case MODE_VECTOR_ACCUM:
6496 case MODE_VECTOR_UACCUM:
6497 warning (OPT_Wattributes, "specifying vector types with "
6498 "__attribute__ ((mode)) is deprecated");
6499 warning (OPT_Wattributes,
6500 "use __attribute__ ((vector_size)) instead");
6501 valid_mode = vector_mode_valid_p (mode);
6509 error ("unable to emulate %qs", p);
6513 if (POINTER_TYPE_P (type))
6515 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (type));
6516 tree (*fn)(tree, enum machine_mode, bool);
6518 if (!targetm.addr_space.valid_pointer_mode (mode, as))
6520 error ("invalid pointer mode %qs", p);
6524 if (TREE_CODE (type) == POINTER_TYPE)
6525 fn = build_pointer_type_for_mode;
6527 fn = build_reference_type_for_mode;
6528 typefm = fn (TREE_TYPE (type), mode, false);
6532 /* For fixed-point modes, we need to test if the signness of type
6533 and the machine mode are consistent. */
6534 if (ALL_FIXED_POINT_MODE_P (mode)
6535 && TYPE_UNSIGNED (type) != UNSIGNED_FIXED_POINT_MODE_P (mode))
6537 error ("signness of type and machine mode %qs don't match", p);
6540 /* For fixed-point modes, we need to pass saturating info. */
6541 typefm = lang_hooks.types.type_for_mode (mode,
6542 ALL_FIXED_POINT_MODE_P (mode) ? TYPE_SATURATING (type)
6543 : TYPE_UNSIGNED (type));
6546 if (typefm == NULL_TREE)
6548 error ("no data type for mode %qs", p);
6551 else if (TREE_CODE (type) == ENUMERAL_TYPE)
6553 /* For enumeral types, copy the precision from the integer
6554 type returned above. If not an INTEGER_TYPE, we can't use
6555 this mode for this type. */
6556 if (TREE_CODE (typefm) != INTEGER_TYPE)
6558 error ("cannot use mode %qs for enumeral types", p);
6562 if (flags & ATTR_FLAG_TYPE_IN_PLACE)
6564 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
6569 /* We cannot build a type variant, as there's code that assumes
6570 that TYPE_MAIN_VARIANT has the same mode. This includes the
6571 debug generators. Instead, create a subrange type. This
6572 results in all of the enumeral values being emitted only once
6573 in the original, and the subtype gets them by reference. */
6574 if (TYPE_UNSIGNED (type))
6575 typefm = make_unsigned_type (TYPE_PRECISION (typefm));
6577 typefm = make_signed_type (TYPE_PRECISION (typefm));
6578 TREE_TYPE (typefm) = type;
6581 else if (VECTOR_MODE_P (mode)
6582 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
6583 : TREE_CODE (type) != TREE_CODE (typefm))
6585 error ("mode %qs applied to inappropriate type", p);
6595 /* Handle a "section" attribute; arguments as in
6596 struct attribute_spec.handler. */
6599 handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
6600 int ARG_UNUSED (flags), bool *no_add_attrs)
6604 if (targetm.have_named_sections)
6606 user_defined_section_attribute = true;
6608 if ((TREE_CODE (decl) == FUNCTION_DECL
6609 || TREE_CODE (decl) == VAR_DECL)
6610 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
6612 if (TREE_CODE (decl) == VAR_DECL
6613 && current_function_decl != NULL_TREE
6614 && !TREE_STATIC (decl))
6616 error_at (DECL_SOURCE_LOCATION (decl),
6617 "section attribute cannot be specified for "
6619 *no_add_attrs = true;
6622 /* The decl may have already been given a section attribute
6623 from a previous declaration. Ensure they match. */
6624 else if (DECL_SECTION_NAME (decl) != NULL_TREE
6625 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
6626 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
6628 error ("section of %q+D conflicts with previous declaration",
6630 *no_add_attrs = true;
6632 else if (TREE_CODE (decl) == VAR_DECL
6633 && !targetm.have_tls && targetm.emutls.tmpl_section
6634 && DECL_THREAD_LOCAL_P (decl))
6636 error ("section of %q+D cannot be overridden", *node);
6637 *no_add_attrs = true;
6640 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
6644 error ("section attribute not allowed for %q+D", *node);
6645 *no_add_attrs = true;
6650 error_at (DECL_SOURCE_LOCATION (*node),
6651 "section attributes are not supported for this target");
6652 *no_add_attrs = true;
6658 /* Handle a "aligned" attribute; arguments as in
6659 struct attribute_spec.handler. */
6662 handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
6663 int flags, bool *no_add_attrs)
6665 tree decl = NULL_TREE;
6668 tree align_expr = (args ? TREE_VALUE (args)
6669 : size_int (ATTRIBUTE_ALIGNED_VALUE / BITS_PER_UNIT));
6675 type = &TREE_TYPE (decl);
6676 is_type = TREE_CODE (*node) == TYPE_DECL;
6678 else if (TYPE_P (*node))
6679 type = node, is_type = 1;
6681 if (TREE_CODE (align_expr) != INTEGER_CST)
6683 error ("requested alignment is not a constant");
6684 *no_add_attrs = true;
6686 else if ((i = tree_log2 (align_expr)) == -1)
6688 error ("requested alignment is not a power of 2");
6689 *no_add_attrs = true;
6691 else if (i >= HOST_BITS_PER_INT - BITS_PER_UNIT_LOG)
6693 error ("requested alignment is too large");
6694 *no_add_attrs = true;
6698 if ((flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
6699 /* OK, modify the type in place. */;
6700 /* If we have a TYPE_DECL, then copy the type, so that we
6701 don't accidentally modify a builtin type. See pushdecl. */
6702 else if (decl && TREE_TYPE (decl) != error_mark_node
6703 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
6705 tree tt = TREE_TYPE (decl);
6706 *type = build_variant_type_copy (*type);
6707 DECL_ORIGINAL_TYPE (decl) = tt;
6708 TYPE_NAME (*type) = decl;
6709 TREE_USED (*type) = TREE_USED (decl);
6710 TREE_TYPE (decl) = *type;
6713 *type = build_variant_type_copy (*type);
6715 TYPE_ALIGN (*type) = (1U << i) * BITS_PER_UNIT;
6716 TYPE_USER_ALIGN (*type) = 1;
6718 else if (! VAR_OR_FUNCTION_DECL_P (decl)
6719 && TREE_CODE (decl) != FIELD_DECL)
6721 error ("alignment may not be specified for %q+D", decl);
6722 *no_add_attrs = true;
6724 else if (TREE_CODE (decl) == FUNCTION_DECL
6725 && DECL_ALIGN (decl) > (1U << i) * BITS_PER_UNIT)
6727 if (DECL_USER_ALIGN (decl))
6728 error ("alignment for %q+D was previously specified as %d "
6729 "and may not be decreased", decl,
6730 DECL_ALIGN (decl) / BITS_PER_UNIT);
6732 error ("alignment for %q+D must be at least %d", decl,
6733 DECL_ALIGN (decl) / BITS_PER_UNIT);
6734 *no_add_attrs = true;
6738 DECL_ALIGN (decl) = (1U << i) * BITS_PER_UNIT;
6739 DECL_USER_ALIGN (decl) = 1;
6745 /* Handle a "weak" attribute; arguments as in
6746 struct attribute_spec.handler. */
6749 handle_weak_attribute (tree *node, tree name,
6750 tree ARG_UNUSED (args),
6751 int ARG_UNUSED (flags),
6752 bool * ARG_UNUSED (no_add_attrs))
6754 if (TREE_CODE (*node) == FUNCTION_DECL
6755 && DECL_DECLARED_INLINE_P (*node))
6757 error ("inline function %q+D cannot be declared weak", *node);
6758 *no_add_attrs = true;
6760 else if (TREE_CODE (*node) == FUNCTION_DECL
6761 || TREE_CODE (*node) == VAR_DECL)
6762 declare_weak (*node);
6764 warning (OPT_Wattributes, "%qE attribute ignored", name);
6769 /* Handle an "alias" attribute; arguments as in
6770 struct attribute_spec.handler. */
6773 handle_alias_attribute (tree *node, tree name, tree args,
6774 int ARG_UNUSED (flags), bool *no_add_attrs)
6778 if (TREE_CODE (decl) != FUNCTION_DECL && TREE_CODE (decl) != VAR_DECL)
6780 warning (OPT_Wattributes, "%qE attribute ignored", name);
6781 *no_add_attrs = true;
6783 else if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
6784 || (TREE_CODE (decl) != FUNCTION_DECL
6785 && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl))
6786 /* A static variable declaration is always a tentative definition,
6787 but the alias is a non-tentative definition which overrides. */
6788 || (TREE_CODE (decl) != FUNCTION_DECL
6789 && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl)))
6791 error ("%q+D defined both normally and as an alias", decl);
6792 *no_add_attrs = true;
6795 /* Note that the very first time we process a nested declaration,
6796 decl_function_context will not be set. Indeed, *would* never
6797 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
6798 we do below. After such frobbery, pushdecl would set the context.
6799 In any case, this is never what we want. */
6800 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
6804 id = TREE_VALUE (args);
6805 if (TREE_CODE (id) != STRING_CST)
6807 error ("alias argument not a string");
6808 *no_add_attrs = true;
6811 id = get_identifier (TREE_STRING_POINTER (id));
6812 /* This counts as a use of the object pointed to. */
6815 if (TREE_CODE (decl) == FUNCTION_DECL)
6816 DECL_INITIAL (decl) = error_mark_node;
6819 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
6820 DECL_EXTERNAL (decl) = 1;
6822 DECL_EXTERNAL (decl) = 0;
6823 TREE_STATIC (decl) = 1;
6828 warning (OPT_Wattributes, "%qE attribute ignored", name);
6829 *no_add_attrs = true;
6835 /* Handle a "weakref" attribute; arguments as in struct
6836 attribute_spec.handler. */
6839 handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args,
6840 int flags, bool *no_add_attrs)
6842 tree attr = NULL_TREE;
6844 /* We must ignore the attribute when it is associated with
6845 local-scoped decls, since attribute alias is ignored and many
6846 such symbols do not even have a DECL_WEAK field. */
6847 if (decl_function_context (*node)
6848 || current_function_decl
6849 || (TREE_CODE (*node) != VAR_DECL && TREE_CODE (*node) != FUNCTION_DECL))
6851 warning (OPT_Wattributes, "%qE attribute ignored", name);
6852 *no_add_attrs = true;
6856 /* The idea here is that `weakref("name")' mutates into `weakref,
6857 alias("name")', and weakref without arguments, in turn,
6858 implicitly adds weak. */
6862 attr = tree_cons (get_identifier ("alias"), args, attr);
6863 attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr);
6865 *no_add_attrs = true;
6867 decl_attributes (node, attr, flags);
6871 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node)))
6872 error_at (DECL_SOURCE_LOCATION (*node),
6873 "weakref attribute must appear before alias attribute");
6875 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
6876 and that isn't supported; and because it wants to add it to
6877 the list of weak decls, which isn't helpful. */
6878 DECL_WEAK (*node) = 1;
6884 /* Handle an "visibility" attribute; arguments as in
6885 struct attribute_spec.handler. */
6888 handle_visibility_attribute (tree *node, tree name, tree args,
6889 int ARG_UNUSED (flags),
6890 bool *ARG_UNUSED (no_add_attrs))
6893 tree id = TREE_VALUE (args);
6894 enum symbol_visibility vis;
6898 if (TREE_CODE (*node) == ENUMERAL_TYPE)
6900 else if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE)
6902 warning (OPT_Wattributes, "%qE attribute ignored on non-class types",
6906 else if (TYPE_FIELDS (*node))
6908 error ("%qE attribute ignored because %qT is already defined",
6913 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
6915 warning (OPT_Wattributes, "%qE attribute ignored", name);
6919 if (TREE_CODE (id) != STRING_CST)
6921 error ("visibility argument not a string");
6925 /* If this is a type, set the visibility on the type decl. */
6928 decl = TYPE_NAME (decl);
6931 if (TREE_CODE (decl) == IDENTIFIER_NODE)
6933 warning (OPT_Wattributes, "%qE attribute ignored on types",
6939 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
6940 vis = VISIBILITY_DEFAULT;
6941 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
6942 vis = VISIBILITY_INTERNAL;
6943 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
6944 vis = VISIBILITY_HIDDEN;
6945 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
6946 vis = VISIBILITY_PROTECTED;
6949 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
6950 vis = VISIBILITY_DEFAULT;
6953 if (DECL_VISIBILITY_SPECIFIED (decl)
6954 && vis != DECL_VISIBILITY (decl))
6956 tree attributes = (TYPE_P (*node)
6957 ? TYPE_ATTRIBUTES (*node)
6958 : DECL_ATTRIBUTES (decl));
6959 if (lookup_attribute ("visibility", attributes))
6960 error ("%qD redeclared with different visibility", decl);
6961 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6962 && lookup_attribute ("dllimport", attributes))
6963 error ("%qD was declared %qs which implies default visibility",
6965 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6966 && lookup_attribute ("dllexport", attributes))
6967 error ("%qD was declared %qs which implies default visibility",
6971 DECL_VISIBILITY (decl) = vis;
6972 DECL_VISIBILITY_SPECIFIED (decl) = 1;
6974 /* Go ahead and attach the attribute to the node as well. This is needed
6975 so we can determine whether we have VISIBILITY_DEFAULT because the
6976 visibility was not specified, or because it was explicitly overridden
6977 from the containing scope. */
6982 /* Determine the ELF symbol visibility for DECL, which is either a
6983 variable or a function. It is an error to use this function if a
6984 definition of DECL is not available in this translation unit.
6985 Returns true if the final visibility has been determined by this
6986 function; false if the caller is free to make additional
6990 c_determine_visibility (tree decl)
6992 gcc_assert (TREE_CODE (decl) == VAR_DECL
6993 || TREE_CODE (decl) == FUNCTION_DECL);
6995 /* If the user explicitly specified the visibility with an
6996 attribute, honor that. DECL_VISIBILITY will have been set during
6997 the processing of the attribute. We check for an explicit
6998 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
6999 to distinguish the use of an attribute from the use of a "#pragma
7000 GCC visibility push(...)"; in the latter case we still want other
7001 considerations to be able to overrule the #pragma. */
7002 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl))
7003 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7004 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl))
7005 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))))
7008 /* Set default visibility to whatever the user supplied with
7009 visibility_specified depending on #pragma GCC visibility. */
7010 if (!DECL_VISIBILITY_SPECIFIED (decl))
7012 if (visibility_options.inpragma
7013 || DECL_VISIBILITY (decl) != default_visibility)
7015 DECL_VISIBILITY (decl) = default_visibility;
7016 DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
7017 /* If visibility changed and DECL already has DECL_RTL, ensure
7018 symbol flags are updated. */
7019 if (((TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl))
7020 || TREE_CODE (decl) == FUNCTION_DECL)
7021 && DECL_RTL_SET_P (decl))
7022 make_decl_rtl (decl);
7028 /* Handle an "tls_model" attribute; arguments as in
7029 struct attribute_spec.handler. */
7032 handle_tls_model_attribute (tree *node, tree name, tree args,
7033 int ARG_UNUSED (flags), bool *no_add_attrs)
7037 enum tls_model kind;
7039 *no_add_attrs = true;
7041 if (TREE_CODE (decl) != VAR_DECL || !DECL_THREAD_LOCAL_P (decl))
7043 warning (OPT_Wattributes, "%qE attribute ignored", name);
7047 kind = DECL_TLS_MODEL (decl);
7048 id = TREE_VALUE (args);
7049 if (TREE_CODE (id) != STRING_CST)
7051 error ("tls_model argument not a string");
7055 if (!strcmp (TREE_STRING_POINTER (id), "local-exec"))
7056 kind = TLS_MODEL_LOCAL_EXEC;
7057 else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec"))
7058 kind = TLS_MODEL_INITIAL_EXEC;
7059 else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic"))
7060 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
7061 else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
7062 kind = TLS_MODEL_GLOBAL_DYNAMIC;
7064 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7066 DECL_TLS_MODEL (decl) = kind;
7070 /* Handle a "no_instrument_function" attribute; arguments as in
7071 struct attribute_spec.handler. */
7074 handle_no_instrument_function_attribute (tree *node, tree name,
7075 tree ARG_UNUSED (args),
7076 int ARG_UNUSED (flags),
7081 if (TREE_CODE (decl) != FUNCTION_DECL)
7083 error_at (DECL_SOURCE_LOCATION (decl),
7084 "%qE attribute applies only to functions", name);
7085 *no_add_attrs = true;
7087 else if (DECL_INITIAL (decl))
7089 error_at (DECL_SOURCE_LOCATION (decl),
7090 "can%'t set %qE attribute after definition", name);
7091 *no_add_attrs = true;
7094 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
7099 /* Handle a "malloc" attribute; arguments as in
7100 struct attribute_spec.handler. */
7103 handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7104 int ARG_UNUSED (flags), bool *no_add_attrs)
7106 if (TREE_CODE (*node) == FUNCTION_DECL
7107 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node))))
7108 DECL_IS_MALLOC (*node) = 1;
7111 warning (OPT_Wattributes, "%qE attribute ignored", name);
7112 *no_add_attrs = true;
7118 /* Handle a "alloc_size" attribute; arguments as in
7119 struct attribute_spec.handler. */
7122 handle_alloc_size_attribute (tree *node, tree ARG_UNUSED (name), tree args,
7123 int ARG_UNUSED (flags), bool *no_add_attrs)
7125 unsigned arg_count = type_num_arguments (*node);
7126 for (; args; args = TREE_CHAIN (args))
7128 tree position = TREE_VALUE (args);
7130 if (TREE_CODE (position) != INTEGER_CST
7131 || TREE_INT_CST_HIGH (position)
7132 || TREE_INT_CST_LOW (position) < 1
7133 || TREE_INT_CST_LOW (position) > arg_count )
7135 warning (OPT_Wattributes,
7136 "alloc_size parameter outside range");
7137 *no_add_attrs = true;
7144 /* Handle a "fn spec" attribute; arguments as in
7145 struct attribute_spec.handler. */
7148 handle_fnspec_attribute (tree *node ATTRIBUTE_UNUSED, tree ARG_UNUSED (name),
7149 tree args, int ARG_UNUSED (flags),
7150 bool *no_add_attrs ATTRIBUTE_UNUSED)
7153 && TREE_CODE (TREE_VALUE (args)) == STRING_CST
7154 && !TREE_CHAIN (args));
7158 /* Handle a "returns_twice" attribute; arguments as in
7159 struct attribute_spec.handler. */
7162 handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7163 int ARG_UNUSED (flags), bool *no_add_attrs)
7165 if (TREE_CODE (*node) == FUNCTION_DECL)
7166 DECL_IS_RETURNS_TWICE (*node) = 1;
7169 warning (OPT_Wattributes, "%qE attribute ignored", name);
7170 *no_add_attrs = true;
7176 /* Handle a "no_limit_stack" attribute; arguments as in
7177 struct attribute_spec.handler. */
7180 handle_no_limit_stack_attribute (tree *node, tree name,
7181 tree ARG_UNUSED (args),
7182 int ARG_UNUSED (flags),
7187 if (TREE_CODE (decl) != FUNCTION_DECL)
7189 error_at (DECL_SOURCE_LOCATION (decl),
7190 "%qE attribute applies only to functions", name);
7191 *no_add_attrs = true;
7193 else if (DECL_INITIAL (decl))
7195 error_at (DECL_SOURCE_LOCATION (decl),
7196 "can%'t set %qE attribute after definition", name);
7197 *no_add_attrs = true;
7200 DECL_NO_LIMIT_STACK (decl) = 1;
7205 /* Handle a "pure" attribute; arguments as in
7206 struct attribute_spec.handler. */
7209 handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7210 int ARG_UNUSED (flags), bool *no_add_attrs)
7212 if (TREE_CODE (*node) == FUNCTION_DECL)
7213 DECL_PURE_P (*node) = 1;
7214 /* ??? TODO: Support types. */
7217 warning (OPT_Wattributes, "%qE attribute ignored", name);
7218 *no_add_attrs = true;
7224 /* Handle a "no vops" attribute; arguments as in
7225 struct attribute_spec.handler. */
7228 handle_novops_attribute (tree *node, tree ARG_UNUSED (name),
7229 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
7230 bool *ARG_UNUSED (no_add_attrs))
7232 gcc_assert (TREE_CODE (*node) == FUNCTION_DECL);
7233 DECL_IS_NOVOPS (*node) = 1;
7237 /* Handle a "deprecated" attribute; arguments as in
7238 struct attribute_spec.handler. */
7241 handle_deprecated_attribute (tree *node, tree name,
7242 tree args, int flags,
7245 tree type = NULL_TREE;
7247 tree what = NULL_TREE;
7250 *no_add_attrs = true;
7251 else if (TREE_CODE (TREE_VALUE (args)) != STRING_CST)
7253 error ("deprecated message is not a string");
7254 *no_add_attrs = true;
7260 type = TREE_TYPE (decl);
7262 if (TREE_CODE (decl) == TYPE_DECL
7263 || TREE_CODE (decl) == PARM_DECL
7264 || TREE_CODE (decl) == VAR_DECL
7265 || TREE_CODE (decl) == FUNCTION_DECL
7266 || TREE_CODE (decl) == FIELD_DECL)
7267 TREE_DEPRECATED (decl) = 1;
7271 else if (TYPE_P (*node))
7273 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
7274 *node = build_variant_type_copy (*node);
7275 TREE_DEPRECATED (*node) = 1;
7283 *no_add_attrs = true;
7284 if (type && TYPE_NAME (type))
7286 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
7287 what = TYPE_NAME (*node);
7288 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
7289 && DECL_NAME (TYPE_NAME (type)))
7290 what = DECL_NAME (TYPE_NAME (type));
7293 warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what);
7295 warning (OPT_Wattributes, "%qE attribute ignored", name);
7301 /* Handle a "vector_size" attribute; arguments as in
7302 struct attribute_spec.handler. */
7305 handle_vector_size_attribute (tree *node, tree name, tree args,
7306 int ARG_UNUSED (flags),
7309 unsigned HOST_WIDE_INT vecsize, nunits;
7310 enum machine_mode orig_mode;
7311 tree type = *node, new_type, size;
7313 *no_add_attrs = true;
7315 size = TREE_VALUE (args);
7317 if (!host_integerp (size, 1))
7319 warning (OPT_Wattributes, "%qE attribute ignored", name);
7323 /* Get the vector size (in bytes). */
7324 vecsize = tree_low_cst (size, 1);
7326 /* We need to provide for vector pointers, vector arrays, and
7327 functions returning vectors. For example:
7329 __attribute__((vector_size(16))) short *foo;
7331 In this case, the mode is SI, but the type being modified is
7332 HI, so we need to look further. */
7334 while (POINTER_TYPE_P (type)
7335 || TREE_CODE (type) == FUNCTION_TYPE
7336 || TREE_CODE (type) == METHOD_TYPE
7337 || TREE_CODE (type) == ARRAY_TYPE
7338 || TREE_CODE (type) == OFFSET_TYPE)
7339 type = TREE_TYPE (type);
7341 /* Get the mode of the type being modified. */
7342 orig_mode = TYPE_MODE (type);
7344 if ((!INTEGRAL_TYPE_P (type)
7345 && !SCALAR_FLOAT_TYPE_P (type)
7346 && !FIXED_POINT_TYPE_P (type))
7347 || (!SCALAR_FLOAT_MODE_P (orig_mode)
7348 && GET_MODE_CLASS (orig_mode) != MODE_INT
7349 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode))
7350 || !host_integerp (TYPE_SIZE_UNIT (type), 1)
7351 || TREE_CODE (type) == BOOLEAN_TYPE)
7353 error ("invalid vector type for attribute %qE", name);
7357 if (vecsize % tree_low_cst (TYPE_SIZE_UNIT (type), 1))
7359 error ("vector size not an integral multiple of component size");
7365 error ("zero vector size");
7369 /* Calculate how many units fit in the vector. */
7370 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
7371 if (nunits & (nunits - 1))
7373 error ("number of components of the vector not a power of two");
7377 new_type = build_vector_type (type, nunits);
7379 /* Build back pointers if needed. */
7380 *node = lang_hooks.types.reconstruct_complex_type (*node, new_type);
7385 /* Handle the "nonnull" attribute. */
7387 handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
7388 tree args, int ARG_UNUSED (flags),
7392 unsigned HOST_WIDE_INT attr_arg_num;
7394 /* If no arguments are specified, all pointer arguments should be
7395 non-null. Verify a full prototype is given so that the arguments
7396 will have the correct types when we actually check them later. */
7399 if (!TYPE_ARG_TYPES (type))
7401 error ("nonnull attribute without arguments on a non-prototype");
7402 *no_add_attrs = true;
7407 /* Argument list specified. Verify that each argument number references
7408 a pointer argument. */
7409 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
7412 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
7414 if (!get_nonnull_operand (TREE_VALUE (args), &arg_num))
7416 error ("nonnull argument has invalid operand number (argument %lu)",
7417 (unsigned long) attr_arg_num);
7418 *no_add_attrs = true;
7422 argument = TYPE_ARG_TYPES (type);
7425 for (ck_num = 1; ; ck_num++)
7427 if (!argument || ck_num == arg_num)
7429 argument = TREE_CHAIN (argument);
7433 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
7435 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
7436 (unsigned long) attr_arg_num, (unsigned long) arg_num);
7437 *no_add_attrs = true;
7441 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
7443 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
7444 (unsigned long) attr_arg_num, (unsigned long) arg_num);
7445 *no_add_attrs = true;
7454 /* Check the argument list of a function call for null in argument slots
7455 that are marked as requiring a non-null pointer argument. The NARGS
7456 arguments are passed in the array ARGARRAY.
7460 check_function_nonnull (tree attrs, int nargs, tree *argarray)
7465 for (a = attrs; a; a = TREE_CHAIN (a))
7467 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
7469 args = TREE_VALUE (a);
7471 /* Walk the argument list. If we encounter an argument number we
7472 should check for non-null, do it. If the attribute has no args,
7473 then every pointer argument is checked (in which case the check
7474 for pointer type is done in check_nonnull_arg). */
7475 for (i = 0; i < nargs; i++)
7477 if (!args || nonnull_check_p (args, i + 1))
7478 check_function_arguments_recurse (check_nonnull_arg, NULL,
7486 /* Check that the Nth argument of a function call (counting backwards
7487 from the end) is a (pointer)0. The NARGS arguments are passed in the
7491 check_function_sentinel (tree attrs, int nargs, tree *argarray, tree typelist)
7493 tree attr = lookup_attribute ("sentinel", attrs);
7501 /* Skip over the named arguments. */
7502 while (typelist && len < nargs)
7504 typelist = TREE_CHAIN (typelist);
7508 if (TREE_VALUE (attr))
7510 tree p = TREE_VALUE (TREE_VALUE (attr));
7511 pos = TREE_INT_CST_LOW (p);
7514 /* The sentinel must be one of the varargs, i.e.
7515 in position >= the number of fixed arguments. */
7516 if ((nargs - 1 - pos) < len)
7518 warning (OPT_Wformat,
7519 "not enough variable arguments to fit a sentinel");
7523 /* Validate the sentinel. */
7524 sentinel = argarray[nargs - 1 - pos];
7525 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel))
7526 || !integer_zerop (sentinel))
7527 /* Although __null (in C++) is only an integer we allow it
7528 nevertheless, as we are guaranteed that it's exactly
7529 as wide as a pointer, and we don't want to force
7530 users to cast the NULL they have written there.
7531 We warn with -Wstrict-null-sentinel, though. */
7532 && (warn_strict_null_sentinel || null_node != sentinel))
7533 warning (OPT_Wformat, "missing sentinel in function call");
7537 /* Helper for check_function_nonnull; given a list of operands which
7538 must be non-null in ARGS, determine if operand PARAM_NUM should be
7542 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
7544 unsigned HOST_WIDE_INT arg_num = 0;
7546 for (; args; args = TREE_CHAIN (args))
7548 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
7552 if (arg_num == param_num)
7558 /* Check that the function argument PARAM (which is operand number
7559 PARAM_NUM) is non-null. This is called by check_function_nonnull
7560 via check_function_arguments_recurse. */
7563 check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
7564 unsigned HOST_WIDE_INT param_num)
7566 /* Just skip checking the argument if it's not a pointer. This can
7567 happen if the "nonnull" attribute was given without an operand
7568 list (which means to check every pointer argument). */
7570 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
7573 if (integer_zerop (param))
7574 warning (OPT_Wnonnull, "null argument where non-null required "
7575 "(argument %lu)", (unsigned long) param_num);
7578 /* Helper for nonnull attribute handling; fetch the operand number
7579 from the attribute argument list. */
7582 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
7584 /* Verify the arg number is a constant. */
7585 if (TREE_CODE (arg_num_expr) != INTEGER_CST
7586 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
7589 *valp = TREE_INT_CST_LOW (arg_num_expr);
7593 /* Handle a "nothrow" attribute; arguments as in
7594 struct attribute_spec.handler. */
7597 handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7598 int ARG_UNUSED (flags), bool *no_add_attrs)
7600 if (TREE_CODE (*node) == FUNCTION_DECL)
7601 TREE_NOTHROW (*node) = 1;
7602 /* ??? TODO: Support types. */
7605 warning (OPT_Wattributes, "%qE attribute ignored", name);
7606 *no_add_attrs = true;
7612 /* Handle a "cleanup" attribute; arguments as in
7613 struct attribute_spec.handler. */
7616 handle_cleanup_attribute (tree *node, tree name, tree args,
7617 int ARG_UNUSED (flags), bool *no_add_attrs)
7620 tree cleanup_id, cleanup_decl;
7622 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
7623 for global destructors in C++. This requires infrastructure that
7624 we don't have generically at the moment. It's also not a feature
7625 we'd be missing too much, since we do have attribute constructor. */
7626 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
7628 warning (OPT_Wattributes, "%qE attribute ignored", name);
7629 *no_add_attrs = true;
7633 /* Verify that the argument is a function in scope. */
7634 /* ??? We could support pointers to functions here as well, if
7635 that was considered desirable. */
7636 cleanup_id = TREE_VALUE (args);
7637 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
7639 error ("cleanup argument not an identifier");
7640 *no_add_attrs = true;
7643 cleanup_decl = lookup_name (cleanup_id);
7644 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
7646 error ("cleanup argument not a function");
7647 *no_add_attrs = true;
7651 /* That the function has proper type is checked with the
7652 eventual call to build_function_call. */
7657 /* Handle a "warn_unused_result" attribute. No special handling. */
7660 handle_warn_unused_result_attribute (tree *node, tree name,
7661 tree ARG_UNUSED (args),
7662 int ARG_UNUSED (flags), bool *no_add_attrs)
7664 /* Ignore the attribute for functions not returning any value. */
7665 if (VOID_TYPE_P (TREE_TYPE (*node)))
7667 warning (OPT_Wattributes, "%qE attribute ignored", name);
7668 *no_add_attrs = true;
7674 /* Handle a "sentinel" attribute. */
7677 handle_sentinel_attribute (tree *node, tree name, tree args,
7678 int ARG_UNUSED (flags), bool *no_add_attrs)
7680 tree params = TYPE_ARG_TYPES (*node);
7684 warning (OPT_Wattributes,
7685 "%qE attribute requires prototypes with named arguments", name);
7686 *no_add_attrs = true;
7690 while (TREE_CHAIN (params))
7691 params = TREE_CHAIN (params);
7693 if (VOID_TYPE_P (TREE_VALUE (params)))
7695 warning (OPT_Wattributes,
7696 "%qE attribute only applies to variadic functions", name);
7697 *no_add_attrs = true;
7703 tree position = TREE_VALUE (args);
7705 if (TREE_CODE (position) != INTEGER_CST)
7707 warning (OPT_Wattributes,
7708 "requested position is not an integer constant");
7709 *no_add_attrs = true;
7713 if (tree_int_cst_lt (position, integer_zero_node))
7715 warning (OPT_Wattributes,
7716 "requested position is less than zero");
7717 *no_add_attrs = true;
7725 /* Handle a "type_generic" attribute. */
7728 handle_type_generic_attribute (tree *node, tree ARG_UNUSED (name),
7729 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
7730 bool * ARG_UNUSED (no_add_attrs))
7734 /* Ensure we have a function type. */
7735 gcc_assert (TREE_CODE (*node) == FUNCTION_TYPE);
7737 params = TYPE_ARG_TYPES (*node);
7738 while (params && ! VOID_TYPE_P (TREE_VALUE (params)))
7739 params = TREE_CHAIN (params);
7741 /* Ensure we have a variadic function. */
7742 gcc_assert (!params);
7747 /* Handle a "target" attribute. */
7750 handle_target_attribute (tree *node, tree name, tree args, int flags,
7753 /* Ensure we have a function type. */
7754 if (TREE_CODE (*node) != FUNCTION_DECL)
7756 warning (OPT_Wattributes, "%qE attribute ignored", name);
7757 *no_add_attrs = true;
7759 else if (! targetm.target_option.valid_attribute_p (*node, name, args,
7761 *no_add_attrs = true;
7766 /* Arguments being collected for optimization. */
7767 typedef const char *const_char_p; /* For DEF_VEC_P. */
7768 DEF_VEC_P(const_char_p);
7769 DEF_VEC_ALLOC_P(const_char_p, gc);
7770 static GTY(()) VEC(const_char_p, gc) *optimize_args;
7773 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
7774 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
7775 false for #pragma GCC optimize. */
7778 parse_optimize_options (tree args, bool attr_p)
7783 int saved_flag_strict_aliasing;
7784 const char **opt_argv;
7787 /* Build up argv vector. Just in case the string is stored away, use garbage
7788 collected strings. */
7789 VEC_truncate (const_char_p, optimize_args, 0);
7790 VEC_safe_push (const_char_p, gc, optimize_args, NULL);
7792 for (ap = args; ap != NULL_TREE; ap = TREE_CHAIN (ap))
7794 tree value = TREE_VALUE (ap);
7796 if (TREE_CODE (value) == INTEGER_CST)
7799 sprintf (buffer, "-O%ld", (long) TREE_INT_CST_LOW (value));
7800 VEC_safe_push (const_char_p, gc, optimize_args, ggc_strdup (buffer));
7803 else if (TREE_CODE (value) == STRING_CST)
7805 /* Split string into multiple substrings. */
7806 size_t len = TREE_STRING_LENGTH (value);
7807 char *p = ASTRDUP (TREE_STRING_POINTER (value));
7808 char *end = p + len;
7812 while (next_p != NULL)
7818 comma = strchr (p, ',');
7831 r = q = (char *) ggc_alloc (len2 + 3);
7833 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
7835 if (*p == '-' && p[1] != 'O' && p[1] != 'f')
7839 warning (OPT_Wattributes,
7840 "Bad option %s to optimize attribute.", p);
7842 warning (OPT_Wpragmas,
7843 "Bad option %s to pragma attribute", p);
7851 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
7852 itself is -Os, and any other switch begins with a -f. */
7853 if ((*p >= '0' && *p <= '9')
7854 || (p[0] == 's' && p[1] == '\0'))
7860 memcpy (r, p, len2);
7862 VEC_safe_push (const_char_p, gc, optimize_args, q);
7868 opt_argc = VEC_length (const_char_p, optimize_args);
7869 opt_argv = (const char **) alloca (sizeof (char *) * (opt_argc + 1));
7871 for (i = 1; i < opt_argc; i++)
7872 opt_argv[i] = VEC_index (const_char_p, optimize_args, i);
7874 saved_flag_strict_aliasing = flag_strict_aliasing;
7876 /* Now parse the options. */
7877 decode_options (opt_argc, opt_argv);
7879 targetm.override_options_after_change();
7881 /* Don't allow changing -fstrict-aliasing. */
7882 flag_strict_aliasing = saved_flag_strict_aliasing;
7884 VEC_truncate (const_char_p, optimize_args, 0);
7888 /* For handling "optimize" attribute. arguments as in
7889 struct attribute_spec.handler. */
7892 handle_optimize_attribute (tree *node, tree name, tree args,
7893 int ARG_UNUSED (flags), bool *no_add_attrs)
7895 /* Ensure we have a function type. */
7896 if (TREE_CODE (*node) != FUNCTION_DECL)
7898 warning (OPT_Wattributes, "%qE attribute ignored", name);
7899 *no_add_attrs = true;
7903 struct cl_optimization cur_opts;
7904 tree old_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node);
7906 /* Save current options. */
7907 cl_optimization_save (&cur_opts);
7909 /* If we previously had some optimization options, use them as the
7912 cl_optimization_restore (TREE_OPTIMIZATION (old_opts));
7914 /* Parse options, and update the vector. */
7915 parse_optimize_options (args, true);
7916 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node)
7917 = build_optimization_node ();
7919 /* Restore current options. */
7920 cl_optimization_restore (&cur_opts);
7926 /* Check for valid arguments being passed to a function.
7927 ATTRS is a list of attributes. There are NARGS arguments in the array
7928 ARGARRAY. TYPELIST is the list of argument types for the function.
7931 check_function_arguments (tree attrs, int nargs, tree *argarray, tree typelist)
7933 /* Check for null being passed in a pointer argument that must be
7934 non-null. We also need to do this if format checking is enabled. */
7937 check_function_nonnull (attrs, nargs, argarray);
7939 /* Check for errors in format strings. */
7941 if (warn_format || warn_missing_format_attribute)
7942 check_function_format (attrs, nargs, argarray);
7945 check_function_sentinel (attrs, nargs, argarray, typelist);
7948 /* Generic argument checking recursion routine. PARAM is the argument to
7949 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
7950 once the argument is resolved. CTX is context for the callback. */
7952 check_function_arguments_recurse (void (*callback)
7953 (void *, tree, unsigned HOST_WIDE_INT),
7954 void *ctx, tree param,
7955 unsigned HOST_WIDE_INT param_num)
7957 if (CONVERT_EXPR_P (param)
7958 && (TYPE_PRECISION (TREE_TYPE (param))
7959 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0)))))
7961 /* Strip coercion. */
7962 check_function_arguments_recurse (callback, ctx,
7963 TREE_OPERAND (param, 0), param_num);
7967 if (TREE_CODE (param) == CALL_EXPR)
7969 tree type = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param)));
7971 bool found_format_arg = false;
7973 /* See if this is a call to a known internationalization function
7974 that modifies a format arg. Such a function may have multiple
7975 format_arg attributes (for example, ngettext). */
7977 for (attrs = TYPE_ATTRIBUTES (type);
7979 attrs = TREE_CHAIN (attrs))
7980 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
7983 tree format_num_expr;
7986 call_expr_arg_iterator iter;
7988 /* Extract the argument number, which was previously checked
7990 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
7992 gcc_assert (TREE_CODE (format_num_expr) == INTEGER_CST
7993 && !TREE_INT_CST_HIGH (format_num_expr));
7995 format_num = TREE_INT_CST_LOW (format_num_expr);
7997 for (inner_arg = first_call_expr_arg (param, &iter), i = 1;
7999 inner_arg = next_call_expr_arg (&iter), i++)
8000 if (i == format_num)
8002 check_function_arguments_recurse (callback, ctx,
8003 inner_arg, param_num);
8004 found_format_arg = true;
8009 /* If we found a format_arg attribute and did a recursive check,
8010 we are done with checking this argument. Otherwise, we continue
8011 and this will be considered a non-literal. */
8012 if (found_format_arg)
8016 if (TREE_CODE (param) == COND_EXPR)
8018 /* Check both halves of the conditional expression. */
8019 check_function_arguments_recurse (callback, ctx,
8020 TREE_OPERAND (param, 1), param_num);
8021 check_function_arguments_recurse (callback, ctx,
8022 TREE_OPERAND (param, 2), param_num);
8026 (*callback) (ctx, param, param_num);
8029 /* Checks for a builtin function FNDECL that the number of arguments
8030 NARGS against the required number REQUIRED and issues an error if
8031 there is a mismatch. Returns true if the number of arguments is
8032 correct, otherwise false. */
8035 builtin_function_validate_nargs (tree fndecl, int nargs, int required)
8037 if (nargs < required)
8039 error_at (input_location,
8040 "not enough arguments to function %qE", fndecl);
8043 else if (nargs > required)
8045 error_at (input_location,
8046 "too many arguments to function %qE", fndecl);
8052 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
8053 Returns false if there was an error, otherwise true. */
8056 check_builtin_function_arguments (tree fndecl, int nargs, tree *args)
8058 if (!DECL_BUILT_IN (fndecl)
8059 || DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_NORMAL)
8062 switch (DECL_FUNCTION_CODE (fndecl))
8064 case BUILT_IN_CONSTANT_P:
8065 return builtin_function_validate_nargs (fndecl, nargs, 1);
8067 case BUILT_IN_ISFINITE:
8068 case BUILT_IN_ISINF:
8069 case BUILT_IN_ISINF_SIGN:
8070 case BUILT_IN_ISNAN:
8071 case BUILT_IN_ISNORMAL:
8072 if (builtin_function_validate_nargs (fndecl, nargs, 1))
8074 if (TREE_CODE (TREE_TYPE (args[0])) != REAL_TYPE)
8076 error ("non-floating-point argument in call to "
8077 "function %qE", fndecl);
8084 case BUILT_IN_ISGREATER:
8085 case BUILT_IN_ISGREATEREQUAL:
8086 case BUILT_IN_ISLESS:
8087 case BUILT_IN_ISLESSEQUAL:
8088 case BUILT_IN_ISLESSGREATER:
8089 case BUILT_IN_ISUNORDERED:
8090 if (builtin_function_validate_nargs (fndecl, nargs, 2))
8092 enum tree_code code0, code1;
8093 code0 = TREE_CODE (TREE_TYPE (args[0]));
8094 code1 = TREE_CODE (TREE_TYPE (args[1]));
8095 if (!((code0 == REAL_TYPE && code1 == REAL_TYPE)
8096 || (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
8097 || (code0 == INTEGER_TYPE && code1 == REAL_TYPE)))
8099 error ("non-floating-point arguments in call to "
8100 "function %qE", fndecl);
8107 case BUILT_IN_FPCLASSIFY:
8108 if (builtin_function_validate_nargs (fndecl, nargs, 6))
8113 if (TREE_CODE (args[i]) != INTEGER_CST)
8115 error ("non-const integer argument %u in call to function %qE",
8120 if (TREE_CODE (TREE_TYPE (args[5])) != REAL_TYPE)
8122 error ("non-floating-point argument in call to function %qE",
8135 /* Function to help qsort sort FIELD_DECLs by name order. */
8138 field_decl_cmp (const void *x_p, const void *y_p)
8140 const tree *const x = (const tree *const) x_p;
8141 const tree *const y = (const tree *const) y_p;
8143 if (DECL_NAME (*x) == DECL_NAME (*y))
8144 /* A nontype is "greater" than a type. */
8145 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
8146 if (DECL_NAME (*x) == NULL_TREE)
8148 if (DECL_NAME (*y) == NULL_TREE)
8150 if (DECL_NAME (*x) < DECL_NAME (*y))
8156 gt_pointer_operator new_value;
8160 /* This routine compares two fields like field_decl_cmp but using the
8161 pointer operator in resort_data. */
8164 resort_field_decl_cmp (const void *x_p, const void *y_p)
8166 const tree *const x = (const tree *const) x_p;
8167 const tree *const y = (const tree *const) y_p;
8169 if (DECL_NAME (*x) == DECL_NAME (*y))
8170 /* A nontype is "greater" than a type. */
8171 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
8172 if (DECL_NAME (*x) == NULL_TREE)
8174 if (DECL_NAME (*y) == NULL_TREE)
8177 tree d1 = DECL_NAME (*x);
8178 tree d2 = DECL_NAME (*y);
8179 resort_data.new_value (&d1, resort_data.cookie);
8180 resort_data.new_value (&d2, resort_data.cookie);
8187 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
8190 resort_sorted_fields (void *obj,
8191 void * ARG_UNUSED (orig_obj),
8192 gt_pointer_operator new_value,
8195 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
8196 resort_data.new_value = new_value;
8197 resort_data.cookie = cookie;
8198 qsort (&sf->elts[0], sf->len, sizeof (tree),
8199 resort_field_decl_cmp);
8202 /* Subroutine of c_parse_error.
8203 Return the result of concatenating LHS and RHS. RHS is really
8204 a string literal, its first character is indicated by RHS_START and
8205 RHS_SIZE is its length (including the terminating NUL character).
8207 The caller is responsible for deleting the returned pointer. */
8210 catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
8212 const int lhs_size = strlen (lhs);
8213 char *result = XNEWVEC (char, lhs_size + rhs_size);
8214 strncpy (result, lhs, lhs_size);
8215 strncpy (result + lhs_size, rhs_start, rhs_size);
8219 /* Issue the error given by GMSGID, indicating that it occurred before
8220 TOKEN, which had the associated VALUE. */
8223 c_parse_error (const char *gmsgid, enum cpp_ttype token_type,
8224 tree value, unsigned char token_flags)
8226 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
8228 char *message = NULL;
8230 if (token_type == CPP_EOF)
8231 message = catenate_messages (gmsgid, " at end of input");
8232 else if (token_type == CPP_CHAR
8233 || token_type == CPP_WCHAR
8234 || token_type == CPP_CHAR16
8235 || token_type == CPP_CHAR32)
8237 unsigned int val = TREE_INT_CST_LOW (value);
8256 if (val <= UCHAR_MAX && ISGRAPH (val))
8257 message = catenate_messages (gmsgid, " before %s'%c'");
8259 message = catenate_messages (gmsgid, " before %s'\\x%x'");
8261 error (message, prefix, val);
8265 else if (token_type == CPP_STRING
8266 || token_type == CPP_WSTRING
8267 || token_type == CPP_STRING16
8268 || token_type == CPP_STRING32
8269 || token_type == CPP_UTF8STRING)
8270 message = catenate_messages (gmsgid, " before string constant");
8271 else if (token_type == CPP_NUMBER)
8272 message = catenate_messages (gmsgid, " before numeric constant");
8273 else if (token_type == CPP_NAME)
8275 message = catenate_messages (gmsgid, " before %qE");
8276 error (message, value);
8280 else if (token_type == CPP_PRAGMA)
8281 message = catenate_messages (gmsgid, " before %<#pragma%>");
8282 else if (token_type == CPP_PRAGMA_EOL)
8283 message = catenate_messages (gmsgid, " before end of line");
8284 else if (token_type < N_TTYPES)
8286 message = catenate_messages (gmsgid, " before %qs token");
8287 error (message, cpp_type2name (token_type, token_flags));
8299 #undef catenate_messages
8302 /* Mapping for cpp message reasons to the options that enable them. */
8304 struct reason_option_codes_t
8306 const int reason; /* cpplib message reason. */
8307 const int option_code; /* gcc option that controls this message. */
8310 static const struct reason_option_codes_t option_codes[] = {
8311 {CPP_W_DEPRECATED, OPT_Wdeprecated},
8312 {CPP_W_COMMENTS, OPT_Wcomments},
8313 {CPP_W_TRIGRAPHS, OPT_Wtrigraphs},
8314 {CPP_W_MULTICHAR, OPT_Wmultichar},
8315 {CPP_W_TRADITIONAL, OPT_Wtraditional},
8316 {CPP_W_LONG_LONG, OPT_Wlong_long},
8317 {CPP_W_ENDIF_LABELS, OPT_Wendif_labels},
8318 {CPP_W_VARIADIC_MACROS, OPT_Wvariadic_macros},
8319 {CPP_W_BUILTIN_MACRO_REDEFINED, OPT_Wbuiltin_macro_redefined},
8320 {CPP_W_UNDEF, OPT_Wundef},
8321 {CPP_W_UNUSED_MACROS, OPT_Wunused_macros},
8322 {CPP_W_CXX_OPERATOR_NAMES, OPT_Wc___compat},
8323 {CPP_W_NORMALIZE, OPT_Wnormalized_},
8324 {CPP_W_INVALID_PCH, OPT_Winvalid_pch},
8325 {CPP_W_WARNING_DIRECTIVE, OPT_Wcpp},
8329 /* Return the gcc option code associated with the reason for a cpp
8330 message, or 0 if none. */
8333 c_option_controlling_cpp_error (int reason)
8335 const struct reason_option_codes_t *entry;
8337 for (entry = option_codes; entry->reason != CPP_W_NONE; entry++)
8339 if (entry->reason == reason)
8340 return entry->option_code;
8345 /* Callback from cpp_error for PFILE to print diagnostics from the
8346 preprocessor. The diagnostic is of type LEVEL, with REASON set
8347 to the reason code if LEVEL is represents a warning, at location
8348 LOCATION unless this is after lexing and the compiler's location
8349 should be used instead, with column number possibly overridden by
8350 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
8351 the arguments. Returns true if a diagnostic was emitted, false
8355 c_cpp_error (cpp_reader *pfile ATTRIBUTE_UNUSED, int level, int reason,
8356 location_t location, unsigned int column_override,
8357 const char *msg, va_list *ap)
8359 diagnostic_info diagnostic;
8360 diagnostic_t dlevel;
8361 int save_warn_system_headers = warn_system_headers;
8366 case CPP_DL_WARNING_SYSHDR:
8369 warn_system_headers = 1;
8371 case CPP_DL_WARNING:
8374 dlevel = DK_WARNING;
8376 case CPP_DL_PEDWARN:
8377 if (flag_no_output && !flag_pedantic_errors)
8379 dlevel = DK_PEDWARN;
8397 location = input_location;
8398 diagnostic_set_info_translated (&diagnostic, msg, ap,
8400 if (column_override)
8401 diagnostic_override_column (&diagnostic, column_override);
8402 diagnostic_override_option_index (&diagnostic,
8403 c_option_controlling_cpp_error (reason));
8404 ret = report_diagnostic (&diagnostic);
8405 if (level == CPP_DL_WARNING_SYSHDR)
8406 warn_system_headers = save_warn_system_headers;
8410 /* Convert a character from the host to the target execution character
8411 set. cpplib handles this, mostly. */
8414 c_common_to_target_charset (HOST_WIDE_INT c)
8416 /* Character constants in GCC proper are sign-extended under -fsigned-char,
8417 zero-extended under -fno-signed-char. cpplib insists that characters
8418 and character constants are always unsigned. Hence we must convert
8420 cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1);
8422 uc = cpp_host_to_exec_charset (parse_in, uc);
8424 if (flag_signed_char)
8425 return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE)
8426 >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE);
8431 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
8432 component references, with STOP_REF, or alternatively an INDIRECT_REF of
8433 NULL, at the bottom; much like the traditional rendering of offsetof as a
8434 macro. Returns the folded and properly cast result. */
8437 fold_offsetof_1 (tree expr, tree stop_ref)
8439 enum tree_code code = PLUS_EXPR;
8442 if (expr == stop_ref && TREE_CODE (expr) != ERROR_MARK)
8443 return size_zero_node;
8445 switch (TREE_CODE (expr))
8451 error ("cannot apply %<offsetof%> to static data member %qD", expr);
8452 return error_mark_node;
8456 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
8457 return error_mark_node;
8461 if (!integer_zerop (TREE_OPERAND (expr, 0)))
8463 error ("cannot apply %<offsetof%> to a non constant address");
8464 return error_mark_node;
8466 return size_zero_node;
8469 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
8470 if (base == error_mark_node)
8473 t = TREE_OPERAND (expr, 1);
8474 if (DECL_C_BIT_FIELD (t))
8476 error ("attempt to take address of bit-field structure "
8478 return error_mark_node;
8480 off = size_binop_loc (input_location, PLUS_EXPR, DECL_FIELD_OFFSET (t),
8481 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t),
8487 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
8488 if (base == error_mark_node)
8491 t = TREE_OPERAND (expr, 1);
8492 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) < 0)
8495 t = fold_build1_loc (input_location, NEGATE_EXPR, TREE_TYPE (t), t);
8497 t = convert (sizetype, t);
8498 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
8500 /* Check if the offset goes beyond the upper bound of the array. */
8501 if (code == PLUS_EXPR && TREE_CODE (t) == INTEGER_CST)
8503 tree upbound = array_ref_up_bound (expr);
8504 if (upbound != NULL_TREE
8505 && TREE_CODE (upbound) == INTEGER_CST
8506 && !tree_int_cst_equal (upbound,
8507 TYPE_MAX_VALUE (TREE_TYPE (upbound))))
8509 upbound = size_binop (PLUS_EXPR, upbound,
8510 build_int_cst (TREE_TYPE (upbound), 1));
8511 if (tree_int_cst_lt (upbound, t))
8515 for (v = TREE_OPERAND (expr, 0);
8516 TREE_CODE (v) == COMPONENT_REF;
8517 v = TREE_OPERAND (v, 0))
8518 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v, 0)))
8521 tree fld_chain = TREE_CHAIN (TREE_OPERAND (v, 1));
8522 for (; fld_chain; fld_chain = TREE_CHAIN (fld_chain))
8523 if (TREE_CODE (fld_chain) == FIELD_DECL)
8529 /* Don't warn if the array might be considered a poor
8530 man's flexible array member with a very permissive
8531 definition thereof. */
8532 if (TREE_CODE (v) == ARRAY_REF
8533 || TREE_CODE (v) == COMPONENT_REF)
8534 warning (OPT_Warray_bounds,
8535 "index %E denotes an offset "
8536 "greater than size of %qT",
8537 t, TREE_TYPE (TREE_OPERAND (expr, 0)));
8544 /* Handle static members of volatile structs. */
8545 t = TREE_OPERAND (expr, 1);
8546 gcc_assert (TREE_CODE (t) == VAR_DECL);
8547 return fold_offsetof_1 (t, stop_ref);
8553 return size_binop (code, base, off);
8557 fold_offsetof (tree expr, tree stop_ref)
8559 /* Convert back from the internal sizetype to size_t. */
8560 return convert (size_type_node, fold_offsetof_1 (expr, stop_ref));
8563 /* Print an error message for an invalid lvalue. USE says
8564 how the lvalue is being used and so selects the error message. */
8567 lvalue_error (enum lvalue_use use)
8572 error ("lvalue required as left operand of assignment");
8575 error ("lvalue required as increment operand");
8578 error ("lvalue required as decrement operand");
8581 error ("lvalue required as unary %<&%> operand");
8584 error ("lvalue required in asm statement");
8591 /* *PTYPE is an incomplete array. Complete it with a domain based on
8592 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
8593 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8594 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
8597 complete_array_type (tree *ptype, tree initial_value, bool do_default)
8599 tree maxindex, type, main_type, elt, unqual_elt;
8600 int failure = 0, quals;
8601 hashval_t hashcode = 0;
8603 maxindex = size_zero_node;
8606 if (TREE_CODE (initial_value) == STRING_CST)
8609 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8610 maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1);
8612 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8614 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initial_value);
8616 if (VEC_empty (constructor_elt, v))
8620 maxindex = integer_minus_one_node;
8625 unsigned HOST_WIDE_INT cnt;
8626 constructor_elt *ce;
8627 bool fold_p = false;
8629 if (VEC_index (constructor_elt, v, 0)->index)
8630 maxindex = fold_convert_loc (input_location, sizetype,
8631 VEC_index (constructor_elt,
8633 curindex = maxindex;
8636 VEC_iterate (constructor_elt, v, cnt, ce);
8639 bool curfold_p = false;
8641 curindex = ce->index, curfold_p = true;
8645 curindex = fold_convert (sizetype, curindex);
8646 curindex = size_binop (PLUS_EXPR, curindex,
8649 if (tree_int_cst_lt (maxindex, curindex))
8650 maxindex = curindex, fold_p = curfold_p;
8653 maxindex = fold_convert (sizetype, maxindex);
8658 /* Make an error message unless that happened already. */
8659 if (initial_value != error_mark_node)
8671 elt = TREE_TYPE (type);
8672 quals = TYPE_QUALS (strip_array_types (elt));
8676 unqual_elt = c_build_qualified_type (elt, KEEP_QUAL_ADDR_SPACE (quals));
8678 /* Using build_distinct_type_copy and modifying things afterward instead
8679 of using build_array_type to create a new type preserves all of the
8680 TYPE_LANG_FLAG_? bits that the front end may have set. */
8681 main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
8682 TREE_TYPE (main_type) = unqual_elt;
8683 TYPE_DOMAIN (main_type) = build_index_type (maxindex);
8684 layout_type (main_type);
8686 /* Make sure we have the canonical MAIN_TYPE. */
8687 hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode);
8688 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)),
8690 main_type = type_hash_canon (hashcode, main_type);
8692 /* Fix the canonical type. */
8693 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type))
8694 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type)))
8695 SET_TYPE_STRUCTURAL_EQUALITY (main_type);
8696 else if (TYPE_CANONICAL (TREE_TYPE (main_type)) != TREE_TYPE (main_type)
8697 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type))
8698 != TYPE_DOMAIN (main_type)))
8699 TYPE_CANONICAL (main_type)
8700 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type)),
8701 TYPE_CANONICAL (TYPE_DOMAIN (main_type)));
8703 TYPE_CANONICAL (main_type) = main_type;
8708 type = c_build_qualified_type (main_type, quals);
8710 if (COMPLETE_TYPE_P (type)
8711 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST
8712 && TREE_OVERFLOW (TYPE_SIZE_UNIT (type)))
8714 error ("size of array is too large");
8715 /* If we proceed with the array type as it is, we'll eventually
8716 crash in tree_low_cst(). */
8717 type = error_mark_node;
8725 /* Used to help initialize the builtin-types.def table. When a type of
8726 the correct size doesn't exist, use error_mark_node instead of NULL.
8727 The later results in segfaults even when a decl using the type doesn't
8731 builtin_type_for_size (int size, bool unsignedp)
8733 tree type = lang_hooks.types.type_for_size (size, unsignedp);
8734 return type ? type : error_mark_node;
8737 /* A helper function for resolve_overloaded_builtin in resolving the
8738 overloaded __sync_ builtins. Returns a positive power of 2 if the
8739 first operand of PARAMS is a pointer to a supported data type.
8740 Returns 0 if an error is encountered. */
8743 sync_resolve_size (tree function, VEC(tree,gc) *params)
8748 if (VEC_empty (tree, params))
8750 error ("too few arguments to function %qE", function);
8754 type = TREE_TYPE (VEC_index (tree, params, 0));
8755 if (TREE_CODE (type) != POINTER_TYPE)
8758 type = TREE_TYPE (type);
8759 if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type))
8762 size = tree_low_cst (TYPE_SIZE_UNIT (type), 1);
8763 if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16)
8767 error ("incompatible type for argument %d of %qE", 1, function);
8771 /* A helper function for resolve_overloaded_builtin. Adds casts to
8772 PARAMS to make arguments match up with those of FUNCTION. Drops
8773 the variadic arguments at the end. Returns false if some error
8774 was encountered; true on success. */
8777 sync_resolve_params (tree orig_function, tree function, VEC(tree, gc) *params)
8779 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (function));
8781 unsigned int parmnum;
8783 /* We've declared the implementation functions to use "volatile void *"
8784 as the pointer parameter, so we shouldn't get any complaints from the
8785 call to check_function_arguments what ever type the user used. */
8786 arg_types = TREE_CHAIN (arg_types);
8787 ptype = TREE_TYPE (TREE_TYPE (VEC_index (tree, params, 0)));
8789 /* For the rest of the values, we need to cast these to FTYPE, so that we
8790 don't get warnings for passing pointer types, etc. */
8792 while (arg_types != void_list_node)
8797 if (VEC_length (tree, params) <= parmnum)
8799 error ("too few arguments to function %qE", orig_function);
8803 /* ??? Ideally for the first conversion we'd use convert_for_assignment
8804 so that we get warnings for anything that doesn't match the pointer
8805 type. This isn't portable across the C and C++ front ends atm. */
8806 val = VEC_index (tree, params, parmnum);
8807 val = convert (ptype, val);
8808 val = convert (TREE_VALUE (arg_types), val);
8809 VEC_replace (tree, params, parmnum, val);
8811 arg_types = TREE_CHAIN (arg_types);
8814 /* The definition of these primitives is variadic, with the remaining
8815 being "an optional list of variables protected by the memory barrier".
8816 No clue what that's supposed to mean, precisely, but we consider all
8817 call-clobbered variables to be protected so we're safe. */
8818 VEC_truncate (tree, params, parmnum + 1);
8823 /* A helper function for resolve_overloaded_builtin. Adds a cast to
8824 RESULT to make it match the type of the first pointer argument in
8828 sync_resolve_return (tree first_param, tree result)
8830 tree ptype = TREE_TYPE (TREE_TYPE (first_param));
8831 ptype = TYPE_MAIN_VARIANT (ptype);
8832 return convert (ptype, result);
8835 /* Some builtin functions are placeholders for other expressions. This
8836 function should be called immediately after parsing the call expression
8837 before surrounding code has committed to the type of the expression.
8839 LOC is the location of the builtin call.
8841 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
8842 PARAMS is the argument list for the call. The return value is non-null
8843 when expansion is complete, and null if normal processing should
8847 resolve_overloaded_builtin (location_t loc, tree function, VEC(tree,gc) *params)
8849 enum built_in_function orig_code = DECL_FUNCTION_CODE (function);
8850 switch (DECL_BUILT_IN_CLASS (function))
8852 case BUILT_IN_NORMAL:
8855 if (targetm.resolve_overloaded_builtin)
8856 return targetm.resolve_overloaded_builtin (loc, function, params);
8863 /* Handle BUILT_IN_NORMAL here. */
8866 case BUILT_IN_FETCH_AND_ADD_N:
8867 case BUILT_IN_FETCH_AND_SUB_N:
8868 case BUILT_IN_FETCH_AND_OR_N:
8869 case BUILT_IN_FETCH_AND_AND_N:
8870 case BUILT_IN_FETCH_AND_XOR_N:
8871 case BUILT_IN_FETCH_AND_NAND_N:
8872 case BUILT_IN_ADD_AND_FETCH_N:
8873 case BUILT_IN_SUB_AND_FETCH_N:
8874 case BUILT_IN_OR_AND_FETCH_N:
8875 case BUILT_IN_AND_AND_FETCH_N:
8876 case BUILT_IN_XOR_AND_FETCH_N:
8877 case BUILT_IN_NAND_AND_FETCH_N:
8878 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N:
8879 case BUILT_IN_VAL_COMPARE_AND_SWAP_N:
8880 case BUILT_IN_LOCK_TEST_AND_SET_N:
8881 case BUILT_IN_LOCK_RELEASE_N:
8883 int n = sync_resolve_size (function, params);
8884 tree new_function, first_param, result;
8887 return error_mark_node;
8889 new_function = built_in_decls[orig_code + exact_log2 (n) + 1];
8890 if (!sync_resolve_params (function, new_function, params))
8891 return error_mark_node;
8893 first_param = VEC_index (tree, params, 0);
8894 result = build_function_call_vec (loc, new_function, params, NULL);
8895 if (orig_code != BUILT_IN_BOOL_COMPARE_AND_SWAP_N
8896 && orig_code != BUILT_IN_LOCK_RELEASE_N)
8897 result = sync_resolve_return (first_param, result);
8907 /* Ignoring their sign, return true if two scalar types are the same. */
8909 same_scalar_type_ignoring_signedness (tree t1, tree t2)
8911 enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2);
8913 gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE || c1 == FIXED_POINT_TYPE)
8914 && (c2 == INTEGER_TYPE || c2 == REAL_TYPE
8915 || c2 == FIXED_POINT_TYPE));
8917 /* Equality works here because c_common_signed_type uses
8918 TYPE_MAIN_VARIANT. */
8919 return c_common_signed_type (t1)
8920 == c_common_signed_type (t2);
8923 /* Check for missing format attributes on function pointers. LTYPE is
8924 the new type or left-hand side type. RTYPE is the old type or
8925 right-hand side type. Returns TRUE if LTYPE is missing the desired
8929 check_missing_format_attribute (tree ltype, tree rtype)
8931 tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype);
8934 for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra))
8935 if (is_attribute_p ("format", TREE_PURPOSE (ra)))
8940 for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la))
8941 if (is_attribute_p ("format", TREE_PURPOSE (la)))
8949 /* Subscripting with type char is likely to lose on a machine where
8950 chars are signed. So warn on any machine, but optionally. Don't
8951 warn for unsigned char since that type is safe. Don't warn for
8952 signed char because anyone who uses that must have done so
8953 deliberately. Furthermore, we reduce the false positive load by
8954 warning only for non-constant value of type char. */
8957 warn_array_subscript_with_type_char (tree index)
8959 if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node
8960 && TREE_CODE (index) != INTEGER_CST)
8961 warning (OPT_Wchar_subscripts, "array subscript has type %<char%>");
8964 /* Implement -Wparentheses for the unexpected C precedence rules, to
8965 cover cases like x + y << z which readers are likely to
8966 misinterpret. We have seen an expression in which CODE is a binary
8967 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
8968 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
8969 CODE_RIGHT may be ERROR_MARK, which means that that side of the
8970 expression was not formed using a binary or unary operator, or it
8971 was enclosed in parentheses. */
8974 warn_about_parentheses (enum tree_code code,
8975 enum tree_code code_left, tree arg_left,
8976 enum tree_code code_right, tree arg_right)
8978 if (!warn_parentheses)
8981 /* This macro tests that the expression ARG with original tree code
8982 CODE appears to be a boolean expression. or the result of folding a
8983 boolean expression. */
8984 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
8985 (truth_value_p (TREE_CODE (ARG)) \
8986 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
8987 /* Folding may create 0 or 1 integers from other expressions. */ \
8988 || ((CODE) != INTEGER_CST \
8989 && (integer_onep (ARG) || integer_zerop (ARG))))
8994 if (code_left == PLUS_EXPR || code_right == PLUS_EXPR)
8995 warning (OPT_Wparentheses,
8996 "suggest parentheses around %<+%> inside %<<<%>");
8997 else if (code_left == MINUS_EXPR || code_right == MINUS_EXPR)
8998 warning (OPT_Wparentheses,
8999 "suggest parentheses around %<-%> inside %<<<%>");
9003 if (code_left == PLUS_EXPR || code_right == PLUS_EXPR)
9004 warning (OPT_Wparentheses,
9005 "suggest parentheses around %<+%> inside %<>>%>");
9006 else if (code_left == MINUS_EXPR || code_right == MINUS_EXPR)
9007 warning (OPT_Wparentheses,
9008 "suggest parentheses around %<-%> inside %<>>%>");
9011 case TRUTH_ORIF_EXPR:
9012 if (code_left == TRUTH_ANDIF_EXPR || code_right == TRUTH_ANDIF_EXPR)
9013 warning (OPT_Wparentheses,
9014 "suggest parentheses around %<&&%> within %<||%>");
9018 if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR
9019 || code_left == PLUS_EXPR || code_left == MINUS_EXPR
9020 || code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR
9021 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
9022 warning (OPT_Wparentheses,
9023 "suggest parentheses around arithmetic in operand of %<|%>");
9024 /* Check cases like x|y==z */
9025 else if (TREE_CODE_CLASS (code_left) == tcc_comparison
9026 || TREE_CODE_CLASS (code_right) == tcc_comparison)
9027 warning (OPT_Wparentheses,
9028 "suggest parentheses around comparison in operand of %<|%>");
9029 /* Check cases like !x | y */
9030 else if (code_left == TRUTH_NOT_EXPR
9031 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
9032 warning (OPT_Wparentheses, "suggest parentheses around operand of "
9033 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
9037 if (code_left == BIT_AND_EXPR
9038 || code_left == PLUS_EXPR || code_left == MINUS_EXPR
9039 || code_right == BIT_AND_EXPR
9040 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
9041 warning (OPT_Wparentheses,
9042 "suggest parentheses around arithmetic in operand of %<^%>");
9043 /* Check cases like x^y==z */
9044 else if (TREE_CODE_CLASS (code_left) == tcc_comparison
9045 || TREE_CODE_CLASS (code_right) == tcc_comparison)
9046 warning (OPT_Wparentheses,
9047 "suggest parentheses around comparison in operand of %<^%>");
9051 if (code_left == PLUS_EXPR || code_right == PLUS_EXPR)
9052 warning (OPT_Wparentheses,
9053 "suggest parentheses around %<+%> in operand of %<&%>");
9054 else if (code_left == MINUS_EXPR || code_right == MINUS_EXPR)
9055 warning (OPT_Wparentheses,
9056 "suggest parentheses around %<-%> in operand of %<&%>");
9057 /* Check cases like x&y==z */
9058 else if (TREE_CODE_CLASS (code_left) == tcc_comparison
9059 || TREE_CODE_CLASS (code_right) == tcc_comparison)
9060 warning (OPT_Wparentheses,
9061 "suggest parentheses around comparison in operand of %<&%>");
9062 /* Check cases like !x & y */
9063 else if (code_left == TRUTH_NOT_EXPR
9064 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
9065 warning (OPT_Wparentheses, "suggest parentheses around operand of "
9066 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
9070 if (TREE_CODE_CLASS (code_left) == tcc_comparison
9071 || TREE_CODE_CLASS (code_right) == tcc_comparison)
9072 warning (OPT_Wparentheses,
9073 "suggest parentheses around comparison in operand of %<==%>");
9076 if (TREE_CODE_CLASS (code_left) == tcc_comparison
9077 || TREE_CODE_CLASS (code_right) == tcc_comparison)
9078 warning (OPT_Wparentheses,
9079 "suggest parentheses around comparison in operand of %<!=%>");
9083 if (TREE_CODE_CLASS (code) == tcc_comparison
9084 && ((TREE_CODE_CLASS (code_left) == tcc_comparison
9085 && code_left != NE_EXPR && code_left != EQ_EXPR
9086 && INTEGRAL_TYPE_P (TREE_TYPE (arg_left)))
9087 || (TREE_CODE_CLASS (code_right) == tcc_comparison
9088 && code_right != NE_EXPR && code_right != EQ_EXPR
9089 && INTEGRAL_TYPE_P (TREE_TYPE (arg_right)))))
9090 warning (OPT_Wparentheses, "comparisons like %<X<=Y<=Z%> do not "
9091 "have their mathematical meaning");
9094 #undef NOT_A_BOOLEAN_EXPR_P
9097 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
9100 warn_for_unused_label (tree label)
9102 if (!TREE_USED (label))
9104 if (DECL_INITIAL (label))
9105 warning (OPT_Wunused_label, "label %q+D defined but not used", label);
9107 warning (OPT_Wunused_label, "label %q+D declared but not defined", label);
9111 #ifndef TARGET_HAS_TARGETCM
9112 struct gcc_targetcm targetcm = TARGETCM_INITIALIZER;
9115 /* Warn for division by zero according to the value of DIVISOR. LOC
9116 is the location of the division operator. */
9119 warn_for_div_by_zero (location_t loc, tree divisor)
9121 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
9122 about division by zero. Do not issue a warning if DIVISOR has a
9123 floating-point type, since we consider 0.0/0.0 a valid way of
9124 generating a NaN. */
9125 if (c_inhibit_evaluation_warnings == 0
9126 && (integer_zerop (divisor) || fixed_zerop (divisor)))
9127 warning_at (loc, OPT_Wdiv_by_zero, "division by zero");
9130 /* Subroutine of build_binary_op. Give warnings for comparisons
9131 between signed and unsigned quantities that may fail. Do the
9132 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
9133 so that casts will be considered, but default promotions won't
9136 LOCATION is the location of the comparison operator.
9138 The arguments of this function map directly to local variables
9139 of build_binary_op. */
9142 warn_for_sign_compare (location_t location,
9143 tree orig_op0, tree orig_op1,
9145 tree result_type, enum tree_code resultcode)
9147 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
9148 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
9149 int unsignedp0, unsignedp1;
9151 /* In C++, check for comparison of different enum types. */
9153 && TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE
9154 && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE
9155 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0))
9156 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1)))
9158 warning_at (location,
9159 OPT_Wsign_compare, "comparison between types %qT and %qT",
9160 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1));
9163 /* Do not warn if the comparison is being done in a signed type,
9164 since the signed type will only be chosen if it can represent
9165 all the values of the unsigned type. */
9166 if (!TYPE_UNSIGNED (result_type))
9168 /* Do not warn if both operands are unsigned. */
9169 else if (op0_signed == op1_signed)
9173 tree sop, uop, base_type;
9177 sop = orig_op0, uop = orig_op1;
9179 sop = orig_op1, uop = orig_op0;
9181 STRIP_TYPE_NOPS (sop);
9182 STRIP_TYPE_NOPS (uop);
9183 base_type = (TREE_CODE (result_type) == COMPLEX_TYPE
9184 ? TREE_TYPE (result_type) : result_type);
9186 /* Do not warn if the signed quantity is an unsuffixed integer
9187 literal (or some static constant expression involving such
9188 literals or a conditional expression involving such literals)
9189 and it is non-negative. */
9190 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
9192 /* Do not warn if the comparison is an equality operation, the
9193 unsigned quantity is an integral constant, and it would fit
9194 in the result if the result were signed. */
9195 else if (TREE_CODE (uop) == INTEGER_CST
9196 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
9197 && int_fits_type_p (uop, c_common_signed_type (base_type)))
9199 /* In C, do not warn if the unsigned quantity is an enumeration
9200 constant and its maximum value would fit in the result if the
9201 result were signed. */
9202 else if (!c_dialect_cxx() && TREE_CODE (uop) == INTEGER_CST
9203 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
9204 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop)),
9205 c_common_signed_type (base_type)))
9208 warning_at (location,
9210 "comparison between signed and unsigned integer expressions");
9213 /* Warn if two unsigned values are being compared in a size larger
9214 than their original size, and one (and only one) is the result of
9215 a `~' operator. This comparison will always fail.
9217 Also warn if one operand is a constant, and the constant does not
9218 have all bits set that are set in the ~ operand when it is
9221 op0 = get_narrower (op0, &unsignedp0);
9222 op1 = get_narrower (op1, &unsignedp1);
9224 if ((TREE_CODE (op0) == BIT_NOT_EXPR)
9225 ^ (TREE_CODE (op1) == BIT_NOT_EXPR))
9227 if (TREE_CODE (op0) == BIT_NOT_EXPR)
9228 op0 = get_narrower (TREE_OPERAND (op0, 0), &unsignedp0);
9229 if (TREE_CODE (op1) == BIT_NOT_EXPR)
9230 op1 = get_narrower (TREE_OPERAND (op1, 0), &unsignedp1);
9232 if (host_integerp (op0, 0) || host_integerp (op1, 0))
9235 HOST_WIDE_INT constant, mask;
9239 if (host_integerp (op0, 0))
9242 unsignedp = unsignedp1;
9243 constant = tree_low_cst (op0, 0);
9248 unsignedp = unsignedp0;
9249 constant = tree_low_cst (op1, 0);
9252 bits = TYPE_PRECISION (TREE_TYPE (primop));
9253 if (bits < TYPE_PRECISION (result_type)
9254 && bits < HOST_BITS_PER_LONG && unsignedp)
9256 mask = (~ (HOST_WIDE_INT) 0) << bits;
9257 if ((mask & constant) != mask)
9260 warning (OPT_Wsign_compare,
9261 "promoted ~unsigned is always non-zero");
9263 warning_at (location, OPT_Wsign_compare,
9264 "comparison of promoted ~unsigned with constant");
9268 else if (unsignedp0 && unsignedp1
9269 && (TYPE_PRECISION (TREE_TYPE (op0))
9270 < TYPE_PRECISION (result_type))
9271 && (TYPE_PRECISION (TREE_TYPE (op1))
9272 < TYPE_PRECISION (result_type)))
9273 warning_at (location, OPT_Wsign_compare,
9274 "comparison of promoted ~unsigned with unsigned");
9278 /* Setup a TYPE_DECL node as a typedef representation.
9280 X is a TYPE_DECL for a typedef statement. Create a brand new
9281 ..._TYPE node (which will be just a variant of the existing
9282 ..._TYPE node with identical properties) and then install X
9283 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
9285 The whole point here is to end up with a situation where each
9286 and every ..._TYPE node the compiler creates will be uniquely
9287 associated with AT MOST one node representing a typedef name.
9288 This way, even though the compiler substitutes corresponding
9289 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
9290 early on, later parts of the compiler can always do the reverse
9291 translation and get back the corresponding typedef name. For
9294 typedef struct S MY_TYPE;
9297 Later parts of the compiler might only know that `object' was of
9298 type `struct S' if it were not for code just below. With this
9299 code however, later parts of the compiler see something like:
9301 struct S' == struct S
9302 typedef struct S' MY_TYPE;
9305 And they can then deduce (from the node for type struct S') that
9306 the original object declaration was:
9310 Being able to do this is important for proper support of protoize,
9311 and also for generating precise symbolic debugging information
9312 which takes full account of the programmer's (typedef) vocabulary.
9314 Obviously, we don't want to generate a duplicate ..._TYPE node if
9315 the TYPE_DECL node that we are now processing really represents a
9316 standard built-in type. */
9319 set_underlying_type (tree x)
9321 if (x == error_mark_node)
9323 if (DECL_IS_BUILTIN (x))
9325 if (TYPE_NAME (TREE_TYPE (x)) == 0)
9326 TYPE_NAME (TREE_TYPE (x)) = x;
9328 else if (TREE_TYPE (x) != error_mark_node
9329 && DECL_ORIGINAL_TYPE (x) == NULL_TREE)
9331 tree tt = TREE_TYPE (x);
9332 DECL_ORIGINAL_TYPE (x) = tt;
9333 tt = build_variant_type_copy (tt);
9334 TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
9336 TREE_USED (tt) = TREE_USED (x);
9341 /* Returns true if X is a typedef decl. */
9344 is_typedef_decl (tree x)
9346 return (x && TREE_CODE (x) == TYPE_DECL
9347 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
9350 /* Record the types used by the current global variable declaration
9351 being parsed, so that we can decide later to emit their debug info.
9352 Those types are in types_used_by_cur_var_decl, and we are going to
9353 store them in the types_used_by_vars_hash hash table.
9354 DECL is the declaration of the global variable that has been parsed. */
9357 record_types_used_by_current_var_decl (tree decl)
9359 gcc_assert (decl && DECL_P (decl) && TREE_STATIC (decl));
9361 if (types_used_by_cur_var_decl)
9364 for (node = types_used_by_cur_var_decl;
9366 node = TREE_CHAIN (node))
9368 tree type = TREE_PURPOSE (node);
9369 types_used_by_var_decl_insert (type, decl);
9371 types_used_by_cur_var_decl = NULL;
9375 /* The C and C++ parsers both use vectors to hold function arguments.
9376 For efficiency, we keep a cache of unused vectors. This is the
9379 typedef VEC(tree,gc)* tree_gc_vec;
9380 DEF_VEC_P(tree_gc_vec);
9381 DEF_VEC_ALLOC_P(tree_gc_vec,gc);
9382 static GTY((deletable)) VEC(tree_gc_vec,gc) *tree_vector_cache;
9384 /* Return a new vector from the cache. If the cache is empty,
9385 allocate a new vector. These vectors are GC'ed, so it is OK if the
9386 pointer is not released.. */
9389 make_tree_vector (void)
9391 if (!VEC_empty (tree_gc_vec, tree_vector_cache))
9392 return VEC_pop (tree_gc_vec, tree_vector_cache);
9395 /* Passing 0 to VEC_alloc returns NULL, and our callers require
9396 that we always return a non-NULL value. The vector code uses
9397 4 when growing a NULL vector, so we do too. */
9398 return VEC_alloc (tree, gc, 4);
9402 /* Release a vector of trees back to the cache. */
9405 release_tree_vector (VEC(tree,gc) *vec)
9409 VEC_truncate (tree, vec, 0);
9410 VEC_safe_push (tree_gc_vec, gc, tree_vector_cache, vec);
9414 /* Get a new tree vector holding a single tree. */
9417 make_tree_vector_single (tree t)
9419 VEC(tree,gc) *ret = make_tree_vector ();
9420 VEC_quick_push (tree, ret, t);
9424 /* Get a new tree vector which is a copy of an existing one. */
9427 make_tree_vector_copy (const VEC(tree,gc) *orig)
9433 ret = make_tree_vector ();
9434 VEC_reserve (tree, gc, ret, VEC_length (tree, orig));
9435 for (ix = 0; VEC_iterate (tree, orig, ix, t); ++ix)
9436 VEC_quick_push (tree, ret, t);
9440 #include "gt-c-common.h"