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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
35 #include "diagnostic.h"
40 #include "langhooks.h"
41 #include "tree-inline.h"
44 #include "tree-iterator.h"
46 #include "tree-mudflap.h"
50 #include "target-def.h"
52 #include "fixed-value.h"
54 cpp_reader *parse_in; /* Declared in c-pragma.h. */
56 /* We let tm.h override the types used here, to handle trivial differences
57 such as the choice of unsigned int or long unsigned int for size_t.
58 When machines start needing nontrivial differences in the size type,
59 it would be best to do something here to figure out automatically
60 from other information what type to use. */
63 #define SIZE_TYPE "long unsigned int"
67 #define PID_TYPE "int"
71 #define CHAR16_TYPE "short unsigned int"
75 #define CHAR32_TYPE "unsigned int"
79 #define WCHAR_TYPE "int"
82 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
83 #define MODIFIED_WCHAR_TYPE \
84 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
87 #define PTRDIFF_TYPE "long int"
91 #define WINT_TYPE "unsigned int"
95 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
97 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
103 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
105 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
106 ? "long unsigned int" \
107 : "long long unsigned int"))
110 /* The following symbols are subsumed in the c_global_trees array, and
111 listed here individually for documentation purposes.
113 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
115 tree short_integer_type_node;
116 tree long_integer_type_node;
117 tree long_long_integer_type_node;
119 tree short_unsigned_type_node;
120 tree long_unsigned_type_node;
121 tree long_long_unsigned_type_node;
123 tree truthvalue_type_node;
124 tree truthvalue_false_node;
125 tree truthvalue_true_node;
127 tree ptrdiff_type_node;
129 tree unsigned_char_type_node;
130 tree signed_char_type_node;
131 tree wchar_type_node;
132 tree signed_wchar_type_node;
133 tree unsigned_wchar_type_node;
135 tree char16_type_node;
136 tree char32_type_node;
138 tree float_type_node;
139 tree double_type_node;
140 tree long_double_type_node;
142 tree complex_integer_type_node;
143 tree complex_float_type_node;
144 tree complex_double_type_node;
145 tree complex_long_double_type_node;
147 tree dfloat32_type_node;
148 tree dfloat64_type_node;
149 tree_dfloat128_type_node;
151 tree intQI_type_node;
152 tree intHI_type_node;
153 tree intSI_type_node;
154 tree intDI_type_node;
155 tree intTI_type_node;
157 tree unsigned_intQI_type_node;
158 tree unsigned_intHI_type_node;
159 tree unsigned_intSI_type_node;
160 tree unsigned_intDI_type_node;
161 tree unsigned_intTI_type_node;
163 tree widest_integer_literal_type_node;
164 tree widest_unsigned_literal_type_node;
166 Nodes for types `void *' and `const void *'.
168 tree ptr_type_node, const_ptr_type_node;
170 Nodes for types `char *' and `const char *'.
172 tree string_type_node, const_string_type_node;
174 Type `char[SOMENUMBER]'.
175 Used when an array of char is needed and the size is irrelevant.
177 tree char_array_type_node;
179 Type `int[SOMENUMBER]' or something like it.
180 Used when an array of int needed and the size is irrelevant.
182 tree int_array_type_node;
184 Type `wchar_t[SOMENUMBER]' or something like it.
185 Used when a wide string literal is created.
187 tree wchar_array_type_node;
189 Type `char16_t[SOMENUMBER]' or something like it.
190 Used when a UTF-16 string literal is created.
192 tree char16_array_type_node;
194 Type `char32_t[SOMENUMBER]' or something like it.
195 Used when a UTF-32 string literal is created.
197 tree char32_array_type_node;
199 Type `int ()' -- used for implicit declaration of functions.
201 tree default_function_type;
203 A VOID_TYPE node, packaged in a TREE_LIST.
207 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
208 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
209 VAR_DECLS, but C++ does.)
211 tree function_name_decl_node;
212 tree pretty_function_name_decl_node;
213 tree c99_function_name_decl_node;
215 Stack of nested function name VAR_DECLs.
217 tree saved_function_name_decls;
221 tree c_global_trees[CTI_MAX];
223 /* Switches common to the C front ends. */
225 /* Nonzero if preprocessing only. */
227 int flag_preprocess_only;
229 /* Nonzero means don't output line number information. */
231 char flag_no_line_commands;
233 /* Nonzero causes -E output not to be done, but directives such as
234 #define that have side effects are still obeyed. */
238 /* Nonzero means dump macros in some fashion. */
240 char flag_dump_macros;
242 /* Nonzero means pass #include lines through to the output. */
244 char flag_dump_includes;
246 /* Nonzero means process PCH files while preprocessing. */
248 bool flag_pch_preprocess;
250 /* The file name to which we should write a precompiled header, or
251 NULL if no header will be written in this compile. */
253 const char *pch_file;
255 /* Nonzero if an ISO standard was selected. It rejects macros in the
259 /* Nonzero if -undef was given. It suppresses target built-in macros
263 /* Nonzero means don't recognize the non-ANSI builtin functions. */
267 /* Nonzero means don't recognize the non-ANSI builtin functions.
270 int flag_no_nonansi_builtin;
272 /* Nonzero means give `double' the same size as `float'. */
274 int flag_short_double;
276 /* Nonzero means give `wchar_t' the same size as `short'. */
278 int flag_short_wchar;
280 /* Nonzero means allow implicit conversions between vectors with
281 differing numbers of subparts and/or differing element types. */
282 int flag_lax_vector_conversions;
284 /* Nonzero means allow Microsoft extensions without warnings or errors. */
285 int flag_ms_extensions;
287 /* Nonzero means don't recognize the keyword `asm'. */
291 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
293 int flag_signed_bitfields = 1;
295 /* Warn about #pragma directives that are not recognized. */
297 int warn_unknown_pragmas; /* Tri state variable. */
299 /* Warn about format/argument anomalies in calls to formatted I/O functions
300 (*printf, *scanf, strftime, strfmon, etc.). */
304 /* Warn about using __null (as NULL in C++) as sentinel. For code compiled
305 with GCC this doesn't matter as __null is guaranteed to have the right
308 int warn_strict_null_sentinel;
310 /* Zero means that faster, ...NonNil variants of objc_msgSend...
311 calls will be used in ObjC; passing nil receivers to such calls
312 will most likely result in crashes. */
313 int flag_nil_receivers = 1;
315 /* Nonzero means that code generation will be altered to support
316 "zero-link" execution. This currently affects ObjC only, but may
317 affect other languages in the future. */
318 int flag_zero_link = 0;
320 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
321 unit. It will inform the ObjC runtime that class definition(s) herein
322 contained are to replace one(s) previously loaded. */
323 int flag_replace_objc_classes = 0;
325 /* C/ObjC language option variables. */
328 /* Nonzero means allow type mismatches in conditional expressions;
329 just make their values `void'. */
331 int flag_cond_mismatch;
333 /* Nonzero means enable C89 Amendment 1 features. */
337 /* Nonzero means use the ISO C99 dialect of C. */
341 /* Nonzero means that we have builtin functions, and main is an int. */
346 /* ObjC language option variables. */
349 /* Open and close the file for outputting class declarations, if
352 int flag_gen_declaration;
354 /* Tells the compiler that this is a special run. Do not perform any
355 compiling, instead we are to test some platform dependent features
356 and output a C header file with appropriate definitions. */
358 int print_struct_values;
360 /* Tells the compiler what is the constant string class for ObjC. */
362 const char *constant_string_class_name;
365 /* C++ language option variables. */
368 /* Nonzero means don't recognize any extension keywords. */
370 int flag_no_gnu_keywords;
372 /* Nonzero means do emit exported implementations of functions even if
373 they can be inlined. */
375 int flag_implement_inlines = 1;
377 /* Nonzero means that implicit instantiations will be emitted if needed. */
379 int flag_implicit_templates = 1;
381 /* Nonzero means that implicit instantiations of inline templates will be
382 emitted if needed, even if instantiations of non-inline templates
385 int flag_implicit_inline_templates = 1;
387 /* Nonzero means generate separate instantiation control files and
388 juggle them at link time. */
390 int flag_use_repository;
392 /* Nonzero if we want to issue diagnostics that the standard says are not
395 int flag_optional_diags = 1;
397 /* Nonzero means we should attempt to elide constructors when possible. */
399 int flag_elide_constructors = 1;
401 /* Nonzero means that member functions defined in class scope are
402 inline by default. */
404 int flag_default_inline = 1;
406 /* Controls whether compiler generates 'type descriptor' that give
407 run-time type information. */
411 /* Nonzero if we want to conserve space in the .o files. We do this
412 by putting uninitialized data and runtime initialized data into
413 .common instead of .data at the expense of not flagging multiple
416 int flag_conserve_space;
418 /* Nonzero if we want to obey access control semantics. */
420 int flag_access_control = 1;
422 /* Nonzero if we want to check the return value of new and avoid calling
423 constructors if it is a null pointer. */
427 /* The C++ dialect being used. C++98 is the default. */
429 enum cxx_dialect cxx_dialect = cxx98;
431 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
432 initialization variables.
433 0: Old rules, set by -fno-for-scope.
434 2: New ISO rules, set by -ffor-scope.
435 1: Try to implement new ISO rules, but with backup compatibility
436 (and warnings). This is the default, for now. */
438 int flag_new_for_scope = 1;
440 /* Nonzero if we want to emit defined symbols with common-like linkage as
441 weak symbols where possible, in order to conform to C++ semantics.
442 Otherwise, emit them as local symbols. */
446 /* 0 means we want the preprocessor to not emit line directives for
447 the current working directory. 1 means we want it to do it. -1
448 means we should decide depending on whether debugging information
449 is being emitted or not. */
451 int flag_working_directory = -1;
453 /* Nonzero to use __cxa_atexit, rather than atexit, to register
454 destructors for local statics and global objects. '2' means it has been
455 set nonzero as a default, not by a command-line flag. */
457 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
459 /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling
460 code. '2' means it has not been set explicitly on the command line. */
462 int flag_use_cxa_get_exception_ptr = 2;
464 /* Nonzero means to implement standard semantics for exception
465 specifications, calling unexpected if an exception is thrown that
466 doesn't match the specification. Zero means to treat them as
467 assertions and optimize accordingly, but not check them. */
469 int flag_enforce_eh_specs = 1;
471 /* Nonzero means to generate thread-safe code for initializing local
474 int flag_threadsafe_statics = 1;
476 /* Nonzero means warn about implicit declarations. */
478 int warn_implicit = 1;
480 /* Maximum template instantiation depth. This limit is rather
481 arbitrary, but it exists to limit the time it takes to notice
482 infinite template instantiations. */
484 int max_tinst_depth = 500;
488 /* The elements of `ridpointers' are identifier nodes for the reserved
489 type names and storage classes. It is indexed by a RID_... value. */
492 tree (*make_fname_decl) (tree, int);
494 /* Nonzero means the expression being parsed will never be evaluated.
495 This is a count, since unevaluated expressions can nest. */
498 /* Information about how a function name is generated. */
501 tree *const decl; /* pointer to the VAR_DECL. */
502 const unsigned rid; /* RID number for the identifier. */
503 const int pretty; /* How pretty is it? */
506 /* The three ways of getting then name of the current function. */
508 const struct fname_var_t fname_vars[] =
510 /* C99 compliant __func__, must be first. */
511 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
512 /* GCC __FUNCTION__ compliant. */
513 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
514 /* GCC __PRETTY_FUNCTION__ compliant. */
515 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
519 static tree check_case_value (tree);
520 static bool check_case_bounds (tree, tree, tree *, tree *);
522 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
523 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
524 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
525 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
526 static tree handle_hot_attribute (tree *, tree, tree, int, bool *);
527 static tree handle_cold_attribute (tree *, tree, tree, int, bool *);
528 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
529 static tree handle_always_inline_attribute (tree *, tree, tree, int,
531 static tree handle_gnu_inline_attribute (tree *, tree, tree, int, bool *);
532 static tree handle_artificial_attribute (tree *, tree, tree, int, bool *);
533 static tree handle_flatten_attribute (tree *, tree, tree, int, bool *);
534 static tree handle_error_attribute (tree *, tree, tree, int, bool *);
535 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
536 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
537 static tree handle_externally_visible_attribute (tree *, tree, tree, int,
539 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
540 static tree handle_transparent_union_attribute (tree *, tree, tree,
542 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
543 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
544 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
545 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
546 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
547 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
548 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
549 static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ;
550 static tree handle_visibility_attribute (tree *, tree, tree, int,
552 static tree handle_tls_model_attribute (tree *, tree, tree, int,
554 static tree handle_no_instrument_function_attribute (tree *, tree,
556 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
557 static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *);
558 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
560 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
561 static tree handle_novops_attribute (tree *, tree, tree, int, bool *);
562 static tree handle_deprecated_attribute (tree *, tree, tree, int,
564 static tree handle_vector_size_attribute (tree *, tree, tree, int,
566 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
567 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
568 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
569 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
571 static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
572 static tree handle_type_generic_attribute (tree *, tree, tree, int, bool *);
573 static tree handle_alloc_size_attribute (tree *, tree, tree, int, bool *);
574 static tree handle_target_attribute (tree *, tree, tree, int, bool *);
575 static tree handle_optimize_attribute (tree *, tree, tree, int, bool *);
577 static void check_function_nonnull (tree, int, tree *);
578 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
579 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
580 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
581 static int resort_field_decl_cmp (const void *, const void *);
583 /* Reserved words. The third field is a mask: keywords are disabled
584 if they match the mask.
587 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
588 C --std=c99: D_CXXONLY | D_OBJC
589 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
590 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
591 C++ --std=c0x: D_CONLY | D_OBJC
592 ObjC++ is like C++ except that D_OBJC is not set
594 If -fno-asm is used, D_ASM is added to the mask. If
595 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
596 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
597 In C with -Wc++-compat, we warn if D_CXXWARN is set. */
599 const struct c_common_resword c_common_reswords[] =
601 { "_Bool", RID_BOOL, D_CONLY },
602 { "_Complex", RID_COMPLEX, 0 },
603 { "_Decimal32", RID_DFLOAT32, D_CONLY | D_EXT },
604 { "_Decimal64", RID_DFLOAT64, D_CONLY | D_EXT },
605 { "_Decimal128", RID_DFLOAT128, D_CONLY | D_EXT },
606 { "_Fract", RID_FRACT, D_CONLY | D_EXT },
607 { "_Accum", RID_ACCUM, D_CONLY | D_EXT },
608 { "_Sat", RID_SAT, D_CONLY | D_EXT },
609 { "__FUNCTION__", RID_FUNCTION_NAME, 0 },
610 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME, 0 },
611 { "__alignof", RID_ALIGNOF, 0 },
612 { "__alignof__", RID_ALIGNOF, 0 },
613 { "__asm", RID_ASM, 0 },
614 { "__asm__", RID_ASM, 0 },
615 { "__attribute", RID_ATTRIBUTE, 0 },
616 { "__attribute__", RID_ATTRIBUTE, 0 },
617 { "__builtin_choose_expr", RID_CHOOSE_EXPR, D_CONLY },
618 { "__builtin_offsetof", RID_OFFSETOF, 0 },
619 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P, D_CONLY },
620 { "__builtin_va_arg", RID_VA_ARG, 0 },
621 { "__complex", RID_COMPLEX, 0 },
622 { "__complex__", RID_COMPLEX, 0 },
623 { "__const", RID_CONST, 0 },
624 { "__const__", RID_CONST, 0 },
625 { "__decltype", RID_DECLTYPE, D_CXXONLY },
626 { "__extension__", RID_EXTENSION, 0 },
627 { "__func__", RID_C99_FUNCTION_NAME, 0 },
628 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN, D_CXXONLY },
629 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR, D_CXXONLY },
630 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY, D_CXXONLY },
631 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN, D_CXXONLY },
632 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR, D_CXXONLY },
633 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY, D_CXXONLY },
634 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR, D_CXXONLY },
635 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR, D_CXXONLY },
636 { "__is_abstract", RID_IS_ABSTRACT, D_CXXONLY },
637 { "__is_base_of", RID_IS_BASE_OF, D_CXXONLY },
638 { "__is_class", RID_IS_CLASS, D_CXXONLY },
639 { "__is_convertible_to", RID_IS_CONVERTIBLE_TO, D_CXXONLY },
640 { "__is_empty", RID_IS_EMPTY, D_CXXONLY },
641 { "__is_enum", RID_IS_ENUM, D_CXXONLY },
642 { "__is_pod", RID_IS_POD, D_CXXONLY },
643 { "__is_polymorphic", RID_IS_POLYMORPHIC, D_CXXONLY },
644 { "__is_union", RID_IS_UNION, D_CXXONLY },
645 { "__imag", RID_IMAGPART, 0 },
646 { "__imag__", RID_IMAGPART, 0 },
647 { "__inline", RID_INLINE, 0 },
648 { "__inline__", RID_INLINE, 0 },
649 { "__label__", RID_LABEL, 0 },
650 { "__null", RID_NULL, 0 },
651 { "__real", RID_REALPART, 0 },
652 { "__real__", RID_REALPART, 0 },
653 { "__restrict", RID_RESTRICT, 0 },
654 { "__restrict__", RID_RESTRICT, 0 },
655 { "__signed", RID_SIGNED, 0 },
656 { "__signed__", RID_SIGNED, 0 },
657 { "__thread", RID_THREAD, 0 },
658 { "__typeof", RID_TYPEOF, 0 },
659 { "__typeof__", RID_TYPEOF, 0 },
660 { "__volatile", RID_VOLATILE, 0 },
661 { "__volatile__", RID_VOLATILE, 0 },
662 { "asm", RID_ASM, D_ASM },
663 { "auto", RID_AUTO, 0 },
664 { "bool", RID_BOOL, D_CXXONLY | D_CXXWARN },
665 { "break", RID_BREAK, 0 },
666 { "case", RID_CASE, 0 },
667 { "catch", RID_CATCH, D_CXX_OBJC | D_CXXWARN },
668 { "char", RID_CHAR, 0 },
669 { "char16_t", RID_CHAR16, D_CXXONLY | D_CXX0X | D_CXXWARN },
670 { "char32_t", RID_CHAR32, D_CXXONLY | D_CXX0X | D_CXXWARN },
671 { "class", RID_CLASS, D_CXX_OBJC | D_CXXWARN },
672 { "const", RID_CONST, 0 },
673 { "const_cast", RID_CONSTCAST, D_CXXONLY | D_CXXWARN },
674 { "continue", RID_CONTINUE, 0 },
675 { "decltype", RID_DECLTYPE, D_CXXONLY | D_CXX0X | D_CXXWARN },
676 { "default", RID_DEFAULT, 0 },
677 { "delete", RID_DELETE, D_CXXONLY | D_CXXWARN },
679 { "double", RID_DOUBLE, 0 },
680 { "dynamic_cast", RID_DYNCAST, D_CXXONLY | D_CXXWARN },
681 { "else", RID_ELSE, 0 },
682 { "enum", RID_ENUM, 0 },
683 { "explicit", RID_EXPLICIT, D_CXXONLY | D_CXXWARN },
684 { "export", RID_EXPORT, D_CXXONLY | D_CXXWARN },
685 { "extern", RID_EXTERN, 0 },
686 { "false", RID_FALSE, D_CXXONLY | D_CXXWARN },
687 { "float", RID_FLOAT, 0 },
688 { "for", RID_FOR, 0 },
689 { "friend", RID_FRIEND, D_CXXONLY | D_CXXWARN },
690 { "goto", RID_GOTO, 0 },
692 { "inline", RID_INLINE, D_EXT89 },
693 { "int", RID_INT, 0 },
694 { "long", RID_LONG, 0 },
695 { "mutable", RID_MUTABLE, D_CXXONLY | D_CXXWARN },
696 { "namespace", RID_NAMESPACE, D_CXXONLY | D_CXXWARN },
697 { "new", RID_NEW, D_CXXONLY | D_CXXWARN },
698 { "operator", RID_OPERATOR, D_CXXONLY | D_CXXWARN },
699 { "private", RID_PRIVATE, D_CXX_OBJC | D_CXXWARN },
700 { "protected", RID_PROTECTED, D_CXX_OBJC | D_CXXWARN },
701 { "public", RID_PUBLIC, D_CXX_OBJC | D_CXXWARN },
702 { "register", RID_REGISTER, 0 },
703 { "reinterpret_cast", RID_REINTCAST, D_CXXONLY | D_CXXWARN },
704 { "restrict", RID_RESTRICT, D_CONLY | D_C99 },
705 { "return", RID_RETURN, 0 },
706 { "short", RID_SHORT, 0 },
707 { "signed", RID_SIGNED, 0 },
708 { "sizeof", RID_SIZEOF, 0 },
709 { "static", RID_STATIC, 0 },
710 { "static_assert", RID_STATIC_ASSERT, D_CXXONLY | D_CXX0X | D_CXXWARN },
711 { "static_cast", RID_STATCAST, D_CXXONLY | D_CXXWARN },
712 { "struct", RID_STRUCT, 0 },
713 { "switch", RID_SWITCH, 0 },
714 { "template", RID_TEMPLATE, D_CXXONLY | D_CXXWARN },
715 { "this", RID_THIS, D_CXXONLY | D_CXXWARN },
716 { "throw", RID_THROW, D_CXX_OBJC | D_CXXWARN },
717 { "true", RID_TRUE, D_CXXONLY | D_CXXWARN },
718 { "try", RID_TRY, D_CXX_OBJC | D_CXXWARN },
719 { "typedef", RID_TYPEDEF, 0 },
720 { "typename", RID_TYPENAME, D_CXXONLY | D_CXXWARN },
721 { "typeid", RID_TYPEID, D_CXXONLY | D_CXXWARN },
722 { "typeof", RID_TYPEOF, D_ASM | D_EXT },
723 { "union", RID_UNION, 0 },
724 { "unsigned", RID_UNSIGNED, 0 },
725 { "using", RID_USING, D_CXXONLY | D_CXXWARN },
726 { "virtual", RID_VIRTUAL, D_CXXONLY | D_CXXWARN },
727 { "void", RID_VOID, 0 },
728 { "volatile", RID_VOLATILE, 0 },
729 { "wchar_t", RID_WCHAR, D_CXXONLY },
730 { "while", RID_WHILE, 0 },
731 /* These Objective-C keywords are recognized only immediately after
733 { "compatibility_alias", RID_AT_ALIAS, D_OBJC },
734 { "defs", RID_AT_DEFS, D_OBJC },
735 { "encode", RID_AT_ENCODE, D_OBJC },
736 { "end", RID_AT_END, D_OBJC },
737 { "implementation", RID_AT_IMPLEMENTATION, D_OBJC },
738 { "interface", RID_AT_INTERFACE, D_OBJC },
739 { "protocol", RID_AT_PROTOCOL, D_OBJC },
740 { "selector", RID_AT_SELECTOR, D_OBJC },
741 { "finally", RID_AT_FINALLY, D_OBJC },
742 { "synchronized", RID_AT_SYNCHRONIZED, D_OBJC },
743 /* These are recognized only in protocol-qualifier context
745 { "bycopy", RID_BYCOPY, D_OBJC },
746 { "byref", RID_BYREF, D_OBJC },
747 { "in", RID_IN, D_OBJC },
748 { "inout", RID_INOUT, D_OBJC },
749 { "oneway", RID_ONEWAY, D_OBJC },
750 { "out", RID_OUT, D_OBJC },
753 const unsigned int num_c_common_reswords =
754 sizeof c_common_reswords / sizeof (struct c_common_resword);
756 /* Table of machine-independent attributes common to all C-like languages. */
757 const struct attribute_spec c_common_attribute_table[] =
759 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
760 { "packed", 0, 0, false, false, false,
761 handle_packed_attribute },
762 { "nocommon", 0, 0, true, false, false,
763 handle_nocommon_attribute },
764 { "common", 0, 0, true, false, false,
765 handle_common_attribute },
766 /* FIXME: logically, noreturn attributes should be listed as
767 "false, true, true" and apply to function types. But implementing this
768 would require all the places in the compiler that use TREE_THIS_VOLATILE
769 on a decl to identify non-returning functions to be located and fixed
770 to check the function type instead. */
771 { "noreturn", 0, 0, true, false, false,
772 handle_noreturn_attribute },
773 { "volatile", 0, 0, true, false, false,
774 handle_noreturn_attribute },
775 { "noinline", 0, 0, true, false, false,
776 handle_noinline_attribute },
777 { "always_inline", 0, 0, true, false, false,
778 handle_always_inline_attribute },
779 { "gnu_inline", 0, 0, true, false, false,
780 handle_gnu_inline_attribute },
781 { "artificial", 0, 0, true, false, false,
782 handle_artificial_attribute },
783 { "flatten", 0, 0, true, false, false,
784 handle_flatten_attribute },
785 { "used", 0, 0, true, false, false,
786 handle_used_attribute },
787 { "unused", 0, 0, false, false, false,
788 handle_unused_attribute },
789 { "externally_visible", 0, 0, true, false, false,
790 handle_externally_visible_attribute },
791 /* The same comments as for noreturn attributes apply to const ones. */
792 { "const", 0, 0, true, false, false,
793 handle_const_attribute },
794 { "transparent_union", 0, 0, false, false, false,
795 handle_transparent_union_attribute },
796 { "constructor", 0, 1, true, false, false,
797 handle_constructor_attribute },
798 { "destructor", 0, 1, true, false, false,
799 handle_destructor_attribute },
800 { "mode", 1, 1, false, true, false,
801 handle_mode_attribute },
802 { "section", 1, 1, true, false, false,
803 handle_section_attribute },
804 { "aligned", 0, 1, false, false, false,
805 handle_aligned_attribute },
806 { "weak", 0, 0, true, false, false,
807 handle_weak_attribute },
808 { "alias", 1, 1, true, false, false,
809 handle_alias_attribute },
810 { "weakref", 0, 1, true, false, false,
811 handle_weakref_attribute },
812 { "no_instrument_function", 0, 0, true, false, false,
813 handle_no_instrument_function_attribute },
814 { "malloc", 0, 0, true, false, false,
815 handle_malloc_attribute },
816 { "returns_twice", 0, 0, true, false, false,
817 handle_returns_twice_attribute },
818 { "no_stack_limit", 0, 0, true, false, false,
819 handle_no_limit_stack_attribute },
820 { "pure", 0, 0, true, false, false,
821 handle_pure_attribute },
822 /* For internal use (marking of builtins) only. The name contains space
823 to prevent its usage in source code. */
824 { "no vops", 0, 0, true, false, false,
825 handle_novops_attribute },
826 { "deprecated", 0, 0, false, false, false,
827 handle_deprecated_attribute },
828 { "vector_size", 1, 1, false, true, false,
829 handle_vector_size_attribute },
830 { "visibility", 1, 1, false, false, false,
831 handle_visibility_attribute },
832 { "tls_model", 1, 1, true, false, false,
833 handle_tls_model_attribute },
834 { "nonnull", 0, -1, false, true, true,
835 handle_nonnull_attribute },
836 { "nothrow", 0, 0, true, false, false,
837 handle_nothrow_attribute },
838 { "may_alias", 0, 0, false, true, false, NULL },
839 { "cleanup", 1, 1, true, false, false,
840 handle_cleanup_attribute },
841 { "warn_unused_result", 0, 0, false, true, true,
842 handle_warn_unused_result_attribute },
843 { "sentinel", 0, 1, false, true, true,
844 handle_sentinel_attribute },
845 /* For internal use (marking of builtins) only. The name contains space
846 to prevent its usage in source code. */
847 { "type generic", 0, 0, false, true, true,
848 handle_type_generic_attribute },
849 { "alloc_size", 1, 2, false, true, true,
850 handle_alloc_size_attribute },
851 { "cold", 0, 0, true, false, false,
852 handle_cold_attribute },
853 { "hot", 0, 0, true, false, false,
854 handle_hot_attribute },
855 { "warning", 1, 1, true, false, false,
856 handle_error_attribute },
857 { "error", 1, 1, true, false, false,
858 handle_error_attribute },
859 { "target", 1, -1, true, false, false,
860 handle_target_attribute },
861 { "optimize", 1, -1, true, false, false,
862 handle_optimize_attribute },
863 { NULL, 0, 0, false, false, false, NULL }
866 /* Give the specifications for the format attributes, used by C and all
869 const struct attribute_spec c_common_format_attribute_table[] =
871 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
872 { "format", 3, 3, false, true, true,
873 handle_format_attribute },
874 { "format_arg", 1, 1, false, true, true,
875 handle_format_arg_attribute },
876 { NULL, 0, 0, false, false, false, NULL }
879 /* Push current bindings for the function name VAR_DECLS. */
882 start_fname_decls (void)
885 tree saved = NULL_TREE;
887 for (ix = 0; fname_vars[ix].decl; ix++)
889 tree decl = *fname_vars[ix].decl;
893 saved = tree_cons (decl, build_int_cst (NULL_TREE, ix), saved);
894 *fname_vars[ix].decl = NULL_TREE;
897 if (saved || saved_function_name_decls)
898 /* Normally they'll have been NULL, so only push if we've got a
899 stack, or they are non-NULL. */
900 saved_function_name_decls = tree_cons (saved, NULL_TREE,
901 saved_function_name_decls);
904 /* Finish up the current bindings, adding them into the current function's
905 statement tree. This must be done _before_ finish_stmt_tree is called.
906 If there is no current function, we must be at file scope and no statements
907 are involved. Pop the previous bindings. */
910 finish_fname_decls (void)
913 tree stmts = NULL_TREE;
914 tree stack = saved_function_name_decls;
916 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
917 append_to_statement_list (TREE_VALUE (stack), &stmts);
921 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
923 if (TREE_CODE (*bodyp) == BIND_EXPR)
924 bodyp = &BIND_EXPR_BODY (*bodyp);
926 append_to_statement_list_force (*bodyp, &stmts);
930 for (ix = 0; fname_vars[ix].decl; ix++)
931 *fname_vars[ix].decl = NULL_TREE;
935 /* We had saved values, restore them. */
938 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
940 tree decl = TREE_PURPOSE (saved);
941 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
943 *fname_vars[ix].decl = decl;
945 stack = TREE_CHAIN (stack);
947 saved_function_name_decls = stack;
950 /* Return the text name of the current function, suitably prettified
951 by PRETTY_P. Return string must be freed by caller. */
954 fname_as_string (int pretty_p)
956 const char *name = "top level";
959 cpp_string cstr = { 0, 0 }, strname;
967 if (current_function_decl)
968 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
970 len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
972 namep = XNEWVEC (char, len);
973 snprintf (namep, len, "\"%s\"", name);
974 strname.text = (unsigned char *) namep;
975 strname.len = len - 1;
977 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, CPP_STRING))
980 return (const char *) cstr.text;
986 /* Return the VAR_DECL for a const char array naming the current
987 function. If the VAR_DECL has not yet been created, create it
988 now. RID indicates how it should be formatted and IDENTIFIER_NODE
989 ID is its name (unfortunately C and C++ hold the RID values of
990 keywords in different places, so we can't derive RID from ID in
991 this language independent code. LOC is the location of the
995 fname_decl (location_t loc, unsigned int rid, tree id)
998 tree decl = NULL_TREE;
1000 for (ix = 0; fname_vars[ix].decl; ix++)
1001 if (fname_vars[ix].rid == rid)
1004 decl = *fname_vars[ix].decl;
1007 /* If a tree is built here, it would normally have the lineno of
1008 the current statement. Later this tree will be moved to the
1009 beginning of the function and this line number will be wrong.
1010 To avoid this problem set the lineno to 0 here; that prevents
1011 it from appearing in the RTL. */
1013 location_t saved_location = input_location;
1014 input_location = UNKNOWN_LOCATION;
1016 stmts = push_stmt_list ();
1017 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1018 stmts = pop_stmt_list (stmts);
1019 if (!IS_EMPTY_STMT (stmts))
1020 saved_function_name_decls
1021 = tree_cons (decl, stmts, saved_function_name_decls);
1022 *fname_vars[ix].decl = decl;
1023 input_location = saved_location;
1025 if (!ix && !current_function_decl)
1026 pedwarn (loc, 0, "%qD is not defined outside of function scope", decl);
1031 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1034 fix_string_type (tree value)
1036 int length = TREE_STRING_LENGTH (value);
1038 tree e_type, i_type, a_type;
1040 /* Compute the number of elements, for the array type. */
1041 if (TREE_TYPE (value) == char_array_type_node || !TREE_TYPE (value))
1044 e_type = char_type_node;
1046 else if (TREE_TYPE (value) == char16_array_type_node)
1048 nchars = length / (TYPE_PRECISION (char16_type_node) / BITS_PER_UNIT);
1049 e_type = char16_type_node;
1051 else if (TREE_TYPE (value) == char32_array_type_node)
1053 nchars = length / (TYPE_PRECISION (char32_type_node) / BITS_PER_UNIT);
1054 e_type = char32_type_node;
1058 nchars = length / (TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT);
1059 e_type = wchar_type_node;
1062 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1063 limit in C++98 Annex B is very large (65536) and is not normative,
1064 so we do not diagnose it (warn_overlength_strings is forced off
1065 in c_common_post_options). */
1066 if (warn_overlength_strings)
1068 const int nchars_max = flag_isoc99 ? 4095 : 509;
1069 const int relevant_std = flag_isoc99 ? 99 : 90;
1070 if (nchars - 1 > nchars_max)
1071 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1072 separate the %d from the 'C'. 'ISO' should not be
1073 translated, but it may be moved after 'C%d' in languages
1074 where modifiers follow nouns. */
1075 pedwarn (input_location, OPT_Woverlength_strings,
1076 "string length %qd is greater than the length %qd "
1077 "ISO C%d compilers are required to support",
1078 nchars - 1, nchars_max, relevant_std);
1081 /* Create the array type for the string constant. The ISO C++
1082 standard says that a string literal has type `const char[N]' or
1083 `const wchar_t[N]'. We use the same logic when invoked as a C
1084 front-end with -Wwrite-strings.
1085 ??? We should change the type of an expression depending on the
1086 state of a warning flag. We should just be warning -- see how
1087 this is handled in the C++ front-end for the deprecated implicit
1088 conversion from string literals to `char*' or `wchar_t*'.
1090 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1091 array type being the unqualified version of that type.
1092 Therefore, if we are constructing an array of const char, we must
1093 construct the matching unqualified array type first. The C front
1094 end does not require this, but it does no harm, so we do it
1096 i_type = build_index_type (build_int_cst (NULL_TREE, nchars - 1));
1097 a_type = build_array_type (e_type, i_type);
1098 if (c_dialect_cxx() || warn_write_strings)
1099 a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
1101 TREE_TYPE (value) = a_type;
1102 TREE_CONSTANT (value) = 1;
1103 TREE_READONLY (value) = 1;
1104 TREE_STATIC (value) = 1;
1108 /* Print a warning if a constant expression had overflow in folding.
1109 Invoke this function on every expression that the language
1110 requires to be a constant expression.
1111 Note the ANSI C standard says it is erroneous for a
1112 constant expression to overflow. */
1115 constant_expression_warning (tree value)
1117 if (warn_overflow && pedantic
1118 && (TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1119 || TREE_CODE (value) == FIXED_CST
1120 || TREE_CODE (value) == VECTOR_CST
1121 || TREE_CODE (value) == COMPLEX_CST)
1122 && TREE_OVERFLOW (value))
1123 pedwarn (input_location, OPT_Woverflow, "overflow in constant expression");
1126 /* The same as above but print an unconditional error. */
1128 constant_expression_error (tree value)
1130 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1131 || TREE_CODE (value) == FIXED_CST
1132 || TREE_CODE (value) == VECTOR_CST
1133 || TREE_CODE (value) == COMPLEX_CST)
1134 && TREE_OVERFLOW (value))
1135 error ("overflow in constant expression");
1138 /* Print a warning if an expression had overflow in folding and its
1141 Invoke this function on every expression that
1142 (1) appears in the source code, and
1143 (2) is a constant expression that overflowed, and
1144 (3) is not already checked by convert_and_check;
1145 however, do not invoke this function on operands of explicit casts
1146 or when the expression is the result of an operator and any operand
1147 already overflowed. */
1150 overflow_warning (tree value)
1152 if (skip_evaluation) return;
1154 switch (TREE_CODE (value))
1157 warning (OPT_Woverflow, "integer overflow in expression");
1161 warning (OPT_Woverflow, "floating point overflow in expression");
1165 warning (OPT_Woverflow, "fixed-point overflow in expression");
1169 warning (OPT_Woverflow, "vector overflow in expression");
1173 if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST)
1174 warning (OPT_Woverflow, "complex integer overflow in expression");
1175 else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST)
1176 warning (OPT_Woverflow, "complex floating point overflow in expression");
1185 /* Warn about use of a logical || / && operator being used in a
1186 context where it is likely that the bitwise equivalent was intended
1187 by the programmer. CODE is the TREE_CODE of the operator, ARG1
1188 and ARG2 the arguments. */
1191 warn_logical_operator (enum tree_code code, tree arg1, tree
1196 case TRUTH_ANDIF_EXPR:
1197 case TRUTH_ORIF_EXPR:
1199 case TRUTH_AND_EXPR:
1200 if (!TREE_NO_WARNING (arg1)
1201 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
1202 && !CONSTANT_CLASS_P (arg1)
1203 && TREE_CODE (arg2) == INTEGER_CST
1204 && !integer_zerop (arg2))
1206 warning (OPT_Wlogical_op,
1207 "logical %<%s%> with non-zero constant "
1208 "will always evaluate as true",
1209 ((code == TRUTH_ANDIF_EXPR)
1210 || (code == TRUTH_AND_EXPR)) ? "&&" : "||");
1211 TREE_NO_WARNING (arg1) = true;
1220 /* Print a warning about casts that might indicate violation
1221 of strict aliasing rules if -Wstrict-aliasing is used and
1222 strict aliasing mode is in effect. OTYPE is the original
1223 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1226 strict_aliasing_warning (tree otype, tree type, tree expr)
1228 if (!(flag_strict_aliasing
1229 && POINTER_TYPE_P (type)
1230 && POINTER_TYPE_P (otype)
1231 && !VOID_TYPE_P (TREE_TYPE (type)))
1232 /* If the type we are casting to is a ref-all pointer
1233 dereferencing it is always valid. */
1234 || TYPE_REF_CAN_ALIAS_ALL (type))
1237 if ((warn_strict_aliasing > 1) && TREE_CODE (expr) == ADDR_EXPR
1238 && (DECL_P (TREE_OPERAND (expr, 0))
1239 || handled_component_p (TREE_OPERAND (expr, 0))))
1241 /* Casting the address of an object to non void pointer. Warn
1242 if the cast breaks type based aliasing. */
1243 if (!COMPLETE_TYPE_P (TREE_TYPE (type)) && warn_strict_aliasing == 2)
1245 warning (OPT_Wstrict_aliasing, "type-punning to incomplete type "
1246 "might break strict-aliasing rules");
1251 /* warn_strict_aliasing >= 3. This includes the default (3).
1252 Only warn if the cast is dereferenced immediately. */
1253 alias_set_type set1 =
1254 get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
1255 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
1257 if (set1 != set2 && set2 != 0
1258 && (set1 == 0 || !alias_sets_conflict_p (set1, set2)))
1260 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1261 "pointer will break strict-aliasing rules");
1264 else if (warn_strict_aliasing == 2
1265 && !alias_sets_must_conflict_p (set1, set2))
1267 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1268 "pointer might break strict-aliasing rules");
1274 if ((warn_strict_aliasing == 1) && !VOID_TYPE_P (TREE_TYPE (otype)))
1276 /* At this level, warn for any conversions, even if an address is
1277 not taken in the same statement. This will likely produce many
1278 false positives, but could be useful to pinpoint problems that
1279 are not revealed at higher levels. */
1280 alias_set_type set1 = get_alias_set (TREE_TYPE (otype));
1281 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
1282 if (!COMPLETE_TYPE_P (type)
1283 || !alias_sets_must_conflict_p (set1, set2))
1285 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1286 "pointer might break strict-aliasing rules");
1294 /* Warn for unlikely, improbable, or stupid DECL declarations
1298 check_main_parameter_types (tree decl)
1303 for (args = TYPE_ARG_TYPES (TREE_TYPE (decl)); args;
1304 args = TREE_CHAIN (args))
1306 tree type = args ? TREE_VALUE (args) : 0;
1308 if (type == void_type_node || type == error_mark_node )
1315 if (TYPE_MAIN_VARIANT (type) != integer_type_node)
1316 pedwarn (input_location, OPT_Wmain, "first argument of %q+D should be %<int%>",
1321 if (TREE_CODE (type) != POINTER_TYPE
1322 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1323 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1325 pedwarn (input_location, OPT_Wmain, "second argument of %q+D should be %<char **%>",
1330 if (TREE_CODE (type) != POINTER_TYPE
1331 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1332 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1334 pedwarn (input_location, OPT_Wmain, "third argument of %q+D should probably be "
1335 "%<char **%>", decl);
1340 /* It is intentional that this message does not mention the third
1341 argument because it's only mentioned in an appendix of the
1343 if (argct > 0 && (argct < 2 || argct > 3))
1344 pedwarn (input_location, OPT_Wmain, "%q+D takes only zero or two arguments", decl);
1347 /* True if pointers to distinct types T1 and T2 can be converted to
1348 each other without an explicit cast. Only returns true for opaque
1351 vector_targets_convertible_p (const_tree t1, const_tree t2)
1353 if (TREE_CODE (t1) == VECTOR_TYPE && TREE_CODE (t2) == VECTOR_TYPE
1354 && (targetm.vector_opaque_p (t1) || targetm.vector_opaque_p (t2))
1355 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
1361 /* True if vector types T1 and T2 can be converted to each other
1362 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1363 can only be converted with -flax-vector-conversions yet that is not
1364 in effect, emit a note telling the user about that option if such
1365 a note has not previously been emitted. */
1367 vector_types_convertible_p (const_tree t1, const_tree t2, bool emit_lax_note)
1369 static bool emitted_lax_note = false;
1370 bool convertible_lax;
1372 if ((targetm.vector_opaque_p (t1) || targetm.vector_opaque_p (t2))
1373 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
1377 (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
1378 && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE ||
1379 TYPE_PRECISION (t1) == TYPE_PRECISION (t2))
1380 && (INTEGRAL_TYPE_P (TREE_TYPE (t1))
1381 == INTEGRAL_TYPE_P (TREE_TYPE (t2))));
1383 if (!convertible_lax || flag_lax_vector_conversions)
1384 return convertible_lax;
1386 if (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1387 && lang_hooks.types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1390 if (emit_lax_note && !emitted_lax_note)
1392 emitted_lax_note = true;
1393 inform (input_location, "use -flax-vector-conversions to permit "
1394 "conversions between vectors with differing "
1395 "element types or numbers of subparts");
1401 /* This is a helper function of build_binary_op.
1403 For certain operations if both args were extended from the same
1404 smaller type, do the arithmetic in that type and then extend.
1406 BITWISE indicates a bitwise operation.
1407 For them, this optimization is safe only if
1408 both args are zero-extended or both are sign-extended.
1409 Otherwise, we might change the result.
1410 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1411 but calculated in (unsigned short) it would be (unsigned short)-1.
1413 tree shorten_binary_op (tree result_type, tree op0, tree op1, bool bitwise)
1415 int unsigned0, unsigned1;
1420 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1421 excessive narrowing when we call get_narrower below. For
1422 example, suppose that OP0 is of unsigned int extended
1423 from signed char and that RESULT_TYPE is long long int.
1424 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1427 (long long int) (unsigned int) signed_char
1429 which get_narrower would narrow down to
1431 (unsigned int) signed char
1433 If we do not cast OP0 first, get_narrower would return
1434 signed_char, which is inconsistent with the case of the
1436 op0 = convert (result_type, op0);
1437 op1 = convert (result_type, op1);
1439 arg0 = get_narrower (op0, &unsigned0);
1440 arg1 = get_narrower (op1, &unsigned1);
1442 /* UNS is 1 if the operation to be done is an unsigned one. */
1443 uns = TYPE_UNSIGNED (result_type);
1445 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1446 but it *requires* conversion to FINAL_TYPE. */
1448 if ((TYPE_PRECISION (TREE_TYPE (op0))
1449 == TYPE_PRECISION (TREE_TYPE (arg0)))
1450 && TREE_TYPE (op0) != result_type)
1451 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
1452 if ((TYPE_PRECISION (TREE_TYPE (op1))
1453 == TYPE_PRECISION (TREE_TYPE (arg1)))
1454 && TREE_TYPE (op1) != result_type)
1455 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
1457 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1459 /* For bitwise operations, signedness of nominal type
1460 does not matter. Consider only how operands were extended. */
1464 /* Note that in all three cases below we refrain from optimizing
1465 an unsigned operation on sign-extended args.
1466 That would not be valid. */
1468 /* Both args variable: if both extended in same way
1469 from same width, do it in that width.
1470 Do it unsigned if args were zero-extended. */
1471 if ((TYPE_PRECISION (TREE_TYPE (arg0))
1472 < TYPE_PRECISION (result_type))
1473 && (TYPE_PRECISION (TREE_TYPE (arg1))
1474 == TYPE_PRECISION (TREE_TYPE (arg0)))
1475 && unsigned0 == unsigned1
1476 && (unsigned0 || !uns))
1477 return c_common_signed_or_unsigned_type
1478 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
1480 else if (TREE_CODE (arg0) == INTEGER_CST
1481 && (unsigned1 || !uns)
1482 && (TYPE_PRECISION (TREE_TYPE (arg1))
1483 < TYPE_PRECISION (result_type))
1485 = c_common_signed_or_unsigned_type (unsigned1,
1487 && !POINTER_TYPE_P (type)
1488 && int_fits_type_p (arg0, type))
1491 else if (TREE_CODE (arg1) == INTEGER_CST
1492 && (unsigned0 || !uns)
1493 && (TYPE_PRECISION (TREE_TYPE (arg0))
1494 < TYPE_PRECISION (result_type))
1496 = c_common_signed_or_unsigned_type (unsigned0,
1498 && !POINTER_TYPE_P (type)
1499 && int_fits_type_p (arg1, type))
1505 /* Warns if the conversion of EXPR to TYPE may alter a value.
1506 This is a helper function for warnings_for_convert_and_check. */
1509 conversion_warning (tree type, tree expr)
1511 bool give_warning = false;
1514 const int expr_num_operands = TREE_OPERAND_LENGTH (expr);
1515 tree expr_type = TREE_TYPE (expr);
1517 if (!warn_conversion && !warn_sign_conversion)
1520 /* If any operand is artificial, then this expression was generated
1521 by the compiler and we do not warn. */
1522 for (i = 0; i < expr_num_operands; i++)
1524 tree op = TREE_OPERAND (expr, i);
1525 if (op && DECL_P (op) && DECL_ARTIFICIAL (op))
1529 switch (TREE_CODE (expr))
1537 case TRUTH_ANDIF_EXPR:
1538 case TRUTH_ORIF_EXPR:
1539 case TRUTH_AND_EXPR:
1541 case TRUTH_XOR_EXPR:
1542 case TRUTH_NOT_EXPR:
1543 /* Conversion from boolean to a signed:1 bit-field (which only
1544 can hold the values 0 and -1) doesn't lose information - but
1545 it does change the value. */
1546 if (TYPE_PRECISION (type) == 1 && !TYPE_UNSIGNED (type))
1547 warning (OPT_Wconversion,
1548 "conversion to %qT from boolean expression", type);
1554 /* Warn for real constant that is not an exact integer converted
1556 if (TREE_CODE (expr_type) == REAL_TYPE
1557 && TREE_CODE (type) == INTEGER_TYPE)
1559 if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (expr_type)))
1560 give_warning = true;
1562 /* Warn for an integer constant that does not fit into integer type. */
1563 else if (TREE_CODE (expr_type) == INTEGER_TYPE
1564 && TREE_CODE (type) == INTEGER_TYPE
1565 && !int_fits_type_p (expr, type))
1567 if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)
1568 && tree_int_cst_sgn (expr) < 0)
1569 warning (OPT_Wsign_conversion,
1570 "negative integer implicitly converted to unsigned type");
1571 else if (!TYPE_UNSIGNED (type) && TYPE_UNSIGNED (expr_type))
1572 warning (OPT_Wsign_conversion, "conversion of unsigned constant "
1573 "value to negative integer");
1575 give_warning = true;
1577 else if (TREE_CODE (type) == REAL_TYPE)
1579 /* Warn for an integer constant that does not fit into real type. */
1580 if (TREE_CODE (expr_type) == INTEGER_TYPE)
1582 REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr);
1583 if (!exact_real_truncate (TYPE_MODE (type), &a))
1584 give_warning = true;
1586 /* Warn for a real constant that does not fit into a smaller
1588 else if (TREE_CODE (expr_type) == REAL_TYPE
1589 && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
1591 REAL_VALUE_TYPE a = TREE_REAL_CST (expr);
1592 if (!exact_real_truncate (TYPE_MODE (type), &a))
1593 give_warning = true;
1598 warning (OPT_Wconversion,
1599 "conversion to %qT alters %qT constant value",
1606 /* In case of COND_EXPR, if both operands are constants or
1607 COND_EXPR, then we do not care about the type of COND_EXPR,
1608 only about the conversion of each operand. */
1609 tree op1 = TREE_OPERAND (expr, 1);
1610 tree op2 = TREE_OPERAND (expr, 2);
1612 if ((TREE_CODE (op1) == REAL_CST || TREE_CODE (op1) == INTEGER_CST
1613 || TREE_CODE (op1) == COND_EXPR)
1614 && (TREE_CODE (op2) == REAL_CST || TREE_CODE (op2) == INTEGER_CST
1615 || TREE_CODE (op2) == COND_EXPR))
1617 conversion_warning (type, op1);
1618 conversion_warning (type, op2);
1624 default: /* 'expr' is not a constant. */
1626 /* Warn for real types converted to integer types. */
1627 if (TREE_CODE (expr_type) == REAL_TYPE
1628 && TREE_CODE (type) == INTEGER_TYPE)
1629 give_warning = true;
1631 else if (TREE_CODE (expr_type) == INTEGER_TYPE
1632 && TREE_CODE (type) == INTEGER_TYPE)
1634 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
1635 expr = get_unwidened (expr, 0);
1636 expr_type = TREE_TYPE (expr);
1638 /* Don't warn for short y; short x = ((int)y & 0xff); */
1639 if (TREE_CODE (expr) == BIT_AND_EXPR
1640 || TREE_CODE (expr) == BIT_IOR_EXPR
1641 || TREE_CODE (expr) == BIT_XOR_EXPR)
1643 /* If both args were extended from a shortest type,
1644 use that type if that is safe. */
1645 expr_type = shorten_binary_op (expr_type,
1646 TREE_OPERAND (expr, 0),
1647 TREE_OPERAND (expr, 1),
1650 if (TREE_CODE (expr) == BIT_AND_EXPR)
1652 tree op0 = TREE_OPERAND (expr, 0);
1653 tree op1 = TREE_OPERAND (expr, 1);
1654 bool unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
1655 bool unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
1657 /* If one of the operands is a non-negative constant
1658 that fits in the target type, then the type of the
1659 other operand does not matter. */
1660 if ((TREE_CODE (op0) == INTEGER_CST
1661 && int_fits_type_p (op0, c_common_signed_type (type))
1662 && int_fits_type_p (op0, c_common_unsigned_type (type)))
1663 || (TREE_CODE (op1) == INTEGER_CST
1664 && int_fits_type_p (op1, c_common_signed_type (type))
1665 && int_fits_type_p (op1,
1666 c_common_unsigned_type (type))))
1668 /* If constant is unsigned and fits in the target
1669 type, then the result will also fit. */
1670 else if ((TREE_CODE (op0) == INTEGER_CST
1672 && int_fits_type_p (op0, type))
1673 || (TREE_CODE (op1) == INTEGER_CST
1675 && int_fits_type_p (op1, type)))
1679 /* Warn for integer types converted to smaller integer types. */
1680 if (TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
1681 give_warning = true;
1683 /* When they are the same width but different signedness,
1684 then the value may change. */
1685 else if ((TYPE_PRECISION (type) == TYPE_PRECISION (expr_type)
1686 && TYPE_UNSIGNED (expr_type) != TYPE_UNSIGNED (type))
1687 /* Even when converted to a bigger type, if the type is
1688 unsigned but expr is signed, then negative values
1690 || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)))
1691 warning (OPT_Wsign_conversion, "conversion to %qT from %qT "
1692 "may change the sign of the result",
1696 /* Warn for integer types converted to real types if and only if
1697 all the range of values of the integer type cannot be
1698 represented by the real type. */
1699 else if (TREE_CODE (expr_type) == INTEGER_TYPE
1700 && TREE_CODE (type) == REAL_TYPE)
1702 tree type_low_bound = TYPE_MIN_VALUE (expr_type);
1703 tree type_high_bound = TYPE_MAX_VALUE (expr_type);
1704 REAL_VALUE_TYPE real_low_bound
1705 = real_value_from_int_cst (0, type_low_bound);
1706 REAL_VALUE_TYPE real_high_bound
1707 = real_value_from_int_cst (0, type_high_bound);
1709 if (!exact_real_truncate (TYPE_MODE (type), &real_low_bound)
1710 || !exact_real_truncate (TYPE_MODE (type), &real_high_bound))
1711 give_warning = true;
1714 /* Warn for real types converted to smaller real types. */
1715 else if (TREE_CODE (expr_type) == REAL_TYPE
1716 && TREE_CODE (type) == REAL_TYPE
1717 && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
1718 give_warning = true;
1722 warning (OPT_Wconversion,
1723 "conversion to %qT from %qT may alter its value",
1728 /* Produce warnings after a conversion. RESULT is the result of
1729 converting EXPR to TYPE. This is a helper function for
1730 convert_and_check and cp_convert_and_check. */
1733 warnings_for_convert_and_check (tree type, tree expr, tree result)
1735 if (TREE_CODE (expr) == INTEGER_CST
1736 && (TREE_CODE (type) == INTEGER_TYPE
1737 || TREE_CODE (type) == ENUMERAL_TYPE)
1738 && !int_fits_type_p (expr, type))
1740 /* Do not diagnose overflow in a constant expression merely
1741 because a conversion overflowed. */
1742 if (TREE_OVERFLOW (result))
1743 TREE_OVERFLOW (result) = TREE_OVERFLOW (expr);
1745 if (TYPE_UNSIGNED (type))
1747 /* This detects cases like converting -129 or 256 to
1749 if (!int_fits_type_p (expr, c_common_signed_type (type)))
1750 warning (OPT_Woverflow,
1751 "large integer implicitly truncated to unsigned type");
1753 conversion_warning (type, expr);
1755 else if (!int_fits_type_p (expr, c_common_unsigned_type (type)))
1756 warning (OPT_Woverflow,
1757 "overflow in implicit constant conversion");
1758 /* No warning for converting 0x80000000 to int. */
1760 && (TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE
1761 || TYPE_PRECISION (TREE_TYPE (expr))
1762 != TYPE_PRECISION (type)))
1763 warning (OPT_Woverflow,
1764 "overflow in implicit constant conversion");
1767 conversion_warning (type, expr);
1769 else if ((TREE_CODE (result) == INTEGER_CST
1770 || TREE_CODE (result) == FIXED_CST) && TREE_OVERFLOW (result))
1771 warning (OPT_Woverflow,
1772 "overflow in implicit constant conversion");
1774 conversion_warning (type, expr);
1778 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1779 Invoke this function on every expression that is converted implicitly,
1780 i.e. because of language rules and not because of an explicit cast. */
1783 convert_and_check (tree type, tree expr)
1787 if (TREE_TYPE (expr) == type)
1790 result = convert (type, expr);
1792 if (!skip_evaluation && !TREE_OVERFLOW_P (expr) && result != error_mark_node)
1793 warnings_for_convert_and_check (type, expr, result);
1798 /* A node in a list that describes references to variables (EXPR), which are
1799 either read accesses if WRITER is zero, or write accesses, in which case
1800 WRITER is the parent of EXPR. */
1807 /* Used to implement a cache the results of a call to verify_tree. We only
1808 use this for SAVE_EXPRs. */
1811 struct tlist_cache *next;
1812 struct tlist *cache_before_sp;
1813 struct tlist *cache_after_sp;
1817 /* Obstack to use when allocating tlist structures, and corresponding
1819 static struct obstack tlist_obstack;
1820 static char *tlist_firstobj = 0;
1822 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1824 static struct tlist *warned_ids;
1825 /* SAVE_EXPRs need special treatment. We process them only once and then
1826 cache the results. */
1827 static struct tlist_cache *save_expr_cache;
1829 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1830 static void merge_tlist (struct tlist **, struct tlist *, int);
1831 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1832 static int warning_candidate_p (tree);
1833 static void warn_for_collisions (struct tlist *);
1834 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1835 static struct tlist *new_tlist (struct tlist *, tree, tree);
1837 /* Create a new struct tlist and fill in its fields. */
1838 static struct tlist *
1839 new_tlist (struct tlist *next, tree t, tree writer)
1842 l = XOBNEW (&tlist_obstack, struct tlist);
1849 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1850 is nonnull, we ignore any node we find which has a writer equal to it. */
1853 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1857 struct tlist *next = add->next;
1860 if (!exclude_writer || add->writer != exclude_writer)
1861 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1866 /* Merge the nodes of ADD into TO. This merging process is done so that for
1867 each variable that already exists in TO, no new node is added; however if
1868 there is a write access recorded in ADD, and an occurrence on TO is only
1869 a read access, then the occurrence in TO will be modified to record the
1873 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1875 struct tlist **end = to;
1878 end = &(*end)->next;
1884 struct tlist *next = add->next;
1886 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1887 if (tmp2->expr == add->expr)
1891 tmp2->writer = add->writer;
1895 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1896 end = &(*end)->next;
1903 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1904 references in list LIST conflict with it, excluding reads if ONLY writers
1908 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1913 /* Avoid duplicate warnings. */
1914 for (tmp = warned_ids; tmp; tmp = tmp->next)
1915 if (tmp->expr == written)
1920 if (list->expr == written
1921 && list->writer != writer
1922 && (!only_writes || list->writer)
1923 && DECL_NAME (list->expr))
1925 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1926 warning_at (EXPR_HAS_LOCATION (writer)
1927 ? EXPR_LOCATION (writer) : input_location,
1928 OPT_Wsequence_point, "operation on %qE may be undefined",
1935 /* Given a list LIST of references to variables, find whether any of these
1936 can cause conflicts due to missing sequence points. */
1939 warn_for_collisions (struct tlist *list)
1943 for (tmp = list; tmp; tmp = tmp->next)
1946 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1950 /* Return nonzero if X is a tree that can be verified by the sequence point
1953 warning_candidate_p (tree x)
1955 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1958 /* Walk the tree X, and record accesses to variables. If X is written by the
1959 parent tree, WRITER is the parent.
1960 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1961 expression or its only operand forces a sequence point, then everything up
1962 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1964 Once we return, we will have emitted warnings if any subexpression before
1965 such a sequence point could be undefined. On a higher level, however, the
1966 sequence point may not be relevant, and we'll merge the two lists.
1968 Example: (b++, a) + b;
1969 The call that processes the COMPOUND_EXPR will store the increment of B
1970 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1971 processes the PLUS_EXPR will need to merge the two lists so that
1972 eventually, all accesses end up on the same list (and we'll warn about the
1973 unordered subexpressions b++ and b.
1975 A note on merging. If we modify the former example so that our expression
1978 care must be taken not simply to add all three expressions into the final
1979 PNO_SP list. The function merge_tlist takes care of that by merging the
1980 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1981 way, so that no more than one access to B is recorded. */
1984 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1987 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1988 enum tree_code code;
1989 enum tree_code_class cl;
1991 /* X may be NULL if it is the operand of an empty statement expression
1997 code = TREE_CODE (x);
1998 cl = TREE_CODE_CLASS (code);
2000 if (warning_candidate_p (x))
2002 *pno_sp = new_tlist (*pno_sp, x, writer);
2012 case TRUTH_ANDIF_EXPR:
2013 case TRUTH_ORIF_EXPR:
2014 tmp_before = tmp_nosp = tmp_list3 = 0;
2015 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
2016 warn_for_collisions (tmp_nosp);
2017 merge_tlist (pbefore_sp, tmp_before, 0);
2018 merge_tlist (pbefore_sp, tmp_nosp, 0);
2019 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
2020 merge_tlist (pbefore_sp, tmp_list3, 0);
2024 tmp_before = tmp_list2 = 0;
2025 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
2026 warn_for_collisions (tmp_list2);
2027 merge_tlist (pbefore_sp, tmp_before, 0);
2028 merge_tlist (pbefore_sp, tmp_list2, 1);
2030 tmp_list3 = tmp_nosp = 0;
2031 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
2032 warn_for_collisions (tmp_nosp);
2033 merge_tlist (pbefore_sp, tmp_list3, 0);
2035 tmp_list3 = tmp_list2 = 0;
2036 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
2037 warn_for_collisions (tmp_list2);
2038 merge_tlist (pbefore_sp, tmp_list3, 0);
2039 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2040 two first, to avoid warning for (a ? b++ : b++). */
2041 merge_tlist (&tmp_nosp, tmp_list2, 0);
2042 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
2045 case PREDECREMENT_EXPR:
2046 case PREINCREMENT_EXPR:
2047 case POSTDECREMENT_EXPR:
2048 case POSTINCREMENT_EXPR:
2049 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
2053 tmp_before = tmp_nosp = tmp_list3 = 0;
2054 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
2055 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
2056 /* Expressions inside the LHS are not ordered wrt. the sequence points
2057 in the RHS. Example:
2059 Despite the fact that the modification of "a" is in the before_sp
2060 list (tmp_before), it conflicts with the use of "a" in the LHS.
2061 We can handle this by adding the contents of tmp_list3
2062 to those of tmp_before, and redoing the collision warnings for that
2064 add_tlist (&tmp_before, tmp_list3, x, 1);
2065 warn_for_collisions (tmp_before);
2066 /* Exclude the LHS itself here; we first have to merge it into the
2067 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2068 didn't exclude the LHS, we'd get it twice, once as a read and once
2070 add_tlist (pno_sp, tmp_list3, x, 0);
2071 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
2073 merge_tlist (pbefore_sp, tmp_before, 0);
2074 if (warning_candidate_p (TREE_OPERAND (x, 0)))
2075 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
2076 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
2080 /* We need to warn about conflicts among arguments and conflicts between
2081 args and the function address. Side effects of the function address,
2082 however, are not ordered by the sequence point of the call. */
2084 call_expr_arg_iterator iter;
2086 tmp_before = tmp_nosp = 0;
2087 verify_tree (CALL_EXPR_FN (x), &tmp_before, &tmp_nosp, NULL_TREE);
2088 FOR_EACH_CALL_EXPR_ARG (arg, iter, x)
2090 tmp_list2 = tmp_list3 = 0;
2091 verify_tree (arg, &tmp_list2, &tmp_list3, NULL_TREE);
2092 merge_tlist (&tmp_list3, tmp_list2, 0);
2093 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
2095 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
2096 warn_for_collisions (tmp_before);
2097 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
2102 /* Scan all the list, e.g. indices of multi dimensional array. */
2105 tmp_before = tmp_nosp = 0;
2106 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
2107 merge_tlist (&tmp_nosp, tmp_before, 0);
2108 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
2115 struct tlist_cache *t;
2116 for (t = save_expr_cache; t; t = t->next)
2122 t = XOBNEW (&tlist_obstack, struct tlist_cache);
2123 t->next = save_expr_cache;
2125 save_expr_cache = t;
2127 tmp_before = tmp_nosp = 0;
2128 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
2129 warn_for_collisions (tmp_nosp);
2134 struct tlist *t = tmp_nosp;
2136 merge_tlist (&tmp_list3, t, 0);
2138 t->cache_before_sp = tmp_before;
2139 t->cache_after_sp = tmp_list3;
2141 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
2142 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
2147 x = TREE_OPERAND (x, 0);
2154 /* For other expressions, simply recurse on their operands.
2155 Manual tail recursion for unary expressions.
2156 Other non-expressions need not be processed. */
2157 if (cl == tcc_unary)
2159 x = TREE_OPERAND (x, 0);
2163 else if (IS_EXPR_CODE_CLASS (cl))
2166 int max = TREE_OPERAND_LENGTH (x);
2167 for (lp = 0; lp < max; lp++)
2169 tmp_before = tmp_nosp = 0;
2170 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0);
2171 merge_tlist (&tmp_nosp, tmp_before, 0);
2172 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
2179 /* Try to warn for undefined behavior in EXPR due to missing sequence
2183 verify_sequence_points (tree expr)
2185 struct tlist *before_sp = 0, *after_sp = 0;
2188 save_expr_cache = 0;
2189 if (tlist_firstobj == 0)
2191 gcc_obstack_init (&tlist_obstack);
2192 tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
2195 verify_tree (expr, &before_sp, &after_sp, 0);
2196 warn_for_collisions (after_sp);
2197 obstack_free (&tlist_obstack, tlist_firstobj);
2200 /* Validate the expression after `case' and apply default promotions. */
2203 check_case_value (tree value)
2205 if (value == NULL_TREE)
2208 /* ??? Can we ever get nops here for a valid case value? We
2210 STRIP_TYPE_NOPS (value);
2211 /* In C++, the following is allowed:
2214 switch (...) { case i: ... }
2216 So, we try to reduce the VALUE to a constant that way. */
2217 if (c_dialect_cxx ())
2219 value = decl_constant_value (value);
2220 STRIP_TYPE_NOPS (value);
2221 value = fold (value);
2224 if (TREE_CODE (value) == INTEGER_CST)
2225 /* Promote char or short to int. */
2226 value = perform_integral_promotions (value);
2227 else if (value != error_mark_node)
2229 error ("case label does not reduce to an integer constant");
2230 value = error_mark_node;
2233 constant_expression_warning (value);
2238 /* See if the case values LOW and HIGH are in the range of the original
2239 type (i.e. before the default conversion to int) of the switch testing
2241 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2242 the type before promoting it. CASE_LOW_P is a pointer to the lower
2243 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2244 if the case is not a case range.
2245 The caller has to make sure that we are not called with NULL for
2246 CASE_LOW_P (i.e. the default case).
2247 Returns true if the case label is in range of ORIG_TYPE (saturated or
2248 untouched) or false if the label is out of range. */
2251 check_case_bounds (tree type, tree orig_type,
2252 tree *case_low_p, tree *case_high_p)
2254 tree min_value, max_value;
2255 tree case_low = *case_low_p;
2256 tree case_high = case_high_p ? *case_high_p : case_low;
2258 /* If there was a problem with the original type, do nothing. */
2259 if (orig_type == error_mark_node)
2262 min_value = TYPE_MIN_VALUE (orig_type);
2263 max_value = TYPE_MAX_VALUE (orig_type);
2265 /* Case label is less than minimum for type. */
2266 if (tree_int_cst_compare (case_low, min_value) < 0
2267 && tree_int_cst_compare (case_high, min_value) < 0)
2269 warning (0, "case label value is less than minimum value for type");
2273 /* Case value is greater than maximum for type. */
2274 if (tree_int_cst_compare (case_low, max_value) > 0
2275 && tree_int_cst_compare (case_high, max_value) > 0)
2277 warning (0, "case label value exceeds maximum value for type");
2281 /* Saturate lower case label value to minimum. */
2282 if (tree_int_cst_compare (case_high, min_value) >= 0
2283 && tree_int_cst_compare (case_low, min_value) < 0)
2285 warning (0, "lower value in case label range"
2286 " less than minimum value for type");
2287 case_low = min_value;
2290 /* Saturate upper case label value to maximum. */
2291 if (tree_int_cst_compare (case_low, max_value) <= 0
2292 && tree_int_cst_compare (case_high, max_value) > 0)
2294 warning (0, "upper value in case label range"
2295 " exceeds maximum value for type");
2296 case_high = max_value;
2299 if (*case_low_p != case_low)
2300 *case_low_p = convert (type, case_low);
2301 if (case_high_p && *case_high_p != case_high)
2302 *case_high_p = convert (type, case_high);
2307 /* Return an integer type with BITS bits of precision,
2308 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2311 c_common_type_for_size (unsigned int bits, int unsignedp)
2313 if (bits == TYPE_PRECISION (integer_type_node))
2314 return unsignedp ? unsigned_type_node : integer_type_node;
2316 if (bits == TYPE_PRECISION (signed_char_type_node))
2317 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2319 if (bits == TYPE_PRECISION (short_integer_type_node))
2320 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2322 if (bits == TYPE_PRECISION (long_integer_type_node))
2323 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2325 if (bits == TYPE_PRECISION (long_long_integer_type_node))
2326 return (unsignedp ? long_long_unsigned_type_node
2327 : long_long_integer_type_node);
2329 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
2330 return (unsignedp ? widest_unsigned_literal_type_node
2331 : widest_integer_literal_type_node);
2333 if (bits <= TYPE_PRECISION (intQI_type_node))
2334 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2336 if (bits <= TYPE_PRECISION (intHI_type_node))
2337 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2339 if (bits <= TYPE_PRECISION (intSI_type_node))
2340 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2342 if (bits <= TYPE_PRECISION (intDI_type_node))
2343 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2348 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2349 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2350 and saturating if SATP is nonzero, otherwise not saturating. */
2353 c_common_fixed_point_type_for_size (unsigned int ibit, unsigned int fbit,
2354 int unsignedp, int satp)
2356 enum machine_mode mode;
2358 mode = unsignedp ? UQQmode : QQmode;
2360 mode = unsignedp ? UHAmode : HAmode;
2362 for (; mode != VOIDmode; mode = GET_MODE_WIDER_MODE (mode))
2363 if (GET_MODE_IBIT (mode) >= ibit && GET_MODE_FBIT (mode) >= fbit)
2366 if (mode == VOIDmode || !targetm.scalar_mode_supported_p (mode))
2368 sorry ("GCC cannot support operators with integer types and "
2369 "fixed-point types that have too many integral and "
2370 "fractional bits together");
2374 return c_common_type_for_mode (mode, satp);
2377 /* Used for communication between c_common_type_for_mode and
2378 c_register_builtin_type. */
2379 static GTY(()) tree registered_builtin_types;
2381 /* Return a data type that has machine mode MODE.
2382 If the mode is an integer,
2383 then UNSIGNEDP selects between signed and unsigned types.
2384 If the mode is a fixed-point mode,
2385 then UNSIGNEDP selects between saturating and nonsaturating types. */
2388 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
2392 if (mode == TYPE_MODE (integer_type_node))
2393 return unsignedp ? unsigned_type_node : integer_type_node;
2395 if (mode == TYPE_MODE (signed_char_type_node))
2396 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2398 if (mode == TYPE_MODE (short_integer_type_node))
2399 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2401 if (mode == TYPE_MODE (long_integer_type_node))
2402 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2404 if (mode == TYPE_MODE (long_long_integer_type_node))
2405 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
2407 if (mode == TYPE_MODE (widest_integer_literal_type_node))
2408 return unsignedp ? widest_unsigned_literal_type_node
2409 : widest_integer_literal_type_node;
2412 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2415 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2418 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2421 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2423 #if HOST_BITS_PER_WIDE_INT >= 64
2424 if (mode == TYPE_MODE (intTI_type_node))
2425 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2428 if (mode == TYPE_MODE (float_type_node))
2429 return float_type_node;
2431 if (mode == TYPE_MODE (double_type_node))
2432 return double_type_node;
2434 if (mode == TYPE_MODE (long_double_type_node))
2435 return long_double_type_node;
2437 if (mode == TYPE_MODE (void_type_node))
2438 return void_type_node;
2440 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
2442 ? make_unsigned_type (GET_MODE_PRECISION (mode))
2443 : make_signed_type (GET_MODE_PRECISION (mode)));
2445 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
2447 ? make_unsigned_type (GET_MODE_PRECISION (mode))
2448 : make_signed_type (GET_MODE_PRECISION (mode)));
2450 if (COMPLEX_MODE_P (mode))
2452 enum machine_mode inner_mode;
2455 if (mode == TYPE_MODE (complex_float_type_node))
2456 return complex_float_type_node;
2457 if (mode == TYPE_MODE (complex_double_type_node))
2458 return complex_double_type_node;
2459 if (mode == TYPE_MODE (complex_long_double_type_node))
2460 return complex_long_double_type_node;
2462 if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp)
2463 return complex_integer_type_node;
2465 inner_mode = GET_MODE_INNER (mode);
2466 inner_type = c_common_type_for_mode (inner_mode, unsignedp);
2467 if (inner_type != NULL_TREE)
2468 return build_complex_type (inner_type);
2470 else if (VECTOR_MODE_P (mode))
2472 enum machine_mode inner_mode = GET_MODE_INNER (mode);
2473 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
2474 if (inner_type != NULL_TREE)
2475 return build_vector_type_for_mode (inner_type, mode);
2478 if (mode == TYPE_MODE (dfloat32_type_node))
2479 return dfloat32_type_node;
2480 if (mode == TYPE_MODE (dfloat64_type_node))
2481 return dfloat64_type_node;
2482 if (mode == TYPE_MODE (dfloat128_type_node))
2483 return dfloat128_type_node;
2485 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode))
2487 if (mode == TYPE_MODE (short_fract_type_node))
2488 return unsignedp ? sat_short_fract_type_node : short_fract_type_node;
2489 if (mode == TYPE_MODE (fract_type_node))
2490 return unsignedp ? sat_fract_type_node : fract_type_node;
2491 if (mode == TYPE_MODE (long_fract_type_node))
2492 return unsignedp ? sat_long_fract_type_node : long_fract_type_node;
2493 if (mode == TYPE_MODE (long_long_fract_type_node))
2494 return unsignedp ? sat_long_long_fract_type_node
2495 : long_long_fract_type_node;
2497 if (mode == TYPE_MODE (unsigned_short_fract_type_node))
2498 return unsignedp ? sat_unsigned_short_fract_type_node
2499 : unsigned_short_fract_type_node;
2500 if (mode == TYPE_MODE (unsigned_fract_type_node))
2501 return unsignedp ? sat_unsigned_fract_type_node
2502 : unsigned_fract_type_node;
2503 if (mode == TYPE_MODE (unsigned_long_fract_type_node))
2504 return unsignedp ? sat_unsigned_long_fract_type_node
2505 : unsigned_long_fract_type_node;
2506 if (mode == TYPE_MODE (unsigned_long_long_fract_type_node))
2507 return unsignedp ? sat_unsigned_long_long_fract_type_node
2508 : unsigned_long_long_fract_type_node;
2510 if (mode == TYPE_MODE (short_accum_type_node))
2511 return unsignedp ? sat_short_accum_type_node : short_accum_type_node;
2512 if (mode == TYPE_MODE (accum_type_node))
2513 return unsignedp ? sat_accum_type_node : accum_type_node;
2514 if (mode == TYPE_MODE (long_accum_type_node))
2515 return unsignedp ? sat_long_accum_type_node : long_accum_type_node;
2516 if (mode == TYPE_MODE (long_long_accum_type_node))
2517 return unsignedp ? sat_long_long_accum_type_node
2518 : long_long_accum_type_node;
2520 if (mode == TYPE_MODE (unsigned_short_accum_type_node))
2521 return unsignedp ? sat_unsigned_short_accum_type_node
2522 : unsigned_short_accum_type_node;
2523 if (mode == TYPE_MODE (unsigned_accum_type_node))
2524 return unsignedp ? sat_unsigned_accum_type_node
2525 : unsigned_accum_type_node;
2526 if (mode == TYPE_MODE (unsigned_long_accum_type_node))
2527 return unsignedp ? sat_unsigned_long_accum_type_node
2528 : unsigned_long_accum_type_node;
2529 if (mode == TYPE_MODE (unsigned_long_long_accum_type_node))
2530 return unsignedp ? sat_unsigned_long_long_accum_type_node
2531 : unsigned_long_long_accum_type_node;
2534 return unsignedp ? sat_qq_type_node : qq_type_node;
2536 return unsignedp ? sat_hq_type_node : hq_type_node;
2538 return unsignedp ? sat_sq_type_node : sq_type_node;
2540 return unsignedp ? sat_dq_type_node : dq_type_node;
2542 return unsignedp ? sat_tq_type_node : tq_type_node;
2544 if (mode == UQQmode)
2545 return unsignedp ? sat_uqq_type_node : uqq_type_node;
2546 if (mode == UHQmode)
2547 return unsignedp ? sat_uhq_type_node : uhq_type_node;
2548 if (mode == USQmode)
2549 return unsignedp ? sat_usq_type_node : usq_type_node;
2550 if (mode == UDQmode)
2551 return unsignedp ? sat_udq_type_node : udq_type_node;
2552 if (mode == UTQmode)
2553 return unsignedp ? sat_utq_type_node : utq_type_node;
2556 return unsignedp ? sat_ha_type_node : ha_type_node;
2558 return unsignedp ? sat_sa_type_node : sa_type_node;
2560 return unsignedp ? sat_da_type_node : da_type_node;
2562 return unsignedp ? sat_ta_type_node : ta_type_node;
2564 if (mode == UHAmode)
2565 return unsignedp ? sat_uha_type_node : uha_type_node;
2566 if (mode == USAmode)
2567 return unsignedp ? sat_usa_type_node : usa_type_node;
2568 if (mode == UDAmode)
2569 return unsignedp ? sat_uda_type_node : uda_type_node;
2570 if (mode == UTAmode)
2571 return unsignedp ? sat_uta_type_node : uta_type_node;
2574 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
2575 if (TYPE_MODE (TREE_VALUE (t)) == mode)
2576 return TREE_VALUE (t);
2582 c_common_unsigned_type (tree type)
2584 return c_common_signed_or_unsigned_type (1, type);
2587 /* Return a signed type the same as TYPE in other respects. */
2590 c_common_signed_type (tree type)
2592 return c_common_signed_or_unsigned_type (0, type);
2595 /* Return a type the same as TYPE except unsigned or
2596 signed according to UNSIGNEDP. */
2599 c_common_signed_or_unsigned_type (int unsignedp, tree type)
2603 /* This block of code emulates the behavior of the old
2604 c_common_unsigned_type. In particular, it returns
2605 long_unsigned_type_node if passed a long, even when a int would
2606 have the same size. This is necessary for warnings to work
2607 correctly in archs where sizeof(int) == sizeof(long) */
2609 type1 = TYPE_MAIN_VARIANT (type);
2610 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
2611 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2612 if (type1 == integer_type_node || type1 == unsigned_type_node)
2613 return unsignedp ? unsigned_type_node : integer_type_node;
2614 if (type1 == short_integer_type_node || type1 == short_unsigned_type_node)
2615 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2616 if (type1 == long_integer_type_node || type1 == long_unsigned_type_node)
2617 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2618 if (type1 == long_long_integer_type_node || type1 == long_long_unsigned_type_node)
2619 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
2620 if (type1 == widest_integer_literal_type_node || type1 == widest_unsigned_literal_type_node)
2621 return unsignedp ? widest_unsigned_literal_type_node : widest_integer_literal_type_node;
2622 #if HOST_BITS_PER_WIDE_INT >= 64
2623 if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node)
2624 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2626 if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node)
2627 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2628 if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node)
2629 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2630 if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node)
2631 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2632 if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node)
2633 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2635 #define C_COMMON_FIXED_TYPES(NAME) \
2636 if (type1 == short_ ## NAME ## _type_node \
2637 || type1 == unsigned_short_ ## NAME ## _type_node) \
2638 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
2639 : short_ ## NAME ## _type_node; \
2640 if (type1 == NAME ## _type_node \
2641 || type1 == unsigned_ ## NAME ## _type_node) \
2642 return unsignedp ? unsigned_ ## NAME ## _type_node \
2643 : NAME ## _type_node; \
2644 if (type1 == long_ ## NAME ## _type_node \
2645 || type1 == unsigned_long_ ## NAME ## _type_node) \
2646 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
2647 : long_ ## NAME ## _type_node; \
2648 if (type1 == long_long_ ## NAME ## _type_node \
2649 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
2650 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
2651 : long_long_ ## NAME ## _type_node;
2653 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
2654 if (type1 == NAME ## _type_node \
2655 || type1 == u ## NAME ## _type_node) \
2656 return unsignedp ? u ## NAME ## _type_node \
2657 : NAME ## _type_node;
2659 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
2660 if (type1 == sat_ ## short_ ## NAME ## _type_node \
2661 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
2662 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
2663 : sat_ ## short_ ## NAME ## _type_node; \
2664 if (type1 == sat_ ## NAME ## _type_node \
2665 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
2666 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
2667 : sat_ ## NAME ## _type_node; \
2668 if (type1 == sat_ ## long_ ## NAME ## _type_node \
2669 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
2670 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
2671 : sat_ ## long_ ## NAME ## _type_node; \
2672 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
2673 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
2674 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
2675 : sat_ ## long_long_ ## NAME ## _type_node;
2677 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
2678 if (type1 == sat_ ## NAME ## _type_node \
2679 || type1 == sat_ ## u ## NAME ## _type_node) \
2680 return unsignedp ? sat_ ## u ## NAME ## _type_node \
2681 : sat_ ## NAME ## _type_node;
2683 C_COMMON_FIXED_TYPES (fract);
2684 C_COMMON_FIXED_TYPES_SAT (fract);
2685 C_COMMON_FIXED_TYPES (accum);
2686 C_COMMON_FIXED_TYPES_SAT (accum);
2688 C_COMMON_FIXED_MODE_TYPES (qq);
2689 C_COMMON_FIXED_MODE_TYPES (hq);
2690 C_COMMON_FIXED_MODE_TYPES (sq);
2691 C_COMMON_FIXED_MODE_TYPES (dq);
2692 C_COMMON_FIXED_MODE_TYPES (tq);
2693 C_COMMON_FIXED_MODE_TYPES_SAT (qq);
2694 C_COMMON_FIXED_MODE_TYPES_SAT (hq);
2695 C_COMMON_FIXED_MODE_TYPES_SAT (sq);
2696 C_COMMON_FIXED_MODE_TYPES_SAT (dq);
2697 C_COMMON_FIXED_MODE_TYPES_SAT (tq);
2698 C_COMMON_FIXED_MODE_TYPES (ha);
2699 C_COMMON_FIXED_MODE_TYPES (sa);
2700 C_COMMON_FIXED_MODE_TYPES (da);
2701 C_COMMON_FIXED_MODE_TYPES (ta);
2702 C_COMMON_FIXED_MODE_TYPES_SAT (ha);
2703 C_COMMON_FIXED_MODE_TYPES_SAT (sa);
2704 C_COMMON_FIXED_MODE_TYPES_SAT (da);
2705 C_COMMON_FIXED_MODE_TYPES_SAT (ta);
2707 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2708 the precision; they have precision set to match their range, but
2709 may use a wider mode to match an ABI. If we change modes, we may
2710 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2711 the precision as well, so as to yield correct results for
2712 bit-field types. C++ does not have these separate bit-field
2713 types, and producing a signed or unsigned variant of an
2714 ENUMERAL_TYPE may cause other problems as well. */
2716 if (!INTEGRAL_TYPE_P (type)
2717 || TYPE_UNSIGNED (type) == unsignedp)
2720 #define TYPE_OK(node) \
2721 (TYPE_MODE (type) == TYPE_MODE (node) \
2722 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
2723 if (TYPE_OK (signed_char_type_node))
2724 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2725 if (TYPE_OK (integer_type_node))
2726 return unsignedp ? unsigned_type_node : integer_type_node;
2727 if (TYPE_OK (short_integer_type_node))
2728 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2729 if (TYPE_OK (long_integer_type_node))
2730 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2731 if (TYPE_OK (long_long_integer_type_node))
2732 return (unsignedp ? long_long_unsigned_type_node
2733 : long_long_integer_type_node);
2734 if (TYPE_OK (widest_integer_literal_type_node))
2735 return (unsignedp ? widest_unsigned_literal_type_node
2736 : widest_integer_literal_type_node);
2738 #if HOST_BITS_PER_WIDE_INT >= 64
2739 if (TYPE_OK (intTI_type_node))
2740 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2742 if (TYPE_OK (intDI_type_node))
2743 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2744 if (TYPE_OK (intSI_type_node))
2745 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2746 if (TYPE_OK (intHI_type_node))
2747 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2748 if (TYPE_OK (intQI_type_node))
2749 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2752 if (c_dialect_cxx ())
2755 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
2758 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
2761 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp)
2763 /* Extended integer types of the same width as a standard type have
2764 lesser rank, so those of the same width as int promote to int or
2765 unsigned int and are valid for printf formats expecting int or
2766 unsigned int. To avoid such special cases, avoid creating
2767 extended integer types for bit-fields if a standard integer type
2769 if (width == TYPE_PRECISION (integer_type_node))
2770 return unsignedp ? unsigned_type_node : integer_type_node;
2771 if (width == TYPE_PRECISION (signed_char_type_node))
2772 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2773 if (width == TYPE_PRECISION (short_integer_type_node))
2774 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2775 if (width == TYPE_PRECISION (long_integer_type_node))
2776 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2777 if (width == TYPE_PRECISION (long_long_integer_type_node))
2778 return (unsignedp ? long_long_unsigned_type_node
2779 : long_long_integer_type_node);
2780 return build_nonstandard_integer_type (width, unsignedp);
2783 /* The C version of the register_builtin_type langhook. */
2786 c_register_builtin_type (tree type, const char* name)
2790 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2791 DECL_ARTIFICIAL (decl) = 1;
2792 if (!TYPE_NAME (type))
2793 TYPE_NAME (type) = decl;
2796 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
2799 /* Print an error message for invalid operands to arith operation
2800 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
2801 LOCATION is the location of the message. */
2804 binary_op_error (location_t location, enum tree_code code,
2805 tree type0, tree type1)
2812 opname = "+"; break;
2814 opname = "-"; break;
2816 opname = "*"; break;
2818 opname = "max"; break;
2820 opname = "min"; break;
2822 opname = "=="; break;
2824 opname = "!="; break;
2826 opname = "<="; break;
2828 opname = ">="; break;
2830 opname = "<"; break;
2832 opname = ">"; break;
2834 opname = "<<"; break;
2836 opname = ">>"; break;
2837 case TRUNC_MOD_EXPR:
2838 case FLOOR_MOD_EXPR:
2839 opname = "%"; break;
2840 case TRUNC_DIV_EXPR:
2841 case FLOOR_DIV_EXPR:
2842 opname = "/"; break;
2844 opname = "&"; break;
2846 opname = "|"; break;
2847 case TRUTH_ANDIF_EXPR:
2848 opname = "&&"; break;
2849 case TRUTH_ORIF_EXPR:
2850 opname = "||"; break;
2852 opname = "^"; break;
2857 "invalid operands to binary %s (have %qT and %qT)", opname,
2861 /* Subroutine of build_binary_op, used for comparison operations.
2862 See if the operands have both been converted from subword integer types
2863 and, if so, perhaps change them both back to their original type.
2864 This function is also responsible for converting the two operands
2865 to the proper common type for comparison.
2867 The arguments of this function are all pointers to local variables
2868 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2869 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2871 If this function returns nonzero, it means that the comparison has
2872 a constant value. What this function returns is an expression for
2876 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2877 enum tree_code *rescode_ptr)
2880 tree op0 = *op0_ptr;
2881 tree op1 = *op1_ptr;
2882 int unsignedp0, unsignedp1;
2884 tree primop0, primop1;
2885 enum tree_code code = *rescode_ptr;
2887 /* Throw away any conversions to wider types
2888 already present in the operands. */
2890 primop0 = get_narrower (op0, &unsignedp0);
2891 primop1 = get_narrower (op1, &unsignedp1);
2893 /* Handle the case that OP0 does not *contain* a conversion
2894 but it *requires* conversion to FINAL_TYPE. */
2896 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2897 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2898 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2899 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
2901 /* If one of the operands must be floated, we cannot optimize. */
2902 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2903 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2905 /* If first arg is constant, swap the args (changing operation
2906 so value is preserved), for canonicalization. Don't do this if
2907 the second arg is 0. */
2909 if (TREE_CONSTANT (primop0)
2910 && !integer_zerop (primop1) && !real_zerop (primop1)
2911 && !fixed_zerop (primop1))
2914 int temi = unsignedp0;
2922 unsignedp0 = unsignedp1;
2945 *rescode_ptr = code;
2948 /* If comparing an integer against a constant more bits wide,
2949 maybe we can deduce a value of 1 or 0 independent of the data.
2950 Or else truncate the constant now
2951 rather than extend the variable at run time.
2953 This is only interesting if the constant is the wider arg.
2954 Also, it is not safe if the constant is unsigned and the
2955 variable arg is signed, since in this case the variable
2956 would be sign-extended and then regarded as unsigned.
2957 Our technique fails in this case because the lowest/highest
2958 possible unsigned results don't follow naturally from the
2959 lowest/highest possible values of the variable operand.
2960 For just EQ_EXPR and NE_EXPR there is another technique that
2961 could be used: see if the constant can be faithfully represented
2962 in the other operand's type, by truncating it and reextending it
2963 and see if that preserves the constant's value. */
2965 if (!real1 && !real2
2966 && TREE_CODE (TREE_TYPE (primop0)) != FIXED_POINT_TYPE
2967 && TREE_CODE (primop1) == INTEGER_CST
2968 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2970 int min_gt, max_gt, min_lt, max_lt;
2971 tree maxval, minval;
2972 /* 1 if comparison is nominally unsigned. */
2973 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
2976 type = c_common_signed_or_unsigned_type (unsignedp0,
2977 TREE_TYPE (primop0));
2979 maxval = TYPE_MAX_VALUE (type);
2980 minval = TYPE_MIN_VALUE (type);
2982 if (unsignedp && !unsignedp0)
2983 *restype_ptr = c_common_signed_type (*restype_ptr);
2985 if (TREE_TYPE (primop1) != *restype_ptr)
2987 /* Convert primop1 to target type, but do not introduce
2988 additional overflow. We know primop1 is an int_cst. */
2989 primop1 = force_fit_type_double (*restype_ptr,
2990 TREE_INT_CST_LOW (primop1),
2991 TREE_INT_CST_HIGH (primop1), 0,
2992 TREE_OVERFLOW (primop1));
2994 if (type != *restype_ptr)
2996 minval = convert (*restype_ptr, minval);
2997 maxval = convert (*restype_ptr, maxval);
3000 if (unsignedp && unsignedp0)
3002 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
3003 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
3004 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
3005 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
3009 min_gt = INT_CST_LT (primop1, minval);
3010 max_gt = INT_CST_LT (primop1, maxval);
3011 min_lt = INT_CST_LT (minval, primop1);
3012 max_lt = INT_CST_LT (maxval, primop1);
3016 /* This used to be a switch, but Genix compiler can't handle that. */
3017 if (code == NE_EXPR)
3019 if (max_lt || min_gt)
3020 val = truthvalue_true_node;
3022 else if (code == EQ_EXPR)
3024 if (max_lt || min_gt)
3025 val = truthvalue_false_node;
3027 else if (code == LT_EXPR)
3030 val = truthvalue_true_node;
3032 val = truthvalue_false_node;
3034 else if (code == GT_EXPR)
3037 val = truthvalue_true_node;
3039 val = truthvalue_false_node;
3041 else if (code == LE_EXPR)
3044 val = truthvalue_true_node;
3046 val = truthvalue_false_node;
3048 else if (code == GE_EXPR)
3051 val = truthvalue_true_node;
3053 val = truthvalue_false_node;
3056 /* If primop0 was sign-extended and unsigned comparison specd,
3057 we did a signed comparison above using the signed type bounds.
3058 But the comparison we output must be unsigned.
3060 Also, for inequalities, VAL is no good; but if the signed
3061 comparison had *any* fixed result, it follows that the
3062 unsigned comparison just tests the sign in reverse
3063 (positive values are LE, negative ones GE).
3064 So we can generate an unsigned comparison
3065 against an extreme value of the signed type. */
3067 if (unsignedp && !unsignedp0)
3074 primop1 = TYPE_MIN_VALUE (type);
3080 primop1 = TYPE_MAX_VALUE (type);
3087 type = c_common_unsigned_type (type);
3090 if (TREE_CODE (primop0) != INTEGER_CST)
3092 if (val == truthvalue_false_node)
3093 warning (OPT_Wtype_limits, "comparison is always false due to limited range of data type");
3094 if (val == truthvalue_true_node)
3095 warning (OPT_Wtype_limits, "comparison is always true due to limited range of data type");
3100 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3101 if (TREE_SIDE_EFFECTS (primop0))
3102 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
3106 /* Value is not predetermined, but do the comparison
3107 in the type of the operand that is not constant.
3108 TYPE is already properly set. */
3111 /* If either arg is decimal float and the other is float, find the
3112 proper common type to use for comparison. */
3113 else if (real1 && real2
3114 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
3115 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))))
3116 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
3118 else if (real1 && real2
3119 && (TYPE_PRECISION (TREE_TYPE (primop0))
3120 == TYPE_PRECISION (TREE_TYPE (primop1))))
3121 type = TREE_TYPE (primop0);
3123 /* If args' natural types are both narrower than nominal type
3124 and both extend in the same manner, compare them
3125 in the type of the wider arg.
3126 Otherwise must actually extend both to the nominal
3127 common type lest different ways of extending
3129 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
3131 else if (unsignedp0 == unsignedp1 && real1 == real2
3132 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
3133 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
3135 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
3136 type = c_common_signed_or_unsigned_type (unsignedp0
3137 || TYPE_UNSIGNED (*restype_ptr),
3139 /* Make sure shorter operand is extended the right way
3140 to match the longer operand. */
3142 = convert (c_common_signed_or_unsigned_type (unsignedp0,
3143 TREE_TYPE (primop0)),
3146 = convert (c_common_signed_or_unsigned_type (unsignedp1,
3147 TREE_TYPE (primop1)),
3152 /* Here we must do the comparison on the nominal type
3153 using the args exactly as we received them. */
3154 type = *restype_ptr;
3158 if (!real1 && !real2 && integer_zerop (primop1)
3159 && TYPE_UNSIGNED (*restype_ptr))
3165 /* All unsigned values are >= 0, so we warn. However,
3166 if OP0 is a constant that is >= 0, the signedness of
3167 the comparison isn't an issue, so suppress the
3169 if (warn_type_limits && !in_system_header
3170 && !(TREE_CODE (primop0) == INTEGER_CST
3171 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
3173 warning (OPT_Wtype_limits,
3174 "comparison of unsigned expression >= 0 is always true");
3175 value = truthvalue_true_node;
3179 if (warn_type_limits && !in_system_header
3180 && !(TREE_CODE (primop0) == INTEGER_CST
3181 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
3183 warning (OPT_Wtype_limits,
3184 "comparison of unsigned expression < 0 is always false");
3185 value = truthvalue_false_node;
3194 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3195 if (TREE_SIDE_EFFECTS (primop0))
3196 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
3203 *op0_ptr = convert (type, primop0);
3204 *op1_ptr = convert (type, primop1);
3206 *restype_ptr = truthvalue_type_node;
3211 /* Return a tree for the sum or difference (RESULTCODE says which)
3212 of pointer PTROP and integer INTOP. */
3215 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
3219 /* The result is a pointer of the same type that is being added. */
3220 tree result_type = TREE_TYPE (ptrop);
3222 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
3224 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3225 "pointer of type %<void *%> used in arithmetic");
3226 size_exp = integer_one_node;
3228 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
3230 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3231 "pointer to a function used in arithmetic");
3232 size_exp = integer_one_node;
3234 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
3236 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3237 "pointer to member function used in arithmetic");
3238 size_exp = integer_one_node;
3241 size_exp = size_in_bytes (TREE_TYPE (result_type));
3243 /* We are manipulating pointer values, so we don't need to warn
3244 about relying on undefined signed overflow. We disable the
3245 warning here because we use integer types so fold won't know that
3246 they are really pointers. */
3247 fold_defer_overflow_warnings ();
3249 /* If what we are about to multiply by the size of the elements
3250 contains a constant term, apply distributive law
3251 and multiply that constant term separately.
3252 This helps produce common subexpressions. */
3253 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
3254 && !TREE_CONSTANT (intop)
3255 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
3256 && TREE_CONSTANT (size_exp)
3257 /* If the constant comes from pointer subtraction,
3258 skip this optimization--it would cause an error. */
3259 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
3260 /* If the constant is unsigned, and smaller than the pointer size,
3261 then we must skip this optimization. This is because it could cause
3262 an overflow error if the constant is negative but INTOP is not. */
3263 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
3264 || (TYPE_PRECISION (TREE_TYPE (intop))
3265 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
3267 enum tree_code subcode = resultcode;
3268 tree int_type = TREE_TYPE (intop);
3269 if (TREE_CODE (intop) == MINUS_EXPR)
3270 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
3271 /* Convert both subexpression types to the type of intop,
3272 because weird cases involving pointer arithmetic
3273 can result in a sum or difference with different type args. */
3274 ptrop = build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop, 1)),
3276 convert (int_type, TREE_OPERAND (intop, 1)), 1);
3277 intop = convert (int_type, TREE_OPERAND (intop, 0));
3280 /* Convert the integer argument to a type the same size as sizetype
3281 so the multiply won't overflow spuriously. */
3282 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
3283 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
3284 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
3285 TYPE_UNSIGNED (sizetype)), intop);
3287 /* Replace the integer argument with a suitable product by the object size.
3288 Do this multiplication as signed, then convert to the appropriate
3289 type for the pointer operation. */
3290 intop = convert (sizetype,
3291 build_binary_op (EXPR_LOCATION (intop),
3293 convert (TREE_TYPE (intop), size_exp), 1));
3295 /* Create the sum or difference. */
3296 if (resultcode == MINUS_EXPR)
3297 intop = fold_build1 (NEGATE_EXPR, sizetype, intop);
3299 ret = fold_build2 (POINTER_PLUS_EXPR, result_type, ptrop, intop);
3301 fold_undefer_and_ignore_overflow_warnings ();
3306 /* Return whether EXPR is a declaration whose address can never be
3310 decl_with_nonnull_addr_p (const_tree expr)
3312 return (DECL_P (expr)
3313 && (TREE_CODE (expr) == PARM_DECL
3314 || TREE_CODE (expr) == LABEL_DECL
3315 || !DECL_WEAK (expr)));
3318 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3319 or for an `if' or `while' statement or ?..: exp. It should already
3320 have been validated to be of suitable type; otherwise, a bad
3321 diagnostic may result.
3323 The EXPR is located at LOCATION.
3325 This preparation consists of taking the ordinary
3326 representation of an expression expr and producing a valid tree
3327 boolean expression describing whether expr is nonzero. We could
3328 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3329 but we optimize comparisons, &&, ||, and !.
3331 The resulting type should always be `truthvalue_type_node'. */
3334 c_common_truthvalue_conversion (location_t location, tree expr)
3336 switch (TREE_CODE (expr))
3338 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
3339 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
3340 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
3341 case ORDERED_EXPR: case UNORDERED_EXPR:
3342 if (TREE_TYPE (expr) == truthvalue_type_node)
3344 return build2 (TREE_CODE (expr), truthvalue_type_node,
3345 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
3347 case TRUTH_ANDIF_EXPR:
3348 case TRUTH_ORIF_EXPR:
3349 case TRUTH_AND_EXPR:
3351 case TRUTH_XOR_EXPR:
3352 if (TREE_TYPE (expr) == truthvalue_type_node)
3354 return build2 (TREE_CODE (expr), truthvalue_type_node,
3355 c_common_truthvalue_conversion (location,
3356 TREE_OPERAND (expr, 0)),
3357 c_common_truthvalue_conversion (location,
3358 TREE_OPERAND (expr, 1)));
3360 case TRUTH_NOT_EXPR:
3361 if (TREE_TYPE (expr) == truthvalue_type_node)
3363 return build1 (TREE_CODE (expr), truthvalue_type_node,
3364 c_common_truthvalue_conversion (location,
3365 TREE_OPERAND (expr, 0)));
3371 return integer_zerop (expr) ? truthvalue_false_node
3372 : truthvalue_true_node;
3375 return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
3376 ? truthvalue_true_node
3377 : truthvalue_false_node;
3380 return fixed_compare (NE_EXPR, &TREE_FIXED_CST (expr),
3381 &FCONST0 (TYPE_MODE (TREE_TYPE (expr))))
3382 ? truthvalue_true_node
3383 : truthvalue_false_node;
3386 expr = build_unary_op (location, ADDR_EXPR, expr, 0);
3391 tree inner = TREE_OPERAND (expr, 0);
3392 if (decl_with_nonnull_addr_p (inner))
3394 /* Common Ada/Pascal programmer's mistake. */
3395 warning_at (location,
3397 "the address of %qD will always evaluate as %<true%>",
3399 return truthvalue_true_node;
3402 /* If we still have a decl, it is possible for its address to
3403 be NULL, so we cannot optimize. */
3406 gcc_assert (DECL_WEAK (inner));
3410 if (TREE_SIDE_EFFECTS (inner))
3411 return build2 (COMPOUND_EXPR, truthvalue_type_node,
3412 inner, truthvalue_true_node);
3414 return truthvalue_true_node;
3418 return build_binary_op (EXPR_LOCATION (expr),
3419 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
3420 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
3421 c_common_truthvalue_conversion (location,
3422 TREE_OPERAND (expr, 0)),
3423 c_common_truthvalue_conversion (location,
3424 TREE_OPERAND (expr, 1)),
3430 /* These don't change whether an object is nonzero or zero. */
3431 return c_common_truthvalue_conversion (location, TREE_OPERAND (expr, 0));
3435 /* These don't change whether an object is zero or nonzero, but
3436 we can't ignore them if their second arg has side-effects. */
3437 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
3438 return build2 (COMPOUND_EXPR, truthvalue_type_node,
3439 TREE_OPERAND (expr, 1),
3440 c_common_truthvalue_conversion
3441 (location, TREE_OPERAND (expr, 0)));
3443 return c_common_truthvalue_conversion (location,
3444 TREE_OPERAND (expr, 0));
3447 /* Distribute the conversion into the arms of a COND_EXPR. */
3448 return fold_build3 (COND_EXPR, truthvalue_type_node,
3449 TREE_OPERAND (expr, 0),
3450 c_common_truthvalue_conversion (location,
3451 TREE_OPERAND (expr, 1)),
3452 c_common_truthvalue_conversion (location,
3453 TREE_OPERAND (expr, 2)));
3456 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
3457 since that affects how `default_conversion' will behave. */
3458 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
3459 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
3461 /* If this is widening the argument, we can ignore it. */
3462 if (TYPE_PRECISION (TREE_TYPE (expr))
3463 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
3464 return c_common_truthvalue_conversion (location,
3465 TREE_OPERAND (expr, 0));
3469 if (!TREE_NO_WARNING (expr)
3470 && warn_parentheses)
3472 warning (OPT_Wparentheses,
3473 "suggest parentheses around assignment used as truth value");
3474 TREE_NO_WARNING (expr) = 1;
3482 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
3484 tree t = save_expr (expr);
3485 return (build_binary_op
3486 (EXPR_LOCATION (expr),
3487 (TREE_SIDE_EFFECTS (expr)
3488 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
3489 c_common_truthvalue_conversion
3491 build_unary_op (location, REALPART_EXPR, t, 0)),
3492 c_common_truthvalue_conversion
3494 build_unary_op (location, IMAGPART_EXPR, t, 0)),
3498 if (TREE_CODE (TREE_TYPE (expr)) == FIXED_POINT_TYPE)
3500 tree fixed_zero_node = build_fixed (TREE_TYPE (expr),
3502 (TREE_TYPE (expr))));
3503 return build_binary_op (EXPR_LOCATION (expr),
3504 NE_EXPR, expr, fixed_zero_node, 1);
3507 return build_binary_op (EXPR_LOCATION (expr),
3508 NE_EXPR, expr, integer_zero_node, 1);
3511 static void def_builtin_1 (enum built_in_function fncode,
3513 enum built_in_class fnclass,
3514 tree fntype, tree libtype,
3515 bool both_p, bool fallback_p, bool nonansi_p,
3516 tree fnattrs, bool implicit_p);
3519 /* Apply the TYPE_QUALS to the new DECL. */
3522 c_apply_type_quals_to_decl (int type_quals, tree decl)
3524 tree type = TREE_TYPE (decl);
3526 if (type == error_mark_node)
3529 if (((type_quals & TYPE_QUAL_CONST)
3530 || (type && TREE_CODE (type) == REFERENCE_TYPE))
3531 /* An object declared 'const' is only readonly after it is
3532 initialized. We don't have any way of expressing this currently,
3533 so we need to be conservative and unset TREE_READONLY for types
3534 with constructors. Otherwise aliasing code will ignore stores in
3535 an inline constructor. */
3536 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
3537 TREE_READONLY (decl) = 1;
3538 if (type_quals & TYPE_QUAL_VOLATILE)
3540 TREE_SIDE_EFFECTS (decl) = 1;
3541 TREE_THIS_VOLATILE (decl) = 1;
3543 if (type_quals & TYPE_QUAL_RESTRICT)
3545 while (type && TREE_CODE (type) == ARRAY_TYPE)
3546 /* Allow 'restrict' on arrays of pointers.
3547 FIXME currently we just ignore it. */
3548 type = TREE_TYPE (type);
3550 || !POINTER_TYPE_P (type)
3551 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
3552 error ("invalid use of %<restrict%>");
3553 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
3554 /* Indicate we need to make a unique alias set for this pointer.
3555 We can't do it here because it might be pointing to an
3557 DECL_POINTER_ALIAS_SET (decl) = -2;
3561 /* Hash function for the problem of multiple type definitions in
3562 different files. This must hash all types that will compare
3563 equal via comptypes to the same value. In practice it hashes
3564 on some of the simple stuff and leaves the details to comptypes. */
3567 c_type_hash (const void *p)
3571 const_tree const t = (const_tree) p;
3573 switch (TREE_CODE (t))
3575 /* For pointers, hash on pointee type plus some swizzling. */
3577 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
3578 /* Hash on number of elements and total size. */
3581 t2 = TYPE_VALUES (t);
3585 t2 = TYPE_FIELDS (t);
3587 case QUAL_UNION_TYPE:
3589 t2 = TYPE_FIELDS (t);
3593 t2 = TYPE_FIELDS (t);
3598 for (; t2; t2 = TREE_CHAIN (t2))
3600 /* We might have a VLA here. */
3601 if (TREE_CODE (TYPE_SIZE (t)) != INTEGER_CST)
3604 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
3605 return ((size << 24) | (i << shift));
3608 static GTY((param_is (union tree_node))) htab_t type_hash_table;
3610 /* Return the typed-based alias set for T, which may be an expression
3611 or a type. Return -1 if we don't do anything special. */
3614 c_common_get_alias_set (tree t)
3619 /* Permit type-punning when accessing a union, provided the access
3620 is directly through the union. For example, this code does not
3621 permit taking the address of a union member and then storing
3622 through it. Even the type-punning allowed here is a GCC
3623 extension, albeit a common and useful one; the C standard says
3624 that such accesses have implementation-defined behavior. */
3626 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
3627 u = TREE_OPERAND (u, 0))
3628 if (TREE_CODE (u) == COMPONENT_REF
3629 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
3632 /* That's all the expressions we handle specially. */
3636 /* The C standard guarantees that any object may be accessed via an
3637 lvalue that has character type. */
3638 if (t == char_type_node
3639 || t == signed_char_type_node
3640 || t == unsigned_char_type_node)
3643 /* The C standard specifically allows aliasing between signed and
3644 unsigned variants of the same type. We treat the signed
3645 variant as canonical. */
3646 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
3648 tree t1 = c_common_signed_type (t);
3650 /* t1 == t can happen for boolean nodes which are always unsigned. */
3652 return get_alias_set (t1);
3654 else if (POINTER_TYPE_P (t))
3658 /* Unfortunately, there is no canonical form of a pointer type.
3659 In particular, if we have `typedef int I', then `int *', and
3660 `I *' are different types. So, we have to pick a canonical
3661 representative. We do this below.
3663 Technically, this approach is actually more conservative that
3664 it needs to be. In particular, `const int *' and `int *'
3665 should be in different alias sets, according to the C and C++
3666 standard, since their types are not the same, and so,
3667 technically, an `int **' and `const int **' cannot point at
3670 But, the standard is wrong. In particular, this code is
3675 const int* const* cipp = ipp;
3677 And, it doesn't make sense for that to be legal unless you
3678 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
3679 the pointed-to types. This issue has been reported to the
3681 t1 = build_type_no_quals (t);
3683 return get_alias_set (t1);
3686 /* Handle the case of multiple type nodes referring to "the same" type,
3687 which occurs with IMA. These share an alias set. FIXME: Currently only
3688 C90 is handled. (In C99 type compatibility is not transitive, which
3689 complicates things mightily. The alias set splay trees can theoretically
3690 represent this, but insertion is tricky when you consider all the
3691 different orders things might arrive in.) */
3693 if (c_language != clk_c || flag_isoc99)
3696 /* Save time if there's only one input file. */
3697 if (num_in_fnames == 1)
3700 /* Pointers need special handling if they point to any type that
3701 needs special handling (below). */
3702 if (TREE_CODE (t) == POINTER_TYPE)
3705 /* Find bottom type under any nested POINTERs. */
3706 for (t2 = TREE_TYPE (t);
3707 TREE_CODE (t2) == POINTER_TYPE;
3708 t2 = TREE_TYPE (t2))
3710 if (TREE_CODE (t2) != RECORD_TYPE
3711 && TREE_CODE (t2) != ENUMERAL_TYPE
3712 && TREE_CODE (t2) != QUAL_UNION_TYPE
3713 && TREE_CODE (t2) != UNION_TYPE)
3715 if (TYPE_SIZE (t2) == 0)
3718 /* These are the only cases that need special handling. */
3719 if (TREE_CODE (t) != RECORD_TYPE
3720 && TREE_CODE (t) != ENUMERAL_TYPE
3721 && TREE_CODE (t) != QUAL_UNION_TYPE
3722 && TREE_CODE (t) != UNION_TYPE
3723 && TREE_CODE (t) != POINTER_TYPE)
3726 if (TYPE_SIZE (t) == 0)
3729 /* Look up t in hash table. Only one of the compatible types within each
3730 alias set is recorded in the table. */
3731 if (!type_hash_table)
3732 type_hash_table = htab_create_ggc (1021, c_type_hash,
3733 (htab_eq) lang_hooks.types_compatible_p,
3735 slot = htab_find_slot (type_hash_table, t, INSERT);
3738 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
3739 return TYPE_ALIAS_SET ((tree)*slot);
3742 /* Our caller will assign and record (in t) a new alias set; all we need
3743 to do is remember t in the hash table. */
3749 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3750 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3751 flag controls whether we should diagnose possibly ill-formed
3752 constructs or not. */
3755 c_sizeof_or_alignof_type (tree type, bool is_sizeof, int complain)
3757 const char *op_name;
3759 enum tree_code type_code = TREE_CODE (type);
3761 op_name = is_sizeof ? "sizeof" : "__alignof__";
3763 if (type_code == FUNCTION_TYPE)
3767 if (complain && (pedantic || warn_pointer_arith))
3768 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3769 "invalid application of %<sizeof%> to a function type");
3771 return error_mark_node;
3772 value = size_one_node;
3775 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
3777 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
3779 if (type_code == VOID_TYPE
3780 && complain && (pedantic || warn_pointer_arith))
3781 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3782 "invalid application of %qs to a void type", op_name);
3784 return error_mark_node;
3785 value = size_one_node;
3787 else if (!COMPLETE_TYPE_P (type))
3790 error ("invalid application of %qs to incomplete type %qT ",
3792 value = size_zero_node;
3797 /* Convert in case a char is more than one unit. */
3798 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
3799 size_int (TYPE_PRECISION (char_type_node)
3802 value = size_int (TYPE_ALIGN_UNIT (type));
3805 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3806 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3807 never happen. However, this node should really have type
3808 `size_t', which is just a typedef for an ordinary integer type. */
3809 value = fold_convert (size_type_node, value);
3810 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)));
3815 /* Implement the __alignof keyword: Return the minimum required
3816 alignment of EXPR, measured in bytes. For VAR_DECLs,
3817 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
3818 from an "aligned" __attribute__ specification). */
3821 c_alignof_expr (tree expr)
3825 if (VAR_OR_FUNCTION_DECL_P (expr))
3826 t = size_int (DECL_ALIGN_UNIT (expr));
3828 else if (TREE_CODE (expr) == COMPONENT_REF
3829 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
3831 error ("%<__alignof%> applied to a bit-field");
3834 else if (TREE_CODE (expr) == COMPONENT_REF
3835 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
3836 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
3838 else if (TREE_CODE (expr) == INDIRECT_REF)
3840 tree t = TREE_OPERAND (expr, 0);
3842 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3844 while (CONVERT_EXPR_P (t)
3845 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3849 t = TREE_OPERAND (t, 0);
3850 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3851 if (thisalign > bestalign)
3852 best = t, bestalign = thisalign;
3854 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3857 return c_alignof (TREE_TYPE (expr));
3859 return fold_convert (size_type_node, t);
3862 /* Handle C and C++ default attributes. */
3864 enum built_in_attribute
3866 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3867 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3868 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3869 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3870 #include "builtin-attrs.def"
3871 #undef DEF_ATTR_NULL_TREE
3873 #undef DEF_ATTR_IDENT
3874 #undef DEF_ATTR_TREE_LIST
3878 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3880 static void c_init_attributes (void);
3884 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3885 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3886 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3887 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3888 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3889 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3890 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3891 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
3892 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
3893 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3894 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3895 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3896 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3897 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3898 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
3900 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3901 #include "builtin-types.def"
3902 #undef DEF_PRIMITIVE_TYPE
3903 #undef DEF_FUNCTION_TYPE_0
3904 #undef DEF_FUNCTION_TYPE_1
3905 #undef DEF_FUNCTION_TYPE_2
3906 #undef DEF_FUNCTION_TYPE_3
3907 #undef DEF_FUNCTION_TYPE_4
3908 #undef DEF_FUNCTION_TYPE_5
3909 #undef DEF_FUNCTION_TYPE_6
3910 #undef DEF_FUNCTION_TYPE_7
3911 #undef DEF_FUNCTION_TYPE_VAR_0
3912 #undef DEF_FUNCTION_TYPE_VAR_1
3913 #undef DEF_FUNCTION_TYPE_VAR_2
3914 #undef DEF_FUNCTION_TYPE_VAR_3
3915 #undef DEF_FUNCTION_TYPE_VAR_4
3916 #undef DEF_FUNCTION_TYPE_VAR_5
3917 #undef DEF_POINTER_TYPE
3921 typedef enum c_builtin_type builtin_type;
3923 /* A temporary array for c_common_nodes_and_builtins. Used in
3924 communication with def_fn_type. */
3925 static tree builtin_types[(int) BT_LAST + 1];
3927 /* A helper function for c_common_nodes_and_builtins. Build function type
3928 for DEF with return type RET and N arguments. If VAR is true, then the
3929 function should be variadic after those N arguments.
3931 Takes special care not to ICE if any of the types involved are
3932 error_mark_node, which indicates that said type is not in fact available
3933 (see builtin_type_for_size). In which case the function type as a whole
3934 should be error_mark_node. */
3937 def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...)
3939 tree args = NULL, t;
3944 for (i = 0; i < n; ++i)
3946 builtin_type a = (builtin_type) va_arg (list, int);
3947 t = builtin_types[a];
3948 if (t == error_mark_node)
3950 args = tree_cons (NULL_TREE, t, args);
3954 args = nreverse (args);
3956 args = chainon (args, void_list_node);
3958 t = builtin_types[ret];
3959 if (t == error_mark_node)
3961 t = build_function_type (t, args);
3964 builtin_types[def] = t;
3967 /* Build builtin functions common to both C and C++ language
3971 c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node)
3973 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3974 builtin_types[ENUM] = VALUE;
3975 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3976 def_fn_type (ENUM, RETURN, 0, 0);
3977 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3978 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
3979 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3980 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
3981 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3982 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
3983 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3984 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
3985 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3986 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3987 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3989 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3990 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3992 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3993 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3994 def_fn_type (ENUM, RETURN, 1, 0);
3995 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3996 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
3997 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3998 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
3999 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4000 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4001 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4002 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4003 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4004 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4005 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4006 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4008 #include "builtin-types.def"
4010 #undef DEF_PRIMITIVE_TYPE
4011 #undef DEF_FUNCTION_TYPE_1
4012 #undef DEF_FUNCTION_TYPE_2
4013 #undef DEF_FUNCTION_TYPE_3
4014 #undef DEF_FUNCTION_TYPE_4
4015 #undef DEF_FUNCTION_TYPE_5
4016 #undef DEF_FUNCTION_TYPE_6
4017 #undef DEF_FUNCTION_TYPE_VAR_0
4018 #undef DEF_FUNCTION_TYPE_VAR_1
4019 #undef DEF_FUNCTION_TYPE_VAR_2
4020 #undef DEF_FUNCTION_TYPE_VAR_3
4021 #undef DEF_FUNCTION_TYPE_VAR_4
4022 #undef DEF_FUNCTION_TYPE_VAR_5
4023 #undef DEF_POINTER_TYPE
4024 builtin_types[(int) BT_LAST] = NULL_TREE;
4026 c_init_attributes ();
4028 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4029 NONANSI_P, ATTRS, IMPLICIT, COND) \
4031 def_builtin_1 (ENUM, NAME, CLASS, \
4032 builtin_types[(int) TYPE], \
4033 builtin_types[(int) LIBTYPE], \
4034 BOTH_P, FALLBACK_P, NONANSI_P, \
4035 built_in_attributes[(int) ATTRS], IMPLICIT);
4036 #include "builtins.def"
4039 targetm.init_builtins ();
4041 build_common_builtin_nodes ();
4047 /* Build tree nodes and builtin functions common to both C and C++ language
4051 c_common_nodes_and_builtins (void)
4053 int char16_type_size;
4054 int char32_type_size;
4055 int wchar_type_size;
4056 tree array_domain_type;
4057 tree va_list_ref_type_node;
4058 tree va_list_arg_type_node;
4060 /* Define `int' and `char' first so that dbx will output them first. */
4061 record_builtin_type (RID_INT, NULL, integer_type_node);
4062 record_builtin_type (RID_CHAR, "char", char_type_node);
4064 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4065 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4066 but not C. Are the conditionals here needed? */
4067 if (c_dialect_cxx ())
4068 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
4069 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
4070 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
4071 record_builtin_type (RID_MAX, "long unsigned int",
4072 long_unsigned_type_node);
4073 if (c_dialect_cxx ())
4074 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
4075 record_builtin_type (RID_MAX, "long long int",
4076 long_long_integer_type_node);
4077 record_builtin_type (RID_MAX, "long long unsigned int",
4078 long_long_unsigned_type_node);
4079 if (c_dialect_cxx ())
4080 record_builtin_type (RID_MAX, "long long unsigned",
4081 long_long_unsigned_type_node);
4082 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
4083 record_builtin_type (RID_MAX, "short unsigned int",
4084 short_unsigned_type_node);
4085 if (c_dialect_cxx ())
4086 record_builtin_type (RID_MAX, "unsigned short",
4087 short_unsigned_type_node);
4089 /* Define both `signed char' and `unsigned char'. */
4090 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
4091 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
4093 /* These are types that c_common_type_for_size and
4094 c_common_type_for_mode use. */
4095 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
4097 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
4099 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
4101 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
4103 #if HOST_BITS_PER_WIDE_INT >= 64
4104 if (targetm.scalar_mode_supported_p (TImode))
4105 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
4106 get_identifier ("__int128_t"),
4109 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
4110 unsigned_intQI_type_node));
4111 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
4112 unsigned_intHI_type_node));
4113 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
4114 unsigned_intSI_type_node));
4115 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
4116 unsigned_intDI_type_node));
4117 #if HOST_BITS_PER_WIDE_INT >= 64
4118 if (targetm.scalar_mode_supported_p (TImode))
4119 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
4120 get_identifier ("__uint128_t"),
4121 unsigned_intTI_type_node));
4124 /* Create the widest literal types. */
4125 widest_integer_literal_type_node
4126 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
4127 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
4128 widest_integer_literal_type_node));
4130 widest_unsigned_literal_type_node
4131 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
4132 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
4133 widest_unsigned_literal_type_node));
4135 /* `unsigned long' is the standard type for sizeof.
4136 Note that stddef.h uses `unsigned long',
4137 and this must agree, even if long and int are the same size. */
4139 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
4140 signed_size_type_node = c_common_signed_type (size_type_node);
4141 set_sizetype (size_type_node);
4144 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
4146 build_common_tree_nodes_2 (flag_short_double);
4148 record_builtin_type (RID_FLOAT, NULL, float_type_node);
4149 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
4150 record_builtin_type (RID_MAX, "long double", long_double_type_node);
4152 /* Only supported decimal floating point extension if the target
4153 actually supports underlying modes. */
4154 if (targetm.scalar_mode_supported_p (SDmode)
4155 && targetm.scalar_mode_supported_p (DDmode)
4156 && targetm.scalar_mode_supported_p (TDmode))
4158 record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node);
4159 record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node);
4160 record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node);
4163 if (targetm.fixed_point_supported_p ())
4165 record_builtin_type (RID_MAX, "short _Fract", short_fract_type_node);
4166 record_builtin_type (RID_FRACT, NULL, fract_type_node);
4167 record_builtin_type (RID_MAX, "long _Fract", long_fract_type_node);
4168 record_builtin_type (RID_MAX, "long long _Fract",
4169 long_long_fract_type_node);
4170 record_builtin_type (RID_MAX, "unsigned short _Fract",
4171 unsigned_short_fract_type_node);
4172 record_builtin_type (RID_MAX, "unsigned _Fract",
4173 unsigned_fract_type_node);
4174 record_builtin_type (RID_MAX, "unsigned long _Fract",
4175 unsigned_long_fract_type_node);
4176 record_builtin_type (RID_MAX, "unsigned long long _Fract",
4177 unsigned_long_long_fract_type_node);
4178 record_builtin_type (RID_MAX, "_Sat short _Fract",
4179 sat_short_fract_type_node);
4180 record_builtin_type (RID_MAX, "_Sat _Fract", sat_fract_type_node);
4181 record_builtin_type (RID_MAX, "_Sat long _Fract",
4182 sat_long_fract_type_node);
4183 record_builtin_type (RID_MAX, "_Sat long long _Fract",
4184 sat_long_long_fract_type_node);
4185 record_builtin_type (RID_MAX, "_Sat unsigned short _Fract",
4186 sat_unsigned_short_fract_type_node);
4187 record_builtin_type (RID_MAX, "_Sat unsigned _Fract",
4188 sat_unsigned_fract_type_node);
4189 record_builtin_type (RID_MAX, "_Sat unsigned long _Fract",
4190 sat_unsigned_long_fract_type_node);
4191 record_builtin_type (RID_MAX, "_Sat unsigned long long _Fract",
4192 sat_unsigned_long_long_fract_type_node);
4193 record_builtin_type (RID_MAX, "short _Accum", short_accum_type_node);
4194 record_builtin_type (RID_ACCUM, NULL, accum_type_node);
4195 record_builtin_type (RID_MAX, "long _Accum", long_accum_type_node);
4196 record_builtin_type (RID_MAX, "long long _Accum",
4197 long_long_accum_type_node);
4198 record_builtin_type (RID_MAX, "unsigned short _Accum",
4199 unsigned_short_accum_type_node);
4200 record_builtin_type (RID_MAX, "unsigned _Accum",
4201 unsigned_accum_type_node);
4202 record_builtin_type (RID_MAX, "unsigned long _Accum",
4203 unsigned_long_accum_type_node);
4204 record_builtin_type (RID_MAX, "unsigned long long _Accum",
4205 unsigned_long_long_accum_type_node);
4206 record_builtin_type (RID_MAX, "_Sat short _Accum",
4207 sat_short_accum_type_node);
4208 record_builtin_type (RID_MAX, "_Sat _Accum", sat_accum_type_node);
4209 record_builtin_type (RID_MAX, "_Sat long _Accum",
4210 sat_long_accum_type_node);
4211 record_builtin_type (RID_MAX, "_Sat long long _Accum",
4212 sat_long_long_accum_type_node);
4213 record_builtin_type (RID_MAX, "_Sat unsigned short _Accum",
4214 sat_unsigned_short_accum_type_node);
4215 record_builtin_type (RID_MAX, "_Sat unsigned _Accum",
4216 sat_unsigned_accum_type_node);
4217 record_builtin_type (RID_MAX, "_Sat unsigned long _Accum",
4218 sat_unsigned_long_accum_type_node);
4219 record_builtin_type (RID_MAX, "_Sat unsigned long long _Accum",
4220 sat_unsigned_long_long_accum_type_node);
4224 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
4225 get_identifier ("complex int"),
4226 complex_integer_type_node));
4227 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
4228 get_identifier ("complex float"),
4229 complex_float_type_node));
4230 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
4231 get_identifier ("complex double"),
4232 complex_double_type_node));
4233 lang_hooks.decls.pushdecl
4234 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
4235 complex_long_double_type_node));
4237 if (c_dialect_cxx ())
4238 /* For C++, make fileptr_type_node a distinct void * type until
4239 FILE type is defined. */
4240 fileptr_type_node = build_variant_type_copy (ptr_type_node);
4242 record_builtin_type (RID_VOID, NULL, void_type_node);
4244 /* Set the TYPE_NAME for any variants that were built before
4245 record_builtin_type gave names to the built-in types. */
4247 tree void_name = TYPE_NAME (void_type_node);
4248 TYPE_NAME (void_type_node) = NULL_TREE;
4249 TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST))
4251 TYPE_NAME (void_type_node) = void_name;
4254 /* This node must not be shared. */
4255 void_zero_node = make_node (INTEGER_CST);
4256 TREE_TYPE (void_zero_node) = void_type_node;
4258 void_list_node = build_void_list_node ();
4260 /* Make a type to be the domain of a few array types
4261 whose domains don't really matter.
4262 200 is small enough that it always fits in size_t
4263 and large enough that it can hold most function names for the
4264 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4265 array_domain_type = build_index_type (size_int (200));
4267 /* Make a type for arrays of characters.
4268 With luck nothing will ever really depend on the length of this
4270 char_array_type_node
4271 = build_array_type (char_type_node, array_domain_type);
4273 /* Likewise for arrays of ints. */
4275 = build_array_type (integer_type_node, array_domain_type);
4277 string_type_node = build_pointer_type (char_type_node);
4278 const_string_type_node
4279 = build_pointer_type (build_qualified_type
4280 (char_type_node, TYPE_QUAL_CONST));
4282 /* This is special for C++ so functions can be overloaded. */
4283 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
4284 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
4285 wchar_type_size = TYPE_PRECISION (wchar_type_node);
4286 if (c_dialect_cxx ())
4288 if (TYPE_UNSIGNED (wchar_type_node))
4289 wchar_type_node = make_unsigned_type (wchar_type_size);
4291 wchar_type_node = make_signed_type (wchar_type_size);
4292 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
4296 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
4297 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
4300 /* This is for wide string constants. */
4301 wchar_array_type_node
4302 = build_array_type (wchar_type_node, array_domain_type);
4304 /* Define 'char16_t'. */
4305 char16_type_node = get_identifier (CHAR16_TYPE);
4306 char16_type_node = TREE_TYPE (identifier_global_value (char16_type_node));
4307 char16_type_size = TYPE_PRECISION (char16_type_node);
4308 if (c_dialect_cxx ())
4310 char16_type_node = make_unsigned_type (char16_type_size);
4312 if (cxx_dialect == cxx0x)
4313 record_builtin_type (RID_CHAR16, "char16_t", char16_type_node);
4316 /* This is for UTF-16 string constants. */
4317 char16_array_type_node
4318 = build_array_type (char16_type_node, array_domain_type);
4320 /* Define 'char32_t'. */
4321 char32_type_node = get_identifier (CHAR32_TYPE);
4322 char32_type_node = TREE_TYPE (identifier_global_value (char32_type_node));
4323 char32_type_size = TYPE_PRECISION (char32_type_node);
4324 if (c_dialect_cxx ())
4326 char32_type_node = make_unsigned_type (char32_type_size);
4328 if (cxx_dialect == cxx0x)
4329 record_builtin_type (RID_CHAR32, "char32_t", char32_type_node);
4332 /* This is for UTF-32 string constants. */
4333 char32_array_type_node
4334 = build_array_type (char32_type_node, array_domain_type);
4337 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
4340 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
4342 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
4344 default_function_type = build_function_type (integer_type_node, NULL_TREE);
4346 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
4347 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
4349 lang_hooks.decls.pushdecl
4350 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
4351 va_list_type_node));
4352 #ifdef TARGET_ENUM_VA_LIST
4357 for (l = 0; TARGET_ENUM_VA_LIST (l, &pname, &ptype); ++l)
4359 lang_hooks.decls.pushdecl
4360 (build_decl (TYPE_DECL, get_identifier (pname),
4367 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
4369 va_list_arg_type_node = va_list_ref_type_node =
4370 build_pointer_type (TREE_TYPE (va_list_type_node));
4374 va_list_arg_type_node = va_list_type_node;
4375 va_list_ref_type_node = build_reference_type (va_list_type_node);
4378 if (!flag_preprocess_only)
4379 c_define_builtins (va_list_ref_type_node, va_list_arg_type_node);
4381 main_identifier_node = get_identifier ("main");
4383 /* Create the built-in __null node. It is important that this is
4385 null_node = make_node (INTEGER_CST);
4386 TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0);
4388 /* Since builtin_types isn't gc'ed, don't export these nodes. */
4389 memset (builtin_types, 0, sizeof (builtin_types));
4392 /* Look up the function in built_in_decls that corresponds to DECL
4393 and set ASMSPEC as its user assembler name. DECL must be a
4394 function decl that declares a builtin. */
4397 set_builtin_user_assembler_name (tree decl, const char *asmspec)
4400 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
4401 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
4404 builtin = built_in_decls [DECL_FUNCTION_CODE (decl)];
4405 set_user_assembler_name (builtin, asmspec);
4406 if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMCPY)
4407 init_block_move_fn (asmspec);
4408 else if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMSET)
4409 init_block_clear_fn (asmspec);
4412 /* The number of named compound-literals generated thus far. */
4413 static GTY(()) int compound_literal_number;
4415 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
4418 set_compound_literal_name (tree decl)
4421 ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal",
4422 compound_literal_number);
4423 compound_literal_number++;
4424 DECL_NAME (decl) = get_identifier (name);
4428 build_va_arg (tree expr, tree type)
4430 return build1 (VA_ARG_EXPR, type, expr);
4434 /* Linked list of disabled built-in functions. */
4436 typedef struct disabled_builtin
4439 struct disabled_builtin *next;
4441 static disabled_builtin *disabled_builtins = NULL;
4443 static bool builtin_function_disabled_p (const char *);
4445 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
4446 begins with "__builtin_", give an error. */
4449 disable_builtin_function (const char *name)
4451 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
4452 error ("cannot disable built-in function %qs", name);
4455 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
4456 new_disabled_builtin->name = name;
4457 new_disabled_builtin->next = disabled_builtins;
4458 disabled_builtins = new_disabled_builtin;
4463 /* Return true if the built-in function NAME has been disabled, false
4467 builtin_function_disabled_p (const char *name)
4469 disabled_builtin *p;
4470 for (p = disabled_builtins; p != NULL; p = p->next)
4472 if (strcmp (name, p->name) == 0)
4479 /* Worker for DEF_BUILTIN.
4480 Possibly define a builtin function with one or two names.
4481 Does not declare a non-__builtin_ function if flag_no_builtin, or if
4482 nonansi_p and flag_no_nonansi_builtin. */
4485 def_builtin_1 (enum built_in_function fncode,
4487 enum built_in_class fnclass,
4488 tree fntype, tree libtype,
4489 bool both_p, bool fallback_p, bool nonansi_p,
4490 tree fnattrs, bool implicit_p)
4493 const char *libname;
4495 if (fntype == error_mark_node)
4498 gcc_assert ((!both_p && !fallback_p)
4499 || !strncmp (name, "__builtin_",
4500 strlen ("__builtin_")));
4502 libname = name + strlen ("__builtin_");
4503 decl = add_builtin_function (name, fntype, fncode, fnclass,
4504 (fallback_p ? libname : NULL),
4507 && !flag_no_builtin && !builtin_function_disabled_p (libname)
4508 && !(nonansi_p && flag_no_nonansi_builtin))
4509 add_builtin_function (libname, libtype, fncode, fnclass,
4512 built_in_decls[(int) fncode] = decl;
4514 implicit_built_in_decls[(int) fncode] = decl;
4517 /* Nonzero if the type T promotes to int. This is (nearly) the
4518 integral promotions defined in ISO C99 6.3.1.1/2. */
4521 c_promoting_integer_type_p (const_tree t)
4523 switch (TREE_CODE (t))
4526 return (TYPE_MAIN_VARIANT (t) == char_type_node
4527 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
4528 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
4529 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
4530 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
4531 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
4534 /* ??? Technically all enumerations not larger than an int
4535 promote to an int. But this is used along code paths
4536 that only want to notice a size change. */
4537 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
4547 /* Return 1 if PARMS specifies a fixed number of parameters
4548 and none of their types is affected by default promotions. */
4551 self_promoting_args_p (const_tree parms)
4554 for (t = parms; t; t = TREE_CHAIN (t))
4556 tree type = TREE_VALUE (t);
4558 if (type == error_mark_node)
4561 if (TREE_CHAIN (t) == 0 && type != void_type_node)
4567 if (TYPE_MAIN_VARIANT (type) == float_type_node)
4570 if (c_promoting_integer_type_p (type))
4576 /* Recursively remove any '*' or '&' operator from TYPE. */
4578 strip_pointer_operator (tree t)
4580 while (POINTER_TYPE_P (t))
4585 /* Recursively remove pointer or array type from TYPE. */
4587 strip_pointer_or_array_types (tree t)
4589 while (TREE_CODE (t) == ARRAY_TYPE || POINTER_TYPE_P (t))
4594 /* Used to compare case labels. K1 and K2 are actually tree nodes
4595 representing case labels, or NULL_TREE for a `default' label.
4596 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
4597 K2, and 0 if K1 and K2 are equal. */
4600 case_compare (splay_tree_key k1, splay_tree_key k2)
4602 /* Consider a NULL key (such as arises with a `default' label) to be
4603 smaller than anything else. */
4609 return tree_int_cst_compare ((tree) k1, (tree) k2);
4612 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
4613 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
4614 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
4615 case label was declared using the usual C/C++ syntax, rather than
4616 the GNU case range extension. CASES is a tree containing all the
4617 case ranges processed so far; COND is the condition for the
4618 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
4619 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
4622 c_add_case_label (splay_tree cases, tree cond, tree orig_type,
4623 tree low_value, tree high_value)
4628 splay_tree_node node;
4630 /* Create the LABEL_DECL itself. */
4631 label = create_artificial_label ();
4633 /* If there was an error processing the switch condition, bail now
4634 before we get more confused. */
4635 if (!cond || cond == error_mark_node)
4638 if ((low_value && TREE_TYPE (low_value)
4639 && POINTER_TYPE_P (TREE_TYPE (low_value)))
4640 || (high_value && TREE_TYPE (high_value)
4641 && POINTER_TYPE_P (TREE_TYPE (high_value))))
4643 error ("pointers are not permitted as case values");
4647 /* Case ranges are a GNU extension. */
4649 pedwarn (input_location, OPT_pedantic,
4650 "range expressions in switch statements are non-standard");
4652 type = TREE_TYPE (cond);
4655 low_value = check_case_value (low_value);
4656 low_value = convert_and_check (type, low_value);
4657 if (low_value == error_mark_node)
4662 high_value = check_case_value (high_value);
4663 high_value = convert_and_check (type, high_value);
4664 if (high_value == error_mark_node)
4668 if (low_value && high_value)
4670 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
4671 really a case range, even though it was written that way.
4672 Remove the HIGH_VALUE to simplify later processing. */
4673 if (tree_int_cst_equal (low_value, high_value))
4674 high_value = NULL_TREE;
4675 else if (!tree_int_cst_lt (low_value, high_value))
4676 warning (0, "empty range specified");
4679 /* See if the case is in range of the type of the original testing
4680 expression. If both low_value and high_value are out of range,
4681 don't insert the case label and return NULL_TREE. */
4683 && !check_case_bounds (type, orig_type,
4684 &low_value, high_value ? &high_value : NULL))
4687 /* Look up the LOW_VALUE in the table of case labels we already
4689 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
4690 /* If there was not an exact match, check for overlapping ranges.
4691 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
4692 that's a `default' label and the only overlap is an exact match. */
4693 if (!node && (low_value || high_value))
4695 splay_tree_node low_bound;
4696 splay_tree_node high_bound;
4698 /* Even though there wasn't an exact match, there might be an
4699 overlap between this case range and another case range.
4700 Since we've (inductively) not allowed any overlapping case
4701 ranges, we simply need to find the greatest low case label
4702 that is smaller that LOW_VALUE, and the smallest low case
4703 label that is greater than LOW_VALUE. If there is an overlap
4704 it will occur in one of these two ranges. */
4705 low_bound = splay_tree_predecessor (cases,
4706 (splay_tree_key) low_value);
4707 high_bound = splay_tree_successor (cases,
4708 (splay_tree_key) low_value);
4710 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4711 the LOW_VALUE, so there is no need to check unless the
4712 LOW_BOUND is in fact itself a case range. */
4714 && CASE_HIGH ((tree) low_bound->value)
4715 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
4718 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4719 range is bigger than the low end of the current range, so we
4720 are only interested if the current range is a real range, and
4721 not an ordinary case label. */
4724 && (tree_int_cst_compare ((tree) high_bound->key,
4729 /* If there was an overlap, issue an error. */
4732 tree duplicate = CASE_LABEL ((tree) node->value);
4736 error ("duplicate (or overlapping) case value");
4737 error ("%Jthis is the first entry overlapping that value", duplicate);
4741 error ("duplicate case value") ;
4742 error ("%Jpreviously used here", duplicate);
4746 error ("multiple default labels in one switch");
4747 error ("%Jthis is the first default label", duplicate);
4752 /* Add a CASE_LABEL to the statement-tree. */
4753 case_label = add_stmt (build_case_label (low_value, high_value, label));
4754 /* Register this case label in the splay tree. */
4755 splay_tree_insert (cases,
4756 (splay_tree_key) low_value,
4757 (splay_tree_value) case_label);
4762 /* Add a label so that the back-end doesn't think that the beginning of
4763 the switch is unreachable. Note that we do not add a case label, as
4764 that just leads to duplicates and thence to failure later on. */
4767 tree t = create_artificial_label ();
4768 add_stmt (build_stmt (LABEL_EXPR, t));
4770 return error_mark_node;
4773 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
4774 Used to verify that case values match up with enumerator values. */
4777 match_case_to_enum_1 (tree key, tree type, tree label)
4779 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
4781 /* ??? Not working too hard to print the double-word value.
4782 Should perhaps be done with %lwd in the diagnostic routines? */
4783 if (TREE_INT_CST_HIGH (key) == 0)
4784 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
4785 TREE_INT_CST_LOW (key));
4786 else if (!TYPE_UNSIGNED (type)
4787 && TREE_INT_CST_HIGH (key) == -1
4788 && TREE_INT_CST_LOW (key) != 0)
4789 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
4790 -TREE_INT_CST_LOW (key));
4792 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
4793 (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (key),
4794 (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (key));
4796 if (TYPE_NAME (type) == 0)
4797 warning (warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
4798 "%Jcase value %qs not in enumerated type",
4799 CASE_LABEL (label), buf);
4801 warning (warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
4802 "%Jcase value %qs not in enumerated type %qT",
4803 CASE_LABEL (label), buf, type);
4806 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
4807 Used to verify that case values match up with enumerator values. */
4810 match_case_to_enum (splay_tree_node node, void *data)
4812 tree label = (tree) node->value;
4813 tree type = (tree) data;
4815 /* Skip default case. */
4816 if (!CASE_LOW (label))
4819 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
4820 when we did our enum->case scan. Reset our scratch bit after. */
4821 if (!CASE_LOW_SEEN (label))
4822 match_case_to_enum_1 (CASE_LOW (label), type, label);
4824 CASE_LOW_SEEN (label) = 0;
4826 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
4827 not set, that means that CASE_HIGH did not appear when we did our
4828 enum->case scan. Reset our scratch bit after. */
4829 if (CASE_HIGH (label))
4831 if (!CASE_HIGH_SEEN (label))
4832 match_case_to_enum_1 (CASE_HIGH (label), type, label);
4834 CASE_HIGH_SEEN (label) = 0;
4840 /* Handle -Wswitch*. Called from the front end after parsing the
4841 switch construct. */
4842 /* ??? Should probably be somewhere generic, since other languages
4843 besides C and C++ would want this. At the moment, however, C/C++
4844 are the only tree-ssa languages that support enumerations at all,
4845 so the point is moot. */
4848 c_do_switch_warnings (splay_tree cases, location_t switch_location,
4849 tree type, tree cond)
4851 splay_tree_node default_node;
4852 splay_tree_node node;
4854 int saved_warn_switch;
4856 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
4859 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
4861 warning (OPT_Wswitch_default, "%Hswitch missing default case",
4864 /* From here on, we only care about about enumerated types. */
4865 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
4868 /* If the switch expression was an enumerated type, check that
4869 exactly all enumeration literals are covered by the cases.
4870 The check is made when -Wswitch was specified and there is no
4871 default case, or when -Wswitch-enum was specified. */
4873 if (!warn_switch_enum
4874 && !(warn_switch && !default_node))
4877 /* Clearing COND if it is not an integer constant simplifies
4878 the tests inside the loop below. */
4879 if (TREE_CODE (cond) != INTEGER_CST)
4882 /* The time complexity here is O(N*lg(N)) worst case, but for the
4883 common case of monotonically increasing enumerators, it is
4884 O(N), since the nature of the splay tree will keep the next
4885 element adjacent to the root at all times. */
4887 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
4889 tree value = TREE_VALUE (chain);
4890 if (TREE_CODE (value) == CONST_DECL)
4891 value = DECL_INITIAL (value);
4892 node = splay_tree_lookup (cases, (splay_tree_key) value);
4895 /* Mark the CASE_LOW part of the case entry as seen. */
4896 tree label = (tree) node->value;
4897 CASE_LOW_SEEN (label) = 1;
4901 /* Even though there wasn't an exact match, there might be a
4902 case range which includes the enumerator's value. */
4903 node = splay_tree_predecessor (cases, (splay_tree_key) value);
4904 if (node && CASE_HIGH ((tree) node->value))
4906 tree label = (tree) node->value;
4907 int cmp = tree_int_cst_compare (CASE_HIGH (label), value);
4910 /* If we match the upper bound exactly, mark the CASE_HIGH
4911 part of the case entry as seen. */
4913 CASE_HIGH_SEEN (label) = 1;
4918 /* We've now determined that this enumerated literal isn't
4919 handled by the case labels of the switch statement. */
4921 /* If the switch expression is a constant, we only really care
4922 about whether that constant is handled by the switch. */
4923 if (cond && tree_int_cst_compare (cond, value))
4926 /* If there is a default_node, the only relevant option is
4927 Wswitch-enum. Otherwise, if both are enabled then we prefer
4928 to warn using -Wswitch because -Wswitch is enabled by -Wall
4929 while -Wswitch-enum is explicit. */
4930 warning ((default_node || !warn_switch)
4931 ? OPT_Wswitch_enum : OPT_Wswitch,
4932 "%Henumeration value %qE not handled in switch",
4933 &switch_location, TREE_PURPOSE (chain));
4936 /* Warn if there are case expressions that don't correspond to
4937 enumerators. This can occur since C and C++ don't enforce
4938 type-checking of assignments to enumeration variables.
4940 The time complexity here is now always O(N) worst case, since
4941 we should have marked both the lower bound and upper bound of
4942 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
4943 above. This scan also resets those fields. */
4945 /* If there is a default_node, the only relevant option is
4946 Wswitch-enum. Otherwise, if both are enabled then we prefer
4947 to warn using -Wswitch because -Wswitch is enabled by -Wall
4948 while -Wswitch-enum is explicit. */
4949 saved_warn_switch = warn_switch;
4952 splay_tree_foreach (cases, match_case_to_enum, type);
4953 warn_switch = saved_warn_switch;
4957 /* Finish an expression taking the address of LABEL (an
4958 IDENTIFIER_NODE). Returns an expression for the address.
4960 LOC is the location for the expression returned. */
4963 finish_label_address_expr (tree label, location_t loc)
4967 pedwarn (input_location, OPT_pedantic, "taking the address of a label is non-standard");
4969 if (label == error_mark_node)
4970 return error_mark_node;
4972 label = lookup_label (label);
4973 if (label == NULL_TREE)
4974 result = null_pointer_node;
4977 TREE_USED (label) = 1;
4978 result = build1 (ADDR_EXPR, ptr_type_node, label);
4979 /* The current function in not necessarily uninlinable.
4980 Computed gotos are incompatible with inlining, but the value
4981 here could be used only in a diagnostic, for example. */
4982 protected_set_expr_location (result, loc);
4988 /* Hook used by expand_expr to expand language-specific tree codes. */
4989 /* The only things that should go here are bits needed to expand
4990 constant initializers. Everything else should be handled by the
4991 gimplification routines. */
4994 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
4995 int modifiera /* Actually enum expand_modifier. */,
4998 enum expand_modifier modifier = (enum expand_modifier) modifiera;
4999 switch (TREE_CODE (exp))
5001 case COMPOUND_LITERAL_EXPR:
5003 /* Initialize the anonymous variable declared in the compound
5004 literal, then return the variable. */
5005 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
5006 emit_local_var (decl);
5007 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
5015 /* Hook used by staticp to handle language-specific tree codes. */
5018 c_staticp (tree exp)
5020 return (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
5021 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp))
5026 /* Given a boolean expression ARG, return a tree representing an increment
5027 or decrement (as indicated by CODE) of ARG. The front end must check for
5028 invalid cases (e.g., decrement in C++). */
5030 boolean_increment (enum tree_code code, tree arg)
5033 tree true_res = build_int_cst (TREE_TYPE (arg), 1);
5035 arg = stabilize_reference (arg);
5038 case PREINCREMENT_EXPR:
5039 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
5041 case POSTINCREMENT_EXPR:
5042 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
5043 arg = save_expr (arg);
5044 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
5045 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
5047 case PREDECREMENT_EXPR:
5048 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
5049 invert_truthvalue (arg));
5051 case POSTDECREMENT_EXPR:
5052 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
5053 invert_truthvalue (arg));
5054 arg = save_expr (arg);
5055 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
5056 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
5061 TREE_SIDE_EFFECTS (val) = 1;
5065 /* Built-in macros for stddef.h, that require macros defined in this
5068 c_stddef_cpp_builtins(void)
5070 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
5071 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
5072 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
5073 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
5074 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
5075 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
5076 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE, 0);
5077 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE, 0);
5081 c_init_attributes (void)
5083 /* Fill in the built_in_attributes array. */
5084 #define DEF_ATTR_NULL_TREE(ENUM) \
5085 built_in_attributes[(int) ENUM] = NULL_TREE;
5086 #define DEF_ATTR_INT(ENUM, VALUE) \
5087 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
5088 #define DEF_ATTR_IDENT(ENUM, STRING) \
5089 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5090 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5091 built_in_attributes[(int) ENUM] \
5092 = tree_cons (built_in_attributes[(int) PURPOSE], \
5093 built_in_attributes[(int) VALUE], \
5094 built_in_attributes[(int) CHAIN]);
5095 #include "builtin-attrs.def"
5096 #undef DEF_ATTR_NULL_TREE
5098 #undef DEF_ATTR_IDENT
5099 #undef DEF_ATTR_TREE_LIST
5102 /* Attribute handlers common to C front ends. */
5104 /* Handle a "packed" attribute; arguments as in
5105 struct attribute_spec.handler. */
5108 handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5109 int flags, bool *no_add_attrs)
5113 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5114 *node = build_variant_type_copy (*node);
5115 TYPE_PACKED (*node) = 1;
5117 else if (TREE_CODE (*node) == FIELD_DECL)
5119 if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT)
5120 warning (OPT_Wattributes,
5121 "%qE attribute ignored for field of type %qT",
5122 name, TREE_TYPE (*node));
5124 DECL_PACKED (*node) = 1;
5126 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
5127 used for DECL_REGISTER. It wouldn't mean anything anyway.
5128 We can't set DECL_PACKED on the type of a TYPE_DECL, because
5129 that changes what the typedef is typing. */
5132 warning (OPT_Wattributes, "%qE attribute ignored", name);
5133 *no_add_attrs = true;
5139 /* Handle a "nocommon" attribute; arguments as in
5140 struct attribute_spec.handler. */
5143 handle_nocommon_attribute (tree *node, tree name,
5144 tree ARG_UNUSED (args),
5145 int ARG_UNUSED (flags), bool *no_add_attrs)
5147 if (TREE_CODE (*node) == VAR_DECL)
5148 DECL_COMMON (*node) = 0;
5151 warning (OPT_Wattributes, "%qE attribute ignored", name);
5152 *no_add_attrs = true;
5158 /* Handle a "common" attribute; arguments as in
5159 struct attribute_spec.handler. */
5162 handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5163 int ARG_UNUSED (flags), bool *no_add_attrs)
5165 if (TREE_CODE (*node) == VAR_DECL)
5166 DECL_COMMON (*node) = 1;
5169 warning (OPT_Wattributes, "%qE attribute ignored", name);
5170 *no_add_attrs = true;
5176 /* Handle a "noreturn" attribute; arguments as in
5177 struct attribute_spec.handler. */
5180 handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5181 int ARG_UNUSED (flags), bool *no_add_attrs)
5183 tree type = TREE_TYPE (*node);
5185 /* See FIXME comment in c_common_attribute_table. */
5186 if (TREE_CODE (*node) == FUNCTION_DECL)
5187 TREE_THIS_VOLATILE (*node) = 1;
5188 else if (TREE_CODE (type) == POINTER_TYPE
5189 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
5191 = build_pointer_type
5192 (build_type_variant (TREE_TYPE (type),
5193 TYPE_READONLY (TREE_TYPE (type)), 1));
5196 warning (OPT_Wattributes, "%qE attribute ignored", name);
5197 *no_add_attrs = true;
5203 /* Handle a "hot" and attribute; arguments as in
5204 struct attribute_spec.handler. */
5207 handle_hot_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5208 int ARG_UNUSED (flags), bool *no_add_attrs)
5210 if (TREE_CODE (*node) == FUNCTION_DECL)
5212 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node)) != NULL)
5214 warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s",
5216 *no_add_attrs = true;
5218 /* Most of the rest of the hot processing is done later with
5219 lookup_attribute. */
5223 warning (OPT_Wattributes, "%qE attribute ignored", name);
5224 *no_add_attrs = true;
5229 /* Handle a "cold" and attribute; arguments as in
5230 struct attribute_spec.handler. */
5233 handle_cold_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5234 int ARG_UNUSED (flags), bool *no_add_attrs)
5236 if (TREE_CODE (*node) == FUNCTION_DECL)
5238 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node)) != NULL)
5240 warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s",
5242 *no_add_attrs = true;
5244 /* Most of the rest of the cold processing is done later with
5245 lookup_attribute. */
5249 warning (OPT_Wattributes, "%qE attribute ignored", name);
5250 *no_add_attrs = true;
5256 /* Handle a "noinline" attribute; arguments as in
5257 struct attribute_spec.handler. */
5260 handle_noinline_attribute (tree *node, tree name,
5261 tree ARG_UNUSED (args),
5262 int ARG_UNUSED (flags), bool *no_add_attrs)
5264 if (TREE_CODE (*node) == FUNCTION_DECL)
5265 DECL_UNINLINABLE (*node) = 1;
5268 warning (OPT_Wattributes, "%qE attribute ignored", name);
5269 *no_add_attrs = true;
5275 /* Handle a "always_inline" attribute; arguments as in
5276 struct attribute_spec.handler. */
5279 handle_always_inline_attribute (tree *node, tree name,
5280 tree ARG_UNUSED (args),
5281 int ARG_UNUSED (flags),
5284 if (TREE_CODE (*node) == FUNCTION_DECL)
5286 /* Set the attribute and mark it for disregarding inline
5288 DECL_DISREGARD_INLINE_LIMITS (*node) = 1;
5292 warning (OPT_Wattributes, "%qE attribute ignored", name);
5293 *no_add_attrs = true;
5299 /* Handle a "gnu_inline" attribute; arguments as in
5300 struct attribute_spec.handler. */
5303 handle_gnu_inline_attribute (tree *node, tree name,
5304 tree ARG_UNUSED (args),
5305 int ARG_UNUSED (flags),
5308 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
5310 /* Do nothing else, just set the attribute. We'll get at
5311 it later with lookup_attribute. */
5315 warning (OPT_Wattributes, "%qE attribute ignored", name);
5316 *no_add_attrs = true;
5322 /* Handle an "artificial" attribute; arguments as in
5323 struct attribute_spec.handler. */
5326 handle_artificial_attribute (tree *node, tree name,
5327 tree ARG_UNUSED (args),
5328 int ARG_UNUSED (flags),
5331 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
5333 /* Do nothing else, just set the attribute. We'll get at
5334 it later with lookup_attribute. */
5338 warning (OPT_Wattributes, "%qE attribute ignored", name);
5339 *no_add_attrs = true;
5345 /* Handle a "flatten" attribute; arguments as in
5346 struct attribute_spec.handler. */
5349 handle_flatten_attribute (tree *node, tree name,
5350 tree args ATTRIBUTE_UNUSED,
5351 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5353 if (TREE_CODE (*node) == FUNCTION_DECL)
5354 /* Do nothing else, just set the attribute. We'll get at
5355 it later with lookup_attribute. */
5359 warning (OPT_Wattributes, "%qE attribute ignored", name);
5360 *no_add_attrs = true;
5366 /* Handle a "warning" or "error" attribute; arguments as in
5367 struct attribute_spec.handler. */
5370 handle_error_attribute (tree *node, tree name, tree args,
5371 int ARG_UNUSED (flags), bool *no_add_attrs)
5373 if (TREE_CODE (*node) == FUNCTION_DECL
5374 || TREE_CODE (TREE_VALUE (args)) == STRING_CST)
5375 /* Do nothing else, just set the attribute. We'll get at
5376 it later with lookup_attribute. */
5380 warning (OPT_Wattributes, "%qE attribute ignored", name);
5381 *no_add_attrs = true;
5387 /* Handle a "used" attribute; arguments as in
5388 struct attribute_spec.handler. */
5391 handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
5392 int ARG_UNUSED (flags), bool *no_add_attrs)
5396 if (TREE_CODE (node) == FUNCTION_DECL
5397 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
5399 TREE_USED (node) = 1;
5400 DECL_PRESERVE_P (node) = 1;
5404 warning (OPT_Wattributes, "%qE attribute ignored", name);
5405 *no_add_attrs = true;
5411 /* Handle a "unused" attribute; arguments as in
5412 struct attribute_spec.handler. */
5415 handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5416 int flags, bool *no_add_attrs)
5422 if (TREE_CODE (decl) == PARM_DECL
5423 || TREE_CODE (decl) == VAR_DECL
5424 || TREE_CODE (decl) == FUNCTION_DECL
5425 || TREE_CODE (decl) == LABEL_DECL
5426 || TREE_CODE (decl) == TYPE_DECL)
5427 TREE_USED (decl) = 1;
5430 warning (OPT_Wattributes, "%qE attribute ignored", name);
5431 *no_add_attrs = true;
5436 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5437 *node = build_variant_type_copy (*node);
5438 TREE_USED (*node) = 1;
5444 /* Handle a "externally_visible" attribute; arguments as in
5445 struct attribute_spec.handler. */
5448 handle_externally_visible_attribute (tree *pnode, tree name,
5449 tree ARG_UNUSED (args),
5450 int ARG_UNUSED (flags),
5455 if (TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL)
5457 if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL
5458 && !DECL_EXTERNAL (node)) || !TREE_PUBLIC (node))
5460 warning (OPT_Wattributes,
5461 "%qE attribute have effect only on public objects", name);
5462 *no_add_attrs = true;
5467 warning (OPT_Wattributes, "%qE attribute ignored", name);
5468 *no_add_attrs = true;
5474 /* Handle a "const" attribute; arguments as in
5475 struct attribute_spec.handler. */
5478 handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5479 int ARG_UNUSED (flags), bool *no_add_attrs)
5481 tree type = TREE_TYPE (*node);
5483 /* See FIXME comment on noreturn in c_common_attribute_table. */
5484 if (TREE_CODE (*node) == FUNCTION_DECL)
5485 TREE_READONLY (*node) = 1;
5486 else if (TREE_CODE (type) == POINTER_TYPE
5487 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
5489 = build_pointer_type
5490 (build_type_variant (TREE_TYPE (type), 1,
5491 TREE_THIS_VOLATILE (TREE_TYPE (type))));
5494 warning (OPT_Wattributes, "%qE attribute ignored", name);
5495 *no_add_attrs = true;
5501 /* Handle a "transparent_union" attribute; arguments as in
5502 struct attribute_spec.handler. */
5505 handle_transparent_union_attribute (tree *node, tree name,
5506 tree ARG_UNUSED (args), int flags,
5511 *no_add_attrs = true;
5513 if (TREE_CODE (*node) == TYPE_DECL)
5514 node = &TREE_TYPE (*node);
5517 if (TREE_CODE (type) == UNION_TYPE)
5519 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
5520 the code in finish_struct. */
5521 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5523 if (TYPE_FIELDS (type) == NULL_TREE
5524 || TYPE_MODE (type) != DECL_MODE (TYPE_FIELDS (type)))
5527 /* A type variant isn't good enough, since we don't a cast
5528 to such a type removed as a no-op. */
5529 *node = type = build_duplicate_type (type);
5532 TYPE_TRANSPARENT_UNION (type) = 1;
5537 warning (OPT_Wattributes, "%qE attribute ignored", name);
5541 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
5542 get the requested priority for a constructor or destructor,
5543 possibly issuing diagnostics for invalid or reserved
5546 static priority_type
5547 get_priority (tree args, bool is_destructor)
5553 return DEFAULT_INIT_PRIORITY;
5555 if (!SUPPORTS_INIT_PRIORITY)
5558 error ("destructor priorities are not supported");
5560 error ("constructor priorities are not supported");
5561 return DEFAULT_INIT_PRIORITY;
5564 arg = TREE_VALUE (args);
5565 if (!host_integerp (arg, /*pos=*/0)
5566 || !INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5569 pri = tree_low_cst (TREE_VALUE (args), /*pos=*/0);
5570 if (pri < 0 || pri > MAX_INIT_PRIORITY)
5573 if (pri <= MAX_RESERVED_INIT_PRIORITY)
5577 "destructor priorities from 0 to %d are reserved "
5578 "for the implementation",
5579 MAX_RESERVED_INIT_PRIORITY);
5582 "constructor priorities from 0 to %d are reserved "
5583 "for the implementation",
5584 MAX_RESERVED_INIT_PRIORITY);
5590 error ("destructor priorities must be integers from 0 to %d inclusive",
5593 error ("constructor priorities must be integers from 0 to %d inclusive",
5595 return DEFAULT_INIT_PRIORITY;
5598 /* Handle a "constructor" attribute; arguments as in
5599 struct attribute_spec.handler. */
5602 handle_constructor_attribute (tree *node, tree name, tree args,
5603 int ARG_UNUSED (flags),
5607 tree type = TREE_TYPE (decl);
5609 if (TREE_CODE (decl) == FUNCTION_DECL
5610 && TREE_CODE (type) == FUNCTION_TYPE
5611 && decl_function_context (decl) == 0)
5613 priority_type priority;
5614 DECL_STATIC_CONSTRUCTOR (decl) = 1;
5615 priority = get_priority (args, /*is_destructor=*/false);
5616 SET_DECL_INIT_PRIORITY (decl, priority);
5617 TREE_USED (decl) = 1;
5621 warning (OPT_Wattributes, "%qE attribute ignored", name);
5622 *no_add_attrs = true;
5628 /* Handle a "destructor" attribute; arguments as in
5629 struct attribute_spec.handler. */
5632 handle_destructor_attribute (tree *node, tree name, tree args,
5633 int ARG_UNUSED (flags),
5637 tree type = TREE_TYPE (decl);
5639 if (TREE_CODE (decl) == FUNCTION_DECL
5640 && TREE_CODE (type) == FUNCTION_TYPE
5641 && decl_function_context (decl) == 0)
5643 priority_type priority;
5644 DECL_STATIC_DESTRUCTOR (decl) = 1;
5645 priority = get_priority (args, /*is_destructor=*/true);
5646 SET_DECL_FINI_PRIORITY (decl, priority);
5647 TREE_USED (decl) = 1;
5651 warning (OPT_Wattributes, "%qE attribute ignored", name);
5652 *no_add_attrs = true;
5658 /* Handle a "mode" attribute; arguments as in
5659 struct attribute_spec.handler. */
5662 handle_mode_attribute (tree *node, tree name, tree args,
5663 int ARG_UNUSED (flags), bool *no_add_attrs)
5667 *no_add_attrs = true;
5669 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
5670 warning (OPT_Wattributes, "%qE attribute ignored", name);
5674 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
5675 int len = strlen (p);
5676 enum machine_mode mode = VOIDmode;
5680 if (len > 4 && p[0] == '_' && p[1] == '_'
5681 && p[len - 1] == '_' && p[len - 2] == '_')
5683 char *newp = (char *) alloca (len - 1);
5685 strcpy (newp, &p[2]);
5686 newp[len - 4] = '\0';
5690 /* Change this type to have a type with the specified mode.
5691 First check for the special modes. */
5692 if (!strcmp (p, "byte"))
5694 else if (!strcmp (p, "word"))
5696 else if (!strcmp (p, "pointer"))
5698 else if (!strcmp (p, "libgcc_cmp_return"))
5699 mode = targetm.libgcc_cmp_return_mode ();
5700 else if (!strcmp (p, "libgcc_shift_count"))
5701 mode = targetm.libgcc_shift_count_mode ();
5702 else if (!strcmp (p, "unwind_word"))
5703 mode = targetm.unwind_word_mode ();
5705 for (j = 0; j < NUM_MACHINE_MODES; j++)
5706 if (!strcmp (p, GET_MODE_NAME (j)))
5708 mode = (enum machine_mode) j;
5712 if (mode == VOIDmode)
5714 error ("unknown machine mode %qs", p);
5719 switch (GET_MODE_CLASS (mode))
5722 case MODE_PARTIAL_INT:
5724 case MODE_DECIMAL_FLOAT:
5729 valid_mode = targetm.scalar_mode_supported_p (mode);
5732 case MODE_COMPLEX_INT:
5733 case MODE_COMPLEX_FLOAT:
5734 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
5737 case MODE_VECTOR_INT:
5738 case MODE_VECTOR_FLOAT:
5739 case MODE_VECTOR_FRACT:
5740 case MODE_VECTOR_UFRACT:
5741 case MODE_VECTOR_ACCUM:
5742 case MODE_VECTOR_UACCUM:
5743 warning (OPT_Wattributes, "specifying vector types with "
5744 "__attribute__ ((mode)) is deprecated");
5745 warning (OPT_Wattributes,
5746 "use __attribute__ ((vector_size)) instead");
5747 valid_mode = vector_mode_valid_p (mode);
5755 error ("unable to emulate %qs", p);
5759 if (POINTER_TYPE_P (type))
5761 tree (*fn)(tree, enum machine_mode, bool);
5763 if (!targetm.valid_pointer_mode (mode))
5765 error ("invalid pointer mode %qs", p);
5769 if (TREE_CODE (type) == POINTER_TYPE)
5770 fn = build_pointer_type_for_mode;
5772 fn = build_reference_type_for_mode;
5773 typefm = fn (TREE_TYPE (type), mode, false);
5777 /* For fixed-point modes, we need to test if the signness of type
5778 and the machine mode are consistent. */
5779 if (ALL_FIXED_POINT_MODE_P (mode)
5780 && TYPE_UNSIGNED (type) != UNSIGNED_FIXED_POINT_MODE_P (mode))
5782 error ("signness of type and machine mode %qs don't match", p);
5785 /* For fixed-point modes, we need to pass saturating info. */
5786 typefm = lang_hooks.types.type_for_mode (mode,
5787 ALL_FIXED_POINT_MODE_P (mode) ? TYPE_SATURATING (type)
5788 : TYPE_UNSIGNED (type));
5791 if (typefm == NULL_TREE)
5793 error ("no data type for mode %qs", p);
5796 else if (TREE_CODE (type) == ENUMERAL_TYPE)
5798 /* For enumeral types, copy the precision from the integer
5799 type returned above. If not an INTEGER_TYPE, we can't use
5800 this mode for this type. */
5801 if (TREE_CODE (typefm) != INTEGER_TYPE)
5803 error ("cannot use mode %qs for enumeral types", p);
5807 if (flags & ATTR_FLAG_TYPE_IN_PLACE)
5809 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
5814 /* We cannot build a type variant, as there's code that assumes
5815 that TYPE_MAIN_VARIANT has the same mode. This includes the
5816 debug generators. Instead, create a subrange type. This
5817 results in all of the enumeral values being emitted only once
5818 in the original, and the subtype gets them by reference. */
5819 if (TYPE_UNSIGNED (type))
5820 typefm = make_unsigned_type (TYPE_PRECISION (typefm));
5822 typefm = make_signed_type (TYPE_PRECISION (typefm));
5823 TREE_TYPE (typefm) = type;
5826 else if (VECTOR_MODE_P (mode)
5827 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
5828 : TREE_CODE (type) != TREE_CODE (typefm))
5830 error ("mode %qs applied to inappropriate type", p);
5840 /* Handle a "section" attribute; arguments as in
5841 struct attribute_spec.handler. */
5844 handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
5845 int ARG_UNUSED (flags), bool *no_add_attrs)
5849 if (targetm.have_named_sections)
5851 user_defined_section_attribute = true;
5853 if ((TREE_CODE (decl) == FUNCTION_DECL
5854 || TREE_CODE (decl) == VAR_DECL)
5855 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
5857 if (TREE_CODE (decl) == VAR_DECL
5858 && current_function_decl != NULL_TREE
5859 && !TREE_STATIC (decl))
5861 error ("%Jsection attribute cannot be specified for "
5862 "local variables", decl);
5863 *no_add_attrs = true;
5866 /* The decl may have already been given a section attribute
5867 from a previous declaration. Ensure they match. */
5868 else if (DECL_SECTION_NAME (decl) != NULL_TREE
5869 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
5870 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
5872 error ("section of %q+D conflicts with previous declaration",
5874 *no_add_attrs = true;
5876 else if (TREE_CODE (decl) == VAR_DECL
5877 && !targetm.have_tls && targetm.emutls.tmpl_section
5878 && DECL_THREAD_LOCAL_P (decl))
5880 error ("section of %q+D cannot be overridden", *node);
5881 *no_add_attrs = true;
5884 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
5888 error ("section attribute not allowed for %q+D", *node);
5889 *no_add_attrs = true;
5894 error ("%Jsection attributes are not supported for this target", *node);
5895 *no_add_attrs = true;
5901 /* Handle a "aligned" attribute; arguments as in
5902 struct attribute_spec.handler. */
5905 handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
5906 int flags, bool *no_add_attrs)
5908 tree decl = NULL_TREE;
5911 tree align_expr = (args ? TREE_VALUE (args)
5912 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
5918 type = &TREE_TYPE (decl);
5919 is_type = TREE_CODE (*node) == TYPE_DECL;
5921 else if (TYPE_P (*node))
5922 type = node, is_type = 1;
5924 if (TREE_CODE (align_expr) != INTEGER_CST)
5926 error ("requested alignment is not a constant");
5927 *no_add_attrs = true;
5929 else if ((i = tree_log2 (align_expr)) == -1)
5931 error ("requested alignment is not a power of 2");
5932 *no_add_attrs = true;
5934 else if (i > HOST_BITS_PER_INT - 2)
5936 error ("requested alignment is too large");
5937 *no_add_attrs = true;
5941 /* If we have a TYPE_DECL, then copy the type, so that we
5942 don't accidentally modify a builtin type. See pushdecl. */
5943 if (decl && TREE_TYPE (decl) != error_mark_node
5944 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
5946 tree tt = TREE_TYPE (decl);
5947 *type = build_variant_type_copy (*type);
5948 DECL_ORIGINAL_TYPE (decl) = tt;
5949 TYPE_NAME (*type) = decl;
5950 TREE_USED (*type) = TREE_USED (decl);
5951 TREE_TYPE (decl) = *type;
5953 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5954 *type = build_variant_type_copy (*type);
5956 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
5957 TYPE_USER_ALIGN (*type) = 1;
5959 else if (! VAR_OR_FUNCTION_DECL_P (decl)
5960 && TREE_CODE (decl) != FIELD_DECL)
5962 error ("alignment may not be specified for %q+D", decl);
5963 *no_add_attrs = true;
5965 else if (TREE_CODE (decl) == FUNCTION_DECL
5966 && DECL_ALIGN (decl) > (1 << i) * BITS_PER_UNIT)
5968 if (DECL_USER_ALIGN (decl))
5969 error ("alignment for %q+D was previously specified as %d "
5970 "and may not be decreased", decl,
5971 DECL_ALIGN (decl) / BITS_PER_UNIT);
5973 error ("alignment for %q+D must be at least %d", decl,
5974 DECL_ALIGN (decl) / BITS_PER_UNIT);
5975 *no_add_attrs = true;
5979 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
5980 DECL_USER_ALIGN (decl) = 1;
5986 /* Handle a "weak" attribute; arguments as in
5987 struct attribute_spec.handler. */
5990 handle_weak_attribute (tree *node, tree name,
5991 tree ARG_UNUSED (args),
5992 int ARG_UNUSED (flags),
5993 bool * ARG_UNUSED (no_add_attrs))
5995 if (TREE_CODE (*node) == FUNCTION_DECL
5996 && DECL_DECLARED_INLINE_P (*node))
5998 error ("inline function %q+D cannot be declared weak", *node);
5999 *no_add_attrs = true;
6001 else if (TREE_CODE (*node) == FUNCTION_DECL
6002 || TREE_CODE (*node) == VAR_DECL)
6003 declare_weak (*node);
6005 warning (OPT_Wattributes, "%qE attribute ignored", name);
6010 /* Handle an "alias" attribute; arguments as in
6011 struct attribute_spec.handler. */
6014 handle_alias_attribute (tree *node, tree name, tree args,
6015 int ARG_UNUSED (flags), bool *no_add_attrs)
6019 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
6020 || (TREE_CODE (decl) != FUNCTION_DECL
6021 && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl))
6022 /* A static variable declaration is always a tentative definition,
6023 but the alias is a non-tentative definition which overrides. */
6024 || (TREE_CODE (decl) != FUNCTION_DECL
6025 && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl)))
6027 error ("%q+D defined both normally and as an alias", decl);
6028 *no_add_attrs = true;
6031 /* Note that the very first time we process a nested declaration,
6032 decl_function_context will not be set. Indeed, *would* never
6033 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
6034 we do below. After such frobbery, pushdecl would set the context.
6035 In any case, this is never what we want. */
6036 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
6040 id = TREE_VALUE (args);
6041 if (TREE_CODE (id) != STRING_CST)
6043 error ("alias argument not a string");
6044 *no_add_attrs = true;
6047 id = get_identifier (TREE_STRING_POINTER (id));
6048 /* This counts as a use of the object pointed to. */
6051 if (TREE_CODE (decl) == FUNCTION_DECL)
6052 DECL_INITIAL (decl) = error_mark_node;
6055 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
6056 DECL_EXTERNAL (decl) = 1;
6058 DECL_EXTERNAL (decl) = 0;
6059 TREE_STATIC (decl) = 1;
6064 warning (OPT_Wattributes, "%qE attribute ignored", name);
6065 *no_add_attrs = true;
6071 /* Handle a "weakref" attribute; arguments as in struct
6072 attribute_spec.handler. */
6075 handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args,
6076 int flags, bool *no_add_attrs)
6078 tree attr = NULL_TREE;
6080 /* We must ignore the attribute when it is associated with
6081 local-scoped decls, since attribute alias is ignored and many
6082 such symbols do not even have a DECL_WEAK field. */
6083 if (decl_function_context (*node)
6084 || current_function_decl
6085 || (TREE_CODE (*node) != VAR_DECL && TREE_CODE (*node) != FUNCTION_DECL))
6087 warning (OPT_Wattributes, "%qE attribute ignored", name);
6088 *no_add_attrs = true;
6092 /* The idea here is that `weakref("name")' mutates into `weakref,
6093 alias("name")', and weakref without arguments, in turn,
6094 implicitly adds weak. */
6098 attr = tree_cons (get_identifier ("alias"), args, attr);
6099 attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr);
6101 *no_add_attrs = true;
6103 decl_attributes (node, attr, flags);
6107 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node)))
6108 error ("%Jweakref attribute must appear before alias attribute",
6111 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
6112 and that isn't supported; and because it wants to add it to
6113 the list of weak decls, which isn't helpful. */
6114 DECL_WEAK (*node) = 1;
6120 /* Handle an "visibility" attribute; arguments as in
6121 struct attribute_spec.handler. */
6124 handle_visibility_attribute (tree *node, tree name, tree args,
6125 int ARG_UNUSED (flags),
6126 bool *ARG_UNUSED (no_add_attrs))
6129 tree id = TREE_VALUE (args);
6130 enum symbol_visibility vis;
6134 if (TREE_CODE (*node) == ENUMERAL_TYPE)
6136 else if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE)
6138 warning (OPT_Wattributes, "%qE attribute ignored on non-class types",
6142 else if (TYPE_FIELDS (*node))
6144 error ("%qE attribute ignored because %qT is already defined",
6149 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
6151 warning (OPT_Wattributes, "%qE attribute ignored", name);
6155 if (TREE_CODE (id) != STRING_CST)
6157 error ("visibility argument not a string");
6161 /* If this is a type, set the visibility on the type decl. */
6164 decl = TYPE_NAME (decl);
6167 if (TREE_CODE (decl) == IDENTIFIER_NODE)
6169 warning (OPT_Wattributes, "%qE attribute ignored on types",
6175 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
6176 vis = VISIBILITY_DEFAULT;
6177 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
6178 vis = VISIBILITY_INTERNAL;
6179 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
6180 vis = VISIBILITY_HIDDEN;
6181 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
6182 vis = VISIBILITY_PROTECTED;
6185 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
6186 vis = VISIBILITY_DEFAULT;
6189 if (DECL_VISIBILITY_SPECIFIED (decl)
6190 && vis != DECL_VISIBILITY (decl))
6192 tree attributes = (TYPE_P (*node)
6193 ? TYPE_ATTRIBUTES (*node)
6194 : DECL_ATTRIBUTES (decl));
6195 if (lookup_attribute ("visibility", attributes))
6196 error ("%qD redeclared with different visibility", decl);
6197 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6198 && lookup_attribute ("dllimport", attributes))
6199 error ("%qD was declared %qs which implies default visibility",
6201 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6202 && lookup_attribute ("dllexport", attributes))
6203 error ("%qD was declared %qs which implies default visibility",
6207 DECL_VISIBILITY (decl) = vis;
6208 DECL_VISIBILITY_SPECIFIED (decl) = 1;
6210 /* Go ahead and attach the attribute to the node as well. This is needed
6211 so we can determine whether we have VISIBILITY_DEFAULT because the
6212 visibility was not specified, or because it was explicitly overridden
6213 from the containing scope. */
6218 /* Determine the ELF symbol visibility for DECL, which is either a
6219 variable or a function. It is an error to use this function if a
6220 definition of DECL is not available in this translation unit.
6221 Returns true if the final visibility has been determined by this
6222 function; false if the caller is free to make additional
6226 c_determine_visibility (tree decl)
6228 gcc_assert (TREE_CODE (decl) == VAR_DECL
6229 || TREE_CODE (decl) == FUNCTION_DECL);
6231 /* If the user explicitly specified the visibility with an
6232 attribute, honor that. DECL_VISIBILITY will have been set during
6233 the processing of the attribute. We check for an explicit
6234 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
6235 to distinguish the use of an attribute from the use of a "#pragma
6236 GCC visibility push(...)"; in the latter case we still want other
6237 considerations to be able to overrule the #pragma. */
6238 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl))
6239 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6240 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl))
6241 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))))
6244 /* Set default visibility to whatever the user supplied with
6245 visibility_specified depending on #pragma GCC visibility. */
6246 if (!DECL_VISIBILITY_SPECIFIED (decl))
6248 DECL_VISIBILITY (decl) = default_visibility;
6249 DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
6254 /* Handle an "tls_model" attribute; arguments as in
6255 struct attribute_spec.handler. */
6258 handle_tls_model_attribute (tree *node, tree name, tree args,
6259 int ARG_UNUSED (flags), bool *no_add_attrs)
6263 enum tls_model kind;
6265 *no_add_attrs = true;
6267 if (!DECL_THREAD_LOCAL_P (decl))
6269 warning (OPT_Wattributes, "%qE attribute ignored", name);
6273 kind = DECL_TLS_MODEL (decl);
6274 id = TREE_VALUE (args);
6275 if (TREE_CODE (id) != STRING_CST)
6277 error ("tls_model argument not a string");
6281 if (!strcmp (TREE_STRING_POINTER (id), "local-exec"))
6282 kind = TLS_MODEL_LOCAL_EXEC;
6283 else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec"))
6284 kind = TLS_MODEL_INITIAL_EXEC;
6285 else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic"))
6286 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
6287 else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
6288 kind = TLS_MODEL_GLOBAL_DYNAMIC;
6290 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
6292 DECL_TLS_MODEL (decl) = kind;
6296 /* Handle a "no_instrument_function" attribute; arguments as in
6297 struct attribute_spec.handler. */
6300 handle_no_instrument_function_attribute (tree *node, tree name,
6301 tree ARG_UNUSED (args),
6302 int ARG_UNUSED (flags),
6307 if (TREE_CODE (decl) != FUNCTION_DECL)
6309 error ("%J%qE attribute applies only to functions", decl, name);
6310 *no_add_attrs = true;
6312 else if (DECL_INITIAL (decl))
6314 error ("%Jcan%'t set %qE attribute after definition", decl, name);
6315 *no_add_attrs = true;
6318 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
6323 /* Handle a "malloc" attribute; arguments as in
6324 struct attribute_spec.handler. */
6327 handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6328 int ARG_UNUSED (flags), bool *no_add_attrs)
6330 if (TREE_CODE (*node) == FUNCTION_DECL
6331 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node))))
6332 DECL_IS_MALLOC (*node) = 1;
6335 warning (OPT_Wattributes, "%qE attribute ignored", name);
6336 *no_add_attrs = true;
6342 /* Handle a "alloc_size" attribute; arguments as in
6343 struct attribute_spec.handler. */
6346 handle_alloc_size_attribute (tree *node, tree ARG_UNUSED (name), tree args,
6347 int ARG_UNUSED (flags), bool *no_add_attrs)
6349 unsigned arg_count = type_num_arguments (*node);
6350 for (; args; args = TREE_CHAIN (args))
6352 tree position = TREE_VALUE (args);
6354 if (TREE_CODE (position) != INTEGER_CST
6355 || TREE_INT_CST_HIGH (position)
6356 || TREE_INT_CST_LOW (position) < 1
6357 || TREE_INT_CST_LOW (position) > arg_count )
6359 warning (OPT_Wattributes,
6360 "alloc_size parameter outside range");
6361 *no_add_attrs = true;
6368 /* Handle a "returns_twice" attribute; arguments as in
6369 struct attribute_spec.handler. */
6372 handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6373 int ARG_UNUSED (flags), bool *no_add_attrs)
6375 if (TREE_CODE (*node) == FUNCTION_DECL)
6376 DECL_IS_RETURNS_TWICE (*node) = 1;
6379 warning (OPT_Wattributes, "%qE attribute ignored", name);
6380 *no_add_attrs = true;
6386 /* Handle a "no_limit_stack" attribute; arguments as in
6387 struct attribute_spec.handler. */
6390 handle_no_limit_stack_attribute (tree *node, tree name,
6391 tree ARG_UNUSED (args),
6392 int ARG_UNUSED (flags),
6397 if (TREE_CODE (decl) != FUNCTION_DECL)
6399 error ("%J%qE attribute applies only to functions", decl, name);
6400 *no_add_attrs = true;
6402 else if (DECL_INITIAL (decl))
6404 error ("%Jcan%'t set %qE attribute after definition", decl, name);
6405 *no_add_attrs = true;
6408 DECL_NO_LIMIT_STACK (decl) = 1;
6413 /* Handle a "pure" attribute; arguments as in
6414 struct attribute_spec.handler. */
6417 handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6418 int ARG_UNUSED (flags), bool *no_add_attrs)
6420 if (TREE_CODE (*node) == FUNCTION_DECL)
6421 DECL_PURE_P (*node) = 1;
6422 /* ??? TODO: Support types. */
6425 warning (OPT_Wattributes, "%qE attribute ignored", name);
6426 *no_add_attrs = true;
6432 /* Handle a "no vops" attribute; arguments as in
6433 struct attribute_spec.handler. */
6436 handle_novops_attribute (tree *node, tree ARG_UNUSED (name),
6437 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
6438 bool *ARG_UNUSED (no_add_attrs))
6440 gcc_assert (TREE_CODE (*node) == FUNCTION_DECL);
6441 DECL_IS_NOVOPS (*node) = 1;
6445 /* Handle a "deprecated" attribute; arguments as in
6446 struct attribute_spec.handler. */
6449 handle_deprecated_attribute (tree *node, tree name,
6450 tree ARG_UNUSED (args), int flags,
6453 tree type = NULL_TREE;
6455 tree what = NULL_TREE;
6460 type = TREE_TYPE (decl);
6462 if (TREE_CODE (decl) == TYPE_DECL
6463 || TREE_CODE (decl) == PARM_DECL
6464 || TREE_CODE (decl) == VAR_DECL
6465 || TREE_CODE (decl) == FUNCTION_DECL
6466 || TREE_CODE (decl) == FIELD_DECL)
6467 TREE_DEPRECATED (decl) = 1;
6471 else if (TYPE_P (*node))
6473 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
6474 *node = build_variant_type_copy (*node);
6475 TREE_DEPRECATED (*node) = 1;
6483 *no_add_attrs = true;
6484 if (type && TYPE_NAME (type))
6486 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
6487 what = TYPE_NAME (*node);
6488 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
6489 && DECL_NAME (TYPE_NAME (type)))
6490 what = DECL_NAME (TYPE_NAME (type));
6493 warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what);
6495 warning (OPT_Wattributes, "%qE attribute ignored", name);
6501 /* Handle a "vector_size" attribute; arguments as in
6502 struct attribute_spec.handler. */
6505 handle_vector_size_attribute (tree *node, tree name, tree args,
6506 int ARG_UNUSED (flags),
6509 unsigned HOST_WIDE_INT vecsize, nunits;
6510 enum machine_mode orig_mode;
6511 tree type = *node, new_type, size;
6513 *no_add_attrs = true;
6515 size = TREE_VALUE (args);
6517 if (!host_integerp (size, 1))
6519 warning (OPT_Wattributes, "%qE attribute ignored", name);
6523 /* Get the vector size (in bytes). */
6524 vecsize = tree_low_cst (size, 1);
6526 /* We need to provide for vector pointers, vector arrays, and
6527 functions returning vectors. For example:
6529 __attribute__((vector_size(16))) short *foo;
6531 In this case, the mode is SI, but the type being modified is
6532 HI, so we need to look further. */
6534 while (POINTER_TYPE_P (type)
6535 || TREE_CODE (type) == FUNCTION_TYPE
6536 || TREE_CODE (type) == METHOD_TYPE
6537 || TREE_CODE (type) == ARRAY_TYPE
6538 || TREE_CODE (type) == OFFSET_TYPE)
6539 type = TREE_TYPE (type);
6541 /* Get the mode of the type being modified. */
6542 orig_mode = TYPE_MODE (type);
6544 if ((!INTEGRAL_TYPE_P (type)
6545 && !SCALAR_FLOAT_TYPE_P (type)
6546 && !FIXED_POINT_TYPE_P (type))
6547 || (!SCALAR_FLOAT_MODE_P (orig_mode)
6548 && GET_MODE_CLASS (orig_mode) != MODE_INT
6549 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode))
6550 || !host_integerp (TYPE_SIZE_UNIT (type), 1))
6552 error ("invalid vector type for attribute %qE", name);
6556 if (vecsize % tree_low_cst (TYPE_SIZE_UNIT (type), 1))
6558 error ("vector size not an integral multiple of component size");
6564 error ("zero vector size");
6568 /* Calculate how many units fit in the vector. */
6569 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
6570 if (nunits & (nunits - 1))
6572 error ("number of components of the vector not a power of two");
6576 new_type = build_vector_type (type, nunits);
6578 /* Build back pointers if needed. */
6579 *node = lang_hooks.types.reconstruct_complex_type (*node, new_type);
6584 /* Handle the "nonnull" attribute. */
6586 handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
6587 tree args, int ARG_UNUSED (flags),
6591 unsigned HOST_WIDE_INT attr_arg_num;
6593 /* If no arguments are specified, all pointer arguments should be
6594 non-null. Verify a full prototype is given so that the arguments
6595 will have the correct types when we actually check them later. */
6598 if (!TYPE_ARG_TYPES (type))
6600 error ("nonnull attribute without arguments on a non-prototype");
6601 *no_add_attrs = true;
6606 /* Argument list specified. Verify that each argument number references
6607 a pointer argument. */
6608 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
6611 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
6613 if (!get_nonnull_operand (TREE_VALUE (args), &arg_num))
6615 error ("nonnull argument has invalid operand number (argument %lu)",
6616 (unsigned long) attr_arg_num);
6617 *no_add_attrs = true;
6621 argument = TYPE_ARG_TYPES (type);
6624 for (ck_num = 1; ; ck_num++)
6626 if (!argument || ck_num == arg_num)
6628 argument = TREE_CHAIN (argument);
6632 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
6634 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
6635 (unsigned long) attr_arg_num, (unsigned long) arg_num);
6636 *no_add_attrs = true;
6640 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
6642 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
6643 (unsigned long) attr_arg_num, (unsigned long) arg_num);
6644 *no_add_attrs = true;
6653 /* Check the argument list of a function call for null in argument slots
6654 that are marked as requiring a non-null pointer argument. The NARGS
6655 arguments are passed in the array ARGARRAY.
6659 check_function_nonnull (tree attrs, int nargs, tree *argarray)
6664 for (a = attrs; a; a = TREE_CHAIN (a))
6666 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
6668 args = TREE_VALUE (a);
6670 /* Walk the argument list. If we encounter an argument number we
6671 should check for non-null, do it. If the attribute has no args,
6672 then every pointer argument is checked (in which case the check
6673 for pointer type is done in check_nonnull_arg). */
6674 for (i = 0; i < nargs; i++)
6676 if (!args || nonnull_check_p (args, i + 1))
6677 check_function_arguments_recurse (check_nonnull_arg, NULL,
6685 /* Check that the Nth argument of a function call (counting backwards
6686 from the end) is a (pointer)0. The NARGS arguments are passed in the
6690 check_function_sentinel (tree attrs, int nargs, tree *argarray, tree typelist)
6692 tree attr = lookup_attribute ("sentinel", attrs);
6700 /* Skip over the named arguments. */
6701 while (typelist && len < nargs)
6703 typelist = TREE_CHAIN (typelist);
6707 if (TREE_VALUE (attr))
6709 tree p = TREE_VALUE (TREE_VALUE (attr));
6710 pos = TREE_INT_CST_LOW (p);
6713 /* The sentinel must be one of the varargs, i.e.
6714 in position >= the number of fixed arguments. */
6715 if ((nargs - 1 - pos) < len)
6717 warning (OPT_Wformat,
6718 "not enough variable arguments to fit a sentinel");
6722 /* Validate the sentinel. */
6723 sentinel = argarray[nargs - 1 - pos];
6724 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel))
6725 || !integer_zerop (sentinel))
6726 /* Although __null (in C++) is only an integer we allow it
6727 nevertheless, as we are guaranteed that it's exactly
6728 as wide as a pointer, and we don't want to force
6729 users to cast the NULL they have written there.
6730 We warn with -Wstrict-null-sentinel, though. */
6731 && (warn_strict_null_sentinel || null_node != sentinel))
6732 warning (OPT_Wformat, "missing sentinel in function call");
6736 /* Helper for check_function_nonnull; given a list of operands which
6737 must be non-null in ARGS, determine if operand PARAM_NUM should be
6741 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
6743 unsigned HOST_WIDE_INT arg_num = 0;
6745 for (; args; args = TREE_CHAIN (args))
6747 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
6751 if (arg_num == param_num)
6757 /* Check that the function argument PARAM (which is operand number
6758 PARAM_NUM) is non-null. This is called by check_function_nonnull
6759 via check_function_arguments_recurse. */
6762 check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
6763 unsigned HOST_WIDE_INT param_num)
6765 /* Just skip checking the argument if it's not a pointer. This can
6766 happen if the "nonnull" attribute was given without an operand
6767 list (which means to check every pointer argument). */
6769 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
6772 if (integer_zerop (param))
6773 warning (OPT_Wnonnull, "null argument where non-null required "
6774 "(argument %lu)", (unsigned long) param_num);
6777 /* Helper for nonnull attribute handling; fetch the operand number
6778 from the attribute argument list. */
6781 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
6783 /* Verify the arg number is a constant. */
6784 if (TREE_CODE (arg_num_expr) != INTEGER_CST
6785 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
6788 *valp = TREE_INT_CST_LOW (arg_num_expr);
6792 /* Handle a "nothrow" attribute; arguments as in
6793 struct attribute_spec.handler. */
6796 handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6797 int ARG_UNUSED (flags), bool *no_add_attrs)
6799 if (TREE_CODE (*node) == FUNCTION_DECL)
6800 TREE_NOTHROW (*node) = 1;
6801 /* ??? TODO: Support types. */
6804 warning (OPT_Wattributes, "%qE attribute ignored", name);
6805 *no_add_attrs = true;
6811 /* Handle a "cleanup" attribute; arguments as in
6812 struct attribute_spec.handler. */
6815 handle_cleanup_attribute (tree *node, tree name, tree args,
6816 int ARG_UNUSED (flags), bool *no_add_attrs)
6819 tree cleanup_id, cleanup_decl;
6821 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
6822 for global destructors in C++. This requires infrastructure that
6823 we don't have generically at the moment. It's also not a feature
6824 we'd be missing too much, since we do have attribute constructor. */
6825 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
6827 warning (OPT_Wattributes, "%qE attribute ignored", name);
6828 *no_add_attrs = true;
6832 /* Verify that the argument is a function in scope. */
6833 /* ??? We could support pointers to functions here as well, if
6834 that was considered desirable. */
6835 cleanup_id = TREE_VALUE (args);
6836 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
6838 error ("cleanup argument not an identifier");
6839 *no_add_attrs = true;
6842 cleanup_decl = lookup_name (cleanup_id);
6843 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
6845 error ("cleanup argument not a function");
6846 *no_add_attrs = true;
6850 /* That the function has proper type is checked with the
6851 eventual call to build_function_call. */
6856 /* Handle a "warn_unused_result" attribute. No special handling. */
6859 handle_warn_unused_result_attribute (tree *node, tree name,
6860 tree ARG_UNUSED (args),
6861 int ARG_UNUSED (flags), bool *no_add_attrs)
6863 /* Ignore the attribute for functions not returning any value. */
6864 if (VOID_TYPE_P (TREE_TYPE (*node)))
6866 warning (OPT_Wattributes, "%qE attribute ignored", name);
6867 *no_add_attrs = true;
6873 /* Handle a "sentinel" attribute. */
6876 handle_sentinel_attribute (tree *node, tree name, tree args,
6877 int ARG_UNUSED (flags), bool *no_add_attrs)
6879 tree params = TYPE_ARG_TYPES (*node);
6883 warning (OPT_Wattributes,
6884 "%qE attribute requires prototypes with named arguments", name);
6885 *no_add_attrs = true;
6889 while (TREE_CHAIN (params))
6890 params = TREE_CHAIN (params);
6892 if (VOID_TYPE_P (TREE_VALUE (params)))
6894 warning (OPT_Wattributes,
6895 "%qE attribute only applies to variadic functions", name);
6896 *no_add_attrs = true;
6902 tree position = TREE_VALUE (args);
6904 if (TREE_CODE (position) != INTEGER_CST)
6906 warning (OPT_Wattributes,
6907 "requested position is not an integer constant");
6908 *no_add_attrs = true;
6912 if (tree_int_cst_lt (position, integer_zero_node))
6914 warning (OPT_Wattributes,
6915 "requested position is less than zero");
6916 *no_add_attrs = true;
6924 /* Handle a "type_generic" attribute. */
6927 handle_type_generic_attribute (tree *node, tree ARG_UNUSED (name),
6928 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
6929 bool * ARG_UNUSED (no_add_attrs))
6933 /* Ensure we have a function type. */
6934 gcc_assert (TREE_CODE (*node) == FUNCTION_TYPE);
6936 params = TYPE_ARG_TYPES (*node);
6937 while (params && ! VOID_TYPE_P (TREE_VALUE (params)))
6938 params = TREE_CHAIN (params);
6940 /* Ensure we have a variadic function. */
6941 gcc_assert (!params);
6946 /* Handle a "target" attribute. */
6949 handle_target_attribute (tree *node, tree name, tree args, int flags,
6952 /* Ensure we have a function type. */
6953 if (TREE_CODE (*node) != FUNCTION_DECL)
6955 warning (OPT_Wattributes, "%qE attribute ignored", name);
6956 *no_add_attrs = true;
6958 else if (! targetm.target_option.valid_attribute_p (*node, name, args,
6960 *no_add_attrs = true;
6965 /* Arguments being collected for optimization. */
6966 typedef const char *const_char_p; /* For DEF_VEC_P. */
6967 DEF_VEC_P(const_char_p);
6968 DEF_VEC_ALLOC_P(const_char_p, gc);
6969 static GTY(()) VEC(const_char_p, gc) *optimize_args;
6972 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
6973 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
6974 false for #pragma GCC optimize. */
6977 parse_optimize_options (tree args, bool attr_p)
6982 int saved_flag_strict_aliasing;
6983 const char **opt_argv;
6986 /* Build up argv vector. Just in case the string is stored away, use garbage
6987 collected strings. */
6988 VEC_truncate (const_char_p, optimize_args, 0);
6989 VEC_safe_push (const_char_p, gc, optimize_args, NULL);
6991 for (ap = args; ap != NULL_TREE; ap = TREE_CHAIN (ap))
6993 tree value = TREE_VALUE (ap);
6995 if (TREE_CODE (value) == INTEGER_CST)
6998 sprintf (buffer, "-O%ld", (long) TREE_INT_CST_LOW (value));
6999 VEC_safe_push (const_char_p, gc, optimize_args, ggc_strdup (buffer));
7002 else if (TREE_CODE (value) == STRING_CST)
7004 /* Split string into multiple substrings. */
7005 size_t len = TREE_STRING_LENGTH (value);
7006 char *p = ASTRDUP (TREE_STRING_POINTER (value));
7007 char *end = p + len;
7011 while (next_p != NULL)
7017 comma = strchr (p, ',');
7030 r = q = (char *) ggc_alloc (len2 + 3);
7032 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
7034 if (*p == '-' && p[1] != 'O' && p[1] != 'f')
7038 warning (OPT_Wattributes,
7039 "Bad option %s to optimize attribute.", p);
7041 warning (OPT_Wpragmas,
7042 "Bad option %s to pragma attribute", p);
7050 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
7051 itself is -Os, and any other switch begins with a -f. */
7052 if ((*p >= '0' && *p <= '9')
7053 || (p[0] == 's' && p[1] == '\0'))
7059 memcpy (r, p, len2);
7061 VEC_safe_push (const_char_p, gc, optimize_args, q);
7067 opt_argc = VEC_length (const_char_p, optimize_args);
7068 opt_argv = (const char **) alloca (sizeof (char *) * (opt_argc + 1));
7070 for (i = 1; i < opt_argc; i++)
7071 opt_argv[i] = VEC_index (const_char_p, optimize_args, i);
7073 saved_flag_strict_aliasing = flag_strict_aliasing;
7075 /* Now parse the options. */
7076 decode_options (opt_argc, opt_argv);
7078 /* Don't allow changing -fstrict-aliasing. */
7079 flag_strict_aliasing = saved_flag_strict_aliasing;
7081 VEC_truncate (const_char_p, optimize_args, 0);
7085 /* For handling "optimize" attribute. arguments as in
7086 struct attribute_spec.handler. */
7089 handle_optimize_attribute (tree *node, tree name, tree args,
7090 int ARG_UNUSED (flags), bool *no_add_attrs)
7092 /* Ensure we have a function type. */
7093 if (TREE_CODE (*node) != FUNCTION_DECL)
7095 warning (OPT_Wattributes, "%qE attribute ignored", name);
7096 *no_add_attrs = true;
7100 struct cl_optimization cur_opts;
7101 tree old_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node);
7103 /* Save current options. */
7104 cl_optimization_save (&cur_opts);
7106 /* If we previously had some optimization options, use them as the
7109 cl_optimization_restore (TREE_OPTIMIZATION (old_opts));
7111 /* Parse options, and update the vector. */
7112 parse_optimize_options (args, true);
7113 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node)
7114 = build_optimization_node ();
7116 /* Restore current options. */
7117 cl_optimization_restore (&cur_opts);
7123 /* Check for valid arguments being passed to a function.
7124 ATTRS is a list of attributes. There are NARGS arguments in the array
7125 ARGARRAY. TYPELIST is the list of argument types for the function.
7128 check_function_arguments (tree attrs, int nargs, tree *argarray, tree typelist)
7130 /* Check for null being passed in a pointer argument that must be
7131 non-null. We also need to do this if format checking is enabled. */
7134 check_function_nonnull (attrs, nargs, argarray);
7136 /* Check for errors in format strings. */
7138 if (warn_format || warn_missing_format_attribute)
7139 check_function_format (attrs, nargs, argarray);
7142 check_function_sentinel (attrs, nargs, argarray, typelist);
7145 /* Generic argument checking recursion routine. PARAM is the argument to
7146 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
7147 once the argument is resolved. CTX is context for the callback. */
7149 check_function_arguments_recurse (void (*callback)
7150 (void *, tree, unsigned HOST_WIDE_INT),
7151 void *ctx, tree param,
7152 unsigned HOST_WIDE_INT param_num)
7154 if (CONVERT_EXPR_P (param)
7155 && (TYPE_PRECISION (TREE_TYPE (param))
7156 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0)))))
7158 /* Strip coercion. */
7159 check_function_arguments_recurse (callback, ctx,
7160 TREE_OPERAND (param, 0), param_num);
7164 if (TREE_CODE (param) == CALL_EXPR)
7166 tree type = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param)));
7168 bool found_format_arg = false;
7170 /* See if this is a call to a known internationalization function
7171 that modifies a format arg. Such a function may have multiple
7172 format_arg attributes (for example, ngettext). */
7174 for (attrs = TYPE_ATTRIBUTES (type);
7176 attrs = TREE_CHAIN (attrs))
7177 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
7180 tree format_num_expr;
7183 call_expr_arg_iterator iter;
7185 /* Extract the argument number, which was previously checked
7187 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
7189 gcc_assert (TREE_CODE (format_num_expr) == INTEGER_CST
7190 && !TREE_INT_CST_HIGH (format_num_expr));
7192 format_num = TREE_INT_CST_LOW (format_num_expr);
7194 for (inner_arg = first_call_expr_arg (param, &iter), i = 1;
7196 inner_arg = next_call_expr_arg (&iter), i++)
7197 if (i == format_num)
7199 check_function_arguments_recurse (callback, ctx,
7200 inner_arg, param_num);
7201 found_format_arg = true;
7206 /* If we found a format_arg attribute and did a recursive check,
7207 we are done with checking this argument. Otherwise, we continue
7208 and this will be considered a non-literal. */
7209 if (found_format_arg)
7213 if (TREE_CODE (param) == COND_EXPR)
7215 /* Check both halves of the conditional expression. */
7216 check_function_arguments_recurse (callback, ctx,
7217 TREE_OPERAND (param, 1), param_num);
7218 check_function_arguments_recurse (callback, ctx,
7219 TREE_OPERAND (param, 2), param_num);
7223 (*callback) (ctx, param, param_num);
7226 /* Checks the number of arguments NARGS against the required number
7227 REQUIRED and issues an error if there is a mismatch. Returns true
7228 if the number of arguments is correct, otherwise false. */
7231 validate_nargs (tree fndecl, int nargs, int required)
7233 if (nargs < required)
7235 error ("not enough arguments to function %qE", fndecl);
7238 else if (nargs > required)
7240 error ("too many arguments to function %qE", fndecl);
7246 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
7247 Returns false if there was an error, otherwise true. */
7250 check_builtin_function_arguments (tree fndecl, int nargs, tree *args)
7252 if (!DECL_BUILT_IN (fndecl)
7253 || DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_NORMAL)
7256 switch (DECL_FUNCTION_CODE (fndecl))
7258 case BUILT_IN_CONSTANT_P:
7259 return validate_nargs (fndecl, nargs, 1);
7261 case BUILT_IN_ISFINITE:
7262 case BUILT_IN_ISINF:
7263 case BUILT_IN_ISINF_SIGN:
7264 case BUILT_IN_ISNAN:
7265 case BUILT_IN_ISNORMAL:
7266 if (validate_nargs (fndecl, nargs, 1))
7268 if (TREE_CODE (TREE_TYPE (args[0])) != REAL_TYPE)
7270 error ("non-floating-point argument in call to "
7271 "function %qE", fndecl);
7278 case BUILT_IN_ISGREATER:
7279 case BUILT_IN_ISGREATEREQUAL:
7280 case BUILT_IN_ISLESS:
7281 case BUILT_IN_ISLESSEQUAL:
7282 case BUILT_IN_ISLESSGREATER:
7283 case BUILT_IN_ISUNORDERED:
7284 if (validate_nargs (fndecl, nargs, 2))
7286 enum tree_code code0, code1;
7287 code0 = TREE_CODE (TREE_TYPE (args[0]));
7288 code1 = TREE_CODE (TREE_TYPE (args[1]));
7289 if (!((code0 == REAL_TYPE && code1 == REAL_TYPE)
7290 || (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
7291 || (code0 == INTEGER_TYPE && code1 == REAL_TYPE)))
7293 error ("non-floating-point arguments in call to "
7294 "function %qE", fndecl);
7301 case BUILT_IN_FPCLASSIFY:
7302 if (validate_nargs (fndecl, nargs, 6))
7307 if (TREE_CODE (args[i]) != INTEGER_CST)
7309 error ("non-const integer argument %u in call to function %qE",
7314 if (TREE_CODE (TREE_TYPE (args[5])) != REAL_TYPE)
7316 error ("non-floating-point argument in call to function %qE",
7329 /* Function to help qsort sort FIELD_DECLs by name order. */
7332 field_decl_cmp (const void *x_p, const void *y_p)
7334 const tree *const x = (const tree *const) x_p;
7335 const tree *const y = (const tree *const) y_p;
7337 if (DECL_NAME (*x) == DECL_NAME (*y))
7338 /* A nontype is "greater" than a type. */
7339 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
7340 if (DECL_NAME (*x) == NULL_TREE)
7342 if (DECL_NAME (*y) == NULL_TREE)
7344 if (DECL_NAME (*x) < DECL_NAME (*y))
7350 gt_pointer_operator new_value;
7354 /* This routine compares two fields like field_decl_cmp but using the
7355 pointer operator in resort_data. */
7358 resort_field_decl_cmp (const void *x_p, const void *y_p)
7360 const tree *const x = (const tree *const) x_p;
7361 const tree *const y = (const tree *const) y_p;
7363 if (DECL_NAME (*x) == DECL_NAME (*y))
7364 /* A nontype is "greater" than a type. */
7365 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
7366 if (DECL_NAME (*x) == NULL_TREE)
7368 if (DECL_NAME (*y) == NULL_TREE)
7371 tree d1 = DECL_NAME (*x);
7372 tree d2 = DECL_NAME (*y);
7373 resort_data.new_value (&d1, resort_data.cookie);
7374 resort_data.new_value (&d2, resort_data.cookie);
7381 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
7384 resort_sorted_fields (void *obj,
7385 void * ARG_UNUSED (orig_obj),
7386 gt_pointer_operator new_value,
7389 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
7390 resort_data.new_value = new_value;
7391 resort_data.cookie = cookie;
7392 qsort (&sf->elts[0], sf->len, sizeof (tree),
7393 resort_field_decl_cmp);
7396 /* Subroutine of c_parse_error.
7397 Return the result of concatenating LHS and RHS. RHS is really
7398 a string literal, its first character is indicated by RHS_START and
7399 RHS_SIZE is its length (including the terminating NUL character).
7401 The caller is responsible for deleting the returned pointer. */
7404 catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
7406 const int lhs_size = strlen (lhs);
7407 char *result = XNEWVEC (char, lhs_size + rhs_size);
7408 strncpy (result, lhs, lhs_size);
7409 strncpy (result + lhs_size, rhs_start, rhs_size);
7413 /* Issue the error given by GMSGID, indicating that it occurred before
7414 TOKEN, which had the associated VALUE. */
7417 c_parse_error (const char *gmsgid, enum cpp_ttype token, tree value)
7419 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
7421 char *message = NULL;
7423 if (token == CPP_EOF)
7424 message = catenate_messages (gmsgid, " at end of input");
7425 else if (token == CPP_CHAR || token == CPP_WCHAR || token == CPP_CHAR16
7426 || token == CPP_CHAR32)
7428 unsigned int val = TREE_INT_CST_LOW (value);
7447 if (val <= UCHAR_MAX && ISGRAPH (val))
7448 message = catenate_messages (gmsgid, " before %s'%c'");
7450 message = catenate_messages (gmsgid, " before %s'\\x%x'");
7452 error (message, prefix, val);
7456 else if (token == CPP_STRING || token == CPP_WSTRING || token == CPP_STRING16
7457 || token == CPP_STRING32)
7458 message = catenate_messages (gmsgid, " before string constant");
7459 else if (token == CPP_NUMBER)
7460 message = catenate_messages (gmsgid, " before numeric constant");
7461 else if (token == CPP_NAME)
7463 message = catenate_messages (gmsgid, " before %qE");
7464 error (message, value);
7468 else if (token == CPP_PRAGMA)
7469 message = catenate_messages (gmsgid, " before %<#pragma%>");
7470 else if (token == CPP_PRAGMA_EOL)
7471 message = catenate_messages (gmsgid, " before end of line");
7472 else if (token < N_TTYPES)
7474 message = catenate_messages (gmsgid, " before %qs token");
7475 error (message, cpp_type2name (token));
7487 #undef catenate_messages
7490 /* Walk a gimplified function and warn for functions whose return value is
7491 ignored and attribute((warn_unused_result)) is set. This is done before
7492 inlining, so we don't have to worry about that. */
7495 c_warn_unused_result (gimple_seq seq)
7498 gimple_stmt_iterator i;
7500 for (i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i))
7502 gimple g = gsi_stmt (i);
7504 switch (gimple_code (g))
7507 c_warn_unused_result (gimple_bind_body (g));
7510 c_warn_unused_result (gimple_try_eval (g));
7511 c_warn_unused_result (gimple_try_cleanup (g));
7514 c_warn_unused_result (gimple_catch_handler (g));
7516 case GIMPLE_EH_FILTER:
7517 c_warn_unused_result (gimple_eh_filter_failure (g));
7521 if (gimple_call_lhs (g))
7524 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7525 LHS. All calls whose value is ignored should be
7526 represented like this. Look for the attribute. */
7527 fdecl = gimple_call_fndecl (g);
7528 ftype = TREE_TYPE (TREE_TYPE (gimple_call_fn (g)));
7530 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
7532 location_t loc = gimple_location (g);
7535 warning (0, "%Hignoring return value of %qD, "
7536 "declared with attribute warn_unused_result",
7539 warning (0, "%Hignoring return value of function "
7540 "declared with attribute warn_unused_result",
7546 /* Not a container, not a call, or a call whose value is used. */
7552 /* Convert a character from the host to the target execution character
7553 set. cpplib handles this, mostly. */
7556 c_common_to_target_charset (HOST_WIDE_INT c)
7558 /* Character constants in GCC proper are sign-extended under -fsigned-char,
7559 zero-extended under -fno-signed-char. cpplib insists that characters
7560 and character constants are always unsigned. Hence we must convert
7562 cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1);
7564 uc = cpp_host_to_exec_charset (parse_in, uc);
7566 if (flag_signed_char)
7567 return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE)
7568 >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE);
7573 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
7574 component references, with STOP_REF, or alternatively an INDIRECT_REF of
7575 NULL, at the bottom; much like the traditional rendering of offsetof as a
7576 macro. Returns the folded and properly cast result. */
7579 fold_offsetof_1 (tree expr, tree stop_ref)
7581 enum tree_code code = PLUS_EXPR;
7584 if (expr == stop_ref && TREE_CODE (expr) != ERROR_MARK)
7585 return size_zero_node;
7587 switch (TREE_CODE (expr))
7593 error ("cannot apply %<offsetof%> to static data member %qD", expr);
7594 return error_mark_node;
7598 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
7599 return error_mark_node;
7602 gcc_assert (integer_zerop (expr));
7603 return size_zero_node;
7607 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
7608 gcc_assert (base == error_mark_node || base == size_zero_node);
7612 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
7613 if (base == error_mark_node)
7616 t = TREE_OPERAND (expr, 1);
7617 if (DECL_C_BIT_FIELD (t))
7619 error ("attempt to take address of bit-field structure "
7621 return error_mark_node;
7623 off = size_binop (PLUS_EXPR, DECL_FIELD_OFFSET (t),
7624 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t), 1)
7629 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
7630 if (base == error_mark_node)
7633 t = TREE_OPERAND (expr, 1);
7634 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) < 0)
7637 t = fold_build1 (NEGATE_EXPR, TREE_TYPE (t), t);
7639 t = convert (sizetype, t);
7640 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
7644 /* Handle static members of volatile structs. */
7645 t = TREE_OPERAND (expr, 1);
7646 gcc_assert (TREE_CODE (t) == VAR_DECL);
7647 return fold_offsetof_1 (t, stop_ref);
7653 return size_binop (code, base, off);
7657 fold_offsetof (tree expr, tree stop_ref)
7659 /* Convert back from the internal sizetype to size_t. */
7660 return convert (size_type_node, fold_offsetof_1 (expr, stop_ref));
7663 /* Print an error message for an invalid lvalue. USE says
7664 how the lvalue is being used and so selects the error message. */
7667 lvalue_error (enum lvalue_use use)
7672 error ("lvalue required as left operand of assignment");
7675 error ("lvalue required as increment operand");
7678 error ("lvalue required as decrement operand");
7681 error ("lvalue required as unary %<&%> operand");
7684 error ("lvalue required in asm statement");
7691 /* *PTYPE is an incomplete array. Complete it with a domain based on
7692 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
7693 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
7694 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
7697 complete_array_type (tree *ptype, tree initial_value, bool do_default)
7699 tree maxindex, type, main_type, elt, unqual_elt;
7700 int failure = 0, quals;
7701 hashval_t hashcode = 0;
7703 maxindex = size_zero_node;
7706 if (TREE_CODE (initial_value) == STRING_CST)
7709 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
7710 maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1);
7712 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
7714 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initial_value);
7716 if (VEC_empty (constructor_elt, v))
7720 maxindex = integer_minus_one_node;
7725 unsigned HOST_WIDE_INT cnt;
7726 constructor_elt *ce;
7728 if (VEC_index (constructor_elt, v, 0)->index)
7729 maxindex = fold_convert (sizetype,
7730 VEC_index (constructor_elt,
7732 curindex = maxindex;
7735 VEC_iterate (constructor_elt, v, cnt, ce);
7739 curindex = fold_convert (sizetype, ce->index);
7741 curindex = size_binop (PLUS_EXPR, curindex, size_one_node);
7743 if (tree_int_cst_lt (maxindex, curindex))
7744 maxindex = curindex;
7750 /* Make an error message unless that happened already. */
7751 if (initial_value != error_mark_node)
7763 elt = TREE_TYPE (type);
7764 quals = TYPE_QUALS (strip_array_types (elt));
7768 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
7770 /* Using build_distinct_type_copy and modifying things afterward instead
7771 of using build_array_type to create a new type preserves all of the
7772 TYPE_LANG_FLAG_? bits that the front end may have set. */
7773 main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
7774 TREE_TYPE (main_type) = unqual_elt;
7775 TYPE_DOMAIN (main_type) = build_index_type (maxindex);
7776 layout_type (main_type);
7778 /* Make sure we have the canonical MAIN_TYPE. */
7779 hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode);
7780 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)),
7782 main_type = type_hash_canon (hashcode, main_type);
7784 /* Fix the canonical type. */
7785 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type))
7786 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type)))
7787 SET_TYPE_STRUCTURAL_EQUALITY (main_type);
7788 else if (TYPE_CANONICAL (TREE_TYPE (main_type)) != TREE_TYPE (main_type)
7789 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type))
7790 != TYPE_DOMAIN (main_type)))
7791 TYPE_CANONICAL (main_type)
7792 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type)),
7793 TYPE_CANONICAL (TYPE_DOMAIN (main_type)));
7795 TYPE_CANONICAL (main_type) = main_type;
7800 type = c_build_qualified_type (main_type, quals);
7802 if (COMPLETE_TYPE_P (type)
7803 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST
7804 && TREE_OVERFLOW (TYPE_SIZE_UNIT (type)))
7806 error ("size of array is too large");
7807 /* If we proceed with the array type as it is, we'll eventually
7808 crash in tree_low_cst(). */
7809 type = error_mark_node;
7817 /* Used to help initialize the builtin-types.def table. When a type of
7818 the correct size doesn't exist, use error_mark_node instead of NULL.
7819 The later results in segfaults even when a decl using the type doesn't
7823 builtin_type_for_size (int size, bool unsignedp)
7825 tree type = lang_hooks.types.type_for_size (size, unsignedp);
7826 return type ? type : error_mark_node;
7829 /* A helper function for resolve_overloaded_builtin in resolving the
7830 overloaded __sync_ builtins. Returns a positive power of 2 if the
7831 first operand of PARAMS is a pointer to a supported data type.
7832 Returns 0 if an error is encountered. */
7835 sync_resolve_size (tree function, tree params)
7842 error ("too few arguments to function %qE", function);
7846 type = TREE_TYPE (TREE_VALUE (params));
7847 if (TREE_CODE (type) != POINTER_TYPE)
7850 type = TREE_TYPE (type);
7851 if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type))
7854 size = tree_low_cst (TYPE_SIZE_UNIT (type), 1);
7855 if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16)
7859 error ("incompatible type for argument %d of %qE", 1, function);
7863 /* A helper function for resolve_overloaded_builtin. Adds casts to
7864 PARAMS to make arguments match up with those of FUNCTION. Drops
7865 the variadic arguments at the end. Returns false if some error
7866 was encountered; true on success. */
7869 sync_resolve_params (tree orig_function, tree function, tree params)
7871 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (function));
7875 /* We've declared the implementation functions to use "volatile void *"
7876 as the pointer parameter, so we shouldn't get any complaints from the
7877 call to check_function_arguments what ever type the user used. */
7878 arg_types = TREE_CHAIN (arg_types);
7879 ptype = TREE_TYPE (TREE_TYPE (TREE_VALUE (params)));
7882 /* For the rest of the values, we need to cast these to FTYPE, so that we
7883 don't get warnings for passing pointer types, etc. */
7884 while (arg_types != void_list_node)
7888 params = TREE_CHAIN (params);
7891 error ("too few arguments to function %qE", orig_function);
7895 /* ??? Ideally for the first conversion we'd use convert_for_assignment
7896 so that we get warnings for anything that doesn't match the pointer
7897 type. This isn't portable across the C and C++ front ends atm. */
7898 val = TREE_VALUE (params);
7899 val = convert (ptype, val);
7900 val = convert (TREE_VALUE (arg_types), val);
7901 TREE_VALUE (params) = val;
7903 arg_types = TREE_CHAIN (arg_types);
7907 /* The definition of these primitives is variadic, with the remaining
7908 being "an optional list of variables protected by the memory barrier".
7909 No clue what that's supposed to mean, precisely, but we consider all
7910 call-clobbered variables to be protected so we're safe. */
7911 TREE_CHAIN (params) = NULL;
7916 /* A helper function for resolve_overloaded_builtin. Adds a cast to
7917 RESULT to make it match the type of the first pointer argument in
7921 sync_resolve_return (tree params, tree result)
7923 tree ptype = TREE_TYPE (TREE_TYPE (TREE_VALUE (params)));
7924 ptype = TYPE_MAIN_VARIANT (ptype);
7925 return convert (ptype, result);
7928 /* Some builtin functions are placeholders for other expressions. This
7929 function should be called immediately after parsing the call expression
7930 before surrounding code has committed to the type of the expression.
7932 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
7933 PARAMS is the argument list for the call. The return value is non-null
7934 when expansion is complete, and null if normal processing should
7938 resolve_overloaded_builtin (tree function, tree params)
7940 enum built_in_function orig_code = DECL_FUNCTION_CODE (function);
7941 switch (DECL_BUILT_IN_CLASS (function))
7943 case BUILT_IN_NORMAL:
7946 if (targetm.resolve_overloaded_builtin)
7947 return targetm.resolve_overloaded_builtin (function, params);
7954 /* Handle BUILT_IN_NORMAL here. */
7957 case BUILT_IN_FETCH_AND_ADD_N:
7958 case BUILT_IN_FETCH_AND_SUB_N:
7959 case BUILT_IN_FETCH_AND_OR_N:
7960 case BUILT_IN_FETCH_AND_AND_N:
7961 case BUILT_IN_FETCH_AND_XOR_N:
7962 case BUILT_IN_FETCH_AND_NAND_N:
7963 case BUILT_IN_ADD_AND_FETCH_N:
7964 case BUILT_IN_SUB_AND_FETCH_N:
7965 case BUILT_IN_OR_AND_FETCH_N:
7966 case BUILT_IN_AND_AND_FETCH_N:
7967 case BUILT_IN_XOR_AND_FETCH_N:
7968 case BUILT_IN_NAND_AND_FETCH_N:
7969 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N:
7970 case BUILT_IN_VAL_COMPARE_AND_SWAP_N:
7971 case BUILT_IN_LOCK_TEST_AND_SET_N:
7972 case BUILT_IN_LOCK_RELEASE_N:
7974 int n = sync_resolve_size (function, params);
7975 tree new_function, result;
7978 return error_mark_node;
7980 new_function = built_in_decls[orig_code + exact_log2 (n) + 1];
7981 if (!sync_resolve_params (function, new_function, params))
7982 return error_mark_node;
7984 result = build_function_call (new_function, params);
7985 if (orig_code != BUILT_IN_BOOL_COMPARE_AND_SWAP_N
7986 && orig_code != BUILT_IN_LOCK_RELEASE_N)
7987 result = sync_resolve_return (params, result);
7997 /* Ignoring their sign, return true if two scalar types are the same. */
7999 same_scalar_type_ignoring_signedness (tree t1, tree t2)
8001 enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2);
8003 gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE || c1 == FIXED_POINT_TYPE)
8004 && (c2 == INTEGER_TYPE || c2 == REAL_TYPE
8005 || c2 == FIXED_POINT_TYPE));
8007 /* Equality works here because c_common_signed_type uses
8008 TYPE_MAIN_VARIANT. */
8009 return c_common_signed_type (t1)
8010 == c_common_signed_type (t2);
8013 /* Check for missing format attributes on function pointers. LTYPE is
8014 the new type or left-hand side type. RTYPE is the old type or
8015 right-hand side type. Returns TRUE if LTYPE is missing the desired
8019 check_missing_format_attribute (tree ltype, tree rtype)
8021 tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype);
8024 for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra))
8025 if (is_attribute_p ("format", TREE_PURPOSE (ra)))
8030 for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la))
8031 if (is_attribute_p ("format", TREE_PURPOSE (la)))
8039 /* Subscripting with type char is likely to lose on a machine where
8040 chars are signed. So warn on any machine, but optionally. Don't
8041 warn for unsigned char since that type is safe. Don't warn for
8042 signed char because anyone who uses that must have done so
8043 deliberately. Furthermore, we reduce the false positive load by
8044 warning only for non-constant value of type char. */
8047 warn_array_subscript_with_type_char (tree index)
8049 if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node
8050 && TREE_CODE (index) != INTEGER_CST)
8051 warning (OPT_Wchar_subscripts, "array subscript has type %<char%>");
8054 /* Implement -Wparentheses for the unexpected C precedence rules, to
8055 cover cases like x + y << z which readers are likely to
8056 misinterpret. We have seen an expression in which CODE is a binary
8057 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
8058 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
8059 CODE_RIGHT may be ERROR_MARK, which means that that side of the
8060 expression was not formed using a binary or unary operator, or it
8061 was enclosed in parentheses. */
8064 warn_about_parentheses (enum tree_code code,
8065 enum tree_code code_left, tree ARG_UNUSED (arg_left),
8066 enum tree_code code_right, tree arg_right)
8068 if (!warn_parentheses)
8071 /* This macro tests that the expression ARG with original tree code
8072 CODE appears to be a boolean expression. or the result of folding a
8073 boolean expression. */
8074 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
8075 (truth_value_p (TREE_CODE (ARG)) \
8076 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
8077 /* Folding may create 0 or 1 integers from other expressions. */ \
8078 || ((CODE) != INTEGER_CST \
8079 && (integer_onep (ARG) || integer_zerop (ARG))))
8084 if (code_left == PLUS_EXPR || code_right == PLUS_EXPR)
8085 warning (OPT_Wparentheses,
8086 "suggest parentheses around %<+%> inside %<<<%>");
8087 else if (code_left == MINUS_EXPR || code_right == MINUS_EXPR)
8088 warning (OPT_Wparentheses,
8089 "suggest parentheses around %<-%> inside %<<<%>");
8093 if (code_left == PLUS_EXPR || code_right == PLUS_EXPR)
8094 warning (OPT_Wparentheses,
8095 "suggest parentheses around %<+%> inside %<>>%>");
8096 else if (code_left == MINUS_EXPR || code_right == MINUS_EXPR)
8097 warning (OPT_Wparentheses,
8098 "suggest parentheses around %<-%> inside %<>>%>");
8101 case TRUTH_ORIF_EXPR:
8102 if (code_left == TRUTH_ANDIF_EXPR || code_right == TRUTH_ANDIF_EXPR)
8103 warning (OPT_Wparentheses,
8104 "suggest parentheses around %<&&%> within %<||%>");
8108 if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR
8109 || code_left == PLUS_EXPR || code_left == MINUS_EXPR
8110 || code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR
8111 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
8112 warning (OPT_Wparentheses,
8113 "suggest parentheses around arithmetic in operand of %<|%>");
8114 /* Check cases like x|y==z */
8115 else if (TREE_CODE_CLASS (code_left) == tcc_comparison
8116 || TREE_CODE_CLASS (code_right) == tcc_comparison)
8117 warning (OPT_Wparentheses,
8118 "suggest parentheses around comparison in operand of %<|%>");
8119 /* Check cases like !x | y */
8120 else if (code_left == TRUTH_NOT_EXPR
8121 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
8122 warning (OPT_Wparentheses, "suggest parentheses around operand of"
8123 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
8127 if (code_left == BIT_AND_EXPR
8128 || code_left == PLUS_EXPR || code_left == MINUS_EXPR
8129 || code_right == BIT_AND_EXPR
8130 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
8131 warning (OPT_Wparentheses,
8132 "suggest parentheses around arithmetic in operand of %<^%>");
8133 /* Check cases like x^y==z */
8134 else if (TREE_CODE_CLASS (code_left) == tcc_comparison
8135 || TREE_CODE_CLASS (code_right) == tcc_comparison)
8136 warning (OPT_Wparentheses,
8137 "suggest parentheses around comparison in operand of %<^%>");
8141 if (code_left == PLUS_EXPR || code_right == PLUS_EXPR)
8142 warning (OPT_Wparentheses,
8143 "suggest parentheses around %<+%> in operand of %<&%>");
8144 else if (code_left == MINUS_EXPR || code_right == MINUS_EXPR)
8145 warning (OPT_Wparentheses,
8146 "suggest parentheses around %<-%> in operand of %<&%>");
8147 /* Check cases like x&y==z */
8148 else if (TREE_CODE_CLASS (code_left) == tcc_comparison
8149 || TREE_CODE_CLASS (code_right) == tcc_comparison)
8150 warning (OPT_Wparentheses,
8151 "suggest parentheses around comparison in operand of %<&%>");
8152 /* Check cases like !x & y */
8153 else if (code_left == TRUTH_NOT_EXPR
8154 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
8155 warning (OPT_Wparentheses, "suggest parentheses around operand of"
8156 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
8160 if (TREE_CODE_CLASS (code_left) == tcc_comparison
8161 || TREE_CODE_CLASS (code_right) == tcc_comparison)
8162 warning (OPT_Wparentheses,
8163 "suggest parentheses around comparison in operand of %<==%>");
8166 if (TREE_CODE_CLASS (code_left) == tcc_comparison
8167 || TREE_CODE_CLASS (code_right) == tcc_comparison)
8168 warning (OPT_Wparentheses,
8169 "suggest parentheses around comparison in operand of %<!=%>");
8173 if (TREE_CODE_CLASS (code) == tcc_comparison
8174 && ((TREE_CODE_CLASS (code_left) == tcc_comparison
8175 && code_left != NE_EXPR && code_left != EQ_EXPR)
8176 || (TREE_CODE_CLASS (code_right) == tcc_comparison
8177 && code_right != NE_EXPR && code_right != EQ_EXPR)))
8178 warning (OPT_Wparentheses, "comparisons like %<X<=Y<=Z%> do not "
8179 "have their mathematical meaning");
8182 #undef NOT_A_BOOLEAN_EXPR_P
8185 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
8188 warn_for_unused_label (tree label)
8190 if (!TREE_USED (label))
8192 if (DECL_INITIAL (label))
8193 warning (OPT_Wunused_label, "label %q+D defined but not used", label);
8195 warning (OPT_Wunused_label, "label %q+D declared but not defined", label);
8199 #ifndef TARGET_HAS_TARGETCM
8200 struct gcc_targetcm targetcm = TARGETCM_INITIALIZER;
8203 /* Warn for division by zero according to the value of DIVISOR. LOC
8204 is the location of the division operator. */
8207 warn_for_div_by_zero (location_t loc, tree divisor)
8209 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
8210 about division by zero. Do not issue a warning if DIVISOR has a
8211 floating-point type, since we consider 0.0/0.0 a valid way of
8212 generating a NaN. */
8213 if (skip_evaluation == 0
8214 && (integer_zerop (divisor) || fixed_zerop (divisor)))
8215 warning_at (loc, OPT_Wdiv_by_zero, "division by zero");
8218 /* Subroutine of build_binary_op. Give warnings for comparisons
8219 between signed and unsigned quantities that may fail. Do the
8220 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
8221 so that casts will be considered, but default promotions won't
8224 LOCATION is the location of the comparison operator.
8226 The arguments of this function map directly to local variables
8227 of build_binary_op. */
8230 warn_for_sign_compare (location_t location,
8231 tree orig_op0, tree orig_op1,
8233 tree result_type, enum tree_code resultcode)
8235 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8236 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8237 int unsignedp0, unsignedp1;
8239 /* In C++, check for comparison of different enum types. */
8241 && TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE
8242 && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE
8243 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0))
8244 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1)))
8246 warning_at (location,
8247 OPT_Wsign_compare, "comparison between types %qT and %qT",
8248 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1));
8251 /* Do not warn if the comparison is being done in a signed type,
8252 since the signed type will only be chosen if it can represent
8253 all the values of the unsigned type. */
8254 if (!TYPE_UNSIGNED (result_type))
8256 /* Do not warn if both operands are unsigned. */
8257 else if (op0_signed == op1_signed)
8261 tree sop, uop, base_type;
8265 sop = orig_op0, uop = orig_op1;
8267 sop = orig_op1, uop = orig_op0;
8269 STRIP_TYPE_NOPS (sop);
8270 STRIP_TYPE_NOPS (uop);
8271 base_type = (TREE_CODE (result_type) == COMPLEX_TYPE
8272 ? TREE_TYPE (result_type) : result_type);
8274 /* Do not warn if the signed quantity is an unsuffixed integer
8275 literal (or some static constant expression involving such
8276 literals or a conditional expression involving such literals)
8277 and it is non-negative. */
8278 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
8280 /* Do not warn if the comparison is an equality operation, the
8281 unsigned quantity is an integral constant, and it would fit
8282 in the result if the result were signed. */
8283 else if (TREE_CODE (uop) == INTEGER_CST
8284 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8285 && int_fits_type_p (uop, c_common_signed_type (base_type)))
8287 /* In C, do not warn if the unsigned quantity is an enumeration
8288 constant and its maximum value would fit in the result if the
8289 result were signed. */
8290 else if (!c_dialect_cxx() && TREE_CODE (uop) == INTEGER_CST
8291 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8292 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8293 c_common_signed_type (base_type)))
8296 warning_at (location,
8298 "comparison between signed and unsigned integer expressions");
8301 /* Warn if two unsigned values are being compared in a size larger
8302 than their original size, and one (and only one) is the result of
8303 a `~' operator. This comparison will always fail.
8305 Also warn if one operand is a constant, and the constant does not
8306 have all bits set that are set in the ~ operand when it is
8309 op0 = get_narrower (op0, &unsignedp0);
8310 op1 = get_narrower (op1, &unsignedp1);
8312 if ((TREE_CODE (op0) == BIT_NOT_EXPR)
8313 ^ (TREE_CODE (op1) == BIT_NOT_EXPR))
8315 if (TREE_CODE (op0) == BIT_NOT_EXPR)
8316 op0 = get_narrower (TREE_OPERAND (op0, 0), &unsignedp0);
8317 if (TREE_CODE (op1) == BIT_NOT_EXPR)
8318 op1 = get_narrower (TREE_OPERAND (op1, 0), &unsignedp1);
8320 if (host_integerp (op0, 0) || host_integerp (op1, 0))
8323 HOST_WIDE_INT constant, mask;
8327 if (host_integerp (op0, 0))
8330 unsignedp = unsignedp1;
8331 constant = tree_low_cst (op0, 0);
8336 unsignedp = unsignedp0;
8337 constant = tree_low_cst (op1, 0);
8340 bits = TYPE_PRECISION (TREE_TYPE (primop));
8341 if (bits < TYPE_PRECISION (result_type)
8342 && bits < HOST_BITS_PER_LONG && unsignedp)
8344 mask = (~ (HOST_WIDE_INT) 0) << bits;
8345 if ((mask & constant) != mask)
8348 warning (OPT_Wsign_compare,
8349 "promoted ~unsigned is always non-zero");
8351 warning_at (location, OPT_Wsign_compare,
8352 "comparison of promoted ~unsigned with constant");
8356 else if (unsignedp0 && unsignedp1
8357 && (TYPE_PRECISION (TREE_TYPE (op0))
8358 < TYPE_PRECISION (result_type))
8359 && (TYPE_PRECISION (TREE_TYPE (op1))
8360 < TYPE_PRECISION (result_type)))
8361 warning_at (location, OPT_Wsign_compare,
8362 "comparison of promoted ~unsigned with unsigned");
8366 #include "gt-c-common.h"