/* Subroutines shared by all languages that are variants of C.
- Copyright (C) 1992-2016 Free Software Foundation, Inc.
+ Copyright (C) 1992-2017 Free Software Foundation, Inc.
This file is part of GCC.
#include "target.h"
#include "function.h"
#include "tree.h"
+#include "memmodel.h"
#include "c-common.h"
#include "gimple-expr.h"
#include "tm_p.h"
#include "opts.h"
#include "gimplify.h"
#include "substring-locations.h"
+#include "spellcheck.h"
cpp_reader *parse_in; /* Declared in c-pragma.h. */
static bool check_case_bounds (location_t, tree, tree, tree *, tree *,
bool *);
-static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
-static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
-static tree handle_common_attribute (tree *, tree, tree, int, bool *);
-static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
-static tree handle_hot_attribute (tree *, tree, tree, int, bool *);
-static tree handle_cold_attribute (tree *, tree, tree, int, bool *);
-static tree handle_no_sanitize_address_attribute (tree *, tree, tree,
- int, bool *);
-static tree handle_no_address_safety_analysis_attribute (tree *, tree, tree,
- int, bool *);
-static tree handle_no_sanitize_undefined_attribute (tree *, tree, tree, int,
- bool *);
-static tree handle_stack_protect_attribute (tree *, tree, tree, int, bool *);
-static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
-static tree handle_noclone_attribute (tree *, tree, tree, int, bool *);
-static tree handle_noicf_attribute (tree *, tree, tree, int, bool *);
-static tree handle_leaf_attribute (tree *, tree, tree, int, bool *);
-static tree handle_always_inline_attribute (tree *, tree, tree, int,
- bool *);
-static tree handle_gnu_inline_attribute (tree *, tree, tree, int, bool *);
-static tree handle_artificial_attribute (tree *, tree, tree, int, bool *);
-static tree handle_flatten_attribute (tree *, tree, tree, int, bool *);
-static tree handle_error_attribute (tree *, tree, tree, int, bool *);
-static tree handle_used_attribute (tree *, tree, tree, int, bool *);
-static tree handle_externally_visible_attribute (tree *, tree, tree, int,
- bool *);
-static tree handle_no_reorder_attribute (tree *, tree, tree, int,
- bool *);
-static tree handle_const_attribute (tree *, tree, tree, int, bool *);
-static tree handle_transparent_union_attribute (tree *, tree, tree,
- int, bool *);
-static tree handle_scalar_storage_order_attribute (tree *, tree, tree,
- int, bool *);
-static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
-static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
-static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
-static tree handle_section_attribute (tree *, tree, tree, int, bool *);
-static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
-static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
-static tree handle_noplt_attribute (tree *, tree, tree, int, bool *) ;
-static tree handle_alias_ifunc_attribute (bool, tree *, tree, tree, bool *);
-static tree handle_ifunc_attribute (tree *, tree, tree, int, bool *);
-static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
-static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ;
-static tree handle_visibility_attribute (tree *, tree, tree, int,
- bool *);
-static tree handle_tls_model_attribute (tree *, tree, tree, int,
- bool *);
-static tree handle_no_instrument_function_attribute (tree *, tree,
- tree, int, bool *);
-static tree handle_no_profile_instrument_function_attribute (tree *, tree,
- tree, int, bool *);
-static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
-static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *);
-static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
- bool *);
-static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
-static tree handle_tm_attribute (tree *, tree, tree, int, bool *);
-static tree handle_tm_wrap_attribute (tree *, tree, tree, int, bool *);
-static tree handle_novops_attribute (tree *, tree, tree, int, bool *);
-static tree handle_deprecated_attribute (tree *, tree, tree, int,
- bool *);
-static tree handle_vector_size_attribute (tree *, tree, tree, int,
- bool *);
-static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
-static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
-static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
-static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
- bool *);
-static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
-static tree handle_type_generic_attribute (tree *, tree, tree, int, bool *);
-static tree handle_alloc_size_attribute (tree *, tree, tree, int, bool *);
-static tree handle_alloc_align_attribute (tree *, tree, tree, int, bool *);
-static tree handle_assume_aligned_attribute (tree *, tree, tree, int, bool *);
-static tree handle_target_attribute (tree *, tree, tree, int, bool *);
-static tree handle_target_clones_attribute (tree *, tree, tree, int, bool *);
-static tree handle_optimize_attribute (tree *, tree, tree, int, bool *);
-static tree ignore_attribute (tree *, tree, tree, int, bool *);
-static tree handle_no_split_stack_attribute (tree *, tree, tree, int, bool *);
-static tree handle_fnspec_attribute (tree *, tree, tree, int, bool *);
-static tree handle_warn_unused_attribute (tree *, tree, tree, int, bool *);
-static tree handle_returns_nonnull_attribute (tree *, tree, tree, int, bool *);
-static tree handle_omp_declare_simd_attribute (tree *, tree, tree, int,
- bool *);
-static tree handle_simd_attribute (tree *, tree, tree, int, bool *);
-static tree handle_omp_declare_target_attribute (tree *, tree, tree, int,
- bool *);
-static tree handle_designated_init_attribute (tree *, tree, tree, int, bool *);
-static tree handle_bnd_variable_size_attribute (tree *, tree, tree, int, bool *);
-static tree handle_bnd_legacy (tree *, tree, tree, int, bool *);
-static tree handle_bnd_instrument (tree *, tree, tree, int, bool *);
static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
-static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
-static int resort_field_decl_cmp (const void *, const void *);
/* Reserved words. The third field is a mask: keywords are disabled
if they match the mask.
C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
C --std=c99: D_CXXONLY | D_OBJC
ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
- C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
- C++ --std=c0x: D_CONLY | D_OBJC
+ C++ --std=c++98: D_CONLY | D_CXX11 | D_OBJC
+ C++ --std=c++11: D_CONLY | D_OBJC
ObjC++ is like C++ except that D_OBJC is not set
If -fno-asm is used, D_ASM is added to the mask. If
{ "_Cilk_sync", RID_CILK_SYNC, 0 },
{ "_Cilk_for", RID_CILK_FOR, 0 },
{ "_Imaginary", RID_IMAGINARY, D_CONLY },
+ { "_Float16", RID_FLOAT16, D_CONLY },
+ { "_Float32", RID_FLOAT32, D_CONLY },
+ { "_Float64", RID_FLOAT64, D_CONLY },
+ { "_Float128", RID_FLOAT128, D_CONLY },
+ { "_Float32x", RID_FLOAT32X, D_CONLY },
+ { "_Float64x", RID_FLOAT64X, D_CONLY },
+ { "_Float128x", RID_FLOAT128X, D_CONLY },
{ "_Decimal32", RID_DFLOAT32, D_CONLY | D_EXT },
{ "_Decimal64", RID_DFLOAT64, D_CONLY | D_EXT },
{ "_Decimal128", RID_DFLOAT128, D_CONLY | D_EXT },
{ "__attribute__", RID_ATTRIBUTE, 0 },
{ "__auto_type", RID_AUTO_TYPE, D_CONLY },
{ "__bases", RID_BASES, D_CXXONLY },
+ { "__builtin_addressof", RID_ADDRESSOF, D_CXXONLY },
{ "__builtin_call_with_static_chain",
RID_BUILTIN_CALL_WITH_STATIC_CHAIN, D_CONLY },
{ "__builtin_choose_expr", RID_CHOOSE_EXPR, D_CONLY },
{ "__builtin_complex", RID_BUILTIN_COMPLEX, D_CONLY },
+ { "__builtin_launder", RID_BUILTIN_LAUNDER, D_CXXONLY },
{ "__builtin_shuffle", RID_BUILTIN_SHUFFLE, 0 },
+ { "__builtin_tgmath", RID_BUILTIN_TGMATH, D_CONLY },
{ "__builtin_offsetof", RID_OFFSETOF, 0 },
{ "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P, D_CONLY },
{ "__builtin_va_arg", RID_VA_ARG, 0 },
{ "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR, D_CXXONLY },
{ "__has_trivial_copy", RID_HAS_TRIVIAL_COPY, D_CXXONLY },
{ "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR, D_CXXONLY },
+ { "__has_unique_object_representations", RID_HAS_UNIQUE_OBJ_REPRESENTATIONS,
+ D_CXXONLY },
{ "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR, D_CXXONLY },
{ "__imag", RID_IMAGPART, 0 },
{ "__imag__", RID_IMAGPART, 0 },
{ "__inline", RID_INLINE, 0 },
{ "__inline__", RID_INLINE, 0 },
{ "__is_abstract", RID_IS_ABSTRACT, D_CXXONLY },
+ { "__is_aggregate", RID_IS_AGGREGATE, D_CXXONLY },
{ "__is_base_of", RID_IS_BASE_OF, D_CXXONLY },
{ "__is_class", RID_IS_CLASS, D_CXXONLY },
{ "__is_empty", RID_IS_EMPTY, D_CXXONLY },
{ "__underlying_type", RID_UNDERLYING_TYPE, D_CXXONLY },
{ "__volatile", RID_VOLATILE, 0 },
{ "__volatile__", RID_VOLATILE, 0 },
+ { "__GIMPLE", RID_GIMPLE, D_CONLY },
+ { "__PHI", RID_PHI, D_CONLY },
+ { "__RTL", RID_RTL, D_CONLY },
{ "alignas", RID_ALIGNAS, D_CXXONLY | D_CXX11 | D_CXXWARN },
{ "alignof", RID_ALIGNOF, D_CXXONLY | D_CXX11 | D_CXXWARN },
{ "asm", RID_ASM, D_ASM },
{ "volatile", RID_VOLATILE, 0 },
{ "wchar_t", RID_WCHAR, D_CXXONLY },
{ "while", RID_WHILE, 0 },
+ { "__is_assignable", RID_IS_ASSIGNABLE, D_CXXONLY },
+ { "__is_constructible", RID_IS_CONSTRUCTIBLE, D_CXXONLY },
/* C++ transactional memory. */
{ "synchronized", RID_SYNCHRONIZED, D_CXX_OBJC | D_TRANSMEM },
const unsigned int num_c_common_reswords =
sizeof c_common_reswords / sizeof (struct c_common_resword);
-/* Table of machine-independent attributes common to all C-like languages.
-
- All attributes referencing arguments should be additionally processed
- in chkp_copy_function_type_adding_bounds for correct instrumentation
- by Pointer Bounds Checker.
- Current list of processed common attributes: nonnull. */
-const struct attribute_spec c_common_attribute_table[] =
-{
- /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
- affects_type_identity } */
- { "packed", 0, 0, false, false, false,
- handle_packed_attribute , false},
- { "nocommon", 0, 0, true, false, false,
- handle_nocommon_attribute, false},
- { "common", 0, 0, true, false, false,
- handle_common_attribute, false },
- /* FIXME: logically, noreturn attributes should be listed as
- "false, true, true" and apply to function types. But implementing this
- would require all the places in the compiler that use TREE_THIS_VOLATILE
- on a decl to identify non-returning functions to be located and fixed
- to check the function type instead. */
- { "noreturn", 0, 0, true, false, false,
- handle_noreturn_attribute, false },
- { "volatile", 0, 0, true, false, false,
- handle_noreturn_attribute, false },
- { "stack_protect", 0, 0, true, false, false,
- handle_stack_protect_attribute, false },
- { "noinline", 0, 0, true, false, false,
- handle_noinline_attribute, false },
- { "noclone", 0, 0, true, false, false,
- handle_noclone_attribute, false },
- { "no_icf", 0, 0, true, false, false,
- handle_noicf_attribute, false },
- { "leaf", 0, 0, true, false, false,
- handle_leaf_attribute, false },
- { "always_inline", 0, 0, true, false, false,
- handle_always_inline_attribute, false },
- { "gnu_inline", 0, 0, true, false, false,
- handle_gnu_inline_attribute, false },
- { "artificial", 0, 0, true, false, false,
- handle_artificial_attribute, false },
- { "flatten", 0, 0, true, false, false,
- handle_flatten_attribute, false },
- { "used", 0, 0, true, false, false,
- handle_used_attribute, false },
- { "unused", 0, 0, false, false, false,
- handle_unused_attribute, false },
- { "externally_visible", 0, 0, true, false, false,
- handle_externally_visible_attribute, false },
- { "no_reorder", 0, 0, true, false, false,
- handle_no_reorder_attribute, false },
- /* The same comments as for noreturn attributes apply to const ones. */
- { "const", 0, 0, true, false, false,
- handle_const_attribute, false },
- { "scalar_storage_order", 1, 1, false, false, false,
- handle_scalar_storage_order_attribute, false },
- { "transparent_union", 0, 0, false, false, false,
- handle_transparent_union_attribute, false },
- { "constructor", 0, 1, true, false, false,
- handle_constructor_attribute, false },
- { "destructor", 0, 1, true, false, false,
- handle_destructor_attribute, false },
- { "mode", 1, 1, false, true, false,
- handle_mode_attribute, false },
- { "section", 1, 1, true, false, false,
- handle_section_attribute, false },
- { "aligned", 0, 1, false, false, false,
- handle_aligned_attribute, false },
- { "weak", 0, 0, true, false, false,
- handle_weak_attribute, false },
- { "noplt", 0, 0, true, false, false,
- handle_noplt_attribute, false },
- { "ifunc", 1, 1, true, false, false,
- handle_ifunc_attribute, false },
- { "alias", 1, 1, true, false, false,
- handle_alias_attribute, false },
- { "weakref", 0, 1, true, false, false,
- handle_weakref_attribute, false },
- { "no_instrument_function", 0, 0, true, false, false,
- handle_no_instrument_function_attribute,
- false },
- { "no_profile_instrument_function", 0, 0, true, false, false,
- handle_no_profile_instrument_function_attribute,
- false },
- { "malloc", 0, 0, true, false, false,
- handle_malloc_attribute, false },
- { "returns_twice", 0, 0, true, false, false,
- handle_returns_twice_attribute, false },
- { "no_stack_limit", 0, 0, true, false, false,
- handle_no_limit_stack_attribute, false },
- { "pure", 0, 0, true, false, false,
- handle_pure_attribute, false },
- { "transaction_callable", 0, 0, false, true, false,
- handle_tm_attribute, false },
- { "transaction_unsafe", 0, 0, false, true, false,
- handle_tm_attribute, true },
- { "transaction_safe", 0, 0, false, true, false,
- handle_tm_attribute, true },
- { "transaction_safe_dynamic", 0, 0, true, false, false,
- handle_tm_attribute, false },
- { "transaction_may_cancel_outer", 0, 0, false, true, false,
- handle_tm_attribute, false },
- /* ??? These two attributes didn't make the transition from the
- Intel language document to the multi-vendor language document. */
- { "transaction_pure", 0, 0, false, true, false,
- handle_tm_attribute, false },
- { "transaction_wrap", 1, 1, true, false, false,
- handle_tm_wrap_attribute, false },
- /* For internal use (marking of builtins) only. The name contains space
- to prevent its usage in source code. */
- { "no vops", 0, 0, true, false, false,
- handle_novops_attribute, false },
- { "deprecated", 0, 1, false, false, false,
- handle_deprecated_attribute, false },
- { "vector_size", 1, 1, false, true, false,
- handle_vector_size_attribute, true },
- { "visibility", 1, 1, false, false, false,
- handle_visibility_attribute, false },
- { "tls_model", 1, 1, true, false, false,
- handle_tls_model_attribute, false },
- { "nonnull", 0, -1, false, true, true,
- handle_nonnull_attribute, false },
- { "nothrow", 0, 0, true, false, false,
- handle_nothrow_attribute, false },
- { "may_alias", 0, 0, false, true, false, NULL, false },
- { "cleanup", 1, 1, true, false, false,
- handle_cleanup_attribute, false },
- { "warn_unused_result", 0, 0, false, true, true,
- handle_warn_unused_result_attribute, false },
- { "sentinel", 0, 1, false, true, true,
- handle_sentinel_attribute, false },
- /* For internal use (marking of builtins) only. The name contains space
- to prevent its usage in source code. */
- { "type generic", 0, 0, false, true, true,
- handle_type_generic_attribute, false },
- { "alloc_size", 1, 2, false, true, true,
- handle_alloc_size_attribute, false },
- { "cold", 0, 0, true, false, false,
- handle_cold_attribute, false },
- { "hot", 0, 0, true, false, false,
- handle_hot_attribute, false },
- { "no_address_safety_analysis",
- 0, 0, true, false, false,
- handle_no_address_safety_analysis_attribute,
- false },
- { "no_sanitize_address", 0, 0, true, false, false,
- handle_no_sanitize_address_attribute,
- false },
- { "no_sanitize_thread", 0, 0, true, false, false,
- handle_no_sanitize_address_attribute,
- false },
- { "no_sanitize_undefined", 0, 0, true, false, false,
- handle_no_sanitize_undefined_attribute,
- false },
- { "warning", 1, 1, true, false, false,
- handle_error_attribute, false },
- { "error", 1, 1, true, false, false,
- handle_error_attribute, false },
- { "target", 1, -1, true, false, false,
- handle_target_attribute, false },
- { "target_clones", 1, -1, true, false, false,
- handle_target_clones_attribute, false },
- { "optimize", 1, -1, true, false, false,
- handle_optimize_attribute, false },
- /* For internal use only. The leading '*' both prevents its usage in
- source code and signals that it may be overridden by machine tables. */
- { "*tm regparm", 0, 0, false, true, true,
- ignore_attribute, false },
- { "no_split_stack", 0, 0, true, false, false,
- handle_no_split_stack_attribute, false },
- /* For internal use (marking of builtins and runtime functions) only.
- The name contains space to prevent its usage in source code. */
- { "fn spec", 1, 1, false, true, true,
- handle_fnspec_attribute, false },
- { "warn_unused", 0, 0, false, false, false,
- handle_warn_unused_attribute, false },
- { "returns_nonnull", 0, 0, false, true, true,
- handle_returns_nonnull_attribute, false },
- { "omp declare simd", 0, -1, true, false, false,
- handle_omp_declare_simd_attribute, false },
- { "cilk simd function", 0, -1, true, false, false,
- handle_omp_declare_simd_attribute, false },
- { "simd", 0, 1, true, false, false,
- handle_simd_attribute, false },
- { "omp declare target", 0, 0, true, false, false,
- handle_omp_declare_target_attribute, false },
- { "omp declare target link", 0, 0, true, false, false,
- handle_omp_declare_target_attribute, false },
- { "alloc_align", 1, 1, false, true, true,
- handle_alloc_align_attribute, false },
- { "assume_aligned", 1, 2, false, true, true,
- handle_assume_aligned_attribute, false },
- { "designated_init", 0, 0, false, true, false,
- handle_designated_init_attribute, false },
- { "bnd_variable_size", 0, 0, true, false, false,
- handle_bnd_variable_size_attribute, false },
- { "bnd_legacy", 0, 0, true, false, false,
- handle_bnd_legacy, false },
- { "bnd_instrument", 0, 0, true, false, false,
- handle_bnd_instrument, false },
- { NULL, 0, 0, false, false, false, NULL, false }
-};
-
-/* Give the specifications for the format attributes, used by C and all
- descendants.
-
- All attributes referencing arguments should be additionally processed
- in chkp_copy_function_type_adding_bounds for correct instrumentation
- by Pointer Bounds Checker.
- Current list of processed format attributes: format, format_arg. */
-const struct attribute_spec c_common_format_attribute_table[] =
-{
- /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
- affects_type_identity } */
- { "format", 3, 3, false, true, true,
- handle_format_attribute, false },
- { "format_arg", 1, 1, false, true, true,
- handle_format_arg_attribute, false },
- { NULL, 0, 0, false, false, false, NULL, false }
-};
-
/* Return identifier for address space AS. */
const char *
get_cpp_ttype_from_string_type (tree string_type)
{
gcc_assert (string_type);
+ if (TREE_CODE (string_type) == POINTER_TYPE)
+ string_type = TREE_TYPE (string_type);
+
if (TREE_CODE (string_type) != ARRAY_TYPE)
return CPP_OTHER;
GTY(()) string_concat_db *g_string_concat_db;
-/* Attempt to determine the source location of the substring.
- If successful, return NULL and write the source location to *OUT_LOC.
- Otherwise return an error message. Error messages are intended
- for GCC developers (to help debugging) rather than for end-users. */
+/* Implementation of LANG_HOOKS_GET_SUBSTRING_LOCATION. */
const char *
-substring_loc::get_location (location_t *out_loc) const
+c_get_substring_location (const substring_loc &substr_loc,
+ location_t *out_loc)
{
- gcc_assert (out_loc);
-
- enum cpp_ttype tok_type = get_cpp_ttype_from_string_type (m_string_type);
+ enum cpp_ttype tok_type
+ = get_cpp_ttype_from_string_type (substr_loc.get_string_type ());
if (tok_type == CPP_OTHER)
return "unrecognized string type";
return get_source_location_for_substring (parse_in, g_string_concat_db,
- m_fmt_string_loc, tok_type,
- m_caret_idx, m_start_idx, m_end_idx,
+ substr_loc.get_fmt_string_loc (),
+ tok_type,
+ substr_loc.get_caret_idx (),
+ substr_loc.get_start_idx (),
+ substr_loc.get_end_idx (),
out_loc);
}
/* Fold X for consideration by one of the warning functions when checking
whether an expression has a constant value. */
-static tree
+tree
fold_for_warn (tree x)
{
if (c_dialect_cxx ())
return x;
}
-/* Print a warning if a constant expression had overflow in folding.
- Invoke this function on every expression that the language
- requires to be a constant expression.
- Note the ANSI C standard says it is erroneous for a
- constant expression to overflow. */
+/* Return true iff T is a boolean promoted to int. */
-void
-constant_expression_warning (tree value)
+bool
+bool_promoted_to_int_p (tree t)
{
- if (warn_overflow && pedantic
- && (TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
- || TREE_CODE (value) == FIXED_CST
- || TREE_CODE (value) == VECTOR_CST
- || TREE_CODE (value) == COMPLEX_CST)
- && TREE_OVERFLOW (value))
- pedwarn (input_location, OPT_Woverflow, "overflow in constant expression");
+ return (CONVERT_EXPR_P (t)
+ && TREE_TYPE (t) == integer_type_node
+ && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == BOOLEAN_TYPE);
}
-/* The same as above but print an unconditional error. */
-void
-constant_expression_error (tree value)
+/* vector_targets_convertible_p is used for vector pointer types. The
+ callers perform various checks that the qualifiers are satisfactory,
+ while OTOH vector_targets_convertible_p ignores the number of elements
+ in the vectors. That's fine with vector pointers as we can consider,
+ say, a vector of 8 elements as two consecutive vectors of 4 elements,
+ and that does not require and conversion of the pointer values.
+ In contrast, vector_types_convertible_p and
+ vector_types_compatible_elements_p are used for vector value types. */
+/* True if pointers to distinct types T1 and T2 can be converted to
+ each other without an explicit cast. Only returns true for opaque
+ vector types. */
+bool
+vector_targets_convertible_p (const_tree t1, const_tree t2)
{
- if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
- || TREE_CODE (value) == FIXED_CST
- || TREE_CODE (value) == VECTOR_CST
- || TREE_CODE (value) == COMPLEX_CST)
- && TREE_OVERFLOW (value))
- error ("overflow in constant expression");
-}
-
-/* Print a warning if an expression had overflow in folding and its
- operands hadn't.
+ if (VECTOR_TYPE_P (t1) && VECTOR_TYPE_P (t2)
+ && (TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2))
+ && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
+ return true;
- Invoke this function on every expression that
- (1) appears in the source code, and
- (2) is a constant expression that overflowed, and
- (3) is not already checked by convert_and_check;
- however, do not invoke this function on operands of explicit casts
- or when the expression is the result of an operator and any operand
- already overflowed. */
+ return false;
+}
-void
-overflow_warning (location_t loc, tree value)
+/* vector_types_convertible_p is used for vector value types.
+ It could in principle call vector_targets_convertible_p as a subroutine,
+ but then the check for vector type would be duplicated with its callers,
+ and also the purpose of vector_targets_convertible_p would become
+ muddled.
+ Where vector_types_convertible_p returns true, a conversion might still be
+ needed to make the types match.
+ In contrast, vector_targets_convertible_p is used for vector pointer
+ values, and vector_types_compatible_elements_p is used specifically
+ in the context for binary operators, as a check if use is possible without
+ conversion. */
+/* True if vector types T1 and T2 can be converted to each other
+ without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
+ can only be converted with -flax-vector-conversions yet that is not
+ in effect, emit a note telling the user about that option if such
+ a note has not previously been emitted. */
+bool
+vector_types_convertible_p (const_tree t1, const_tree t2, bool emit_lax_note)
{
- if (c_inhibit_evaluation_warnings != 0)
- return;
-
- switch (TREE_CODE (value))
- {
- case INTEGER_CST:
- warning_at (loc, OPT_Woverflow, "integer overflow in expression");
- break;
+ static bool emitted_lax_note = false;
+ bool convertible_lax;
- case REAL_CST:
- warning_at (loc, OPT_Woverflow,
- "floating point overflow in expression");
- break;
+ if ((TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2))
+ && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
+ return true;
- case FIXED_CST:
- warning_at (loc, OPT_Woverflow, "fixed-point overflow in expression");
- break;
+ convertible_lax =
+ (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
+ && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE ||
+ TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2))
+ && (INTEGRAL_TYPE_P (TREE_TYPE (t1))
+ == INTEGRAL_TYPE_P (TREE_TYPE (t2))));
- case VECTOR_CST:
- warning_at (loc, OPT_Woverflow, "vector overflow in expression");
- break;
+ if (!convertible_lax || flag_lax_vector_conversions)
+ return convertible_lax;
- case COMPLEX_CST:
- if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST)
- warning_at (loc, OPT_Woverflow,
- "complex integer overflow in expression");
- else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST)
- warning_at (loc, OPT_Woverflow,
- "complex floating point overflow in expression");
- break;
+ if (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
+ && lang_hooks.types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2)))
+ return true;
- default:
- break;
+ if (emit_lax_note && !emitted_lax_note)
+ {
+ emitted_lax_note = true;
+ inform (input_location, "use -flax-vector-conversions to permit "
+ "conversions between vectors with differing "
+ "element types or numbers of subparts");
}
+
+ return false;
}
-/* Warn about uses of logical || / && operator in a context where it
- is likely that the bitwise equivalent was intended by the
- programmer. We have seen an expression in which CODE is a binary
- operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
- had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
-void
-warn_logical_operator (location_t location, enum tree_code code, tree type,
- enum tree_code code_left, tree op_left,
- enum tree_code ARG_UNUSED (code_right), tree op_right)
-{
- int or_op = (code == TRUTH_ORIF_EXPR || code == TRUTH_OR_EXPR);
- int in0_p, in1_p, in_p;
- tree low0, low1, low, high0, high1, high, lhs, rhs, tem;
- bool strict_overflow_p = false;
-
- if (code != TRUTH_ANDIF_EXPR
- && code != TRUTH_AND_EXPR
- && code != TRUTH_ORIF_EXPR
- && code != TRUTH_OR_EXPR)
- return;
+/* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
+ and have vector types, V0 has the same type as V1, and the number of
+ elements of V0, V1, MASK is the same.
- /* We don't want to warn if either operand comes from a macro
- expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
- see PR61534. */
- if (from_macro_expansion_at (EXPR_LOCATION (op_left))
- || from_macro_expansion_at (EXPR_LOCATION (op_right)))
- return;
+ In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
+ called with two arguments. In this case implementation passes the
+ first argument twice in order to share the same tree code. This fact
+ could enable the mask-values being twice the vector length. This is
+ an implementation accident and this semantics is not guaranteed to
+ the user. */
+tree
+c_build_vec_perm_expr (location_t loc, tree v0, tree v1, tree mask,
+ bool complain)
+{
+ tree ret;
+ bool wrap = true;
+ bool maybe_const = false;
+ bool two_arguments = false;
- /* Warn if &&/|| are being used in a context where it is
- likely that the bitwise equivalent was intended by the
- programmer. That is, an expression such as op && MASK
- where op should not be any boolean expression, nor a
- constant, and mask seems to be a non-boolean integer constant. */
- if (TREE_CODE (op_right) == CONST_DECL)
- /* An enumerator counts as a constant. */
- op_right = DECL_INITIAL (op_right);
- if (!truth_value_p (code_left)
- && INTEGRAL_TYPE_P (TREE_TYPE (op_left))
- && !CONSTANT_CLASS_P (op_left)
- && !TREE_NO_WARNING (op_left)
- && TREE_CODE (op_right) == INTEGER_CST
- && !integer_zerop (op_right)
- && !integer_onep (op_right))
- {
- if (or_op)
- warning_at (location, OPT_Wlogical_op, "logical %<or%>"
- " applied to non-boolean constant");
- else
- warning_at (location, OPT_Wlogical_op, "logical %<and%>"
- " applied to non-boolean constant");
- TREE_NO_WARNING (op_left) = true;
- return;
+ if (v1 == NULL_TREE)
+ {
+ two_arguments = true;
+ v1 = v0;
}
- /* We do not warn for constants because they are typical of macro
- expansions that test for features. */
- if (CONSTANT_CLASS_P (fold_for_warn (op_left))
- || CONSTANT_CLASS_P (fold_for_warn (op_right)))
- return;
-
- /* This warning only makes sense with logical operands. */
- if (!(truth_value_p (TREE_CODE (op_left))
- || INTEGRAL_TYPE_P (TREE_TYPE (op_left)))
- || !(truth_value_p (TREE_CODE (op_right))
- || INTEGRAL_TYPE_P (TREE_TYPE (op_right))))
- return;
-
- /* The range computations only work with scalars. */
- if (VECTOR_TYPE_P (TREE_TYPE (op_left))
- || VECTOR_TYPE_P (TREE_TYPE (op_right)))
- return;
-
- /* We first test whether either side separately is trivially true
- (with OR) or trivially false (with AND). If so, do not warn.
- This is a common idiom for testing ranges of data types in
- portable code. */
- lhs = make_range (op_left, &in0_p, &low0, &high0, &strict_overflow_p);
- if (!lhs)
- return;
- if (TREE_CODE (lhs) == C_MAYBE_CONST_EXPR)
- lhs = C_MAYBE_CONST_EXPR_EXPR (lhs);
-
- /* If this is an OR operation, invert both sides; now, the result
- should be always false to get a warning. */
- if (or_op)
- in0_p = !in0_p;
-
- tem = build_range_check (UNKNOWN_LOCATION, type, lhs, in0_p, low0, high0);
- if (tem && integer_zerop (tem))
- return;
-
- rhs = make_range (op_right, &in1_p, &low1, &high1, &strict_overflow_p);
- if (!rhs)
- return;
- if (TREE_CODE (rhs) == C_MAYBE_CONST_EXPR)
- rhs = C_MAYBE_CONST_EXPR_EXPR (rhs);
-
- /* If this is an OR operation, invert both sides; now, the result
- should be always false to get a warning. */
- if (or_op)
- in1_p = !in1_p;
+ if (v0 == error_mark_node || v1 == error_mark_node
+ || mask == error_mark_node)
+ return error_mark_node;
- tem = build_range_check (UNKNOWN_LOCATION, type, rhs, in1_p, low1, high1);
- if (tem && integer_zerop (tem))
- return;
+ if (!VECTOR_INTEGER_TYPE_P (TREE_TYPE (mask)))
+ {
+ if (complain)
+ error_at (loc, "__builtin_shuffle last argument must "
+ "be an integer vector");
+ return error_mark_node;
+ }
- /* If both expressions have the same operand, if we can merge the
- ranges, ... */
- if (operand_equal_p (lhs, rhs, 0)
- && merge_ranges (&in_p, &low, &high, in0_p, low0, high0,
- in1_p, low1, high1))
+ if (!VECTOR_TYPE_P (TREE_TYPE (v0))
+ || !VECTOR_TYPE_P (TREE_TYPE (v1)))
{
- tem = build_range_check (UNKNOWN_LOCATION, type, lhs, in_p, low, high);
- /* ... and if the range test is always false, then warn. */
- if (tem && integer_zerop (tem))
- {
- if (or_op)
- warning_at (location, OPT_Wlogical_op,
- "logical %<or%> of collectively exhaustive tests is "
- "always true");
- else
- warning_at (location, OPT_Wlogical_op,
- "logical %<and%> of mutually exclusive tests is "
- "always false");
- }
- /* Or warn if the operands have exactly the same range, e.g.
- A > 0 && A > 0. */
- else if (tree_int_cst_equal (low0, low1)
- && tree_int_cst_equal (high0, high1))
- {
- if (or_op)
- warning_at (location, OPT_Wlogical_op,
- "logical %<or%> of equal expressions");
- else
- warning_at (location, OPT_Wlogical_op,
- "logical %<and%> of equal expressions");
- }
+ if (complain)
+ error_at (loc, "__builtin_shuffle arguments must be vectors");
+ return error_mark_node;
}
-}
-/* Helper function for warn_tautological_cmp. Look for ARRAY_REFs
- with constant indices. */
+ if (TYPE_MAIN_VARIANT (TREE_TYPE (v0)) != TYPE_MAIN_VARIANT (TREE_TYPE (v1)))
+ {
+ if (complain)
+ error_at (loc, "__builtin_shuffle argument vectors must be of "
+ "the same type");
+ return error_mark_node;
+ }
-static tree
-find_array_ref_with_const_idx_r (tree *expr_p, int *walk_subtrees, void *data)
-{
- tree expr = *expr_p;
+ if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (v0))
+ != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask))
+ && TYPE_VECTOR_SUBPARTS (TREE_TYPE (v1))
+ != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask)))
+ {
+ if (complain)
+ error_at (loc, "__builtin_shuffle number of elements of the "
+ "argument vector(s) and the mask vector should "
+ "be the same");
+ return error_mark_node;
+ }
- if ((TREE_CODE (expr) == ARRAY_REF
- || TREE_CODE (expr) == ARRAY_RANGE_REF)
- && TREE_CODE (TREE_OPERAND (expr, 1)) == INTEGER_CST)
+ if (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (TREE_TYPE (TREE_TYPE (v0))))
+ != GET_MODE_BITSIZE (SCALAR_TYPE_MODE (TREE_TYPE (TREE_TYPE (mask)))))
{
- *(bool *) data = true;
- *walk_subtrees = 0;
+ if (complain)
+ error_at (loc, "__builtin_shuffle argument vector(s) inner type "
+ "must have the same size as inner type of the mask");
+ return error_mark_node;
}
- return NULL_TREE;
-}
+ if (!c_dialect_cxx ())
+ {
+ /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
+ v0 = c_fully_fold (v0, false, &maybe_const);
+ wrap &= maybe_const;
-/* Warn if a self-comparison always evaluates to true or false. LOC
- is the location of the comparison with code CODE, LHS and RHS are
- operands of the comparison. */
+ if (two_arguments)
+ v1 = v0 = save_expr (v0);
+ else
+ {
+ v1 = c_fully_fold (v1, false, &maybe_const);
+ wrap &= maybe_const;
+ }
-void
-warn_tautological_cmp (location_t loc, enum tree_code code, tree lhs, tree rhs)
-{
- if (TREE_CODE_CLASS (code) != tcc_comparison)
- return;
+ mask = c_fully_fold (mask, false, &maybe_const);
+ wrap &= maybe_const;
+ }
+ else if (two_arguments)
+ v1 = v0 = save_expr (v0);
- /* Don't warn for various macro expansions. */
- if (from_macro_expansion_at (loc)
- || from_macro_expansion_at (EXPR_LOCATION (lhs))
- || from_macro_expansion_at (EXPR_LOCATION (rhs)))
- return;
+ ret = build3_loc (loc, VEC_PERM_EXPR, TREE_TYPE (v0), v0, v1, mask);
- /* We do not warn for constants because they are typical of macro
- expansions that test for features, sizeof, and similar. */
- if (CONSTANT_CLASS_P (fold_for_warn (lhs))
- || CONSTANT_CLASS_P (fold_for_warn (rhs)))
- return;
+ if (!c_dialect_cxx () && !wrap)
+ ret = c_wrap_maybe_const (ret, true);
- /* Don't warn for e.g.
- HOST_WIDE_INT n;
- ...
- if (n == (long) n) ...
- */
- if ((CONVERT_EXPR_P (lhs) || TREE_CODE (lhs) == NON_LVALUE_EXPR)
- || (CONVERT_EXPR_P (rhs) || TREE_CODE (rhs) == NON_LVALUE_EXPR))
- return;
+ return ret;
+}
- /* Don't warn if either LHS or RHS has an IEEE floating-point type.
- It could be a NaN, and NaN never compares equal to anything, even
- itself. */
- if (FLOAT_TYPE_P (TREE_TYPE (lhs)) || FLOAT_TYPE_P (TREE_TYPE (rhs)))
- return;
+/* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
+ to integral type. */
+
+tree
+c_common_get_narrower (tree op, int *unsignedp_ptr)
+{
+ op = get_narrower (op, unsignedp_ptr);
- if (operand_equal_p (lhs, rhs, 0))
+ if (TREE_CODE (TREE_TYPE (op)) == ENUMERAL_TYPE
+ && ENUM_IS_SCOPED (TREE_TYPE (op)))
{
- /* Don't warn about array references with constant indices;
- these are likely to come from a macro. */
- bool found = false;
- walk_tree_without_duplicates (&lhs, find_array_ref_with_const_idx_r,
- &found);
- if (found)
- return;
- const bool always_true = (code == EQ_EXPR || code == LE_EXPR
- || code == GE_EXPR || code == UNLE_EXPR
- || code == UNGE_EXPR || code == UNEQ_EXPR);
- if (always_true)
- warning_at (loc, OPT_Wtautological_compare,
- "self-comparison always evaluates to true");
- else
- warning_at (loc, OPT_Wtautological_compare,
- "self-comparison always evaluates to false");
+ /* C++0x scoped enumerations don't implicitly convert to integral
+ type; if we stripped an explicit conversion to a larger type we
+ need to replace it so common_type will still work. */
+ tree type = c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op)),
+ TYPE_UNSIGNED (TREE_TYPE (op)));
+ op = fold_convert (type, op);
}
+ return op;
}
-/* Warn about logical not used on the left hand side operand of a comparison.
- This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
- Do not warn if RHS is of a boolean type. */
+/* This is a helper function of build_binary_op.
+
+ For certain operations if both args were extended from the same
+ smaller type, do the arithmetic in that type and then extend.
-void
-warn_logical_not_parentheses (location_t location, enum tree_code code,
- tree rhs)
+ BITWISE indicates a bitwise operation.
+ For them, this optimization is safe only if
+ both args are zero-extended or both are sign-extended.
+ Otherwise, we might change the result.
+ Eg, (short)-1 | (unsigned short)-1 is (int)-1
+ but calculated in (unsigned short) it would be (unsigned short)-1.
+*/
+tree
+shorten_binary_op (tree result_type, tree op0, tree op1, bool bitwise)
{
- if (TREE_CODE_CLASS (code) != tcc_comparison
- || TREE_TYPE (rhs) == NULL_TREE
- || TREE_CODE (TREE_TYPE (rhs)) == BOOLEAN_TYPE)
- return;
+ int unsigned0, unsigned1;
+ tree arg0, arg1;
+ int uns;
+ tree type;
- /* Don't warn for !x == 0 or !y != 0, those are equivalent to
- !(x == 0) or !(y != 0). */
- if ((code == EQ_EXPR || code == NE_EXPR)
- && integer_zerop (rhs))
- return;
+ /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
+ excessive narrowing when we call get_narrower below. For
+ example, suppose that OP0 is of unsigned int extended
+ from signed char and that RESULT_TYPE is long long int.
+ If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
+ like
- warning_at (location, OPT_Wlogical_not_parentheses,
- "logical not is only applied to the left hand side of "
- "comparison");
-}
+ (long long int) (unsigned int) signed_char
-/* Warn if EXP contains any computations whose results are not used.
- Return true if a warning is printed; false otherwise. LOCUS is the
- (potential) location of the expression. */
+ which get_narrower would narrow down to
-bool
-warn_if_unused_value (const_tree exp, location_t locus)
-{
- restart:
- if (TREE_USED (exp) || TREE_NO_WARNING (exp))
- return false;
-
- /* Don't warn about void constructs. This includes casting to void,
- void function calls, and statement expressions with a final cast
- to void. */
- if (VOID_TYPE_P (TREE_TYPE (exp)))
- return false;
-
- if (EXPR_HAS_LOCATION (exp))
- locus = EXPR_LOCATION (exp);
-
- switch (TREE_CODE (exp))
- {
- case PREINCREMENT_EXPR:
- case POSTINCREMENT_EXPR:
- case PREDECREMENT_EXPR:
- case POSTDECREMENT_EXPR:
- case MODIFY_EXPR:
- case INIT_EXPR:
- case TARGET_EXPR:
- case CALL_EXPR:
- case TRY_CATCH_EXPR:
- case WITH_CLEANUP_EXPR:
- case EXIT_EXPR:
- case VA_ARG_EXPR:
- return false;
-
- case BIND_EXPR:
- /* For a binding, warn if no side effect within it. */
- exp = BIND_EXPR_BODY (exp);
- goto restart;
-
- case SAVE_EXPR:
- case NON_LVALUE_EXPR:
- case NOP_EXPR:
- exp = TREE_OPERAND (exp, 0);
- goto restart;
+ (unsigned int) signed char
- case TRUTH_ORIF_EXPR:
- case TRUTH_ANDIF_EXPR:
- /* In && or ||, warn if 2nd operand has no side effect. */
- exp = TREE_OPERAND (exp, 1);
- goto restart;
+ If we do not cast OP0 first, get_narrower would return
+ signed_char, which is inconsistent with the case of the
+ explicit cast. */
+ op0 = convert (result_type, op0);
+ op1 = convert (result_type, op1);
- case COMPOUND_EXPR:
- if (warn_if_unused_value (TREE_OPERAND (exp, 0), locus))
- return true;
- /* Let people do `(foo (), 0)' without a warning. */
- if (TREE_CONSTANT (TREE_OPERAND (exp, 1)))
- return false;
- exp = TREE_OPERAND (exp, 1);
- goto restart;
+ arg0 = c_common_get_narrower (op0, &unsigned0);
+ arg1 = c_common_get_narrower (op1, &unsigned1);
- case COND_EXPR:
- /* If this is an expression with side effects, don't warn; this
- case commonly appears in macro expansions. */
- if (TREE_SIDE_EFFECTS (exp))
- return false;
- goto warn;
+ /* UNS is 1 if the operation to be done is an unsigned one. */
+ uns = TYPE_UNSIGNED (result_type);
- case INDIRECT_REF:
- /* Don't warn about automatic dereferencing of references, since
- the user cannot control it. */
- if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == REFERENCE_TYPE)
- {
- exp = TREE_OPERAND (exp, 0);
- goto restart;
- }
- /* Fall through. */
+ /* Handle the case that OP0 (or OP1) does not *contain* a conversion
+ but it *requires* conversion to FINAL_TYPE. */
- default:
- /* Referencing a volatile value is a side effect, so don't warn. */
- if ((DECL_P (exp) || REFERENCE_CLASS_P (exp))
- && TREE_THIS_VOLATILE (exp))
- return false;
+ if ((TYPE_PRECISION (TREE_TYPE (op0))
+ == TYPE_PRECISION (TREE_TYPE (arg0)))
+ && TREE_TYPE (op0) != result_type)
+ unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
+ if ((TYPE_PRECISION (TREE_TYPE (op1))
+ == TYPE_PRECISION (TREE_TYPE (arg1)))
+ && TREE_TYPE (op1) != result_type)
+ unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
- /* If this is an expression which has no operands, there is no value
- to be unused. There are no such language-independent codes,
- but front ends may define such. */
- if (EXPRESSION_CLASS_P (exp) && TREE_OPERAND_LENGTH (exp) == 0)
- return false;
+ /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
- warn:
- return warning_at (locus, OPT_Wunused_value, "value computed is not used");
- }
-}
+ /* For bitwise operations, signedness of nominal type
+ does not matter. Consider only how operands were extended. */
+ if (bitwise)
+ uns = unsigned0;
+ /* Note that in all three cases below we refrain from optimizing
+ an unsigned operation on sign-extended args.
+ That would not be valid. */
-/* Print a warning about casts that might indicate violation
- of strict aliasing rules if -Wstrict-aliasing is used and
- strict aliasing mode is in effect. OTYPE is the original
- TREE_TYPE of EXPR, and TYPE the type we're casting to. */
+ /* Both args variable: if both extended in same way
+ from same width, do it in that width.
+ Do it unsigned if args were zero-extended. */
+ if ((TYPE_PRECISION (TREE_TYPE (arg0))
+ < TYPE_PRECISION (result_type))
+ && (TYPE_PRECISION (TREE_TYPE (arg1))
+ == TYPE_PRECISION (TREE_TYPE (arg0)))
+ && unsigned0 == unsigned1
+ && (unsigned0 || !uns))
+ return c_common_signed_or_unsigned_type
+ (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
-bool
-strict_aliasing_warning (tree otype, tree type, tree expr)
-{
- /* Strip pointer conversion chains and get to the correct original type. */
- STRIP_NOPS (expr);
- otype = TREE_TYPE (expr);
-
- if (!(flag_strict_aliasing
- && POINTER_TYPE_P (type)
- && POINTER_TYPE_P (otype)
- && !VOID_TYPE_P (TREE_TYPE (type)))
- /* If the type we are casting to is a ref-all pointer
- dereferencing it is always valid. */
- || TYPE_REF_CAN_ALIAS_ALL (type))
- return false;
+ else if (TREE_CODE (arg0) == INTEGER_CST
+ && (unsigned1 || !uns)
+ && (TYPE_PRECISION (TREE_TYPE (arg1))
+ < TYPE_PRECISION (result_type))
+ && (type
+ = c_common_signed_or_unsigned_type (unsigned1,
+ TREE_TYPE (arg1)))
+ && !POINTER_TYPE_P (type)
+ && int_fits_type_p (arg0, type))
+ return type;
- if ((warn_strict_aliasing > 1) && TREE_CODE (expr) == ADDR_EXPR
- && (DECL_P (TREE_OPERAND (expr, 0))
- || handled_component_p (TREE_OPERAND (expr, 0))))
- {
- /* Casting the address of an object to non void pointer. Warn
- if the cast breaks type based aliasing. */
- if (!COMPLETE_TYPE_P (TREE_TYPE (type)) && warn_strict_aliasing == 2)
- {
- warning (OPT_Wstrict_aliasing, "type-punning to incomplete type "
- "might break strict-aliasing rules");
- return true;
- }
- else
- {
- /* warn_strict_aliasing >= 3. This includes the default (3).
- Only warn if the cast is dereferenced immediately. */
- alias_set_type set1 =
- get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
- alias_set_type set2 = get_alias_set (TREE_TYPE (type));
-
- if (set1 != set2 && set2 != 0
- && (set1 == 0
- || (!alias_set_subset_of (set2, set1)
- && !alias_sets_conflict_p (set1, set2))))
- {
- warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
- "pointer will break strict-aliasing rules");
- return true;
- }
- else if (warn_strict_aliasing == 2
- && !alias_sets_must_conflict_p (set1, set2))
- {
- warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
- "pointer might break strict-aliasing rules");
- return true;
- }
- }
- }
- else
- if ((warn_strict_aliasing == 1) && !VOID_TYPE_P (TREE_TYPE (otype)))
- {
- /* At this level, warn for any conversions, even if an address is
- not taken in the same statement. This will likely produce many
- false positives, but could be useful to pinpoint problems that
- are not revealed at higher levels. */
- alias_set_type set1 = get_alias_set (TREE_TYPE (otype));
- alias_set_type set2 = get_alias_set (TREE_TYPE (type));
- if (!COMPLETE_TYPE_P (type)
- || !alias_sets_must_conflict_p (set1, set2))
- {
- warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
- "pointer might break strict-aliasing rules");
- return true;
- }
- }
+ else if (TREE_CODE (arg1) == INTEGER_CST
+ && (unsigned0 || !uns)
+ && (TYPE_PRECISION (TREE_TYPE (arg0))
+ < TYPE_PRECISION (result_type))
+ && (type
+ = c_common_signed_or_unsigned_type (unsigned0,
+ TREE_TYPE (arg0)))
+ && !POINTER_TYPE_P (type)
+ && int_fits_type_p (arg1, type))
+ return type;
- return false;
+ return result_type;
}
-/* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
- sizeof as last operand of certain builtins. */
+/* Returns true iff any integer value of type FROM_TYPE can be represented as
+ real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
-void
-sizeof_pointer_memaccess_warning (location_t *sizeof_arg_loc, tree callee,
- vec<tree, va_gc> *params, tree *sizeof_arg,
- bool (*comp_types) (tree, tree))
+static bool
+int_safely_convertible_to_real_p (const_tree from_type, const_tree to_type)
{
- tree type, dest = NULL_TREE, src = NULL_TREE, tem;
- bool strop = false, cmp = false;
- unsigned int idx = ~0;
- location_t loc;
+ tree type_low_bound = TYPE_MIN_VALUE (from_type);
+ tree type_high_bound = TYPE_MAX_VALUE (from_type);
+ REAL_VALUE_TYPE real_low_bound =
+ real_value_from_int_cst (0, type_low_bound);
+ REAL_VALUE_TYPE real_high_bound =
+ real_value_from_int_cst (0, type_high_bound);
- if (TREE_CODE (callee) != FUNCTION_DECL
- || DECL_BUILT_IN_CLASS (callee) != BUILT_IN_NORMAL
- || vec_safe_length (params) <= 1)
- return;
+ return exact_real_truncate (TYPE_MODE (to_type), &real_low_bound)
+ && exact_real_truncate (TYPE_MODE (to_type), &real_high_bound);
+}
- switch (DECL_FUNCTION_CODE (callee))
- {
- case BUILT_IN_STRNCMP:
- case BUILT_IN_STRNCASECMP:
- cmp = true;
- /* FALLTHRU */
- case BUILT_IN_STRNCPY:
- case BUILT_IN_STRNCPY_CHK:
- case BUILT_IN_STRNCAT:
- case BUILT_IN_STRNCAT_CHK:
- case BUILT_IN_STPNCPY:
- case BUILT_IN_STPNCPY_CHK:
- strop = true;
- /* FALLTHRU */
- case BUILT_IN_MEMCPY:
- case BUILT_IN_MEMCPY_CHK:
- case BUILT_IN_MEMMOVE:
- case BUILT_IN_MEMMOVE_CHK:
- if (params->length () < 3)
- return;
- src = (*params)[1];
- dest = (*params)[0];
- idx = 2;
- break;
- case BUILT_IN_BCOPY:
- if (params->length () < 3)
- return;
- src = (*params)[0];
- dest = (*params)[1];
- idx = 2;
- break;
- case BUILT_IN_MEMCMP:
- case BUILT_IN_BCMP:
- if (params->length () < 3)
- return;
- src = (*params)[1];
- dest = (*params)[0];
- idx = 2;
- cmp = true;
- break;
- case BUILT_IN_MEMSET:
- case BUILT_IN_MEMSET_CHK:
- if (params->length () < 3)
- return;
- dest = (*params)[0];
- idx = 2;
- break;
- case BUILT_IN_BZERO:
- dest = (*params)[0];
- idx = 1;
- break;
- case BUILT_IN_STRNDUP:
- src = (*params)[0];
- strop = true;
- idx = 1;
- break;
- case BUILT_IN_MEMCHR:
- if (params->length () < 3)
- return;
- src = (*params)[0];
- idx = 2;
- break;
- case BUILT_IN_SNPRINTF:
- case BUILT_IN_SNPRINTF_CHK:
- case BUILT_IN_VSNPRINTF:
- case BUILT_IN_VSNPRINTF_CHK:
- dest = (*params)[0];
- idx = 1;
- strop = true;
- break;
- default:
- break;
- }
+/* Checks if expression EXPR of complex/real/integer type cannot be converted
+ to the complex/real/integer type TYPE. Function returns non-zero when:
+ * EXPR is a constant which cannot be exactly converted to TYPE.
+ * EXPR is not a constant and size of EXPR's type > than size of TYPE,
+ for EXPR type and TYPE being both integers or both real, or both
+ complex.
+ * EXPR is not a constant of complex type and TYPE is a real or
+ an integer.
+ * EXPR is not a constant of real type and TYPE is an integer.
+ * EXPR is not a constant of integer type which cannot be
+ exactly converted to real type.
- if (idx >= 3)
- return;
+ Function allows conversions between types of different signedness and
+ can return SAFE_CONVERSION (zero) in that case. Function can produce
+ signedness warnings if PRODUCE_WARNS is true.
- if (sizeof_arg[idx] == NULL || sizeof_arg[idx] == error_mark_node)
- return;
+ RESULT, when non-null is the result of the conversion. When constant
+ it is included in the text of diagnostics.
- type = TYPE_P (sizeof_arg[idx])
- ? sizeof_arg[idx] : TREE_TYPE (sizeof_arg[idx]);
- if (!POINTER_TYPE_P (type))
- return;
+ Function allows conversions from complex constants to non-complex types,
+ provided that imaginary part is zero and real part can be safely converted
+ to TYPE. */
- if (dest
- && (tem = tree_strip_nop_conversions (dest))
- && POINTER_TYPE_P (TREE_TYPE (tem))
- && comp_types (TREE_TYPE (TREE_TYPE (tem)), type))
- return;
+enum conversion_safety
+unsafe_conversion_p (location_t loc, tree type, tree expr, tree result,
+ bool produce_warns)
+{
+ enum conversion_safety give_warning = SAFE_CONVERSION; /* is 0 or false */
+ tree expr_type = TREE_TYPE (expr);
- if (src
- && (tem = tree_strip_nop_conversions (src))
- && POINTER_TYPE_P (TREE_TYPE (tem))
- && comp_types (TREE_TYPE (TREE_TYPE (tem)), type))
- return;
+ bool cstresult = (result
+ && TREE_CODE_CLASS (TREE_CODE (result)) == tcc_constant);
- loc = sizeof_arg_loc[idx];
+ loc = expansion_point_location_if_in_system_header (loc);
- if (dest && !cmp)
+ if (TREE_CODE (expr) == REAL_CST || TREE_CODE (expr) == INTEGER_CST)
{
- if (!TYPE_P (sizeof_arg[idx])
- && operand_equal_p (dest, sizeof_arg[idx], 0)
- && comp_types (TREE_TYPE (dest), type))
- {
- if (TREE_CODE (sizeof_arg[idx]) == ADDR_EXPR && !strop)
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "expression as the destination; did you mean to "
- "remove the addressof?", callee);
- else if ((TYPE_PRECISION (TREE_TYPE (type))
- == TYPE_PRECISION (char_type_node))
- || strop)
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "expression as the destination; did you mean to "
- "provide an explicit length?", callee);
- else
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "expression as the destination; did you mean to "
- "dereference it?", callee);
- return;
- }
+ /* If type is complex, we are interested in compatibility with
+ underlying type. */
+ if (TREE_CODE (type) == COMPLEX_TYPE)
+ type = TREE_TYPE (type);
- if (POINTER_TYPE_P (TREE_TYPE (dest))
- && !strop
- && comp_types (TREE_TYPE (dest), type)
- && !VOID_TYPE_P (TREE_TYPE (type)))
+ /* Warn for real constant that is not an exact integer converted
+ to integer type. */
+ if (TREE_CODE (expr_type) == REAL_TYPE
+ && TREE_CODE (type) == INTEGER_TYPE)
{
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "pointer type %qT as the destination; expected %qT "
- "or an explicit length", callee, TREE_TYPE (dest),
- TREE_TYPE (TREE_TYPE (dest)));
- return;
+ if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (expr_type)))
+ give_warning = UNSAFE_REAL;
}
- }
-
- if (src && !cmp)
- {
- if (!TYPE_P (sizeof_arg[idx])
- && operand_equal_p (src, sizeof_arg[idx], 0)
- && comp_types (TREE_TYPE (src), type))
+ /* Warn for an integer constant that does not fit into integer type. */
+ else if (TREE_CODE (expr_type) == INTEGER_TYPE
+ && TREE_CODE (type) == INTEGER_TYPE
+ && !int_fits_type_p (expr, type))
{
- if (TREE_CODE (sizeof_arg[idx]) == ADDR_EXPR && !strop)
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "expression as the source; did you mean to "
- "remove the addressof?", callee);
- else if ((TYPE_PRECISION (TREE_TYPE (type))
- == TYPE_PRECISION (char_type_node))
- || strop)
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "expression as the source; did you mean to "
- "provide an explicit length?", callee);
+ if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)
+ && tree_int_cst_sgn (expr) < 0)
+ {
+ if (produce_warns)
+ {
+ if (cstresult)
+ warning_at (loc, OPT_Wsign_conversion,
+ "unsigned conversion from %qT to %qT "
+ "changes value from %qE to %qE",
+ expr_type, type, expr, result);
+ else
+ warning_at (loc, OPT_Wsign_conversion,
+ "unsigned conversion from %qT to %qT "
+ "changes the value of %qE",
+ expr_type, type, expr);
+ }
+ }
+ else if (!TYPE_UNSIGNED (type) && TYPE_UNSIGNED (expr_type))
+ {
+ if (cstresult)
+ warning_at (loc, OPT_Wsign_conversion,
+ "signed conversion from %qT to %qT changes "
+ "value from %qE to %qE",
+ expr_type, type, expr, result);
+ else
+ warning_at (loc, OPT_Wsign_conversion,
+ "signed conversion from %qT to %qT changes "
+ "the value of %qE",
+ expr_type, type, expr);
+ }
else
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "expression as the source; did you mean to "
- "dereference it?", callee);
- return;
+ give_warning = UNSAFE_OTHER;
}
-
- if (POINTER_TYPE_P (TREE_TYPE (src))
- && !strop
- && comp_types (TREE_TYPE (src), type)
- && !VOID_TYPE_P (TREE_TYPE (type)))
+ else if (TREE_CODE (type) == REAL_TYPE)
{
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "pointer type %qT as the source; expected %qT "
- "or an explicit length", callee, TREE_TYPE (src),
- TREE_TYPE (TREE_TYPE (src)));
- return;
+ /* Warn for an integer constant that does not fit into real type. */
+ if (TREE_CODE (expr_type) == INTEGER_TYPE)
+ {
+ REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr);
+ if (!exact_real_truncate (TYPE_MODE (type), &a))
+ give_warning = UNSAFE_REAL;
+ }
+ /* Warn for a real constant that does not fit into a smaller
+ real type. */
+ else if (TREE_CODE (expr_type) == REAL_TYPE
+ && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
+ {
+ REAL_VALUE_TYPE a = TREE_REAL_CST (expr);
+ if (!exact_real_truncate (TYPE_MODE (type), &a))
+ give_warning = UNSAFE_REAL;
+ }
}
}
- if (dest)
+ else if (TREE_CODE (expr) == COMPLEX_CST)
{
- if (!TYPE_P (sizeof_arg[idx])
- && operand_equal_p (dest, sizeof_arg[idx], 0)
- && comp_types (TREE_TYPE (dest), type))
- {
- if (TREE_CODE (sizeof_arg[idx]) == ADDR_EXPR && !strop)
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "expression as the first source; did you mean to "
- "remove the addressof?", callee);
- else if ((TYPE_PRECISION (TREE_TYPE (type))
- == TYPE_PRECISION (char_type_node))
- || strop)
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "expression as the first source; did you mean to "
- "provide an explicit length?", callee);
- else
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "expression as the first source; did you mean to "
- "dereference it?", callee);
- return;
- }
-
- if (POINTER_TYPE_P (TREE_TYPE (dest))
- && !strop
- && comp_types (TREE_TYPE (dest), type)
- && !VOID_TYPE_P (TREE_TYPE (type)))
+ tree imag_part = TREE_IMAGPART (expr);
+ /* Conversion from complex constant with zero imaginary part,
+ perform check for conversion of real part. */
+ if ((TREE_CODE (imag_part) == REAL_CST
+ && real_zerop (imag_part))
+ || (TREE_CODE (imag_part) == INTEGER_CST
+ && integer_zerop (imag_part)))
+ /* Note: in this branch we use recursive call to unsafe_conversion_p
+ with different type of EXPR, but it is still safe, because when EXPR
+ is a constant, it's type is not used in text of generated warnings
+ (otherwise they could sound misleading). */
+ return unsafe_conversion_p (loc, type, TREE_REALPART (expr), result,
+ produce_warns);
+ /* Conversion from complex constant with non-zero imaginary part. */
+ else
{
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "pointer type %qT as the first source; expected %qT "
- "or an explicit length", callee, TREE_TYPE (dest),
- TREE_TYPE (TREE_TYPE (dest)));
- return;
+ /* Conversion to complex type.
+ Perform checks for both real and imaginary parts. */
+ if (TREE_CODE (type) == COMPLEX_TYPE)
+ {
+ /* Unfortunately, produce_warns must be false in two subsequent
+ calls of unsafe_conversion_p, because otherwise we could
+ produce strange "double" warnings, if both real and imaginary
+ parts have conversion problems related to signedness.
+
+ For example:
+ int32_t _Complex a = 0x80000000 + 0x80000000i;
+
+ Possible solution: add a separate function for checking
+ constants and combine result of two calls appropriately. */
+ enum conversion_safety re_safety =
+ unsafe_conversion_p (loc, type, TREE_REALPART (expr),
+ result, false);
+ enum conversion_safety im_safety =
+ unsafe_conversion_p (loc, type, imag_part, result, false);
+
+ /* Merge the results into appropriate single warning. */
+
+ /* Note: this case includes SAFE_CONVERSION, i.e. success. */
+ if (re_safety == im_safety)
+ give_warning = re_safety;
+ else if (!re_safety && im_safety)
+ give_warning = im_safety;
+ else if (re_safety && !im_safety)
+ give_warning = re_safety;
+ else
+ give_warning = UNSAFE_OTHER;
+ }
+ /* Warn about conversion from complex to real or integer type. */
+ else
+ give_warning = UNSAFE_IMAGINARY;
}
}
- if (src)
+ /* Checks for remaining case: EXPR is not constant. */
+ else
{
- if (!TYPE_P (sizeof_arg[idx])
- && operand_equal_p (src, sizeof_arg[idx], 0)
- && comp_types (TREE_TYPE (src), type))
- {
- if (TREE_CODE (sizeof_arg[idx]) == ADDR_EXPR && !strop)
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "expression as the second source; did you mean to "
- "remove the addressof?", callee);
- else if ((TYPE_PRECISION (TREE_TYPE (type))
- == TYPE_PRECISION (char_type_node))
- || strop)
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "expression as the second source; did you mean to "
- "provide an explicit length?", callee);
- else
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "expression as the second source; did you mean to "
- "dereference it?", callee);
- return;
- }
+ /* Warn for real types converted to integer types. */
+ if (TREE_CODE (expr_type) == REAL_TYPE
+ && TREE_CODE (type) == INTEGER_TYPE)
+ give_warning = UNSAFE_REAL;
- if (POINTER_TYPE_P (TREE_TYPE (src))
- && !strop
- && comp_types (TREE_TYPE (src), type)
- && !VOID_TYPE_P (TREE_TYPE (type)))
+ else if (TREE_CODE (expr_type) == INTEGER_TYPE
+ && TREE_CODE (type) == INTEGER_TYPE)
{
- warning_at (loc, OPT_Wsizeof_pointer_memaccess,
- "argument to %<sizeof%> in %qD call is the same "
- "pointer type %qT as the second source; expected %qT "
- "or an explicit length", callee, TREE_TYPE (src),
- TREE_TYPE (TREE_TYPE (src)));
- return;
- }
- }
+ /* Don't warn about unsigned char y = 0xff, x = (int) y; */
+ expr = get_unwidened (expr, 0);
+ expr_type = TREE_TYPE (expr);
-}
+ /* Don't warn for short y; short x = ((int)y & 0xff); */
+ if (TREE_CODE (expr) == BIT_AND_EXPR
+ || TREE_CODE (expr) == BIT_IOR_EXPR
+ || TREE_CODE (expr) == BIT_XOR_EXPR)
+ {
+ /* If both args were extended from a shortest type,
+ use that type if that is safe. */
+ expr_type = shorten_binary_op (expr_type,
+ TREE_OPERAND (expr, 0),
+ TREE_OPERAND (expr, 1),
+ /* bitwise */1);
-/* Warn for unlikely, improbable, or stupid DECL declarations
- of `main'. */
+ if (TREE_CODE (expr) == BIT_AND_EXPR)
+ {
+ tree op0 = TREE_OPERAND (expr, 0);
+ tree op1 = TREE_OPERAND (expr, 1);
+ bool unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
+ bool unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
-void
-check_main_parameter_types (tree decl)
-{
- function_args_iterator iter;
- tree type;
- int argct = 0;
+ /* If one of the operands is a non-negative constant
+ that fits in the target type, then the type of the
+ other operand does not matter. */
+ if ((TREE_CODE (op0) == INTEGER_CST
+ && int_fits_type_p (op0, c_common_signed_type (type))
+ && int_fits_type_p (op0, c_common_unsigned_type (type)))
+ || (TREE_CODE (op1) == INTEGER_CST
+ && int_fits_type_p (op1, c_common_signed_type (type))
+ && int_fits_type_p (op1,
+ c_common_unsigned_type (type))))
+ return SAFE_CONVERSION;
+ /* If constant is unsigned and fits in the target
+ type, then the result will also fit. */
+ else if ((TREE_CODE (op0) == INTEGER_CST
+ && unsigned0
+ && int_fits_type_p (op0, type))
+ || (TREE_CODE (op1) == INTEGER_CST
+ && unsigned1
+ && int_fits_type_p (op1, type)))
+ return SAFE_CONVERSION;
+ }
+ }
+ /* Warn for integer types converted to smaller integer types. */
+ if (TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
+ give_warning = UNSAFE_OTHER;
- FOREACH_FUNCTION_ARGS (TREE_TYPE (decl), type, iter)
- {
- /* XXX void_type_node belies the abstraction. */
- if (type == void_type_node || type == error_mark_node )
- break;
+ /* When they are the same width but different signedness,
+ then the value may change. */
+ else if (((TYPE_PRECISION (type) == TYPE_PRECISION (expr_type)
+ && TYPE_UNSIGNED (expr_type) != TYPE_UNSIGNED (type))
+ /* Even when converted to a bigger type, if the type is
+ unsigned but expr is signed, then negative values
+ will be changed. */
+ || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)))
+ && produce_warns)
+ warning_at (loc, OPT_Wsign_conversion, "conversion to %qT from %qT "
+ "may change the sign of the result",
+ type, expr_type);
+ }
- tree t = type;
- if (TYPE_ATOMIC (t))
- pedwarn (input_location, OPT_Wmain,
- "%<_Atomic%>-qualified parameter type %qT of %q+D",
- type, decl);
- while (POINTER_TYPE_P (t))
+ /* Warn for integer types converted to real types if and only if
+ all the range of values of the integer type cannot be
+ represented by the real type. */
+ else if (TREE_CODE (expr_type) == INTEGER_TYPE
+ && TREE_CODE (type) == REAL_TYPE)
{
- t = TREE_TYPE (t);
- if (TYPE_ATOMIC (t))
- pedwarn (input_location, OPT_Wmain,
- "%<_Atomic%>-qualified parameter type %qT of %q+D",
- type, decl);
+ /* Don't warn about char y = 0xff; float x = (int) y; */
+ expr = get_unwidened (expr, 0);
+ expr_type = TREE_TYPE (expr);
+
+ if (!int_safely_convertible_to_real_p (expr_type, type))
+ give_warning = UNSAFE_OTHER;
}
- ++argct;
- switch (argct)
+ /* Warn for real types converted to smaller real types. */
+ else if (TREE_CODE (expr_type) == REAL_TYPE
+ && TREE_CODE (type) == REAL_TYPE
+ && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
+ give_warning = UNSAFE_REAL;
+
+ /* Check conversion between two complex types. */
+ else if (TREE_CODE (expr_type) == COMPLEX_TYPE
+ && TREE_CODE (type) == COMPLEX_TYPE)
{
- case 1:
- if (TYPE_MAIN_VARIANT (type) != integer_type_node)
- pedwarn (input_location, OPT_Wmain,
- "first argument of %q+D should be %<int%>", decl);
- break;
+ /* Extract underlying types (i.e., type of real and imaginary
+ parts) of expr_type and type. */
+ tree from_type = TREE_TYPE (expr_type);
+ tree to_type = TREE_TYPE (type);
- case 2:
- if (TREE_CODE (type) != POINTER_TYPE
- || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
- || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
- != char_type_node))
- pedwarn (input_location, OPT_Wmain,
- "second argument of %q+D should be %<char **%>", decl);
- break;
+ /* Warn for real types converted to integer types. */
+ if (TREE_CODE (from_type) == REAL_TYPE
+ && TREE_CODE (to_type) == INTEGER_TYPE)
+ give_warning = UNSAFE_REAL;
- case 3:
- if (TREE_CODE (type) != POINTER_TYPE
- || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
- || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
- != char_type_node))
- pedwarn (input_location, OPT_Wmain,
- "third argument of %q+D should probably be "
- "%<char **%>", decl);
- break;
+ /* Warn for real types converted to smaller real types. */
+ else if (TREE_CODE (from_type) == REAL_TYPE
+ && TREE_CODE (to_type) == REAL_TYPE
+ && TYPE_PRECISION (to_type) < TYPE_PRECISION (from_type))
+ give_warning = UNSAFE_REAL;
+
+ /* Check conversion for complex integer types. Here implementation
+ is simpler than for real-domain integers because it does not
+ involve sophisticated cases, such as bitmasks, casts, etc. */
+ else if (TREE_CODE (from_type) == INTEGER_TYPE
+ && TREE_CODE (to_type) == INTEGER_TYPE)
+ {
+ /* Warn for integer types converted to smaller integer types. */
+ if (TYPE_PRECISION (to_type) < TYPE_PRECISION (from_type))
+ give_warning = UNSAFE_OTHER;
+
+ /* Check for different signedness, see case for real-domain
+ integers (above) for a more detailed comment. */
+ else if (((TYPE_PRECISION (to_type) == TYPE_PRECISION (from_type)
+ && TYPE_UNSIGNED (to_type) != TYPE_UNSIGNED (from_type))
+ || (TYPE_UNSIGNED (to_type) && !TYPE_UNSIGNED (from_type)))
+ && produce_warns)
+ warning_at (loc, OPT_Wsign_conversion,
+ "conversion to %qT from %qT "
+ "may change the sign of the result",
+ type, expr_type);
+ }
+ else if (TREE_CODE (from_type) == INTEGER_TYPE
+ && TREE_CODE (to_type) == REAL_TYPE
+ && !int_safely_convertible_to_real_p (from_type, to_type))
+ give_warning = UNSAFE_OTHER;
}
- }
- /* It is intentional that this message does not mention the third
- argument because it's only mentioned in an appendix of the
- standard. */
- if (argct > 0 && (argct < 2 || argct > 3))
- pedwarn (input_location, OPT_Wmain,
- "%q+D takes only zero or two arguments", decl);
+ /* Warn for complex types converted to real or integer types. */
+ else if (TREE_CODE (expr_type) == COMPLEX_TYPE
+ && TREE_CODE (type) != COMPLEX_TYPE)
+ give_warning = UNSAFE_IMAGINARY;
+ }
- if (stdarg_p (TREE_TYPE (decl)))
- pedwarn (input_location, OPT_Wmain,
- "%q+D declared as variadic function", decl);
+ return give_warning;
}
-/* vector_targets_convertible_p is used for vector pointer types. The
- callers perform various checks that the qualifiers are satisfactory,
- while OTOH vector_targets_convertible_p ignores the number of elements
- in the vectors. That's fine with vector pointers as we can consider,
- say, a vector of 8 elements as two consecutive vectors of 4 elements,
- and that does not require and conversion of the pointer values.
- In contrast, vector_types_convertible_p and
- vector_types_compatible_elements_p are used for vector value types. */
-/* True if pointers to distinct types T1 and T2 can be converted to
- each other without an explicit cast. Only returns true for opaque
- vector types. */
-bool
-vector_targets_convertible_p (const_tree t1, const_tree t2)
-{
- if (VECTOR_TYPE_P (t1) && VECTOR_TYPE_P (t2)
- && (TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2))
- && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
- return true;
- return false;
-}
+/* Convert EXPR to TYPE, warning about conversion problems with constants.
+ Invoke this function on every expression that is converted implicitly,
+ i.e. because of language rules and not because of an explicit cast. */
-/* vector_types_convertible_p is used for vector value types.
- It could in principle call vector_targets_convertible_p as a subroutine,
- but then the check for vector type would be duplicated with its callers,
- and also the purpose of vector_targets_convertible_p would become
- muddled.
- Where vector_types_convertible_p returns true, a conversion might still be
- needed to make the types match.
- In contrast, vector_targets_convertible_p is used for vector pointer
- values, and vector_types_compatible_elements_p is used specifically
- in the context for binary operators, as a check if use is possible without
- conversion. */
-/* True if vector types T1 and T2 can be converted to each other
- without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
- can only be converted with -flax-vector-conversions yet that is not
- in effect, emit a note telling the user about that option if such
- a note has not previously been emitted. */
-bool
-vector_types_convertible_p (const_tree t1, const_tree t2, bool emit_lax_note)
+tree
+convert_and_check (location_t loc, tree type, tree expr)
{
- static bool emitted_lax_note = false;
- bool convertible_lax;
+ tree result;
+ tree expr_for_warning;
- if ((TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2))
- && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
- return true;
+ /* Convert from a value with possible excess precision rather than
+ via the semantic type, but do not warn about values not fitting
+ exactly in the semantic type. */
+ if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
+ {
+ tree orig_type = TREE_TYPE (expr);
+ expr = TREE_OPERAND (expr, 0);
+ expr_for_warning = convert (orig_type, expr);
+ if (orig_type == type)
+ return expr_for_warning;
+ }
+ else
+ expr_for_warning = expr;
- convertible_lax =
- (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
- && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE ||
- TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2))
- && (INTEGRAL_TYPE_P (TREE_TYPE (t1))
- == INTEGRAL_TYPE_P (TREE_TYPE (t2))));
+ if (TREE_TYPE (expr) == type)
+ return expr;
- if (!convertible_lax || flag_lax_vector_conversions)
- return convertible_lax;
-
- if (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
- && lang_hooks.types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2)))
- return true;
+ result = convert (type, expr);
- if (emit_lax_note && !emitted_lax_note)
- {
- emitted_lax_note = true;
- inform (input_location, "use -flax-vector-conversions to permit "
- "conversions between vectors with differing "
- "element types or numbers of subparts");
- }
+ if (c_inhibit_evaluation_warnings == 0
+ && !TREE_OVERFLOW_P (expr)
+ && result != error_mark_node)
+ warnings_for_convert_and_check (loc, type, expr_for_warning, result);
- return false;
+ return result;
}
+\f
+/* A node in a list that describes references to variables (EXPR), which are
+ either read accesses if WRITER is zero, or write accesses, in which case
+ WRITER is the parent of EXPR. */
+struct tlist
+{
+ struct tlist *next;
+ tree expr, writer;
+};
-/* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
- and have vector types, V0 has the same type as V1, and the number of
- elements of V0, V1, MASK is the same.
-
- In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
- called with two arguments. In this case implementation passes the
- first argument twice in order to share the same tree code. This fact
- could enable the mask-values being twice the vector length. This is
- an implementation accident and this semantics is not guaranteed to
- the user. */
-tree
-c_build_vec_perm_expr (location_t loc, tree v0, tree v1, tree mask,
- bool complain)
+/* Used to implement a cache the results of a call to verify_tree. We only
+ use this for SAVE_EXPRs. */
+struct tlist_cache
{
- tree ret;
- bool wrap = true;
- bool maybe_const = false;
- bool two_arguments = false;
+ struct tlist_cache *next;
+ struct tlist *cache_before_sp;
+ struct tlist *cache_after_sp;
+ tree expr;
+};
- if (v1 == NULL_TREE)
- {
- two_arguments = true;
- v1 = v0;
- }
+/* Obstack to use when allocating tlist structures, and corresponding
+ firstobj. */
+static struct obstack tlist_obstack;
+static char *tlist_firstobj = 0;
- if (v0 == error_mark_node || v1 == error_mark_node
- || mask == error_mark_node)
- return error_mark_node;
+/* Keep track of the identifiers we've warned about, so we can avoid duplicate
+ warnings. */
+static struct tlist *warned_ids;
+/* SAVE_EXPRs need special treatment. We process them only once and then
+ cache the results. */
+static struct tlist_cache *save_expr_cache;
- if (!VECTOR_INTEGER_TYPE_P (TREE_TYPE (mask)))
- {
- if (complain)
- error_at (loc, "__builtin_shuffle last argument must "
- "be an integer vector");
- return error_mark_node;
- }
+static void add_tlist (struct tlist **, struct tlist *, tree, int);
+static void merge_tlist (struct tlist **, struct tlist *, int);
+static void verify_tree (tree, struct tlist **, struct tlist **, tree);
+static bool warning_candidate_p (tree);
+static bool candidate_equal_p (const_tree, const_tree);
+static void warn_for_collisions (struct tlist *);
+static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
+static struct tlist *new_tlist (struct tlist *, tree, tree);
- if (!VECTOR_TYPE_P (TREE_TYPE (v0))
- || !VECTOR_TYPE_P (TREE_TYPE (v1)))
- {
- if (complain)
- error_at (loc, "__builtin_shuffle arguments must be vectors");
- return error_mark_node;
- }
+/* Create a new struct tlist and fill in its fields. */
+static struct tlist *
+new_tlist (struct tlist *next, tree t, tree writer)
+{
+ struct tlist *l;
+ l = XOBNEW (&tlist_obstack, struct tlist);
+ l->next = next;
+ l->expr = t;
+ l->writer = writer;
+ return l;
+}
- if (TYPE_MAIN_VARIANT (TREE_TYPE (v0)) != TYPE_MAIN_VARIANT (TREE_TYPE (v1)))
- {
- if (complain)
- error_at (loc, "__builtin_shuffle argument vectors must be of "
- "the same type");
- return error_mark_node;
- }
+/* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
+ is nonnull, we ignore any node we find which has a writer equal to it. */
- if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (v0))
- != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask))
- && TYPE_VECTOR_SUBPARTS (TREE_TYPE (v1))
- != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask)))
+static void
+add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
+{
+ while (add)
{
- if (complain)
- error_at (loc, "__builtin_shuffle number of elements of the "
- "argument vector(s) and the mask vector should "
- "be the same");
- return error_mark_node;
+ struct tlist *next = add->next;
+ if (!copy)
+ add->next = *to;
+ if (!exclude_writer || !candidate_equal_p (add->writer, exclude_writer))
+ *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
+ add = next;
}
+}
- if (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (v0))))
- != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (mask)))))
- {
- if (complain)
- error_at (loc, "__builtin_shuffle argument vector(s) inner type "
- "must have the same size as inner type of the mask");
- return error_mark_node;
- }
+/* Merge the nodes of ADD into TO. This merging process is done so that for
+ each variable that already exists in TO, no new node is added; however if
+ there is a write access recorded in ADD, and an occurrence on TO is only
+ a read access, then the occurrence in TO will be modified to record the
+ write. */
- if (!c_dialect_cxx ())
- {
- /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
- v0 = c_fully_fold (v0, false, &maybe_const);
- wrap &= maybe_const;
+static void
+merge_tlist (struct tlist **to, struct tlist *add, int copy)
+{
+ struct tlist **end = to;
- if (two_arguments)
- v1 = v0 = save_expr (v0);
- else
- {
- v1 = c_fully_fold (v1, false, &maybe_const);
- wrap &= maybe_const;
- }
+ while (*end)
+ end = &(*end)->next;
- mask = c_fully_fold (mask, false, &maybe_const);
- wrap &= maybe_const;
+ while (add)
+ {
+ int found = 0;
+ struct tlist *tmp2;
+ struct tlist *next = add->next;
+
+ for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
+ if (candidate_equal_p (tmp2->expr, add->expr))
+ {
+ found = 1;
+ if (!tmp2->writer)
+ tmp2->writer = add->writer;
+ }
+ if (!found)
+ {
+ *end = copy ? new_tlist (NULL, add->expr, add->writer) : add;
+ end = &(*end)->next;
+ *end = 0;
+ }
+ add = next;
}
- else if (two_arguments)
- v1 = v0 = save_expr (v0);
+}
- ret = build3_loc (loc, VEC_PERM_EXPR, TREE_TYPE (v0), v0, v1, mask);
+/* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
+ references in list LIST conflict with it, excluding reads if ONLY writers
+ is nonzero. */
- if (!c_dialect_cxx () && !wrap)
- ret = c_wrap_maybe_const (ret, true);
+static void
+warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
+ int only_writes)
+{
+ struct tlist *tmp;
- return ret;
+ /* Avoid duplicate warnings. */
+ for (tmp = warned_ids; tmp; tmp = tmp->next)
+ if (candidate_equal_p (tmp->expr, written))
+ return;
+
+ while (list)
+ {
+ if (candidate_equal_p (list->expr, written)
+ && !candidate_equal_p (list->writer, writer)
+ && (!only_writes || list->writer))
+ {
+ warned_ids = new_tlist (warned_ids, written, NULL_TREE);
+ warning_at (EXPR_LOC_OR_LOC (writer, input_location),
+ OPT_Wsequence_point, "operation on %qE may be undefined",
+ list->expr);
+ }
+ list = list->next;
+ }
}
-/* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
- to integral type. */
+/* Given a list LIST of references to variables, find whether any of these
+ can cause conflicts due to missing sequence points. */
-static tree
-c_common_get_narrower (tree op, int *unsignedp_ptr)
+static void
+warn_for_collisions (struct tlist *list)
{
- op = get_narrower (op, unsignedp_ptr);
+ struct tlist *tmp;
- if (TREE_CODE (TREE_TYPE (op)) == ENUMERAL_TYPE
- && ENUM_IS_SCOPED (TREE_TYPE (op)))
+ for (tmp = list; tmp; tmp = tmp->next)
{
- /* C++0x scoped enumerations don't implicitly convert to integral
- type; if we stripped an explicit conversion to a larger type we
- need to replace it so common_type will still work. */
- tree type = c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op)),
- TYPE_UNSIGNED (TREE_TYPE (op)));
- op = fold_convert (type, op);
+ if (tmp->writer)
+ warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
}
- return op;
}
-/* This is a helper function of build_binary_op.
-
- For certain operations if both args were extended from the same
- smaller type, do the arithmetic in that type and then extend.
+/* Return nonzero if X is a tree that can be verified by the sequence point
+ warnings. */
- BITWISE indicates a bitwise operation.
- For them, this optimization is safe only if
- both args are zero-extended or both are sign-extended.
- Otherwise, we might change the result.
- Eg, (short)-1 | (unsigned short)-1 is (int)-1
- but calculated in (unsigned short) it would be (unsigned short)-1.
-*/
-tree
-shorten_binary_op (tree result_type, tree op0, tree op1, bool bitwise)
+static bool
+warning_candidate_p (tree x)
{
- int unsigned0, unsigned1;
- tree arg0, arg1;
- int uns;
- tree type;
-
- /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
- excessive narrowing when we call get_narrower below. For
- example, suppose that OP0 is of unsigned int extended
- from signed char and that RESULT_TYPE is long long int.
- If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
- like
-
- (long long int) (unsigned int) signed_char
+ if (DECL_P (x) && DECL_ARTIFICIAL (x))
+ return false;
- which get_narrower would narrow down to
+ if (TREE_CODE (x) == BLOCK)
+ return false;
- (unsigned int) signed char
+ /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
+ (lvalue_p) crash on TRY/CATCH. */
+ if (TREE_TYPE (x) == NULL_TREE || VOID_TYPE_P (TREE_TYPE (x)))
+ return false;
- If we do not cast OP0 first, get_narrower would return
- signed_char, which is inconsistent with the case of the
- explicit cast. */
- op0 = convert (result_type, op0);
- op1 = convert (result_type, op1);
+ if (!lvalue_p (x))
+ return false;
- arg0 = c_common_get_narrower (op0, &unsigned0);
- arg1 = c_common_get_narrower (op1, &unsigned1);
+ /* No point to track non-const calls, they will never satisfy
+ operand_equal_p. */
+ if (TREE_CODE (x) == CALL_EXPR && (call_expr_flags (x) & ECF_CONST) == 0)
+ return false;
- /* UNS is 1 if the operation to be done is an unsigned one. */
- uns = TYPE_UNSIGNED (result_type);
+ if (TREE_CODE (x) == STRING_CST)
+ return false;
- /* Handle the case that OP0 (or OP1) does not *contain* a conversion
- but it *requires* conversion to FINAL_TYPE. */
+ return true;
+}
- if ((TYPE_PRECISION (TREE_TYPE (op0))
- == TYPE_PRECISION (TREE_TYPE (arg0)))
- && TREE_TYPE (op0) != result_type)
- unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
- if ((TYPE_PRECISION (TREE_TYPE (op1))
- == TYPE_PRECISION (TREE_TYPE (arg1)))
- && TREE_TYPE (op1) != result_type)
- unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
+/* Return nonzero if X and Y appear to be the same candidate (or NULL) */
+static bool
+candidate_equal_p (const_tree x, const_tree y)
+{
+ return (x == y) || (x && y && operand_equal_p (x, y, 0));
+}
- /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
+/* Walk the tree X, and record accesses to variables. If X is written by the
+ parent tree, WRITER is the parent.
+ We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
+ expression or its only operand forces a sequence point, then everything up
+ to the sequence point is stored in PBEFORE_SP. Everything else gets stored
+ in PNO_SP.
+ Once we return, we will have emitted warnings if any subexpression before
+ such a sequence point could be undefined. On a higher level, however, the
+ sequence point may not be relevant, and we'll merge the two lists.
- /* For bitwise operations, signedness of nominal type
- does not matter. Consider only how operands were extended. */
- if (bitwise)
- uns = unsigned0;
+ Example: (b++, a) + b;
+ The call that processes the COMPOUND_EXPR will store the increment of B
+ in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
+ processes the PLUS_EXPR will need to merge the two lists so that
+ eventually, all accesses end up on the same list (and we'll warn about the
+ unordered subexpressions b++ and b.
- /* Note that in all three cases below we refrain from optimizing
- an unsigned operation on sign-extended args.
- That would not be valid. */
+ A note on merging. If we modify the former example so that our expression
+ becomes
+ (b++, b) + a
+ care must be taken not simply to add all three expressions into the final
+ PNO_SP list. The function merge_tlist takes care of that by merging the
+ before-SP list of the COMPOUND_EXPR into its after-SP list in a special
+ way, so that no more than one access to B is recorded. */
- /* Both args variable: if both extended in same way
- from same width, do it in that width.
- Do it unsigned if args were zero-extended. */
- if ((TYPE_PRECISION (TREE_TYPE (arg0))
- < TYPE_PRECISION (result_type))
- && (TYPE_PRECISION (TREE_TYPE (arg1))
- == TYPE_PRECISION (TREE_TYPE (arg0)))
- && unsigned0 == unsigned1
- && (unsigned0 || !uns))
- return c_common_signed_or_unsigned_type
- (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
+static void
+verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
+ tree writer)
+{
+ struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
+ enum tree_code code;
+ enum tree_code_class cl;
- else if (TREE_CODE (arg0) == INTEGER_CST
- && (unsigned1 || !uns)
- && (TYPE_PRECISION (TREE_TYPE (arg1))
- < TYPE_PRECISION (result_type))
- && (type
- = c_common_signed_or_unsigned_type (unsigned1,
- TREE_TYPE (arg1)))
- && !POINTER_TYPE_P (type)
- && int_fits_type_p (arg0, type))
- return type;
+ /* X may be NULL if it is the operand of an empty statement expression
+ ({ }). */
+ if (x == NULL)
+ return;
- else if (TREE_CODE (arg1) == INTEGER_CST
- && (unsigned0 || !uns)
- && (TYPE_PRECISION (TREE_TYPE (arg0))
- < TYPE_PRECISION (result_type))
- && (type
- = c_common_signed_or_unsigned_type (unsigned0,
- TREE_TYPE (arg0)))
- && !POINTER_TYPE_P (type)
- && int_fits_type_p (arg1, type))
- return type;
+ restart:
+ code = TREE_CODE (x);
+ cl = TREE_CODE_CLASS (code);
- return result_type;
-}
+ if (warning_candidate_p (x))
+ *pno_sp = new_tlist (*pno_sp, x, writer);
-/* Returns true iff any integer value of type FROM_TYPE can be represented as
- real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
+ switch (code)
+ {
+ case CONSTRUCTOR:
+ case SIZEOF_EXPR:
+ return;
-static bool
-int_safely_convertible_to_real_p (const_tree from_type, const_tree to_type)
-{
- tree type_low_bound = TYPE_MIN_VALUE (from_type);
- tree type_high_bound = TYPE_MAX_VALUE (from_type);
- REAL_VALUE_TYPE real_low_bound =
- real_value_from_int_cst (0, type_low_bound);
- REAL_VALUE_TYPE real_high_bound =
- real_value_from_int_cst (0, type_high_bound);
+ case COMPOUND_EXPR:
+ case TRUTH_ANDIF_EXPR:
+ case TRUTH_ORIF_EXPR:
+ tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
+ verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
+ warn_for_collisions (tmp_nosp);
+ merge_tlist (pbefore_sp, tmp_before, 0);
+ merge_tlist (pbefore_sp, tmp_nosp, 0);
+ verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_list2, NULL_TREE);
+ warn_for_collisions (tmp_list2);
+ merge_tlist (pbefore_sp, tmp_list3, 0);
+ merge_tlist (pno_sp, tmp_list2, 0);
+ return;
- return exact_real_truncate (TYPE_MODE (to_type), &real_low_bound)
- && exact_real_truncate (TYPE_MODE (to_type), &real_high_bound);
-}
+ case COND_EXPR:
+ tmp_before = tmp_list2 = 0;
+ verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
+ warn_for_collisions (tmp_list2);
+ merge_tlist (pbefore_sp, tmp_before, 0);
+ merge_tlist (pbefore_sp, tmp_list2, 0);
-/* Checks if expression EXPR of complex/real/integer type cannot be converted
- to the complex/real/integer type TYPE. Function returns non-zero when:
- * EXPR is a constant which cannot be exactly converted to TYPE.
- * EXPR is not a constant and size of EXPR's type > than size of TYPE,
- for EXPR type and TYPE being both integers or both real, or both
- complex.
- * EXPR is not a constant of complex type and TYPE is a real or
- an integer.
- * EXPR is not a constant of real type and TYPE is an integer.
- * EXPR is not a constant of integer type which cannot be
- exactly converted to real type.
+ tmp_list3 = tmp_nosp = 0;
+ verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
+ warn_for_collisions (tmp_nosp);
+ merge_tlist (pbefore_sp, tmp_list3, 0);
- Function allows conversions between types of different signedness and
- can return SAFE_CONVERSION (zero) in that case. Function can produce
- signedness warnings if PRODUCE_WARNS is true.
+ tmp_list3 = tmp_list2 = 0;
+ verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
+ warn_for_collisions (tmp_list2);
+ merge_tlist (pbefore_sp, tmp_list3, 0);
+ /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
+ two first, to avoid warning for (a ? b++ : b++). */
+ merge_tlist (&tmp_nosp, tmp_list2, 0);
+ add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
+ return;
- Function allows conversions from complex constants to non-complex types,
- provided that imaginary part is zero and real part can be safely converted
- to TYPE. */
+ case PREDECREMENT_EXPR:
+ case PREINCREMENT_EXPR:
+ case POSTDECREMENT_EXPR:
+ case POSTINCREMENT_EXPR:
+ verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
+ return;
-enum conversion_safety
-unsafe_conversion_p (location_t loc, tree type, tree expr, bool produce_warns)
-{
- enum conversion_safety give_warning = SAFE_CONVERSION; /* is 0 or false */
- tree expr_type = TREE_TYPE (expr);
- loc = expansion_point_location_if_in_system_header (loc);
+ case MODIFY_EXPR:
+ tmp_before = tmp_nosp = tmp_list3 = 0;
+ verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
+ verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
+ /* Expressions inside the LHS are not ordered wrt. the sequence points
+ in the RHS. Example:
+ *a = (a++, 2)
+ Despite the fact that the modification of "a" is in the before_sp
+ list (tmp_before), it conflicts with the use of "a" in the LHS.
+ We can handle this by adding the contents of tmp_list3
+ to those of tmp_before, and redoing the collision warnings for that
+ list. */
+ add_tlist (&tmp_before, tmp_list3, x, 1);
+ warn_for_collisions (tmp_before);
+ /* Exclude the LHS itself here; we first have to merge it into the
+ tmp_nosp list. This is done to avoid warning for "a = a"; if we
+ didn't exclude the LHS, we'd get it twice, once as a read and once
+ as a write. */
+ add_tlist (pno_sp, tmp_list3, x, 0);
+ warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
- if (TREE_CODE (expr) == REAL_CST || TREE_CODE (expr) == INTEGER_CST)
- {
- /* If type is complex, we are interested in compatibility with
- underlying type. */
- if (TREE_CODE (type) == COMPLEX_TYPE)
- type = TREE_TYPE (type);
+ merge_tlist (pbefore_sp, tmp_before, 0);
+ if (warning_candidate_p (TREE_OPERAND (x, 0)))
+ merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
+ add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
+ return;
- /* Warn for real constant that is not an exact integer converted
- to integer type. */
- if (TREE_CODE (expr_type) == REAL_TYPE
- && TREE_CODE (type) == INTEGER_TYPE)
- {
- if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (expr_type)))
- give_warning = UNSAFE_REAL;
- }
- /* Warn for an integer constant that does not fit into integer type. */
- else if (TREE_CODE (expr_type) == INTEGER_TYPE
- && TREE_CODE (type) == INTEGER_TYPE
- && !int_fits_type_p (expr, type))
- {
- if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)
- && tree_int_cst_sgn (expr) < 0)
- {
- if (produce_warns)
- warning_at (loc, OPT_Wsign_conversion, "negative integer"
- " implicitly converted to unsigned type");
- }
- else if (!TYPE_UNSIGNED (type) && TYPE_UNSIGNED (expr_type))
- {
- if (produce_warns)
- warning_at (loc, OPT_Wsign_conversion, "conversion of unsigned"
- " constant value to negative integer");
- }
- else
- give_warning = UNSAFE_OTHER;
- }
- else if (TREE_CODE (type) == REAL_TYPE)
- {
- /* Warn for an integer constant that does not fit into real type. */
- if (TREE_CODE (expr_type) == INTEGER_TYPE)
- {
- REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr);
- if (!exact_real_truncate (TYPE_MODE (type), &a))
- give_warning = UNSAFE_REAL;
- }
- /* Warn for a real constant that does not fit into a smaller
- real type. */
- else if (TREE_CODE (expr_type) == REAL_TYPE
- && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
- {
- REAL_VALUE_TYPE a = TREE_REAL_CST (expr);
- if (!exact_real_truncate (TYPE_MODE (type), &a))
- give_warning = UNSAFE_REAL;
- }
- }
- }
-
- else if (TREE_CODE (expr) == COMPLEX_CST)
- {
- tree imag_part = TREE_IMAGPART (expr);
- /* Conversion from complex constant with zero imaginary part,
- perform check for conversion of real part. */
- if ((TREE_CODE (imag_part) == REAL_CST
- && real_zerop (imag_part))
- || (TREE_CODE (imag_part) == INTEGER_CST
- && integer_zerop (imag_part)))
- /* Note: in this branch we use recursive call to unsafe_conversion_p
- with different type of EXPR, but it is still safe, because when EXPR
- is a constant, it's type is not used in text of generated warnings
- (otherwise they could sound misleading). */
- return unsafe_conversion_p (loc, type, TREE_REALPART (expr),
- produce_warns);
- /* Conversion from complex constant with non-zero imaginary part. */
- else
- {
- /* Conversion to complex type.
- Perform checks for both real and imaginary parts. */
- if (TREE_CODE (type) == COMPLEX_TYPE)
- {
- /* Unfortunately, produce_warns must be false in two subsequent
- calls of unsafe_conversion_p, because otherwise we could
- produce strange "double" warnings, if both real and imaginary
- parts have conversion problems related to signedness.
-
- For example:
- int32_t _Complex a = 0x80000000 + 0x80000000i;
-
- Possible solution: add a separate function for checking
- constants and combine result of two calls appropriately. */
- enum conversion_safety re_safety =
- unsafe_conversion_p (loc, type, TREE_REALPART (expr), false);
- enum conversion_safety im_safety =
- unsafe_conversion_p (loc, type, imag_part, false);
-
- /* Merge the results into appropriate single warning. */
-
- /* Note: this case includes SAFE_CONVERSION, i.e. success. */
- if (re_safety == im_safety)
- give_warning = re_safety;
- else if (!re_safety && im_safety)
- give_warning = im_safety;
- else if (re_safety && !im_safety)
- give_warning = re_safety;
- else
- give_warning = UNSAFE_OTHER;
- }
- /* Warn about conversion from complex to real or integer type. */
- else
- give_warning = UNSAFE_IMAGINARY;
- }
- }
-
- /* Checks for remaining case: EXPR is not constant. */
- else
- {
- /* Warn for real types converted to integer types. */
- if (TREE_CODE (expr_type) == REAL_TYPE
- && TREE_CODE (type) == INTEGER_TYPE)
- give_warning = UNSAFE_REAL;
-
- else if (TREE_CODE (expr_type) == INTEGER_TYPE
- && TREE_CODE (type) == INTEGER_TYPE)
- {
- /* Don't warn about unsigned char y = 0xff, x = (int) y; */
- expr = get_unwidened (expr, 0);
- expr_type = TREE_TYPE (expr);
-
- /* Don't warn for short y; short x = ((int)y & 0xff); */
- if (TREE_CODE (expr) == BIT_AND_EXPR
- || TREE_CODE (expr) == BIT_IOR_EXPR
- || TREE_CODE (expr) == BIT_XOR_EXPR)
- {
- /* If both args were extended from a shortest type,
- use that type if that is safe. */
- expr_type = shorten_binary_op (expr_type,
- TREE_OPERAND (expr, 0),
- TREE_OPERAND (expr, 1),
- /* bitwise */1);
-
- if (TREE_CODE (expr) == BIT_AND_EXPR)
- {
- tree op0 = TREE_OPERAND (expr, 0);
- tree op1 = TREE_OPERAND (expr, 1);
- bool unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
- bool unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
-
- /* If one of the operands is a non-negative constant
- that fits in the target type, then the type of the
- other operand does not matter. */
- if ((TREE_CODE (op0) == INTEGER_CST
- && int_fits_type_p (op0, c_common_signed_type (type))
- && int_fits_type_p (op0, c_common_unsigned_type (type)))
- || (TREE_CODE (op1) == INTEGER_CST
- && int_fits_type_p (op1, c_common_signed_type (type))
- && int_fits_type_p (op1,
- c_common_unsigned_type (type))))
- return SAFE_CONVERSION;
- /* If constant is unsigned and fits in the target
- type, then the result will also fit. */
- else if ((TREE_CODE (op0) == INTEGER_CST
- && unsigned0
- && int_fits_type_p (op0, type))
- || (TREE_CODE (op1) == INTEGER_CST
- && unsigned1
- && int_fits_type_p (op1, type)))
- return SAFE_CONVERSION;
- }
- }
- /* Warn for integer types converted to smaller integer types. */
- if (TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
- give_warning = UNSAFE_OTHER;
-
- /* When they are the same width but different signedness,
- then the value may change. */
- else if (((TYPE_PRECISION (type) == TYPE_PRECISION (expr_type)
- && TYPE_UNSIGNED (expr_type) != TYPE_UNSIGNED (type))
- /* Even when converted to a bigger type, if the type is
- unsigned but expr is signed, then negative values
- will be changed. */
- || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)))
- && produce_warns)
- warning_at (loc, OPT_Wsign_conversion, "conversion to %qT from %qT "
- "may change the sign of the result",
- type, expr_type);
- }
-
- /* Warn for integer types converted to real types if and only if
- all the range of values of the integer type cannot be
- represented by the real type. */
- else if (TREE_CODE (expr_type) == INTEGER_TYPE
- && TREE_CODE (type) == REAL_TYPE)
- {
- /* Don't warn about char y = 0xff; float x = (int) y; */
- expr = get_unwidened (expr, 0);
- expr_type = TREE_TYPE (expr);
-
- if (!int_safely_convertible_to_real_p (expr_type, type))
- give_warning = UNSAFE_OTHER;
- }
-
- /* Warn for real types converted to smaller real types. */
- else if (TREE_CODE (expr_type) == REAL_TYPE
- && TREE_CODE (type) == REAL_TYPE
- && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
- give_warning = UNSAFE_REAL;
-
- /* Check conversion between two complex types. */
- else if (TREE_CODE (expr_type) == COMPLEX_TYPE
- && TREE_CODE (type) == COMPLEX_TYPE)
- {
- /* Extract underlying types (i.e., type of real and imaginary
- parts) of expr_type and type. */
- tree from_type = TREE_TYPE (expr_type);
- tree to_type = TREE_TYPE (type);
-
- /* Warn for real types converted to integer types. */
- if (TREE_CODE (from_type) == REAL_TYPE
- && TREE_CODE (to_type) == INTEGER_TYPE)
- give_warning = UNSAFE_REAL;
-
- /* Warn for real types converted to smaller real types. */
- else if (TREE_CODE (from_type) == REAL_TYPE
- && TREE_CODE (to_type) == REAL_TYPE
- && TYPE_PRECISION (to_type) < TYPE_PRECISION (from_type))
- give_warning = UNSAFE_REAL;
-
- /* Check conversion for complex integer types. Here implementation
- is simpler than for real-domain integers because it does not
- involve sophisticated cases, such as bitmasks, casts, etc. */
- else if (TREE_CODE (from_type) == INTEGER_TYPE
- && TREE_CODE (to_type) == INTEGER_TYPE)
- {
- /* Warn for integer types converted to smaller integer types. */
- if (TYPE_PRECISION (to_type) < TYPE_PRECISION (from_type))
- give_warning = UNSAFE_OTHER;
-
- /* Check for different signedness, see case for real-domain
- integers (above) for a more detailed comment. */
- else if (((TYPE_PRECISION (to_type) == TYPE_PRECISION (from_type)
- && TYPE_UNSIGNED (to_type) != TYPE_UNSIGNED (from_type))
- || (TYPE_UNSIGNED (to_type) && !TYPE_UNSIGNED (from_type)))
- && produce_warns)
- warning_at (loc, OPT_Wsign_conversion,
- "conversion to %qT from %qT "
- "may change the sign of the result",
- type, expr_type);
- }
- else if (TREE_CODE (from_type) == INTEGER_TYPE
- && TREE_CODE (to_type) == REAL_TYPE
- && !int_safely_convertible_to_real_p (from_type, to_type))
- give_warning = UNSAFE_OTHER;
- }
-
- /* Warn for complex types converted to real or integer types. */
- else if (TREE_CODE (expr_type) == COMPLEX_TYPE
- && TREE_CODE (type) != COMPLEX_TYPE)
- give_warning = UNSAFE_IMAGINARY;
- }
-
- return give_warning;
-}
-
-/* Warns if the conversion of EXPR to TYPE may alter a value.
- This is a helper function for warnings_for_convert_and_check. */
-
-static void
-conversion_warning (location_t loc, tree type, tree expr)
-{
- tree expr_type = TREE_TYPE (expr);
- enum conversion_safety conversion_kind;
-
- if (!warn_conversion && !warn_sign_conversion && !warn_float_conversion)
- return;
-
- /* This may happen, because for LHS op= RHS we preevaluate
- RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
- means we could no longer see the code of the EXPR. */
- if (TREE_CODE (expr) == C_MAYBE_CONST_EXPR)
- expr = C_MAYBE_CONST_EXPR_EXPR (expr);
- if (TREE_CODE (expr) == SAVE_EXPR)
- expr = TREE_OPERAND (expr, 0);
-
- switch (TREE_CODE (expr))
- {
- case EQ_EXPR:
- case NE_EXPR:
- case LE_EXPR:
- case GE_EXPR:
- case LT_EXPR:
- case GT_EXPR:
- case TRUTH_ANDIF_EXPR:
- case TRUTH_ORIF_EXPR:
- case TRUTH_AND_EXPR:
- case TRUTH_OR_EXPR:
- case TRUTH_XOR_EXPR:
- case TRUTH_NOT_EXPR:
- /* Conversion from boolean to a signed:1 bit-field (which only
- can hold the values 0 and -1) doesn't lose information - but
- it does change the value. */
- if (TYPE_PRECISION (type) == 1 && !TYPE_UNSIGNED (type))
- warning_at (loc, OPT_Wconversion,
- "conversion to %qT from boolean expression", type);
- return;
-
- case REAL_CST:
- case INTEGER_CST:
- case COMPLEX_CST:
- conversion_kind = unsafe_conversion_p (loc, type, expr, true);
- if (conversion_kind == UNSAFE_REAL)
- warning_at (loc, OPT_Wfloat_conversion,
- "conversion to %qT alters %qT constant value",
- type, expr_type);
- else if (conversion_kind)
- warning_at (loc, OPT_Wconversion,
- "conversion to %qT alters %qT constant value",
- type, expr_type);
- return;
-
- case COND_EXPR:
- {
- /* In case of COND_EXPR, we do not care about the type of
- COND_EXPR, only about the conversion of each operand. */
- tree op1 = TREE_OPERAND (expr, 1);
- tree op2 = TREE_OPERAND (expr, 2);
-
- conversion_warning (loc, type, op1);
- conversion_warning (loc, type, op2);
- return;
- }
-
- default: /* 'expr' is not a constant. */
- conversion_kind = unsafe_conversion_p (loc, type, expr, true);
- if (conversion_kind == UNSAFE_REAL)
- warning_at (loc, OPT_Wfloat_conversion,
- "conversion to %qT from %qT may alter its value",
- type, expr_type);
- else if (conversion_kind == UNSAFE_IMAGINARY)
- warning_at (loc, OPT_Wconversion,
- "conversion to %qT from %qT discards imaginary component",
- type, expr_type);
- else if (conversion_kind)
- warning_at (loc, OPT_Wconversion,
- "conversion to %qT from %qT may alter its value",
- type, expr_type);
- }
-}
-
-/* Produce warnings after a conversion. RESULT is the result of
- converting EXPR to TYPE. This is a helper function for
- convert_and_check and cp_convert_and_check. */
-
-void
-warnings_for_convert_and_check (location_t loc, tree type, tree expr,
- tree result)
-{
- loc = expansion_point_location_if_in_system_header (loc);
-
- if (TREE_CODE (expr) == INTEGER_CST
- && (TREE_CODE (type) == INTEGER_TYPE
- || TREE_CODE (type) == ENUMERAL_TYPE)
- && !int_fits_type_p (expr, type))
- {
- /* Do not diagnose overflow in a constant expression merely
- because a conversion overflowed. */
- if (TREE_OVERFLOW (result))
- TREE_OVERFLOW (result) = TREE_OVERFLOW (expr);
-
- if (TYPE_UNSIGNED (type))
- {
- /* This detects cases like converting -129 or 256 to
- unsigned char. */
- if (!int_fits_type_p (expr, c_common_signed_type (type)))
- warning_at (loc, OPT_Woverflow,
- "large integer implicitly truncated to unsigned type");
- else
- conversion_warning (loc, type, expr);
- }
- else if (!int_fits_type_p (expr, c_common_unsigned_type (type)))
- warning_at (loc, OPT_Woverflow,
- "overflow in implicit constant conversion");
- /* No warning for converting 0x80000000 to int. */
- else if (pedantic
- && (TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE
- || TYPE_PRECISION (TREE_TYPE (expr))
- != TYPE_PRECISION (type)))
- warning_at (loc, OPT_Woverflow,
- "overflow in implicit constant conversion");
-
- else
- conversion_warning (loc, type, expr);
- }
- else if ((TREE_CODE (result) == INTEGER_CST
- || TREE_CODE (result) == FIXED_CST) && TREE_OVERFLOW (result))
- warning_at (loc, OPT_Woverflow,
- "overflow in implicit constant conversion");
- else
- conversion_warning (loc, type, expr);
-}
-
-
-/* Convert EXPR to TYPE, warning about conversion problems with constants.
- Invoke this function on every expression that is converted implicitly,
- i.e. because of language rules and not because of an explicit cast. */
-
-tree
-convert_and_check (location_t loc, tree type, tree expr)
-{
- tree result;
- tree expr_for_warning;
-
- /* Convert from a value with possible excess precision rather than
- via the semantic type, but do not warn about values not fitting
- exactly in the semantic type. */
- if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
- {
- tree orig_type = TREE_TYPE (expr);
- expr = TREE_OPERAND (expr, 0);
- expr_for_warning = convert (orig_type, expr);
- if (orig_type == type)
- return expr_for_warning;
- }
- else
- expr_for_warning = expr;
-
- if (TREE_TYPE (expr) == type)
- return expr;
-
- result = convert (type, expr);
-
- if (c_inhibit_evaluation_warnings == 0
- && !TREE_OVERFLOW_P (expr)
- && result != error_mark_node)
- warnings_for_convert_and_check (loc, type, expr_for_warning, result);
-
- return result;
-}
-\f
-/* A node in a list that describes references to variables (EXPR), which are
- either read accesses if WRITER is zero, or write accesses, in which case
- WRITER is the parent of EXPR. */
-struct tlist
-{
- struct tlist *next;
- tree expr, writer;
-};
-
-/* Used to implement a cache the results of a call to verify_tree. We only
- use this for SAVE_EXPRs. */
-struct tlist_cache
-{
- struct tlist_cache *next;
- struct tlist *cache_before_sp;
- struct tlist *cache_after_sp;
- tree expr;
-};
-
-/* Obstack to use when allocating tlist structures, and corresponding
- firstobj. */
-static struct obstack tlist_obstack;
-static char *tlist_firstobj = 0;
-
-/* Keep track of the identifiers we've warned about, so we can avoid duplicate
- warnings. */
-static struct tlist *warned_ids;
-/* SAVE_EXPRs need special treatment. We process them only once and then
- cache the results. */
-static struct tlist_cache *save_expr_cache;
-
-static void add_tlist (struct tlist **, struct tlist *, tree, int);
-static void merge_tlist (struct tlist **, struct tlist *, int);
-static void verify_tree (tree, struct tlist **, struct tlist **, tree);
-static int warning_candidate_p (tree);
-static bool candidate_equal_p (const_tree, const_tree);
-static void warn_for_collisions (struct tlist *);
-static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
-static struct tlist *new_tlist (struct tlist *, tree, tree);
-
-/* Create a new struct tlist and fill in its fields. */
-static struct tlist *
-new_tlist (struct tlist *next, tree t, tree writer)
-{
- struct tlist *l;
- l = XOBNEW (&tlist_obstack, struct tlist);
- l->next = next;
- l->expr = t;
- l->writer = writer;
- return l;
-}
-
-/* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
- is nonnull, we ignore any node we find which has a writer equal to it. */
-
-static void
-add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
-{
- while (add)
- {
- struct tlist *next = add->next;
- if (!copy)
- add->next = *to;
- if (!exclude_writer || !candidate_equal_p (add->writer, exclude_writer))
- *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
- add = next;
- }
-}
-
-/* Merge the nodes of ADD into TO. This merging process is done so that for
- each variable that already exists in TO, no new node is added; however if
- there is a write access recorded in ADD, and an occurrence on TO is only
- a read access, then the occurrence in TO will be modified to record the
- write. */
-
-static void
-merge_tlist (struct tlist **to, struct tlist *add, int copy)
-{
- struct tlist **end = to;
-
- while (*end)
- end = &(*end)->next;
-
- while (add)
- {
- int found = 0;
- struct tlist *tmp2;
- struct tlist *next = add->next;
-
- for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
- if (candidate_equal_p (tmp2->expr, add->expr))
- {
- found = 1;
- if (!tmp2->writer)
- tmp2->writer = add->writer;
- }
- if (!found)
- {
- *end = copy ? new_tlist (NULL, add->expr, add->writer) : add;
- end = &(*end)->next;
- *end = 0;
- }
- add = next;
- }
-}
-
-/* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
- references in list LIST conflict with it, excluding reads if ONLY writers
- is nonzero. */
-
-static void
-warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
- int only_writes)
-{
- struct tlist *tmp;
-
- /* Avoid duplicate warnings. */
- for (tmp = warned_ids; tmp; tmp = tmp->next)
- if (candidate_equal_p (tmp->expr, written))
- return;
-
- while (list)
- {
- if (candidate_equal_p (list->expr, written)
- && !candidate_equal_p (list->writer, writer)
- && (!only_writes || list->writer))
- {
- warned_ids = new_tlist (warned_ids, written, NULL_TREE);
- warning_at (EXPR_LOC_OR_LOC (writer, input_location),
- OPT_Wsequence_point, "operation on %qE may be undefined",
- list->expr);
- }
- list = list->next;
- }
-}
-
-/* Given a list LIST of references to variables, find whether any of these
- can cause conflicts due to missing sequence points. */
-
-static void
-warn_for_collisions (struct tlist *list)
-{
- struct tlist *tmp;
-
- for (tmp = list; tmp; tmp = tmp->next)
- {
- if (tmp->writer)
- warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
- }
-}
-
-/* Return nonzero if X is a tree that can be verified by the sequence point
- warnings. */
-static int
-warning_candidate_p (tree x)
-{
- if (DECL_P (x) && DECL_ARTIFICIAL (x))
- return 0;
-
- if (TREE_CODE (x) == BLOCK)
- return 0;
-
- /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
- (lvalue_p) crash on TRY/CATCH. */
- if (TREE_TYPE (x) == NULL_TREE || VOID_TYPE_P (TREE_TYPE (x)))
- return 0;
-
- if (!lvalue_p (x))
- return 0;
-
- /* No point to track non-const calls, they will never satisfy
- operand_equal_p. */
- if (TREE_CODE (x) == CALL_EXPR && (call_expr_flags (x) & ECF_CONST) == 0)
- return 0;
-
- if (TREE_CODE (x) == STRING_CST)
- return 0;
-
- return 1;
-}
-
-/* Return nonzero if X and Y appear to be the same candidate (or NULL) */
-static bool
-candidate_equal_p (const_tree x, const_tree y)
-{
- return (x == y) || (x && y && operand_equal_p (x, y, 0));
-}
-
-/* Walk the tree X, and record accesses to variables. If X is written by the
- parent tree, WRITER is the parent.
- We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
- expression or its only operand forces a sequence point, then everything up
- to the sequence point is stored in PBEFORE_SP. Everything else gets stored
- in PNO_SP.
- Once we return, we will have emitted warnings if any subexpression before
- such a sequence point could be undefined. On a higher level, however, the
- sequence point may not be relevant, and we'll merge the two lists.
-
- Example: (b++, a) + b;
- The call that processes the COMPOUND_EXPR will store the increment of B
- in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
- processes the PLUS_EXPR will need to merge the two lists so that
- eventually, all accesses end up on the same list (and we'll warn about the
- unordered subexpressions b++ and b.
-
- A note on merging. If we modify the former example so that our expression
- becomes
- (b++, b) + a
- care must be taken not simply to add all three expressions into the final
- PNO_SP list. The function merge_tlist takes care of that by merging the
- before-SP list of the COMPOUND_EXPR into its after-SP list in a special
- way, so that no more than one access to B is recorded. */
-
-static void
-verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
- tree writer)
-{
- struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
- enum tree_code code;
- enum tree_code_class cl;
-
- /* X may be NULL if it is the operand of an empty statement expression
- ({ }). */
- if (x == NULL)
- return;
-
- restart:
- code = TREE_CODE (x);
- cl = TREE_CODE_CLASS (code);
-
- if (warning_candidate_p (x))
- *pno_sp = new_tlist (*pno_sp, x, writer);
-
- switch (code)
- {
- case CONSTRUCTOR:
- case SIZEOF_EXPR:
- return;
-
- case COMPOUND_EXPR:
- case TRUTH_ANDIF_EXPR:
- case TRUTH_ORIF_EXPR:
- tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
- verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
- warn_for_collisions (tmp_nosp);
- merge_tlist (pbefore_sp, tmp_before, 0);
- merge_tlist (pbefore_sp, tmp_nosp, 0);
- verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_list2, NULL_TREE);
- warn_for_collisions (tmp_list2);
- merge_tlist (pbefore_sp, tmp_list3, 0);
- merge_tlist (pno_sp, tmp_list2, 0);
- return;
-
- case COND_EXPR:
- tmp_before = tmp_list2 = 0;
- verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
- warn_for_collisions (tmp_list2);
- merge_tlist (pbefore_sp, tmp_before, 0);
- merge_tlist (pbefore_sp, tmp_list2, 0);
-
- tmp_list3 = tmp_nosp = 0;
- verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
- warn_for_collisions (tmp_nosp);
- merge_tlist (pbefore_sp, tmp_list3, 0);
-
- tmp_list3 = tmp_list2 = 0;
- verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
- warn_for_collisions (tmp_list2);
- merge_tlist (pbefore_sp, tmp_list3, 0);
- /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
- two first, to avoid warning for (a ? b++ : b++). */
- merge_tlist (&tmp_nosp, tmp_list2, 0);
- add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
- return;
-
- case PREDECREMENT_EXPR:
- case PREINCREMENT_EXPR:
- case POSTDECREMENT_EXPR:
- case POSTINCREMENT_EXPR:
- verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
- return;
-
- case MODIFY_EXPR:
- tmp_before = tmp_nosp = tmp_list3 = 0;
- verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
- verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
- /* Expressions inside the LHS are not ordered wrt. the sequence points
- in the RHS. Example:
- *a = (a++, 2)
- Despite the fact that the modification of "a" is in the before_sp
- list (tmp_before), it conflicts with the use of "a" in the LHS.
- We can handle this by adding the contents of tmp_list3
- to those of tmp_before, and redoing the collision warnings for that
- list. */
- add_tlist (&tmp_before, tmp_list3, x, 1);
- warn_for_collisions (tmp_before);
- /* Exclude the LHS itself here; we first have to merge it into the
- tmp_nosp list. This is done to avoid warning for "a = a"; if we
- didn't exclude the LHS, we'd get it twice, once as a read and once
- as a write. */
- add_tlist (pno_sp, tmp_list3, x, 0);
- warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
-
- merge_tlist (pbefore_sp, tmp_before, 0);
- if (warning_candidate_p (TREE_OPERAND (x, 0)))
- merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
- add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
- return;
-
- case CALL_EXPR:
- /* We need to warn about conflicts among arguments and conflicts between
- args and the function address. Side effects of the function address,
- however, are not ordered by the sequence point of the call. */
- {
- call_expr_arg_iterator iter;
- tree arg;
- tmp_before = tmp_nosp = 0;
- verify_tree (CALL_EXPR_FN (x), &tmp_before, &tmp_nosp, NULL_TREE);
- FOR_EACH_CALL_EXPR_ARG (arg, iter, x)
- {
- tmp_list2 = tmp_list3 = 0;
- verify_tree (arg, &tmp_list2, &tmp_list3, NULL_TREE);
- merge_tlist (&tmp_list3, tmp_list2, 0);
- add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
- }
- add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
- warn_for_collisions (tmp_before);
- add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
- return;
- }
-
- case TREE_LIST:
- /* Scan all the list, e.g. indices of multi dimensional array. */
- while (x)
- {
- tmp_before = tmp_nosp = 0;
- verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
- merge_tlist (&tmp_nosp, tmp_before, 0);
- add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
- x = TREE_CHAIN (x);
- }
- return;
-
- case SAVE_EXPR:
- {
- struct tlist_cache *t;
- for (t = save_expr_cache; t; t = t->next)
- if (candidate_equal_p (t->expr, x))
- break;
-
- if (!t)
- {
- t = XOBNEW (&tlist_obstack, struct tlist_cache);
- t->next = save_expr_cache;
- t->expr = x;
- save_expr_cache = t;
-
- tmp_before = tmp_nosp = 0;
- verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
- warn_for_collisions (tmp_nosp);
-
- tmp_list3 = 0;
- merge_tlist (&tmp_list3, tmp_nosp, 0);
- t->cache_before_sp = tmp_before;
- t->cache_after_sp = tmp_list3;
- }
- merge_tlist (pbefore_sp, t->cache_before_sp, 1);
- add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
- return;
- }
-
- case ADDR_EXPR:
- x = TREE_OPERAND (x, 0);
- if (DECL_P (x))
- return;
- writer = 0;
- goto restart;
-
- default:
- /* For other expressions, simply recurse on their operands.
- Manual tail recursion for unary expressions.
- Other non-expressions need not be processed. */
- if (cl == tcc_unary)
- {
- x = TREE_OPERAND (x, 0);
- writer = 0;
- goto restart;
- }
- else if (IS_EXPR_CODE_CLASS (cl))
- {
- int lp;
- int max = TREE_OPERAND_LENGTH (x);
- for (lp = 0; lp < max; lp++)
- {
- tmp_before = tmp_nosp = 0;
- verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0);
- merge_tlist (&tmp_nosp, tmp_before, 0);
- add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
- }
- }
- return;
- }
-}
-
-/* Try to warn for undefined behavior in EXPR due to missing sequence
- points. */
-
-DEBUG_FUNCTION void
-verify_sequence_points (tree expr)
-{
- struct tlist *before_sp = 0, *after_sp = 0;
-
- warned_ids = 0;
- save_expr_cache = 0;
- if (tlist_firstobj == 0)
- {
- gcc_obstack_init (&tlist_obstack);
- tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
- }
-
- verify_tree (expr, &before_sp, &after_sp, 0);
- warn_for_collisions (after_sp);
- obstack_free (&tlist_obstack, tlist_firstobj);
-}
-\f
-/* Validate the expression after `case' and apply default promotions. */
-
-static tree
-check_case_value (location_t loc, tree value)
-{
- if (value == NULL_TREE)
- return value;
-
- if (TREE_CODE (value) == INTEGER_CST)
- /* Promote char or short to int. */
- value = perform_integral_promotions (value);
- else if (value != error_mark_node)
- {
- error_at (loc, "case label does not reduce to an integer constant");
- value = error_mark_node;
- }
-
- constant_expression_warning (value);
-
- return value;
-}
-\f
-/* See if the case values LOW and HIGH are in the range of the original
- type (i.e. before the default conversion to int) of the switch testing
- expression.
- TYPE is the promoted type of the testing expression, and ORIG_TYPE is
- the type before promoting it. CASE_LOW_P is a pointer to the lower
- bound of the case label, and CASE_HIGH_P is the upper bound or NULL
- if the case is not a case range.
- The caller has to make sure that we are not called with NULL for
- CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
- was a case value that doesn't fit into the range of the ORIG_TYPE.
- Returns true if the case label is in range of ORIG_TYPE (saturated or
- untouched) or false if the label is out of range. */
-
-static bool
-check_case_bounds (location_t loc, tree type, tree orig_type,
- tree *case_low_p, tree *case_high_p,
- bool *outside_range_p)
-{
- tree min_value, max_value;
- tree case_low = *case_low_p;
- tree case_high = case_high_p ? *case_high_p : case_low;
-
- /* If there was a problem with the original type, do nothing. */
- if (orig_type == error_mark_node)
- return true;
-
- min_value = TYPE_MIN_VALUE (orig_type);
- max_value = TYPE_MAX_VALUE (orig_type);
-
- /* We'll really need integer constants here. */
- case_low = fold (case_low);
- case_high = fold (case_high);
-
- /* Case label is less than minimum for type. */
- if (tree_int_cst_compare (case_low, min_value) < 0
- && tree_int_cst_compare (case_high, min_value) < 0)
- {
- warning_at (loc, 0, "case label value is less than minimum value "
- "for type");
- *outside_range_p = true;
- return false;
- }
-
- /* Case value is greater than maximum for type. */
- if (tree_int_cst_compare (case_low, max_value) > 0
- && tree_int_cst_compare (case_high, max_value) > 0)
- {
- warning_at (loc, 0, "case label value exceeds maximum value for type");
- *outside_range_p = true;
- return false;
- }
-
- /* Saturate lower case label value to minimum. */
- if (tree_int_cst_compare (case_high, min_value) >= 0
- && tree_int_cst_compare (case_low, min_value) < 0)
- {
- warning_at (loc, 0, "lower value in case label range"
- " less than minimum value for type");
- *outside_range_p = true;
- case_low = min_value;
- }
-
- /* Saturate upper case label value to maximum. */
- if (tree_int_cst_compare (case_low, max_value) <= 0
- && tree_int_cst_compare (case_high, max_value) > 0)
- {
- warning_at (loc, 0, "upper value in case label range"
- " exceeds maximum value for type");
- *outside_range_p = true;
- case_high = max_value;
- }
-
- if (*case_low_p != case_low)
- *case_low_p = convert (type, case_low);
- if (case_high_p && *case_high_p != case_high)
- *case_high_p = convert (type, case_high);
-
- return true;
-}
-\f
-/* Return an integer type with BITS bits of precision,
- that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
-
-tree
-c_common_type_for_size (unsigned int bits, int unsignedp)
-{
- int i;
-
- if (bits == TYPE_PRECISION (integer_type_node))
- return unsignedp ? unsigned_type_node : integer_type_node;
-
- if (bits == TYPE_PRECISION (signed_char_type_node))
- return unsignedp ? unsigned_char_type_node : signed_char_type_node;
-
- if (bits == TYPE_PRECISION (short_integer_type_node))
- return unsignedp ? short_unsigned_type_node : short_integer_type_node;
-
- if (bits == TYPE_PRECISION (long_integer_type_node))
- return unsignedp ? long_unsigned_type_node : long_integer_type_node;
-
- if (bits == TYPE_PRECISION (long_long_integer_type_node))
- return (unsignedp ? long_long_unsigned_type_node
- : long_long_integer_type_node);
-
- for (i = 0; i < NUM_INT_N_ENTS; i ++)
- if (int_n_enabled_p[i]
- && bits == int_n_data[i].bitsize)
- return (unsignedp ? int_n_trees[i].unsigned_type
- : int_n_trees[i].signed_type);
-
- if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
- return (unsignedp ? widest_unsigned_literal_type_node
- : widest_integer_literal_type_node);
-
- if (bits <= TYPE_PRECISION (intQI_type_node))
- return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
-
- if (bits <= TYPE_PRECISION (intHI_type_node))
- return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
-
- if (bits <= TYPE_PRECISION (intSI_type_node))
- return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
-
- if (bits <= TYPE_PRECISION (intDI_type_node))
- return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
-
- return 0;
-}
-
-/* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
- that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
- and saturating if SATP is nonzero, otherwise not saturating. */
-
-tree
-c_common_fixed_point_type_for_size (unsigned int ibit, unsigned int fbit,
- int unsignedp, int satp)
-{
- machine_mode mode;
- if (ibit == 0)
- mode = unsignedp ? UQQmode : QQmode;
- else
- mode = unsignedp ? UHAmode : HAmode;
-
- for (; mode != VOIDmode; mode = GET_MODE_WIDER_MODE (mode))
- if (GET_MODE_IBIT (mode) >= ibit && GET_MODE_FBIT (mode) >= fbit)
- break;
-
- if (mode == VOIDmode || !targetm.scalar_mode_supported_p (mode))
- {
- sorry ("GCC cannot support operators with integer types and "
- "fixed-point types that have too many integral and "
- "fractional bits together");
- return 0;
- }
-
- return c_common_type_for_mode (mode, satp);
-}
-
-/* Used for communication between c_common_type_for_mode and
- c_register_builtin_type. */
-tree registered_builtin_types;
-
-/* Return a data type that has machine mode MODE.
- If the mode is an integer,
- then UNSIGNEDP selects between signed and unsigned types.
- If the mode is a fixed-point mode,
- then UNSIGNEDP selects between saturating and nonsaturating types. */
-
-tree
-c_common_type_for_mode (machine_mode mode, int unsignedp)
-{
- tree t;
- int i;
-
- if (mode == TYPE_MODE (integer_type_node))
- return unsignedp ? unsigned_type_node : integer_type_node;
-
- if (mode == TYPE_MODE (signed_char_type_node))
- return unsignedp ? unsigned_char_type_node : signed_char_type_node;
-
- if (mode == TYPE_MODE (short_integer_type_node))
- return unsignedp ? short_unsigned_type_node : short_integer_type_node;
-
- if (mode == TYPE_MODE (long_integer_type_node))
- return unsignedp ? long_unsigned_type_node : long_integer_type_node;
-
- if (mode == TYPE_MODE (long_long_integer_type_node))
- return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
-
- for (i = 0; i < NUM_INT_N_ENTS; i ++)
- if (int_n_enabled_p[i]
- && mode == int_n_data[i].m)
- return (unsignedp ? int_n_trees[i].unsigned_type
- : int_n_trees[i].signed_type);
-
- if (mode == TYPE_MODE (widest_integer_literal_type_node))
- return unsignedp ? widest_unsigned_literal_type_node
- : widest_integer_literal_type_node;
-
- if (mode == QImode)
- return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
-
- if (mode == HImode)
- return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
-
- if (mode == SImode)
- return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
-
- if (mode == DImode)
- return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
-
-#if HOST_BITS_PER_WIDE_INT >= 64
- if (mode == TYPE_MODE (intTI_type_node))
- return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
-#endif
-
- if (mode == TYPE_MODE (float_type_node))
- return float_type_node;
-
- if (mode == TYPE_MODE (double_type_node))
- return double_type_node;
-
- if (mode == TYPE_MODE (long_double_type_node))
- return long_double_type_node;
-
- if (mode == TYPE_MODE (void_type_node))
- return void_type_node;
-
- if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
- return (unsignedp
- ? make_unsigned_type (GET_MODE_PRECISION (mode))
- : make_signed_type (GET_MODE_PRECISION (mode)));
-
- if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
- return (unsignedp
- ? make_unsigned_type (GET_MODE_PRECISION (mode))
- : make_signed_type (GET_MODE_PRECISION (mode)));
-
- if (COMPLEX_MODE_P (mode))
- {
- machine_mode inner_mode;
- tree inner_type;
-
- if (mode == TYPE_MODE (complex_float_type_node))
- return complex_float_type_node;
- if (mode == TYPE_MODE (complex_double_type_node))
- return complex_double_type_node;
- if (mode == TYPE_MODE (complex_long_double_type_node))
- return complex_long_double_type_node;
-
- if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp)
- return complex_integer_type_node;
-
- inner_mode = GET_MODE_INNER (mode);
- inner_type = c_common_type_for_mode (inner_mode, unsignedp);
- if (inner_type != NULL_TREE)
- return build_complex_type (inner_type);
- }
- else if (VECTOR_MODE_P (mode))
- {
- machine_mode inner_mode = GET_MODE_INNER (mode);
- tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
- if (inner_type != NULL_TREE)
- return build_vector_type_for_mode (inner_type, mode);
- }
-
- if (mode == TYPE_MODE (dfloat32_type_node))
- return dfloat32_type_node;
- if (mode == TYPE_MODE (dfloat64_type_node))
- return dfloat64_type_node;
- if (mode == TYPE_MODE (dfloat128_type_node))
- return dfloat128_type_node;
-
- if (ALL_SCALAR_FIXED_POINT_MODE_P (mode))
- {
- if (mode == TYPE_MODE (short_fract_type_node))
- return unsignedp ? sat_short_fract_type_node : short_fract_type_node;
- if (mode == TYPE_MODE (fract_type_node))
- return unsignedp ? sat_fract_type_node : fract_type_node;
- if (mode == TYPE_MODE (long_fract_type_node))
- return unsignedp ? sat_long_fract_type_node : long_fract_type_node;
- if (mode == TYPE_MODE (long_long_fract_type_node))
- return unsignedp ? sat_long_long_fract_type_node
- : long_long_fract_type_node;
-
- if (mode == TYPE_MODE (unsigned_short_fract_type_node))
- return unsignedp ? sat_unsigned_short_fract_type_node
- : unsigned_short_fract_type_node;
- if (mode == TYPE_MODE (unsigned_fract_type_node))
- return unsignedp ? sat_unsigned_fract_type_node
- : unsigned_fract_type_node;
- if (mode == TYPE_MODE (unsigned_long_fract_type_node))
- return unsignedp ? sat_unsigned_long_fract_type_node
- : unsigned_long_fract_type_node;
- if (mode == TYPE_MODE (unsigned_long_long_fract_type_node))
- return unsignedp ? sat_unsigned_long_long_fract_type_node
- : unsigned_long_long_fract_type_node;
-
- if (mode == TYPE_MODE (short_accum_type_node))
- return unsignedp ? sat_short_accum_type_node : short_accum_type_node;
- if (mode == TYPE_MODE (accum_type_node))
- return unsignedp ? sat_accum_type_node : accum_type_node;
- if (mode == TYPE_MODE (long_accum_type_node))
- return unsignedp ? sat_long_accum_type_node : long_accum_type_node;
- if (mode == TYPE_MODE (long_long_accum_type_node))
- return unsignedp ? sat_long_long_accum_type_node
- : long_long_accum_type_node;
-
- if (mode == TYPE_MODE (unsigned_short_accum_type_node))
- return unsignedp ? sat_unsigned_short_accum_type_node
- : unsigned_short_accum_type_node;
- if (mode == TYPE_MODE (unsigned_accum_type_node))
- return unsignedp ? sat_unsigned_accum_type_node
- : unsigned_accum_type_node;
- if (mode == TYPE_MODE (unsigned_long_accum_type_node))
- return unsignedp ? sat_unsigned_long_accum_type_node
- : unsigned_long_accum_type_node;
- if (mode == TYPE_MODE (unsigned_long_long_accum_type_node))
- return unsignedp ? sat_unsigned_long_long_accum_type_node
- : unsigned_long_long_accum_type_node;
-
- if (mode == QQmode)
- return unsignedp ? sat_qq_type_node : qq_type_node;
- if (mode == HQmode)
- return unsignedp ? sat_hq_type_node : hq_type_node;
- if (mode == SQmode)
- return unsignedp ? sat_sq_type_node : sq_type_node;
- if (mode == DQmode)
- return unsignedp ? sat_dq_type_node : dq_type_node;
- if (mode == TQmode)
- return unsignedp ? sat_tq_type_node : tq_type_node;
-
- if (mode == UQQmode)
- return unsignedp ? sat_uqq_type_node : uqq_type_node;
- if (mode == UHQmode)
- return unsignedp ? sat_uhq_type_node : uhq_type_node;
- if (mode == USQmode)
- return unsignedp ? sat_usq_type_node : usq_type_node;
- if (mode == UDQmode)
- return unsignedp ? sat_udq_type_node : udq_type_node;
- if (mode == UTQmode)
- return unsignedp ? sat_utq_type_node : utq_type_node;
-
- if (mode == HAmode)
- return unsignedp ? sat_ha_type_node : ha_type_node;
- if (mode == SAmode)
- return unsignedp ? sat_sa_type_node : sa_type_node;
- if (mode == DAmode)
- return unsignedp ? sat_da_type_node : da_type_node;
- if (mode == TAmode)
- return unsignedp ? sat_ta_type_node : ta_type_node;
-
- if (mode == UHAmode)
- return unsignedp ? sat_uha_type_node : uha_type_node;
- if (mode == USAmode)
- return unsignedp ? sat_usa_type_node : usa_type_node;
- if (mode == UDAmode)
- return unsignedp ? sat_uda_type_node : uda_type_node;
- if (mode == UTAmode)
- return unsignedp ? sat_uta_type_node : uta_type_node;
- }
-
- for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
- if (TYPE_MODE (TREE_VALUE (t)) == mode
- && !!unsignedp == !!TYPE_UNSIGNED (TREE_VALUE (t)))
- return TREE_VALUE (t);
-
- return 0;
-}
-
-tree
-c_common_unsigned_type (tree type)
-{
- return c_common_signed_or_unsigned_type (1, type);
-}
-
-/* Return a signed type the same as TYPE in other respects. */
-
-tree
-c_common_signed_type (tree type)
-{
- return c_common_signed_or_unsigned_type (0, type);
-}
-
-/* Return a type the same as TYPE except unsigned or
- signed according to UNSIGNEDP. */
-
-tree
-c_common_signed_or_unsigned_type (int unsignedp, tree type)
-{
- tree type1;
- int i;
-
- /* This block of code emulates the behavior of the old
- c_common_unsigned_type. In particular, it returns
- long_unsigned_type_node if passed a long, even when a int would
- have the same size. This is necessary for warnings to work
- correctly in archs where sizeof(int) == sizeof(long) */
-
- type1 = TYPE_MAIN_VARIANT (type);
- if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
- return unsignedp ? unsigned_char_type_node : signed_char_type_node;
- if (type1 == integer_type_node || type1 == unsigned_type_node)
- return unsignedp ? unsigned_type_node : integer_type_node;
- if (type1 == short_integer_type_node || type1 == short_unsigned_type_node)
- return unsignedp ? short_unsigned_type_node : short_integer_type_node;
- if (type1 == long_integer_type_node || type1 == long_unsigned_type_node)
- return unsignedp ? long_unsigned_type_node : long_integer_type_node;
- if (type1 == long_long_integer_type_node || type1 == long_long_unsigned_type_node)
- return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
-
- for (i = 0; i < NUM_INT_N_ENTS; i ++)
- if (int_n_enabled_p[i]
- && (type1 == int_n_trees[i].unsigned_type
- || type1 == int_n_trees[i].signed_type))
- return (unsignedp ? int_n_trees[i].unsigned_type
- : int_n_trees[i].signed_type);
-
- if (type1 == widest_integer_literal_type_node || type1 == widest_unsigned_literal_type_node)
- return unsignedp ? widest_unsigned_literal_type_node : widest_integer_literal_type_node;
-#if HOST_BITS_PER_WIDE_INT >= 64
- if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node)
- return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
-#endif
- if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node)
- return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
- if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node)
- return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
- if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node)
- return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
- if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node)
- return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
-
-#define C_COMMON_FIXED_TYPES(NAME) \
- if (type1 == short_ ## NAME ## _type_node \
- || type1 == unsigned_short_ ## NAME ## _type_node) \
- return unsignedp ? unsigned_short_ ## NAME ## _type_node \
- : short_ ## NAME ## _type_node; \
- if (type1 == NAME ## _type_node \
- || type1 == unsigned_ ## NAME ## _type_node) \
- return unsignedp ? unsigned_ ## NAME ## _type_node \
- : NAME ## _type_node; \
- if (type1 == long_ ## NAME ## _type_node \
- || type1 == unsigned_long_ ## NAME ## _type_node) \
- return unsignedp ? unsigned_long_ ## NAME ## _type_node \
- : long_ ## NAME ## _type_node; \
- if (type1 == long_long_ ## NAME ## _type_node \
- || type1 == unsigned_long_long_ ## NAME ## _type_node) \
- return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
- : long_long_ ## NAME ## _type_node;
-
-#define C_COMMON_FIXED_MODE_TYPES(NAME) \
- if (type1 == NAME ## _type_node \
- || type1 == u ## NAME ## _type_node) \
- return unsignedp ? u ## NAME ## _type_node \
- : NAME ## _type_node;
-
-#define C_COMMON_FIXED_TYPES_SAT(NAME) \
- if (type1 == sat_ ## short_ ## NAME ## _type_node \
- || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
- return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
- : sat_ ## short_ ## NAME ## _type_node; \
- if (type1 == sat_ ## NAME ## _type_node \
- || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
- return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
- : sat_ ## NAME ## _type_node; \
- if (type1 == sat_ ## long_ ## NAME ## _type_node \
- || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
- return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
- : sat_ ## long_ ## NAME ## _type_node; \
- if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
- || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
- return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
- : sat_ ## long_long_ ## NAME ## _type_node;
-
-#define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
- if (type1 == sat_ ## NAME ## _type_node \
- || type1 == sat_ ## u ## NAME ## _type_node) \
- return unsignedp ? sat_ ## u ## NAME ## _type_node \
- : sat_ ## NAME ## _type_node;
-
- C_COMMON_FIXED_TYPES (fract);
- C_COMMON_FIXED_TYPES_SAT (fract);
- C_COMMON_FIXED_TYPES (accum);
- C_COMMON_FIXED_TYPES_SAT (accum);
-
- C_COMMON_FIXED_MODE_TYPES (qq);
- C_COMMON_FIXED_MODE_TYPES (hq);
- C_COMMON_FIXED_MODE_TYPES (sq);
- C_COMMON_FIXED_MODE_TYPES (dq);
- C_COMMON_FIXED_MODE_TYPES (tq);
- C_COMMON_FIXED_MODE_TYPES_SAT (qq);
- C_COMMON_FIXED_MODE_TYPES_SAT (hq);
- C_COMMON_FIXED_MODE_TYPES_SAT (sq);
- C_COMMON_FIXED_MODE_TYPES_SAT (dq);
- C_COMMON_FIXED_MODE_TYPES_SAT (tq);
- C_COMMON_FIXED_MODE_TYPES (ha);
- C_COMMON_FIXED_MODE_TYPES (sa);
- C_COMMON_FIXED_MODE_TYPES (da);
- C_COMMON_FIXED_MODE_TYPES (ta);
- C_COMMON_FIXED_MODE_TYPES_SAT (ha);
- C_COMMON_FIXED_MODE_TYPES_SAT (sa);
- C_COMMON_FIXED_MODE_TYPES_SAT (da);
- C_COMMON_FIXED_MODE_TYPES_SAT (ta);
-
- /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
- the precision; they have precision set to match their range, but
- may use a wider mode to match an ABI. If we change modes, we may
- wind up with bad conversions. For INTEGER_TYPEs in C, must check
- the precision as well, so as to yield correct results for
- bit-field types. C++ does not have these separate bit-field
- types, and producing a signed or unsigned variant of an
- ENUMERAL_TYPE may cause other problems as well. */
-
- if (!INTEGRAL_TYPE_P (type)
- || TYPE_UNSIGNED (type) == unsignedp)
- return type;
-
-#define TYPE_OK(node) \
- (TYPE_MODE (type) == TYPE_MODE (node) \
- && TYPE_PRECISION (type) == TYPE_PRECISION (node))
- if (TYPE_OK (signed_char_type_node))
- return unsignedp ? unsigned_char_type_node : signed_char_type_node;
- if (TYPE_OK (integer_type_node))
- return unsignedp ? unsigned_type_node : integer_type_node;
- if (TYPE_OK (short_integer_type_node))
- return unsignedp ? short_unsigned_type_node : short_integer_type_node;
- if (TYPE_OK (long_integer_type_node))
- return unsignedp ? long_unsigned_type_node : long_integer_type_node;
- if (TYPE_OK (long_long_integer_type_node))
- return (unsignedp ? long_long_unsigned_type_node
- : long_long_integer_type_node);
-
- for (i = 0; i < NUM_INT_N_ENTS; i ++)
- if (int_n_enabled_p[i]
- && TYPE_MODE (type) == int_n_data[i].m
- && TYPE_PRECISION (type) == int_n_data[i].bitsize)
- return (unsignedp ? int_n_trees[i].unsigned_type
- : int_n_trees[i].signed_type);
-
- if (TYPE_OK (widest_integer_literal_type_node))
- return (unsignedp ? widest_unsigned_literal_type_node
- : widest_integer_literal_type_node);
-
-#if HOST_BITS_PER_WIDE_INT >= 64
- if (TYPE_OK (intTI_type_node))
- return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
-#endif
- if (TYPE_OK (intDI_type_node))
- return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
- if (TYPE_OK (intSI_type_node))
- return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
- if (TYPE_OK (intHI_type_node))
- return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
- if (TYPE_OK (intQI_type_node))
- return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
-#undef TYPE_OK
-
- return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
-}
-
-/* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
-
-tree
-c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp)
-{
- int i;
-
- /* Extended integer types of the same width as a standard type have
- lesser rank, so those of the same width as int promote to int or
- unsigned int and are valid for printf formats expecting int or
- unsigned int. To avoid such special cases, avoid creating
- extended integer types for bit-fields if a standard integer type
- is available. */
- if (width == TYPE_PRECISION (integer_type_node))
- return unsignedp ? unsigned_type_node : integer_type_node;
- if (width == TYPE_PRECISION (signed_char_type_node))
- return unsignedp ? unsigned_char_type_node : signed_char_type_node;
- if (width == TYPE_PRECISION (short_integer_type_node))
- return unsignedp ? short_unsigned_type_node : short_integer_type_node;
- if (width == TYPE_PRECISION (long_integer_type_node))
- return unsignedp ? long_unsigned_type_node : long_integer_type_node;
- if (width == TYPE_PRECISION (long_long_integer_type_node))
- return (unsignedp ? long_long_unsigned_type_node
- : long_long_integer_type_node);
- for (i = 0; i < NUM_INT_N_ENTS; i ++)
- if (int_n_enabled_p[i]
- && width == int_n_data[i].bitsize)
- return (unsignedp ? int_n_trees[i].unsigned_type
- : int_n_trees[i].signed_type);
- return build_nonstandard_integer_type (width, unsignedp);
-}
-
-/* The C version of the register_builtin_type langhook. */
-
-void
-c_register_builtin_type (tree type, const char* name)
-{
- tree decl;
-
- decl = build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, get_identifier (name), type);
- DECL_ARTIFICIAL (decl) = 1;
- if (!TYPE_NAME (type))
- TYPE_NAME (type) = decl;
- pushdecl (decl);
-
- registered_builtin_types = tree_cons (0, type, registered_builtin_types);
-}
-\f
-/* Print an error message for invalid operands to arith operation
- CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
- RICHLOC is a rich location for the message, containing either
- three separate locations for each of the operator and operands
-
- lhs op rhs
- ~~~ ^~ ~~~
-
- (C FE), or one location ranging over all over them
-
- lhs op rhs
- ~~~~^~~~~~
-
- (C++ FE). */
-
-void
-binary_op_error (rich_location *richloc, enum tree_code code,
- tree type0, tree type1)
-{
- const char *opname;
-
- switch (code)
- {
- case PLUS_EXPR:
- opname = "+"; break;
- case MINUS_EXPR:
- opname = "-"; break;
- case MULT_EXPR:
- opname = "*"; break;
- case MAX_EXPR:
- opname = "max"; break;
- case MIN_EXPR:
- opname = "min"; break;
- case EQ_EXPR:
- opname = "=="; break;
- case NE_EXPR:
- opname = "!="; break;
- case LE_EXPR:
- opname = "<="; break;
- case GE_EXPR:
- opname = ">="; break;
- case LT_EXPR:
- opname = "<"; break;
- case GT_EXPR:
- opname = ">"; break;
- case LSHIFT_EXPR:
- opname = "<<"; break;
- case RSHIFT_EXPR:
- opname = ">>"; break;
- case TRUNC_MOD_EXPR:
- case FLOOR_MOD_EXPR:
- opname = "%"; break;
- case TRUNC_DIV_EXPR:
- case FLOOR_DIV_EXPR:
- opname = "/"; break;
- case BIT_AND_EXPR:
- opname = "&"; break;
- case BIT_IOR_EXPR:
- opname = "|"; break;
- case TRUTH_ANDIF_EXPR:
- opname = "&&"; break;
- case TRUTH_ORIF_EXPR:
- opname = "||"; break;
- case BIT_XOR_EXPR:
- opname = "^"; break;
- default:
- gcc_unreachable ();
- }
- error_at_rich_loc (richloc,
- "invalid operands to binary %s (have %qT and %qT)",
- opname, type0, type1);
-}
-\f
-/* Given an expression as a tree, return its original type. Do this
- by stripping any conversion that preserves the sign and precision. */
-static tree
-expr_original_type (tree expr)
-{
- STRIP_SIGN_NOPS (expr);
- return TREE_TYPE (expr);
-}
-
-/* Subroutine of build_binary_op, used for comparison operations.
- See if the operands have both been converted from subword integer types
- and, if so, perhaps change them both back to their original type.
- This function is also responsible for converting the two operands
- to the proper common type for comparison.
-
- The arguments of this function are all pointers to local variables
- of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
- RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
-
- LOC is the location of the comparison.
-
- If this function returns nonzero, it means that the comparison has
- a constant value. What this function returns is an expression for
- that value. */
-
-tree
-shorten_compare (location_t loc, tree *op0_ptr, tree *op1_ptr,
- tree *restype_ptr, enum tree_code *rescode_ptr)
-{
- tree type;
- tree op0 = *op0_ptr;
- tree op1 = *op1_ptr;
- int unsignedp0, unsignedp1;
- int real1, real2;
- tree primop0, primop1;
- enum tree_code code = *rescode_ptr;
-
- /* Throw away any conversions to wider types
- already present in the operands. */
-
- primop0 = c_common_get_narrower (op0, &unsignedp0);
- primop1 = c_common_get_narrower (op1, &unsignedp1);
-
- /* If primopN is first sign-extended from primopN's precision to opN's
- precision, then zero-extended from opN's precision to
- *restype_ptr precision, shortenings might be invalid. */
- if (TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (TREE_TYPE (op0))
- && TYPE_PRECISION (TREE_TYPE (op0)) < TYPE_PRECISION (*restype_ptr)
- && !unsignedp0
- && TYPE_UNSIGNED (TREE_TYPE (op0)))
- primop0 = op0;
- if (TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (TREE_TYPE (op1))
- && TYPE_PRECISION (TREE_TYPE (op1)) < TYPE_PRECISION (*restype_ptr)
- && !unsignedp1
- && TYPE_UNSIGNED (TREE_TYPE (op1)))
- primop1 = op1;
-
- /* Handle the case that OP0 does not *contain* a conversion
- but it *requires* conversion to FINAL_TYPE. */
-
- if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
- unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
- if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
- unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
-
- /* If one of the operands must be floated, we cannot optimize. */
- real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
- real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
-
- /* If first arg is constant, swap the args (changing operation
- so value is preserved), for canonicalization. Don't do this if
- the second arg is 0. */
-
- if (TREE_CONSTANT (primop0)
- && !integer_zerop (primop1) && !real_zerop (primop1)
- && !fixed_zerop (primop1))
- {
- std::swap (primop0, primop1);
- std::swap (op0, op1);
- *op0_ptr = op0;
- *op1_ptr = op1;
- std::swap (unsignedp0, unsignedp1);
- std::swap (real1, real2);
-
- switch (code)
- {
- case LT_EXPR:
- code = GT_EXPR;
- break;
- case GT_EXPR:
- code = LT_EXPR;
- break;
- case LE_EXPR:
- code = GE_EXPR;
- break;
- case GE_EXPR:
- code = LE_EXPR;
- break;
- default:
- break;
- }
- *rescode_ptr = code;
- }
-
- /* If comparing an integer against a constant more bits wide,
- maybe we can deduce a value of 1 or 0 independent of the data.
- Or else truncate the constant now
- rather than extend the variable at run time.
-
- This is only interesting if the constant is the wider arg.
- Also, it is not safe if the constant is unsigned and the
- variable arg is signed, since in this case the variable
- would be sign-extended and then regarded as unsigned.
- Our technique fails in this case because the lowest/highest
- possible unsigned results don't follow naturally from the
- lowest/highest possible values of the variable operand.
- For just EQ_EXPR and NE_EXPR there is another technique that
- could be used: see if the constant can be faithfully represented
- in the other operand's type, by truncating it and reextending it
- and see if that preserves the constant's value. */
-
- if (!real1 && !real2
- && TREE_CODE (TREE_TYPE (primop0)) != FIXED_POINT_TYPE
- && TREE_CODE (primop1) == INTEGER_CST
- && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
- {
- int min_gt, max_gt, min_lt, max_lt;
- tree maxval, minval;
- /* 1 if comparison is nominally unsigned. */
- int unsignedp = TYPE_UNSIGNED (*restype_ptr);
- tree val;
-
- type = c_common_signed_or_unsigned_type (unsignedp0,
- TREE_TYPE (primop0));
-
- maxval = TYPE_MAX_VALUE (type);
- minval = TYPE_MIN_VALUE (type);
-
- if (unsignedp && !unsignedp0)
- *restype_ptr = c_common_signed_type (*restype_ptr);
-
- if (TREE_TYPE (primop1) != *restype_ptr)
- {
- /* Convert primop1 to target type, but do not introduce
- additional overflow. We know primop1 is an int_cst. */
- primop1 = force_fit_type (*restype_ptr,
- wi::to_wide
- (primop1,
- TYPE_PRECISION (*restype_ptr)),
- 0, TREE_OVERFLOW (primop1));
- }
- if (type != *restype_ptr)
- {
- minval = convert (*restype_ptr, minval);
- maxval = convert (*restype_ptr, maxval);
- }
-
- min_gt = tree_int_cst_lt (primop1, minval);
- max_gt = tree_int_cst_lt (primop1, maxval);
- min_lt = tree_int_cst_lt (minval, primop1);
- max_lt = tree_int_cst_lt (maxval, primop1);
-
- val = 0;
- /* This used to be a switch, but Genix compiler can't handle that. */
- if (code == NE_EXPR)
- {
- if (max_lt || min_gt)
- val = truthvalue_true_node;
- }
- else if (code == EQ_EXPR)
- {
- if (max_lt || min_gt)
- val = truthvalue_false_node;
- }
- else if (code == LT_EXPR)
- {
- if (max_lt)
- val = truthvalue_true_node;
- if (!min_lt)
- val = truthvalue_false_node;
- }
- else if (code == GT_EXPR)
- {
- if (min_gt)
- val = truthvalue_true_node;
- if (!max_gt)
- val = truthvalue_false_node;
- }
- else if (code == LE_EXPR)
- {
- if (!max_gt)
- val = truthvalue_true_node;
- if (min_gt)
- val = truthvalue_false_node;
- }
- else if (code == GE_EXPR)
- {
- if (!min_lt)
- val = truthvalue_true_node;
- if (max_lt)
- val = truthvalue_false_node;
- }
-
- /* If primop0 was sign-extended and unsigned comparison specd,
- we did a signed comparison above using the signed type bounds.
- But the comparison we output must be unsigned.
-
- Also, for inequalities, VAL is no good; but if the signed
- comparison had *any* fixed result, it follows that the
- unsigned comparison just tests the sign in reverse
- (positive values are LE, negative ones GE).
- So we can generate an unsigned comparison
- against an extreme value of the signed type. */
-
- if (unsignedp && !unsignedp0)
- {
- if (val != 0)
- switch (code)
- {
- case LT_EXPR:
- case GE_EXPR:
- primop1 = TYPE_MIN_VALUE (type);
- val = 0;
- break;
-
- case LE_EXPR:
- case GT_EXPR:
- primop1 = TYPE_MAX_VALUE (type);
- val = 0;
- break;
-
- default:
- break;
- }
- type = c_common_unsigned_type (type);
- }
-
- if (TREE_CODE (primop0) != INTEGER_CST
- /* Don't warn if it's from a (non-system) macro. */
- && !(from_macro_expansion_at
- (expansion_point_location_if_in_system_header
- (EXPR_LOCATION (primop0)))))
- {
- if (val == truthvalue_false_node)
- warning_at (loc, OPT_Wtype_limits,
- "comparison is always false due to limited range of data type");
- if (val == truthvalue_true_node)
- warning_at (loc, OPT_Wtype_limits,
- "comparison is always true due to limited range of data type");
- }
-
- if (val != 0)
- {
- /* Don't forget to evaluate PRIMOP0 if it has side effects. */
- if (TREE_SIDE_EFFECTS (primop0))
- return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
- return val;
- }
-
- /* Value is not predetermined, but do the comparison
- in the type of the operand that is not constant.
- TYPE is already properly set. */
- }
-
- /* If either arg is decimal float and the other is float, find the
- proper common type to use for comparison. */
- else if (real1 && real2
- && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
- && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1))))
- type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
-
- /* If either arg is decimal float and the other is float, fail. */
- else if (real1 && real2
- && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
- || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))))
- return 0;
-
- else if (real1 && real2
- && (TYPE_PRECISION (TREE_TYPE (primop0))
- == TYPE_PRECISION (TREE_TYPE (primop1))))
- type = TREE_TYPE (primop0);
-
- /* If args' natural types are both narrower than nominal type
- and both extend in the same manner, compare them
- in the type of the wider arg.
- Otherwise must actually extend both to the nominal
- common type lest different ways of extending
- alter the result.
- (eg, (short)-1 == (unsigned short)-1 should be 0.) */
-
- else if (unsignedp0 == unsignedp1 && real1 == real2
- && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
- && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
- {
- type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
- type = c_common_signed_or_unsigned_type (unsignedp0
- || TYPE_UNSIGNED (*restype_ptr),
- type);
- /* Make sure shorter operand is extended the right way
- to match the longer operand. */
- primop0
- = convert (c_common_signed_or_unsigned_type (unsignedp0,
- TREE_TYPE (primop0)),
- primop0);
- primop1
- = convert (c_common_signed_or_unsigned_type (unsignedp1,
- TREE_TYPE (primop1)),
- primop1);
- }
- else
- {
- /* Here we must do the comparison on the nominal type
- using the args exactly as we received them. */
- type = *restype_ptr;
- primop0 = op0;
- primop1 = op1;
-
- if (!real1 && !real2 && integer_zerop (primop1)
- && TYPE_UNSIGNED (*restype_ptr))
- {
- tree value = 0;
- /* All unsigned values are >= 0, so we warn. However,
- if OP0 is a constant that is >= 0, the signedness of
- the comparison isn't an issue, so suppress the
- warning. */
- bool warn =
- warn_type_limits && !in_system_header_at (loc)
- && !(TREE_CODE (primop0) == INTEGER_CST
- && !TREE_OVERFLOW (convert (c_common_signed_type (type),
- primop0)))
- /* Do not warn for enumeration types. */
- && (TREE_CODE (expr_original_type (primop0)) != ENUMERAL_TYPE);
-
- switch (code)
- {
- case GE_EXPR:
- if (warn)
- warning_at (loc, OPT_Wtype_limits,
- "comparison of unsigned expression >= 0 is always true");
- value = truthvalue_true_node;
- break;
-
- case LT_EXPR:
- if (warn)
- warning_at (loc, OPT_Wtype_limits,
- "comparison of unsigned expression < 0 is always false");
- value = truthvalue_false_node;
- break;
-
- default:
- break;
- }
-
- if (value != 0)
- {
- /* Don't forget to evaluate PRIMOP0 if it has side effects. */
- if (TREE_SIDE_EFFECTS (primop0))
- return build2 (COMPOUND_EXPR, TREE_TYPE (value),
- primop0, value);
- return value;
- }
- }
- }
-
- *op0_ptr = convert (type, primop0);
- *op1_ptr = convert (type, primop1);
-
- *restype_ptr = truthvalue_type_node;
-
- return 0;
-}
-\f
-/* Return a tree for the sum or difference (RESULTCODE says which)
- of pointer PTROP and integer INTOP. */
-
-tree
-pointer_int_sum (location_t loc, enum tree_code resultcode,
- tree ptrop, tree intop, bool complain)
-{
- tree size_exp, ret;
-
- /* The result is a pointer of the same type that is being added. */
- tree result_type = TREE_TYPE (ptrop);
-
- if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
- {
- if (complain && warn_pointer_arith)
- pedwarn (loc, OPT_Wpointer_arith,
- "pointer of type %<void *%> used in arithmetic");
- else if (!complain)
- return error_mark_node;
- size_exp = integer_one_node;
- }
- else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
- {
- if (complain && warn_pointer_arith)
- pedwarn (loc, OPT_Wpointer_arith,
- "pointer to a function used in arithmetic");
- else if (!complain)
- return error_mark_node;
- size_exp = integer_one_node;
- }
- else
- size_exp = size_in_bytes_loc (loc, TREE_TYPE (result_type));
-
- /* We are manipulating pointer values, so we don't need to warn
- about relying on undefined signed overflow. We disable the
- warning here because we use integer types so fold won't know that
- they are really pointers. */
- fold_defer_overflow_warnings ();
-
- /* If what we are about to multiply by the size of the elements
- contains a constant term, apply distributive law
- and multiply that constant term separately.
- This helps produce common subexpressions. */
- if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
- && !TREE_CONSTANT (intop)
- && TREE_CONSTANT (TREE_OPERAND (intop, 1))
- && TREE_CONSTANT (size_exp)
- /* If the constant comes from pointer subtraction,
- skip this optimization--it would cause an error. */
- && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
- /* If the constant is unsigned, and smaller than the pointer size,
- then we must skip this optimization. This is because it could cause
- an overflow error if the constant is negative but INTOP is not. */
- && (!TYPE_UNSIGNED (TREE_TYPE (intop))
- || (TYPE_PRECISION (TREE_TYPE (intop))
- == TYPE_PRECISION (TREE_TYPE (ptrop)))))
- {
- enum tree_code subcode = resultcode;
- tree int_type = TREE_TYPE (intop);
- if (TREE_CODE (intop) == MINUS_EXPR)
- subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
- /* Convert both subexpression types to the type of intop,
- because weird cases involving pointer arithmetic
- can result in a sum or difference with different type args. */
- ptrop = build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop, 1)),
- subcode, ptrop,
- convert (int_type, TREE_OPERAND (intop, 1)), 1);
- intop = convert (int_type, TREE_OPERAND (intop, 0));
- }
-
- /* Convert the integer argument to a type the same size as sizetype
- so the multiply won't overflow spuriously. */
- if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
- || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
- intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
- TYPE_UNSIGNED (sizetype)), intop);
-
- /* Replace the integer argument with a suitable product by the object size.
- Do this multiplication as signed, then convert to the appropriate type
- for the pointer operation and disregard an overflow that occurred only
- because of the sign-extension change in the latter conversion. */
- {
- tree t = fold_build2_loc (loc, MULT_EXPR, TREE_TYPE (intop), intop,
- convert (TREE_TYPE (intop), size_exp));
- intop = convert (sizetype, t);
- if (TREE_OVERFLOW_P (intop) && !TREE_OVERFLOW (t))
- intop = wide_int_to_tree (TREE_TYPE (intop), intop);
- }
-
- /* Create the sum or difference. */
- if (resultcode == MINUS_EXPR)
- intop = fold_build1_loc (loc, NEGATE_EXPR, sizetype, intop);
-
- ret = fold_build_pointer_plus_loc (loc, ptrop, intop);
-
- fold_undefer_and_ignore_overflow_warnings ();
-
- return ret;
-}
-\f
-/* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
- and if NON_CONST is known not to be permitted in an evaluated part
- of a constant expression. */
-
-tree
-c_wrap_maybe_const (tree expr, bool non_const)
-{
- bool nowarning = TREE_NO_WARNING (expr);
- location_t loc = EXPR_LOCATION (expr);
-
- /* This should never be called for C++. */
- if (c_dialect_cxx ())
- gcc_unreachable ();
-
- /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
- STRIP_TYPE_NOPS (expr);
- expr = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (expr), NULL, expr);
- C_MAYBE_CONST_EXPR_NON_CONST (expr) = non_const;
- if (nowarning)
- TREE_NO_WARNING (expr) = 1;
- protected_set_expr_location (expr, loc);
-
- return expr;
-}
-
-/* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
- for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
- around the SAVE_EXPR if needed so that c_fully_fold does not need
- to look inside SAVE_EXPRs. */
-
-tree
-c_save_expr (tree expr)
-{
- bool maybe_const = true;
- if (c_dialect_cxx ())
- return save_expr (expr);
- expr = c_fully_fold (expr, false, &maybe_const);
- expr = save_expr (expr);
- if (!maybe_const)
- expr = c_wrap_maybe_const (expr, true);
- return expr;
-}
-
-/* Return whether EXPR is a declaration whose address can never be
- NULL. */
-
-bool
-decl_with_nonnull_addr_p (const_tree expr)
-{
- return (DECL_P (expr)
- && (TREE_CODE (expr) == PARM_DECL
- || TREE_CODE (expr) == LABEL_DECL
- || !DECL_WEAK (expr)));
-}
-
-/* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
- or for an `if' or `while' statement or ?..: exp. It should already
- have been validated to be of suitable type; otherwise, a bad
- diagnostic may result.
-
- The EXPR is located at LOCATION.
-
- This preparation consists of taking the ordinary
- representation of an expression expr and producing a valid tree
- boolean expression describing whether expr is nonzero. We could
- simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
- but we optimize comparisons, &&, ||, and !.
-
- The resulting type should always be `truthvalue_type_node'. */
-
-tree
-c_common_truthvalue_conversion (location_t location, tree expr)
-{
- switch (TREE_CODE (expr))
- {
- case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
- case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
- case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
- case ORDERED_EXPR: case UNORDERED_EXPR:
- if (TREE_TYPE (expr) == truthvalue_type_node)
- return expr;
- expr = build2 (TREE_CODE (expr), truthvalue_type_node,
- TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
- goto ret;
-
- case TRUTH_ANDIF_EXPR:
- case TRUTH_ORIF_EXPR:
- case TRUTH_AND_EXPR:
- case TRUTH_OR_EXPR:
- case TRUTH_XOR_EXPR:
- if (TREE_TYPE (expr) == truthvalue_type_node)
- return expr;
- expr = build2 (TREE_CODE (expr), truthvalue_type_node,
- c_common_truthvalue_conversion (location,
- TREE_OPERAND (expr, 0)),
- c_common_truthvalue_conversion (location,
- TREE_OPERAND (expr, 1)));
- goto ret;
-
- case TRUTH_NOT_EXPR:
- if (TREE_TYPE (expr) == truthvalue_type_node)
- return expr;
- expr = build1 (TREE_CODE (expr), truthvalue_type_node,
- c_common_truthvalue_conversion (location,
- TREE_OPERAND (expr, 0)));
- goto ret;
-
- case ERROR_MARK:
- return expr;
-
- case INTEGER_CST:
- return integer_zerop (expr) ? truthvalue_false_node
- : truthvalue_true_node;
-
- case REAL_CST:
- return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
- ? truthvalue_true_node
- : truthvalue_false_node;
-
- case FIXED_CST:
- return fixed_compare (NE_EXPR, &TREE_FIXED_CST (expr),
- &FCONST0 (TYPE_MODE (TREE_TYPE (expr))))
- ? truthvalue_true_node
- : truthvalue_false_node;
-
- case FUNCTION_DECL:
- expr = build_unary_op (location, ADDR_EXPR, expr, 0);
- /* Fall through. */
-
- case ADDR_EXPR:
- {
- tree inner = TREE_OPERAND (expr, 0);
- if (decl_with_nonnull_addr_p (inner))
- {
- /* Common Ada/Pascal programmer's mistake. */
- warning_at (location,
- OPT_Waddress,
- "the address of %qD will always evaluate as %<true%>",
- inner);
- return truthvalue_true_node;
- }
- break;
- }
-
- case COMPLEX_EXPR:
- expr = build_binary_op (EXPR_LOCATION (expr),
- (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
- ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
- c_common_truthvalue_conversion (location,
- TREE_OPERAND (expr, 0)),
- c_common_truthvalue_conversion (location,
- TREE_OPERAND (expr, 1)),
- 0);
- goto ret;
-
- case NEGATE_EXPR:
- case ABS_EXPR:
- case FLOAT_EXPR:
- case EXCESS_PRECISION_EXPR:
- /* These don't change whether an object is nonzero or zero. */
- return c_common_truthvalue_conversion (location, TREE_OPERAND (expr, 0));
-
- case LROTATE_EXPR:
- case RROTATE_EXPR:
- /* These don't change whether an object is zero or nonzero, but
- we can't ignore them if their second arg has side-effects. */
- if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
- {
- expr = build2 (COMPOUND_EXPR, truthvalue_type_node,
- TREE_OPERAND (expr, 1),
- c_common_truthvalue_conversion
- (location, TREE_OPERAND (expr, 0)));
- goto ret;
- }
- else
- return c_common_truthvalue_conversion (location,
- TREE_OPERAND (expr, 0));
-
- case COND_EXPR:
- /* Distribute the conversion into the arms of a COND_EXPR. */
- if (c_dialect_cxx ())
- {
- tree op1 = TREE_OPERAND (expr, 1);
- tree op2 = TREE_OPERAND (expr, 2);
- /* In C++ one of the arms might have void type if it is throw. */
- if (!VOID_TYPE_P (TREE_TYPE (op1)))
- op1 = c_common_truthvalue_conversion (location, op1);
- if (!VOID_TYPE_P (TREE_TYPE (op2)))
- op2 = c_common_truthvalue_conversion (location, op2);
- expr = fold_build3_loc (location, COND_EXPR, truthvalue_type_node,
- TREE_OPERAND (expr, 0), op1, op2);
- goto ret;
- }
- else
- {
- /* Folding will happen later for C. */
- expr = build3 (COND_EXPR, truthvalue_type_node,
- TREE_OPERAND (expr, 0),
- c_common_truthvalue_conversion (location,
- TREE_OPERAND (expr, 1)),
- c_common_truthvalue_conversion (location,
- TREE_OPERAND (expr, 2)));
- goto ret;
- }
-
- CASE_CONVERT:
- {
- tree totype = TREE_TYPE (expr);
- tree fromtype = TREE_TYPE (TREE_OPERAND (expr, 0));
-
- if (POINTER_TYPE_P (totype)
- && !c_inhibit_evaluation_warnings
- && TREE_CODE (fromtype) == REFERENCE_TYPE)
- {
- tree inner = expr;
- STRIP_NOPS (inner);
-
- if (DECL_P (inner))
- warning_at (location,
- OPT_Waddress,
- "the compiler can assume that the address of "
- "%qD will always evaluate to %<true%>",
- inner);
- }
-
- /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
- since that affects how `default_conversion' will behave. */
- if (TREE_CODE (totype) == REFERENCE_TYPE
- || TREE_CODE (fromtype) == REFERENCE_TYPE)
- break;
- /* Don't strip a conversion from C++0x scoped enum, since they
- don't implicitly convert to other types. */
- if (TREE_CODE (fromtype) == ENUMERAL_TYPE
- && ENUM_IS_SCOPED (fromtype))
- break;
- /* If this isn't narrowing the argument, we can ignore it. */
- if (TYPE_PRECISION (totype) >= TYPE_PRECISION (fromtype))
- return c_common_truthvalue_conversion (location,
- TREE_OPERAND (expr, 0));
- }
- break;
-
- case MODIFY_EXPR:
- if (!TREE_NO_WARNING (expr)
- && warn_parentheses)
- {
- warning_at (location, OPT_Wparentheses,
- "suggest parentheses around assignment used as "
- "truth value");
- TREE_NO_WARNING (expr) = 1;
- }
- break;
-
- default:
- break;
- }
-
- if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
- {
- tree t = (in_late_binary_op ? save_expr (expr) : c_save_expr (expr));
- expr = (build_binary_op
- (EXPR_LOCATION (expr),
- (TREE_SIDE_EFFECTS (expr)
- ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
- c_common_truthvalue_conversion
- (location,
- build_unary_op (location, REALPART_EXPR, t, 0)),
- c_common_truthvalue_conversion
- (location,
- build_unary_op (location, IMAGPART_EXPR, t, 0)),
- 0));
- goto ret;
- }
-
- if (TREE_CODE (TREE_TYPE (expr)) == FIXED_POINT_TYPE)
- {
- tree fixed_zero_node = build_fixed (TREE_TYPE (expr),
- FCONST0 (TYPE_MODE
- (TREE_TYPE (expr))));
- return build_binary_op (location, NE_EXPR, expr, fixed_zero_node, 1);
- }
- else
- return build_binary_op (location, NE_EXPR, expr, integer_zero_node, 1);
-
- ret:
- protected_set_expr_location (expr, location);
- return expr;
-}
-\f
-static void def_builtin_1 (enum built_in_function fncode,
- const char *name,
- enum built_in_class fnclass,
- tree fntype, tree libtype,
- bool both_p, bool fallback_p, bool nonansi_p,
- tree fnattrs, bool implicit_p);
-
-
-/* Apply the TYPE_QUALS to the new DECL. */
-
-void
-c_apply_type_quals_to_decl (int type_quals, tree decl)
-{
- tree type = TREE_TYPE (decl);
-
- if (type == error_mark_node)
- return;
-
- if ((type_quals & TYPE_QUAL_CONST)
- || (type && TREE_CODE (type) == REFERENCE_TYPE))
- /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
- constructor can produce constant init, so rely on cp_finish_decl to
- clear TREE_READONLY if the variable has non-constant init. */
- TREE_READONLY (decl) = 1;
- if (type_quals & TYPE_QUAL_VOLATILE)
- {
- TREE_SIDE_EFFECTS (decl) = 1;
- TREE_THIS_VOLATILE (decl) = 1;
- }
- if (type_quals & TYPE_QUAL_RESTRICT)
- {
- while (type && TREE_CODE (type) == ARRAY_TYPE)
- /* Allow 'restrict' on arrays of pointers.
- FIXME currently we just ignore it. */
- type = TREE_TYPE (type);
- if (!type
- || !POINTER_TYPE_P (type)
- || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
- error ("invalid use of %<restrict%>");
- }
-}
-
-struct c_type_hasher : ggc_ptr_hash<tree_node>
-{
- static hashval_t hash (tree);
- static bool equal (tree, tree);
-};
-
-/* Hash function for the problem of multiple type definitions in
- different files. This must hash all types that will compare
- equal via comptypes to the same value. In practice it hashes
- on some of the simple stuff and leaves the details to comptypes. */
-
-hashval_t
-c_type_hasher::hash (tree t)
-{
- int n_elements;
- int shift, size;
- tree t2;
- switch (TREE_CODE (t))
- {
- /* For pointers, hash on pointee type plus some swizzling. */
- case POINTER_TYPE:
- return hash (TREE_TYPE (t)) ^ 0x3003003;
- /* Hash on number of elements and total size. */
- case ENUMERAL_TYPE:
- shift = 3;
- t2 = TYPE_VALUES (t);
- break;
- case RECORD_TYPE:
- shift = 0;
- t2 = TYPE_FIELDS (t);
- break;
- case QUAL_UNION_TYPE:
- shift = 1;
- t2 = TYPE_FIELDS (t);
- break;
- case UNION_TYPE:
- shift = 2;
- t2 = TYPE_FIELDS (t);
- break;
- default:
- gcc_unreachable ();
- }
- /* FIXME: We want to use a DECL_CHAIN iteration method here, but
- TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
- n_elements = list_length (t2);
- /* We might have a VLA here. */
- if (TREE_CODE (TYPE_SIZE (t)) != INTEGER_CST)
- size = 0;
- else
- size = TREE_INT_CST_LOW (TYPE_SIZE (t));
- return ((size << 24) | (n_elements << shift));
-}
-
-bool
-c_type_hasher::equal (tree t1, tree t2)
-{
- return lang_hooks.types_compatible_p (t1, t2);
-}
-
-static GTY(()) hash_table<c_type_hasher> *type_hash_table;
-
-/* Return the typed-based alias set for T, which may be an expression
- or a type. Return -1 if we don't do anything special. */
-
-alias_set_type
-c_common_get_alias_set (tree t)
-{
- /* For VLAs, use the alias set of the element type rather than the
- default of alias set 0 for types compared structurally. */
- if (TYPE_P (t) && TYPE_STRUCTURAL_EQUALITY_P (t))
- {
- if (TREE_CODE (t) == ARRAY_TYPE)
- return get_alias_set (TREE_TYPE (t));
- return -1;
- }
-
- /* That's all the expressions we handle specially. */
- if (!TYPE_P (t))
- return -1;
-
- /* The C standard guarantees that any object may be accessed via an
- lvalue that has character type. */
- if (t == char_type_node
- || t == signed_char_type_node
- || t == unsigned_char_type_node)
- return 0;
-
- /* The C standard specifically allows aliasing between signed and
- unsigned variants of the same type. We treat the signed
- variant as canonical. */
- if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
- {
- tree t1 = c_common_signed_type (t);
-
- /* t1 == t can happen for boolean nodes which are always unsigned. */
- if (t1 != t)
- return get_alias_set (t1);
- }
-
- /* Handle the case of multiple type nodes referring to "the same" type,
- which occurs with IMA. These share an alias set. FIXME: Currently only
- C90 is handled. (In C99 type compatibility is not transitive, which
- complicates things mightily. The alias set splay trees can theoretically
- represent this, but insertion is tricky when you consider all the
- different orders things might arrive in.) */
-
- if (c_language != clk_c || flag_isoc99)
- return -1;
-
- /* Save time if there's only one input file. */
- if (num_in_fnames == 1)
- return -1;
-
- /* Pointers need special handling if they point to any type that
- needs special handling (below). */
- if (TREE_CODE (t) == POINTER_TYPE)
- {
- tree t2;
- /* Find bottom type under any nested POINTERs. */
- for (t2 = TREE_TYPE (t);
- TREE_CODE (t2) == POINTER_TYPE;
- t2 = TREE_TYPE (t2))
- ;
- if (!RECORD_OR_UNION_TYPE_P (t2)
- && TREE_CODE (t2) != ENUMERAL_TYPE)
- return -1;
- if (TYPE_SIZE (t2) == 0)
- return -1;
- }
- /* These are the only cases that need special handling. */
- if (!RECORD_OR_UNION_TYPE_P (t)
- && TREE_CODE (t) != ENUMERAL_TYPE
- && TREE_CODE (t) != POINTER_TYPE)
- return -1;
- /* Undefined? */
- if (TYPE_SIZE (t) == 0)
- return -1;
-
- /* Look up t in hash table. Only one of the compatible types within each
- alias set is recorded in the table. */
- if (!type_hash_table)
- type_hash_table = hash_table<c_type_hasher>::create_ggc (1021);
- tree *slot = type_hash_table->find_slot (t, INSERT);
- if (*slot != NULL)
- {
- TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
- return TYPE_ALIAS_SET ((tree)*slot);
- }
- else
- /* Our caller will assign and record (in t) a new alias set; all we need
- to do is remember t in the hash table. */
- *slot = t;
-
- return -1;
-}
-\f
-/* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
- the IS_SIZEOF parameter indicates which operator is being applied.
- The COMPLAIN flag controls whether we should diagnose possibly
- ill-formed constructs or not. LOC is the location of the SIZEOF or
- TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
- a type in any context should be returned, rather than the normal
- alignment for that type. */
-
-tree
-c_sizeof_or_alignof_type (location_t loc,
- tree type, bool is_sizeof, bool min_alignof,
- int complain)
-{
- const char *op_name;
- tree value = NULL;
- enum tree_code type_code = TREE_CODE (type);
-
- op_name = is_sizeof ? "sizeof" : "__alignof__";
-
- if (type_code == FUNCTION_TYPE)
- {
- if (is_sizeof)
- {
- if (complain && warn_pointer_arith)
- pedwarn (loc, OPT_Wpointer_arith,
- "invalid application of %<sizeof%> to a function type");
- else if (!complain)
- return error_mark_node;
- value = size_one_node;
- }
- else
- {
- if (complain)
- {
- if (c_dialect_cxx ())
- pedwarn (loc, OPT_Wpedantic, "ISO C++ does not permit "
- "%<alignof%> applied to a function type");
- else
- pedwarn (loc, OPT_Wpedantic, "ISO C does not permit "
- "%<_Alignof%> applied to a function type");
- }
- value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
- }
- }
- else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
- {
- if (type_code == VOID_TYPE
- && complain && warn_pointer_arith)
- pedwarn (loc, OPT_Wpointer_arith,
- "invalid application of %qs to a void type", op_name);
- else if (!complain)
- return error_mark_node;
- value = size_one_node;
- }
- else if (!COMPLETE_TYPE_P (type)
- && (!c_dialect_cxx () || is_sizeof || type_code != ARRAY_TYPE))
- {
- if (complain)
- error_at (loc, "invalid application of %qs to incomplete type %qT",
- op_name, type);
- return error_mark_node;
- }
- else if (c_dialect_cxx () && type_code == ARRAY_TYPE
- && !COMPLETE_TYPE_P (TREE_TYPE (type)))
- {
- if (complain)
- error_at (loc, "invalid application of %qs to array type %qT of "
- "incomplete element type", op_name, type);
- return error_mark_node;
- }
- else
- {
- if (is_sizeof)
- /* Convert in case a char is more than one unit. */
- value = size_binop_loc (loc, CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
- size_int (TYPE_PRECISION (char_type_node)
- / BITS_PER_UNIT));
- else if (min_alignof)
- value = size_int (min_align_of_type (type));
- else
- value = size_int (TYPE_ALIGN_UNIT (type));
- }
-
- /* VALUE will have the middle-end integer type sizetype.
- However, we should really return a value of type `size_t',
- which is just a typedef for an ordinary integer type. */
- value = fold_convert_loc (loc, size_type_node, value);
-
- return value;
-}
-
-/* Implement the __alignof keyword: Return the minimum required
- alignment of EXPR, measured in bytes. For VAR_DECLs,
- FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
- from an "aligned" __attribute__ specification). LOC is the
- location of the ALIGNOF operator. */
-
-tree
-c_alignof_expr (location_t loc, tree expr)
-{
- tree t;
-
- if (VAR_OR_FUNCTION_DECL_P (expr))
- t = size_int (DECL_ALIGN_UNIT (expr));
-
- else if (TREE_CODE (expr) == COMPONENT_REF
- && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
- {
- error_at (loc, "%<__alignof%> applied to a bit-field");
- t = size_one_node;
- }
- else if (TREE_CODE (expr) == COMPONENT_REF
- && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
- t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
-
- else if (INDIRECT_REF_P (expr))
- {
- tree t = TREE_OPERAND (expr, 0);
- tree best = t;
- int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
-
- while (CONVERT_EXPR_P (t)
- && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
- {
- int thisalign;
-
- t = TREE_OPERAND (t, 0);
- thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
- if (thisalign > bestalign)
- best = t, bestalign = thisalign;
- }
- return c_alignof (loc, TREE_TYPE (TREE_TYPE (best)));
- }
- else
- return c_alignof (loc, TREE_TYPE (expr));
-
- return fold_convert_loc (loc, size_type_node, t);
-}
-\f
-/* Handle C and C++ default attributes. */
-
-enum built_in_attribute
-{
-#define DEF_ATTR_NULL_TREE(ENUM) ENUM,
-#define DEF_ATTR_INT(ENUM, VALUE) ENUM,
-#define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
-#define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
-#define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
-#include "builtin-attrs.def"
-#undef DEF_ATTR_NULL_TREE
-#undef DEF_ATTR_INT
-#undef DEF_ATTR_STRING
-#undef DEF_ATTR_IDENT
-#undef DEF_ATTR_TREE_LIST
- ATTR_LAST
-};
-
-static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
-
-static void c_init_attributes (void);
-
-enum c_builtin_type
-{
-#define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
-#define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
-#define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
-#define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
-#define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
-#define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
-#define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
-#define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6) NAME,
-#define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6, ARG7) NAME,
-#define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6, ARG7, ARG8) NAME,
-#define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6, ARG7, ARG8, ARG9) NAME,
-#define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
-#define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
-#define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
-#define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
-#define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
-#define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
-#define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
-#define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
- NAME,
-#define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6) NAME,
-#define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6, ARG7) NAME,
-#define DEF_POINTER_TYPE(NAME, TYPE) NAME,
-#include "builtin-types.def"
-#undef DEF_PRIMITIVE_TYPE
-#undef DEF_FUNCTION_TYPE_0
-#undef DEF_FUNCTION_TYPE_1
-#undef DEF_FUNCTION_TYPE_2
-#undef DEF_FUNCTION_TYPE_3
-#undef DEF_FUNCTION_TYPE_4
-#undef DEF_FUNCTION_TYPE_5
-#undef DEF_FUNCTION_TYPE_6
-#undef DEF_FUNCTION_TYPE_7
-#undef DEF_FUNCTION_TYPE_8
-#undef DEF_FUNCTION_TYPE_9
-#undef DEF_FUNCTION_TYPE_10
-#undef DEF_FUNCTION_TYPE_11
-#undef DEF_FUNCTION_TYPE_VAR_0
-#undef DEF_FUNCTION_TYPE_VAR_1
-#undef DEF_FUNCTION_TYPE_VAR_2
-#undef DEF_FUNCTION_TYPE_VAR_3
-#undef DEF_FUNCTION_TYPE_VAR_4
-#undef DEF_FUNCTION_TYPE_VAR_5
-#undef DEF_FUNCTION_TYPE_VAR_6
-#undef DEF_FUNCTION_TYPE_VAR_7
-#undef DEF_POINTER_TYPE
- BT_LAST
-};
-
-typedef enum c_builtin_type builtin_type;
-
-/* A temporary array for c_common_nodes_and_builtins. Used in
- communication with def_fn_type. */
-static tree builtin_types[(int) BT_LAST + 1];
-
-/* A helper function for c_common_nodes_and_builtins. Build function type
- for DEF with return type RET and N arguments. If VAR is true, then the
- function should be variadic after those N arguments.
-
- Takes special care not to ICE if any of the types involved are
- error_mark_node, which indicates that said type is not in fact available
- (see builtin_type_for_size). In which case the function type as a whole
- should be error_mark_node. */
-
-static void
-def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...)
-{
- tree t;
- tree *args = XALLOCAVEC (tree, n);
- va_list list;
- int i;
-
- va_start (list, n);
- for (i = 0; i < n; ++i)
- {
- builtin_type a = (builtin_type) va_arg (list, int);
- t = builtin_types[a];
- if (t == error_mark_node)
- goto egress;
- args[i] = t;
- }
-
- t = builtin_types[ret];
- if (t == error_mark_node)
- goto egress;
- if (var)
- t = build_varargs_function_type_array (t, n, args);
- else
- t = build_function_type_array (t, n, args);
-
- egress:
- builtin_types[def] = t;
- va_end (list);
-}
-
-/* Build builtin functions common to both C and C++ language
- frontends. */
-
-static void
-c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node)
-{
-#define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
- builtin_types[ENUM] = VALUE;
-#define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
- def_fn_type (ENUM, RETURN, 0, 0);
-#define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
- def_fn_type (ENUM, RETURN, 0, 1, ARG1);
-#define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
- def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
-#define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
- def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
-#define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
- def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
-#define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
- def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
-#define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6) \
- def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
-#define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6, ARG7) \
- def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
-#define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6, ARG7, ARG8) \
- def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
- ARG7, ARG8);
-#define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6, ARG7, ARG8, ARG9) \
- def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
- ARG7, ARG8, ARG9);
-#define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6, ARG7, ARG8, ARG9, ARG10) \
- def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
- ARG7, ARG8, ARG9, ARG10);
-#define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
- def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
- ARG7, ARG8, ARG9, ARG10, ARG11);
-#define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
- def_fn_type (ENUM, RETURN, 1, 0);
-#define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
- def_fn_type (ENUM, RETURN, 1, 1, ARG1);
-#define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
- def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
-#define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
- def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
-#define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
- def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
-#define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
- def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
-#define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6) \
- def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
-#define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
- ARG6, ARG7) \
- def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
-#define DEF_POINTER_TYPE(ENUM, TYPE) \
- builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
-
-#include "builtin-types.def"
-
-#undef DEF_PRIMITIVE_TYPE
-#undef DEF_FUNCTION_TYPE_0
-#undef DEF_FUNCTION_TYPE_1
-#undef DEF_FUNCTION_TYPE_2
-#undef DEF_FUNCTION_TYPE_3
-#undef DEF_FUNCTION_TYPE_4
-#undef DEF_FUNCTION_TYPE_5
-#undef DEF_FUNCTION_TYPE_6
-#undef DEF_FUNCTION_TYPE_7
-#undef DEF_FUNCTION_TYPE_8
-#undef DEF_FUNCTION_TYPE_9
-#undef DEF_FUNCTION_TYPE_10
-#undef DEF_FUNCTION_TYPE_11
-#undef DEF_FUNCTION_TYPE_VAR_0
-#undef DEF_FUNCTION_TYPE_VAR_1
-#undef DEF_FUNCTION_TYPE_VAR_2
-#undef DEF_FUNCTION_TYPE_VAR_3
-#undef DEF_FUNCTION_TYPE_VAR_4
-#undef DEF_FUNCTION_TYPE_VAR_5
-#undef DEF_FUNCTION_TYPE_VAR_6
-#undef DEF_FUNCTION_TYPE_VAR_7
-#undef DEF_POINTER_TYPE
- builtin_types[(int) BT_LAST] = NULL_TREE;
-
- c_init_attributes ();
-
-#define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
- NONANSI_P, ATTRS, IMPLICIT, COND) \
- if (NAME && COND) \
- def_builtin_1 (ENUM, NAME, CLASS, \
- builtin_types[(int) TYPE], \
- builtin_types[(int) LIBTYPE], \
- BOTH_P, FALLBACK_P, NONANSI_P, \
- built_in_attributes[(int) ATTRS], IMPLICIT);
-#include "builtins.def"
-
- targetm.init_builtins ();
-
- build_common_builtin_nodes ();
-
- if (flag_cilkplus)
- cilk_init_builtins ();
-}
-
-/* Like get_identifier, but avoid warnings about null arguments when
- the argument may be NULL for targets where GCC lacks stdint.h type
- information. */
-
-static inline tree
-c_get_ident (const char *id)
-{
- return get_identifier (id);
-}
-
-/* Build tree nodes and builtin functions common to both C and C++ language
- frontends. */
-
-void
-c_common_nodes_and_builtins (void)
-{
- int char16_type_size;
- int char32_type_size;
- int wchar_type_size;
- tree array_domain_type;
- tree va_list_ref_type_node;
- tree va_list_arg_type_node;
- int i;
-
- build_common_tree_nodes (flag_signed_char);
-
- /* Define `int' and `char' first so that dbx will output them first. */
- record_builtin_type (RID_INT, NULL, integer_type_node);
- record_builtin_type (RID_CHAR, "char", char_type_node);
-
- /* `signed' is the same as `int'. FIXME: the declarations of "signed",
- "unsigned long", "long long unsigned" and "unsigned short" were in C++
- but not C. Are the conditionals here needed? */
- if (c_dialect_cxx ())
- record_builtin_type (RID_SIGNED, NULL, integer_type_node);
- record_builtin_type (RID_LONG, "long int", long_integer_type_node);
- record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
- record_builtin_type (RID_MAX, "long unsigned int",
- long_unsigned_type_node);
-
- for (i = 0; i < NUM_INT_N_ENTS; i ++)
- {
- char name[25];
-
- sprintf (name, "__int%d", int_n_data[i].bitsize);
- record_builtin_type ((enum rid)(RID_FIRST_INT_N + i), name,
- int_n_trees[i].signed_type);
- sprintf (name, "__int%d unsigned", int_n_data[i].bitsize);
- record_builtin_type (RID_MAX, name, int_n_trees[i].unsigned_type);
- }
-
- if (c_dialect_cxx ())
- record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
- record_builtin_type (RID_MAX, "long long int",
- long_long_integer_type_node);
- record_builtin_type (RID_MAX, "long long unsigned int",
- long_long_unsigned_type_node);
- if (c_dialect_cxx ())
- record_builtin_type (RID_MAX, "long long unsigned",
- long_long_unsigned_type_node);
- record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
- record_builtin_type (RID_MAX, "short unsigned int",
- short_unsigned_type_node);
- if (c_dialect_cxx ())
- record_builtin_type (RID_MAX, "unsigned short",
- short_unsigned_type_node);
-
- /* Define both `signed char' and `unsigned char'. */
- record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
- record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
-
- /* These are types that c_common_type_for_size and
- c_common_type_for_mode use. */
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, NULL_TREE,
- intQI_type_node));
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, NULL_TREE,
- intHI_type_node));
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, NULL_TREE,
- intSI_type_node));
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, NULL_TREE,
- intDI_type_node));
-#if HOST_BITS_PER_WIDE_INT >= 64
- /* Note that this is different than the __int128 type that's part of
- the generic __intN support. */
- if (targetm.scalar_mode_supported_p (TImode))
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL,
- get_identifier ("__int128_t"),
- intTI_type_node));
-#endif
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, NULL_TREE,
- unsigned_intQI_type_node));
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, NULL_TREE,
- unsigned_intHI_type_node));
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, NULL_TREE,
- unsigned_intSI_type_node));
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, NULL_TREE,
- unsigned_intDI_type_node));
-#if HOST_BITS_PER_WIDE_INT >= 64
- if (targetm.scalar_mode_supported_p (TImode))
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL,
- get_identifier ("__uint128_t"),
- unsigned_intTI_type_node));
-#endif
-
- /* Create the widest literal types. */
- widest_integer_literal_type_node
- = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, NULL_TREE,
- widest_integer_literal_type_node));
-
- widest_unsigned_literal_type_node
- = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, NULL_TREE,
- widest_unsigned_literal_type_node));
-
- signed_size_type_node = c_common_signed_type (size_type_node);
-
- pid_type_node =
- TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
-
- record_builtin_type (RID_FLOAT, NULL, float_type_node);
- record_builtin_type (RID_DOUBLE, NULL, double_type_node);
- record_builtin_type (RID_MAX, "long double", long_double_type_node);
-
- /* Only supported decimal floating point extension if the target
- actually supports underlying modes. */
- if (targetm.scalar_mode_supported_p (SDmode)
- && targetm.scalar_mode_supported_p (DDmode)
- && targetm.scalar_mode_supported_p (TDmode))
- {
- record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node);
- record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node);
- record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node);
- }
-
- if (targetm.fixed_point_supported_p ())
- {
- record_builtin_type (RID_MAX, "short _Fract", short_fract_type_node);
- record_builtin_type (RID_FRACT, NULL, fract_type_node);
- record_builtin_type (RID_MAX, "long _Fract", long_fract_type_node);
- record_builtin_type (RID_MAX, "long long _Fract",
- long_long_fract_type_node);
- record_builtin_type (RID_MAX, "unsigned short _Fract",
- unsigned_short_fract_type_node);
- record_builtin_type (RID_MAX, "unsigned _Fract",
- unsigned_fract_type_node);
- record_builtin_type (RID_MAX, "unsigned long _Fract",
- unsigned_long_fract_type_node);
- record_builtin_type (RID_MAX, "unsigned long long _Fract",
- unsigned_long_long_fract_type_node);
- record_builtin_type (RID_MAX, "_Sat short _Fract",
- sat_short_fract_type_node);
- record_builtin_type (RID_MAX, "_Sat _Fract", sat_fract_type_node);
- record_builtin_type (RID_MAX, "_Sat long _Fract",
- sat_long_fract_type_node);
- record_builtin_type (RID_MAX, "_Sat long long _Fract",
- sat_long_long_fract_type_node);
- record_builtin_type (RID_MAX, "_Sat unsigned short _Fract",
- sat_unsigned_short_fract_type_node);
- record_builtin_type (RID_MAX, "_Sat unsigned _Fract",
- sat_unsigned_fract_type_node);
- record_builtin_type (RID_MAX, "_Sat unsigned long _Fract",
- sat_unsigned_long_fract_type_node);
- record_builtin_type (RID_MAX, "_Sat unsigned long long _Fract",
- sat_unsigned_long_long_fract_type_node);
- record_builtin_type (RID_MAX, "short _Accum", short_accum_type_node);
- record_builtin_type (RID_ACCUM, NULL, accum_type_node);
- record_builtin_type (RID_MAX, "long _Accum", long_accum_type_node);
- record_builtin_type (RID_MAX, "long long _Accum",
- long_long_accum_type_node);
- record_builtin_type (RID_MAX, "unsigned short _Accum",
- unsigned_short_accum_type_node);
- record_builtin_type (RID_MAX, "unsigned _Accum",
- unsigned_accum_type_node);
- record_builtin_type (RID_MAX, "unsigned long _Accum",
- unsigned_long_accum_type_node);
- record_builtin_type (RID_MAX, "unsigned long long _Accum",
- unsigned_long_long_accum_type_node);
- record_builtin_type (RID_MAX, "_Sat short _Accum",
- sat_short_accum_type_node);
- record_builtin_type (RID_MAX, "_Sat _Accum", sat_accum_type_node);
- record_builtin_type (RID_MAX, "_Sat long _Accum",
- sat_long_accum_type_node);
- record_builtin_type (RID_MAX, "_Sat long long _Accum",
- sat_long_long_accum_type_node);
- record_builtin_type (RID_MAX, "_Sat unsigned short _Accum",
- sat_unsigned_short_accum_type_node);
- record_builtin_type (RID_MAX, "_Sat unsigned _Accum",
- sat_unsigned_accum_type_node);
- record_builtin_type (RID_MAX, "_Sat unsigned long _Accum",
- sat_unsigned_long_accum_type_node);
- record_builtin_type (RID_MAX, "_Sat unsigned long long _Accum",
- sat_unsigned_long_long_accum_type_node);
-
- }
-
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL,
- get_identifier ("complex int"),
- complex_integer_type_node));
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL,
- get_identifier ("complex float"),
- complex_float_type_node));
- lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL,
- get_identifier ("complex double"),
- complex_double_type_node));
- lang_hooks.decls.pushdecl
- (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, get_identifier ("complex long double"),
- complex_long_double_type_node));
-
- if (c_dialect_cxx ())
- /* For C++, make fileptr_type_node a distinct void * type until
- FILE type is defined. */
- fileptr_type_node = build_variant_type_copy (ptr_type_node);
-
- record_builtin_type (RID_VOID, NULL, void_type_node);
-
- /* Set the TYPE_NAME for any variants that were built before
- record_builtin_type gave names to the built-in types. */
- {
- tree void_name = TYPE_NAME (void_type_node);
- TYPE_NAME (void_type_node) = NULL_TREE;
- TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST))
- = void_name;
- TYPE_NAME (void_type_node) = void_name;
- }
-
- void_list_node = build_void_list_node ();
-
- /* Make a type to be the domain of a few array types
- whose domains don't really matter.
- 200 is small enough that it always fits in size_t
- and large enough that it can hold most function names for the
- initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
- array_domain_type = build_index_type (size_int (200));
-
- /* Make a type for arrays of characters.
- With luck nothing will ever really depend on the length of this
- array type. */
- char_array_type_node
- = build_array_type (char_type_node, array_domain_type);
-
- string_type_node = build_pointer_type (char_type_node);
- const_string_type_node
- = build_pointer_type (build_qualified_type
- (char_type_node, TYPE_QUAL_CONST));
-
- /* This is special for C++ so functions can be overloaded. */
- wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
- wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
- wchar_type_size = TYPE_PRECISION (wchar_type_node);
- underlying_wchar_type_node = wchar_type_node;
- if (c_dialect_cxx ())
- {
- if (TYPE_UNSIGNED (wchar_type_node))
- wchar_type_node = make_unsigned_type (wchar_type_size);
- else
- wchar_type_node = make_signed_type (wchar_type_size);
- record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
- }
-
- /* This is for wide string constants. */
- wchar_array_type_node
- = build_array_type (wchar_type_node, array_domain_type);
-
- /* Define 'char16_t'. */
- char16_type_node = get_identifier (CHAR16_TYPE);
- char16_type_node = TREE_TYPE (identifier_global_value (char16_type_node));
- char16_type_size = TYPE_PRECISION (char16_type_node);
- if (c_dialect_cxx ())
- {
- char16_type_node = make_unsigned_type (char16_type_size);
-
- if (cxx_dialect >= cxx11)
- record_builtin_type (RID_CHAR16, "char16_t", char16_type_node);
- }
-
- /* This is for UTF-16 string constants. */
- char16_array_type_node
- = build_array_type (char16_type_node, array_domain_type);
-
- /* Define 'char32_t'. */
- char32_type_node = get_identifier (CHAR32_TYPE);
- char32_type_node = TREE_TYPE (identifier_global_value (char32_type_node));
- char32_type_size = TYPE_PRECISION (char32_type_node);
- if (c_dialect_cxx ())
- {
- char32_type_node = make_unsigned_type (char32_type_size);
-
- if (cxx_dialect >= cxx11)
- record_builtin_type (RID_CHAR32, "char32_t", char32_type_node);
- }
-
- /* This is for UTF-32 string constants. */
- char32_array_type_node
- = build_array_type (char32_type_node, array_domain_type);
-
- wint_type_node =
- TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
-
- intmax_type_node =
- TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
- uintmax_type_node =
- TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
-
- if (SIG_ATOMIC_TYPE)
- sig_atomic_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE)));
- if (INT8_TYPE)
- int8_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE)));
- if (INT16_TYPE)
- int16_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE)));
- if (INT32_TYPE)
- int32_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE)));
- if (INT64_TYPE)
- int64_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE)));
- if (UINT8_TYPE)
- uint8_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE)));
- if (UINT16_TYPE)
- c_uint16_type_node = uint16_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE)));
- if (UINT32_TYPE)
- c_uint32_type_node = uint32_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE)));
- if (UINT64_TYPE)
- c_uint64_type_node = uint64_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE)));
- if (INT_LEAST8_TYPE)
- int_least8_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE)));
- if (INT_LEAST16_TYPE)
- int_least16_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE)));
- if (INT_LEAST32_TYPE)
- int_least32_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE)));
- if (INT_LEAST64_TYPE)
- int_least64_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE)));
- if (UINT_LEAST8_TYPE)
- uint_least8_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE)));
- if (UINT_LEAST16_TYPE)
- uint_least16_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE)));
- if (UINT_LEAST32_TYPE)
- uint_least32_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE)));
- if (UINT_LEAST64_TYPE)
- uint_least64_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE)));
- if (INT_FAST8_TYPE)
- int_fast8_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE)));
- if (INT_FAST16_TYPE)
- int_fast16_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE)));
- if (INT_FAST32_TYPE)
- int_fast32_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE)));
- if (INT_FAST64_TYPE)
- int_fast64_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE)));
- if (UINT_FAST8_TYPE)
- uint_fast8_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE)));
- if (UINT_FAST16_TYPE)
- uint_fast16_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE)));
- if (UINT_FAST32_TYPE)
- uint_fast32_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE)));
- if (UINT_FAST64_TYPE)
- uint_fast64_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE)));
- if (INTPTR_TYPE)
- intptr_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE)));
- if (UINTPTR_TYPE)
- uintptr_type_node =
- TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE)));
-
- default_function_type
- = build_varargs_function_type_list (integer_type_node, NULL_TREE);
- ptrdiff_type_node
- = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
- unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
-
- lang_hooks.decls.pushdecl
- (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, get_identifier ("__builtin_va_list"),
- va_list_type_node));
- if (targetm.enum_va_list_p)
- {
- int l;
- const char *pname;
- tree ptype;
+ case CALL_EXPR:
+ /* We need to warn about conflicts among arguments and conflicts between
+ args and the function address. Side effects of the function address,
+ however, are not ordered by the sequence point of the call. */
+ {
+ call_expr_arg_iterator iter;
+ tree arg;
+ tmp_before = tmp_nosp = 0;
+ verify_tree (CALL_EXPR_FN (x), &tmp_before, &tmp_nosp, NULL_TREE);
+ FOR_EACH_CALL_EXPR_ARG (arg, iter, x)
+ {
+ tmp_list2 = tmp_list3 = 0;
+ verify_tree (arg, &tmp_list2, &tmp_list3, NULL_TREE);
+ merge_tlist (&tmp_list3, tmp_list2, 0);
+ add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
+ }
+ add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
+ warn_for_collisions (tmp_before);
+ add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
+ return;
+ }
- for (l = 0; targetm.enum_va_list_p (l, &pname, &ptype); ++l)
+ case TREE_LIST:
+ /* Scan all the list, e.g. indices of multi dimensional array. */
+ while (x)
{
- lang_hooks.decls.pushdecl
- (build_decl (UNKNOWN_LOCATION,
- TYPE_DECL, get_identifier (pname),
- ptype));
-
+ tmp_before = tmp_nosp = 0;
+ verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
+ merge_tlist (&tmp_nosp, tmp_before, 0);
+ add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
+ x = TREE_CHAIN (x);
}
- }
-
- if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
- {
- va_list_arg_type_node = va_list_ref_type_node =
- build_pointer_type (TREE_TYPE (va_list_type_node));
- }
- else
- {
- va_list_arg_type_node = va_list_type_node;
- va_list_ref_type_node = build_reference_type (va_list_type_node);
- }
-
- if (!flag_preprocess_only)
- c_define_builtins (va_list_ref_type_node, va_list_arg_type_node);
-
- main_identifier_node = get_identifier ("main");
-
- /* Create the built-in __null node. It is important that this is
- not shared. */
- null_node = make_int_cst (1, 1);
- TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0);
+ return;
- /* Since builtin_types isn't gc'ed, don't export these nodes. */
- memset (builtin_types, 0, sizeof (builtin_types));
-}
+ case SAVE_EXPR:
+ {
+ struct tlist_cache *t;
+ for (t = save_expr_cache; t; t = t->next)
+ if (candidate_equal_p (t->expr, x))
+ break;
-/* The number of named compound-literals generated thus far. */
-static GTY(()) int compound_literal_number;
+ if (!t)
+ {
+ t = XOBNEW (&tlist_obstack, struct tlist_cache);
+ t->next = save_expr_cache;
+ t->expr = x;
+ save_expr_cache = t;
-/* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
+ tmp_before = tmp_nosp = 0;
+ verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
+ warn_for_collisions (tmp_nosp);
-void
-set_compound_literal_name (tree decl)
-{
- char *name;
- ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal",
- compound_literal_number);
- compound_literal_number++;
- DECL_NAME (decl) = get_identifier (name);
-}
+ tmp_list3 = 0;
+ merge_tlist (&tmp_list3, tmp_nosp, 0);
+ t->cache_before_sp = tmp_before;
+ t->cache_after_sp = tmp_list3;
+ }
+ merge_tlist (pbefore_sp, t->cache_before_sp, 1);
+ add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
+ return;
+ }
-/* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
- TYPE and operand OP. */
+ case ADDR_EXPR:
+ x = TREE_OPERAND (x, 0);
+ if (DECL_P (x))
+ return;
+ writer = 0;
+ goto restart;
-static tree
-build_va_arg_1 (location_t loc, tree type, tree op)
-{
- tree expr = build1 (VA_ARG_EXPR, type, op);
- SET_EXPR_LOCATION (expr, loc);
- return expr;
+ default:
+ /* For other expressions, simply recurse on their operands.
+ Manual tail recursion for unary expressions.
+ Other non-expressions need not be processed. */
+ if (cl == tcc_unary)
+ {
+ x = TREE_OPERAND (x, 0);
+ writer = 0;
+ goto restart;
+ }
+ else if (IS_EXPR_CODE_CLASS (cl))
+ {
+ int lp;
+ int max = TREE_OPERAND_LENGTH (x);
+ for (lp = 0; lp < max; lp++)
+ {
+ tmp_before = tmp_nosp = 0;
+ verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0);
+ merge_tlist (&tmp_nosp, tmp_before, 0);
+ add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
+ }
+ }
+ return;
+ }
}
-/* Return a VA_ARG_EXPR corresponding to a source-level expression
- va_arg (EXPR, TYPE) at source location LOC. */
+/* Try to warn for undefined behavior in EXPR due to missing sequence
+ points. */
-tree
-build_va_arg (location_t loc, tree expr, tree type)
+DEBUG_FUNCTION void
+verify_sequence_points (tree expr)
{
- tree va_type = TREE_TYPE (expr);
- tree canon_va_type = (va_type == error_mark_node
- ? NULL_TREE
- : targetm.canonical_va_list_type (va_type));
+ struct tlist *before_sp = 0, *after_sp = 0;
- if (va_type == error_mark_node
- || canon_va_type == NULL_TREE)
+ warned_ids = 0;
+ save_expr_cache = 0;
+ if (tlist_firstobj == 0)
{
- /* Let's handle things neutrallly, if expr:
- - has undeclared type, or
- - is not an va_list type. */
- return build_va_arg_1 (loc, type, expr);
+ gcc_obstack_init (&tlist_obstack);
+ tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
}
- if (TREE_CODE (canon_va_type) != ARRAY_TYPE)
- {
- /* Case 1: Not an array type. */
-
- /* Take the address, to get '&ap'. */
- mark_addressable (expr);
- expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (expr)), expr);
+ verify_tree (expr, &before_sp, &after_sp, 0);
+ warn_for_collisions (after_sp);
+ obstack_free (&tlist_obstack, tlist_firstobj);
+}
+\f
+/* Validate the expression after `case' and apply default promotions. */
- /* Verify that &ap is still recognized as having va_list type. */
- tree canon_expr_type
- = targetm.canonical_va_list_type (TREE_TYPE (expr));
- if (canon_expr_type == NULL_TREE)
- {
- error_at (loc,
- "first argument to %<va_arg%> not of type %<va_list%>");
- return error_mark_node;
- }
+static tree
+check_case_value (location_t loc, tree value)
+{
+ if (value == NULL_TREE)
+ return value;
- return build_va_arg_1 (loc, type, expr);
+ if (TREE_CODE (value) == INTEGER_CST)
+ /* Promote char or short to int. */
+ value = perform_integral_promotions (value);
+ else if (value != error_mark_node)
+ {
+ error_at (loc, "case label does not reduce to an integer constant");
+ value = error_mark_node;
}
- /* Case 2: Array type.
-
- Background:
-
- For contrast, let's start with the simple case (case 1). If
- canon_va_type is not an array type, but say a char *, then when
- passing-by-value a va_list, the type of the va_list param decl is
- the same as for another va_list decl (all ap's are char *):
-
- f2_1 (char * ap)
- D.1815 = VA_ARG (&ap, 0B, 1);
- return D.1815;
-
- f2 (int i)
- char * ap.0;
- char * ap;
- __builtin_va_start (&ap, 0);
- ap.0 = ap;
- res = f2_1 (ap.0);
- __builtin_va_end (&ap);
- D.1812 = res;
- return D.1812;
+ constant_expression_warning (value);
- However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
- va_list the type of the va_list param decl (case 2b, struct * ap) is not
- the same as for another va_list decl (case 2a, struct ap[1]).
+ return value;
+}
+\f
+/* See if the case values LOW and HIGH are in the range of the original
+ type (i.e. before the default conversion to int) of the switch testing
+ expression.
+ TYPE is the promoted type of the testing expression, and ORIG_TYPE is
+ the type before promoting it. CASE_LOW_P is a pointer to the lower
+ bound of the case label, and CASE_HIGH_P is the upper bound or NULL
+ if the case is not a case range.
+ The caller has to make sure that we are not called with NULL for
+ CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
+ was a case value that doesn't fit into the range of the ORIG_TYPE.
+ Returns true if the case label is in range of ORIG_TYPE (saturated or
+ untouched) or false if the label is out of range. */
- f2_1 (struct * ap)
- D.1844 = VA_ARG (ap, 0B, 0);
- return D.1844;
+static bool
+check_case_bounds (location_t loc, tree type, tree orig_type,
+ tree *case_low_p, tree *case_high_p,
+ bool *outside_range_p)
+{
+ tree min_value, max_value;
+ tree case_low = *case_low_p;
+ tree case_high = case_high_p ? *case_high_p : case_low;
- f2 (int i)
- struct ap[1];
- __builtin_va_start (&ap, 0);
- res = f2_1 (&ap);
- __builtin_va_end (&ap);
- D.1841 = res;
- return D.1841;
+ /* If there was a problem with the original type, do nothing. */
+ if (orig_type == error_mark_node)
+ return true;
- Case 2b is different because:
- - on the callee side, the parm decl has declared type va_list, but
- grokdeclarator changes the type of the parm decl to a pointer to the
- array elem type.
- - on the caller side, the pass-by-value uses &ap.
+ min_value = TYPE_MIN_VALUE (orig_type);
+ max_value = TYPE_MAX_VALUE (orig_type);
- We unify these two cases (case 2a: va_list is array type,
- case 2b: va_list is pointer to array elem type), by adding '&' for the
- array type case, such that we have a pointer to array elem in both
- cases. */
+ /* We'll really need integer constants here. */
+ case_low = fold (case_low);
+ case_high = fold (case_high);
- if (TREE_CODE (va_type) == ARRAY_TYPE)
+ /* Case label is less than minimum for type. */
+ if (tree_int_cst_compare (case_low, min_value) < 0
+ && tree_int_cst_compare (case_high, min_value) < 0)
{
- /* Case 2a: va_list is array type. */
-
- /* Take the address, to get '&ap'. Make sure it's a pointer to array
- elem type. */
- mark_addressable (expr);
- expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (canon_va_type)),
- expr);
-
- /* Verify that &ap is still recognized as having va_list type. */
- tree canon_expr_type
- = targetm.canonical_va_list_type (TREE_TYPE (expr));
- if (canon_expr_type == NULL_TREE)
- {
- error_at (loc,
- "first argument to %<va_arg%> not of type %<va_list%>");
- return error_mark_node;
- }
+ warning_at (loc, 0, "case label value is less than minimum value "
+ "for type");
+ *outside_range_p = true;
+ return false;
}
- else
+
+ /* Case value is greater than maximum for type. */
+ if (tree_int_cst_compare (case_low, max_value) > 0
+ && tree_int_cst_compare (case_high, max_value) > 0)
{
- /* Case 2b: va_list is pointer to array elem type. */
- gcc_assert (POINTER_TYPE_P (va_type));
- gcc_assert (TREE_TYPE (va_type) == TREE_TYPE (canon_va_type));
+ warning_at (loc, 0, "case label value exceeds maximum value for type");
+ *outside_range_p = true;
+ return false;
+ }
- /* Don't take the address. We've already got '&ap'. */
- ;
+ /* Saturate lower case label value to minimum. */
+ if (tree_int_cst_compare (case_high, min_value) >= 0
+ && tree_int_cst_compare (case_low, min_value) < 0)
+ {
+ warning_at (loc, 0, "lower value in case label range"
+ " less than minimum value for type");
+ *outside_range_p = true;
+ case_low = min_value;
}
- return build_va_arg_1 (loc, type, expr);
-}
+ /* Saturate upper case label value to maximum. */
+ if (tree_int_cst_compare (case_low, max_value) <= 0
+ && tree_int_cst_compare (case_high, max_value) > 0)
+ {
+ warning_at (loc, 0, "upper value in case label range"
+ " exceeds maximum value for type");
+ *outside_range_p = true;
+ case_high = max_value;
+ }
+ if (*case_low_p != case_low)
+ *case_low_p = convert (type, case_low);
+ if (case_high_p && *case_high_p != case_high)
+ *case_high_p = convert (type, case_high);
-/* Linked list of disabled built-in functions. */
+ return true;
+}
+\f
+/* Return an integer type with BITS bits of precision,
+ that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
-struct disabled_builtin
+tree
+c_common_type_for_size (unsigned int bits, int unsignedp)
{
- const char *name;
- struct disabled_builtin *next;
-};
-static disabled_builtin *disabled_builtins = NULL;
-
-static bool builtin_function_disabled_p (const char *);
-
-/* Disable a built-in function specified by -fno-builtin-NAME. If NAME
- begins with "__builtin_", give an error. */
+ int i;
-void
-disable_builtin_function (const char *name)
-{
- if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
- error ("cannot disable built-in function %qs", name);
- else
- {
- disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
- new_disabled_builtin->name = name;
- new_disabled_builtin->next = disabled_builtins;
- disabled_builtins = new_disabled_builtin;
- }
-}
+ if (bits == TYPE_PRECISION (integer_type_node))
+ return unsignedp ? unsigned_type_node : integer_type_node;
+ if (bits == TYPE_PRECISION (signed_char_type_node))
+ return unsignedp ? unsigned_char_type_node : signed_char_type_node;
-/* Return true if the built-in function NAME has been disabled, false
- otherwise. */
+ if (bits == TYPE_PRECISION (short_integer_type_node))
+ return unsignedp ? short_unsigned_type_node : short_integer_type_node;
-static bool
-builtin_function_disabled_p (const char *name)
-{
- disabled_builtin *p;
- for (p = disabled_builtins; p != NULL; p = p->next)
- {
- if (strcmp (name, p->name) == 0)
- return true;
- }
- return false;
-}
+ if (bits == TYPE_PRECISION (long_integer_type_node))
+ return unsignedp ? long_unsigned_type_node : long_integer_type_node;
+ if (bits == TYPE_PRECISION (long_long_integer_type_node))
+ return (unsignedp ? long_long_unsigned_type_node
+ : long_long_integer_type_node);
-/* Worker for DEF_BUILTIN.
- Possibly define a builtin function with one or two names.
- Does not declare a non-__builtin_ function if flag_no_builtin, or if
- nonansi_p and flag_no_nonansi_builtin. */
+ for (i = 0; i < NUM_INT_N_ENTS; i ++)
+ if (int_n_enabled_p[i]
+ && bits == int_n_data[i].bitsize)
+ return (unsignedp ? int_n_trees[i].unsigned_type
+ : int_n_trees[i].signed_type);
-static void
-def_builtin_1 (enum built_in_function fncode,
- const char *name,
- enum built_in_class fnclass,
- tree fntype, tree libtype,
- bool both_p, bool fallback_p, bool nonansi_p,
- tree fnattrs, bool implicit_p)
-{
- tree decl;
- const char *libname;
+ if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
+ return (unsignedp ? widest_unsigned_literal_type_node
+ : widest_integer_literal_type_node);
- if (fntype == error_mark_node)
- return;
+ if (bits <= TYPE_PRECISION (intQI_type_node))
+ return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
- gcc_assert ((!both_p && !fallback_p)
- || !strncmp (name, "__builtin_",
- strlen ("__builtin_")));
+ if (bits <= TYPE_PRECISION (intHI_type_node))
+ return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
- libname = name + strlen ("__builtin_");
- decl = add_builtin_function (name, fntype, fncode, fnclass,
- (fallback_p ? libname : NULL),
- fnattrs);
+ if (bits <= TYPE_PRECISION (intSI_type_node))
+ return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
- set_builtin_decl (fncode, decl, implicit_p);
+ if (bits <= TYPE_PRECISION (intDI_type_node))
+ return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
- if (both_p
- && !flag_no_builtin && !builtin_function_disabled_p (libname)
- && !(nonansi_p && flag_no_nonansi_builtin))
- add_builtin_function (libname, libtype, fncode, fnclass,
- NULL, fnattrs);
+ return NULL_TREE;
}
-\f
-/* Nonzero if the type T promotes to int. This is (nearly) the
- integral promotions defined in ISO C99 6.3.1.1/2. */
-bool
-c_promoting_integer_type_p (const_tree t)
-{
- switch (TREE_CODE (t))
- {
- case INTEGER_TYPE:
- return (TYPE_MAIN_VARIANT (t) == char_type_node
- || TYPE_MAIN_VARIANT (t) == signed_char_type_node
- || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
- || TYPE_MAIN_VARIANT (t) == short_integer_type_node
- || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
- || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
+/* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
+ that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
+ and saturating if SATP is nonzero, otherwise not saturating. */
- case ENUMERAL_TYPE:
- /* ??? Technically all enumerations not larger than an int
- promote to an int. But this is used along code paths
- that only want to notice a size change. */
- return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
+tree
+c_common_fixed_point_type_for_size (unsigned int ibit, unsigned int fbit,
+ int unsignedp, int satp)
+{
+ enum mode_class mclass;
+ if (ibit == 0)
+ mclass = unsignedp ? MODE_UFRACT : MODE_FRACT;
+ else
+ mclass = unsignedp ? MODE_UACCUM : MODE_ACCUM;
- case BOOLEAN_TYPE:
- return 1;
+ opt_scalar_mode opt_mode;
+ scalar_mode mode;
+ FOR_EACH_MODE_IN_CLASS (opt_mode, mclass)
+ {
+ mode = opt_mode.require ();
+ if (GET_MODE_IBIT (mode) >= ibit && GET_MODE_FBIT (mode) >= fbit)
+ break;
+ }
- default:
- return 0;
+ if (!opt_mode.exists (&mode) || !targetm.scalar_mode_supported_p (mode))
+ {
+ sorry ("GCC cannot support operators with integer types and "
+ "fixed-point types that have too many integral and "
+ "fractional bits together");
+ return NULL_TREE;
}
+
+ return c_common_type_for_mode (mode, satp);
}
-/* Return 1 if PARMS specifies a fixed number of parameters
- and none of their types is affected by default promotions. */
+/* Used for communication between c_common_type_for_mode and
+ c_register_builtin_type. */
+tree registered_builtin_types;
-int
-self_promoting_args_p (const_tree parms)
-{
- const_tree t;
- for (t = parms; t; t = TREE_CHAIN (t))
- {
- tree type = TREE_VALUE (t);
+/* Return a data type that has machine mode MODE.
+ If the mode is an integer,
+ then UNSIGNEDP selects between signed and unsigned types.
+ If the mode is a fixed-point mode,
+ then UNSIGNEDP selects between saturating and nonsaturating types. */
+
+tree
+c_common_type_for_mode (machine_mode mode, int unsignedp)
+{
+ tree t;
+ int i;
- if (type == error_mark_node)
- continue;
+ if (mode == TYPE_MODE (integer_type_node))
+ return unsignedp ? unsigned_type_node : integer_type_node;
- if (TREE_CHAIN (t) == 0 && type != void_type_node)
- return 0;
+ if (mode == TYPE_MODE (signed_char_type_node))
+ return unsignedp ? unsigned_char_type_node : signed_char_type_node;
- if (type == 0)
- return 0;
+ if (mode == TYPE_MODE (short_integer_type_node))
+ return unsignedp ? short_unsigned_type_node : short_integer_type_node;
- if (TYPE_MAIN_VARIANT (type) == float_type_node)
- return 0;
+ if (mode == TYPE_MODE (long_integer_type_node))
+ return unsignedp ? long_unsigned_type_node : long_integer_type_node;
- if (c_promoting_integer_type_p (type))
- return 0;
- }
- return 1;
-}
+ if (mode == TYPE_MODE (long_long_integer_type_node))
+ return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
-/* Recursively remove any '*' or '&' operator from TYPE. */
-tree
-strip_pointer_operator (tree t)
-{
- while (POINTER_TYPE_P (t))
- t = TREE_TYPE (t);
- return t;
-}
+ for (i = 0; i < NUM_INT_N_ENTS; i ++)
+ if (int_n_enabled_p[i]
+ && mode == int_n_data[i].m)
+ return (unsignedp ? int_n_trees[i].unsigned_type
+ : int_n_trees[i].signed_type);
-/* Recursively remove pointer or array type from TYPE. */
-tree
-strip_pointer_or_array_types (tree t)
-{
- while (TREE_CODE (t) == ARRAY_TYPE || POINTER_TYPE_P (t))
- t = TREE_TYPE (t);
- return t;
-}
+ if (mode == QImode)
+ return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
-/* Used to compare case labels. K1 and K2 are actually tree nodes
- representing case labels, or NULL_TREE for a `default' label.
- Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
- K2, and 0 if K1 and K2 are equal. */
+ if (mode == HImode)
+ return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
-int
-case_compare (splay_tree_key k1, splay_tree_key k2)
-{
- /* Consider a NULL key (such as arises with a `default' label) to be
- smaller than anything else. */
- if (!k1)
- return k2 ? -1 : 0;
- else if (!k2)
- return k1 ? 1 : 0;
+ if (mode == SImode)
+ return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
- return tree_int_cst_compare ((tree) k1, (tree) k2);
-}
+ if (mode == DImode)
+ return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
-/* Process a case label, located at LOC, for the range LOW_VALUE
- ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
- then this case label is actually a `default' label. If only
- HIGH_VALUE is NULL_TREE, then case label was declared using the
- usual C/C++ syntax, rather than the GNU case range extension.
- CASES is a tree containing all the case ranges processed so far;
- COND is the condition for the switch-statement itself.
- OUTSIDE_RANGE_P says whether there was a case value that doesn't
- fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
- created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
+#if HOST_BITS_PER_WIDE_INT >= 64
+ if (mode == TYPE_MODE (intTI_type_node))
+ return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
+#endif
-tree
-c_add_case_label (location_t loc, splay_tree cases, tree cond, tree orig_type,
- tree low_value, tree high_value, bool *outside_range_p)
-{
- tree type;
- tree label;
- tree case_label;
- splay_tree_node node;
+ if (mode == TYPE_MODE (float_type_node))
+ return float_type_node;
- /* Create the LABEL_DECL itself. */
- label = create_artificial_label (loc);
+ if (mode == TYPE_MODE (double_type_node))
+ return double_type_node;
- /* If there was an error processing the switch condition, bail now
- before we get more confused. */
- if (!cond || cond == error_mark_node)
- goto error_out;
+ if (mode == TYPE_MODE (long_double_type_node))
+ return long_double_type_node;
- if ((low_value && TREE_TYPE (low_value)
- && POINTER_TYPE_P (TREE_TYPE (low_value)))
- || (high_value && TREE_TYPE (high_value)
- && POINTER_TYPE_P (TREE_TYPE (high_value))))
- {
- error_at (loc, "pointers are not permitted as case values");
- goto error_out;
- }
+ for (i = 0; i < NUM_FLOATN_NX_TYPES; i++)
+ if (FLOATN_NX_TYPE_NODE (i) != NULL_TREE
+ && mode == TYPE_MODE (FLOATN_NX_TYPE_NODE (i)))
+ return FLOATN_NX_TYPE_NODE (i);
- /* Case ranges are a GNU extension. */
- if (high_value)
- pedwarn (loc, OPT_Wpedantic,
- "range expressions in switch statements are non-standard");
+ if (mode == TYPE_MODE (void_type_node))
+ return void_type_node;
- type = TREE_TYPE (cond);
- if (low_value)
- {
- low_value = check_case_value (loc, low_value);
- low_value = convert_and_check (loc, type, low_value);
- if (low_value == error_mark_node)
- goto error_out;
- }
- if (high_value)
+ if (mode == TYPE_MODE (build_pointer_type (char_type_node))
+ || mode == TYPE_MODE (build_pointer_type (integer_type_node)))
{
- high_value = check_case_value (loc, high_value);
- high_value = convert_and_check (loc, type, high_value);
- if (high_value == error_mark_node)
- goto error_out;
+ unsigned int precision
+ = GET_MODE_PRECISION (as_a <scalar_int_mode> (mode));
+ return (unsignedp
+ ? make_unsigned_type (precision)
+ : make_signed_type (precision));
}
- if (low_value && high_value)
+ if (COMPLEX_MODE_P (mode))
{
- /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
- really a case range, even though it was written that way.
- Remove the HIGH_VALUE to simplify later processing. */
- if (tree_int_cst_equal (low_value, high_value))
- high_value = NULL_TREE;
- else if (!tree_int_cst_lt (low_value, high_value))
- warning_at (loc, 0, "empty range specified");
- }
+ machine_mode inner_mode;
+ tree inner_type;
- /* See if the case is in range of the type of the original testing
- expression. If both low_value and high_value are out of range,
- don't insert the case label and return NULL_TREE. */
- if (low_value
- && !check_case_bounds (loc, type, orig_type,
- &low_value, high_value ? &high_value : NULL,
- outside_range_p))
- return NULL_TREE;
+ if (mode == TYPE_MODE (complex_float_type_node))
+ return complex_float_type_node;
+ if (mode == TYPE_MODE (complex_double_type_node))
+ return complex_double_type_node;
+ if (mode == TYPE_MODE (complex_long_double_type_node))
+ return complex_long_double_type_node;
- /* Look up the LOW_VALUE in the table of case labels we already
- have. */
- node = splay_tree_lookup (cases, (splay_tree_key) low_value);
- /* If there was not an exact match, check for overlapping ranges.
- There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
- that's a `default' label and the only overlap is an exact match. */
- if (!node && (low_value || high_value))
- {
- splay_tree_node low_bound;
- splay_tree_node high_bound;
+ for (i = 0; i < NUM_FLOATN_NX_TYPES; i++)
+ if (COMPLEX_FLOATN_NX_TYPE_NODE (i) != NULL_TREE
+ && mode == TYPE_MODE (COMPLEX_FLOATN_NX_TYPE_NODE (i)))
+ return COMPLEX_FLOATN_NX_TYPE_NODE (i);
- /* Even though there wasn't an exact match, there might be an
- overlap between this case range and another case range.
- Since we've (inductively) not allowed any overlapping case
- ranges, we simply need to find the greatest low case label
- that is smaller that LOW_VALUE, and the smallest low case
- label that is greater than LOW_VALUE. If there is an overlap
- it will occur in one of these two ranges. */
- low_bound = splay_tree_predecessor (cases,
- (splay_tree_key) low_value);
- high_bound = splay_tree_successor (cases,
- (splay_tree_key) low_value);
+ if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp)
+ return complex_integer_type_node;
- /* Check to see if the LOW_BOUND overlaps. It is smaller than
- the LOW_VALUE, so there is no need to check unless the
- LOW_BOUND is in fact itself a case range. */
- if (low_bound
- && CASE_HIGH ((tree) low_bound->value)
- && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
- low_value) >= 0)
- node = low_bound;
- /* Check to see if the HIGH_BOUND overlaps. The low end of that
- range is bigger than the low end of the current range, so we
- are only interested if the current range is a real range, and
- not an ordinary case label. */
- else if (high_bound
- && high_value
- && (tree_int_cst_compare ((tree) high_bound->key,
- high_value)
- <= 0))
- node = high_bound;
+ inner_mode = GET_MODE_INNER (mode);
+ inner_type = c_common_type_for_mode (inner_mode, unsignedp);
+ if (inner_type != NULL_TREE)
+ return build_complex_type (inner_type);
}
- /* If there was an overlap, issue an error. */
- if (node)
+ else if (VECTOR_MODE_P (mode))
{
- tree duplicate = CASE_LABEL ((tree) node->value);
-
- if (high_value)
- {
- error_at (loc, "duplicate (or overlapping) case value");
- error_at (DECL_SOURCE_LOCATION (duplicate),
- "this is the first entry overlapping that value");
- }
- else if (low_value)
- {
- error_at (loc, "duplicate case value") ;
- error_at (DECL_SOURCE_LOCATION (duplicate), "previously used here");
- }
- else
- {
- error_at (loc, "multiple default labels in one switch");
- error_at (DECL_SOURCE_LOCATION (duplicate),
- "this is the first default label");
- }
- goto error_out;
+ machine_mode inner_mode = GET_MODE_INNER (mode);
+ tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
+ if (inner_type != NULL_TREE)
+ return build_vector_type_for_mode (inner_type, mode);
}
- /* Add a CASE_LABEL to the statement-tree. */
- case_label = add_stmt (build_case_label (low_value, high_value, label));
- /* Register this case label in the splay tree. */
- splay_tree_insert (cases,
- (splay_tree_key) low_value,
- (splay_tree_value) case_label);
+ if (mode == TYPE_MODE (dfloat32_type_node))
+ return dfloat32_type_node;
+ if (mode == TYPE_MODE (dfloat64_type_node))
+ return dfloat64_type_node;
+ if (mode == TYPE_MODE (dfloat128_type_node))
+ return dfloat128_type_node;
+
+ if (ALL_SCALAR_FIXED_POINT_MODE_P (mode))
+ {
+ if (mode == TYPE_MODE (short_fract_type_node))
+ return unsignedp ? sat_short_fract_type_node : short_fract_type_node;
+ if (mode == TYPE_MODE (fract_type_node))
+ return unsignedp ? sat_fract_type_node : fract_type_node;
+ if (mode == TYPE_MODE (long_fract_type_node))
+ return unsignedp ? sat_long_fract_type_node : long_fract_type_node;
+ if (mode == TYPE_MODE (long_long_fract_type_node))
+ return unsignedp ? sat_long_long_fract_type_node
+ : long_long_fract_type_node;
+
+ if (mode == TYPE_MODE (unsigned_short_fract_type_node))
+ return unsignedp ? sat_unsigned_short_fract_type_node
+ : unsigned_short_fract_type_node;
+ if (mode == TYPE_MODE (unsigned_fract_type_node))
+ return unsignedp ? sat_unsigned_fract_type_node
+ : unsigned_fract_type_node;
+ if (mode == TYPE_MODE (unsigned_long_fract_type_node))
+ return unsignedp ? sat_unsigned_long_fract_type_node
+ : unsigned_long_fract_type_node;
+ if (mode == TYPE_MODE (unsigned_long_long_fract_type_node))
+ return unsignedp ? sat_unsigned_long_long_fract_type_node
+ : unsigned_long_long_fract_type_node;
+
+ if (mode == TYPE_MODE (short_accum_type_node))
+ return unsignedp ? sat_short_accum_type_node : short_accum_type_node;
+ if (mode == TYPE_MODE (accum_type_node))
+ return unsignedp ? sat_accum_type_node : accum_type_node;
+ if (mode == TYPE_MODE (long_accum_type_node))
+ return unsignedp ? sat_long_accum_type_node : long_accum_type_node;
+ if (mode == TYPE_MODE (long_long_accum_type_node))
+ return unsignedp ? sat_long_long_accum_type_node
+ : long_long_accum_type_node;
+
+ if (mode == TYPE_MODE (unsigned_short_accum_type_node))
+ return unsignedp ? sat_unsigned_short_accum_type_node
+ : unsigned_short_accum_type_node;
+ if (mode == TYPE_MODE (unsigned_accum_type_node))
+ return unsignedp ? sat_unsigned_accum_type_node
+ : unsigned_accum_type_node;
+ if (mode == TYPE_MODE (unsigned_long_accum_type_node))
+ return unsignedp ? sat_unsigned_long_accum_type_node
+ : unsigned_long_accum_type_node;
+ if (mode == TYPE_MODE (unsigned_long_long_accum_type_node))
+ return unsignedp ? sat_unsigned_long_long_accum_type_node
+ : unsigned_long_long_accum_type_node;
- return case_label;
+ if (mode == QQmode)
+ return unsignedp ? sat_qq_type_node : qq_type_node;
+ if (mode == HQmode)
+ return unsignedp ? sat_hq_type_node : hq_type_node;
+ if (mode == SQmode)
+ return unsignedp ? sat_sq_type_node : sq_type_node;
+ if (mode == DQmode)
+ return unsignedp ? sat_dq_type_node : dq_type_node;
+ if (mode == TQmode)
+ return unsignedp ? sat_tq_type_node : tq_type_node;
- error_out:
- /* Add a label so that the back-end doesn't think that the beginning of
- the switch is unreachable. Note that we do not add a case label, as
- that just leads to duplicates and thence to failure later on. */
- if (!cases->root)
- {
- tree t = create_artificial_label (loc);
- add_stmt (build_stmt (loc, LABEL_EXPR, t));
- }
- return error_mark_node;
-}
+ if (mode == UQQmode)
+ return unsignedp ? sat_uqq_type_node : uqq_type_node;
+ if (mode == UHQmode)
+ return unsignedp ? sat_uhq_type_node : uhq_type_node;
+ if (mode == USQmode)
+ return unsignedp ? sat_usq_type_node : usq_type_node;
+ if (mode == UDQmode)
+ return unsignedp ? sat_udq_type_node : udq_type_node;
+ if (mode == UTQmode)
+ return unsignedp ? sat_utq_type_node : utq_type_node;
-/* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
- Used to verify that case values match up with enumerator values. */
+ if (mode == HAmode)
+ return unsignedp ? sat_ha_type_node : ha_type_node;
+ if (mode == SAmode)
+ return unsignedp ? sat_sa_type_node : sa_type_node;
+ if (mode == DAmode)
+ return unsignedp ? sat_da_type_node : da_type_node;
+ if (mode == TAmode)
+ return unsignedp ? sat_ta_type_node : ta_type_node;
-static void
-match_case_to_enum_1 (tree key, tree type, tree label)
-{
- char buf[WIDE_INT_PRINT_BUFFER_SIZE];
+ if (mode == UHAmode)
+ return unsignedp ? sat_uha_type_node : uha_type_node;
+ if (mode == USAmode)
+ return unsignedp ? sat_usa_type_node : usa_type_node;
+ if (mode == UDAmode)
+ return unsignedp ? sat_uda_type_node : uda_type_node;
+ if (mode == UTAmode)
+ return unsignedp ? sat_uta_type_node : uta_type_node;
+ }
- if (tree_fits_uhwi_p (key))
- print_dec (key, buf, UNSIGNED);
- else if (tree_fits_shwi_p (key))
- print_dec (key, buf, SIGNED);
- else
- print_hex (key, buf);
+ for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
+ if (TYPE_MODE (TREE_VALUE (t)) == mode
+ && !!unsignedp == !!TYPE_UNSIGNED (TREE_VALUE (t)))
+ return TREE_VALUE (t);
- if (TYPE_NAME (type) == 0)
- warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label)),
- warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
- "case value %qs not in enumerated type",
- buf);
- else
- warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label)),
- warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
- "case value %qs not in enumerated type %qT",
- buf, type);
+ return NULL_TREE;
}
-/* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
- Used to verify that case values match up with enumerator values. */
-
-static int
-match_case_to_enum (splay_tree_node node, void *data)
+tree
+c_common_unsigned_type (tree type)
{
- tree label = (tree) node->value;
- tree type = (tree) data;
-
- /* Skip default case. */
- if (!CASE_LOW (label))
- return 0;
-
- /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
- when we did our enum->case scan. Reset our scratch bit after. */
- if (!CASE_LOW_SEEN (label))
- match_case_to_enum_1 (CASE_LOW (label), type, label);
- else
- CASE_LOW_SEEN (label) = 0;
+ return c_common_signed_or_unsigned_type (1, type);
+}
- /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
- not set, that means that CASE_HIGH did not appear when we did our
- enum->case scan. Reset our scratch bit after. */
- if (CASE_HIGH (label))
- {
- if (!CASE_HIGH_SEEN (label))
- match_case_to_enum_1 (CASE_HIGH (label), type, label);
- else
- CASE_HIGH_SEEN (label) = 0;
- }
+/* Return a signed type the same as TYPE in other respects. */
- return 0;
+tree
+c_common_signed_type (tree type)
+{
+ return c_common_signed_or_unsigned_type (0, type);
}
-/* Handle -Wswitch*. Called from the front end after parsing the
- switch construct. */
-/* ??? Should probably be somewhere generic, since other languages
- besides C and C++ would want this. At the moment, however, C/C++
- are the only tree-ssa languages that support enumerations at all,
- so the point is moot. */
+/* Return a type the same as TYPE except unsigned or
+ signed according to UNSIGNEDP. */
-void
-c_do_switch_warnings (splay_tree cases, location_t switch_location,
- tree type, tree cond, bool bool_cond_p,
- bool outside_range_p)
+tree
+c_common_signed_or_unsigned_type (int unsignedp, tree type)
{
- splay_tree_node default_node;
- splay_tree_node node;
- tree chain;
+ tree type1;
+ int i;
- if (!warn_switch && !warn_switch_enum && !warn_switch_default
- && !warn_switch_bool)
- return;
+ /* This block of code emulates the behavior of the old
+ c_common_unsigned_type. In particular, it returns
+ long_unsigned_type_node if passed a long, even when a int would
+ have the same size. This is necessary for warnings to work
+ correctly in archs where sizeof(int) == sizeof(long) */
- default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
- if (!default_node)
- warning_at (switch_location, OPT_Wswitch_default,
- "switch missing default case");
-
- /* There are certain cases where -Wswitch-bool warnings aren't
- desirable, such as
- switch (boolean)
- {
- case true: ...
- case false: ...
- }
- so be careful here. */
- if (warn_switch_bool && bool_cond_p)
- {
- splay_tree_node min_node;
- /* If there's a default node, it's also the value with the minimal
- key. So look at the penultimate key (if any). */
- if (default_node)
- min_node = splay_tree_successor (cases, (splay_tree_key) NULL);
- else
- min_node = splay_tree_min (cases);
- tree min = min_node ? (tree) min_node->key : NULL_TREE;
-
- splay_tree_node max_node = splay_tree_max (cases);
- /* This might be a case range, so look at the value with the
- maximal key and then check CASE_HIGH. */
- tree max = max_node ? (tree) max_node->value : NULL_TREE;
- if (max)
- max = CASE_HIGH (max) ? CASE_HIGH (max) : CASE_LOW (max);
-
- /* If there's a case value > 1 or < 0, that is outside bool
- range, warn. */
- if (outside_range_p
- || (max && wi::gts_p (max, 1))
- || (min && wi::lts_p (min, 0))
- /* And handle the
- switch (boolean)
- {
- case true: ...
- case false: ...
- default: ...
- }
- case, where we want to warn. */
- || (default_node
- && max && wi::eq_p (max, 1)
- && min && wi::eq_p (min, 0)))
- warning_at (switch_location, OPT_Wswitch_bool,
- "switch condition has boolean value");
- }
-
- /* From here on, we only care about enumerated types. */
- if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
- return;
+ type1 = TYPE_MAIN_VARIANT (type);
+ if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
+ return unsignedp ? unsigned_char_type_node : signed_char_type_node;
+ if (type1 == integer_type_node || type1 == unsigned_type_node)
+ return unsignedp ? unsigned_type_node : integer_type_node;
+ if (type1 == short_integer_type_node || type1 == short_unsigned_type_node)
+ return unsignedp ? short_unsigned_type_node : short_integer_type_node;
+ if (type1 == long_integer_type_node || type1 == long_unsigned_type_node)
+ return unsignedp ? long_unsigned_type_node : long_integer_type_node;
+ if (type1 == long_long_integer_type_node || type1 == long_long_unsigned_type_node)
+ return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
- /* From here on, we only care about -Wswitch and -Wswitch-enum. */
- if (!warn_switch_enum && !warn_switch)
- return;
+ for (i = 0; i < NUM_INT_N_ENTS; i ++)
+ if (int_n_enabled_p[i]
+ && (type1 == int_n_trees[i].unsigned_type
+ || type1 == int_n_trees[i].signed_type))
+ return (unsignedp ? int_n_trees[i].unsigned_type
+ : int_n_trees[i].signed_type);
- /* Check the cases. Warn about case values which are not members of
- the enumerated type. For -Wswitch-enum, or for -Wswitch when
- there is no default case, check that exactly all enumeration
- literals are covered by the cases. */
+#if HOST_BITS_PER_WIDE_INT >= 64
+ if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node)
+ return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
+#endif
+ if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node)
+ return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
+ if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node)
+ return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
+ if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node)
+ return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
+ if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node)
+ return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
- /* Clearing COND if it is not an integer constant simplifies
- the tests inside the loop below. */
- if (TREE_CODE (cond) != INTEGER_CST)
- cond = NULL_TREE;
+#define C_COMMON_FIXED_TYPES(NAME) \
+ if (type1 == short_ ## NAME ## _type_node \
+ || type1 == unsigned_short_ ## NAME ## _type_node) \
+ return unsignedp ? unsigned_short_ ## NAME ## _type_node \
+ : short_ ## NAME ## _type_node; \
+ if (type1 == NAME ## _type_node \
+ || type1 == unsigned_ ## NAME ## _type_node) \
+ return unsignedp ? unsigned_ ## NAME ## _type_node \
+ : NAME ## _type_node; \
+ if (type1 == long_ ## NAME ## _type_node \
+ || type1 == unsigned_long_ ## NAME ## _type_node) \
+ return unsignedp ? unsigned_long_ ## NAME ## _type_node \
+ : long_ ## NAME ## _type_node; \
+ if (type1 == long_long_ ## NAME ## _type_node \
+ || type1 == unsigned_long_long_ ## NAME ## _type_node) \
+ return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
+ : long_long_ ## NAME ## _type_node;
- /* The time complexity here is O(N*lg(N)) worst case, but for the
- common case of monotonically increasing enumerators, it is
- O(N), since the nature of the splay tree will keep the next
- element adjacent to the root at all times. */
+#define C_COMMON_FIXED_MODE_TYPES(NAME) \
+ if (type1 == NAME ## _type_node \
+ || type1 == u ## NAME ## _type_node) \
+ return unsignedp ? u ## NAME ## _type_node \
+ : NAME ## _type_node;
- for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
- {
- tree value = TREE_VALUE (chain);
- if (TREE_CODE (value) == CONST_DECL)
- value = DECL_INITIAL (value);
- node = splay_tree_lookup (cases, (splay_tree_key) value);
- if (node)
- {
- /* Mark the CASE_LOW part of the case entry as seen. */
- tree label = (tree) node->value;
- CASE_LOW_SEEN (label) = 1;
- continue;
- }
+#define C_COMMON_FIXED_TYPES_SAT(NAME) \
+ if (type1 == sat_ ## short_ ## NAME ## _type_node \
+ || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
+ return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
+ : sat_ ## short_ ## NAME ## _type_node; \
+ if (type1 == sat_ ## NAME ## _type_node \
+ || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
+ return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
+ : sat_ ## NAME ## _type_node; \
+ if (type1 == sat_ ## long_ ## NAME ## _type_node \
+ || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
+ return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
+ : sat_ ## long_ ## NAME ## _type_node; \
+ if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
+ || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
+ return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
+ : sat_ ## long_long_ ## NAME ## _type_node;
- /* Even though there wasn't an exact match, there might be a
- case range which includes the enumerator's value. */
- node = splay_tree_predecessor (cases, (splay_tree_key) value);
- if (node && CASE_HIGH ((tree) node->value))
- {
- tree label = (tree) node->value;
- int cmp = tree_int_cst_compare (CASE_HIGH (label), value);
- if (cmp >= 0)
- {
- /* If we match the upper bound exactly, mark the CASE_HIGH
- part of the case entry as seen. */
- if (cmp == 0)
- CASE_HIGH_SEEN (label) = 1;
- continue;
- }
- }
+#define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
+ if (type1 == sat_ ## NAME ## _type_node \
+ || type1 == sat_ ## u ## NAME ## _type_node) \
+ return unsignedp ? sat_ ## u ## NAME ## _type_node \
+ : sat_ ## NAME ## _type_node;
- /* We've now determined that this enumerated literal isn't
- handled by the case labels of the switch statement. */
+ C_COMMON_FIXED_TYPES (fract);
+ C_COMMON_FIXED_TYPES_SAT (fract);
+ C_COMMON_FIXED_TYPES (accum);
+ C_COMMON_FIXED_TYPES_SAT (accum);
- /* If the switch expression is a constant, we only really care
- about whether that constant is handled by the switch. */
- if (cond && tree_int_cst_compare (cond, value))
- continue;
+ C_COMMON_FIXED_MODE_TYPES (qq);
+ C_COMMON_FIXED_MODE_TYPES (hq);
+ C_COMMON_FIXED_MODE_TYPES (sq);
+ C_COMMON_FIXED_MODE_TYPES (dq);
+ C_COMMON_FIXED_MODE_TYPES (tq);
+ C_COMMON_FIXED_MODE_TYPES_SAT (qq);
+ C_COMMON_FIXED_MODE_TYPES_SAT (hq);
+ C_COMMON_FIXED_MODE_TYPES_SAT (sq);
+ C_COMMON_FIXED_MODE_TYPES_SAT (dq);
+ C_COMMON_FIXED_MODE_TYPES_SAT (tq);
+ C_COMMON_FIXED_MODE_TYPES (ha);
+ C_COMMON_FIXED_MODE_TYPES (sa);
+ C_COMMON_FIXED_MODE_TYPES (da);
+ C_COMMON_FIXED_MODE_TYPES (ta);
+ C_COMMON_FIXED_MODE_TYPES_SAT (ha);
+ C_COMMON_FIXED_MODE_TYPES_SAT (sa);
+ C_COMMON_FIXED_MODE_TYPES_SAT (da);
+ C_COMMON_FIXED_MODE_TYPES_SAT (ta);
- /* If there is a default_node, the only relevant option is
- Wswitch-enum. Otherwise, if both are enabled then we prefer
- to warn using -Wswitch because -Wswitch is enabled by -Wall
- while -Wswitch-enum is explicit. */
- warning_at (switch_location,
- (default_node || !warn_switch
- ? OPT_Wswitch_enum
- : OPT_Wswitch),
- "enumeration value %qE not handled in switch",
- TREE_PURPOSE (chain));
- }
+ /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
+ the precision; they have precision set to match their range, but
+ may use a wider mode to match an ABI. If we change modes, we may
+ wind up with bad conversions. For INTEGER_TYPEs in C, must check
+ the precision as well, so as to yield correct results for
+ bit-field types. C++ does not have these separate bit-field
+ types, and producing a signed or unsigned variant of an
+ ENUMERAL_TYPE may cause other problems as well. */
+
+ if (!INTEGRAL_TYPE_P (type)
+ || TYPE_UNSIGNED (type) == unsignedp)
+ return type;
+
+#define TYPE_OK(node) \
+ (TYPE_MODE (type) == TYPE_MODE (node) \
+ && TYPE_PRECISION (type) == TYPE_PRECISION (node))
+ if (TYPE_OK (signed_char_type_node))
+ return unsignedp ? unsigned_char_type_node : signed_char_type_node;
+ if (TYPE_OK (integer_type_node))
+ return unsignedp ? unsigned_type_node : integer_type_node;
+ if (TYPE_OK (short_integer_type_node))
+ return unsignedp ? short_unsigned_type_node : short_integer_type_node;
+ if (TYPE_OK (long_integer_type_node))
+ return unsignedp ? long_unsigned_type_node : long_integer_type_node;
+ if (TYPE_OK (long_long_integer_type_node))
+ return (unsignedp ? long_long_unsigned_type_node
+ : long_long_integer_type_node);
- /* Warn if there are case expressions that don't correspond to
- enumerators. This can occur since C and C++ don't enforce
- type-checking of assignments to enumeration variables.
+ for (i = 0; i < NUM_INT_N_ENTS; i ++)
+ if (int_n_enabled_p[i]
+ && TYPE_MODE (type) == int_n_data[i].m
+ && TYPE_PRECISION (type) == int_n_data[i].bitsize)
+ return (unsignedp ? int_n_trees[i].unsigned_type
+ : int_n_trees[i].signed_type);
- The time complexity here is now always O(N) worst case, since
- we should have marked both the lower bound and upper bound of
- every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
- above. This scan also resets those fields. */
+#if HOST_BITS_PER_WIDE_INT >= 64
+ if (TYPE_OK (intTI_type_node))
+ return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
+#endif
+ if (TYPE_OK (intDI_type_node))
+ return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
+ if (TYPE_OK (intSI_type_node))
+ return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
+ if (TYPE_OK (intHI_type_node))
+ return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
+ if (TYPE_OK (intQI_type_node))
+ return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
+#undef TYPE_OK
- splay_tree_foreach (cases, match_case_to_enum, type);
+ return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
}
-/* Finish an expression taking the address of LABEL (an
- IDENTIFIER_NODE). Returns an expression for the address.
-
- LOC is the location for the expression returned. */
+/* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
tree
-finish_label_address_expr (tree label, location_t loc)
+c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp)
{
- tree result;
+ int i;
- pedwarn (input_location, OPT_Wpedantic, "taking the address of a label is non-standard");
+ /* Extended integer types of the same width as a standard type have
+ lesser rank, so those of the same width as int promote to int or
+ unsigned int and are valid for printf formats expecting int or
+ unsigned int. To avoid such special cases, avoid creating
+ extended integer types for bit-fields if a standard integer type
+ is available. */
+ if (width == TYPE_PRECISION (integer_type_node))
+ return unsignedp ? unsigned_type_node : integer_type_node;
+ if (width == TYPE_PRECISION (signed_char_type_node))
+ return unsignedp ? unsigned_char_type_node : signed_char_type_node;
+ if (width == TYPE_PRECISION (short_integer_type_node))
+ return unsignedp ? short_unsigned_type_node : short_integer_type_node;
+ if (width == TYPE_PRECISION (long_integer_type_node))
+ return unsignedp ? long_unsigned_type_node : long_integer_type_node;
+ if (width == TYPE_PRECISION (long_long_integer_type_node))
+ return (unsignedp ? long_long_unsigned_type_node
+ : long_long_integer_type_node);
+ for (i = 0; i < NUM_INT_N_ENTS; i ++)
+ if (int_n_enabled_p[i]
+ && width == int_n_data[i].bitsize)
+ return (unsignedp ? int_n_trees[i].unsigned_type
+ : int_n_trees[i].signed_type);
+ return build_nonstandard_integer_type (width, unsignedp);
+}
- if (label == error_mark_node)
- return error_mark_node;
+/* The C version of the register_builtin_type langhook. */
- label = lookup_label (label);
- if (label == NULL_TREE)
- result = null_pointer_node;
- else
- {
- TREE_USED (label) = 1;
- result = build1 (ADDR_EXPR, ptr_type_node, label);
- /* The current function is not necessarily uninlinable.
- Computed gotos are incompatible with inlining, but the value
- here could be used only in a diagnostic, for example. */
- protected_set_expr_location (result, loc);
- }
+void
+c_register_builtin_type (tree type, const char* name)
+{
+ tree decl;
- return result;
+ decl = build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL, get_identifier (name), type);
+ DECL_ARTIFICIAL (decl) = 1;
+ if (!TYPE_NAME (type))
+ TYPE_NAME (type) = decl;
+ lang_hooks.decls.pushdecl (decl);
+
+ registered_builtin_types = tree_cons (0, type, registered_builtin_types);
}
\f
+/* Print an error message for invalid operands to arith operation
+ CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
+ RICHLOC is a rich location for the message, containing either
+ three separate locations for each of the operator and operands
-/* Given a boolean expression ARG, return a tree representing an increment
- or decrement (as indicated by CODE) of ARG. The front end must check for
- invalid cases (e.g., decrement in C++). */
-tree
-boolean_increment (enum tree_code code, tree arg)
+ lhs op rhs
+ ~~~ ^~ ~~~
+
+ (C FE), or one location ranging over all over them
+
+ lhs op rhs
+ ~~~~^~~~~~
+
+ (C++ FE). */
+
+void
+binary_op_error (rich_location *richloc, enum tree_code code,
+ tree type0, tree type1)
{
- tree val;
- tree true_res = build_int_cst (TREE_TYPE (arg), 1);
+ const char *opname;
- arg = stabilize_reference (arg);
switch (code)
{
- case PREINCREMENT_EXPR:
- val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
- break;
- case POSTINCREMENT_EXPR:
- val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
- arg = save_expr (arg);
- val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
- val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
- break;
- case PREDECREMENT_EXPR:
- val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
- invert_truthvalue_loc (input_location, arg));
- break;
- case POSTDECREMENT_EXPR:
- val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
- invert_truthvalue_loc (input_location, arg));
- arg = save_expr (arg);
- val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
- val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
- break;
+ case PLUS_EXPR:
+ opname = "+"; break;
+ case MINUS_EXPR:
+ opname = "-"; break;
+ case MULT_EXPR:
+ opname = "*"; break;
+ case MAX_EXPR:
+ opname = "max"; break;
+ case MIN_EXPR:
+ opname = "min"; break;
+ case EQ_EXPR:
+ opname = "=="; break;
+ case NE_EXPR:
+ opname = "!="; break;
+ case LE_EXPR:
+ opname = "<="; break;
+ case GE_EXPR:
+ opname = ">="; break;
+ case LT_EXPR:
+ opname = "<"; break;
+ case GT_EXPR:
+ opname = ">"; break;
+ case LSHIFT_EXPR:
+ opname = "<<"; break;
+ case RSHIFT_EXPR:
+ opname = ">>"; break;
+ case TRUNC_MOD_EXPR:
+ case FLOOR_MOD_EXPR:
+ opname = "%"; break;
+ case TRUNC_DIV_EXPR:
+ case FLOOR_DIV_EXPR:
+ opname = "/"; break;
+ case BIT_AND_EXPR:
+ opname = "&"; break;
+ case BIT_IOR_EXPR:
+ opname = "|"; break;
+ case TRUTH_ANDIF_EXPR:
+ opname = "&&"; break;
+ case TRUTH_ORIF_EXPR:
+ opname = "||"; break;
+ case BIT_XOR_EXPR:
+ opname = "^"; break;
default:
gcc_unreachable ();
}
- TREE_SIDE_EFFECTS (val) = 1;
- return val;
-}
-\f
-/* Built-in macros for stddef.h and stdint.h, that require macros
- defined in this file. */
-void
-c_stddef_cpp_builtins(void)
-{
- builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
- builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
- builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
- builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
- builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
- builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
- builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE, 0);
- builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE, 0);
- if (SIG_ATOMIC_TYPE)
- builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE, 0);
- if (INT8_TYPE)
- builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE, 0);
- if (INT16_TYPE)
- builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE, 0);
- if (INT32_TYPE)
- builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE, 0);
- if (INT64_TYPE)
- builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE, 0);
- if (UINT8_TYPE)
- builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE, 0);
- if (UINT16_TYPE)
- builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE, 0);
- if (UINT32_TYPE)
- builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE, 0);
- if (UINT64_TYPE)
- builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE, 0);
- if (INT_LEAST8_TYPE)
- builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE, 0);
- if (INT_LEAST16_TYPE)
- builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE, 0);
- if (INT_LEAST32_TYPE)
- builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE, 0);
- if (INT_LEAST64_TYPE)
- builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE, 0);
- if (UINT_LEAST8_TYPE)
- builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE, 0);
- if (UINT_LEAST16_TYPE)
- builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE, 0);
- if (UINT_LEAST32_TYPE)
- builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE, 0);
- if (UINT_LEAST64_TYPE)
- builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE, 0);
- if (INT_FAST8_TYPE)
- builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE, 0);
- if (INT_FAST16_TYPE)
- builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE, 0);
- if (INT_FAST32_TYPE)
- builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE, 0);
- if (INT_FAST64_TYPE)
- builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE, 0);
- if (UINT_FAST8_TYPE)
- builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE, 0);
- if (UINT_FAST16_TYPE)
- builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE, 0);
- if (UINT_FAST32_TYPE)
- builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE, 0);
- if (UINT_FAST64_TYPE)
- builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE, 0);
- if (INTPTR_TYPE)
- builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE, 0);
- if (UINTPTR_TYPE)
- builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE, 0);
-}
-
-static void
-c_init_attributes (void)
-{
- /* Fill in the built_in_attributes array. */
-#define DEF_ATTR_NULL_TREE(ENUM) \
- built_in_attributes[(int) ENUM] = NULL_TREE;
-#define DEF_ATTR_INT(ENUM, VALUE) \
- built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
-#define DEF_ATTR_STRING(ENUM, VALUE) \
- built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
-#define DEF_ATTR_IDENT(ENUM, STRING) \
- built_in_attributes[(int) ENUM] = get_identifier (STRING);
-#define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
- built_in_attributes[(int) ENUM] \
- = tree_cons (built_in_attributes[(int) PURPOSE], \
- built_in_attributes[(int) VALUE], \
- built_in_attributes[(int) CHAIN]);
-#include "builtin-attrs.def"
-#undef DEF_ATTR_NULL_TREE
-#undef DEF_ATTR_INT
-#undef DEF_ATTR_IDENT
-#undef DEF_ATTR_TREE_LIST
+ error_at (richloc,
+ "invalid operands to binary %s (have %qT and %qT)",
+ opname, type0, type1);
}
-
-/* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
- identifier as an argument, so the front end shouldn't look it up. */
-
-bool
-attribute_takes_identifier_p (const_tree attr_id)
+\f
+/* Given an expression as a tree, return its original type. Do this
+ by stripping any conversion that preserves the sign and precision. */
+static tree
+expr_original_type (tree expr)
{
- const struct attribute_spec *spec = lookup_attribute_spec (attr_id);
- if (spec == NULL)
- /* Unknown attribute that we'll end up ignoring, return true so we
- don't complain about an identifier argument. */
- return true;
- else if (!strcmp ("mode", spec->name)
- || !strcmp ("format", spec->name)
- || !strcmp ("cleanup", spec->name))
- return true;
- else
- return targetm.attribute_takes_identifier_p (attr_id);
+ STRIP_SIGN_NOPS (expr);
+ return TREE_TYPE (expr);
}
-/* Attribute handlers common to C front ends. */
-
-/* Handle a "packed" attribute; arguments as in
- struct attribute_spec.handler. */
+/* Subroutine of build_binary_op, used for comparison operations.
+ See if the operands have both been converted from subword integer types
+ and, if so, perhaps change them both back to their original type.
+ This function is also responsible for converting the two operands
+ to the proper common type for comparison.
-static tree
-handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int flags, bool *no_add_attrs)
-{
- if (TYPE_P (*node))
- {
- if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
- *node = build_variant_type_copy (*node);
- TYPE_PACKED (*node) = 1;
- }
- else if (TREE_CODE (*node) == FIELD_DECL)
- {
- if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT
- /* Still pack bitfields. */
- && ! DECL_INITIAL (*node))
- warning (OPT_Wattributes,
- "%qE attribute ignored for field of type %qT",
- name, TREE_TYPE (*node));
- else
- DECL_PACKED (*node) = 1;
- }
- /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
- used for DECL_REGISTER. It wouldn't mean anything anyway.
- We can't set DECL_PACKED on the type of a TYPE_DECL, because
- that changes what the typedef is typing. */
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ The arguments of this function are all pointers to local variables
+ of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
+ RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
- return NULL_TREE;
-}
+ LOC is the location of the comparison.
-/* Handle a "nocommon" attribute; arguments as in
- struct attribute_spec.handler. */
+ If this function returns non-NULL_TREE, it means that the comparison has
+ a constant value. What this function returns is an expression for
+ that value. */
-static tree
-handle_nocommon_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
+tree
+shorten_compare (location_t loc, tree *op0_ptr, tree *op1_ptr,
+ tree *restype_ptr, enum tree_code *rescode_ptr)
{
- if (VAR_P (*node))
- DECL_COMMON (*node) = 0;
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
-
- return NULL_TREE;
-}
+ tree type;
+ tree op0 = *op0_ptr;
+ tree op1 = *op1_ptr;
+ int unsignedp0, unsignedp1;
+ int real1, real2;
+ tree primop0, primop1;
+ enum tree_code code = *rescode_ptr;
-/* Handle a "common" attribute; arguments as in
- struct attribute_spec.handler. */
+ /* Throw away any conversions to wider types
+ already present in the operands. */
-static tree
-handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- if (VAR_P (*node))
- DECL_COMMON (*node) = 1;
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ primop0 = c_common_get_narrower (op0, &unsignedp0);
+ primop1 = c_common_get_narrower (op1, &unsignedp1);
- return NULL_TREE;
-}
+ /* If primopN is first sign-extended from primopN's precision to opN's
+ precision, then zero-extended from opN's precision to
+ *restype_ptr precision, shortenings might be invalid. */
+ if (TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (TREE_TYPE (op0))
+ && TYPE_PRECISION (TREE_TYPE (op0)) < TYPE_PRECISION (*restype_ptr)
+ && !unsignedp0
+ && TYPE_UNSIGNED (TREE_TYPE (op0)))
+ primop0 = op0;
+ if (TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (TREE_TYPE (op1))
+ && TYPE_PRECISION (TREE_TYPE (op1)) < TYPE_PRECISION (*restype_ptr)
+ && !unsignedp1
+ && TYPE_UNSIGNED (TREE_TYPE (op1)))
+ primop1 = op1;
-/* Handle a "noreturn" attribute; arguments as in
- struct attribute_spec.handler. */
+ /* Handle the case that OP0 does not *contain* a conversion
+ but it *requires* conversion to FINAL_TYPE. */
-static tree
-handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- tree type = TREE_TYPE (*node);
-
- /* See FIXME comment in c_common_attribute_table. */
- if (TREE_CODE (*node) == FUNCTION_DECL
- || objc_method_decl (TREE_CODE (*node)))
- TREE_THIS_VOLATILE (*node) = 1;
- else if (TREE_CODE (type) == POINTER_TYPE
- && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
- TREE_TYPE (*node)
- = (build_qualified_type
- (build_pointer_type
- (build_type_variant (TREE_TYPE (type),
- TYPE_READONLY (TREE_TYPE (type)), 1)),
- TYPE_QUALS (type)));
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
+ unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
+ if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
+ unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
- return NULL_TREE;
-}
+ /* If one of the operands must be floated, we cannot optimize. */
+ real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
+ real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
-/* Handle a "hot" and attribute; arguments as in
- struct attribute_spec.handler. */
+ /* If first arg is constant, swap the args (changing operation
+ so value is preserved), for canonicalization. Don't do this if
+ the second arg is 0. */
-static tree
-handle_hot_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- if (TREE_CODE (*node) == FUNCTION_DECL
- || TREE_CODE (*node) == LABEL_DECL)
+ if (TREE_CONSTANT (primop0)
+ && !integer_zerop (primop1) && !real_zerop (primop1)
+ && !fixed_zerop (primop1))
{
- if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node)) != NULL)
+ std::swap (primop0, primop1);
+ std::swap (op0, op1);
+ *op0_ptr = op0;
+ *op1_ptr = op1;
+ std::swap (unsignedp0, unsignedp1);
+ std::swap (real1, real2);
+
+ switch (code)
{
- warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
- "with attribute %qs", name, "cold");
- *no_add_attrs = true;
+ case LT_EXPR:
+ code = GT_EXPR;
+ break;
+ case GT_EXPR:
+ code = LT_EXPR;
+ break;
+ case LE_EXPR:
+ code = GE_EXPR;
+ break;
+ case GE_EXPR:
+ code = LE_EXPR;
+ break;
+ default:
+ break;
}
- /* Most of the rest of the hot processing is done later with
- lookup_attribute. */
- }
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
+ *rescode_ptr = code;
}
- return NULL_TREE;
-}
+ /* If comparing an integer against a constant more bits wide,
+ maybe we can deduce a value of 1 or 0 independent of the data.
+ Or else truncate the constant now
+ rather than extend the variable at run time.
-/* Handle a "cold" and attribute; arguments as in
- struct attribute_spec.handler. */
+ This is only interesting if the constant is the wider arg.
+ Also, it is not safe if the constant is unsigned and the
+ variable arg is signed, since in this case the variable
+ would be sign-extended and then regarded as unsigned.
+ Our technique fails in this case because the lowest/highest
+ possible unsigned results don't follow naturally from the
+ lowest/highest possible values of the variable operand.
+ For just EQ_EXPR and NE_EXPR there is another technique that
+ could be used: see if the constant can be faithfully represented
+ in the other operand's type, by truncating it and reextending it
+ and see if that preserves the constant's value. */
-static tree
-handle_cold_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- if (TREE_CODE (*node) == FUNCTION_DECL
- || TREE_CODE (*node) == LABEL_DECL)
- {
- if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node)) != NULL)
- {
- warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
- "with attribute %qs", name, "hot");
- *no_add_attrs = true;
- }
- /* Most of the rest of the cold processing is done later with
- lookup_attribute. */
- }
- else
+ if (!real1 && !real2
+ && TREE_CODE (TREE_TYPE (primop0)) != FIXED_POINT_TYPE
+ && TREE_CODE (primop1) == INTEGER_CST
+ && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ int min_gt, max_gt, min_lt, max_lt;
+ tree maxval, minval;
+ /* 1 if comparison is nominally unsigned. */
+ int unsignedp = TYPE_UNSIGNED (*restype_ptr);
+ tree val;
- return NULL_TREE;
-}
+ type = c_common_signed_or_unsigned_type (unsignedp0,
+ TREE_TYPE (primop0));
-/* Handle a "no_sanitize_address" attribute; arguments as in
- struct attribute_spec.handler. */
+ maxval = TYPE_MAX_VALUE (type);
+ minval = TYPE_MIN_VALUE (type);
-static tree
-handle_no_sanitize_address_attribute (tree *node, tree name, tree, int,
- bool *no_add_attrs)
-{
- if (TREE_CODE (*node) != FUNCTION_DECL)
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ if (unsignedp && !unsignedp0)
+ *restype_ptr = c_common_signed_type (*restype_ptr);
- return NULL_TREE;
-}
+ if (TREE_TYPE (primop1) != *restype_ptr)
+ {
+ /* Convert primop1 to target type, but do not introduce
+ additional overflow. We know primop1 is an int_cst. */
+ primop1 = force_fit_type (*restype_ptr,
+ wi::to_wide
+ (primop1,
+ TYPE_PRECISION (*restype_ptr)),
+ 0, TREE_OVERFLOW (primop1));
+ }
+ if (type != *restype_ptr)
+ {
+ minval = convert (*restype_ptr, minval);
+ maxval = convert (*restype_ptr, maxval);
+ }
-/* Handle a "no_address_safety_analysis" attribute; arguments as in
- struct attribute_spec.handler. */
+ min_gt = tree_int_cst_lt (primop1, minval);
+ max_gt = tree_int_cst_lt (primop1, maxval);
+ min_lt = tree_int_cst_lt (minval, primop1);
+ max_lt = tree_int_cst_lt (maxval, primop1);
-static tree
-handle_no_address_safety_analysis_attribute (tree *node, tree name, tree, int,
- bool *no_add_attrs)
-{
- if (TREE_CODE (*node) != FUNCTION_DECL)
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- else if (!lookup_attribute ("no_sanitize_address", DECL_ATTRIBUTES (*node)))
- DECL_ATTRIBUTES (*node)
- = tree_cons (get_identifier ("no_sanitize_address"),
- NULL_TREE, DECL_ATTRIBUTES (*node));
- *no_add_attrs = true;
- return NULL_TREE;
-}
+ val = 0;
+ /* This used to be a switch, but Genix compiler can't handle that. */
+ if (code == NE_EXPR)
+ {
+ if (max_lt || min_gt)
+ val = truthvalue_true_node;
+ }
+ else if (code == EQ_EXPR)
+ {
+ if (max_lt || min_gt)
+ val = truthvalue_false_node;
+ }
+ else if (code == LT_EXPR)
+ {
+ if (max_lt)
+ val = truthvalue_true_node;
+ if (!min_lt)
+ val = truthvalue_false_node;
+ }
+ else if (code == GT_EXPR)
+ {
+ if (min_gt)
+ val = truthvalue_true_node;
+ if (!max_gt)
+ val = truthvalue_false_node;
+ }
+ else if (code == LE_EXPR)
+ {
+ if (!max_gt)
+ val = truthvalue_true_node;
+ if (min_gt)
+ val = truthvalue_false_node;
+ }
+ else if (code == GE_EXPR)
+ {
+ if (!min_lt)
+ val = truthvalue_true_node;
+ if (max_lt)
+ val = truthvalue_false_node;
+ }
-/* Handle a "no_sanitize_undefined" attribute; arguments as in
- struct attribute_spec.handler. */
+ /* If primop0 was sign-extended and unsigned comparison specd,
+ we did a signed comparison above using the signed type bounds.
+ But the comparison we output must be unsigned.
-static tree
-handle_no_sanitize_undefined_attribute (tree *node, tree name, tree, int,
- bool *no_add_attrs)
-{
- if (TREE_CODE (*node) != FUNCTION_DECL)
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ Also, for inequalities, VAL is no good; but if the signed
+ comparison had *any* fixed result, it follows that the
+ unsigned comparison just tests the sign in reverse
+ (positive values are LE, negative ones GE).
+ So we can generate an unsigned comparison
+ against an extreme value of the signed type. */
- return NULL_TREE;
-}
+ if (unsignedp && !unsignedp0)
+ {
+ if (val != 0)
+ switch (code)
+ {
+ case LT_EXPR:
+ case GE_EXPR:
+ primop1 = TYPE_MIN_VALUE (type);
+ val = 0;
+ break;
-/* Handle a "stack_protect" attribute; arguments as in
- struct attribute_spec.handler. */
-static tree
-handle_stack_protect_attribute (tree *node, tree name, tree, int,
- bool *no_add_attrs)
-{
- if (TREE_CODE (*node) != FUNCTION_DECL)
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
- else
- DECL_ATTRIBUTES (*node)
- = tree_cons (get_identifier ("stack_protect"),
- NULL_TREE, DECL_ATTRIBUTES (*node));
+ case LE_EXPR:
+ case GT_EXPR:
+ primop1 = TYPE_MAX_VALUE (type);
+ val = 0;
+ break;
- return NULL_TREE;
-}
+ default:
+ break;
+ }
+ type = c_common_unsigned_type (type);
+ }
-/* Handle a "noinline" attribute; arguments as in
- struct attribute_spec.handler. */
+ if (TREE_CODE (primop0) != INTEGER_CST
+ /* Don't warn if it's from a (non-system) macro. */
+ && !(from_macro_expansion_at
+ (expansion_point_location_if_in_system_header
+ (EXPR_LOCATION (primop0)))))
+ {
+ if (val == truthvalue_false_node)
+ warning_at (loc, OPT_Wtype_limits,
+ "comparison is always false due to limited range of data type");
+ if (val == truthvalue_true_node)
+ warning_at (loc, OPT_Wtype_limits,
+ "comparison is always true due to limited range of data type");
+ }
-static tree
-handle_noinline_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- if (TREE_CODE (*node) == FUNCTION_DECL)
- {
- if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node)))
+ if (val != 0)
{
- warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
- "with attribute %qs", name, "always_inline");
- *no_add_attrs = true;
+ /* Don't forget to evaluate PRIMOP0 if it has side effects. */
+ if (TREE_SIDE_EFFECTS (primop0))
+ return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
+ return val;
}
- else
- DECL_UNINLINABLE (*node) = 1;
- }
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
- return NULL_TREE;
-}
+ /* Value is not predetermined, but do the comparison
+ in the type of the operand that is not constant.
+ TYPE is already properly set. */
+ }
-/* Handle a "noclone" attribute; arguments as in
- struct attribute_spec.handler. */
+ /* If either arg is decimal float and the other is float, find the
+ proper common type to use for comparison. */
+ else if (real1 && real2
+ && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
+ && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1))))
+ type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
-static tree
-handle_noclone_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- if (TREE_CODE (*node) != FUNCTION_DECL)
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ /* If either arg is decimal float and the other is float, fail. */
+ else if (real1 && real2
+ && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
+ || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))))
+ return NULL_TREE;
- return NULL_TREE;
-}
+ else if (real1 && real2
+ && (TYPE_PRECISION (TREE_TYPE (primop0))
+ == TYPE_PRECISION (TREE_TYPE (primop1))))
+ type = TREE_TYPE (primop0);
-/* Handle a "no_icf" attribute; arguments as in
- struct attribute_spec.handler. */
+ /* If args' natural types are both narrower than nominal type
+ and both extend in the same manner, compare them
+ in the type of the wider arg.
+ Otherwise must actually extend both to the nominal
+ common type lest different ways of extending
+ alter the result.
+ (eg, (short)-1 == (unsigned short)-1 should be 0.) */
-static tree
-handle_noicf_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- if (TREE_CODE (*node) != FUNCTION_DECL)
+ else if (unsignedp0 == unsignedp1 && real1 == real2
+ && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
+ && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
+ type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
+ type = c_common_signed_or_unsigned_type (unsignedp0
+ || TYPE_UNSIGNED (*restype_ptr),
+ type);
+ /* Make sure shorter operand is extended the right way
+ to match the longer operand. */
+ primop0
+ = convert (c_common_signed_or_unsigned_type (unsignedp0,
+ TREE_TYPE (primop0)),
+ primop0);
+ primop1
+ = convert (c_common_signed_or_unsigned_type (unsignedp1,
+ TREE_TYPE (primop1)),
+ primop1);
}
+ else
+ {
+ /* Here we must do the comparison on the nominal type
+ using the args exactly as we received them. */
+ type = *restype_ptr;
+ primop0 = op0;
+ primop1 = op1;
- return NULL_TREE;
-}
+ if (!real1 && !real2 && integer_zerop (primop1)
+ && TYPE_UNSIGNED (*restype_ptr))
+ {
+ tree value = NULL_TREE;
+ /* All unsigned values are >= 0, so we warn. However,
+ if OP0 is a constant that is >= 0, the signedness of
+ the comparison isn't an issue, so suppress the
+ warning. */
+ bool warn =
+ warn_type_limits && !in_system_header_at (loc)
+ && !(TREE_CODE (primop0) == INTEGER_CST
+ && !TREE_OVERFLOW (convert (c_common_signed_type (type),
+ primop0)))
+ /* Do not warn for enumeration types. */
+ && (TREE_CODE (expr_original_type (primop0)) != ENUMERAL_TYPE);
+
+ switch (code)
+ {
+ case GE_EXPR:
+ if (warn)
+ warning_at (loc, OPT_Wtype_limits,
+ "comparison of unsigned expression >= 0 is always true");
+ value = truthvalue_true_node;
+ break;
+ case LT_EXPR:
+ if (warn)
+ warning_at (loc, OPT_Wtype_limits,
+ "comparison of unsigned expression < 0 is always false");
+ value = truthvalue_false_node;
+ break;
-/* Handle a "always_inline" attribute; arguments as in
- struct attribute_spec.handler. */
+ default:
+ break;
+ }
-static tree
-handle_always_inline_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags),
- bool *no_add_attrs)
-{
- if (TREE_CODE (*node) == FUNCTION_DECL)
- {
- if (lookup_attribute ("noinline", DECL_ATTRIBUTES (*node)))
- {
- warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
- "with %qs attribute", name, "noinline");
- *no_add_attrs = true;
- }
- else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node)))
- {
- warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
- "with %qs attribute", name, "target_clones");
- *no_add_attrs = true;
+ if (value != NULL_TREE)
+ {
+ /* Don't forget to evaluate PRIMOP0 if it has side effects. */
+ if (TREE_SIDE_EFFECTS (primop0))
+ return build2 (COMPOUND_EXPR, TREE_TYPE (value),
+ primop0, value);
+ return value;
+ }
}
- else
- /* Set the attribute and mark it for disregarding inline
- limits. */
- DECL_DISREGARD_INLINE_LIMITS (*node) = 1;
- }
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
}
- return NULL_TREE;
-}
-
-/* Handle a "gnu_inline" attribute; arguments as in
- struct attribute_spec.handler. */
+ *op0_ptr = convert (type, primop0);
+ *op1_ptr = convert (type, primop1);
-static tree
-handle_gnu_inline_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags),
- bool *no_add_attrs)
-{
- if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
- {
- /* Do nothing else, just set the attribute. We'll get at
- it later with lookup_attribute. */
- }
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ *restype_ptr = truthvalue_type_node;
return NULL_TREE;
}
+\f
+/* Return a tree for the sum or difference (RESULTCODE says which)
+ of pointer PTROP and integer INTOP. */
-/* Handle a "leaf" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_leaf_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
+tree
+pointer_int_sum (location_t loc, enum tree_code resultcode,
+ tree ptrop, tree intop, bool complain)
{
- if (TREE_CODE (*node) != FUNCTION_DECL)
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
- if (!TREE_PUBLIC (*node))
- {
- warning (OPT_Wattributes, "%qE attribute has no effect on unit local functions", name);
- *no_add_attrs = true;
- }
-
- return NULL_TREE;
-}
+ tree size_exp, ret;
-/* Handle an "artificial" attribute; arguments as in
- struct attribute_spec.handler. */
+ /* The result is a pointer of the same type that is being added. */
+ tree result_type = TREE_TYPE (ptrop);
-static tree
-handle_artificial_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags),
- bool *no_add_attrs)
-{
- if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
+ if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
{
- /* Do nothing else, just set the attribute. We'll get at
- it later with lookup_attribute. */
+ if (complain && warn_pointer_arith)
+ pedwarn (loc, OPT_Wpointer_arith,
+ "pointer of type %<void *%> used in arithmetic");
+ else if (!complain)
+ return error_mark_node;
+ size_exp = integer_one_node;
}
- else
+ else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
+ if (complain && warn_pointer_arith)
+ pedwarn (loc, OPT_Wpointer_arith,
+ "pointer to a function used in arithmetic");
+ else if (!complain)
+ return error_mark_node;
+ size_exp = integer_one_node;
}
-
- return NULL_TREE;
-}
-
-/* Handle a "flatten" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_flatten_attribute (tree *node, tree name,
- tree args ATTRIBUTE_UNUSED,
- int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
-{
- if (TREE_CODE (*node) == FUNCTION_DECL)
- /* Do nothing else, just set the attribute. We'll get at
- it later with lookup_attribute. */
- ;
else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
-
- return NULL_TREE;
-}
+ size_exp = size_in_bytes_loc (loc, TREE_TYPE (result_type));
-/* Handle a "warning" or "error" attribute; arguments as in
- struct attribute_spec.handler. */
+ /* We are manipulating pointer values, so we don't need to warn
+ about relying on undefined signed overflow. We disable the
+ warning here because we use integer types so fold won't know that
+ they are really pointers. */
+ fold_defer_overflow_warnings ();
-static tree
-handle_error_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- if (TREE_CODE (*node) == FUNCTION_DECL
- && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
- /* Do nothing else, just set the attribute. We'll get at
- it later with lookup_attribute. */
- ;
- else
+ /* If what we are about to multiply by the size of the elements
+ contains a constant term, apply distributive law
+ and multiply that constant term separately.
+ This helps produce common subexpressions. */
+ if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
+ && !TREE_CONSTANT (intop)
+ && TREE_CONSTANT (TREE_OPERAND (intop, 1))
+ && TREE_CONSTANT (size_exp)
+ /* If the constant comes from pointer subtraction,
+ skip this optimization--it would cause an error. */
+ && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
+ /* If the constant is unsigned, and smaller than the pointer size,
+ then we must skip this optimization. This is because it could cause
+ an overflow error if the constant is negative but INTOP is not. */
+ && (!TYPE_UNSIGNED (TREE_TYPE (intop))
+ || (TYPE_PRECISION (TREE_TYPE (intop))
+ == TYPE_PRECISION (TREE_TYPE (ptrop)))))
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
+ enum tree_code subcode = resultcode;
+ tree int_type = TREE_TYPE (intop);
+ if (TREE_CODE (intop) == MINUS_EXPR)
+ subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
+ /* Convert both subexpression types to the type of intop,
+ because weird cases involving pointer arithmetic
+ can result in a sum or difference with different type args. */
+ ptrop = build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop, 1)),
+ subcode, ptrop,
+ convert (int_type, TREE_OPERAND (intop, 1)),
+ true);
+ intop = convert (int_type, TREE_OPERAND (intop, 0));
}
- return NULL_TREE;
-}
+ /* Convert the integer argument to a type the same size as sizetype
+ so the multiply won't overflow spuriously. */
+ if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
+ || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
+ intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
+ TYPE_UNSIGNED (sizetype)), intop);
+
+ /* Replace the integer argument with a suitable product by the object size.
+ Do this multiplication as signed, then convert to the appropriate type
+ for the pointer operation and disregard an overflow that occurred only
+ because of the sign-extension change in the latter conversion. */
+ {
+ tree t = fold_build2_loc (loc, MULT_EXPR, TREE_TYPE (intop), intop,
+ convert (TREE_TYPE (intop), size_exp));
+ intop = convert (sizetype, t);
+ if (TREE_OVERFLOW_P (intop) && !TREE_OVERFLOW (t))
+ intop = wide_int_to_tree (TREE_TYPE (intop), wi::to_wide (intop));
+ }
-/* Handle a "used" attribute; arguments as in
- struct attribute_spec.handler. */
+ /* Create the sum or difference. */
+ if (resultcode == MINUS_EXPR)
+ intop = fold_build1_loc (loc, NEGATE_EXPR, sizetype, intop);
-static tree
-handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- tree node = *pnode;
+ ret = fold_build_pointer_plus_loc (loc, ptrop, intop);
- if (TREE_CODE (node) == FUNCTION_DECL
- || (VAR_P (node) && TREE_STATIC (node))
- || (TREE_CODE (node) == TYPE_DECL))
- {
- TREE_USED (node) = 1;
- DECL_PRESERVE_P (node) = 1;
- if (VAR_P (node))
- DECL_READ_P (node) = 1;
- }
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ fold_undefer_and_ignore_overflow_warnings ();
- return NULL_TREE;
+ return ret;
}
-
-/* Handle a "unused" attribute; arguments as in
- struct attribute_spec.handler. */
+\f
+/* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
+ and if NON_CONST is known not to be permitted in an evaluated part
+ of a constant expression. */
tree
-handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int flags, bool *no_add_attrs)
+c_wrap_maybe_const (tree expr, bool non_const)
{
- if (DECL_P (*node))
- {
- tree decl = *node;
+ bool nowarning = TREE_NO_WARNING (expr);
+ location_t loc = EXPR_LOCATION (expr);
- if (TREE_CODE (decl) == PARM_DECL
- || VAR_OR_FUNCTION_DECL_P (decl)
- || TREE_CODE (decl) == LABEL_DECL
- || TREE_CODE (decl) == CONST_DECL
- || TREE_CODE (decl) == TYPE_DECL)
- {
- TREE_USED (decl) = 1;
- if (VAR_P (decl) || TREE_CODE (decl) == PARM_DECL)
- DECL_READ_P (decl) = 1;
- }
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
- }
- else
- {
- if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
- *node = build_variant_type_copy (*node);
- TREE_USED (*node) = 1;
- }
+ /* This should never be called for C++. */
+ if (c_dialect_cxx ())
+ gcc_unreachable ();
- return NULL_TREE;
+ /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
+ STRIP_TYPE_NOPS (expr);
+ expr = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (expr), NULL, expr);
+ C_MAYBE_CONST_EXPR_NON_CONST (expr) = non_const;
+ if (nowarning)
+ TREE_NO_WARNING (expr) = 1;
+ protected_set_expr_location (expr, loc);
+
+ return expr;
}
-/* Handle a "externally_visible" attribute; arguments as in
- struct attribute_spec.handler. */
+/* Return whether EXPR is a declaration whose address can never be
+ NULL. */
-static tree
-handle_externally_visible_attribute (tree *pnode, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags),
- bool *no_add_attrs)
+bool
+decl_with_nonnull_addr_p (const_tree expr)
{
- tree node = *pnode;
+ return (DECL_P (expr)
+ && (TREE_CODE (expr) == PARM_DECL
+ || TREE_CODE (expr) == LABEL_DECL
+ || !DECL_WEAK (expr)));
+}
- if (VAR_OR_FUNCTION_DECL_P (node))
- {
- if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL
- && !DECL_EXTERNAL (node)) || !TREE_PUBLIC (node))
- {
- warning (OPT_Wattributes,
- "%qE attribute have effect only on public objects", name);
- *no_add_attrs = true;
- }
- }
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+/* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
+ or for an `if' or `while' statement or ?..: exp. It should already
+ have been validated to be of suitable type; otherwise, a bad
+ diagnostic may result.
- return NULL_TREE;
-}
+ The EXPR is located at LOCATION.
-/* Handle the "no_reorder" attribute. Arguments as in
- struct attribute_spec.handler. */
+ This preparation consists of taking the ordinary
+ representation of an expression expr and producing a valid tree
+ boolean expression describing whether expr is nonzero. We could
+ simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
+ but we optimize comparisons, &&, ||, and !.
-static tree
-handle_no_reorder_attribute (tree *pnode,
- tree name,
- tree,
- int,
- bool *no_add_attrs)
-{
- tree node = *pnode;
+ The resulting type should always be `truthvalue_type_node'. */
- if (!VAR_OR_FUNCTION_DECL_P (node)
- && !(TREE_STATIC (node) || DECL_EXTERNAL (node)))
+tree
+c_common_truthvalue_conversion (location_t location, tree expr)
+{
+ switch (TREE_CODE (expr))
{
- warning (OPT_Wattributes,
- "%qE attribute only affects top level objects",
- name);
- *no_add_attrs = true;
- }
+ case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
+ case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
+ case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
+ case ORDERED_EXPR: case UNORDERED_EXPR:
+ if (TREE_TYPE (expr) == truthvalue_type_node)
+ return expr;
+ expr = build2 (TREE_CODE (expr), truthvalue_type_node,
+ TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
+ goto ret;
- return NULL_TREE;
-}
+ case TRUTH_ANDIF_EXPR:
+ case TRUTH_ORIF_EXPR:
+ case TRUTH_AND_EXPR:
+ case TRUTH_OR_EXPR:
+ case TRUTH_XOR_EXPR:
+ if (TREE_TYPE (expr) == truthvalue_type_node)
+ return expr;
+ expr = build2 (TREE_CODE (expr), truthvalue_type_node,
+ c_common_truthvalue_conversion (location,
+ TREE_OPERAND (expr, 0)),
+ c_common_truthvalue_conversion (location,
+ TREE_OPERAND (expr, 1)));
+ goto ret;
-/* Handle a "const" attribute; arguments as in
- struct attribute_spec.handler. */
+ case TRUTH_NOT_EXPR:
+ if (TREE_TYPE (expr) == truthvalue_type_node)
+ return expr;
+ expr = build1 (TREE_CODE (expr), truthvalue_type_node,
+ c_common_truthvalue_conversion (location,
+ TREE_OPERAND (expr, 0)));
+ goto ret;
-static tree
-handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- tree type = TREE_TYPE (*node);
-
- /* See FIXME comment on noreturn in c_common_attribute_table. */
- if (TREE_CODE (*node) == FUNCTION_DECL)
- TREE_READONLY (*node) = 1;
- else if (TREE_CODE (type) == POINTER_TYPE
- && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
- TREE_TYPE (*node)
- = (build_qualified_type
- (build_pointer_type
- (build_type_variant (TREE_TYPE (type), 1,
- TREE_THIS_VOLATILE (TREE_TYPE (type)))),
- TYPE_QUALS (type)));
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ case ERROR_MARK:
+ return expr;
- return NULL_TREE;
-}
+ case INTEGER_CST:
+ if (TREE_CODE (TREE_TYPE (expr)) == ENUMERAL_TYPE
+ && !integer_zerop (expr)
+ && !integer_onep (expr))
+ warning_at (location, OPT_Wint_in_bool_context,
+ "enum constant in boolean context");
+ return integer_zerop (expr) ? truthvalue_false_node
+ : truthvalue_true_node;
-/* Handle a "scalar_storage_order" attribute; arguments as in
- struct attribute_spec.handler. */
+ case REAL_CST:
+ return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
+ ? truthvalue_true_node
+ : truthvalue_false_node;
-static tree
-handle_scalar_storage_order_attribute (tree *node, tree name, tree args,
- int flags, bool *no_add_attrs)
-{
- tree id = TREE_VALUE (args);
- tree type;
+ case FIXED_CST:
+ return fixed_compare (NE_EXPR, &TREE_FIXED_CST (expr),
+ &FCONST0 (TYPE_MODE (TREE_TYPE (expr))))
+ ? truthvalue_true_node
+ : truthvalue_false_node;
- if (TREE_CODE (*node) == TYPE_DECL
- && ! (flags & ATTR_FLAG_CXX11))
- node = &TREE_TYPE (*node);
- type = *node;
+ case FUNCTION_DECL:
+ expr = build_unary_op (location, ADDR_EXPR, expr, false);
+ /* Fall through. */
- if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN)
- {
- error ("scalar_storage_order is not supported because endianness "
- "is not uniform");
- return NULL_TREE;
- }
+ case ADDR_EXPR:
+ {
+ tree inner = TREE_OPERAND (expr, 0);
+ if (decl_with_nonnull_addr_p (inner))
+ {
+ /* Common Ada/Pascal programmer's mistake. */
+ warning_at (location,
+ OPT_Waddress,
+ "the address of %qD will always evaluate as %<true%>",
+ inner);
+ return truthvalue_true_node;
+ }
+ break;
+ }
- if (RECORD_OR_UNION_TYPE_P (type) && !c_dialect_cxx ())
- {
- bool reverse = false;
+ case COMPLEX_EXPR:
+ expr = build_binary_op (EXPR_LOCATION (expr),
+ (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
+ ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
+ c_common_truthvalue_conversion (location,
+ TREE_OPERAND (expr, 0)),
+ c_common_truthvalue_conversion (location,
+ TREE_OPERAND (expr, 1)),
+ false);
+ goto ret;
- if (TREE_CODE (id) == STRING_CST
- && strcmp (TREE_STRING_POINTER (id), "big-endian") == 0)
- reverse = !BYTES_BIG_ENDIAN;
- else if (TREE_CODE (id) == STRING_CST
- && strcmp (TREE_STRING_POINTER (id), "little-endian") == 0)
- reverse = BYTES_BIG_ENDIAN;
- else
- {
- error ("scalar_storage_order argument must be one of \"big-endian\""
- " or \"little-endian\"");
- return NULL_TREE;
- }
+ case NEGATE_EXPR:
+ case ABS_EXPR:
+ case FLOAT_EXPR:
+ case EXCESS_PRECISION_EXPR:
+ /* These don't change whether an object is nonzero or zero. */
+ return c_common_truthvalue_conversion (location, TREE_OPERAND (expr, 0));
- if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
+ case LROTATE_EXPR:
+ case RROTATE_EXPR:
+ /* These don't change whether an object is zero or nonzero, but
+ we can't ignore them if their second arg has side-effects. */
+ if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
{
- if (reverse)
- /* A type variant isn't good enough, since we don't want a cast
- to such a type to be removed as a no-op. */
- *node = type = build_duplicate_type (type);
+ expr = build2 (COMPOUND_EXPR, truthvalue_type_node,
+ TREE_OPERAND (expr, 1),
+ c_common_truthvalue_conversion
+ (location, TREE_OPERAND (expr, 0)));
+ goto ret;
}
+ else
+ return c_common_truthvalue_conversion (location,
+ TREE_OPERAND (expr, 0));
- TYPE_REVERSE_STORAGE_ORDER (type) = reverse;
- return NULL_TREE;
- }
+ case MULT_EXPR:
+ warning_at (EXPR_LOCATION (expr), OPT_Wint_in_bool_context,
+ "%<*%> in boolean context, suggest %<&&%> instead");
+ break;
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- return NULL_TREE;
-}
+ case LSHIFT_EXPR:
+ /* We will only warn on signed shifts here, because the majority of
+ false positive warnings happen in code where unsigned arithmetic
+ was used in anticipation of a possible overflow.
+ Furthermore, if we see an unsigned type here we know that the
+ result of the shift is not subject to integer promotion rules. */
+ if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
+ && !TYPE_UNSIGNED (TREE_TYPE (expr)))
+ warning_at (EXPR_LOCATION (expr), OPT_Wint_in_bool_context,
+ "%<<<%> in boolean context, did you mean %<<%> ?");
+ break;
-/* Handle a "transparent_union" attribute; arguments as in
- struct attribute_spec.handler. */
+ case COND_EXPR:
+ if (warn_int_in_bool_context
+ && !from_macro_definition_at (EXPR_LOCATION (expr)))
+ {
+ tree val1 = fold_for_warn (TREE_OPERAND (expr, 1));
+ tree val2 = fold_for_warn (TREE_OPERAND (expr, 2));
+ if (TREE_CODE (val1) == INTEGER_CST
+ && TREE_CODE (val2) == INTEGER_CST
+ && !integer_zerop (val1)
+ && !integer_zerop (val2)
+ && (!integer_onep (val1)
+ || !integer_onep (val2)))
+ warning_at (EXPR_LOCATION (expr), OPT_Wint_in_bool_context,
+ "?: using integer constants in boolean context, "
+ "the expression will always evaluate to %<true%>");
+ else if ((TREE_CODE (val1) == INTEGER_CST
+ && !integer_zerop (val1)
+ && !integer_onep (val1))
+ || (TREE_CODE (val2) == INTEGER_CST
+ && !integer_zerop (val2)
+ && !integer_onep (val2)))
+ warning_at (EXPR_LOCATION (expr), OPT_Wint_in_bool_context,
+ "?: using integer constants in boolean context");
+ }
+ /* Distribute the conversion into the arms of a COND_EXPR. */
+ if (c_dialect_cxx ())
+ /* Avoid premature folding. */
+ break;
+ else
+ {
+ int w = warn_int_in_bool_context;
+ warn_int_in_bool_context = 0;
+ /* Folding will happen later for C. */
+ expr = build3 (COND_EXPR, truthvalue_type_node,
+ TREE_OPERAND (expr, 0),
+ c_common_truthvalue_conversion (location,
+ TREE_OPERAND (expr, 1)),
+ c_common_truthvalue_conversion (location,
+ TREE_OPERAND (expr, 2)));
+ warn_int_in_bool_context = w;
+ goto ret;
+ }
-static tree
-handle_transparent_union_attribute (tree *node, tree name,
- tree ARG_UNUSED (args), int flags,
- bool *no_add_attrs)
-{
- tree type;
+ CASE_CONVERT:
+ {
+ tree totype = TREE_TYPE (expr);
+ tree fromtype = TREE_TYPE (TREE_OPERAND (expr, 0));
- *no_add_attrs = true;
+ if (POINTER_TYPE_P (totype)
+ && !c_inhibit_evaluation_warnings
+ && TREE_CODE (fromtype) == REFERENCE_TYPE)
+ {
+ tree inner = expr;
+ STRIP_NOPS (inner);
- if (TREE_CODE (*node) == TYPE_DECL
- && ! (flags & ATTR_FLAG_CXX11))
- node = &TREE_TYPE (*node);
- type = *node;
+ if (DECL_P (inner))
+ warning_at (location,
+ OPT_Waddress,
+ "the compiler can assume that the address of "
+ "%qD will always evaluate to %<true%>",
+ inner);
+ }
- if (TREE_CODE (type) == UNION_TYPE)
- {
- /* Make sure that the first field will work for a transparent union.
- If the type isn't complete yet, leave the check to the code in
- finish_struct. */
- if (TYPE_SIZE (type))
- {
- tree first = first_field (type);
- if (first == NULL_TREE
- || DECL_ARTIFICIAL (first)
- || TYPE_MODE (type) != DECL_MODE (first))
- goto ignored;
- }
+ /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
+ since that affects how `default_conversion' will behave. */
+ if (TREE_CODE (totype) == REFERENCE_TYPE
+ || TREE_CODE (fromtype) == REFERENCE_TYPE)
+ break;
+ /* Don't strip a conversion from C++0x scoped enum, since they
+ don't implicitly convert to other types. */
+ if (TREE_CODE (fromtype) == ENUMERAL_TYPE
+ && ENUM_IS_SCOPED (fromtype))
+ break;
+ /* If this isn't narrowing the argument, we can ignore it. */
+ if (TYPE_PRECISION (totype) >= TYPE_PRECISION (fromtype))
+ return c_common_truthvalue_conversion (location,
+ TREE_OPERAND (expr, 0));
+ }
+ break;
- if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
+ case MODIFY_EXPR:
+ if (!TREE_NO_WARNING (expr)
+ && warn_parentheses)
{
- /* If the type isn't complete yet, setting the flag
- on a variant wouldn't ever be checked. */
- if (!TYPE_SIZE (type))
- goto ignored;
-
- /* build_duplicate_type doesn't work for C++. */
- if (c_dialect_cxx ())
- goto ignored;
-
- /* A type variant isn't good enough, since we don't want a cast
- to such a type to be removed as a no-op. */
- *node = type = build_duplicate_type (type);
+ warning_at (location, OPT_Wparentheses,
+ "suggest parentheses around assignment used as "
+ "truth value");
+ TREE_NO_WARNING (expr) = 1;
}
+ break;
- for (tree t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
- TYPE_TRANSPARENT_AGGR (t) = 1;
- return NULL_TREE;
+ default:
+ break;
}
- ignored:
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- return NULL_TREE;
-}
-
-/* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
- get the requested priority for a constructor or destructor,
- possibly issuing diagnostics for invalid or reserved
- priorities. */
-
-static priority_type
-get_priority (tree args, bool is_destructor)
-{
- HOST_WIDE_INT pri;
- tree arg;
-
- if (!args)
- return DEFAULT_INIT_PRIORITY;
-
- if (!SUPPORTS_INIT_PRIORITY)
+ if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
{
- if (is_destructor)
- error ("destructor priorities are not supported");
- else
- error ("constructor priorities are not supported");
- return DEFAULT_INIT_PRIORITY;
- }
-
- arg = TREE_VALUE (args);
- if (TREE_CODE (arg) == IDENTIFIER_NODE)
- goto invalid;
- if (arg == error_mark_node)
- return DEFAULT_INIT_PRIORITY;
- arg = default_conversion (arg);
- if (!tree_fits_shwi_p (arg)
- || !INTEGRAL_TYPE_P (TREE_TYPE (arg)))
- goto invalid;
-
- pri = tree_to_shwi (arg);
- if (pri < 0 || pri > MAX_INIT_PRIORITY)
- goto invalid;
-
- if (pri <= MAX_RESERVED_INIT_PRIORITY)
- {
- if (is_destructor)
- warning (0,
- "destructor priorities from 0 to %d are reserved "
- "for the implementation",
- MAX_RESERVED_INIT_PRIORITY);
- else
- warning (0,
- "constructor priorities from 0 to %d are reserved "
- "for the implementation",
- MAX_RESERVED_INIT_PRIORITY);
+ tree t = save_expr (expr);
+ expr = (build_binary_op
+ (EXPR_LOCATION (expr),
+ (TREE_SIDE_EFFECTS (expr)
+ ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
+ c_common_truthvalue_conversion
+ (location,
+ build_unary_op (location, REALPART_EXPR, t, false)),
+ c_common_truthvalue_conversion
+ (location,
+ build_unary_op (location, IMAGPART_EXPR, t, false)),
+ false));
+ goto ret;
}
- return pri;
- invalid:
- if (is_destructor)
- error ("destructor priorities must be integers from 0 to %d inclusive",
- MAX_INIT_PRIORITY);
+ if (TREE_CODE (TREE_TYPE (expr)) == FIXED_POINT_TYPE)
+ {
+ tree fixed_zero_node = build_fixed (TREE_TYPE (expr),
+ FCONST0 (TYPE_MODE
+ (TREE_TYPE (expr))));
+ return build_binary_op (location, NE_EXPR, expr, fixed_zero_node, true);
+ }
else
- error ("constructor priorities must be integers from 0 to %d inclusive",
- MAX_INIT_PRIORITY);
- return DEFAULT_INIT_PRIORITY;
+ return build_binary_op (location, NE_EXPR, expr, integer_zero_node, true);
+
+ ret:
+ protected_set_expr_location (expr, location);
+ return expr;
}
+\f
+static void def_builtin_1 (enum built_in_function fncode,
+ const char *name,
+ enum built_in_class fnclass,
+ tree fntype, tree libtype,
+ bool both_p, bool fallback_p, bool nonansi_p,
+ tree fnattrs, bool implicit_p);
-/* Handle a "constructor" attribute; arguments as in
- struct attribute_spec.handler. */
-static tree
-handle_constructor_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags),
- bool *no_add_attrs)
+/* Apply the TYPE_QUALS to the new DECL. */
+
+void
+c_apply_type_quals_to_decl (int type_quals, tree decl)
{
- tree decl = *node;
tree type = TREE_TYPE (decl);
- if (TREE_CODE (decl) == FUNCTION_DECL
- && TREE_CODE (type) == FUNCTION_TYPE
- && decl_function_context (decl) == 0)
+ if (type == error_mark_node)
+ return;
+
+ if ((type_quals & TYPE_QUAL_CONST)
+ || (type && TREE_CODE (type) == REFERENCE_TYPE))
+ /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
+ constructor can produce constant init, so rely on cp_finish_decl to
+ clear TREE_READONLY if the variable has non-constant init. */
+ TREE_READONLY (decl) = 1;
+ if (type_quals & TYPE_QUAL_VOLATILE)
{
- priority_type priority;
- DECL_STATIC_CONSTRUCTOR (decl) = 1;
- priority = get_priority (args, /*is_destructor=*/false);
- SET_DECL_INIT_PRIORITY (decl, priority);
- TREE_USED (decl) = 1;
+ TREE_SIDE_EFFECTS (decl) = 1;
+ TREE_THIS_VOLATILE (decl) = 1;
}
- else
+ if (type_quals & TYPE_QUAL_RESTRICT)
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
+ while (type && TREE_CODE (type) == ARRAY_TYPE)
+ /* Allow 'restrict' on arrays of pointers.
+ FIXME currently we just ignore it. */
+ type = TREE_TYPE (type);
+ if (!type
+ || !POINTER_TYPE_P (type)
+ || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
+ error ("invalid use of %<restrict%>");
}
-
- return NULL_TREE;
}
-/* Handle a "destructor" attribute; arguments as in
- struct attribute_spec.handler. */
+/* Return the typed-based alias set for T, which may be an expression
+ or a type. Return -1 if we don't do anything special. */
-static tree
-handle_destructor_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags),
- bool *no_add_attrs)
+alias_set_type
+c_common_get_alias_set (tree t)
{
- tree decl = *node;
- tree type = TREE_TYPE (decl);
-
- if (TREE_CODE (decl) == FUNCTION_DECL
- && TREE_CODE (type) == FUNCTION_TYPE
- && decl_function_context (decl) == 0)
- {
- priority_type priority;
- DECL_STATIC_DESTRUCTOR (decl) = 1;
- priority = get_priority (args, /*is_destructor=*/true);
- SET_DECL_FINI_PRIORITY (decl, priority);
- TREE_USED (decl) = 1;
- }
- else
+ /* For VLAs, use the alias set of the element type rather than the
+ default of alias set 0 for types compared structurally. */
+ if (TYPE_P (t) && TYPE_STRUCTURAL_EQUALITY_P (t))
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
+ if (TREE_CODE (t) == ARRAY_TYPE)
+ return get_alias_set (TREE_TYPE (t));
+ return -1;
}
- return NULL_TREE;
-}
-
-/* Nonzero if the mode is a valid vector mode for this architecture.
- This returns nonzero even if there is no hardware support for the
- vector mode, but we can emulate with narrower modes. */
+ /* That's all the expressions we handle specially. */
+ if (!TYPE_P (t))
+ return -1;
-static int
-vector_mode_valid_p (machine_mode mode)
-{
- enum mode_class mclass = GET_MODE_CLASS (mode);
- machine_mode innermode;
-
- /* Doh! What's going on? */
- if (mclass != MODE_VECTOR_INT
- && mclass != MODE_VECTOR_FLOAT
- && mclass != MODE_VECTOR_FRACT
- && mclass != MODE_VECTOR_UFRACT
- && mclass != MODE_VECTOR_ACCUM
- && mclass != MODE_VECTOR_UACCUM)
+ /* The C standard guarantees that any object may be accessed via an
+ lvalue that has character type. */
+ if (t == char_type_node
+ || t == signed_char_type_node
+ || t == unsigned_char_type_node)
return 0;
- /* Hardware support. Woo hoo! */
- if (targetm.vector_mode_supported_p (mode))
- return 1;
-
- innermode = GET_MODE_INNER (mode);
+ /* The C standard specifically allows aliasing between signed and
+ unsigned variants of the same type. We treat the signed
+ variant as canonical. */
+ if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
+ {
+ tree t1 = c_common_signed_type (t);
- /* We should probably return 1 if requesting V4DI and we have no DI,
- but we have V2DI, but this is probably very unlikely. */
+ /* t1 == t can happen for boolean nodes which are always unsigned. */
+ if (t1 != t)
+ return get_alias_set (t1);
+ }
- /* If we have support for the inner mode, we can safely emulate it.
- We may not have V2DI, but me can emulate with a pair of DIs. */
- return targetm.scalar_mode_supported_p (innermode);
+ return -1;
}
+\f
+/* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
+ the IS_SIZEOF parameter indicates which operator is being applied.
+ The COMPLAIN flag controls whether we should diagnose possibly
+ ill-formed constructs or not. LOC is the location of the SIZEOF or
+ TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
+ a type in any context should be returned, rather than the normal
+ alignment for that type. */
-
-/* Handle a "mode" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_mode_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags), bool *no_add_attrs)
+tree
+c_sizeof_or_alignof_type (location_t loc,
+ tree type, bool is_sizeof, bool min_alignof,
+ int complain)
{
- tree type = *node;
- tree ident = TREE_VALUE (args);
+ const char *op_name;
+ tree value = NULL;
+ enum tree_code type_code = TREE_CODE (type);
- *no_add_attrs = true;
+ op_name = is_sizeof ? "sizeof" : "__alignof__";
- if (TREE_CODE (ident) != IDENTIFIER_NODE)
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- else
+ if (type_code == FUNCTION_TYPE)
{
- int j;
- const char *p = IDENTIFIER_POINTER (ident);
- int len = strlen (p);
- machine_mode mode = VOIDmode;
- tree typefm;
- bool valid_mode;
-
- if (len > 4 && p[0] == '_' && p[1] == '_'
- && p[len - 1] == '_' && p[len - 2] == '_')
+ if (is_sizeof)
{
- char *newp = (char *) alloca (len - 1);
-
- strcpy (newp, &p[2]);
- newp[len - 4] = '\0';
- p = newp;
+ if (complain && warn_pointer_arith)
+ pedwarn (loc, OPT_Wpointer_arith,
+ "invalid application of %<sizeof%> to a function type");
+ else if (!complain)
+ return error_mark_node;
+ value = size_one_node;
}
-
- /* Change this type to have a type with the specified mode.
- First check for the special modes. */
- if (!strcmp (p, "byte"))
- mode = byte_mode;
- else if (!strcmp (p, "word"))
- mode = word_mode;
- else if (!strcmp (p, "pointer"))
- mode = ptr_mode;
- else if (!strcmp (p, "libgcc_cmp_return"))
- mode = targetm.libgcc_cmp_return_mode ();
- else if (!strcmp (p, "libgcc_shift_count"))
- mode = targetm.libgcc_shift_count_mode ();
- else if (!strcmp (p, "unwind_word"))
- mode = targetm.unwind_word_mode ();
else
- for (j = 0; j < NUM_MACHINE_MODES; j++)
- if (!strcmp (p, GET_MODE_NAME (j)))
+ {
+ if (complain)
{
- mode = (machine_mode) j;
- break;
+ if (c_dialect_cxx ())
+ pedwarn (loc, OPT_Wpedantic, "ISO C++ does not permit "
+ "%<alignof%> applied to a function type");
+ else
+ pedwarn (loc, OPT_Wpedantic, "ISO C does not permit "
+ "%<_Alignof%> applied to a function type");
}
-
- if (mode == VOIDmode)
- {
- error ("unknown machine mode %qE", ident);
- return NULL_TREE;
+ value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
}
+ }
+ else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
+ {
+ if (type_code == VOID_TYPE
+ && complain && warn_pointer_arith)
+ pedwarn (loc, OPT_Wpointer_arith,
+ "invalid application of %qs to a void type", op_name);
+ else if (!complain)
+ return error_mark_node;
+ value = size_one_node;
+ }
+ else if (!COMPLETE_TYPE_P (type)
+ && (!c_dialect_cxx () || is_sizeof || type_code != ARRAY_TYPE))
+ {
+ if (complain)
+ error_at (loc, "invalid application of %qs to incomplete type %qT",
+ op_name, type);
+ return error_mark_node;
+ }
+ else if (c_dialect_cxx () && type_code == ARRAY_TYPE
+ && !COMPLETE_TYPE_P (TREE_TYPE (type)))
+ {
+ if (complain)
+ error_at (loc, "invalid application of %qs to array type %qT of "
+ "incomplete element type", op_name, type);
+ return error_mark_node;
+ }
+ else
+ {
+ if (is_sizeof)
+ /* Convert in case a char is more than one unit. */
+ value = size_binop_loc (loc, CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
+ size_int (TYPE_PRECISION (char_type_node)
+ / BITS_PER_UNIT));
+ else if (min_alignof)
+ value = size_int (min_align_of_type (type));
+ else
+ value = size_int (TYPE_ALIGN_UNIT (type));
+ }
- valid_mode = false;
- switch (GET_MODE_CLASS (mode))
- {
- case MODE_INT:
- case MODE_PARTIAL_INT:
- case MODE_FLOAT:
- case MODE_DECIMAL_FLOAT:
- case MODE_FRACT:
- case MODE_UFRACT:
- case MODE_ACCUM:
- case MODE_UACCUM:
- valid_mode = targetm.scalar_mode_supported_p (mode);
- break;
+ /* VALUE will have the middle-end integer type sizetype.
+ However, we should really return a value of type `size_t',
+ which is just a typedef for an ordinary integer type. */
+ value = fold_convert_loc (loc, size_type_node, value);
- case MODE_COMPLEX_INT:
- case MODE_COMPLEX_FLOAT:
- valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
- break;
+ return value;
+}
- case MODE_VECTOR_INT:
- case MODE_VECTOR_FLOAT:
- case MODE_VECTOR_FRACT:
- case MODE_VECTOR_UFRACT:
- case MODE_VECTOR_ACCUM:
- case MODE_VECTOR_UACCUM:
- warning (OPT_Wattributes, "specifying vector types with "
- "__attribute__ ((mode)) is deprecated");
- warning (OPT_Wattributes,
- "use __attribute__ ((vector_size)) instead");
- valid_mode = vector_mode_valid_p (mode);
- break;
+/* Implement the __alignof keyword: Return the minimum required
+ alignment of EXPR, measured in bytes. For VAR_DECLs,
+ FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
+ from an "aligned" __attribute__ specification). LOC is the
+ location of the ALIGNOF operator. */
- default:
- break;
- }
- if (!valid_mode)
- {
- error ("unable to emulate %qs", p);
- return NULL_TREE;
- }
+tree
+c_alignof_expr (location_t loc, tree expr)
+{
+ tree t;
- if (POINTER_TYPE_P (type))
- {
- addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (type));
- tree (*fn)(tree, machine_mode, bool);
+ if (VAR_OR_FUNCTION_DECL_P (expr))
+ t = size_int (DECL_ALIGN_UNIT (expr));
- if (!targetm.addr_space.valid_pointer_mode (mode, as))
- {
- error ("invalid pointer mode %qs", p);
- return NULL_TREE;
- }
+ else if (TREE_CODE (expr) == COMPONENT_REF
+ && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
+ {
+ error_at (loc, "%<__alignof%> applied to a bit-field");
+ t = size_one_node;
+ }
+ else if (TREE_CODE (expr) == COMPONENT_REF
+ && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
+ t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
- if (TREE_CODE (type) == POINTER_TYPE)
- fn = build_pointer_type_for_mode;
- else
- fn = build_reference_type_for_mode;
- typefm = fn (TREE_TYPE (type), mode, false);
- }
- else
- {
- /* For fixed-point modes, we need to test if the signness of type
- and the machine mode are consistent. */
- if (ALL_FIXED_POINT_MODE_P (mode)
- && TYPE_UNSIGNED (type) != UNSIGNED_FIXED_POINT_MODE_P (mode))
- {
- error ("signedness of type and machine mode %qs don%'t match", p);
- return NULL_TREE;
- }
- /* For fixed-point modes, we need to pass saturating info. */
- typefm = lang_hooks.types.type_for_mode (mode,
- ALL_FIXED_POINT_MODE_P (mode) ? TYPE_SATURATING (type)
- : TYPE_UNSIGNED (type));
- }
+ else if (INDIRECT_REF_P (expr))
+ {
+ tree t = TREE_OPERAND (expr, 0);
+ tree best = t;
+ int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
- if (typefm == NULL_TREE)
- {
- error ("no data type for mode %qs", p);
- return NULL_TREE;
- }
- else if (TREE_CODE (type) == ENUMERAL_TYPE)
+ while (CONVERT_EXPR_P (t)
+ && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
{
- /* For enumeral types, copy the precision from the integer
- type returned above. If not an INTEGER_TYPE, we can't use
- this mode for this type. */
- if (TREE_CODE (typefm) != INTEGER_TYPE)
- {
- error ("cannot use mode %qs for enumeral types", p);
- return NULL_TREE;
- }
+ int thisalign;
- if (flags & ATTR_FLAG_TYPE_IN_PLACE)
- {
- TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
- typefm = type;
- }
- else
- {
- /* We cannot build a type variant, as there's code that assumes
- that TYPE_MAIN_VARIANT has the same mode. This includes the
- debug generators. Instead, create a subrange type. This
- results in all of the enumeral values being emitted only once
- in the original, and the subtype gets them by reference. */
- if (TYPE_UNSIGNED (type))
- typefm = make_unsigned_type (TYPE_PRECISION (typefm));
- else
- typefm = make_signed_type (TYPE_PRECISION (typefm));
- TREE_TYPE (typefm) = type;
- }
- }
- else if (VECTOR_MODE_P (mode)
- ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
- : TREE_CODE (type) != TREE_CODE (typefm))
- {
- error ("mode %qs applied to inappropriate type", p);
- return NULL_TREE;
+ t = TREE_OPERAND (t, 0);
+ thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
+ if (thisalign > bestalign)
+ best = t, bestalign = thisalign;
}
-
- *node = typefm;
+ return c_alignof (loc, TREE_TYPE (TREE_TYPE (best)));
}
+ else
+ return c_alignof (loc, TREE_TYPE (expr));
- return NULL_TREE;
+ return fold_convert_loc (loc, size_type_node, t);
}
+\f
+/* Handle C and C++ default attributes. */
-/* Handle a "section" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
- int ARG_UNUSED (flags), bool *no_add_attrs)
+enum built_in_attribute
{
- tree decl = *node;
-
- if (!targetm_common.have_named_sections)
- {
- error_at (DECL_SOURCE_LOCATION (*node),
- "section attributes are not supported for this target");
- goto fail;
- }
-
- user_defined_section_attribute = true;
+#define DEF_ATTR_NULL_TREE(ENUM) ENUM,
+#define DEF_ATTR_INT(ENUM, VALUE) ENUM,
+#define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
+#define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
+#define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
+#include "builtin-attrs.def"
+#undef DEF_ATTR_NULL_TREE
+#undef DEF_ATTR_INT
+#undef DEF_ATTR_STRING
+#undef DEF_ATTR_IDENT
+#undef DEF_ATTR_TREE_LIST
+ ATTR_LAST
+};
- if (!VAR_OR_FUNCTION_DECL_P (decl))
- {
- error ("section attribute not allowed for %q+D", *node);
- goto fail;
- }
+static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
- if (TREE_CODE (TREE_VALUE (args)) != STRING_CST)
- {
- error ("section attribute argument not a string constant");
- goto fail;
- }
+static void c_init_attributes (void);
- if (VAR_P (decl)
- && current_function_decl != NULL_TREE
- && !TREE_STATIC (decl))
- {
- error_at (DECL_SOURCE_LOCATION (decl),
- "section attribute cannot be specified for local variables");
- goto fail;
- }
+enum c_builtin_type
+{
+#define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
+#define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
+#define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
+#define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
+#define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
+#define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
+#define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
+#define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6) NAME,
+#define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6, ARG7) NAME,
+#define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6, ARG7, ARG8) NAME,
+#define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6, ARG7, ARG8, ARG9) NAME,
+#define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
+#define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
+#define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
+#define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
+#define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
+#define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
+#define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
+#define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
+ NAME,
+#define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6) NAME,
+#define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6, ARG7) NAME,
+#define DEF_POINTER_TYPE(NAME, TYPE) NAME,
+#include "builtin-types.def"
+#undef DEF_PRIMITIVE_TYPE
+#undef DEF_FUNCTION_TYPE_0
+#undef DEF_FUNCTION_TYPE_1
+#undef DEF_FUNCTION_TYPE_2
+#undef DEF_FUNCTION_TYPE_3
+#undef DEF_FUNCTION_TYPE_4
+#undef DEF_FUNCTION_TYPE_5
+#undef DEF_FUNCTION_TYPE_6
+#undef DEF_FUNCTION_TYPE_7
+#undef DEF_FUNCTION_TYPE_8
+#undef DEF_FUNCTION_TYPE_9
+#undef DEF_FUNCTION_TYPE_10
+#undef DEF_FUNCTION_TYPE_11
+#undef DEF_FUNCTION_TYPE_VAR_0
+#undef DEF_FUNCTION_TYPE_VAR_1
+#undef DEF_FUNCTION_TYPE_VAR_2
+#undef DEF_FUNCTION_TYPE_VAR_3
+#undef DEF_FUNCTION_TYPE_VAR_4
+#undef DEF_FUNCTION_TYPE_VAR_5
+#undef DEF_FUNCTION_TYPE_VAR_6
+#undef DEF_FUNCTION_TYPE_VAR_7
+#undef DEF_POINTER_TYPE
+ BT_LAST
+};
- /* The decl may have already been given a section attribute
- from a previous declaration. Ensure they match. */
- if (DECL_SECTION_NAME (decl) != NULL
- && strcmp (DECL_SECTION_NAME (decl),
- TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
- {
- error ("section of %q+D conflicts with previous declaration", *node);
- goto fail;
- }
+typedef enum c_builtin_type builtin_type;
- if (VAR_P (decl)
- && !targetm.have_tls && targetm.emutls.tmpl_section
- && DECL_THREAD_LOCAL_P (decl))
- {
- error ("section of %q+D cannot be overridden", *node);
- goto fail;
- }
+/* A temporary array for c_common_nodes_and_builtins. Used in
+ communication with def_fn_type. */
+static tree builtin_types[(int) BT_LAST + 1];
- set_decl_section_name (decl, TREE_STRING_POINTER (TREE_VALUE (args)));
- return NULL_TREE;
+/* A helper function for c_common_nodes_and_builtins. Build function type
+ for DEF with return type RET and N arguments. If VAR is true, then the
+ function should be variadic after those N arguments.
-fail:
- *no_add_attrs = true;
- return NULL_TREE;
-}
+ Takes special care not to ICE if any of the types involved are
+ error_mark_node, which indicates that said type is not in fact available
+ (see builtin_type_for_size). In which case the function type as a whole
+ should be error_mark_node. */
-/* Check whether ALIGN is a valid user-specified alignment. If so,
- return its base-2 log; if not, output an error and return -1. If
- ALLOW_ZERO then 0 is valid and should result in a return of -1 with
- no error. */
-int
-check_user_alignment (const_tree align, bool allow_zero)
+static void
+def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...)
{
+ tree t;
+ tree *args = XALLOCAVEC (tree, n);
+ va_list list;
int i;
- if (error_operand_p (align))
- return -1;
- if (TREE_CODE (align) != INTEGER_CST
- || !INTEGRAL_TYPE_P (TREE_TYPE (align)))
- {
- error ("requested alignment is not an integer constant");
- return -1;
- }
- else if (allow_zero && integer_zerop (align))
- return -1;
- else if (tree_int_cst_sgn (align) == -1
- || (i = tree_log2 (align)) == -1)
- {
- error ("requested alignment is not a positive power of 2");
- return -1;
- }
- else if (i >= HOST_BITS_PER_INT - LOG2_BITS_PER_UNIT)
+ va_start (list, n);
+ for (i = 0; i < n; ++i)
{
- error ("requested alignment is too large");
- return -1;
+ builtin_type a = (builtin_type) va_arg (list, int);
+ t = builtin_types[a];
+ if (t == error_mark_node)
+ goto egress;
+ args[i] = t;
}
- return i;
+
+ t = builtin_types[ret];
+ if (t == error_mark_node)
+ goto egress;
+ if (var)
+ t = build_varargs_function_type_array (t, n, args);
+ else
+ t = build_function_type_array (t, n, args);
+
+ egress:
+ builtin_types[def] = t;
+ va_end (list);
}
-/*
- If in c++-11, check if the c++-11 alignment constraint with respect
- to fundamental alignment (in [dcl.align]) are satisfied. If not in
- c++-11 mode, does nothing.
+/* Build builtin functions common to both C and C++ language
+ frontends. */
- [dcl.align]2/ says:
+static void
+c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node)
+{
+#define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
+ builtin_types[ENUM] = VALUE;
+#define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
+ def_fn_type (ENUM, RETURN, 0, 0);
+#define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
+ def_fn_type (ENUM, RETURN, 0, 1, ARG1);
+#define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
+ def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
+#define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
+ def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
+#define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
+ def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
+#define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
+ def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
+#define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6) \
+ def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
+#define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6, ARG7) \
+ def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
+#define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6, ARG7, ARG8) \
+ def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
+ ARG7, ARG8);
+#define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6, ARG7, ARG8, ARG9) \
+ def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
+ ARG7, ARG8, ARG9);
+#define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6, ARG7, ARG8, ARG9, ARG10) \
+ def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
+ ARG7, ARG8, ARG9, ARG10);
+#define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
+ def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
+ ARG7, ARG8, ARG9, ARG10, ARG11);
+#define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
+ def_fn_type (ENUM, RETURN, 1, 0);
+#define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
+ def_fn_type (ENUM, RETURN, 1, 1, ARG1);
+#define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
+ def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
+#define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
+ def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
+#define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
+ def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
+#define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
+ def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
+#define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6) \
+ def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
+#define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
+ ARG6, ARG7) \
+ def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
+#define DEF_POINTER_TYPE(ENUM, TYPE) \
+ builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
- [* if the constant expression evaluates to a fundamental alignment,
- the alignment requirement of the declared entity shall be the
- specified fundamental alignment.
+#include "builtin-types.def"
- * if the constant expression evaluates to an extended alignment
- and the implementation supports that alignment in the context
- of the declaration, the alignment of the declared entity shall
- be that alignment
+#undef DEF_PRIMITIVE_TYPE
+#undef DEF_FUNCTION_TYPE_0
+#undef DEF_FUNCTION_TYPE_1
+#undef DEF_FUNCTION_TYPE_2
+#undef DEF_FUNCTION_TYPE_3
+#undef DEF_FUNCTION_TYPE_4
+#undef DEF_FUNCTION_TYPE_5
+#undef DEF_FUNCTION_TYPE_6
+#undef DEF_FUNCTION_TYPE_7
+#undef DEF_FUNCTION_TYPE_8
+#undef DEF_FUNCTION_TYPE_9
+#undef DEF_FUNCTION_TYPE_10
+#undef DEF_FUNCTION_TYPE_11
+#undef DEF_FUNCTION_TYPE_VAR_0
+#undef DEF_FUNCTION_TYPE_VAR_1
+#undef DEF_FUNCTION_TYPE_VAR_2
+#undef DEF_FUNCTION_TYPE_VAR_3
+#undef DEF_FUNCTION_TYPE_VAR_4
+#undef DEF_FUNCTION_TYPE_VAR_5
+#undef DEF_FUNCTION_TYPE_VAR_6
+#undef DEF_FUNCTION_TYPE_VAR_7
+#undef DEF_POINTER_TYPE
+ builtin_types[(int) BT_LAST] = NULL_TREE;
- * if the constant expression evaluates to an extended alignment
- and the implementation does not support that alignment in the
- context of the declaration, the program is ill-formed]. */
+ c_init_attributes ();
-static bool
-check_cxx_fundamental_alignment_constraints (tree node,
- unsigned align_log,
- int flags)
-{
- bool alignment_too_large_p = false;
- unsigned requested_alignment = 1U << align_log;
- unsigned max_align = 0;
+#define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
+ NONANSI_P, ATTRS, IMPLICIT, COND) \
+ if (NAME && COND) \
+ def_builtin_1 (ENUM, NAME, CLASS, \
+ builtin_types[(int) TYPE], \
+ builtin_types[(int) LIBTYPE], \
+ BOTH_P, FALLBACK_P, NONANSI_P, \
+ built_in_attributes[(int) ATTRS], IMPLICIT);
+#include "builtins.def"
- if ((!(flags & ATTR_FLAG_CXX11) && !warn_cxx_compat)
- || (node == NULL_TREE || node == error_mark_node))
- return true;
+ targetm.init_builtins ();
- if (cxx_fundamental_alignment_p (requested_alignment))
- return true;
+ build_common_builtin_nodes ();
- if (DECL_P (node))
- {
- if (TREE_STATIC (node))
- {
- /* For file scope variables and static members, the target
- supports alignments that are at most
- MAX_OFILE_ALIGNMENT. */
- if (requested_alignment > (max_align = MAX_OFILE_ALIGNMENT))
- alignment_too_large_p = true;
- }
- else
- {
-#ifdef BIGGEST_FIELD_ALIGNMENT
-#define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
-#else
-#define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
-#endif
- /* For non-static members, the target supports either
- alignments that at most either BIGGEST_FIELD_ALIGNMENT
- if it is defined or BIGGEST_ALIGNMENT. */
- max_align = MAX_TARGET_FIELD_ALIGNMENT;
- if (TREE_CODE (node) == FIELD_DECL
- && requested_alignment > (max_align = MAX_TARGET_FIELD_ALIGNMENT))
- alignment_too_large_p = true;
-#undef MAX_TARGET_FIELD_ALIGNMENT
- /* For stack variables, the target supports at most
- MAX_STACK_ALIGNMENT. */
- else if (decl_function_context (node) != NULL
- && requested_alignment > (max_align = MAX_STACK_ALIGNMENT))
- alignment_too_large_p = true;
- }
- }
- else if (TYPE_P (node))
- {
- /* Let's be liberal for types. */
- if (requested_alignment > (max_align = BIGGEST_ALIGNMENT))
- alignment_too_large_p = true;
- }
+ if (flag_cilkplus)
+ cilk_init_builtins ();
+}
- if (alignment_too_large_p)
- pedwarn (input_location, OPT_Wattributes,
- "requested alignment %d is larger than %d",
- requested_alignment, max_align);
+/* Like get_identifier, but avoid warnings about null arguments when
+ the argument may be NULL for targets where GCC lacks stdint.h type
+ information. */
- return !alignment_too_large_p;
+static inline tree
+c_get_ident (const char *id)
+{
+ return get_identifier (id);
}
-/* Handle a "aligned" attribute; arguments as in
- struct attribute_spec.handler. */
+/* Build tree nodes and builtin functions common to both C and C++ language
+ frontends. */
-static tree
-handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
- int flags, bool *no_add_attrs)
+void
+c_common_nodes_and_builtins (void)
{
- tree decl = NULL_TREE;
- tree *type = NULL;
- int is_type = 0;
- tree align_expr;
+ int char16_type_size;
+ int char32_type_size;
+ int wchar_type_size;
+ tree array_domain_type;
+ tree va_list_ref_type_node;
+ tree va_list_arg_type_node;
int i;
- if (args)
- {
- align_expr = TREE_VALUE (args);
- if (align_expr && TREE_CODE (align_expr) != IDENTIFIER_NODE
- && TREE_CODE (align_expr) != FUNCTION_DECL)
- align_expr = default_conversion (align_expr);
- }
- else
- align_expr = size_int (ATTRIBUTE_ALIGNED_VALUE / BITS_PER_UNIT);
+ build_common_tree_nodes (flag_signed_char);
- if (DECL_P (*node))
- {
- decl = *node;
- type = &TREE_TYPE (decl);
- is_type = TREE_CODE (*node) == TYPE_DECL;
- }
- else if (TYPE_P (*node))
- type = node, is_type = 1;
+ /* Define `int' and `char' first so that dbx will output them first. */
+ record_builtin_type (RID_INT, NULL, integer_type_node);
+ record_builtin_type (RID_CHAR, "char", char_type_node);
- if ((i = check_user_alignment (align_expr, true)) == -1
- || !check_cxx_fundamental_alignment_constraints (*node, i, flags))
- *no_add_attrs = true;
- else if (is_type)
- {
- if ((flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
- /* OK, modify the type in place. */;
- /* If we have a TYPE_DECL, then copy the type, so that we
- don't accidentally modify a builtin type. See pushdecl. */
- else if (decl && TREE_TYPE (decl) != error_mark_node
- && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
- {
- tree tt = TREE_TYPE (decl);
- *type = build_variant_type_copy (*type);
- DECL_ORIGINAL_TYPE (decl) = tt;
- TYPE_NAME (*type) = decl;
- TREE_USED (*type) = TREE_USED (decl);
- TREE_TYPE (decl) = *type;
- }
- else
- *type = build_variant_type_copy (*type);
+ /* `signed' is the same as `int'. FIXME: the declarations of "signed",
+ "unsigned long", "long long unsigned" and "unsigned short" were in C++
+ but not C. Are the conditionals here needed? */
+ if (c_dialect_cxx ())
+ record_builtin_type (RID_SIGNED, NULL, integer_type_node);
+ record_builtin_type (RID_LONG, "long int", long_integer_type_node);
+ record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
+ record_builtin_type (RID_MAX, "long unsigned int",
+ long_unsigned_type_node);
- SET_TYPE_ALIGN (*type, (1U << i) * BITS_PER_UNIT);
- TYPE_USER_ALIGN (*type) = 1;
- }
- else if (! VAR_OR_FUNCTION_DECL_P (decl)
- && TREE_CODE (decl) != FIELD_DECL)
+ for (i = 0; i < NUM_INT_N_ENTS; i ++)
{
- error ("alignment may not be specified for %q+D", decl);
- *no_add_attrs = true;
- }
- else if (DECL_USER_ALIGN (decl)
- && DECL_ALIGN (decl) > (1U << i) * BITS_PER_UNIT)
- /* C++-11 [dcl.align/4]:
-
- When multiple alignment-specifiers are specified for an
- entity, the alignment requirement shall be set to the
- strictest specified alignment.
+ char name[25];
- This formally comes from the c++11 specification but we are
- doing it for the GNU attribute syntax as well. */
- *no_add_attrs = true;
- else if (TREE_CODE (decl) == FUNCTION_DECL
- && DECL_ALIGN (decl) > (1U << i) * BITS_PER_UNIT)
- {
- if (DECL_USER_ALIGN (decl))
- error ("alignment for %q+D was previously specified as %d "
- "and may not be decreased", decl,
- DECL_ALIGN (decl) / BITS_PER_UNIT);
- else
- error ("alignment for %q+D must be at least %d", decl,
- DECL_ALIGN (decl) / BITS_PER_UNIT);
- *no_add_attrs = true;
- }
- else
- {
- SET_DECL_ALIGN (decl, (1U << i) * BITS_PER_UNIT);
- DECL_USER_ALIGN (decl) = 1;
+ sprintf (name, "__int%d", int_n_data[i].bitsize);
+ record_builtin_type ((enum rid)(RID_FIRST_INT_N + i), name,
+ int_n_trees[i].signed_type);
+ sprintf (name, "__int%d unsigned", int_n_data[i].bitsize);
+ record_builtin_type (RID_MAX, name, int_n_trees[i].unsigned_type);
}
- return NULL_TREE;
-}
+ if (c_dialect_cxx ())
+ record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
+ record_builtin_type (RID_MAX, "long long int",
+ long_long_integer_type_node);
+ record_builtin_type (RID_MAX, "long long unsigned int",
+ long_long_unsigned_type_node);
+ if (c_dialect_cxx ())
+ record_builtin_type (RID_MAX, "long long unsigned",
+ long_long_unsigned_type_node);
+ record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
+ record_builtin_type (RID_MAX, "short unsigned int",
+ short_unsigned_type_node);
+ if (c_dialect_cxx ())
+ record_builtin_type (RID_MAX, "unsigned short",
+ short_unsigned_type_node);
-/* Handle a "weak" attribute; arguments as in
- struct attribute_spec.handler. */
+ /* Define both `signed char' and `unsigned char'. */
+ record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
+ record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
-static tree
-handle_weak_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags),
- bool * ARG_UNUSED (no_add_attrs))
-{
- if (TREE_CODE (*node) == FUNCTION_DECL
- && DECL_DECLARED_INLINE_P (*node))
+ /* These are types that c_common_type_for_size and
+ c_common_type_for_mode use. */
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL, NULL_TREE,
+ intQI_type_node));
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL, NULL_TREE,
+ intHI_type_node));
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL, NULL_TREE,
+ intSI_type_node));
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL, NULL_TREE,
+ intDI_type_node));
+#if HOST_BITS_PER_WIDE_INT >= 64
+ /* Note that this is different than the __int128 type that's part of
+ the generic __intN support. */
+ if (targetm.scalar_mode_supported_p (TImode))
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL,
+ get_identifier ("__int128_t"),
+ intTI_type_node));
+#endif
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL, NULL_TREE,
+ unsigned_intQI_type_node));
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL, NULL_TREE,
+ unsigned_intHI_type_node));
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL, NULL_TREE,
+ unsigned_intSI_type_node));
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL, NULL_TREE,
+ unsigned_intDI_type_node));
+#if HOST_BITS_PER_WIDE_INT >= 64
+ if (targetm.scalar_mode_supported_p (TImode))
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL,
+ get_identifier ("__uint128_t"),
+ unsigned_intTI_type_node));
+#endif
+
+ /* Create the widest literal types. */
+ if (targetm.scalar_mode_supported_p (TImode))
{
- warning (OPT_Wattributes, "inline function %q+D declared weak", *node);
- *no_add_attrs = true;
+ widest_integer_literal_type_node = intTI_type_node;
+ widest_unsigned_literal_type_node = unsigned_intTI_type_node;
}
- else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node)))
+ else
{
- error ("indirect function %q+D cannot be declared weak", *node);
- *no_add_attrs = true;
- return NULL_TREE;
+ widest_integer_literal_type_node = intDI_type_node;
+ widest_unsigned_literal_type_node = unsigned_intDI_type_node;
}
- else if (VAR_OR_FUNCTION_DECL_P (*node))
- declare_weak (*node);
- else
- warning (OPT_Wattributes, "%qE attribute ignored", name);
-
- return NULL_TREE;
-}
-/* Handle a "noplt" attribute; arguments as in
- struct attribute_spec.handler. */
+ signed_size_type_node = c_common_signed_type (size_type_node);
-static tree
-handle_noplt_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags),
- bool * ARG_UNUSED (no_add_attrs))
-{
- if (TREE_CODE (*node) != FUNCTION_DECL)
- {
- warning (OPT_Wattributes,
- "%qE attribute is only applicable on functions", name);
- *no_add_attrs = true;
- return NULL_TREE;
- }
- return NULL_TREE;
-}
+ pid_type_node =
+ TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
-/* Handle an "alias" or "ifunc" attribute; arguments as in
- struct attribute_spec.handler, except that IS_ALIAS tells us
- whether this is an alias as opposed to ifunc attribute. */
+ record_builtin_type (RID_FLOAT, NULL, float_type_node);
+ record_builtin_type (RID_DOUBLE, NULL, double_type_node);
+ record_builtin_type (RID_MAX, "long double", long_double_type_node);
-static tree
-handle_alias_ifunc_attribute (bool is_alias, tree *node, tree name, tree args,
- bool *no_add_attrs)
-{
- tree decl = *node;
+ if (!c_dialect_cxx ())
+ for (i = 0; i < NUM_FLOATN_NX_TYPES; i++)
+ if (FLOATN_NX_TYPE_NODE (i) != NULL_TREE)
+ record_builtin_type ((enum rid) (RID_FLOATN_NX_FIRST + i), NULL,
+ FLOATN_NX_TYPE_NODE (i));
- if (TREE_CODE (decl) != FUNCTION_DECL
- && (!is_alias || !VAR_P (decl)))
+ /* Only supported decimal floating point extension if the target
+ actually supports underlying modes. */
+ if (targetm.scalar_mode_supported_p (SDmode)
+ && targetm.scalar_mode_supported_p (DDmode)
+ && targetm.scalar_mode_supported_p (TDmode))
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
+ record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node);
+ record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node);
+ record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node);
}
- else if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
- || (TREE_CODE (decl) != FUNCTION_DECL
- && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl))
- /* A static variable declaration is always a tentative definition,
- but the alias is a non-tentative definition which overrides. */
- || (TREE_CODE (decl) != FUNCTION_DECL
- && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl)))
+
+ if (targetm.fixed_point_supported_p ())
{
- error ("%q+D defined both normally and as %qE attribute", decl, name);
- *no_add_attrs = true;
- return NULL_TREE;
+ record_builtin_type (RID_MAX, "short _Fract", short_fract_type_node);
+ record_builtin_type (RID_FRACT, NULL, fract_type_node);
+ record_builtin_type (RID_MAX, "long _Fract", long_fract_type_node);
+ record_builtin_type (RID_MAX, "long long _Fract",
+ long_long_fract_type_node);
+ record_builtin_type (RID_MAX, "unsigned short _Fract",
+ unsigned_short_fract_type_node);
+ record_builtin_type (RID_MAX, "unsigned _Fract",
+ unsigned_fract_type_node);
+ record_builtin_type (RID_MAX, "unsigned long _Fract",
+ unsigned_long_fract_type_node);
+ record_builtin_type (RID_MAX, "unsigned long long _Fract",
+ unsigned_long_long_fract_type_node);
+ record_builtin_type (RID_MAX, "_Sat short _Fract",
+ sat_short_fract_type_node);
+ record_builtin_type (RID_MAX, "_Sat _Fract", sat_fract_type_node);
+ record_builtin_type (RID_MAX, "_Sat long _Fract",
+ sat_long_fract_type_node);
+ record_builtin_type (RID_MAX, "_Sat long long _Fract",
+ sat_long_long_fract_type_node);
+ record_builtin_type (RID_MAX, "_Sat unsigned short _Fract",
+ sat_unsigned_short_fract_type_node);
+ record_builtin_type (RID_MAX, "_Sat unsigned _Fract",
+ sat_unsigned_fract_type_node);
+ record_builtin_type (RID_MAX, "_Sat unsigned long _Fract",
+ sat_unsigned_long_fract_type_node);
+ record_builtin_type (RID_MAX, "_Sat unsigned long long _Fract",
+ sat_unsigned_long_long_fract_type_node);
+ record_builtin_type (RID_MAX, "short _Accum", short_accum_type_node);
+ record_builtin_type (RID_ACCUM, NULL, accum_type_node);
+ record_builtin_type (RID_MAX, "long _Accum", long_accum_type_node);
+ record_builtin_type (RID_MAX, "long long _Accum",
+ long_long_accum_type_node);
+ record_builtin_type (RID_MAX, "unsigned short _Accum",
+ unsigned_short_accum_type_node);
+ record_builtin_type (RID_MAX, "unsigned _Accum",
+ unsigned_accum_type_node);
+ record_builtin_type (RID_MAX, "unsigned long _Accum",
+ unsigned_long_accum_type_node);
+ record_builtin_type (RID_MAX, "unsigned long long _Accum",
+ unsigned_long_long_accum_type_node);
+ record_builtin_type (RID_MAX, "_Sat short _Accum",
+ sat_short_accum_type_node);
+ record_builtin_type (RID_MAX, "_Sat _Accum", sat_accum_type_node);
+ record_builtin_type (RID_MAX, "_Sat long _Accum",
+ sat_long_accum_type_node);
+ record_builtin_type (RID_MAX, "_Sat long long _Accum",
+ sat_long_long_accum_type_node);
+ record_builtin_type (RID_MAX, "_Sat unsigned short _Accum",
+ sat_unsigned_short_accum_type_node);
+ record_builtin_type (RID_MAX, "_Sat unsigned _Accum",
+ sat_unsigned_accum_type_node);
+ record_builtin_type (RID_MAX, "_Sat unsigned long _Accum",
+ sat_unsigned_long_accum_type_node);
+ record_builtin_type (RID_MAX, "_Sat unsigned long long _Accum",
+ sat_unsigned_long_long_accum_type_node);
+
}
- else if (!is_alias
- && (lookup_attribute ("weak", DECL_ATTRIBUTES (decl))
- || lookup_attribute ("weakref", DECL_ATTRIBUTES (decl))))
- {
- error ("weak %q+D cannot be defined %qE", decl, name);
- *no_add_attrs = true;
- return NULL_TREE;
- }
- /* Note that the very first time we process a nested declaration,
- decl_function_context will not be set. Indeed, *would* never
- be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
- we do below. After such frobbery, pushdecl would set the context.
- In any case, this is never what we want. */
- else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
- {
- tree id;
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL,
+ get_identifier ("complex int"),
+ complex_integer_type_node));
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL,
+ get_identifier ("complex float"),
+ complex_float_type_node));
+ lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL,
+ get_identifier ("complex double"),
+ complex_double_type_node));
+ lang_hooks.decls.pushdecl
+ (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL, get_identifier ("complex long double"),
+ complex_long_double_type_node));
- id = TREE_VALUE (args);
- if (TREE_CODE (id) != STRING_CST)
+ if (!c_dialect_cxx ())
+ for (i = 0; i < NUM_FLOATN_NX_TYPES; i++)
+ if (COMPLEX_FLOATN_NX_TYPE_NODE (i) != NULL_TREE)
{
- error ("attribute %qE argument not a string", name);
- *no_add_attrs = true;
- return NULL_TREE;
+ char buf[30];
+ sprintf (buf, "complex _Float%d%s", floatn_nx_types[i].n,
+ floatn_nx_types[i].extended ? "x" : "");
+ lang_hooks.decls.pushdecl
+ (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL,
+ get_identifier (buf),
+ COMPLEX_FLOATN_NX_TYPE_NODE (i)));
}
- id = get_identifier (TREE_STRING_POINTER (id));
- /* This counts as a use of the object pointed to. */
- TREE_USED (id) = 1;
-
- if (TREE_CODE (decl) == FUNCTION_DECL)
- DECL_INITIAL (decl) = error_mark_node;
- else
- TREE_STATIC (decl) = 1;
- if (!is_alias)
- /* ifuncs are also aliases, so set that attribute too. */
- DECL_ATTRIBUTES (decl)
- = tree_cons (get_identifier ("alias"), args, DECL_ATTRIBUTES (decl));
- }
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
-
- if (decl_in_symtab_p (*node))
+ if (c_dialect_cxx ())
{
- struct symtab_node *n = symtab_node::get (decl);
- if (n && n->refuse_visibility_changes)
- {
- if (is_alias)
- error ("%+D declared alias after being used", decl);
- else
- error ("%+D declared ifunc after being used", decl);
- }
- }
-
-
- return NULL_TREE;
-}
-
-/* Handle an "alias" or "ifunc" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_ifunc_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- return handle_alias_ifunc_attribute (false, node, name, args, no_add_attrs);
-}
-
-/* Handle an "alias" or "ifunc" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_alias_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- return handle_alias_ifunc_attribute (true, node, name, args, no_add_attrs);
-}
+ /* For C++, make fileptr_type_node a distinct void * type until
+ FILE type is defined. Likewise for const struct tm*. */
+ for (unsigned i = 0;
+ i < sizeof (builtin_structptr_types)
+ / sizeof (builtin_structptr_type);
+ ++i)
+ builtin_structptr_types[i].node =
+ build_variant_type_copy (builtin_structptr_types[i].base);
-/* Handle a "weakref" attribute; arguments as in struct
- attribute_spec.handler. */
-
-static tree
-handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args,
- int flags, bool *no_add_attrs)
-{
- tree attr = NULL_TREE;
-
- /* We must ignore the attribute when it is associated with
- local-scoped decls, since attribute alias is ignored and many
- such symbols do not even have a DECL_WEAK field. */
- if (decl_function_context (*node)
- || current_function_decl
- || !VAR_OR_FUNCTION_DECL_P (*node))
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- return NULL_TREE;
}
- if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node)))
- {
- error ("indirect function %q+D cannot be declared weakref", *node);
- *no_add_attrs = true;
- return NULL_TREE;
- }
+ record_builtin_type (RID_VOID, NULL, void_type_node);
- /* The idea here is that `weakref("name")' mutates into `weakref,
- alias("name")', and weakref without arguments, in turn,
- implicitly adds weak. */
+ /* Set the TYPE_NAME for any variants that were built before
+ record_builtin_type gave names to the built-in types. */
+ {
+ tree void_name = TYPE_NAME (void_type_node);
+ TYPE_NAME (void_type_node) = NULL_TREE;
+ TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST))
+ = void_name;
+ TYPE_NAME (void_type_node) = void_name;
+ }
- if (args)
- {
- attr = tree_cons (get_identifier ("alias"), args, attr);
- attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr);
+ void_list_node = build_void_list_node ();
- *no_add_attrs = true;
+ /* Make a type to be the domain of a few array types
+ whose domains don't really matter.
+ 200 is small enough that it always fits in size_t
+ and large enough that it can hold most function names for the
+ initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
+ array_domain_type = build_index_type (size_int (200));
- decl_attributes (node, attr, flags);
- }
- else
- {
- if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node)))
- error_at (DECL_SOURCE_LOCATION (*node),
- "weakref attribute must appear before alias attribute");
+ /* Make a type for arrays of characters.
+ With luck nothing will ever really depend on the length of this
+ array type. */
+ char_array_type_node
+ = build_array_type (char_type_node, array_domain_type);
- /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
- and that isn't supported; and because it wants to add it to
- the list of weak decls, which isn't helpful. */
- DECL_WEAK (*node) = 1;
- }
+ string_type_node = build_pointer_type (char_type_node);
+ const_string_type_node
+ = build_pointer_type (build_qualified_type
+ (char_type_node, TYPE_QUAL_CONST));
- if (decl_in_symtab_p (*node))
+ /* This is special for C++ so functions can be overloaded. */
+ wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
+ wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
+ wchar_type_size = TYPE_PRECISION (wchar_type_node);
+ underlying_wchar_type_node = wchar_type_node;
+ if (c_dialect_cxx ())
{
- struct symtab_node *n = symtab_node::get (*node);
- if (n && n->refuse_visibility_changes)
- error ("%+D declared weakref after being used", *node);
+ if (TYPE_UNSIGNED (wchar_type_node))
+ wchar_type_node = make_unsigned_type (wchar_type_size);
+ else
+ wchar_type_node = make_signed_type (wchar_type_size);
+ record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
}
- return NULL_TREE;
-}
-
-/* Handle an "visibility" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_visibility_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags),
- bool *ARG_UNUSED (no_add_attrs))
-{
- tree decl = *node;
- tree id = TREE_VALUE (args);
- enum symbol_visibility vis;
+ /* This is for wide string constants. */
+ wchar_array_type_node
+ = build_array_type (wchar_type_node, array_domain_type);
- if (TYPE_P (*node))
- {
- if (TREE_CODE (*node) == ENUMERAL_TYPE)
- /* OK */;
- else if (!RECORD_OR_UNION_TYPE_P (*node))
- {
- warning (OPT_Wattributes, "%qE attribute ignored on non-class types",
- name);
- return NULL_TREE;
- }
- else if (TYPE_FIELDS (*node))
- {
- error ("%qE attribute ignored because %qT is already defined",
- name, *node);
- return NULL_TREE;
- }
- }
- else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
+ /* Define 'char16_t'. */
+ char16_type_node = get_identifier (CHAR16_TYPE);
+ char16_type_node = TREE_TYPE (identifier_global_value (char16_type_node));
+ char16_type_size = TYPE_PRECISION (char16_type_node);
+ if (c_dialect_cxx ())
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- return NULL_TREE;
- }
+ char16_type_node = make_unsigned_type (char16_type_size);
- if (TREE_CODE (id) != STRING_CST)
- {
- error ("visibility argument not a string");
- return NULL_TREE;
+ if (cxx_dialect >= cxx11)
+ record_builtin_type (RID_CHAR16, "char16_t", char16_type_node);
}
- /* If this is a type, set the visibility on the type decl. */
- if (TYPE_P (decl))
- {
- decl = TYPE_NAME (decl);
- if (!decl)
- return NULL_TREE;
- if (TREE_CODE (decl) == IDENTIFIER_NODE)
- {
- warning (OPT_Wattributes, "%qE attribute ignored on types",
- name);
- return NULL_TREE;
- }
- }
+ /* This is for UTF-16 string constants. */
+ char16_array_type_node
+ = build_array_type (char16_type_node, array_domain_type);
- if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
- vis = VISIBILITY_DEFAULT;
- else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
- vis = VISIBILITY_INTERNAL;
- else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
- vis = VISIBILITY_HIDDEN;
- else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
- vis = VISIBILITY_PROTECTED;
- else
+ /* Define 'char32_t'. */
+ char32_type_node = get_identifier (CHAR32_TYPE);
+ char32_type_node = TREE_TYPE (identifier_global_value (char32_type_node));
+ char32_type_size = TYPE_PRECISION (char32_type_node);
+ if (c_dialect_cxx ())
{
- error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
- vis = VISIBILITY_DEFAULT;
- }
+ char32_type_node = make_unsigned_type (char32_type_size);
- if (DECL_VISIBILITY_SPECIFIED (decl)
- && vis != DECL_VISIBILITY (decl))
- {
- tree attributes = (TYPE_P (*node)
- ? TYPE_ATTRIBUTES (*node)
- : DECL_ATTRIBUTES (decl));
- if (lookup_attribute ("visibility", attributes))
- error ("%qD redeclared with different visibility", decl);
- else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
- && lookup_attribute ("dllimport", attributes))
- error ("%qD was declared %qs which implies default visibility",
- decl, "dllimport");
- else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
- && lookup_attribute ("dllexport", attributes))
- error ("%qD was declared %qs which implies default visibility",
- decl, "dllexport");
+ if (cxx_dialect >= cxx11)
+ record_builtin_type (RID_CHAR32, "char32_t", char32_type_node);
}
- DECL_VISIBILITY (decl) = vis;
- DECL_VISIBILITY_SPECIFIED (decl) = 1;
-
- /* Go ahead and attach the attribute to the node as well. This is needed
- so we can determine whether we have VISIBILITY_DEFAULT because the
- visibility was not specified, or because it was explicitly overridden
- from the containing scope. */
-
- return NULL_TREE;
-}
+ /* This is for UTF-32 string constants. */
+ char32_array_type_node
+ = build_array_type (char32_type_node, array_domain_type);
-/* Determine the ELF symbol visibility for DECL, which is either a
- variable or a function. It is an error to use this function if a
- definition of DECL is not available in this translation unit.
- Returns true if the final visibility has been determined by this
- function; false if the caller is free to make additional
- modifications. */
+ wint_type_node =
+ TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
-bool
-c_determine_visibility (tree decl)
-{
- gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
+ intmax_type_node =
+ TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
+ uintmax_type_node =
+ TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
- /* If the user explicitly specified the visibility with an
- attribute, honor that. DECL_VISIBILITY will have been set during
- the processing of the attribute. We check for an explicit
- attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
- to distinguish the use of an attribute from the use of a "#pragma
- GCC visibility push(...)"; in the latter case we still want other
- considerations to be able to overrule the #pragma. */
- if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl))
- || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
- && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl))
- || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))))
- return true;
+ if (SIG_ATOMIC_TYPE)
+ sig_atomic_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE)));
+ if (INT8_TYPE)
+ int8_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE)));
+ if (INT16_TYPE)
+ int16_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE)));
+ if (INT32_TYPE)
+ int32_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE)));
+ if (INT64_TYPE)
+ int64_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE)));
+ if (UINT8_TYPE)
+ uint8_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE)));
+ if (UINT16_TYPE)
+ c_uint16_type_node = uint16_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE)));
+ if (UINT32_TYPE)
+ c_uint32_type_node = uint32_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE)));
+ if (UINT64_TYPE)
+ c_uint64_type_node = uint64_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE)));
+ if (INT_LEAST8_TYPE)
+ int_least8_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE)));
+ if (INT_LEAST16_TYPE)
+ int_least16_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE)));
+ if (INT_LEAST32_TYPE)
+ int_least32_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE)));
+ if (INT_LEAST64_TYPE)
+ int_least64_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE)));
+ if (UINT_LEAST8_TYPE)
+ uint_least8_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE)));
+ if (UINT_LEAST16_TYPE)
+ uint_least16_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE)));
+ if (UINT_LEAST32_TYPE)
+ uint_least32_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE)));
+ if (UINT_LEAST64_TYPE)
+ uint_least64_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE)));
+ if (INT_FAST8_TYPE)
+ int_fast8_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE)));
+ if (INT_FAST16_TYPE)
+ int_fast16_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE)));
+ if (INT_FAST32_TYPE)
+ int_fast32_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE)));
+ if (INT_FAST64_TYPE)
+ int_fast64_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE)));
+ if (UINT_FAST8_TYPE)
+ uint_fast8_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE)));
+ if (UINT_FAST16_TYPE)
+ uint_fast16_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE)));
+ if (UINT_FAST32_TYPE)
+ uint_fast32_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE)));
+ if (UINT_FAST64_TYPE)
+ uint_fast64_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE)));
+ if (INTPTR_TYPE)
+ intptr_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE)));
+ if (UINTPTR_TYPE)
+ uintptr_type_node =
+ TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE)));
- /* Set default visibility to whatever the user supplied with
- visibility_specified depending on #pragma GCC visibility. */
- if (!DECL_VISIBILITY_SPECIFIED (decl))
+ default_function_type
+ = build_varargs_function_type_list (integer_type_node, NULL_TREE);
+ unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
+
+ lang_hooks.decls.pushdecl
+ (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL, get_identifier ("__builtin_va_list"),
+ va_list_type_node));
+ if (targetm.enum_va_list_p)
{
- if (visibility_options.inpragma
- || DECL_VISIBILITY (decl) != default_visibility)
+ int l;
+ const char *pname;
+ tree ptype;
+
+ for (l = 0; targetm.enum_va_list_p (l, &pname, &ptype); ++l)
{
- DECL_VISIBILITY (decl) = default_visibility;
- DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
- /* If visibility changed and DECL already has DECL_RTL, ensure
- symbol flags are updated. */
- if (((VAR_P (decl) && TREE_STATIC (decl))
- || TREE_CODE (decl) == FUNCTION_DECL)
- && DECL_RTL_SET_P (decl))
- make_decl_rtl (decl);
+ lang_hooks.decls.pushdecl
+ (build_decl (UNKNOWN_LOCATION,
+ TYPE_DECL, get_identifier (pname),
+ ptype));
+
}
}
- return false;
-}
-
-/* Handle an "tls_model" attribute; arguments as in
- struct attribute_spec.handler. */
-static tree
-handle_tls_model_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- tree id;
- tree decl = *node;
- enum tls_model kind;
-
- *no_add_attrs = true;
-
- if (!VAR_P (decl) || !DECL_THREAD_LOCAL_P (decl))
+ if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- return NULL_TREE;
+ va_list_arg_type_node = va_list_ref_type_node =
+ build_pointer_type (TREE_TYPE (va_list_type_node));
}
-
- kind = DECL_TLS_MODEL (decl);
- id = TREE_VALUE (args);
- if (TREE_CODE (id) != STRING_CST)
+ else
{
- error ("tls_model argument not a string");
- return NULL_TREE;
+ va_list_arg_type_node = va_list_type_node;
+ va_list_ref_type_node = build_reference_type (va_list_type_node);
}
- if (!strcmp (TREE_STRING_POINTER (id), "local-exec"))
- kind = TLS_MODEL_LOCAL_EXEC;
- else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec"))
- kind = TLS_MODEL_INITIAL_EXEC;
- else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic"))
- kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
- else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
- kind = TLS_MODEL_GLOBAL_DYNAMIC;
- else
- error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
-
- set_decl_tls_model (decl, kind);
- return NULL_TREE;
-}
-
-/* Handle a "no_instrument_function" attribute; arguments as in
- struct attribute_spec.handler. */
+ if (!flag_preprocess_only)
+ c_define_builtins (va_list_ref_type_node, va_list_arg_type_node);
-static tree
-handle_no_instrument_function_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags),
- bool *no_add_attrs)
-{
- tree decl = *node;
+ main_identifier_node = get_identifier ("main");
- if (TREE_CODE (decl) != FUNCTION_DECL)
- {
- error_at (DECL_SOURCE_LOCATION (decl),
- "%qE attribute applies only to functions", name);
- *no_add_attrs = true;
- }
- else
- DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
+ /* Create the built-in __null node. It is important that this is
+ not shared. */
+ null_node = make_int_cst (1, 1);
+ TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0);
- return NULL_TREE;
+ /* Since builtin_types isn't gc'ed, don't export these nodes. */
+ memset (builtin_types, 0, sizeof (builtin_types));
}
-/* Handle a "no_profile_instrument_function" attribute; arguments as in
- struct attribute_spec.handler. */
+/* The number of named compound-literals generated thus far. */
+static GTY(()) int compound_literal_number;
-static tree
-handle_no_profile_instrument_function_attribute (tree *node, tree name, tree,
- int, bool *no_add_attrs)
-{
- if (TREE_CODE (*node) != FUNCTION_DECL)
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+/* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
- return NULL_TREE;
+void
+set_compound_literal_name (tree decl)
+{
+ char *name;
+ ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal",
+ compound_literal_number);
+ compound_literal_number++;
+ DECL_NAME (decl) = get_identifier (name);
}
-/* Handle a "malloc" attribute; arguments as in
- struct attribute_spec.handler. */
+/* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
+ TYPE and operand OP. */
static tree
-handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
+build_va_arg_1 (location_t loc, tree type, tree op)
{
- if (TREE_CODE (*node) == FUNCTION_DECL
- && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node))))
- DECL_IS_MALLOC (*node) = 1;
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
-
- return NULL_TREE;
+ tree expr = build1 (VA_ARG_EXPR, type, op);
+ SET_EXPR_LOCATION (expr, loc);
+ return expr;
}
-/* Handle a "alloc_size" attribute; arguments as in
- struct attribute_spec.handler. */
+/* Return a VA_ARG_EXPR corresponding to a source-level expression
+ va_arg (EXPR, TYPE) at source location LOC. */
-static tree
-handle_alloc_size_attribute (tree *node, tree ARG_UNUSED (name), tree args,
- int ARG_UNUSED (flags), bool *no_add_attrs)
+tree
+build_va_arg (location_t loc, tree expr, tree type)
{
- unsigned arg_count = type_num_arguments (*node);
- for (; args; args = TREE_CHAIN (args))
- {
- tree position = TREE_VALUE (args);
- if (position && TREE_CODE (position) != IDENTIFIER_NODE
- && TREE_CODE (position) != FUNCTION_DECL)
- position = default_conversion (position);
-
- if (!tree_fits_uhwi_p (position)
- || !arg_count
- || !IN_RANGE (tree_to_uhwi (position), 1, arg_count))
- {
- warning (OPT_Wattributes,
- "alloc_size parameter outside range");
- *no_add_attrs = true;
- return NULL_TREE;
- }
- }
- return NULL_TREE;
-}
+ tree va_type = TREE_TYPE (expr);
+ tree canon_va_type = (va_type == error_mark_node
+ ? error_mark_node
+ : targetm.canonical_va_list_type (va_type));
-/* Handle a "alloc_align" attribute; arguments as in
- struct attribute_spec.handler. */
+ if (va_type == error_mark_node
+ || canon_va_type == NULL_TREE)
+ {
+ if (canon_va_type == NULL_TREE)
+ error_at (loc, "first argument to %<va_arg%> not of type %<va_list%>");
-static tree
-handle_alloc_align_attribute (tree *node, tree, tree args, int,
- bool *no_add_attrs)
-{
- unsigned arg_count = type_num_arguments (*node);
- tree position = TREE_VALUE (args);
- if (position && TREE_CODE (position) != IDENTIFIER_NODE
- && TREE_CODE (position) != FUNCTION_DECL)
- position = default_conversion (position);
-
- if (!tree_fits_uhwi_p (position)
- || !arg_count
- || !IN_RANGE (tree_to_uhwi (position), 1, arg_count))
- {
- warning (OPT_Wattributes,
- "alloc_align parameter outside range");
- *no_add_attrs = true;
- return NULL_TREE;
+ /* Let's handle things neutrallly, if expr:
+ - has undeclared type, or
+ - is not an va_list type. */
+ return build_va_arg_1 (loc, type, error_mark_node);
}
- return NULL_TREE;
-}
-/* Handle a "assume_aligned" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_assume_aligned_attribute (tree *, tree, tree args, int,
- bool *no_add_attrs)
-{
- for (; args; args = TREE_CHAIN (args))
+ if (TREE_CODE (canon_va_type) != ARRAY_TYPE)
{
- tree position = TREE_VALUE (args);
- if (position && TREE_CODE (position) != IDENTIFIER_NODE
- && TREE_CODE (position) != FUNCTION_DECL)
- position = default_conversion (position);
+ /* Case 1: Not an array type. */
- if (TREE_CODE (position) != INTEGER_CST)
- {
- warning (OPT_Wattributes,
- "assume_aligned parameter not integer constant");
- *no_add_attrs = true;
- return NULL_TREE;
- }
+ /* Take the address, to get '&ap'. Note that &ap is not a va_list
+ type. */
+ mark_addressable (expr);
+ expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (expr)), expr);
+
+ return build_va_arg_1 (loc, type, expr);
}
- return NULL_TREE;
-}
-/* Handle a "fn spec" attribute; arguments as in
- struct attribute_spec.handler. */
+ /* Case 2: Array type.
-static tree
-handle_fnspec_attribute (tree *node ATTRIBUTE_UNUSED, tree ARG_UNUSED (name),
- tree args, int ARG_UNUSED (flags),
- bool *no_add_attrs ATTRIBUTE_UNUSED)
-{
- gcc_assert (args
- && TREE_CODE (TREE_VALUE (args)) == STRING_CST
- && !TREE_CHAIN (args));
- return NULL_TREE;
-}
+ Background:
-/* Handle a "bnd_variable_size" attribute; arguments as in
- struct attribute_spec.handler. */
+ For contrast, let's start with the simple case (case 1). If
+ canon_va_type is not an array type, but say a char *, then when
+ passing-by-value a va_list, the type of the va_list param decl is
+ the same as for another va_list decl (all ap's are char *):
-static tree
-handle_bnd_variable_size_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- if (TREE_CODE (*node) != FIELD_DECL)
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ f2_1 (char * ap)
+ D.1815 = VA_ARG (&ap, 0B, 1);
+ return D.1815;
- return NULL_TREE;
-}
+ f2 (int i)
+ char * ap.0;
+ char * ap;
+ __builtin_va_start (&ap, 0);
+ ap.0 = ap;
+ res = f2_1 (ap.0);
+ __builtin_va_end (&ap);
+ D.1812 = res;
+ return D.1812;
-/* Handle a "bnd_legacy" attribute; arguments as in
- struct attribute_spec.handler. */
+ However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
+ va_list the type of the va_list param decl (case 2b, struct * ap) is not
+ the same as for another va_list decl (case 2a, struct ap[1]).
-static tree
-handle_bnd_legacy (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- if (TREE_CODE (*node) != FUNCTION_DECL)
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ f2_1 (struct * ap)
+ D.1844 = VA_ARG (ap, 0B, 0);
+ return D.1844;
- return NULL_TREE;
-}
+ f2 (int i)
+ struct ap[1];
+ __builtin_va_start (&ap, 0);
+ res = f2_1 (&ap);
+ __builtin_va_end (&ap);
+ D.1841 = res;
+ return D.1841;
+
+ Case 2b is different because:
+ - on the callee side, the parm decl has declared type va_list, but
+ grokdeclarator changes the type of the parm decl to a pointer to the
+ array elem type.
+ - on the caller side, the pass-by-value uses &ap.
-/* Handle a "bnd_instrument" attribute; arguments as in
- struct attribute_spec.handler. */
+ We unify these two cases (case 2a: va_list is array type,
+ case 2b: va_list is pointer to array elem type), by adding '&' for the
+ array type case, such that we have a pointer to array elem in both
+ cases. */
-static tree
-handle_bnd_instrument (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- if (TREE_CODE (*node) != FUNCTION_DECL)
+ if (TREE_CODE (va_type) == ARRAY_TYPE)
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
-
- return NULL_TREE;
-}
+ /* Case 2a: va_list is array type. */
-/* Handle a "warn_unused" attribute; arguments as in
- struct attribute_spec.handler. */
+ /* Take the address, to get '&ap'. Make sure it's a pointer to array
+ elem type. */
+ mark_addressable (expr);
+ expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (canon_va_type)),
+ expr);
-static tree
-handle_warn_unused_attribute (tree *node, tree name,
- tree args ATTRIBUTE_UNUSED,
- int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
-{
- if (TYPE_P (*node))
- /* Do nothing else, just set the attribute. We'll get at
- it later with lookup_attribute. */
- ;
+ /* Verify that &ap is still recognized as having va_list type. */
+ tree canon_expr_type
+ = targetm.canonical_va_list_type (TREE_TYPE (expr));
+ gcc_assert (canon_expr_type != NULL_TREE);
+ }
else
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ /* Case 2b: va_list is pointer to array elem type. */
+ gcc_assert (POINTER_TYPE_P (va_type));
- return NULL_TREE;
-}
+ /* Comparison as in std_canonical_va_list_type. */
+ gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (va_type))
+ == TYPE_MAIN_VARIANT (TREE_TYPE (canon_va_type)));
-/* Handle an "omp declare simd" attribute; arguments as in
- struct attribute_spec.handler. */
+ /* Don't take the address. We've already got '&ap'. */
+ ;
+ }
-static tree
-handle_omp_declare_simd_attribute (tree *, tree, tree, int, bool *)
-{
- return NULL_TREE;
+ return build_va_arg_1 (loc, type, expr);
}
-/* Handle a "simd" attribute. */
-static tree
-handle_simd_attribute (tree *node, tree name, tree args, int, bool *no_add_attrs)
+/* Linked list of disabled built-in functions. */
+
+struct disabled_builtin
{
- if (TREE_CODE (*node) == FUNCTION_DECL)
- {
- if (lookup_attribute ("cilk simd function",
- DECL_ATTRIBUTES (*node)) != NULL)
- {
- error_at (DECL_SOURCE_LOCATION (*node),
- "%<__simd__%> attribute cannot be used in the same "
- "function marked as a Cilk Plus SIMD-enabled function");
- *no_add_attrs = true;
- }
- else
- {
- tree t = get_identifier ("omp declare simd");
- tree attr = NULL_TREE;
- if (args)
- {
- tree id = TREE_VALUE (args);
+ const char *name;
+ struct disabled_builtin *next;
+};
+static disabled_builtin *disabled_builtins = NULL;
- if (TREE_CODE (id) != STRING_CST)
- {
- error ("attribute %qE argument not a string", name);
- *no_add_attrs = true;
- return NULL_TREE;
- }
+static bool builtin_function_disabled_p (const char *);
- if (strcmp (TREE_STRING_POINTER (id), "notinbranch") == 0)
- attr = build_omp_clause (DECL_SOURCE_LOCATION (*node),
- OMP_CLAUSE_NOTINBRANCH);
- else
- if (strcmp (TREE_STRING_POINTER (id), "inbranch") == 0)
- attr = build_omp_clause (DECL_SOURCE_LOCATION (*node),
- OMP_CLAUSE_INBRANCH);
- else
- {
- error ("only %<inbranch%> and %<notinbranch%> flags are "
- "allowed for %<__simd__%> attribute");
- *no_add_attrs = true;
- return NULL_TREE;
- }
- }
+/* Disable a built-in function specified by -fno-builtin-NAME. If NAME
+ begins with "__builtin_", give an error. */
- DECL_ATTRIBUTES (*node) = tree_cons (t,
- build_tree_list (NULL_TREE,
- attr),
- DECL_ATTRIBUTES (*node));
- }
- }
+void
+disable_builtin_function (const char *name)
+{
+ if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
+ error ("cannot disable built-in function %qs", name);
else
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
+ disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
+ new_disabled_builtin->name = name;
+ new_disabled_builtin->next = disabled_builtins;
+ disabled_builtins = new_disabled_builtin;
}
-
- return NULL_TREE;
}
-/* Handle an "omp declare target" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_omp_declare_target_attribute (tree *, tree, tree, int, bool *)
-{
- return NULL_TREE;
-}
-/* Handle a "returns_twice" attribute; arguments as in
- struct attribute_spec.handler. */
+/* Return true if the built-in function NAME has been disabled, false
+ otherwise. */
-static tree
-handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
+static bool
+builtin_function_disabled_p (const char *name)
{
- if (TREE_CODE (*node) == FUNCTION_DECL)
- DECL_IS_RETURNS_TWICE (*node) = 1;
- else
+ disabled_builtin *p;
+ for (p = disabled_builtins; p != NULL; p = p->next)
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
+ if (strcmp (name, p->name) == 0)
+ return true;
}
-
- return NULL_TREE;
+ return false;
}
-/* Handle a "no_limit_stack" attribute; arguments as in
- struct attribute_spec.handler. */
-static tree
-handle_no_limit_stack_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags),
- bool *no_add_attrs)
+/* Worker for DEF_BUILTIN.
+ Possibly define a builtin function with one or two names.
+ Does not declare a non-__builtin_ function if flag_no_builtin, or if
+ nonansi_p and flag_no_nonansi_builtin. */
+
+static void
+def_builtin_1 (enum built_in_function fncode,
+ const char *name,
+ enum built_in_class fnclass,
+ tree fntype, tree libtype,
+ bool both_p, bool fallback_p, bool nonansi_p,
+ tree fnattrs, bool implicit_p)
{
- tree decl = *node;
+ tree decl;
+ const char *libname;
- if (TREE_CODE (decl) != FUNCTION_DECL)
- {
- error_at (DECL_SOURCE_LOCATION (decl),
- "%qE attribute applies only to functions", name);
- *no_add_attrs = true;
- }
- else if (DECL_INITIAL (decl))
- {
- error_at (DECL_SOURCE_LOCATION (decl),
- "can%'t set %qE attribute after definition", name);
- *no_add_attrs = true;
- }
- else
- DECL_NO_LIMIT_STACK (decl) = 1;
+ if (fntype == error_mark_node)
+ return;
- return NULL_TREE;
-}
+ gcc_assert ((!both_p && !fallback_p)
+ || !strncmp (name, "__builtin_",
+ strlen ("__builtin_")));
+
+ libname = name + strlen ("__builtin_");
+ decl = add_builtin_function (name, fntype, fncode, fnclass,
+ (fallback_p ? libname : NULL),
+ fnattrs);
-/* Handle a "pure" attribute; arguments as in
- struct attribute_spec.handler. */
+ set_builtin_decl (fncode, decl, implicit_p);
-static tree
-handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
+ if (both_p
+ && !flag_no_builtin && !builtin_function_disabled_p (libname)
+ && !(nonansi_p && flag_no_nonansi_builtin))
+ add_builtin_function (libname, libtype, fncode, fnclass,
+ NULL, fnattrs);
+}
+\f
+/* Nonzero if the type T promotes to int. This is (nearly) the
+ integral promotions defined in ISO C99 6.3.1.1/2. */
+
+bool
+c_promoting_integer_type_p (const_tree t)
{
- if (TREE_CODE (*node) == FUNCTION_DECL)
- DECL_PURE_P (*node) = 1;
- /* ??? TODO: Support types. */
- else
+ switch (TREE_CODE (t))
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
+ case INTEGER_TYPE:
+ return (TYPE_MAIN_VARIANT (t) == char_type_node
+ || TYPE_MAIN_VARIANT (t) == signed_char_type_node
+ || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
+ || TYPE_MAIN_VARIANT (t) == short_integer_type_node
+ || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
+ || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
- return NULL_TREE;
+ case ENUMERAL_TYPE:
+ /* ??? Technically all enumerations not larger than an int
+ promote to an int. But this is used along code paths
+ that only want to notice a size change. */
+ return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
+
+ case BOOLEAN_TYPE:
+ return true;
+
+ default:
+ return false;
+ }
}
-/* Digest an attribute list destined for a transactional memory statement.
- ALLOWED is the set of attributes that are allowed for this statement;
- return the attribute we parsed. Multiple attributes are never allowed. */
+/* Return 1 if PARMS specifies a fixed number of parameters
+ and none of their types is affected by default promotions. */
-int
-parse_tm_stmt_attr (tree attrs, int allowed)
+bool
+self_promoting_args_p (const_tree parms)
{
- tree a_seen = NULL;
- int m_seen = 0;
-
- for ( ; attrs ; attrs = TREE_CHAIN (attrs))
+ const_tree t;
+ for (t = parms; t; t = TREE_CHAIN (t))
{
- tree a = TREE_PURPOSE (attrs);
- int m = 0;
+ tree type = TREE_VALUE (t);
- if (is_attribute_p ("outer", a))
- m = TM_STMT_ATTR_OUTER;
+ if (type == error_mark_node)
+ continue;
- if ((m & allowed) == 0)
- {
- warning (OPT_Wattributes, "%qE attribute directive ignored", a);
- continue;
- }
+ if (TREE_CHAIN (t) == NULL_TREE && type != void_type_node)
+ return false;
- if (m_seen == 0)
- {
- a_seen = a;
- m_seen = m;
- }
- else if (m_seen == m)
- warning (OPT_Wattributes, "%qE attribute duplicated", a);
- else
- warning (OPT_Wattributes, "%qE attribute follows %qE", a, a_seen);
- }
+ if (type == NULL_TREE)
+ return false;
- return m_seen;
-}
+ if (TYPE_MAIN_VARIANT (type) == float_type_node)
+ return false;
-/* Transform a TM attribute name into a maskable integer and back.
- Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
- to how the lack of an attribute is treated. */
+ if (c_promoting_integer_type_p (type))
+ return false;
+ }
+ return true;
+}
-int
-tm_attr_to_mask (tree attr)
+/* Recursively remove any '*' or '&' operator from TYPE. */
+tree
+strip_pointer_operator (tree t)
{
- if (attr == NULL)
- return 0;
- if (is_attribute_p ("transaction_safe", attr))
- return TM_ATTR_SAFE;
- if (is_attribute_p ("transaction_callable", attr))
- return TM_ATTR_CALLABLE;
- if (is_attribute_p ("transaction_pure", attr))
- return TM_ATTR_PURE;
- if (is_attribute_p ("transaction_unsafe", attr))
- return TM_ATTR_IRREVOCABLE;
- if (is_attribute_p ("transaction_may_cancel_outer", attr))
- return TM_ATTR_MAY_CANCEL_OUTER;
- return 0;
+ while (POINTER_TYPE_P (t))
+ t = TREE_TYPE (t);
+ return t;
}
+/* Recursively remove pointer or array type from TYPE. */
tree
-tm_mask_to_attr (int mask)
+strip_pointer_or_array_types (tree t)
{
- const char *str;
- switch (mask)
- {
- case TM_ATTR_SAFE:
- str = "transaction_safe";
- break;
- case TM_ATTR_CALLABLE:
- str = "transaction_callable";
- break;
- case TM_ATTR_PURE:
- str = "transaction_pure";
- break;
- case TM_ATTR_IRREVOCABLE:
- str = "transaction_unsafe";
- break;
- case TM_ATTR_MAY_CANCEL_OUTER:
- str = "transaction_may_cancel_outer";
- break;
- default:
- gcc_unreachable ();
- }
- return get_identifier (str);
+ while (TREE_CODE (t) == ARRAY_TYPE || POINTER_TYPE_P (t))
+ t = TREE_TYPE (t);
+ return t;
}
-/* Return the first TM attribute seen in LIST. */
+/* Used to compare case labels. K1 and K2 are actually tree nodes
+ representing case labels, or NULL_TREE for a `default' label.
+ Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
+ K2, and 0 if K1 and K2 are equal. */
-tree
-find_tm_attribute (tree list)
+int
+case_compare (splay_tree_key k1, splay_tree_key k2)
{
- for (; list ; list = TREE_CHAIN (list))
- {
- tree name = TREE_PURPOSE (list);
- if (tm_attr_to_mask (name) != 0)
- return name;
- }
- return NULL_TREE;
+ /* Consider a NULL key (such as arises with a `default' label) to be
+ smaller than anything else. */
+ if (!k1)
+ return k2 ? -1 : 0;
+ else if (!k2)
+ return k1 ? 1 : 0;
+
+ return tree_int_cst_compare ((tree) k1, (tree) k2);
}
-/* Handle the TM attributes; arguments as in struct attribute_spec.handler.
- Here we accept only function types, and verify that none of the other
- function TM attributes are also applied. */
-/* ??? We need to accept class types for C++, but not C. This greatly
- complicates this function, since we can no longer rely on the extra
- processing given by function_type_required. */
+/* Process a case label, located at LOC, for the range LOW_VALUE
+ ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
+ then this case label is actually a `default' label. If only
+ HIGH_VALUE is NULL_TREE, then case label was declared using the
+ usual C/C++ syntax, rather than the GNU case range extension.
+ CASES is a tree containing all the case ranges processed so far;
+ COND is the condition for the switch-statement itself.
+ OUTSIDE_RANGE_P says whether there was a case value that doesn't
+ fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
+ created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
-static tree
-handle_tm_attribute (tree *node, tree name, tree args,
- int flags, bool *no_add_attrs)
+tree
+c_add_case_label (location_t loc, splay_tree cases, tree cond, tree orig_type,
+ tree low_value, tree high_value, bool *outside_range_p)
{
- /* Only one path adds the attribute; others don't. */
- *no_add_attrs = true;
-
- switch (TREE_CODE (*node))
- {
- case RECORD_TYPE:
- case UNION_TYPE:
- /* Only tm_callable and tm_safe apply to classes. */
- if (tm_attr_to_mask (name) & ~(TM_ATTR_SAFE | TM_ATTR_CALLABLE))
- goto ignored;
- /* FALLTHRU */
+ tree type;
+ tree label;
+ tree case_label;
+ splay_tree_node node;
- case FUNCTION_TYPE:
- case METHOD_TYPE:
- {
- tree old_name = find_tm_attribute (TYPE_ATTRIBUTES (*node));
- if (old_name == name)
- ;
- else if (old_name != NULL_TREE)
- error ("type was previously declared %qE", old_name);
- else
- *no_add_attrs = false;
- }
- break;
+ /* Create the LABEL_DECL itself. */
+ label = create_artificial_label (loc);
- case FUNCTION_DECL:
- {
- /* transaction_safe_dynamic goes on the FUNCTION_DECL, but we also
- want to set transaction_safe on the type. */
- gcc_assert (is_attribute_p ("transaction_safe_dynamic", name));
- if (!TYPE_P (DECL_CONTEXT (*node)))
- error_at (DECL_SOURCE_LOCATION (*node),
- "%<transaction_safe_dynamic%> may only be specified for "
- "a virtual function");
- *no_add_attrs = false;
- decl_attributes (&TREE_TYPE (*node),
- build_tree_list (get_identifier ("transaction_safe"),
- NULL_TREE),
- 0);
- break;
- }
+ /* If there was an error processing the switch condition, bail now
+ before we get more confused. */
+ if (!cond || cond == error_mark_node)
+ goto error_out;
- case POINTER_TYPE:
- {
- enum tree_code subcode = TREE_CODE (TREE_TYPE (*node));
- if (subcode == FUNCTION_TYPE || subcode == METHOD_TYPE)
- {
- tree fn_tmp = TREE_TYPE (*node);
- decl_attributes (&fn_tmp, tree_cons (name, args, NULL), 0);
- *node = build_pointer_type (fn_tmp);
- break;
- }
- }
- /* FALLTHRU */
+ if ((low_value && TREE_TYPE (low_value)
+ && POINTER_TYPE_P (TREE_TYPE (low_value)))
+ || (high_value && TREE_TYPE (high_value)
+ && POINTER_TYPE_P (TREE_TYPE (high_value))))
+ {
+ error_at (loc, "pointers are not permitted as case values");
+ goto error_out;
+ }
- default:
- /* If a function is next, pass it on to be tried next. */
- if (flags & (int) ATTR_FLAG_FUNCTION_NEXT)
- return tree_cons (name, args, NULL);
+ /* Case ranges are a GNU extension. */
+ if (high_value)
+ pedwarn (loc, OPT_Wpedantic,
+ "range expressions in switch statements are non-standard");
- ignored:
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- break;
+ type = TREE_TYPE (cond);
+ if (low_value)
+ {
+ low_value = check_case_value (loc, low_value);
+ low_value = convert_and_check (loc, type, low_value);
+ if (low_value == error_mark_node)
+ goto error_out;
+ }
+ if (high_value)
+ {
+ high_value = check_case_value (loc, high_value);
+ high_value = convert_and_check (loc, type, high_value);
+ if (high_value == error_mark_node)
+ goto error_out;
}
- return NULL_TREE;
-}
+ if (low_value && high_value)
+ {
+ /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
+ really a case range, even though it was written that way.
+ Remove the HIGH_VALUE to simplify later processing. */
+ if (tree_int_cst_equal (low_value, high_value))
+ high_value = NULL_TREE;
+ else if (!tree_int_cst_lt (low_value, high_value))
+ warning_at (loc, 0, "empty range specified");
+ }
-/* Handle the TM_WRAP attribute; arguments as in
- struct attribute_spec.handler. */
+ /* See if the case is in range of the type of the original testing
+ expression. If both low_value and high_value are out of range,
+ don't insert the case label and return NULL_TREE. */
+ if (low_value
+ && !check_case_bounds (loc, type, orig_type,
+ &low_value, high_value ? &high_value : NULL,
+ outside_range_p))
+ return NULL_TREE;
-static tree
-handle_tm_wrap_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- tree decl = *node;
+ /* Look up the LOW_VALUE in the table of case labels we already
+ have. */
+ node = splay_tree_lookup (cases, (splay_tree_key) low_value);
+ /* If there was not an exact match, check for overlapping ranges.
+ There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
+ that's a `default' label and the only overlap is an exact match. */
+ if (!node && (low_value || high_value))
+ {
+ splay_tree_node low_bound;
+ splay_tree_node high_bound;
- /* We don't need the attribute even on success, since we
- record the entry in an external table. */
- *no_add_attrs = true;
+ /* Even though there wasn't an exact match, there might be an
+ overlap between this case range and another case range.
+ Since we've (inductively) not allowed any overlapping case
+ ranges, we simply need to find the greatest low case label
+ that is smaller that LOW_VALUE, and the smallest low case
+ label that is greater than LOW_VALUE. If there is an overlap
+ it will occur in one of these two ranges. */
+ low_bound = splay_tree_predecessor (cases,
+ (splay_tree_key) low_value);
+ high_bound = splay_tree_successor (cases,
+ (splay_tree_key) low_value);
- if (TREE_CODE (decl) != FUNCTION_DECL)
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- else
+ /* Check to see if the LOW_BOUND overlaps. It is smaller than
+ the LOW_VALUE, so there is no need to check unless the
+ LOW_BOUND is in fact itself a case range. */
+ if (low_bound
+ && CASE_HIGH ((tree) low_bound->value)
+ && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
+ low_value) >= 0)
+ node = low_bound;
+ /* Check to see if the HIGH_BOUND overlaps. The low end of that
+ range is bigger than the low end of the current range, so we
+ are only interested if the current range is a real range, and
+ not an ordinary case label. */
+ else if (high_bound
+ && high_value
+ && (tree_int_cst_compare ((tree) high_bound->key,
+ high_value)
+ <= 0))
+ node = high_bound;
+ }
+ /* If there was an overlap, issue an error. */
+ if (node)
{
- tree wrap_decl = TREE_VALUE (args);
- if (error_operand_p (wrap_decl))
- ;
- else if (TREE_CODE (wrap_decl) != IDENTIFIER_NODE
- && !VAR_OR_FUNCTION_DECL_P (wrap_decl))
- error ("%qE argument not an identifier", name);
+ tree duplicate = CASE_LABEL ((tree) node->value);
+
+ if (high_value)
+ {
+ error_at (loc, "duplicate (or overlapping) case value");
+ inform (DECL_SOURCE_LOCATION (duplicate),
+ "this is the first entry overlapping that value");
+ }
+ else if (low_value)
+ {
+ error_at (loc, "duplicate case value") ;
+ inform (DECL_SOURCE_LOCATION (duplicate), "previously used here");
+ }
else
{
- if (TREE_CODE (wrap_decl) == IDENTIFIER_NODE)
- wrap_decl = lookup_name (wrap_decl);
- if (wrap_decl && TREE_CODE (wrap_decl) == FUNCTION_DECL)
- {
- if (lang_hooks.types_compatible_p (TREE_TYPE (decl),
- TREE_TYPE (wrap_decl)))
- record_tm_replacement (wrap_decl, decl);
- else
- error ("%qD is not compatible with %qD", wrap_decl, decl);
- }
- else
- error ("%qE argument is not a function", name);
+ error_at (loc, "multiple default labels in one switch");
+ inform (DECL_SOURCE_LOCATION (duplicate),
+ "this is the first default label");
}
+ goto error_out;
}
- return NULL_TREE;
-}
+ /* Add a CASE_LABEL to the statement-tree. */
+ case_label = add_stmt (build_case_label (low_value, high_value, label));
+ /* Register this case label in the splay tree. */
+ splay_tree_insert (cases,
+ (splay_tree_key) low_value,
+ (splay_tree_value) case_label);
-/* Ignore the given attribute. Used when this attribute may be usefully
- overridden by the target, but is not used generically. */
+ return case_label;
-static tree
-ignore_attribute (tree * ARG_UNUSED (node), tree ARG_UNUSED (name),
- tree ARG_UNUSED (args), int ARG_UNUSED (flags),
- bool *no_add_attrs)
-{
- *no_add_attrs = true;
- return NULL_TREE;
+ error_out:
+ /* Add a label so that the back-end doesn't think that the beginning of
+ the switch is unreachable. Note that we do not add a case label, as
+ that just leads to duplicates and thence to failure later on. */
+ if (!cases->root)
+ {
+ tree t = create_artificial_label (loc);
+ add_stmt (build_stmt (loc, LABEL_EXPR, t));
+ }
+ return error_mark_node;
}
-/* Handle a "no vops" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_novops_attribute (tree *node, tree ARG_UNUSED (name),
- tree ARG_UNUSED (args), int ARG_UNUSED (flags),
- bool *ARG_UNUSED (no_add_attrs))
-{
- gcc_assert (TREE_CODE (*node) == FUNCTION_DECL);
- DECL_IS_NOVOPS (*node) = 1;
- return NULL_TREE;
-}
+/* Finish an expression taking the address of LABEL (an
+ IDENTIFIER_NODE). Returns an expression for the address.
-/* Handle a "deprecated" attribute; arguments as in
- struct attribute_spec.handler. */
+ LOC is the location for the expression returned. */
-static tree
-handle_deprecated_attribute (tree *node, tree name,
- tree args, int flags,
- bool *no_add_attrs)
+tree
+finish_label_address_expr (tree label, location_t loc)
{
- tree type = NULL_TREE;
- int warn = 0;
- tree what = NULL_TREE;
+ tree result;
- if (!args)
- *no_add_attrs = true;
- else if (TREE_CODE (TREE_VALUE (args)) != STRING_CST)
- {
- error ("deprecated message is not a string");
- *no_add_attrs = true;
- }
+ pedwarn (input_location, OPT_Wpedantic, "taking the address of a label is non-standard");
- if (DECL_P (*node))
- {
- tree decl = *node;
- type = TREE_TYPE (decl);
+ if (label == error_mark_node)
+ return error_mark_node;
- if (TREE_CODE (decl) == TYPE_DECL
- || TREE_CODE (decl) == PARM_DECL
- || VAR_OR_FUNCTION_DECL_P (decl)
- || TREE_CODE (decl) == FIELD_DECL
- || TREE_CODE (decl) == CONST_DECL
- || objc_method_decl (TREE_CODE (decl)))
- TREE_DEPRECATED (decl) = 1;
- else
- warn = 1;
- }
- else if (TYPE_P (*node))
- {
- if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
- *node = build_variant_type_copy (*node);
- TREE_DEPRECATED (*node) = 1;
- type = *node;
- }
+ label = lookup_label (label);
+ if (label == NULL_TREE)
+ result = null_pointer_node;
else
- warn = 1;
-
- if (warn)
{
- *no_add_attrs = true;
- if (type && TYPE_NAME (type))
- {
- if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
- what = TYPE_NAME (*node);
- else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
- && DECL_NAME (TYPE_NAME (type)))
- what = DECL_NAME (TYPE_NAME (type));
- }
- if (what)
- warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what);
- else
- warning (OPT_Wattributes, "%qE attribute ignored", name);
+ TREE_USED (label) = 1;
+ result = build1 (ADDR_EXPR, ptr_type_node, label);
+ /* The current function is not necessarily uninlinable.
+ Computed gotos are incompatible with inlining, but the value
+ here could be used only in a diagnostic, for example. */
+ protected_set_expr_location (result, loc);
}
- return NULL_TREE;
+ return result;
}
+\f
-/* Handle a "vector_size" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_vector_size_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags),
- bool *no_add_attrs)
+/* Given a boolean expression ARG, return a tree representing an increment
+ or decrement (as indicated by CODE) of ARG. The front end must check for
+ invalid cases (e.g., decrement in C++). */
+tree
+boolean_increment (enum tree_code code, tree arg)
{
- unsigned HOST_WIDE_INT vecsize, nunits;
- machine_mode orig_mode;
- tree type = *node, new_type, size;
-
- *no_add_attrs = true;
-
- size = TREE_VALUE (args);
- if (size && TREE_CODE (size) != IDENTIFIER_NODE
- && TREE_CODE (size) != FUNCTION_DECL)
- size = default_conversion (size);
+ tree val;
+ tree true_res = build_int_cst (TREE_TYPE (arg), 1);
- if (!tree_fits_uhwi_p (size))
+ arg = stabilize_reference (arg);
+ switch (code)
{
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- return NULL_TREE;
+ case PREINCREMENT_EXPR:
+ val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
+ break;
+ case POSTINCREMENT_EXPR:
+ val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
+ arg = save_expr (arg);
+ val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
+ val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
+ break;
+ case PREDECREMENT_EXPR:
+ val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
+ invert_truthvalue_loc (input_location, arg));
+ break;
+ case POSTDECREMENT_EXPR:
+ val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
+ invert_truthvalue_loc (input_location, arg));
+ arg = save_expr (arg);
+ val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
+ val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
+ break;
+ default:
+ gcc_unreachable ();
}
+ TREE_SIDE_EFFECTS (val) = 1;
+ return val;
+}
+\f
+/* Built-in macros for stddef.h and stdint.h, that require macros
+ defined in this file. */
+void
+c_stddef_cpp_builtins(void)
+{
+ builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
+ builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
+ builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
+ builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
+ builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
+ builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
+ builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE, 0);
+ builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE, 0);
+ if (SIG_ATOMIC_TYPE)
+ builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE, 0);
+ if (INT8_TYPE)
+ builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE, 0);
+ if (INT16_TYPE)
+ builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE, 0);
+ if (INT32_TYPE)
+ builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE, 0);
+ if (INT64_TYPE)
+ builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE, 0);
+ if (UINT8_TYPE)
+ builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE, 0);
+ if (UINT16_TYPE)
+ builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE, 0);
+ if (UINT32_TYPE)
+ builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE, 0);
+ if (UINT64_TYPE)
+ builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE, 0);
+ if (INT_LEAST8_TYPE)
+ builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE, 0);
+ if (INT_LEAST16_TYPE)
+ builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE, 0);
+ if (INT_LEAST32_TYPE)
+ builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE, 0);
+ if (INT_LEAST64_TYPE)
+ builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE, 0);
+ if (UINT_LEAST8_TYPE)
+ builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE, 0);
+ if (UINT_LEAST16_TYPE)
+ builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE, 0);
+ if (UINT_LEAST32_TYPE)
+ builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE, 0);
+ if (UINT_LEAST64_TYPE)
+ builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE, 0);
+ if (INT_FAST8_TYPE)
+ builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE, 0);
+ if (INT_FAST16_TYPE)
+ builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE, 0);
+ if (INT_FAST32_TYPE)
+ builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE, 0);
+ if (INT_FAST64_TYPE)
+ builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE, 0);
+ if (UINT_FAST8_TYPE)
+ builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE, 0);
+ if (UINT_FAST16_TYPE)
+ builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE, 0);
+ if (UINT_FAST32_TYPE)
+ builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE, 0);
+ if (UINT_FAST64_TYPE)
+ builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE, 0);
+ if (INTPTR_TYPE)
+ builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE, 0);
+ if (UINTPTR_TYPE)
+ builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE, 0);
+}
- /* Get the vector size (in bytes). */
- vecsize = tree_to_uhwi (size);
-
- /* We need to provide for vector pointers, vector arrays, and
- functions returning vectors. For example:
-
- __attribute__((vector_size(16))) short *foo;
-
- In this case, the mode is SI, but the type being modified is
- HI, so we need to look further. */
-
- while (POINTER_TYPE_P (type)
- || TREE_CODE (type) == FUNCTION_TYPE
- || TREE_CODE (type) == METHOD_TYPE
- || TREE_CODE (type) == ARRAY_TYPE
- || TREE_CODE (type) == OFFSET_TYPE)
- type = TREE_TYPE (type);
-
- /* Get the mode of the type being modified. */
- orig_mode = TYPE_MODE (type);
+static void
+c_init_attributes (void)
+{
+ /* Fill in the built_in_attributes array. */
+#define DEF_ATTR_NULL_TREE(ENUM) \
+ built_in_attributes[(int) ENUM] = NULL_TREE;
+#define DEF_ATTR_INT(ENUM, VALUE) \
+ built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
+#define DEF_ATTR_STRING(ENUM, VALUE) \
+ built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
+#define DEF_ATTR_IDENT(ENUM, STRING) \
+ built_in_attributes[(int) ENUM] = get_identifier (STRING);
+#define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
+ built_in_attributes[(int) ENUM] \
+ = tree_cons (built_in_attributes[(int) PURPOSE], \
+ built_in_attributes[(int) VALUE], \
+ built_in_attributes[(int) CHAIN]);
+#include "builtin-attrs.def"
+#undef DEF_ATTR_NULL_TREE
+#undef DEF_ATTR_INT
+#undef DEF_ATTR_IDENT
+#undef DEF_ATTR_TREE_LIST
+}
- if ((!INTEGRAL_TYPE_P (type)
- && !SCALAR_FLOAT_TYPE_P (type)
- && !FIXED_POINT_TYPE_P (type))
- || (!SCALAR_FLOAT_MODE_P (orig_mode)
- && GET_MODE_CLASS (orig_mode) != MODE_INT
- && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode))
- || !tree_fits_uhwi_p (TYPE_SIZE_UNIT (type))
- || TREE_CODE (type) == BOOLEAN_TYPE)
- {
- error ("invalid vector type for attribute %qE", name);
- return NULL_TREE;
- }
+/* Check whether ALIGN is a valid user-specified alignment. If so,
+ return its base-2 log; if not, output an error and return -1. If
+ ALLOW_ZERO then 0 is valid and should result in a return of -1 with
+ no error. */
+int
+check_user_alignment (const_tree align, bool allow_zero)
+{
+ int i;
- if (vecsize % tree_to_uhwi (TYPE_SIZE_UNIT (type)))
+ if (error_operand_p (align))
+ return -1;
+ if (TREE_CODE (align) != INTEGER_CST
+ || !INTEGRAL_TYPE_P (TREE_TYPE (align)))
{
- error ("vector size not an integral multiple of component size");
- return NULL;
+ error ("requested alignment is not an integer constant");
+ return -1;
}
-
- if (vecsize == 0)
+ else if (allow_zero && integer_zerop (align))
+ return -1;
+ else if (tree_int_cst_sgn (align) == -1
+ || (i = tree_log2 (align)) == -1)
{
- error ("zero vector size");
- return NULL;
+ error ("requested alignment is not a positive power of 2");
+ return -1;
}
-
- /* Calculate how many units fit in the vector. */
- nunits = vecsize / tree_to_uhwi (TYPE_SIZE_UNIT (type));
- if (nunits & (nunits - 1))
+ else if (i >= HOST_BITS_PER_INT - LOG2_BITS_PER_UNIT)
{
- error ("number of components of the vector not a power of two");
- return NULL_TREE;
+ error ("requested alignment is too large");
+ return -1;
}
-
- new_type = build_vector_type (type, nunits);
-
- /* Build back pointers if needed. */
- *node = lang_hooks.types.reconstruct_complex_type (*node, new_type);
-
- return NULL_TREE;
+ return i;
}
-/* Handle the "nonnull" attribute. */
-static tree
-handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
- tree args, int ARG_UNUSED (flags),
- bool *no_add_attrs)
-{
- tree type = *node;
- unsigned HOST_WIDE_INT attr_arg_num;
-
- /* If no arguments are specified, all pointer arguments should be
- non-null. Verify a full prototype is given so that the arguments
- will have the correct types when we actually check them later.
- Avoid diagnosing type-generic built-ins since those have no
- prototype. */
- if (!args)
- {
- if (!prototype_p (type)
- && (!TYPE_ATTRIBUTES (type)
- || !lookup_attribute ("type generic", TYPE_ATTRIBUTES (type))))
- {
- error ("nonnull attribute without arguments on a non-prototype");
- *no_add_attrs = true;
- }
- return NULL_TREE;
- }
-
- /* Argument list specified. Verify that each argument number references
- a pointer argument. */
- for (attr_arg_num = 1; args; attr_arg_num++, args = TREE_CHAIN (args))
- {
- unsigned HOST_WIDE_INT arg_num = 0, ck_num;
+/* Determine the ELF symbol visibility for DECL, which is either a
+ variable or a function. It is an error to use this function if a
+ definition of DECL is not available in this translation unit.
+ Returns true if the final visibility has been determined by this
+ function; false if the caller is free to make additional
+ modifications. */
- tree arg = TREE_VALUE (args);
- if (arg && TREE_CODE (arg) != IDENTIFIER_NODE
- && TREE_CODE (arg) != FUNCTION_DECL)
- arg = default_conversion (arg);
+bool
+c_determine_visibility (tree decl)
+{
+ gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
- if (!get_nonnull_operand (arg, &arg_num))
- {
- error ("nonnull argument has invalid operand number (argument %lu)",
- (unsigned long) attr_arg_num);
- *no_add_attrs = true;
- return NULL_TREE;
- }
+ /* If the user explicitly specified the visibility with an
+ attribute, honor that. DECL_VISIBILITY will have been set during
+ the processing of the attribute. We check for an explicit
+ attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
+ to distinguish the use of an attribute from the use of a "#pragma
+ GCC visibility push(...)"; in the latter case we still want other
+ considerations to be able to overrule the #pragma. */
+ if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl))
+ || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
+ && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl))
+ || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))))
+ return true;
- if (prototype_p (type))
+ /* Set default visibility to whatever the user supplied with
+ visibility_specified depending on #pragma GCC visibility. */
+ if (!DECL_VISIBILITY_SPECIFIED (decl))
+ {
+ if (visibility_options.inpragma
+ || DECL_VISIBILITY (decl) != default_visibility)
{
- function_args_iterator iter;
- tree argument;
-
- function_args_iter_init (&iter, type);
- for (ck_num = 1; ; ck_num++, function_args_iter_next (&iter))
- {
- argument = function_args_iter_cond (&iter);
- if (argument == NULL_TREE || ck_num == arg_num)
- break;
- }
-
- if (!argument
- || TREE_CODE (argument) == VOID_TYPE)
- {
- error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
- (unsigned long) attr_arg_num, (unsigned long) arg_num);
- *no_add_attrs = true;
- return NULL_TREE;
- }
-
- if (TREE_CODE (argument) != POINTER_TYPE)
- {
- error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
- (unsigned long) attr_arg_num, (unsigned long) arg_num);
- *no_add_attrs = true;
- return NULL_TREE;
- }
+ DECL_VISIBILITY (decl) = default_visibility;
+ DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
+ /* If visibility changed and DECL already has DECL_RTL, ensure
+ symbol flags are updated. */
+ if (((VAR_P (decl) && TREE_STATIC (decl))
+ || TREE_CODE (decl) == FUNCTION_DECL)
+ && DECL_RTL_SET_P (decl))
+ make_decl_rtl (decl);
}
}
-
- return NULL_TREE;
+ return false;
}
+/* Data to communicate through check_function_arguments_recurse between
+ check_function_nonnull and check_nonnull_arg. */
+
+struct nonnull_arg_ctx
+{
+ location_t loc;
+ bool warned_p;
+};
+
/* Check the argument list of a function call for null in argument slots
that are marked as requiring a non-null pointer argument. The NARGS
- arguments are passed in the array ARGARRAY. */
+ arguments are passed in the array ARGARRAY. Return true if we have
+ warned. */
-static void
+static bool
check_function_nonnull (location_t loc, tree attrs, int nargs, tree *argarray)
{
tree a;
attrs = lookup_attribute ("nonnull", attrs);
if (attrs == NULL_TREE)
- return;
+ return false;
a = attrs;
/* See if any of the nonnull attributes has no arguments. If so,
a = lookup_attribute ("nonnull", TREE_CHAIN (a));
while (a != NULL_TREE && TREE_VALUE (a) != NULL_TREE);
+ struct nonnull_arg_ctx ctx = { loc, false };
if (a != NULL_TREE)
for (i = 0; i < nargs; i++)
- check_function_arguments_recurse (check_nonnull_arg, &loc, argarray[i],
+ check_function_arguments_recurse (check_nonnull_arg, &ctx, argarray[i],
i + 1);
else
{
}
if (a != NULL_TREE)
- check_function_arguments_recurse (check_nonnull_arg, &loc,
+ check_function_arguments_recurse (check_nonnull_arg, &ctx,
argarray[i], i + 1);
}
}
+ return ctx.warned_p;
}
/* Check that the Nth argument of a function call (counting backwards
}
}
+/* Check that the same argument isn't passed to restrict arguments
+ and other arguments. */
+
+static void
+check_function_restrict (const_tree fndecl, const_tree fntype,
+ int nargs, tree *argarray)
+{
+ int i;
+ tree parms;
+
+ if (fndecl
+ && TREE_CODE (fndecl) == FUNCTION_DECL
+ && DECL_ARGUMENTS (fndecl))
+ parms = DECL_ARGUMENTS (fndecl);
+ else
+ parms = TYPE_ARG_TYPES (fntype);
+
+ for (i = 0; i < nargs; i++)
+ TREE_VISITED (argarray[i]) = 0;
+
+ for (i = 0; i < nargs && parms && parms != void_list_node; i++)
+ {
+ tree type;
+ if (TREE_CODE (parms) == PARM_DECL)
+ {
+ type = TREE_TYPE (parms);
+ parms = DECL_CHAIN (parms);
+ }
+ else
+ {
+ type = TREE_VALUE (parms);
+ parms = TREE_CHAIN (parms);
+ }
+ if (POINTER_TYPE_P (type)
+ && TYPE_RESTRICT (type)
+ && !TYPE_READONLY (TREE_TYPE (type)))
+ warn_for_restrict (i, argarray, nargs);
+ }
+
+ for (i = 0; i < nargs; i++)
+ TREE_VISITED (argarray[i]) = 0;
+}
+
/* Helper for check_function_nonnull; given a list of operands which
must be non-null in ARGS, determine if operand PARAM_NUM should be
checked. */
static void
check_nonnull_arg (void *ctx, tree param, unsigned HOST_WIDE_INT param_num)
{
- location_t *ploc = (location_t *) ctx;
+ struct nonnull_arg_ctx *pctx = (struct nonnull_arg_ctx *) ctx;
/* Just skip checking the argument if it's not a pointer. This can
happen if the "nonnull" attribute was given without an operand
if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
return;
+ /* When not optimizing diagnose the simple cases of null arguments.
+ When optimization is enabled defer the checking until expansion
+ when more cases can be detected. */
if (integer_zerop (param))
- warning_at (*ploc, OPT_Wnonnull, "null argument where non-null required "
- "(argument %lu)", (unsigned long) param_num);
+ {
+ warning_at (pctx->loc, OPT_Wnonnull, "null argument where non-null "
+ "required (argument %lu)", (unsigned long) param_num);
+ pctx->warned_p = true;
+ }
}
/* Helper for nonnull attribute handling; fetch the operand number
from the attribute argument list. */
-static bool
+bool
get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
{
/* Verify the arg number is a small constant. */
return false;
}
-/* Handle a "nothrow" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- if (TREE_CODE (*node) == FUNCTION_DECL)
- TREE_NOTHROW (*node) = 1;
- /* ??? TODO: Support types. */
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
-
- return NULL_TREE;
-}
-
-/* Handle a "cleanup" attribute; arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_cleanup_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- tree decl = *node;
- tree cleanup_id, cleanup_decl;
-
- /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
- for global destructors in C++. This requires infrastructure that
- we don't have generically at the moment. It's also not a feature
- we'd be missing too much, since we do have attribute constructor. */
- if (!VAR_P (decl) || TREE_STATIC (decl))
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- return NULL_TREE;
- }
-
- /* Verify that the argument is a function in scope. */
- /* ??? We could support pointers to functions here as well, if
- that was considered desirable. */
- cleanup_id = TREE_VALUE (args);
- if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
- {
- error ("cleanup argument not an identifier");
- *no_add_attrs = true;
- return NULL_TREE;
- }
- cleanup_decl = lookup_name (cleanup_id);
- if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
- {
- error ("cleanup argument not a function");
- *no_add_attrs = true;
- return NULL_TREE;
- }
-
- /* That the function has proper type is checked with the
- eventual call to build_function_call. */
-
- return NULL_TREE;
-}
-
-/* Handle a "warn_unused_result" attribute. No special handling. */
-
-static tree
-handle_warn_unused_result_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- /* Ignore the attribute for functions not returning any value. */
- if (VOID_TYPE_P (TREE_TYPE (*node)))
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
-
- return NULL_TREE;
-}
-
-/* Handle a "sentinel" attribute. */
-
-static tree
-handle_sentinel_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- if (!prototype_p (*node))
- {
- warning (OPT_Wattributes,
- "%qE attribute requires prototypes with named arguments", name);
- *no_add_attrs = true;
- }
- else
- {
- if (!stdarg_p (*node))
- {
- warning (OPT_Wattributes,
- "%qE attribute only applies to variadic functions", name);
- *no_add_attrs = true;
- }
- }
-
- if (args)
- {
- tree position = TREE_VALUE (args);
- if (position && TREE_CODE (position) != IDENTIFIER_NODE
- && TREE_CODE (position) != FUNCTION_DECL)
- position = default_conversion (position);
-
- if (TREE_CODE (position) != INTEGER_CST
- || !INTEGRAL_TYPE_P (TREE_TYPE (position)))
- {
- warning (OPT_Wattributes,
- "requested position is not an integer constant");
- *no_add_attrs = true;
- }
- else
- {
- if (tree_int_cst_lt (position, integer_zero_node))
- {
- warning (OPT_Wattributes,
- "requested position is less than zero");
- *no_add_attrs = true;
- }
- }
- }
-
- return NULL_TREE;
-}
-
-/* Handle a "type_generic" attribute. */
-
-static tree
-handle_type_generic_attribute (tree *node, tree ARG_UNUSED (name),
- tree ARG_UNUSED (args), int ARG_UNUSED (flags),
- bool * ARG_UNUSED (no_add_attrs))
-{
- /* Ensure we have a function type. */
- gcc_assert (TREE_CODE (*node) == FUNCTION_TYPE);
-
- /* Ensure we have a variadic function. */
- gcc_assert (!prototype_p (*node) || stdarg_p (*node));
-
- return NULL_TREE;
-}
-
-/* Handle a "target" attribute. */
-
-static tree
-handle_target_attribute (tree *node, tree name, tree args, int flags,
- bool *no_add_attrs)
-{
- /* Ensure we have a function type. */
- if (TREE_CODE (*node) != FUNCTION_DECL)
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
- else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node)))
- {
- warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
- "with %qs attribute", name, "target_clones");
- *no_add_attrs = true;
- }
- else if (! targetm.target_option.valid_attribute_p (*node, name, args,
- flags))
- *no_add_attrs = true;
-
- return NULL_TREE;
-}
-
-/* Handle a "target_clones" attribute. */
-
-static tree
-handle_target_clones_attribute (tree *node, tree name, tree ARG_UNUSED (args),
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- /* Ensure we have a function type. */
- if (TREE_CODE (*node) == FUNCTION_DECL)
- {
- if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node)))
- {
- warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
- "with %qs attribute", name, "always_inline");
- *no_add_attrs = true;
- }
- else if (lookup_attribute ("target", DECL_ATTRIBUTES (*node)))
- {
- warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
- "with %qs attribute", name, "target");
- *no_add_attrs = true;
- }
- else
- /* Do not inline functions with multiple clone targets. */
- DECL_UNINLINABLE (*node) = 1;
- }
- else
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
- return NULL_TREE;
-}
-
/* Arguments being collected for optimization. */
typedef const char *const_char_p; /* For DEF_VEC_P. */
static GTY(()) vec<const_char_p, va_gc> *optimize_args;
decoded_options[j] = decoded_options[i];
j++;
}
- decoded_options_count = j;
- /* And apply them. */
- decode_options (&global_options, &global_options_set,
- decoded_options, decoded_options_count,
- input_location, global_dc);
-
- targetm.override_options_after_change();
-
- optimize_args->truncate (0);
- return ret;
-}
-
-/* For handling "optimize" attribute. arguments as in
- struct attribute_spec.handler. */
-
-static tree
-handle_optimize_attribute (tree *node, tree name, tree args,
- int ARG_UNUSED (flags), bool *no_add_attrs)
-{
- /* Ensure we have a function type. */
- if (TREE_CODE (*node) != FUNCTION_DECL)
- {
- warning (OPT_Wattributes, "%qE attribute ignored", name);
- *no_add_attrs = true;
- }
- else
- {
- struct cl_optimization cur_opts;
- tree old_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node);
-
- /* Save current options. */
- cl_optimization_save (&cur_opts, &global_options);
-
- /* If we previously had some optimization options, use them as the
- default. */
- if (old_opts)
- cl_optimization_restore (&global_options,
- TREE_OPTIMIZATION (old_opts));
-
- /* Parse options, and update the vector. */
- parse_optimize_options (args, true);
- DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node)
- = build_optimization_node (&global_options);
-
- /* Restore current options. */
- cl_optimization_restore (&global_options, &cur_opts);
- }
-
- return NULL_TREE;
-}
-
-/* Handle a "no_split_stack" attribute. */
-
-static tree
-handle_no_split_stack_attribute (tree *node, tree name,
- tree ARG_UNUSED (args),
- int ARG_UNUSED (flags),
- bool *no_add_attrs)
-{
- tree decl = *node;
-
- if (TREE_CODE (decl) != FUNCTION_DECL)
- {
- error_at (DECL_SOURCE_LOCATION (decl),
- "%qE attribute applies only to functions", name);
- *no_add_attrs = true;
- }
- else if (DECL_INITIAL (decl))
- {
- error_at (DECL_SOURCE_LOCATION (decl),
- "can%'t set %qE attribute after definition", name);
- *no_add_attrs = true;
- }
-
- return NULL_TREE;
-}
+ decoded_options_count = j;
+ /* And apply them. */
+ decode_options (&global_options, &global_options_set,
+ decoded_options, decoded_options_count,
+ input_location, global_dc, NULL);
-/* Handle a "returns_nonnull" attribute; arguments as in
- struct attribute_spec.handler. */
+ targetm.override_options_after_change();
-static tree
-handle_returns_nonnull_attribute (tree *node, tree, tree, int,
- bool *no_add_attrs)
-{
- // Even without a prototype we still have a return type we can check.
- if (TREE_CODE (TREE_TYPE (*node)) != POINTER_TYPE)
- {
- error ("returns_nonnull attribute on a function not returning a pointer");
- *no_add_attrs = true;
- }
- return NULL_TREE;
+ optimize_args->truncate (0);
+ return ret;
}
-/* Handle a "designated_init" attribute; arguments as in
- struct attribute_spec.handler. */
+/* Check whether ATTR is a valid attribute fallthrough. */
-static tree
-handle_designated_init_attribute (tree *node, tree name, tree, int,
- bool *no_add_attrs)
+bool
+attribute_fallthrough_p (tree attr)
{
- if (TREE_CODE (*node) != RECORD_TYPE)
- {
- error ("%qE attribute is only valid on %<struct%> type", name);
- *no_add_attrs = true;
+ if (attr == error_mark_node)
+ return false;
+ tree t = lookup_attribute ("fallthrough", attr);
+ if (t == NULL_TREE)
+ return false;
+ /* This attribute shall appear at most once in each attribute-list. */
+ if (lookup_attribute ("fallthrough", TREE_CHAIN (t)))
+ warning (OPT_Wattributes, "%<fallthrough%> attribute specified multiple "
+ "times");
+ /* No attribute-argument-clause shall be present. */
+ else if (TREE_VALUE (t) != NULL_TREE)
+ warning (OPT_Wattributes, "%<fallthrough%> attribute specified with "
+ "a parameter");
+ /* Warn if other attributes are found. */
+ for (t = attr; t != NULL_TREE; t = TREE_CHAIN (t))
+ {
+ tree name = get_attribute_name (t);
+ if (!is_attribute_p ("fallthrough", name))
+ warning (OPT_Wattributes, "%qE attribute ignored", name);
}
- return NULL_TREE;
+ return true;
}
\f
/* Check for valid arguments being passed to a function with FNTYPE.
There are NARGS arguments in the array ARGARRAY. LOC should be used for
- diagnostics. */
-void
-check_function_arguments (location_t loc, const_tree fntype, int nargs,
- tree *argarray)
+ diagnostics. Return true if -Wnonnull warning has been diagnosed. */
+bool
+check_function_arguments (location_t loc, const_tree fndecl, const_tree fntype,
+ int nargs, tree *argarray, vec<location_t> *arglocs)
{
+ bool warned_p = false;
+
/* Check for null being passed in a pointer argument that must be
non-null. We also need to do this if format checking is enabled. */
if (warn_nonnull)
- check_function_nonnull (loc, TYPE_ATTRIBUTES (fntype), nargs, argarray);
+ warned_p = check_function_nonnull (loc, TYPE_ATTRIBUTES (fntype),
+ nargs, argarray);
/* Check for errors in format strings. */
if (warn_format || warn_suggest_attribute_format)
- check_function_format (TYPE_ATTRIBUTES (fntype), nargs, argarray);
+ check_function_format (TYPE_ATTRIBUTES (fntype), nargs, argarray, arglocs);
if (warn_format)
check_function_sentinel (fntype, nargs, argarray);
+
+ if (warn_restrict)
+ check_function_restrict (fndecl, fntype, nargs, argarray);
+ return warned_p;
}
/* Generic argument checking recursion routine. PARAM is the argument to
format_num = tree_to_uhwi (format_num_expr);
for (inner_arg = first_call_expr_arg (param, &iter), i = 1;
- inner_arg != 0;
+ inner_arg != NULL_TREE;
inner_arg = next_call_expr_arg (&iter), i++)
if (i == format_num)
{
switch (DECL_FUNCTION_CODE (fndecl))
{
+ case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX:
+ if (!tree_fits_uhwi_p (args[2]))
+ {
+ error_at (ARG_LOCATION (2),
+ "third argument to function %qE must be a constant integer",
+ fndecl);
+ return false;
+ }
+ /* fall through */
+
case BUILT_IN_ALLOCA_WITH_ALIGN:
{
/* Get the requested alignment (in bits) if it's a constant
}
}
-/* Function to help qsort sort FIELD_DECLs by name order. */
-
-int
-field_decl_cmp (const void *x_p, const void *y_p)
-{
- const tree *const x = (const tree *const) x_p;
- const tree *const y = (const tree *const) y_p;
-
- if (DECL_NAME (*x) == DECL_NAME (*y))
- /* A nontype is "greater" than a type. */
- return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
- if (DECL_NAME (*x) == NULL_TREE)
- return -1;
- if (DECL_NAME (*y) == NULL_TREE)
- return 1;
- if (DECL_NAME (*x) < DECL_NAME (*y))
- return -1;
- return 1;
-}
-
-static struct {
- gt_pointer_operator new_value;
- void *cookie;
-} resort_data;
-
-/* This routine compares two fields like field_decl_cmp but using the
-pointer operator in resort_data. */
-
-static int
-resort_field_decl_cmp (const void *x_p, const void *y_p)
-{
- const tree *const x = (const tree *const) x_p;
- const tree *const y = (const tree *const) y_p;
-
- if (DECL_NAME (*x) == DECL_NAME (*y))
- /* A nontype is "greater" than a type. */
- return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
- if (DECL_NAME (*x) == NULL_TREE)
- return -1;
- if (DECL_NAME (*y) == NULL_TREE)
- return 1;
- {
- tree d1 = DECL_NAME (*x);
- tree d2 = DECL_NAME (*y);
- resort_data.new_value (&d1, resort_data.cookie);
- resort_data.new_value (&d2, resort_data.cookie);
- if (d1 < d2)
- return -1;
- }
- return 1;
-}
-
-/* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
-
-void
-resort_sorted_fields (void *obj,
- void * ARG_UNUSED (orig_obj),
- gt_pointer_operator new_value,
- void *cookie)
-{
- struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
- resort_data.new_value = new_value;
- resort_data.cookie = cookie;
- qsort (&sf->elts[0], sf->len, sizeof (tree),
- resort_field_decl_cmp);
-}
-
/* Subroutine of c_parse_error.
Return the result of concatenating LHS and RHS. RHS is really
a string literal, its first character is indicated by RHS_START and
static char *
catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
{
- const int lhs_size = strlen (lhs);
+ const size_t lhs_size = strlen (lhs);
char *result = XNEWVEC (char, lhs_size + rhs_size);
- strncpy (result, lhs, lhs_size);
- strncpy (result + lhs_size, rhs_start, rhs_size);
+ memcpy (result, lhs, lhs_size);
+ memcpy (result + lhs_size, rhs_start, rhs_size);
return result;
}
-/* Issue the error given by GMSGID, indicating that it occurred before
- TOKEN, which had the associated VALUE. */
+/* Issue the error given by GMSGID at RICHLOC, indicating that it occurred
+ before TOKEN, which had the associated VALUE. */
void
c_parse_error (const char *gmsgid, enum cpp_ttype token_type,
- tree value, unsigned char token_flags)
+ tree value, unsigned char token_flags,
+ rich_location *richloc)
{
#define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
else
message = catenate_messages (gmsgid, " before %s'\\x%x'");
- error (message, prefix, val);
+ error_at (richloc, message, prefix, val);
free (message);
message = NULL;
}
else if (token_type == CPP_NAME)
{
message = catenate_messages (gmsgid, " before %qE");
- error (message, value);
+ error_at (richloc, message, value);
free (message);
message = NULL;
}
else if (token_type < N_TTYPES)
{
message = catenate_messages (gmsgid, " before %qs token");
- error (message, cpp_type2name (token_type, token_flags));
+ error_at (richloc, message, cpp_type2name (token_type, token_flags));
free (message);
message = NULL;
}
else
- error (gmsgid);
+ error_at (richloc, gmsgid);
if (message)
{
- error (message);
+ error_at (richloc, message);
free (message);
}
#undef catenate_messages
richloc, dlevel);
diagnostic_override_option_index (&diagnostic,
c_option_controlling_cpp_error (reason));
- ret = report_diagnostic (&diagnostic);
+ ret = diagnostic_report_diagnostic (global_dc, &diagnostic);
if (level == CPP_DL_WARNING_SYSHDR)
global_dc->dc_warn_system_headers = save_warn_system_headers;
return ret;
return convert (size_type_node, fold_offsetof_1 (expr));
}
-/* Warn for A ?: C expressions (with B omitted) where A is a boolean
- expression, because B will always be true. */
-
-void
-warn_for_omitted_condop (location_t location, tree cond)
-{
- if (truth_value_p (TREE_CODE (cond)))
- warning_at (location, OPT_Wparentheses,
- "the omitted middle operand in ?: will always be %<true%>, "
- "suggest explicit middle operand");
-}
-
-/* Give an error for storing into ARG, which is 'const'. USE indicates
- how ARG was being used. */
-
-void
-readonly_error (location_t loc, tree arg, enum lvalue_use use)
-{
- gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
- || use == lv_asm);
- /* Using this macro rather than (for example) arrays of messages
- ensures that all the format strings are checked at compile
- time. */
-#define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
- : (use == lv_increment ? (I) \
- : (use == lv_decrement ? (D) : (AS))))
- if (TREE_CODE (arg) == COMPONENT_REF)
- {
- if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
- error_at (loc, READONLY_MSG (G_("assignment of member "
- "%qD in read-only object"),
- G_("increment of member "
- "%qD in read-only object"),
- G_("decrement of member "
- "%qD in read-only object"),
- G_("member %qD in read-only object "
- "used as %<asm%> output")),
- TREE_OPERAND (arg, 1));
- else
- error_at (loc, READONLY_MSG (G_("assignment of read-only member %qD"),
- G_("increment of read-only member %qD"),
- G_("decrement of read-only member %qD"),
- G_("read-only member %qD used as %<asm%> output")),
- TREE_OPERAND (arg, 1));
- }
- else if (VAR_P (arg))
- error_at (loc, READONLY_MSG (G_("assignment of read-only variable %qD"),
- G_("increment of read-only variable %qD"),
- G_("decrement of read-only variable %qD"),
- G_("read-only variable %qD used as %<asm%> output")),
- arg);
- else if (TREE_CODE (arg) == PARM_DECL)
- error_at (loc, READONLY_MSG (G_("assignment of read-only parameter %qD"),
- G_("increment of read-only parameter %qD"),
- G_("decrement of read-only parameter %qD"),
- G_("read-only parameter %qD use as %<asm%> output")),
- arg);
- else if (TREE_CODE (arg) == RESULT_DECL)
- {
- gcc_assert (c_dialect_cxx ());
- error_at (loc, READONLY_MSG (G_("assignment of "
- "read-only named return value %qD"),
- G_("increment of "
- "read-only named return value %qD"),
- G_("decrement of "
- "read-only named return value %qD"),
- G_("read-only named return value %qD "
- "used as %<asm%>output")),
- arg);
- }
- else if (TREE_CODE (arg) == FUNCTION_DECL)
- error_at (loc, READONLY_MSG (G_("assignment of function %qD"),
- G_("increment of function %qD"),
- G_("decrement of function %qD"),
- G_("function %qD used as %<asm%> output")),
- arg);
- else
- error_at (loc, READONLY_MSG (G_("assignment of read-only location %qE"),
- G_("increment of read-only location %qE"),
- G_("decrement of read-only location %qE"),
- G_("read-only location %qE used as %<asm%> output")),
- arg);
-}
-
-/* Print an error message for an invalid lvalue. USE says
- how the lvalue is being used and so selects the error message. LOC
- is the location for the error. */
-
-void
-lvalue_error (location_t loc, enum lvalue_use use)
-{
- switch (use)
- {
- case lv_assign:
- error_at (loc, "lvalue required as left operand of assignment");
- break;
- case lv_increment:
- error_at (loc, "lvalue required as increment operand");
- break;
- case lv_decrement:
- error_at (loc, "lvalue required as decrement operand");
- break;
- case lv_addressof:
- error_at (loc, "lvalue required as unary %<&%> operand");
- break;
- case lv_asm:
- error_at (loc, "lvalue required in asm statement");
- break;
- default:
- gcc_unreachable ();
- }
-}
-
-/* Print an error message for an invalid indirection of type TYPE.
- ERRSTRING is the name of the operator for the indirection. */
-
-void
-invalid_indirection_error (location_t loc, tree type, ref_operator errstring)
-{
- switch (errstring)
- {
- case RO_NULL:
- gcc_assert (c_dialect_cxx ());
- error_at (loc, "invalid type argument (have %qT)", type);
- break;
- case RO_ARRAY_INDEXING:
- error_at (loc,
- "invalid type argument of array indexing (have %qT)",
- type);
- break;
- case RO_UNARY_STAR:
- error_at (loc,
- "invalid type argument of unary %<*%> (have %qT)",
- type);
- break;
- case RO_ARROW:
- error_at (loc,
- "invalid type argument of %<->%> (have %qT)",
- type);
- break;
- case RO_ARROW_STAR:
- error_at (loc,
- "invalid type argument of %<->*%> (have %qT)",
- type);
- break;
- case RO_IMPLICIT_CONVERSION:
- error_at (loc,
- "invalid type argument of implicit conversion (have %qT)",
- type);
- break;
- default:
- gcc_unreachable ();
- }
-}
\f
/* *PTYPE is an incomplete array. Complete it with a domain based on
INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
{
tree maxindex, type, main_type, elt, unqual_elt;
int failure = 0, quals;
- hashval_t hashcode = 0;
bool overflow_p = false;
maxindex = size_zero_node;
TYPE_DOMAIN (main_type)
= build_range_type (TREE_TYPE (maxindex),
build_int_cst (TREE_TYPE (maxindex), 0), maxindex);
+ TYPE_TYPELESS_STORAGE (main_type) = TYPE_TYPELESS_STORAGE (type);
layout_type (main_type);
/* Make sure we have the canonical MAIN_TYPE. */
- hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode);
- hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)),
- hashcode);
+ hashval_t hashcode = type_hash_canon_hash (main_type);
main_type = type_hash_canon (hashcode, main_type);
/* Fix the canonical type. */
!= TYPE_DOMAIN (main_type)))
TYPE_CANONICAL (main_type)
= build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type)),
- TYPE_CANONICAL (TYPE_DOMAIN (main_type)));
+ TYPE_CANONICAL (TYPE_DOMAIN (main_type)),
+ TYPE_TYPELESS_STORAGE (main_type));
else
TYPE_CANONICAL (main_type) = main_type;
void
c_common_mark_addressable_vec (tree t)
{
+ if (TREE_CODE (t) == C_MAYBE_CONST_EXPR)
+ t = C_MAYBE_CONST_EXPR_EXPR (t);
while (handled_component_p (t))
t = TREE_OPERAND (t, 0);
- if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
+ if (!VAR_P (t)
+ && TREE_CODE (t) != PARM_DECL
+ && TREE_CODE (t) != COMPOUND_LITERAL_EXPR)
return;
- TREE_ADDRESSABLE (t) = 1;
+ if (!VAR_P (t) || !DECL_HARD_REGISTER (t))
+ TREE_ADDRESSABLE (t) = 1;
}
}
argtype = type = TREE_TYPE ((*params)[0]);
- if (TREE_CODE (type) == ARRAY_TYPE)
+ if (TREE_CODE (type) == ARRAY_TYPE && c_dialect_cxx ())
{
/* Force array-to-pointer decay for C++. */
- gcc_assert (c_dialect_cxx());
(*params)[0] = default_conversion ((*params)[0]);
type = TREE_TYPE ((*params)[0]);
}
if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type))
goto incompatible;
+ if (!COMPLETE_TYPE_P (type))
+ goto incompatible;
+
if (fetch && TREE_CODE (type) == BOOLEAN_TYPE)
goto incompatible;
/* Get type of first parameter, and determine its size. */
type_0 = TREE_TYPE ((*params)[0]);
- if (TREE_CODE (type_0) == ARRAY_TYPE)
+ if (TREE_CODE (type_0) == ARRAY_TYPE && c_dialect_cxx ())
{
/* Force array-to-pointer decay for C++. */
- gcc_assert (c_dialect_cxx());
(*params)[0] = default_conversion ((*params)[0]);
type_0 = TREE_TYPE ((*params)[0]);
}
/* __atomic_compare_exchange has a bool in the 4th position, skip it. */
if (n_param == 6 && x == 3)
continue;
+ if (TREE_CODE (type) == ARRAY_TYPE && c_dialect_cxx ())
+ {
+ /* Force array-to-pointer decay for C++. */
+ (*params)[x] = default_conversion ((*params)[x]);
+ type = TREE_TYPE ((*params)[x]);
+ }
if (!POINTER_TYPE_P (type))
{
error_at (loc, "argument %d of %qE must be a pointer type", x + 1,
function);
return 0;
}
+ else if (TYPE_SIZE_UNIT (TREE_TYPE (type))
+ && TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type))))
+ != INTEGER_CST)
+ {
+ error_at (loc, "argument %d of %qE must be a pointer to a constant "
+ "size type", x + 1, function);
+ return 0;
+ }
+ else if (FUNCTION_POINTER_TYPE_P (type))
+ {
+ error_at (loc, "argument %d of %qE must not be a pointer to a "
+ "function", x + 1, function);
+ return 0;
+ }
tree type_size = TYPE_SIZE_UNIT (TREE_TYPE (type));
size = type_size ? tree_to_uhwi (type_size) : 0;
if (size != size_0)
tree p = (*params)[x];
if (TREE_CODE (p) == INTEGER_CST)
{
- int i = tree_to_uhwi (p);
- if (i < 0 || (memmodel_base (i) >= MEMMODEL_LAST))
- {
- warning_at (loc, OPT_Winvalid_memory_model,
- "invalid memory model argument %d of %qE", x + 1,
- function);
- }
+ /* memmodel_base masks the low 16 bits, thus ignore any bits above
+ it by using TREE_INT_CST_LOW instead of tree_to_*hwi. Those high
+ bits will be checked later during expansion in target specific
+ way. */
+ if (memmodel_base (TREE_INT_CST_LOW (p)) >= MEMMODEL_LAST)
+ warning_at (loc, OPT_Winvalid_memory_model,
+ "invalid memory model argument %d of %qE", x + 1,
+ function);
}
else
if (!INTEGRAL_TYPE_P (TREE_TYPE (p)))
/* Handle these 4 together so that they can fall through to the next
case if the call is transformed to an _N variant. */
switch (orig_code)
- {
+ {
case BUILT_IN_ATOMIC_EXCHANGE:
{
if (resolve_overloaded_atomic_exchange (loc, function, params,
}
default:
gcc_unreachable ();
- }
- /* Fallthrough to the normal processing. */
+ }
}
+ /* FALLTHRU */
case BUILT_IN_ATOMIC_EXCHANGE_N:
case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N:
case BUILT_IN_ATOMIC_LOAD_N:
case BUILT_IN_ATOMIC_STORE_N:
- {
- fetch_op = false;
- /* Fallthrough to further processing. */
- }
+ fetch_op = false;
+ /* FALLTHRU */
case BUILT_IN_ATOMIC_ADD_FETCH_N:
case BUILT_IN_ATOMIC_SUB_FETCH_N:
case BUILT_IN_ATOMIC_AND_FETCH_N:
case BUILT_IN_ATOMIC_FETCH_NAND_N:
case BUILT_IN_ATOMIC_FETCH_XOR_N:
case BUILT_IN_ATOMIC_FETCH_OR_N:
- {
- orig_format = false;
- /* Fallthru for parameter processing. */
- }
+ orig_format = false;
+ /* FALLTHRU */
case BUILT_IN_SYNC_FETCH_AND_ADD_N:
case BUILT_IN_SYNC_FETCH_AND_SUB_N:
case BUILT_IN_SYNC_FETCH_AND_OR_N:
operator without conversion.
We don't check the overall vector size here because some of our callers
want to give different error messages when the vectors are compatible
- except for the element count. */
-
-bool
-vector_types_compatible_elements_p (tree t1, tree t2)
-{
- bool opaque = TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2);
- t1 = TREE_TYPE (t1);
- t2 = TREE_TYPE (t2);
-
- enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2);
-
- gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE || c1 == FIXED_POINT_TYPE)
- && (c2 == INTEGER_TYPE || c2 == REAL_TYPE
- || c2 == FIXED_POINT_TYPE));
-
- t1 = c_common_signed_type (t1);
- t2 = c_common_signed_type (t2);
- /* Equality works here because c_common_signed_type uses
- TYPE_MAIN_VARIANT. */
- if (t1 == t2)
- return true;
- if (opaque && c1 == c2
- && (c1 == INTEGER_TYPE || c1 == REAL_TYPE)
- && TYPE_PRECISION (t1) == TYPE_PRECISION (t2))
- return true;
- return false;
-}
-
-/* Check for missing format attributes on function pointers. LTYPE is
- the new type or left-hand side type. RTYPE is the old type or
- right-hand side type. Returns TRUE if LTYPE is missing the desired
- attribute. */
-
-bool
-check_missing_format_attribute (tree ltype, tree rtype)
-{
- tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype);
- tree ra;
-
- for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra))
- if (is_attribute_p ("format", TREE_PURPOSE (ra)))
- break;
- if (ra)
- {
- tree la;
- for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la))
- if (is_attribute_p ("format", TREE_PURPOSE (la)))
- break;
- return !la;
- }
- else
- return false;
-}
-
-/* Subscripting with type char is likely to lose on a machine where
- chars are signed. So warn on any machine, but optionally. Don't
- warn for unsigned char since that type is safe. Don't warn for
- signed char because anyone who uses that must have done so
- deliberately. Furthermore, we reduce the false positive load by
- warning only for non-constant value of type char. */
-
-void
-warn_array_subscript_with_type_char (location_t loc, tree index)
-{
- if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node
- && TREE_CODE (index) != INTEGER_CST)
- warning_at (loc, OPT_Wchar_subscripts,
- "array subscript has type %<char%>");
-}
-
-/* Implement -Wparentheses for the unexpected C precedence rules, to
- cover cases like x + y << z which readers are likely to
- misinterpret. We have seen an expression in which CODE is a binary
- operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
- before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
- CODE_RIGHT may be ERROR_MARK, which means that that side of the
- expression was not formed using a binary or unary operator, or it
- was enclosed in parentheses. */
-
-void
-warn_about_parentheses (location_t loc, enum tree_code code,
- enum tree_code code_left, tree arg_left,
- enum tree_code code_right, tree arg_right)
-{
- if (!warn_parentheses)
- return;
-
- /* This macro tests that the expression ARG with original tree code
- CODE appears to be a boolean expression. or the result of folding a
- boolean expression. */
-#define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
- (truth_value_p (TREE_CODE (ARG)) \
- || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
- /* Folding may create 0 or 1 integers from other expressions. */ \
- || ((CODE) != INTEGER_CST \
- && (integer_onep (ARG) || integer_zerop (ARG))))
-
- switch (code)
- {
- case LSHIFT_EXPR:
- if (code_left == PLUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around %<+%> inside %<<<%>");
- else if (code_right == PLUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around %<+%> inside %<<<%>");
- else if (code_left == MINUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around %<-%> inside %<<<%>");
- else if (code_right == MINUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around %<-%> inside %<<<%>");
- return;
-
- case RSHIFT_EXPR:
- if (code_left == PLUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around %<+%> inside %<>>%>");
- else if (code_right == PLUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around %<+%> inside %<>>%>");
- else if (code_left == MINUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around %<-%> inside %<>>%>");
- else if (code_right == MINUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around %<-%> inside %<>>%>");
- return;
-
- case TRUTH_ORIF_EXPR:
- if (code_left == TRUTH_ANDIF_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around %<&&%> within %<||%>");
- else if (code_right == TRUTH_ANDIF_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around %<&&%> within %<||%>");
- return;
-
- case BIT_IOR_EXPR:
- if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR
- || code_left == PLUS_EXPR || code_left == MINUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around arithmetic in operand of %<|%>");
- else if (code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR
- || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around arithmetic in operand of %<|%>");
- /* Check cases like x|y==z */
- else if (TREE_CODE_CLASS (code_left) == tcc_comparison)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around comparison in operand of %<|%>");
- else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around comparison in operand of %<|%>");
- /* Check cases like !x | y */
- else if (code_left == TRUTH_NOT_EXPR
- && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around operand of "
- "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
- return;
-
- case BIT_XOR_EXPR:
- if (code_left == BIT_AND_EXPR
- || code_left == PLUS_EXPR || code_left == MINUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around arithmetic in operand of %<^%>");
- else if (code_right == BIT_AND_EXPR
- || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around arithmetic in operand of %<^%>");
- /* Check cases like x^y==z */
- else if (TREE_CODE_CLASS (code_left) == tcc_comparison)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around comparison in operand of %<^%>");
- else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around comparison in operand of %<^%>");
- return;
-
- case BIT_AND_EXPR:
- if (code_left == PLUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around %<+%> in operand of %<&%>");
- else if (code_right == PLUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around %<+%> in operand of %<&%>");
- else if (code_left == MINUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around %<-%> in operand of %<&%>");
- else if (code_right == MINUS_EXPR)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around %<-%> in operand of %<&%>");
- /* Check cases like x&y==z */
- else if (TREE_CODE_CLASS (code_left) == tcc_comparison)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around comparison in operand of %<&%>");
- else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around comparison in operand of %<&%>");
- /* Check cases like !x & y */
- else if (code_left == TRUTH_NOT_EXPR
- && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around operand of "
- "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
- return;
-
- case EQ_EXPR:
- if (TREE_CODE_CLASS (code_left) == tcc_comparison)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around comparison in operand of %<==%>");
- else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around comparison in operand of %<==%>");
- return;
- case NE_EXPR:
- if (TREE_CODE_CLASS (code_left) == tcc_comparison)
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "suggest parentheses around comparison in operand of %<!=%>");
- else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "suggest parentheses around comparison in operand of %<!=%>");
- return;
-
- default:
- if (TREE_CODE_CLASS (code) == tcc_comparison)
- {
- if (TREE_CODE_CLASS (code_left) == tcc_comparison
- && code_left != NE_EXPR && code_left != EQ_EXPR
- && INTEGRAL_TYPE_P (TREE_TYPE (arg_left)))
- warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
- "comparisons like %<X<=Y<=Z%> do not "
- "have their mathematical meaning");
- else if (TREE_CODE_CLASS (code_right) == tcc_comparison
- && code_right != NE_EXPR && code_right != EQ_EXPR
- && INTEGRAL_TYPE_P (TREE_TYPE (arg_right)))
- warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
- "comparisons like %<X<=Y<=Z%> do not "
- "have their mathematical meaning");
- }
- return;
- }
-#undef NOT_A_BOOLEAN_EXPR_P
-}
-
-/* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
-
-void
-warn_for_unused_label (tree label)
-{
- if (!TREE_USED (label))
- {
- if (DECL_INITIAL (label))
- warning (OPT_Wunused_label, "label %q+D defined but not used", label);
- else
- warning (OPT_Wunused_label, "label %q+D declared but not defined", label);
- }
-}
-
-/* Warn for division by zero according to the value of DIVISOR. LOC
- is the location of the division operator. */
-
-void
-warn_for_div_by_zero (location_t loc, tree divisor)
-{
- /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
- about division by zero. Do not issue a warning if DIVISOR has a
- floating-point type, since we consider 0.0/0.0 a valid way of
- generating a NaN. */
- if (c_inhibit_evaluation_warnings == 0
- && (integer_zerop (divisor) || fixed_zerop (divisor)))
- warning_at (loc, OPT_Wdiv_by_zero, "division by zero");
-}
-
-/* Warn for patterns where memset appears to be used incorrectly. The
- warning location should be LOC. ARG0, and ARG2 are the first and
- last arguments to the call, while LITERAL_ZERO_MASK has a 1 bit for
- each argument that was a literal zero. */
-
-void
-warn_for_memset (location_t loc, tree arg0, tree arg2,
- int literal_zero_mask)
-{
- if (warn_memset_transposed_args
- && integer_zerop (arg2)
- && (literal_zero_mask & (1 << 2)) != 0
- && (literal_zero_mask & (1 << 1)) == 0)
- warning_at (loc, OPT_Wmemset_transposed_args,
- "%<memset%> used with constant zero length "
- "parameter; this could be due to transposed "
- "parameters");
-
- if (warn_memset_elt_size && TREE_CODE (arg2) == INTEGER_CST)
- {
- STRIP_NOPS (arg0);
- if (TREE_CODE (arg0) == ADDR_EXPR)
- arg0 = TREE_OPERAND (arg0, 0);
- tree type = TREE_TYPE (arg0);
- if (TREE_CODE (type) == ARRAY_TYPE)
- {
- tree elt_type = TREE_TYPE (type);
- tree domain = TYPE_DOMAIN (type);
- if (!integer_onep (TYPE_SIZE_UNIT (elt_type))
- && domain != NULL_TREE
- && TYPE_MAXVAL (domain)
- && TYPE_MINVAL (domain)
- && integer_zerop (TYPE_MINVAL (domain))
- && integer_onep (fold_build2 (MINUS_EXPR, domain,
- arg2,
- TYPE_MAXVAL (domain))))
- warning_at (loc, OPT_Wmemset_elt_size,
- "%<memset%> used with length equal to "
- "number of elements without multiplication "
- "by element size");
- }
- }
-}
-
-/* Subroutine of build_binary_op. Give warnings for comparisons
- between signed and unsigned quantities that may fail. Do the
- checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
- so that casts will be considered, but default promotions won't
- be.
-
- LOCATION is the location of the comparison operator.
-
- The arguments of this function map directly to local variables
- of build_binary_op. */
-
-void
-warn_for_sign_compare (location_t location,
- tree orig_op0, tree orig_op1,
- tree op0, tree op1,
- tree result_type, enum tree_code resultcode)
-{
- int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
- int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
- int unsignedp0, unsignedp1;
-
- /* In C++, check for comparison of different enum types. */
- if (c_dialect_cxx()
- && TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE
- && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE
- && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0))
- != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1)))
- {
- warning_at (location,
- OPT_Wsign_compare, "comparison between types %qT and %qT",
- TREE_TYPE (orig_op0), TREE_TYPE (orig_op1));
- }
-
- /* Do not warn if the comparison is being done in a signed type,
- since the signed type will only be chosen if it can represent
- all the values of the unsigned type. */
- if (!TYPE_UNSIGNED (result_type))
- /* OK */;
- /* Do not warn if both operands are unsigned. */
- else if (op0_signed == op1_signed)
- /* OK */;
- else
- {
- tree sop, uop, base_type;
- bool ovf;
-
- if (op0_signed)
- sop = orig_op0, uop = orig_op1;
- else
- sop = orig_op1, uop = orig_op0;
-
- STRIP_TYPE_NOPS (sop);
- STRIP_TYPE_NOPS (uop);
- base_type = (TREE_CODE (result_type) == COMPLEX_TYPE
- ? TREE_TYPE (result_type) : result_type);
-
- /* Do not warn if the signed quantity is an unsuffixed integer
- literal (or some static constant expression involving such
- literals or a conditional expression involving such literals)
- and it is non-negative. */
- if (tree_expr_nonnegative_warnv_p (sop, &ovf))
- /* OK */;
- /* Do not warn if the comparison is an equality operation, the
- unsigned quantity is an integral constant, and it would fit
- in the result if the result were signed. */
- else if (TREE_CODE (uop) == INTEGER_CST
- && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
- && int_fits_type_p (uop, c_common_signed_type (base_type)))
- /* OK */;
- /* In C, do not warn if the unsigned quantity is an enumeration
- constant and its maximum value would fit in the result if the
- result were signed. */
- else if (!c_dialect_cxx() && TREE_CODE (uop) == INTEGER_CST
- && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
- && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop)),
- c_common_signed_type (base_type)))
- /* OK */;
- else
- warning_at (location,
- OPT_Wsign_compare,
- "comparison between signed and unsigned integer expressions");
- }
-
- /* Warn if two unsigned values are being compared in a size larger
- than their original size, and one (and only one) is the result of
- a `~' operator. This comparison will always fail.
-
- Also warn if one operand is a constant, and the constant does not
- have all bits set that are set in the ~ operand when it is
- extended. */
-
- op0 = c_common_get_narrower (op0, &unsignedp0);
- op1 = c_common_get_narrower (op1, &unsignedp1);
-
- if ((TREE_CODE (op0) == BIT_NOT_EXPR)
- ^ (TREE_CODE (op1) == BIT_NOT_EXPR))
- {
- if (TREE_CODE (op0) == BIT_NOT_EXPR)
- op0 = c_common_get_narrower (TREE_OPERAND (op0, 0), &unsignedp0);
- if (TREE_CODE (op1) == BIT_NOT_EXPR)
- op1 = c_common_get_narrower (TREE_OPERAND (op1, 0), &unsignedp1);
-
- if (tree_fits_shwi_p (op0) || tree_fits_shwi_p (op1))
- {
- tree primop;
- HOST_WIDE_INT constant, mask;
- int unsignedp;
- unsigned int bits;
-
- if (tree_fits_shwi_p (op0))
- {
- primop = op1;
- unsignedp = unsignedp1;
- constant = tree_to_shwi (op0);
- }
- else
- {
- primop = op0;
- unsignedp = unsignedp0;
- constant = tree_to_shwi (op1);
- }
-
- bits = TYPE_PRECISION (TREE_TYPE (primop));
- if (bits < TYPE_PRECISION (result_type)
- && bits < HOST_BITS_PER_LONG && unsignedp)
- {
- mask = HOST_WIDE_INT_M1U << bits;
- if ((mask & constant) != mask)
- {
- if (constant == 0)
- warning_at (location, OPT_Wsign_compare,
- "promoted ~unsigned is always non-zero");
- else
- warning_at (location, OPT_Wsign_compare,
- "comparison of promoted ~unsigned with constant");
- }
- }
- }
- else if (unsignedp0 && unsignedp1
- && (TYPE_PRECISION (TREE_TYPE (op0))
- < TYPE_PRECISION (result_type))
- && (TYPE_PRECISION (TREE_TYPE (op1))
- < TYPE_PRECISION (result_type)))
- warning_at (location, OPT_Wsign_compare,
- "comparison of promoted ~unsigned with unsigned");
- }
-}
-
-/* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
- type via c_common_type. If -Wdouble-promotion is in use, and the
- conditions for warning have been met, issue a warning. GMSGID is
- the warning message. It must have two %T specifiers for the type
- that was converted (generally "float") and the type to which it was
- converted (generally "double), respectively. LOC is the location
- to which the awrning should refer. */
+ except for the element count. */
-void
-do_warn_double_promotion (tree result_type, tree type1, tree type2,
- const char *gmsgid, location_t loc)
+bool
+vector_types_compatible_elements_p (tree t1, tree t2)
{
- tree source_type;
+ bool opaque = TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2);
+ t1 = TREE_TYPE (t1);
+ t2 = TREE_TYPE (t2);
- if (!warn_double_promotion)
- return;
- /* If the conversion will not occur at run-time, there is no need to
- warn about it. */
- if (c_inhibit_evaluation_warnings)
- return;
- if (TYPE_MAIN_VARIANT (result_type) != double_type_node
- && TYPE_MAIN_VARIANT (result_type) != complex_double_type_node)
- return;
- if (TYPE_MAIN_VARIANT (type1) == float_type_node
- || TYPE_MAIN_VARIANT (type1) == complex_float_type_node)
- source_type = type1;
- else if (TYPE_MAIN_VARIANT (type2) == float_type_node
- || TYPE_MAIN_VARIANT (type2) == complex_float_type_node)
- source_type = type2;
- else
- return;
- warning_at (loc, OPT_Wdouble_promotion, gmsgid, source_type, result_type);
+ enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2);
+
+ gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE || c1 == FIXED_POINT_TYPE)
+ && (c2 == INTEGER_TYPE || c2 == REAL_TYPE
+ || c2 == FIXED_POINT_TYPE));
+
+ t1 = c_common_signed_type (t1);
+ t2 = c_common_signed_type (t2);
+ /* Equality works here because c_common_signed_type uses
+ TYPE_MAIN_VARIANT. */
+ if (t1 == t2)
+ return true;
+ if (opaque && c1 == c2
+ && (c1 == INTEGER_TYPE || c1 == REAL_TYPE)
+ && TYPE_PRECISION (t1) == TYPE_PRECISION (t2))
+ return true;
+ return false;
}
-/* Possibly warn about unused parameters. */
+/* Check for missing format attributes on function pointers. LTYPE is
+ the new type or left-hand side type. RTYPE is the old type or
+ right-hand side type. Returns TRUE if LTYPE is missing the desired
+ attribute. */
-void
-do_warn_unused_parameter (tree fn)
+bool
+check_missing_format_attribute (tree ltype, tree rtype)
{
- tree decl;
+ tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype);
+ tree ra;
- for (decl = DECL_ARGUMENTS (fn);
- decl; decl = DECL_CHAIN (decl))
- if (!TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
- && DECL_NAME (decl) && !DECL_ARTIFICIAL (decl)
- && !TREE_NO_WARNING (decl))
- warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wunused_parameter,
- "unused parameter %qD", decl);
+ for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra))
+ if (is_attribute_p ("format", TREE_PURPOSE (ra)))
+ break;
+ if (ra)
+ {
+ tree la;
+ for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la))
+ if (is_attribute_p ("format", TREE_PURPOSE (la)))
+ break;
+ return !la;
+ }
+ else
+ return false;
}
-
/* Setup a TYPE_DECL node as a typedef representation.
X is a TYPE_DECL for a typedef statement. Create a brand new
{
if (x == error_mark_node)
return;
- if (DECL_IS_BUILTIN (x))
+ if (DECL_IS_BUILTIN (x) && TREE_CODE (TREE_TYPE (x)) != ARRAY_TYPE)
{
if (TYPE_NAME (TREE_TYPE (x)) == 0)
TYPE_NAME (TREE_TYPE (x)) = x;
tt = build_variant_type_copy (tt);
TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
TYPE_NAME (tt) = x;
- TREE_USED (tt) = TREE_USED (x);
+
+ /* Mark the type as used only when its type decl is decorated
+ with attribute unused. */
+ if (lookup_attribute ("unused", DECL_ATTRIBUTES (x)))
+ TREE_USED (tt) = 1;
+
TREE_TYPE (x) = tt;
}
}
}
}
-/* If DECL is a typedef that is declared in the current function,
- record it for the purpose of -Wunused-local-typedefs. */
-
-void
-record_locally_defined_typedef (tree decl)
-{
- struct c_language_function *l;
-
- if (!warn_unused_local_typedefs
- || cfun == NULL
- /* if this is not a locally defined typedef then we are not
- interested. */
- || !is_typedef_decl (decl)
- || !decl_function_context (decl))
- return;
-
- l = (struct c_language_function *) cfun->language;
- vec_safe_push (l->local_typedefs, decl);
-}
-
-/* If T is a TYPE_DECL declared locally, mark it as used. */
-
-void
-maybe_record_typedef_use (tree t)
-{
- if (!is_typedef_decl (t))
- return;
-
- TREE_USED (t) = true;
-}
-
-/* Warn if there are some unused locally defined typedefs in the
- current function. */
-
-void
-maybe_warn_unused_local_typedefs (void)
-{
- int i;
- tree decl;
- /* The number of times we have emitted -Wunused-local-typedefs
- warnings. If this is different from errorcount, that means some
- unrelated errors have been issued. In which case, we'll avoid
- emitting "unused-local-typedefs" warnings. */
- static int unused_local_typedefs_warn_count;
- struct c_language_function *l;
-
- if (cfun == NULL)
- return;
-
- if ((l = (struct c_language_function *) cfun->language) == NULL)
- return;
-
- if (warn_unused_local_typedefs
- && errorcount == unused_local_typedefs_warn_count)
- {
- FOR_EACH_VEC_SAFE_ELT (l->local_typedefs, i, decl)
- if (!TREE_USED (decl))
- warning_at (DECL_SOURCE_LOCATION (decl),
- OPT_Wunused_local_typedefs,
- "typedef %qD locally defined but not used", decl);
- unused_local_typedefs_warn_count = errorcount;
- }
-
- vec_free (l->local_typedefs);
-}
-
-/* Warn about boolean expression compared with an integer value different
- from true/false. Warns also e.g. about "(i1 == i2) == 2".
- LOC is the location of the comparison, CODE is its code, OP0 and OP1
- are the operands of the comparison. The caller must ensure that
- either operand is a boolean expression. */
-
-void
-maybe_warn_bool_compare (location_t loc, enum tree_code code, tree op0,
- tree op1)
-{
- if (TREE_CODE_CLASS (code) != tcc_comparison)
- return;
-
- tree f, cst;
- if (f = fold_for_warn (op0),
- TREE_CODE (f) == INTEGER_CST)
- cst = op0 = f;
- else if (f = fold_for_warn (op1),
- TREE_CODE (f) == INTEGER_CST)
- cst = op1 = f;
- else
- return;
-
- if (!integer_zerop (cst) && !integer_onep (cst))
- {
- int sign = (TREE_CODE (op0) == INTEGER_CST
- ? tree_int_cst_sgn (cst) : -tree_int_cst_sgn (cst));
- if (code == EQ_EXPR
- || ((code == GT_EXPR || code == GE_EXPR) && sign < 0)
- || ((code == LT_EXPR || code == LE_EXPR) && sign > 0))
- warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
- "with boolean expression is always false", cst);
- else
- warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
- "with boolean expression is always true", cst);
- }
- else if (integer_zerop (cst) || integer_onep (cst))
- {
- /* If the non-constant operand isn't of a boolean type, we
- don't want to warn here. */
- tree noncst = TREE_CODE (op0) == INTEGER_CST ? op1 : op0;
- /* Handle booleans promoted to integers. */
- if (CONVERT_EXPR_P (noncst)
- && TREE_TYPE (noncst) == integer_type_node
- && TREE_CODE (TREE_TYPE (TREE_OPERAND (noncst, 0))) == BOOLEAN_TYPE)
- /* Warn. */;
- else if (TREE_CODE (TREE_TYPE (noncst)) != BOOLEAN_TYPE
- && !truth_value_p (TREE_CODE (noncst)))
- return;
- /* Do some magic to get the right diagnostics. */
- bool flag = TREE_CODE (op0) == INTEGER_CST;
- flag = integer_zerop (cst) ? flag : !flag;
- if ((code == GE_EXPR && !flag) || (code == LE_EXPR && flag))
- warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
- "with boolean expression is always true", cst);
- else if ((code == LT_EXPR && !flag) || (code == GT_EXPR && flag))
- warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
- "with boolean expression is always false", cst);
- }
-}
-
-/* Warn if signed left shift overflows. We don't warn
- about left-shifting 1 into the sign bit in C++14; cf.
- <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3367.html#1457>
- LOC is a location of the shift; OP0 and OP1 are the operands.
- Return true if an overflow is detected, false otherwise. */
-
-bool
-maybe_warn_shift_overflow (location_t loc, tree op0, tree op1)
-{
- if (TREE_CODE (op0) != INTEGER_CST
- || TREE_CODE (op1) != INTEGER_CST)
- return false;
-
- tree type0 = TREE_TYPE (op0);
- unsigned int prec0 = TYPE_PRECISION (type0);
-
- /* Left-hand operand must be signed. */
- if (TYPE_UNSIGNED (type0))
- return false;
-
- unsigned int min_prec = (wi::min_precision (op0, SIGNED)
- + TREE_INT_CST_LOW (op1));
- /* Handle the case of left-shifting 1 into the sign bit.
- * However, shifting 1 _out_ of the sign bit, as in
- * INT_MIN << 1, is considered an overflow.
- */
- if (!tree_int_cst_sign_bit(op0) && min_prec == prec0 + 1)
- {
- /* Never warn for C++14 onwards. */
- if (cxx_dialect >= cxx14)
- return false;
- /* Otherwise only if -Wshift-overflow=2. But return
- true to signal an overflow for the sake of integer
- constant expressions. */
- if (warn_shift_overflow < 2)
- return true;
- }
-
- bool overflowed = min_prec > prec0;
- if (overflowed && c_inhibit_evaluation_warnings == 0)
- warning_at (loc, OPT_Wshift_overflow_,
- "result of %qE requires %u bits to represent, "
- "but %qT only has %u bits",
- build2_loc (loc, LSHIFT_EXPR, type0, op0, op1),
- min_prec, type0, prec0);
-
- return overflowed;
-}
-
/* The C and C++ parsers both use vectors to hold function arguments.
For efficiency, we keep a cache of unused vectors. This is the
cache. */
return ret;
}
+/* Get a new tree vector of the values of a CONSTRUCTOR. */
+
+vec<tree, va_gc> *
+make_tree_vector_from_ctor (tree ctor)
+{
+ vec<tree,va_gc> *ret = make_tree_vector ();
+ vec_safe_reserve (ret, CONSTRUCTOR_NELTS (ctor));
+ for (unsigned i = 0; i < CONSTRUCTOR_NELTS (ctor); ++i)
+ ret->quick_push (CONSTRUCTOR_ELT (ctor, i)->value);
+ return ret;
+}
+
/* Get a new tree vector which is a copy of an existing one. */
vec<tree, va_gc> *
case RID_LONG:
case RID_SHORT:
case RID_SIGNED:
+ CASE_RID_FLOATN_NX:
case RID_DFLOAT32:
case RID_DFLOAT64:
case RID_DFLOAT128:
if (TREE_CODE (type0) == INTEGER_TYPE
&& TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
{
- if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false))
+ if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0,
+ NULL_TREE, false))
{
if (complain)
error_at (loc, "conversion of scalar %qT to vector %qT "
if (TREE_CODE (type0) == INTEGER_TYPE
&& TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
{
- if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false))
+ if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0,
+ NULL_TREE, false))
{
if (complain)
error_at (loc, "conversion of scalar %qT to vector %qT "
|| TREE_CODE (type0) == INTEGER_TYPE)
&& SCALAR_FLOAT_TYPE_P (TREE_TYPE (type1)))
{
- if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false))
+ if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0,
+ NULL_TREE, false))
{
if (complain)
error_at (loc, "conversion of scalar %qT to vector %qT "
return stv_nothing;
}
+/* Return the alignment of std::max_align_t.
+
+ [support.types.layout] The type max_align_t is a POD type whose alignment
+ requirement is at least as great as that of every scalar type, and whose
+ alignment requirement is supported in every context. */
+
+unsigned
+max_align_t_align ()
+{
+ unsigned int max_align = MAX (TYPE_ALIGN (long_long_integer_type_node),
+ TYPE_ALIGN (long_double_type_node));
+ if (float128_type_node != NULL_TREE)
+ max_align = MAX (max_align, TYPE_ALIGN (float128_type_node));
+ return max_align;
+}
+
/* Return true iff ALIGN is an integral constant that is a fundamental
alignment, as defined by [basic.align] in the c++-11
specifications.
[A fundamental alignment is represented by an alignment less than or
equal to the greatest alignment supported by the implementation
- in all contexts, which is equal to
- alignof(max_align_t)]. */
+ in all contexts, which is equal to alignof(max_align_t)]. */
bool
-cxx_fundamental_alignment_p (unsigned align)
+cxx_fundamental_alignment_p (unsigned align)
{
- return (align <= MAX (TYPE_ALIGN (long_long_integer_type_node),
- TYPE_ALIGN (long_double_type_node)));
+ return (align <= max_align_t_align ());
}
/* Return true if T is a pointer to a zero-sized aggregate. */
issues an error pointing to the location LOC.
Returns true when the expression has been diagnosed and false
otherwise. */
+
bool
reject_gcc_builtin (const_tree expr, location_t loc /* = UNKNOWN_LOCATION */)
{
return false;
}
-/* If we're creating an if-else-if condition chain, first see if we
- already have this COND in the CHAIN. If so, warn and don't add COND
- into the vector, otherwise add the COND there. LOC is the location
- of COND. */
-
-void
-warn_duplicated_cond_add_or_warn (location_t loc, tree cond, vec<tree> **chain)
-{
- /* No chain has been created yet. Do nothing. */
- if (*chain == NULL)
- return;
-
- if (TREE_SIDE_EFFECTS (cond))
- {
- /* Uh-oh! This condition has a side-effect, thus invalidates
- the whole chain. */
- delete *chain;
- *chain = NULL;
- return;
- }
-
- unsigned int ix;
- tree t;
- bool found = false;
- FOR_EACH_VEC_ELT (**chain, ix, t)
- if (operand_equal_p (cond, t, 0))
- {
- if (warning_at (loc, OPT_Wduplicated_cond,
- "duplicated %<if%> condition"))
- inform (EXPR_LOCATION (t), "previously used here");
- found = true;
- break;
- }
-
- if (!found
- && !CONSTANT_CLASS_P (cond)
- /* Don't infinitely grow the chain. */
- && (*chain)->length () < 512)
- (*chain)->safe_push (cond);
-}
-
/* Check if array size calculations overflow or if the array covers more
than half of the address space. Return true if the size of the array
is valid, false otherwise. TYPE is the type of the array and NAME is
return (time_t) epoch;
}
-/* Check and possibly warn if two declarations have contradictory
- attributes, such as always_inline vs. noinline. */
+/* Callback for libcpp for offering spelling suggestions for misspelled
+ directives. GOAL is an unrecognized string; CANDIDATES is a
+ NULL-terminated array of candidate strings. Return the closest
+ match to GOAL within CANDIDATES, or NULL if none are good
+ suggestions. */
-bool
-diagnose_mismatched_attributes (tree olddecl, tree newdecl)
-{
- bool warned = false;
-
- tree a1 = lookup_attribute ("optimize", DECL_ATTRIBUTES (olddecl));
- tree a2 = lookup_attribute ("optimize", DECL_ATTRIBUTES (newdecl));
- /* An optimization attribute applied on a declaration after the
- definition is likely not what the user wanted. */
- if (a2 != NULL_TREE
- && DECL_SAVED_TREE (olddecl) != NULL_TREE
- && (a1 == NULL_TREE || !attribute_list_equal (a1, a2)))
- warned |= warning (OPT_Wattributes,
- "optimization attribute on %qD follows "
- "definition but the attribute doesn%'t match",
- newdecl);
-
- /* Diagnose inline __attribute__ ((noinline)) which is silly. */
- if (DECL_DECLARED_INLINE_P (newdecl)
- && DECL_UNINLINABLE (olddecl)
- && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl)))
- warned |= warning (OPT_Wattributes, "inline declaration of %qD follows "
- "declaration with attribute noinline", newdecl);
- else if (DECL_DECLARED_INLINE_P (olddecl)
- && DECL_UNINLINABLE (newdecl)
- && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl)))
- warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
- "noinline follows inline declaration ", newdecl);
- else if (lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))
- && lookup_attribute ("always_inline", DECL_ATTRIBUTES (olddecl)))
- warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
- "%qs follows declaration with attribute %qs",
- newdecl, "noinline", "always_inline");
- else if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (newdecl))
- && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl)))
- warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
- "%qs follows declaration with attribute %qs",
- newdecl, "always_inline", "noinline");
- else if (lookup_attribute ("cold", DECL_ATTRIBUTES (newdecl))
- && lookup_attribute ("hot", DECL_ATTRIBUTES (olddecl)))
- warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
- "%qs follows declaration with attribute %qs",
- newdecl, "cold", "hot");
- else if (lookup_attribute ("hot", DECL_ATTRIBUTES (newdecl))
- && lookup_attribute ("cold", DECL_ATTRIBUTES (olddecl)))
- warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
- "%qs follows declaration with attribute %qs",
- newdecl, "hot", "cold");
- return warned;
+const char *
+cb_get_suggestion (cpp_reader *, const char *goal,
+ const char *const *candidates)
+{
+ best_match<const char *, const char *> bm (goal);
+ while (*candidates)
+ bm.consider (*candidates++);
+ return bm.get_best_meaningful_candidate ();
+}
+
+/* Return the latice point which is the wider of the two FLT_EVAL_METHOD
+ modes X, Y. This isn't just >, as the FLT_EVAL_METHOD values added
+ by C TS 18661-3 for interchange types that are computed in their
+ native precision are larger than the C11 values for evaluating in the
+ precision of float/double/long double. If either mode is
+ FLT_EVAL_METHOD_UNPREDICTABLE, return that. */
+
+enum flt_eval_method
+excess_precision_mode_join (enum flt_eval_method x,
+ enum flt_eval_method y)
+{
+ if (x == FLT_EVAL_METHOD_UNPREDICTABLE
+ || y == FLT_EVAL_METHOD_UNPREDICTABLE)
+ return FLT_EVAL_METHOD_UNPREDICTABLE;
+
+ /* GCC only supports one interchange type right now, _Float16. If
+ we're evaluating _Float16 in 16-bit precision, then flt_eval_method
+ will be FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16. */
+ if (x == FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16)
+ return y;
+ if (y == FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16)
+ return x;
+
+ /* Other values for flt_eval_method are directly comparable, and we want
+ the maximum. */
+ return MAX (x, y);
+}
+
+/* Return the value that should be set for FLT_EVAL_METHOD in the
+ context of ISO/IEC TS 18861-3.
+
+ This relates to the effective excess precision seen by the user,
+ which is the join point of the precision the target requests for
+ -fexcess-precision={standard,fast} and the implicit excess precision
+ the target uses. */
+
+static enum flt_eval_method
+c_ts18661_flt_eval_method (void)
+{
+ enum flt_eval_method implicit
+ = targetm.c.excess_precision (EXCESS_PRECISION_TYPE_IMPLICIT);
+
+ enum excess_precision_type flag_type
+ = (flag_excess_precision_cmdline == EXCESS_PRECISION_STANDARD
+ ? EXCESS_PRECISION_TYPE_STANDARD
+ : EXCESS_PRECISION_TYPE_FAST);
+
+ enum flt_eval_method requested
+ = targetm.c.excess_precision (flag_type);
+
+ return excess_precision_mode_join (implicit, requested);
+}
+
+/* As c_cpp_ts18661_flt_eval_method, but clamps the expected values to
+ those that were permitted by C11. That is to say, eliminates
+ FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16. */
+
+static enum flt_eval_method
+c_c11_flt_eval_method (void)
+{
+ return excess_precision_mode_join (c_ts18661_flt_eval_method (),
+ FLT_EVAL_METHOD_PROMOTE_TO_FLOAT);
+}
+
+/* Return the value that should be set for FLT_EVAL_METHOD.
+ MAYBE_C11_ONLY_P is TRUE if we should check
+ FLAG_PERMITTED_EVAL_METHODS as to whether we should limit the possible
+ values we can return to those from C99/C11, and FALSE otherwise.
+ See the comments on c_ts18661_flt_eval_method for what value we choose
+ to set here. */
+
+int
+c_flt_eval_method (bool maybe_c11_only_p)
+{
+ if (maybe_c11_only_p
+ && flag_permitted_flt_eval_methods
+ == PERMITTED_FLT_EVAL_METHODS_C11)
+ return c_c11_flt_eval_method ();
+ else
+ return c_ts18661_flt_eval_method ();
+}
+
+/* An enum for get_missing_token_insertion_kind for describing the best
+ place to insert a missing token, if there is one. */
+
+enum missing_token_insertion_kind
+{
+ MTIK_IMPOSSIBLE,
+ MTIK_INSERT_BEFORE_NEXT,
+ MTIK_INSERT_AFTER_PREV
+};
+
+/* Given a missing token of TYPE, determine if it is reasonable to
+ emit a fix-it hint suggesting the insertion of the token, and,
+ if so, where the token should be inserted relative to other tokens.
+
+ It only makes sense to do this for values of TYPE that are symbols.
+
+ Some symbols should go before the next token, e.g. in:
+ if flag)
+ we want to insert the missing '(' immediately before "flag",
+ giving:
+ if (flag)
+ rather than:
+ if( flag)
+ These use MTIK_INSERT_BEFORE_NEXT.
+
+ Other symbols should go after the previous token, e.g. in:
+ if (flag
+ do_something ();
+ we want to insert the missing ')' immediately after the "flag",
+ giving:
+ if (flag)
+ do_something ();
+ rather than:
+ if (flag
+ )do_something ();
+ These use MTIK_INSERT_AFTER_PREV. */
+
+static enum missing_token_insertion_kind
+get_missing_token_insertion_kind (enum cpp_ttype type)
+{
+ switch (type)
+ {
+ /* Insert missing "opening" brackets immediately
+ before the next token. */
+ case CPP_OPEN_SQUARE:
+ case CPP_OPEN_PAREN:
+ return MTIK_INSERT_BEFORE_NEXT;
+
+ /* Insert other missing symbols immediately after
+ the previous token. */
+ case CPP_CLOSE_PAREN:
+ case CPP_CLOSE_SQUARE:
+ case CPP_SEMICOLON:
+ case CPP_COMMA:
+ case CPP_COLON:
+ return MTIK_INSERT_AFTER_PREV;
+
+ /* Other kinds of token don't get fix-it hints. */
+ default:
+ return MTIK_IMPOSSIBLE;
+ }
+}
+
+/* Given RICHLOC, a location for a diagnostic describing a missing token
+ of kind TOKEN_TYPE, potentially add a fix-it hint suggesting the
+ insertion of the token.
+
+ The location of the attempted fix-it hint depends on TOKEN_TYPE:
+ it will either be:
+ (a) immediately after PREV_TOKEN_LOC, or
+
+ (b) immediately before the primary location within RICHLOC (taken to
+ be that of the token following where the token was expected).
+
+ If we manage to add a fix-it hint, then the location of the
+ fix-it hint is likely to be more useful as the primary location
+ of the diagnostic than that of the following token, so we swap
+ these locations.
+
+ For example, given this bogus code:
+ 123456789012345678901234567890
+ 1 | int missing_semicolon (void)
+ 2 | {
+ 3 | return 42
+ 4 | }
+
+ we will emit:
+
+ "expected ';' before '}'"
+
+ RICHLOC's primary location is at the closing brace, so before "swapping"
+ we would emit the error at line 4 column 1:
+
+ 123456789012345678901234567890
+ 3 | return 42 |< fix-it hint emitted for this line
+ | ; |
+ 4 | } |< "expected ';' before '}'" emitted at this line
+ | ^ |
+
+ It's more useful for the location of the diagnostic to be at the
+ fix-it hint, so we swap the locations, so the primary location
+ is at the fix-it hint, with the old primary location inserted
+ as a secondary location, giving this, with the error at line 3
+ column 12:
+
+ 123456789012345678901234567890
+ 3 | return 42 |< "expected ';' before '}'" emitted at this line,
+ | ^ | with fix-it hint
+ 4 | ; |
+ | } |< secondary range emitted here
+ | ~ |. */
+
+void
+maybe_suggest_missing_token_insertion (rich_location *richloc,
+ enum cpp_ttype token_type,
+ location_t prev_token_loc)
+{
+ gcc_assert (richloc);
+
+ enum missing_token_insertion_kind mtik
+ = get_missing_token_insertion_kind (token_type);
+
+ switch (mtik)
+ {
+ default:
+ gcc_unreachable ();
+ break;
+
+ case MTIK_IMPOSSIBLE:
+ return;
+
+ case MTIK_INSERT_BEFORE_NEXT:
+ /* Attempt to add the fix-it hint before the primary location
+ of RICHLOC. */
+ richloc->add_fixit_insert_before (cpp_type2name (token_type, 0));
+ break;
+
+ case MTIK_INSERT_AFTER_PREV:
+ /* Attempt to add the fix-it hint after PREV_TOKEN_LOC. */
+ richloc->add_fixit_insert_after (prev_token_loc,
+ cpp_type2name (token_type, 0));
+ break;
+ }
+
+ /* If we were successful, use the fix-it hint's location as the
+ primary location within RICHLOC, adding the old primary location
+ back as a secondary location. */
+ if (!richloc->seen_impossible_fixit_p ())
+ {
+ fixit_hint *hint = richloc->get_last_fixit_hint ();
+ location_t hint_loc = hint->get_start_loc ();
+ location_t old_loc = richloc->get_loc ();
+
+ richloc->set_range (line_table, 0, hint_loc, true);
+ richloc->add_range (old_loc, false);
+ }
+}
+
+#if CHECKING_P
+
+namespace selftest {
+
+/* Run all of the tests within c-family. */
+
+void
+c_family_tests (void)
+{
+ c_format_c_tests ();
+}
+
+} // namespace selftest
+
+#endif /* #if CHECKING_P */
+
+/* Attempt to locate a suitable location within FILE for a
+ #include directive to be inserted before. FILE should
+ be a string from libcpp (pointer equality is used).
+ LOC is the location of the relevant diagnostic.
+
+ Attempt to return the location within FILE immediately
+ after the last #include within that file, or the start of
+ that file if it has no #include directives.
+
+ Return UNKNOWN_LOCATION if no suitable location is found,
+ or if an error occurs. */
+
+static location_t
+try_to_locate_new_include_insertion_point (const char *file, location_t loc)
+{
+ /* Locate the last ordinary map within FILE that ended with a #include. */
+ const line_map_ordinary *last_include_ord_map = NULL;
+
+ /* ...and the next ordinary map within FILE after that one. */
+ const line_map_ordinary *last_ord_map_after_include = NULL;
+
+ /* ...and the first ordinary map within FILE. */
+ const line_map_ordinary *first_ord_map_in_file = NULL;
+
+ /* Get ordinary map containing LOC (or its expansion). */
+ const line_map_ordinary *ord_map_for_loc = NULL;
+ loc = linemap_resolve_location (line_table, loc, LRK_MACRO_EXPANSION_POINT,
+ &ord_map_for_loc);
+ gcc_assert (ord_map_for_loc);
+
+ for (unsigned int i = 0; i < LINEMAPS_ORDINARY_USED (line_table); i++)
+ {
+ const line_map_ordinary *ord_map
+ = LINEMAPS_ORDINARY_MAP_AT (line_table, i);
+
+ const line_map_ordinary *from = INCLUDED_FROM (line_table, ord_map);
+ if (from)
+ if (from->to_file == file)
+ {
+ last_include_ord_map = from;
+ last_ord_map_after_include = NULL;
+ }
+
+ if (ord_map->to_file == file)
+ {
+ if (!first_ord_map_in_file)
+ first_ord_map_in_file = ord_map;
+ if (last_include_ord_map && !last_ord_map_after_include)
+ last_ord_map_after_include = ord_map;
+ }
+
+ /* Stop searching when reaching the ord_map containing LOC,
+ as it makes no sense to provide fix-it hints that appear
+ after the diagnostic in question. */
+ if (ord_map == ord_map_for_loc)
+ break;
+ }
+
+ /* Determine where to insert the #include. */
+ const line_map_ordinary *ord_map_for_insertion;
+
+ /* We want the next ordmap in the file after the last one that's a
+ #include, but failing that, the start of the file. */
+ if (last_ord_map_after_include)
+ ord_map_for_insertion = last_ord_map_after_include;
+ else
+ ord_map_for_insertion = first_ord_map_in_file;
+
+ if (!ord_map_for_insertion)
+ return UNKNOWN_LOCATION;
+
+ /* The "start_location" is column 0, meaning "the whole line".
+ rich_location and edit_context can't cope with this, so use
+ column 1 instead. */
+ location_t col_0 = ord_map_for_insertion->start_location;
+ return linemap_position_for_loc_and_offset (line_table, col_0, 1);
+}
+
+/* A map from filenames to sets of headers added to them, for
+ ensuring idempotency within maybe_add_include_fixit. */
+
+/* The values within the map. We need string comparison as there's
+ no guarantee that two different diagnostics that are recommending
+ adding e.g. "<stdio.h>" are using the same buffer. */
+
+typedef hash_set <const char *, nofree_string_hash> per_file_includes_t;
+
+/* The map itself. We don't need string comparison for the filename keys,
+ as they come from libcpp. */
+
+typedef hash_map <const char *, per_file_includes_t *> added_includes_t;
+static added_includes_t *added_includes;
+
+/* Attempt to add a fix-it hint to RICHLOC, adding "#include HEADER\n"
+ in a suitable location within the file of RICHLOC's primary
+ location.
+
+ This function is idempotent: a header will be added at most once to
+ any given file. */
+
+void
+maybe_add_include_fixit (rich_location *richloc, const char *header)
+{
+ location_t loc = richloc->get_loc ();
+ const char *file = LOCATION_FILE (loc);
+ if (!file)
+ return;
+
+ /* Idempotency: don't add the same header more than once to a given file. */
+ if (!added_includes)
+ added_includes = new added_includes_t ();
+ per_file_includes_t *&set = added_includes->get_or_insert (file);
+ if (set)
+ if (set->contains (header))
+ /* ...then we've already added HEADER to that file. */
+ return;
+ if (!set)
+ set = new per_file_includes_t ();
+ set->add (header);
+
+ /* Attempt to locate a suitable place for the new directive. */
+ location_t include_insert_loc
+ = try_to_locate_new_include_insertion_point (file, loc);
+ if (include_insert_loc == UNKNOWN_LOCATION)
+ return;
+
+ char *text = xasprintf ("#include %s\n", header);
+ richloc->add_fixit_insert_before (include_insert_loc, text);
+ free (text);
}
#include "gt-c-family-c-common.h"
projects / gcc.git / blobdiff