Mercurial > hg > CbC > CbC_gcc
diff gcc/tree.h @ 111:04ced10e8804
gcc 7
| author | kono |
|---|---|
| date | Fri, 27 Oct 2017 22:46:09 +0900 |
| parents | f6334be47118 |
| children | ab0bcb71f44d 84e7813d76e9 |
line wrap: on
line diff
--- a/gcc/tree.h Sun Aug 21 07:07:55 2011 +0900 +++ b/gcc/tree.h Fri Oct 27 22:46:09 2017 +0900 @@ -1,7 +1,5 @@ -/* Front-end tree definitions for GNU compiler. - Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, - 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 - Free Software Foundation, Inc. +/* Definitions for the ubiquitous 'tree' type for GNU compilers. + Copyright (C) 1989-2017 Free Software Foundation, Inc. This file is part of GCC. @@ -22,143 +20,182 @@ #ifndef GCC_TREE_H #define GCC_TREE_H -#include "hashtab.h" -#include "machmode.h" -#include "input.h" -#include "statistics.h" -#include "vec.h" -#include "vecir.h" -#include "double-int.h" -#include "real.h" -#include "fixed-value.h" -#include "alias.h" -#include "flags.h" - -/* Codes of tree nodes */ - -#define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, -#define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE, - -enum tree_code { -#include "all-tree.def" -MAX_TREE_CODES -}; - -#undef DEFTREECODE -#undef END_OF_BASE_TREE_CODES - -extern unsigned char tree_contains_struct[MAX_TREE_CODES][64]; -#define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)]) - -/* Number of language-independent tree codes. */ -#define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE) - -/* Tree code classes. */ - -/* Each tree_code has an associated code class represented by a - TREE_CODE_CLASS. */ - -enum tree_code_class { - tcc_exceptional, /* An exceptional code (fits no category). */ - tcc_constant, /* A constant. */ - /* Order of tcc_type and tcc_declaration is important. */ - tcc_type, /* A type object code. */ - tcc_declaration, /* A declaration (also serving as variable refs). */ - tcc_reference, /* A reference to storage. */ - tcc_comparison, /* A comparison expression. */ - tcc_unary, /* A unary arithmetic expression. */ - tcc_binary, /* A binary arithmetic expression. */ - tcc_statement, /* A statement expression, which have side effects - but usually no interesting value. */ - tcc_vl_exp, /* A function call or other expression with a - variable-length operand vector. */ - tcc_expression /* Any other expression. */ -}; - -/* Each tree code class has an associated string representation. - These must correspond to the tree_code_class entries. */ - -extern const char *const tree_code_class_strings[]; +#include "tree-core.h" + +/* Convert a target-independent built-in function code to a combined_fn. */ + +inline combined_fn +as_combined_fn (built_in_function fn) +{ + return combined_fn (int (fn)); +} + +/* Convert an internal function code to a combined_fn. */ + +inline combined_fn +as_combined_fn (internal_fn fn) +{ + return combined_fn (int (fn) + int (END_BUILTINS)); +} + +/* Return true if CODE is a target-independent built-in function. */ + +inline bool +builtin_fn_p (combined_fn code) +{ + return int (code) < int (END_BUILTINS); +} + +/* Return the target-independent built-in function represented by CODE. + Only valid if builtin_fn_p (CODE). */ + +inline built_in_function +as_builtin_fn (combined_fn code) +{ + gcc_checking_assert (builtin_fn_p (code)); + return built_in_function (int (code)); +} + +/* Return true if CODE is an internal function. */ + +inline bool +internal_fn_p (combined_fn code) +{ + return int (code) >= int (END_BUILTINS); +} + +/* Return the internal function represented by CODE. Only valid if + internal_fn_p (CODE). */ + +inline internal_fn +as_internal_fn (combined_fn code) +{ + gcc_checking_assert (internal_fn_p (code)); + return internal_fn (int (code) - int (END_BUILTINS)); +} + +/* Macros for initializing `tree_contains_struct'. */ +#define MARK_TS_BASE(C) \ + (tree_contains_struct[C][TS_BASE] = true) + +#define MARK_TS_TYPED(C) \ + (MARK_TS_BASE (C), \ + tree_contains_struct[C][TS_TYPED] = true) + +#define MARK_TS_COMMON(C) \ + (MARK_TS_TYPED (C), \ + tree_contains_struct[C][TS_COMMON] = true) + +#define MARK_TS_TYPE_COMMON(C) \ + (MARK_TS_COMMON (C), \ + tree_contains_struct[C][TS_TYPE_COMMON] = true) + +#define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \ + (MARK_TS_TYPE_COMMON (C), \ + tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = true) + +#define MARK_TS_DECL_MINIMAL(C) \ + (MARK_TS_COMMON (C), \ + tree_contains_struct[C][TS_DECL_MINIMAL] = true) + +#define MARK_TS_DECL_COMMON(C) \ + (MARK_TS_DECL_MINIMAL (C), \ + tree_contains_struct[C][TS_DECL_COMMON] = true) + +#define MARK_TS_DECL_WRTL(C) \ + (MARK_TS_DECL_COMMON (C), \ + tree_contains_struct[C][TS_DECL_WRTL] = true) + +#define MARK_TS_DECL_WITH_VIS(C) \ + (MARK_TS_DECL_WRTL (C), \ + tree_contains_struct[C][TS_DECL_WITH_VIS] = true) + +#define MARK_TS_DECL_NON_COMMON(C) \ + (MARK_TS_DECL_WITH_VIS (C), \ + tree_contains_struct[C][TS_DECL_NON_COMMON] = true) /* Returns the string representing CLASS. */ #define TREE_CODE_CLASS_STRING(CLASS)\ tree_code_class_strings[(int) (CLASS)] -extern const enum tree_code_class tree_code_type[]; #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] -/* Nonzero if CODE represents an exceptional code. */ - -#define EXCEPTIONAL_CLASS_P(CODE)\ - (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional) - -/* Nonzero if CODE represents a constant. */ - -#define CONSTANT_CLASS_P(CODE)\ - (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant) - -/* Nonzero if CODE represents a type. */ - -#define TYPE_P(CODE)\ - (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type) - -/* Nonzero if CODE represents a declaration. */ - -#define DECL_P(CODE)\ - (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration) +/* Nonzero if NODE represents an exceptional code. */ + +#define EXCEPTIONAL_CLASS_P(NODE)\ + (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional) + +/* Nonzero if NODE represents a constant. */ + +#define CONSTANT_CLASS_P(NODE)\ + (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant) + +/* Nonzero if NODE represents a type. */ + +#define TYPE_P(NODE)\ + (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type) + +/* Nonzero if NODE represents a declaration. */ + +#define DECL_P(NODE)\ + (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration) + +/* True if NODE designates a variable declaration. */ +#define VAR_P(NODE) \ + (TREE_CODE (NODE) == VAR_DECL) /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */ #define VAR_OR_FUNCTION_DECL_P(DECL)\ (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL) -/* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in +/* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in ascending code order. */ -#define INDIRECT_REF_P(CODE)\ - (TREE_CODE (CODE) == INDIRECT_REF) - -/* Nonzero if CODE represents a reference. */ - -#define REFERENCE_CLASS_P(CODE)\ - (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference) - -/* Nonzero if CODE represents a comparison. */ - -#define COMPARISON_CLASS_P(CODE)\ - (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison) - -/* Nonzero if CODE represents a unary arithmetic expression. */ - -#define UNARY_CLASS_P(CODE)\ - (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary) - -/* Nonzero if CODE represents a binary arithmetic expression. */ - -#define BINARY_CLASS_P(CODE)\ - (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary) - -/* Nonzero if CODE represents a statement expression. */ - -#define STATEMENT_CLASS_P(CODE)\ - (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement) - -/* Nonzero if CODE represents a function call-like expression with a +#define INDIRECT_REF_P(NODE)\ + (TREE_CODE (NODE) == INDIRECT_REF) + +/* Nonzero if NODE represents a reference. */ + +#define REFERENCE_CLASS_P(NODE)\ + (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference) + +/* Nonzero if NODE represents a comparison. */ + +#define COMPARISON_CLASS_P(NODE)\ + (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison) + +/* Nonzero if NODE represents a unary arithmetic expression. */ + +#define UNARY_CLASS_P(NODE)\ + (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary) + +/* Nonzero if NODE represents a binary arithmetic expression. */ + +#define BINARY_CLASS_P(NODE)\ + (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary) + +/* Nonzero if NODE represents a statement expression. */ + +#define STATEMENT_CLASS_P(NODE)\ + (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement) + +/* Nonzero if NODE represents a function call-like expression with a variable-length operand vector. */ -#define VL_EXP_CLASS_P(CODE)\ - (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp) - -/* Nonzero if CODE represents any other expression. */ - -#define EXPRESSION_CLASS_P(CODE)\ - (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression) - -/* Returns nonzero iff CODE represents a type or declaration. */ - -#define IS_TYPE_OR_DECL_P(CODE)\ - (TYPE_P (CODE) || DECL_P (CODE)) +#define VL_EXP_CLASS_P(NODE)\ + (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp) + +/* Nonzero if NODE represents any other expression. */ + +#define EXPRESSION_CLASS_P(NODE)\ + (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression) + +/* Returns nonzero iff NODE represents a type or declaration. */ + +#define IS_TYPE_OR_DECL_P(NODE)\ + (TYPE_P (NODE) || DECL_P (NODE)) /* Returns nonzero iff CLASS is the tree-code class of an expression. */ @@ -170,483 +207,19 @@ #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) -/* Number of argument-words in each kind of tree-node. */ - -extern const unsigned char tree_code_length[]; #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] -/* Names of tree components. */ - -extern const char *const tree_code_name[]; - -/* We have to be able to tell cgraph about the needed-ness of the target - of an alias. This requires that the decl have been defined. Aliases - that precede their definition have to be queued for later processing. */ - -/* The deferred processing proceeds in several passes. We memorize the - diagnostics emitted for a pair to prevent repeating messages when the - queue gets re-scanned after possible updates. */ - -typedef enum { - ALIAS_DIAG_NONE = 0x0, - ALIAS_DIAG_TO_UNDEF = 0x1, - ALIAS_DIAG_TO_EXTERN = 0x2 -} alias_diag_flags; - -typedef struct GTY(()) alias_pair -{ - tree decl; - tree target; - int emitted_diags; /* alias_diags already emitted for this pair. */ -} alias_pair; - -/* Define gc'd vector type. */ -DEF_VEC_O(alias_pair); -DEF_VEC_ALLOC_O(alias_pair,gc); - -extern GTY(()) VEC(alias_pair,gc) * alias_pairs; - - -/* Classify which part of the compiler has defined a given builtin function. - Note that we assume below that this is no more than two bits. */ -enum built_in_class -{ - NOT_BUILT_IN = 0, - BUILT_IN_FRONTEND, - BUILT_IN_MD, - BUILT_IN_NORMAL -}; - -/* Names for the above. */ -extern const char *const built_in_class_names[4]; - -/* Codes that identify the various built in functions - so that expand_call can identify them quickly. */ - -#define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM, -enum built_in_function -{ -#include "builtins.def" - - /* Complex division routines in libgcc. These are done via builtins - because emit_library_call_value can't handle complex values. */ - BUILT_IN_COMPLEX_MUL_MIN, - BUILT_IN_COMPLEX_MUL_MAX - = BUILT_IN_COMPLEX_MUL_MIN - + MAX_MODE_COMPLEX_FLOAT - - MIN_MODE_COMPLEX_FLOAT, - - BUILT_IN_COMPLEX_DIV_MIN, - BUILT_IN_COMPLEX_DIV_MAX - = BUILT_IN_COMPLEX_DIV_MIN - + MAX_MODE_COMPLEX_FLOAT - - MIN_MODE_COMPLEX_FLOAT, - - /* Upper bound on non-language-specific builtins. */ - END_BUILTINS -}; -#undef DEF_BUILTIN - -/* Names for the above. */ -extern const char * built_in_names[(int) END_BUILTINS]; /* Helper macros for math builtins. */ -#define BUILTIN_EXP10_P(FN) \ - ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \ - || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L) - -#define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \ - || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \ - || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L) - -#define BUILTIN_SQRT_P(FN) \ - ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL) - -#define BUILTIN_CBRT_P(FN) \ - ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL) - -#define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN)) - #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L +#define CASE_FLT_FN_FLOATN_NX(FN) \ + case FN##F16: case FN##F32: case FN##F64: case FN##F128: \ + case FN##F32X: case FN##F64X: case FN##F128X #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R -#define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL - -/* An array of _DECL trees for the above. */ -extern GTY(()) tree built_in_decls[(int) END_BUILTINS]; -extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS]; - -/* In an OMP_CLAUSE node. */ - -/* Number of operands and names for each clause. */ -extern unsigned const char omp_clause_num_ops[]; -extern const char * const omp_clause_code_name[]; - -/* Clause codes. Do not reorder, as this is used to index into the tables - omp_clause_num_ops and omp_clause_code_name. */ -enum omp_clause_code -{ - /* Clause zero is special-cased inside the parser - (c_parser_omp_variable_list). */ - OMP_CLAUSE_ERROR = 0, - - /* OpenMP clause: private (variable_list). */ - OMP_CLAUSE_PRIVATE, - - /* OpenMP clause: shared (variable_list). */ - OMP_CLAUSE_SHARED, - - /* OpenMP clause: firstprivate (variable_list). */ - OMP_CLAUSE_FIRSTPRIVATE, - - /* OpenMP clause: lastprivate (variable_list). */ - OMP_CLAUSE_LASTPRIVATE, - - /* OpenMP clause: reduction (operator:variable_list). - OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator. - Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var. - Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var - into the shared one. - Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL - placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */ - OMP_CLAUSE_REDUCTION, - - /* OpenMP clause: copyin (variable_list). */ - OMP_CLAUSE_COPYIN, - - /* OpenMP clause: copyprivate (variable_list). */ - OMP_CLAUSE_COPYPRIVATE, - - /* OpenMP clause: if (scalar-expression). */ - OMP_CLAUSE_IF, - - /* OpenMP clause: num_threads (integer-expression). */ - OMP_CLAUSE_NUM_THREADS, - - /* OpenMP clause: schedule. */ - OMP_CLAUSE_SCHEDULE, - - /* OpenMP clause: nowait. */ - OMP_CLAUSE_NOWAIT, - - /* OpenMP clause: ordered. */ - OMP_CLAUSE_ORDERED, - - /* OpenMP clause: default. */ - OMP_CLAUSE_DEFAULT, - - /* OpenMP clause: collapse (constant-integer-expression). */ - OMP_CLAUSE_COLLAPSE, - - /* OpenMP clause: untied. */ - OMP_CLAUSE_UNTIED -}; - -/* The definition of tree nodes fills the next several pages. */ - -/* A tree node can represent a data type, a variable, an expression - or a statement. Each node has a TREE_CODE which says what kind of - thing it represents. Some common codes are: - INTEGER_TYPE -- represents a type of integers. - ARRAY_TYPE -- represents a type of pointer. - VAR_DECL -- represents a declared variable. - INTEGER_CST -- represents a constant integer value. - PLUS_EXPR -- represents a sum (an expression). - - As for the contents of a tree node: there are some fields - that all nodes share. Each TREE_CODE has various special-purpose - fields as well. The fields of a node are never accessed directly, - always through accessor macros. */ - -/* Every kind of tree node starts with this structure, - so all nodes have these fields. - - See the accessor macros, defined below, for documentation of the - fields. */ - -struct GTY(()) tree_base { - ENUM_BITFIELD(tree_code) code : 16; - - unsigned side_effects_flag : 1; - unsigned constant_flag : 1; - unsigned addressable_flag : 1; - unsigned volatile_flag : 1; - unsigned readonly_flag : 1; - unsigned unsigned_flag : 1; - unsigned asm_written_flag: 1; - unsigned nowarning_flag : 1; - - unsigned used_flag : 1; - unsigned nothrow_flag : 1; - unsigned static_flag : 1; - unsigned public_flag : 1; - unsigned private_flag : 1; - unsigned protected_flag : 1; - unsigned deprecated_flag : 1; - unsigned saturating_flag : 1; - - unsigned default_def_flag : 1; - unsigned lang_flag_0 : 1; - unsigned lang_flag_1 : 1; - unsigned lang_flag_2 : 1; - unsigned lang_flag_3 : 1; - unsigned lang_flag_4 : 1; - unsigned lang_flag_5 : 1; - unsigned lang_flag_6 : 1; - - unsigned visited : 1; - unsigned packed_flag : 1; - unsigned user_align : 1; - unsigned nameless_flag : 1; - - unsigned spare : 12; - - /* This field is only used with type nodes; the only reason it is present - in tree_base instead of tree_type is to save space. The size of the - field must be large enough to hold addr_space_t values. */ - unsigned address_space : 8; -}; - -struct GTY(()) tree_common { - struct tree_base base; - tree chain; - tree type; -}; - -/* The following table lists the uses of each of the above flags and - for which types of nodes they are defined. - - addressable_flag: - - TREE_ADDRESSABLE in - VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL - all types - CONSTRUCTOR, IDENTIFIER_NODE - STMT_EXPR, it means we want the result of the enclosed expression - - CALL_EXPR_TAILCALL in - CALL_EXPR - - CASE_LOW_SEEN in - CASE_LABEL_EXPR - - static_flag: - - TREE_STATIC in - VAR_DECL, FUNCTION_DECL - CONSTRUCTOR - - TREE_NO_TRAMPOLINE in - ADDR_EXPR - - BINFO_VIRTUAL_P in - TREE_BINFO - - TREE_SYMBOL_REFERENCED in - IDENTIFIER_NODE - - CLEANUP_EH_ONLY in - TARGET_EXPR, WITH_CLEANUP_EXPR - - TRY_CATCH_IS_CLEANUP in - TRY_CATCH_EXPR - - ASM_INPUT_P in - ASM_EXPR - - TYPE_REF_CAN_ALIAS_ALL in - POINTER_TYPE, REFERENCE_TYPE - - MOVE_NONTEMPORAL in - MODIFY_EXPR - - CASE_HIGH_SEEN in - CASE_LABEL_EXPR - - CALL_CANNOT_INLINE_P in - CALL_EXPR - - ENUM_IS_SCOPED in - ENUMERAL_TYPE - - public_flag: - - TREE_OVERFLOW in - INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST - - TREE_PUBLIC in - VAR_DECL, FUNCTION_DECL - IDENTIFIER_NODE - - ASM_VOLATILE_P in - ASM_EXPR - - CALL_EXPR_VA_ARG_PACK in - CALL_EXPR - - TYPE_CACHED_VALUES_P in - all types - - SAVE_EXPR_RESOLVED_P in - SAVE_EXPR - - OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in - OMP_CLAUSE_LASTPRIVATE - - OMP_CLAUSE_PRIVATE_DEBUG in - OMP_CLAUSE_PRIVATE - - private_flag: - - TREE_PRIVATE in - all decls - - CALL_EXPR_RETURN_SLOT_OPT in - CALL_EXPR - - OMP_SECTION_LAST in - OMP_SECTION - - OMP_PARALLEL_COMBINED in - OMP_PARALLEL - OMP_CLAUSE_PRIVATE_OUTER_REF in - OMP_CLAUSE_PRIVATE - - TYPE_REF_IS_RVALUE in - REFERENCE_TYPE - - protected_flag: - - TREE_PROTECTED in - BLOCK - all decls - - CALL_FROM_THUNK_P and - ALLOCA_FOR_VAR_P in - CALL_EXPR - - side_effects_flag: - - TREE_SIDE_EFFECTS in - all expressions - all decls - all constants - - FORCED_LABEL in - LABEL_DECL - - volatile_flag: - - TREE_THIS_VOLATILE in - all expressions - all decls - - TYPE_VOLATILE in - all types - - readonly_flag: - - TREE_READONLY in - all expressions - all decls - - TYPE_READONLY in - all types - - constant_flag: - - TREE_CONSTANT in - all expressions - all decls - all constants - - TYPE_SIZES_GIMPLIFIED in - all types - - unsigned_flag: - - TYPE_UNSIGNED in - all types - - DECL_UNSIGNED in - all decls - - REGISTER_DEFS_IN_THIS_STMT in - all expressions (tree-into-ssa.c) - - asm_written_flag: - - TREE_ASM_WRITTEN in - VAR_DECL, FUNCTION_DECL - RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE - BLOCK, SSA_NAME, STRING_CST - - NECESSARY in - all expressions (tree-ssa-dce.c, tree-ssa-pre.c) - - used_flag: - - TREE_USED in - all expressions - all decls - IDENTIFIER_NODE - - nothrow_flag: - - TREE_NOTHROW in - CALL_EXPR - FUNCTION_DECL - - TYPE_ALIGN_OK in - all types - - TREE_THIS_NOTRAP in - INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, ARRAY_RANGE_REF - - deprecated_flag: - - TREE_DEPRECATED in - all decls - all types - - IDENTIFIER_TRANSPARENT_ALIAS in - IDENTIFIER_NODE - - STMT_IN_SSA_EDGE_WORKLIST in - all expressions (tree-ssa-propagate.c) - - visited: - - TREE_VISITED in - all trees (used liberally by many passes) - - saturating_flag: - - TYPE_SATURATING in - all types - - nowarning_flag: - - TREE_NO_WARNING in - all expressions - all decls - - default_def_flag: - - TYPE_VECTOR_OPAQUE in - VECTOR_TYPE - - SSA_NAME_IS_DEFAULT_DEF in - SSA_NAME -*/ - -#undef DEFTREESTRUCT -#define DEFTREESTRUCT(ENUM, NAME) ENUM, -enum tree_node_structure_enum { -#include "treestruct.def" - LAST_TS_ENUM -}; -#undef DEFTREESTRUCT +#define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX + +#define NULL_TREE (tree) NULL /* Define accessors for the fields that all tree nodes have (though some fields are not used for all kinds of nodes). */ @@ -660,195 +233,87 @@ is accessed incorrectly. The macros die with a fatal error. */ #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) -#define TREE_CHECK(T, CODE) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) != (CODE)) \ - tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - (CODE), 0); \ - __t; }) - -#define TREE_NOT_CHECK(T, CODE) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) == (CODE)) \ - tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - (CODE), 0); \ - __t; }) - -#define TREE_CHECK2(T, CODE1, CODE2) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) != (CODE1) \ - && TREE_CODE (__t) != (CODE2)) \ - tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - (CODE1), (CODE2), 0); \ - __t; }) - -#define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) == (CODE1) \ - || TREE_CODE (__t) == (CODE2)) \ - tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - (CODE1), (CODE2), 0); \ - __t; }) - -#define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) != (CODE1) \ - && TREE_CODE (__t) != (CODE2) \ - && TREE_CODE (__t) != (CODE3)) \ - tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - (CODE1), (CODE2), (CODE3), 0); \ - __t; }) - -#define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) == (CODE1) \ - || TREE_CODE (__t) == (CODE2) \ - || TREE_CODE (__t) == (CODE3)) \ - tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - (CODE1), (CODE2), (CODE3), 0); \ - __t; }) - -#define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) != (CODE1) \ - && TREE_CODE (__t) != (CODE2) \ - && TREE_CODE (__t) != (CODE3) \ - && TREE_CODE (__t) != (CODE4)) \ - tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - (CODE1), (CODE2), (CODE3), (CODE4), 0); \ - __t; }) - -#define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) == (CODE1) \ - || TREE_CODE (__t) == (CODE2) \ - || TREE_CODE (__t) == (CODE3) \ - || TREE_CODE (__t) == (CODE4)) \ - tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - (CODE1), (CODE2), (CODE3), (CODE4), 0); \ - __t; }) - -#define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) != (CODE1) \ - && TREE_CODE (__t) != (CODE2) \ - && TREE_CODE (__t) != (CODE3) \ - && TREE_CODE (__t) != (CODE4) \ - && TREE_CODE (__t) != (CODE5)) \ - tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\ - __t; }) - -#define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) == (CODE1) \ - || TREE_CODE (__t) == (CODE2) \ - || TREE_CODE (__t) == (CODE3) \ - || TREE_CODE (__t) == (CODE4) \ - || TREE_CODE (__t) == (CODE5)) \ - tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\ - __t; }) - -#define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \ - tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \ - __FUNCTION__); \ - __t; }) - -#define TREE_CLASS_CHECK(T, CLASS) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \ - tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \ - __FUNCTION__); \ - __t; }) - -#define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \ - tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - (CODE1), (CODE2)); \ - __t; }) - -#define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) != OMP_CLAUSE) \ - tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - OMP_CLAUSE, 0); \ - if (__t->omp_clause.code != (CODE)) \ - omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - (CODE)); \ - __t; }) - -#define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TREE_CODE (__t) != OMP_CLAUSE) \ - tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - OMP_CLAUSE, 0); \ - if ((int) __t->omp_clause.code < (int) (CODE1) \ - || (int) __t->omp_clause.code > (int) (CODE2)) \ - omp_clause_range_check_failed (__t, __FILE__, __LINE__, \ - __FUNCTION__, (CODE1), (CODE2)); \ - __t; }) +#define TREE_CHECK(T, CODE) \ +(tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE))) + +#define TREE_NOT_CHECK(T, CODE) \ +(tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE))) + +#define TREE_CHECK2(T, CODE1, CODE2) \ +(tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2))) + +#define TREE_NOT_CHECK2(T, CODE1, CODE2) \ +(tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2))) + +#define TREE_CHECK3(T, CODE1, CODE2, CODE3) \ +(tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3))) + +#define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \ +(tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \ + (CODE1), (CODE2), (CODE3))) + +#define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \ +(tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \ + (CODE1), (CODE2), (CODE3), (CODE4))) + +#define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \ +(tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \ + (CODE1), (CODE2), (CODE3), (CODE4))) + +#define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \ +(tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \ + (CODE1), (CODE2), (CODE3), (CODE4), (CODE5))) + +#define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \ +(tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \ + (CODE1), (CODE2), (CODE3), (CODE4), (CODE5))) + +#define CONTAINS_STRUCT_CHECK(T, STRUCT) \ +(contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__)) + +#define TREE_CLASS_CHECK(T, CLASS) \ +(tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__)) + +#define TREE_RANGE_CHECK(T, CODE1, CODE2) \ +(tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__)) + +#define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \ +(omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__)) + +#define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \ +(omp_clause_range_check ((T), (CODE1), (CODE2), \ + __FILE__, __LINE__, __FUNCTION__)) /* These checks have to be special cased. */ -#define EXPR_CHECK(T) __extension__ \ -({ __typeof (T) const __t = (T); \ - char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \ - if (!IS_EXPR_CODE_CLASS (__c)) \ - tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \ - __FUNCTION__); \ - __t; }) +#define EXPR_CHECK(T) \ +(expr_check ((T), __FILE__, __LINE__, __FUNCTION__)) + +/* These checks have to be special cased. */ +#define NON_TYPE_CHECK(T) \ +(non_type_check ((T), __FILE__, __LINE__, __FUNCTION__)) /* These checks have to be special cased. */ -#define NON_TYPE_CHECK(T) __extension__ \ -({ __typeof (T) const __t = (T); \ - if (TYPE_P (__t)) \ - tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \ - __FUNCTION__); \ - __t; }) - -#define TREE_VEC_ELT_CHECK(T, I) __extension__ \ -(*({__typeof (T) const __t = (T); \ - const int __i = (I); \ - if (TREE_CODE (__t) != TREE_VEC) \ - tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - TREE_VEC, 0); \ - if (__i < 0 || __i >= __t->vec.length) \ - tree_vec_elt_check_failed (__i, __t->vec.length, \ - __FILE__, __LINE__, __FUNCTION__); \ - &__t->vec.a[__i]; })) - -#define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \ -(*({__typeof (T) const __t = (T); \ - const int __i = (I); \ - if (TREE_CODE (__t) != OMP_CLAUSE) \ - tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ - OMP_CLAUSE, 0); \ - if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \ - omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \ - __FUNCTION__); \ - &__t->omp_clause.ops[__i]; })) +#define ANY_INTEGRAL_TYPE_CHECK(T) \ +(any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__)) + +#define TREE_INT_CST_ELT_CHECK(T, I) \ +(*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)) + +#define TREE_VEC_ELT_CHECK(T, I) \ +(*(CONST_CAST2 (tree *, typeof (T)*, \ + tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))) + +#define OMP_CLAUSE_ELT_CHECK(T, I) \ +(*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))) /* Special checks for TREE_OPERANDs. */ -#define TREE_OPERAND_CHECK(T, I) __extension__ \ -(*({__typeof (T) const __t = EXPR_CHECK (T); \ - const int __i = (I); \ - if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \ - tree_operand_check_failed (__i, __t, \ - __FILE__, __LINE__, __FUNCTION__); \ - &__t->exp.operands[__i]; })) - -#define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \ -(*({__typeof (T) const __t = (T); \ - const int __i = (I); \ - if (TREE_CODE (__t) != CODE) \ - tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\ - if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \ - tree_operand_check_failed (__i, __t, \ - __FILE__, __LINE__, __FUNCTION__); \ - &__t->exp.operands[__i]; })) +#define TREE_OPERAND_CHECK(T, I) \ +(*(CONST_CAST2 (tree*, typeof (T)*, \ + tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))) + +#define TREE_OPERAND_CHECK_CODE(T, CODE, I) \ +(*(tree_operand_check_code ((T), (CODE), (I), \ + __FILE__, __LINE__, __FUNCTION__))) /* Nodes are chained together for many purposes. Types are chained together to record them for being output to the debugger @@ -859,57 +324,58 @@ Often lists of things are represented by TREE_LIST nodes that are chained together. */ -#define TREE_CHAIN(NODE) __extension__ \ -(*({__typeof (NODE) const __t = (NODE); \ - &__t->common.chain; })) +#define TREE_CHAIN(NODE) \ +(CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain) /* In all nodes that are expressions, this is the data type of the expression. In POINTER_TYPE nodes, this is the type that the pointer points to. In ARRAY_TYPE nodes, this is the type of the elements. In VECTOR_TYPE nodes, this is the type of the elements. */ -#define TREE_TYPE(NODE) __extension__ \ -(*({__typeof (NODE) const __t = (NODE); \ - &__t->common.type; })) +#define TREE_TYPE(NODE) \ +(CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type) extern void tree_contains_struct_check_failed (const_tree, const enum tree_node_structure_enum, const char *, int, const char *) - ATTRIBUTE_NORETURN; + ATTRIBUTE_NORETURN ATTRIBUTE_COLD; extern void tree_check_failed (const_tree, const char *, int, const char *, - ...) ATTRIBUTE_NORETURN; + ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD; extern void tree_not_check_failed (const_tree, const char *, int, const char *, - ...) ATTRIBUTE_NORETURN; + ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD; extern void tree_class_check_failed (const_tree, const enum tree_code_class, const char *, int, const char *) - ATTRIBUTE_NORETURN; + ATTRIBUTE_NORETURN ATTRIBUTE_COLD; extern void tree_range_check_failed (const_tree, const char *, int, const char *, enum tree_code, enum tree_code) - ATTRIBUTE_NORETURN; + ATTRIBUTE_NORETURN ATTRIBUTE_COLD; extern void tree_not_class_check_failed (const_tree, const enum tree_code_class, const char *, int, const char *) - ATTRIBUTE_NORETURN; + ATTRIBUTE_NORETURN ATTRIBUTE_COLD; +extern void tree_int_cst_elt_check_failed (int, int, const char *, + int, const char *) + ATTRIBUTE_NORETURN ATTRIBUTE_COLD; extern void tree_vec_elt_check_failed (int, int, const char *, int, const char *) - ATTRIBUTE_NORETURN; + ATTRIBUTE_NORETURN ATTRIBUTE_COLD; extern void phi_node_elt_check_failed (int, int, const char *, int, const char *) - ATTRIBUTE_NORETURN; + ATTRIBUTE_NORETURN ATTRIBUTE_COLD; extern void tree_operand_check_failed (int, const_tree, const char *, int, const char *) - ATTRIBUTE_NORETURN; + ATTRIBUTE_NORETURN ATTRIBUTE_COLD; extern void omp_clause_check_failed (const_tree, const char *, int, const char *, enum omp_clause_code) - ATTRIBUTE_NORETURN; + ATTRIBUTE_NORETURN ATTRIBUTE_COLD; extern void omp_clause_operand_check_failed (int, const_tree, const char *, int, const char *) - ATTRIBUTE_NORETURN; + ATTRIBUTE_NORETURN ATTRIBUTE_COLD; extern void omp_clause_range_check_failed (const_tree, const char *, int, const char *, enum omp_clause_code, enum omp_clause_code) - ATTRIBUTE_NORETURN; + ATTRIBUTE_NORETURN ATTRIBUTE_COLD; #else /* not ENABLE_TREE_CHECKING, or not gcc */ @@ -928,19 +394,22 @@ #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T) #define EXPR_CHECK(T) (T) #define NON_TYPE_CHECK(T) (T) +#define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I]) #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I]) #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I]) #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I]) #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i]) #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T) #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T) +#define ANY_INTEGRAL_TYPE_CHECK(T) (T) #define TREE_CHAIN(NODE) ((NODE)->common.chain) -#define TREE_TYPE(NODE) ((NODE)->common.type) +#define TREE_TYPE(NODE) ((NODE)->typed.type) #endif -#define TREE_BLOCK(NODE) *(tree_block (NODE)) +#define TREE_BLOCK(NODE) (tree_block (NODE)) +#define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B))) #include "tree-check.h" @@ -977,7 +446,7 @@ #define CONVERT_EXPR_CODE_P(CODE) \ ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR) -/* Similarly, but accept an expressions instead of a tree code. */ +/* Similarly, but accept an expression instead of a tree code. */ #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP)) /* Generate case for NOP_EXPR, CONVERT_EXPR. */ @@ -1014,6 +483,16 @@ #define STRIP_USELESS_TYPE_CONVERSION(EXP) \ (EXP) = tree_ssa_strip_useless_type_conversions (EXP) +/* Nonzero if TYPE represents a vector type. */ + +#define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE) + +/* Nonzero if TYPE represents a vector of booleans. */ + +#define VECTOR_BOOLEAN_TYPE_P(TYPE) \ + (TREE_CODE (TYPE) == VECTOR_TYPE \ + && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE) + /* Nonzero if TYPE represents an integral type. Note that we do not include COMPLEX types here. Keep these checks in ascending code order. */ @@ -1023,6 +502,15 @@ || TREE_CODE (TYPE) == BOOLEAN_TYPE \ || TREE_CODE (TYPE) == INTEGER_TYPE) +/* Nonzero if TYPE represents an integral type, including complex + and vector integer types. */ + +#define ANY_INTEGRAL_TYPE_P(TYPE) \ + (INTEGRAL_TYPE_P (TYPE) \ + || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ + || VECTOR_TYPE_P (TYPE)) \ + && INTEGRAL_TYPE_P (TREE_TYPE (TYPE)))) + /* Nonzero if TYPE represents a non-saturating fixed-point type. */ #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \ @@ -1047,10 +535,17 @@ (TREE_CODE (TYPE) == COMPLEX_TYPE \ && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) +/* Nonzero if TYPE represents a vector integer type. */ + +#define VECTOR_INTEGER_TYPE_P(TYPE) \ + (VECTOR_TYPE_P (TYPE) \ + && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE) + + /* Nonzero if TYPE represents a vector floating-point type. */ #define VECTOR_FLOAT_TYPE_P(TYPE) \ - (TREE_CODE (TYPE) == VECTOR_TYPE \ + (VECTOR_TYPE_P (TYPE) \ && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) /* Nonzero if TYPE represents a floating-point type, including complex @@ -1060,7 +555,7 @@ #define FLOAT_TYPE_P(TYPE) \ (SCALAR_FLOAT_TYPE_P (TYPE) \ || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ - || TREE_CODE (TYPE) == VECTOR_TYPE) \ + || VECTOR_TYPE_P (TYPE)) \ && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE)))) /* Nonzero if TYPE represents a decimal floating-point type. */ @@ -1087,9 +582,28 @@ #define POINTER_TYPE_P(TYPE) \ (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) +/* Nonzero if TYPE represents a pointer to function. */ +#define FUNCTION_POINTER_TYPE_P(TYPE) \ + (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE) + /* Nonzero if this type is a complete type. */ #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) +/* Nonzero if this type is a pointer bounds type. */ +#define POINTER_BOUNDS_TYPE_P(NODE) \ + (TREE_CODE (NODE) == POINTER_BOUNDS_TYPE) + +/* Nonzero if this node has a pointer bounds type. */ +#define POINTER_BOUNDS_P(NODE) \ + (POINTER_BOUNDS_TYPE_P (TREE_TYPE (NODE))) + +/* Nonzero if this type supposes bounds existence. */ +#define BOUNDED_TYPE_P(type) (POINTER_TYPE_P (type)) + +/* Nonzero for objects with bounded type. */ +#define BOUNDED_P(node) \ + BOUNDED_TYPE_P (TREE_TYPE (node)) + /* Nonzero if this type is the (possibly qualified) void type. */ #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) @@ -1101,28 +615,38 @@ #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE))) - +#define FUNC_OR_METHOD_TYPE_P(NODE) \ + (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE) + /* Define many boolean fields that all tree nodes have. */ /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address of this is needed. So it cannot be in a register. In a FUNCTION_DECL it has no meaning. - In CONSTRUCTOR nodes, it means object constructed must be in memory. In LABEL_DECL nodes, it means a goto for this label has been seen from a place outside all binding contours that restore stack levels. + In an artificial SSA_NAME that points to a stack partition with at least + two variables, it means that at least one variable has TREE_ADDRESSABLE. In ..._TYPE nodes, it means that objects of this type must be fully addressable. This means that pieces of this object cannot go into register parameters, for example. If this a function type, this means that the value must be returned in memory. + In CONSTRUCTOR nodes, it means object constructed must be in memory. In IDENTIFIER_NODEs, this means that some extern decl for this name - had its address taken. That matters for inline functions. */ + had its address taken. That matters for inline functions. + In a STMT_EXPR, it means we want the result of the enclosed expression. */ #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag) /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the exit of a function. Calls for which this is true are candidates for tail call optimizations. */ #define CALL_EXPR_TAILCALL(NODE) \ - (CALL_EXPR_CHECK(NODE)->base.addressable_flag) + (CALL_EXPR_CHECK (NODE)->base.addressable_flag) + +/* Set on a CALL_EXPR if the call has been marked as requiring tail call + optimization for correctness. */ +#define CALL_EXPR_MUST_TAIL_CALL(NODE) \ + (CALL_EXPR_CHECK (NODE)->base.static_flag) /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the CASE_LOW operand has been processed. */ @@ -1130,11 +654,11 @@ (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag) #define PREDICT_EXPR_OUTCOME(NODE) \ - ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag)) + ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag)) #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \ - (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME) + (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME) #define PREDICT_EXPR_PREDICTOR(NODE) \ - ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0)) + ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0))) /* In a VAR_DECL, nonzero means allocate static storage. In a FUNCTION_DECL, nonzero if function has been defined. @@ -1159,9 +683,6 @@ #define CASE_HIGH_SEEN(NODE) \ (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag) -/* Used to mark a CALL_EXPR as not suitable for inlining. */ -#define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag) - /* Used to mark scoped enums. */ #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag) @@ -1175,6 +696,9 @@ emitted. */ #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag) +/* Used to indicate that this TYPE represents a compiler-generated entity. */ +#define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag) + /* In an IDENTIFIER_NODE, this means that assemble_name was called with this string as an argument. */ #define TREE_SYMBOL_REFERENCED(NODE) \ @@ -1185,10 +709,6 @@ #define TYPE_REF_CAN_ALIAS_ALL(NODE) \ (PTR_OR_REF_CHECK (NODE)->base.static_flag) -/* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */ -#define MOVE_NONTEMPORAL(NODE) \ - (EXPR_CHECK (NODE)->base.static_flag) - /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means there was an overflow in folding. */ @@ -1208,7 +728,7 @@ /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector of cached values, or is something else. */ -#define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag) +#define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag) /* In a SAVE_EXPR, indicates that the original expression has already been substituted with a VAR_DECL that contains the value. */ @@ -1218,7 +738,7 @@ /* Set on a CALL_EXPR if this stdarg call should be passed the argument pack. */ #define CALL_EXPR_VA_ARG_PACK(NODE) \ - (CALL_EXPR_CHECK(NODE)->base.public_flag) + (CALL_EXPR_CHECK (NODE)->base.public_flag) /* In any expression, decl, or constant, nonzero means it has side effects or reevaluation of the whole expression could produce a different value. @@ -1233,6 +753,11 @@ computed gotos. */ #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag) +/* Whether a case or a user-defined label is allowed to fall through to. + This is used to implement -Wimplicit-fallthrough. */ +#define FALLTHROUGH_LABEL_P(NODE) \ + (LABEL_DECL_CHECK (NODE)->base.private_flag) + /* Nonzero means this expression is volatile in the C sense: its address should be of type `volatile WHATEVER *'. In other words, the declared item is volatile qualified. @@ -1277,17 +802,48 @@ /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */ #define DECL_UNSIGNED(NODE) \ - (DECL_COMMON_CHECK (NODE)->base.unsigned_flag) + (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag) /* In integral and pointer types, means an unsigned type. */ -#define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag) +#define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag) + +/* Same as TYPE_UNSIGNED but converted to SIGNOP. */ +#define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE)) + +/* True if overflow wraps around for the given integral type. That + is, TYPE_MAX + 1 == TYPE_MIN. */ +#define TYPE_OVERFLOW_WRAPS(TYPE) \ + (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag || flag_wrapv) + +/* True if overflow is undefined for the given integral type. We may + optimize on the assumption that values in the type never overflow. + + IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED + must issue a warning based on warn_strict_overflow. In some cases + it will be appropriate to issue the warning immediately, and in + other cases it will be appropriate to simply set a flag and let the + caller decide whether a warning is appropriate or not. */ +#define TYPE_OVERFLOW_UNDEFINED(TYPE) \ + (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \ + && !flag_wrapv && !flag_trapv) + +/* True if overflow for the given integral type should issue a + trap. */ +#define TYPE_OVERFLOW_TRAPS(TYPE) \ + (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv) + +/* True if an overflow is to be preserved for sanitization. */ +#define TYPE_OVERFLOW_SANITIZED(TYPE) \ + (INTEGRAL_TYPE_P (TYPE) \ + && !TYPE_OVERFLOW_WRAPS (TYPE) \ + && (flag_sanitize & SANITIZE_SI_OVERFLOW)) /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written. Nonzero in a FUNCTION_DECL means that the function has been compiled. This is interesting in an inline function, since it might not need to be compiled separately. - Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE - if the debugging info for the type has been written. + Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE + or TYPE_DECL if the debugging info for the type has been written. In a BLOCK node, nonzero if reorder_blocks has already seen this block. In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal PHI node. */ @@ -1311,6 +867,15 @@ #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \ (CALL_EXPR_CHECK (NODE)->base.private_flag) +/* Cilk keywords accessors. */ +#define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0) + +/* If this is true, we should insert a __cilk_detach call just before + this function call. */ +#define EXPR_CILK_SPAWN(NODE) \ + (TREE_CHECK2 (NODE, CALL_EXPR, \ + AGGR_INIT_EXPR)->base.u.bits.unsigned_flag) + /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is passed by invisible reference (and the TREE_TYPE is a pointer to the true type). */ @@ -1318,36 +883,28 @@ (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \ RESULT_DECL)->decl_common.decl_by_reference_flag) -/* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl - can be used as restricted tag to disambiguate against other restrict - pointers. Used by fortran to capture something like non-addressability - (which it isn't really because the middle-end does take addresses of - such variables). */ -#define DECL_RESTRICTED_P(NODE) \ - (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \ - RESULT_DECL)->decl_common.decl_restricted_flag) - +/* In VAR_DECL and PARM_DECL, set when the decl has been used except for + being set. */ #define DECL_READ_P(NODE) \ (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag) +/* In VAR_DECL or RESULT_DECL, set when significant code movement precludes + attempting to share the stack slot with some other variable. */ +#define DECL_NONSHAREABLE(NODE) \ + (TREE_CHECK2 (NODE, VAR_DECL, \ + RESULT_DECL)->decl_common.decl_nonshareable_flag) + /* In a CALL_EXPR, means that the call is the jump from a thunk to the thunked-to function. */ #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag) /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that it has been built for the declaration of a variable-sized object. */ -#define ALLOCA_FOR_VAR_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag) - -/* In a type, nonzero means that all objects of the type are guaranteed by the - language or front-end to be properly aligned, so we can indicate that a MEM - of this type is aligned at least to the alignment of the type, even if it - doesn't appear that it is. We see this, for example, in object-oriented - languages where a tag field may show this is an object of a more-aligned - variant of the more generic type. - - In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME - freelist. */ -#define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag) +#define CALL_ALLOCA_FOR_VAR_P(NODE) \ + (CALL_EXPR_CHECK (NODE)->base.protected_flag) + +/* In a CALL_EXPR, means call was instrumented by Pointer Bounds Checker. */ +#define CALL_WITH_BOUNDS_P(NODE) (CALL_EXPR_CHECK (NODE)->base.deprecated_flag) /* Used in classes in C++. */ #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag) @@ -1368,100 +925,89 @@ #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \ (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag) -/* In fixed-point types, means a saturating type. */ -#define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag) +/* In an aggregate type, indicates that the scalar fields of the type are + stored in reverse order from the target order. This effectively + toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */ +#define TYPE_REVERSE_STORAGE_ORDER(NODE) \ + (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag) + +/* In a non-aggregate type, indicates a saturating type. */ +#define TYPE_SATURATING(NODE) \ + (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag) + +/* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group + of bits stored in reverse order from the target order. This effectively + toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference. + + The overall strategy is to preserve the invariant that every scalar in + memory is associated with a single storage order, i.e. all accesses to + this scalar are done with the same storage order. This invariant makes + it possible to factor out the storage order in most transformations, as + only the address and/or the value (in target order) matter for them. + But, of course, the storage order must be preserved when the accesses + themselves are rewritten or transformed. */ +#define REF_REVERSE_STORAGE_ORDER(NODE) \ + (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag) + + /* In an ADDR_EXPR, indicates that this is a pointer to nested function + represented by a descriptor instead of a trampoline. */ +#define FUNC_ADDR_BY_DESCRIPTOR(NODE) \ + (TREE_CHECK (NODE, ADDR_EXPR)->base.default_def_flag) + +/* In a CALL_EXPR, indicates that this is an indirect call for which + pointers to nested function are descriptors instead of trampolines. */ +#define CALL_EXPR_BY_DESCRIPTOR(NODE) \ + (TREE_CHECK (NODE, CALL_EXPR)->base.default_def_flag) /* These flags are available for each language front end to use internally. */ -#define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0) -#define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1) -#define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2) -#define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3) -#define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4) -#define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5) -#define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6) - +#define TREE_LANG_FLAG_0(NODE) \ + (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0) +#define TREE_LANG_FLAG_1(NODE) \ + (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1) +#define TREE_LANG_FLAG_2(NODE) \ + (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2) +#define TREE_LANG_FLAG_3(NODE) \ + (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3) +#define TREE_LANG_FLAG_4(NODE) \ + (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4) +#define TREE_LANG_FLAG_5(NODE) \ + (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5) +#define TREE_LANG_FLAG_6(NODE) \ + (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6) + /* Define additional fields and accessors for nodes representing constants. */ -/* In an INTEGER_CST node. These two together make a 2-word integer. - If the data type is signed, the value is sign-extended to 2 words - even though not all of them may really be in use. - In an unsigned constant shorter than 2 words, the extra bits are 0. */ -#define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst) -#define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low) -#define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high) - -#define INT_CST_LT(A, B) \ - (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ - || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ - && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) - -#define INT_CST_LT_UNSIGNED(A, B) \ - (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ - < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ - || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ - == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ - && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) - -struct GTY(()) tree_int_cst { - struct tree_common common; - double_int int_cst; -}; - -/* In a REAL_CST node. struct real_value is an opaque entity, with - manipulators defined in real.h. We don't want tree.h depending on - real.h and transitively on tm.h. */ -struct real_value; +#define TREE_INT_CST_NUNITS(NODE) \ + (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended) +#define TREE_INT_CST_EXT_NUNITS(NODE) \ + (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended) +#define TREE_INT_CST_OFFSET_NUNITS(NODE) \ + (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset) +#define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I) +#define TREE_INT_CST_LOW(NODE) \ + ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0)) #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr) #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE)) -struct GTY(()) tree_real_cst { - struct tree_common common; - struct real_value * real_cst_ptr; -}; - -/* In a FIXED_CST node. */ -struct fixed_value; - #define TREE_FIXED_CST_PTR(NODE) \ (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr) #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE)) -struct GTY(()) tree_fixed_cst { - struct tree_common common; - struct fixed_value * fixed_cst_ptr; -}; - /* In a STRING_CST */ +/* In C terms, this is sizeof, not strlen. */ #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) #define TREE_STRING_POINTER(NODE) \ ((const char *)(STRING_CST_CHECK (NODE)->string.str)) -struct GTY(()) tree_string { - struct tree_common common; - int length; - char str[1]; -}; - /* In a COMPLEX_CST node. */ #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) -struct GTY(()) tree_complex { - struct tree_common common; - tree real; - tree imag; -}; - /* In a VECTOR_CST node. */ -#define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements) - -struct GTY(()) tree_vector { - struct tree_common common; - tree elements; -}; - -#include "symtab.h" +#define VECTOR_CST_NELTS(NODE) (VECTOR_CST_CHECK (NODE)->base.u.nelts) +#define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts) +#define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX]) /* Define fields and accessors for some special-purpose tree nodes. */ @@ -1479,48 +1025,33 @@ ((tree) ((char *) (NODE) - sizeof (struct tree_common))) #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id) -struct GTY(()) tree_identifier { - struct tree_common common; - struct ht_identifier id; -}; - /* In a TREE_LIST node. */ #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) -struct GTY(()) tree_list { - struct tree_common common; - tree purpose; - tree value; -}; - /* In a TREE_VEC node. */ -#define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length) +#define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length) #define TREE_VEC_END(NODE) \ - ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length])) + ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length])) #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) -struct GTY(()) tree_vec { - struct tree_common common; - int length; - tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1]; -}; - /* In a CONSTRUCTOR node. */ #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts) #define CONSTRUCTOR_ELT(NODE,IDX) \ - (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX)) + (&(*CONSTRUCTOR_ELTS (NODE))[IDX]) #define CONSTRUCTOR_NELTS(NODE) \ - (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE))) + (vec_safe_length (CONSTRUCTOR_ELTS (NODE))) +#define CONSTRUCTOR_NO_CLEARING(NODE) \ + (CONSTRUCTOR_CHECK (NODE)->base.public_flag) /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the value of each element (stored within VAL). IX must be a scratch variable of unsigned integer type. */ #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \ - for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \ + for (IX = 0; (IX >= vec_safe_length (V)) \ ? false \ - : ((VAL = VEC_index (constructor_elt, V, IX)->value), \ + : ((VAL = (*(V))[IX].value), \ true); \ (IX)++) @@ -1528,19 +1059,18 @@ the value of each element (stored within VAL) and its index (stored within INDEX). IX must be a scratch variable of unsigned integer type. */ #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \ - for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \ + for (IX = 0; (IX >= vec_safe_length (V)) \ ? false \ - : (((void) (VAL = VEC_index (constructor_elt, V, IX)->value)), \ - (INDEX = VEC_index (constructor_elt, V, IX)->index), \ + : (((void) (VAL = (*V)[IX].value)), \ + (INDEX = (*V)[IX].index), \ true); \ (IX)++) /* Append a new constructor element to V, with the specified INDEX and VAL. */ #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \ do { \ - constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \ - _ce___->index = INDEX; \ - _ce___->value = VALUE; \ + constructor_elt _ce___ = {INDEX, VALUE}; \ + vec_safe_push ((V), _ce___); \ } while (0) /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for @@ -1548,22 +1078,13 @@ #define CONSTRUCTOR_BITFIELD_P(NODE) \ (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode) -/* A single element of a CONSTRUCTOR. VALUE holds the actual value of the - element. INDEX can optionally design the position of VALUE: in arrays, - it is the index where VALUE has to be placed; in structures, it is the - FIELD_DECL of the member. */ -typedef struct GTY(()) constructor_elt_d { - tree index; - tree value; -} constructor_elt; - -DEF_VEC_O(constructor_elt); -DEF_VEC_ALLOC_O(constructor_elt,gc); - -struct GTY(()) tree_constructor { - struct tree_common common; - VEC(constructor_elt,gc) *elts; -}; +/* True if NODE is a clobber right hand side, an expression of indeterminate + value that clobbers the LHS in a copy instruction. We use a volatile + empty CONSTRUCTOR for this, as it matches most of the necessary semantic. + In particular the volatile flag causes us to not prematurely remove + such clobber instructions. */ +#define TREE_CLOBBER_P(NODE) \ + (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE)) /* Define fields and accessors for some nodes that represent expressions. */ @@ -1594,17 +1115,36 @@ decls and constants can be shared among multiple locations, so return nothing. */ #define EXPR_LOCATION(NODE) \ - (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION) + (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION) #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS) -#define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION) -#define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) ? (NODE)->exp.locus : input_location) +#define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \ + != UNKNOWN_LOCATION) +/* The location to be used in a diagnostic about this expression. Do not + use this macro if the location will be assigned to other expressions. */ +#define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \ + ? (NODE)->exp.locus : (LOCUS)) #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus) #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus) +#define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE)) +#define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE)))) + +#define EXPR_HAS_RANGE(NODE) \ + (CAN_HAVE_RANGE_P (NODE) \ + ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \ + : false) + /* True if a tree is an expression or statement that can have a location. */ #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE)) +static inline source_range +get_expr_source_range (tree expr) +{ + location_t loc = EXPR_LOCATION (expr); + return get_range_from_loc (line_table, loc); +} + extern void protected_set_expr_location (tree, location_t); /* In a TARGET_EXPR node. */ @@ -1636,6 +1176,7 @@ #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0) #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1) #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2) +#define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3) /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match corresponding MEM_REF operands. */ @@ -1645,6 +1186,11 @@ #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3)) #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4)) +#define MR_DEPENDENCE_CLIQUE(NODE) \ + (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique) +#define MR_DEPENDENCE_BASE(NODE) \ + (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base) + /* The operands of a BIND_EXPR. */ #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0)) #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1)) @@ -1674,18 +1220,14 @@ #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2)) /* Accessors for the chains of recurrences. */ -#define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0) -#define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1) -#define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2) -#define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE)) +#define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0) +#define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1) +#define CHREC_VARIABLE(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.u.chrec_var /* LABEL_EXPR accessor. This gives access to the label associated with the given label expression. */ #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0) -/* VDEF_EXPR accessors are specified in tree-flow.h, along with the other - accessors for SSA operands. */ - /* CATCH_EXPR accessors. */ #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0) #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1) @@ -1703,12 +1245,12 @@ #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0) #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1) -/* CALL_EXPR accessors. - */ +/* CALL_EXPR accessors. */ #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1) #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2) #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3) -#define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3) +#define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3) +#define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn) /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE. We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if @@ -1719,12 +1261,51 @@ #define CALL_EXPR_ARGP(NODE) \ (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3) -/* OpenMP directive and clause accessors. */ - +/* TM directives and accessors. */ +#define TRANSACTION_EXPR_BODY(NODE) \ + TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0) +#define TRANSACTION_EXPR_OUTER(NODE) \ + (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag) +#define TRANSACTION_EXPR_RELAXED(NODE) \ + (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag) + +/* OpenMP and OpenACC directive and clause accessors. */ + +/* Generic accessors for OMP nodes that keep the body as operand 0, and clauses + as operand 1. */ #define OMP_BODY(NODE) \ - TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0) + TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_TASKGROUP), 0) #define OMP_CLAUSES(NODE) \ - TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1) + TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SINGLE), 1) + +/* Generic accessors for OMP nodes that keep clauses as operand 0. */ +#define OMP_STANDALONE_CLAUSES(NODE) \ + TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0) + +#define OACC_DATA_BODY(NODE) \ + TREE_OPERAND (OACC_DATA_CHECK (NODE), 0) +#define OACC_DATA_CLAUSES(NODE) \ + TREE_OPERAND (OACC_DATA_CHECK (NODE), 1) + +#define OACC_HOST_DATA_BODY(NODE) \ + TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0) +#define OACC_HOST_DATA_CLAUSES(NODE) \ + TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1) + +#define OACC_CACHE_CLAUSES(NODE) \ + TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0) + +#define OACC_DECLARE_CLAUSES(NODE) \ + TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0) + +#define OACC_ENTER_DATA_CLAUSES(NODE) \ + TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0) + +#define OACC_EXIT_DATA_CLAUSES(NODE) \ + TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0) + +#define OACC_UPDATE_CLAUSES(NODE) \ + TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0) #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0) #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1) @@ -1736,12 +1317,14 @@ #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0) #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1) -#define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0) -#define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1) -#define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2) -#define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3) -#define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4) -#define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5) +#define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP) +#define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0) +#define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1) +#define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2) +#define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3) +#define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4) +#define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5) +#define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 6) #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0) #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1) @@ -1753,18 +1336,48 @@ #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0) +#define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0) + #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0) +#define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1) #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0) -#define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1) +#define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1) +#define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2) + +#define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0) +#define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1) + +#define OMP_TARGET_DATA_BODY(NODE) \ + TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0) +#define OMP_TARGET_DATA_CLAUSES(NODE)\ + TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1) + +#define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0) +#define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1) + +#define OMP_TARGET_UPDATE_CLAUSES(NODE)\ + TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0) + +#define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\ + TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0) + +#define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\ + TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0) + +#define OMP_CLAUSE_SIZE(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \ + OMP_CLAUSE_FROM, \ + OMP_CLAUSE__CACHE_), 1) #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE)) #define OMP_CLAUSE_DECL(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \ OMP_CLAUSE_PRIVATE, \ - OMP_CLAUSE_COPYPRIVATE), 0) + OMP_CLAUSE__LOOPTEMP_), 0) #define OMP_CLAUSE_HAS_LOCATION(NODE) \ - ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION) + (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \ + != UNKNOWN_LOCATION) #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus /* True on an OMP_SECTION statement that was the last lexical member. @@ -1777,6 +1390,22 @@ #define OMP_PARALLEL_COMBINED(NODE) \ (OMP_PARALLEL_CHECK (NODE)->base.private_flag) +/* True on an OMP_TEAMS statement if it represents an explicit + combined teams distribute constructs. */ +#define OMP_TEAMS_COMBINED(NODE) \ + (OMP_TEAMS_CHECK (NODE)->base.private_flag) + +/* True on an OMP_TARGET statement if it represents explicit + combined target teams, target parallel or target simd constructs. */ +#define OMP_TARGET_COMBINED(NODE) \ + (OMP_TARGET_CHECK (NODE)->base.private_flag) + +/* True if OMP_ATOMIC* is supposed to be sequentially consistent + as opposed to relaxed. */ +#define OMP_ATOMIC_SEQ_CST(NODE) \ + (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \ + OMP_ATOMIC_CAPTURE_NEW)->base.private_flag) + /* True on a PRIVATE clause if its decl is kept around for debugging information only and its DECL_VALUE_EXPR is supposed to point to what it has been remapped to. */ @@ -1788,6 +1417,16 @@ #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \ TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)) +/* True if a PRIVATE clause is for a C++ class IV on taskloop construct + (thus should be private on the outer taskloop and firstprivate on + task). */ +#define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \ + TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)) + +/* True on a FIRSTPRIVATE clause if it has been added implicitly. */ +#define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag) + /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same decl is present in the chain. */ #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \ @@ -1799,12 +1438,103 @@ #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \ (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init +/* True if a LASTPRIVATE clause is for a C++ class IV on taskloop construct + (thus should be lastprivate on the outer taskloop and firstprivate on + task). */ +#define OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV(NODE) \ + TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)) + +/* True on a SHARED clause if a FIRSTPRIVATE clause for the same + decl is present in the chain (this can happen only for taskloop + with FIRSTPRIVATE/LASTPRIVATE on it originally. */ +#define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag) + +/* True on a SHARED clause if a scalar is not modified in the body and + thus could be optimized as firstprivate. */ +#define OMP_CLAUSE_SHARED_READONLY(NODE) \ + TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)) + +#define OMP_CLAUSE_IF_MODIFIER(NODE) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier) + +#define OMP_CLAUSE_FINAL_EXPR(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0) #define OMP_CLAUSE_IF_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0) #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0) #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0) +#define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0) +#define OMP_CLAUSE_HINT_EXPR(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0) + +#define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0) + +#define OMP_CLAUSE_PRIORITY_EXPR(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0) + +/* OpenACC clause expressions */ +#define OMP_CLAUSE_EXPR(NODE, CLAUSE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0) +#define OMP_CLAUSE_GANG_EXPR(NODE) \ + OMP_CLAUSE_OPERAND ( \ + OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0) +#define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \ + OMP_CLAUSE_OPERAND ( \ + OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1) +#define OMP_CLAUSE_ASYNC_EXPR(NODE) \ + OMP_CLAUSE_OPERAND ( \ + OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0) +#define OMP_CLAUSE_WAIT_EXPR(NODE) \ + OMP_CLAUSE_OPERAND ( \ + OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0) +#define OMP_CLAUSE_VECTOR_EXPR(NODE) \ + OMP_CLAUSE_OPERAND ( \ + OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0) +#define OMP_CLAUSE_WORKER_EXPR(NODE) \ + OMP_CLAUSE_OPERAND ( \ + OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0) +#define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \ + OMP_CLAUSE_OPERAND ( \ + OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0) +#define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \ + OMP_CLAUSE_OPERAND ( \ + OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0) +#define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \ + OMP_CLAUSE_OPERAND ( \ + OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0) + +#define OMP_CLAUSE_DEPEND_KIND(NODE) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind) + +#define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \ + TREE_PUBLIC (TREE_LIST_CHECK (NODE)) + +#define OMP_CLAUSE_MAP_KIND(NODE) \ + ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind) +#define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \ + = (unsigned int) (MAP_KIND)) + +/* Nonzero if this map clause is for array (rather than pointer) based array + section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding + OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */ +#define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag) +/* Nonzero if this is a mapped array section, that might need special + treatment if OMP_CLAUSE_SIZE is zero. */ +#define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \ + TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)) +/* Nonzero if this map clause is for an ACC parallel reduction variable. */ +#define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \ + TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)) + +#define OMP_CLAUSE_PROC_BIND_KIND(NODE) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind) #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0) @@ -1813,6 +1543,9 @@ #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2) +#define OMP_CLAUSE_ORDERED_EXPR(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0) + #define OMP_CLAUSE_REDUCTION_CODE(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code) #define OMP_CLAUSE_REDUCTION_INIT(NODE) \ @@ -1825,52 +1558,138 @@ (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3) - -enum omp_clause_schedule_kind -{ - OMP_CLAUSE_SCHEDULE_STATIC, - OMP_CLAUSE_SCHEDULE_DYNAMIC, - OMP_CLAUSE_SCHEDULE_GUIDED, - OMP_CLAUSE_SCHEDULE_AUTO, - OMP_CLAUSE_SCHEDULE_RUNTIME -}; +#define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 4) + +/* True if a REDUCTION clause may reference the original list item (omp_orig) + in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */ +#define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag) + +/* True if a LINEAR clause doesn't need copy in. True for iterator vars which + are always initialized inside of the loop construct, false otherwise. */ +#define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag) + +/* True if a LINEAR clause doesn't need copy out. True for iterator vars which + are declared inside of the simd construct. */ +#define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \ + TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)) + +/* True if a LINEAR clause has a stride that is variable. */ +#define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \ + TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)) + +/* True if a LINEAR clause is for an array or allocatable variable that + needs special handling by the frontend. */ +#define OMP_CLAUSE_LINEAR_ARRAY(NODE) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag) + +#define OMP_CLAUSE_LINEAR_STEP(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1) + +#define OMP_CLAUSE_LINEAR_STMT(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2) + +#define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \ + (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init + +#define OMP_CLAUSE_LINEAR_KIND(NODE) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind) + +#define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1) + +#define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0) + +#define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ + OMP_CLAUSE_THREAD_LIMIT), 0) + +#define OMP_CLAUSE_DEVICE_ID(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0) + +#define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ + OMP_CLAUSE_DIST_SCHEDULE), 0) + +#define OMP_CLAUSE_SAFELEN_EXPR(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0) + +#define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0) + +#define OMP_CLAUSE__SIMDUID__DECL(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0) #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind) -enum omp_clause_default_kind -{ - OMP_CLAUSE_DEFAULT_UNSPECIFIED, - OMP_CLAUSE_DEFAULT_SHARED, - OMP_CLAUSE_DEFAULT_NONE, - OMP_CLAUSE_DEFAULT_PRIVATE, - OMP_CLAUSE_DEFAULT_FIRSTPRIVATE -}; +/* True if a SCHEDULE clause has the simd modifier on it. */ +#define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag) #define OMP_CLAUSE_DEFAULT_KIND(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind) -struct GTY(()) tree_exp { - struct tree_common common; - location_t locus; - tree block; - tree GTY ((special ("tree_exp"), - desc ("TREE_CODE ((tree) &%0)"))) - operands[1]; -}; - +#define OMP_CLAUSE_TILE_LIST(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0) +#define OMP_CLAUSE_TILE_ITERVAR(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1) +#define OMP_CLAUSE_TILE_COUNT(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2) + +#define OMP_CLAUSE__GRIDDIM__DIMENSION(NODE) \ + (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_)\ + ->omp_clause.subcode.dimension) +#define OMP_CLAUSE__GRIDDIM__SIZE(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 0) +#define OMP_CLAUSE__GRIDDIM__GROUP(NODE) \ + OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 1) + /* SSA_NAME accessors. */ -/* Returns the variable being referenced. Once released, this is the - only field that can be relied upon. */ -#define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var +/* Whether SSA_NAME NODE is a virtual operand. This simply caches the + information in the underlying SSA_NAME_VAR for efficiency. */ +#define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \ + SSA_NAME_CHECK (NODE)->base.public_flag + +/* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE + if there is no name associated with it. */ +#define SSA_NAME_IDENTIFIER(NODE) \ + (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \ + ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \ + ? (NODE)->ssa_name.var \ + : DECL_NAME ((NODE)->ssa_name.var)) \ + : NULL_TREE) + +/* Returns the variable being referenced. This can be NULL_TREE for + temporaries not associated with any user variable. + Once released, this is the only field that can be relied upon. */ +#define SSA_NAME_VAR(NODE) \ + (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \ + || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \ + ? NULL_TREE : (NODE)->ssa_name.var) + +#define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \ + do \ + { \ + tree var_ = (VAR); \ + SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \ + SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \ + = (var_ \ + && TREE_CODE (var_) == VAR_DECL \ + && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \ + } \ + while (0) /* Returns the statement which defines this SSA name. */ #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt /* Returns the SSA version number of this SSA name. Note that in tree SSA, version numbers are not per variable and may be recycled. */ -#define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version +#define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are never output, so we can safely use the ASM_WRITTEN_FLAG for this @@ -1894,102 +1713,52 @@ /* Attributes for SSA_NAMEs for pointer-type variables. */ #define SSA_NAME_PTR_INFO(N) \ - SSA_NAME_CHECK (N)->ssa_name.ptr_info - -/* Defined in tree-flow.h. */ -struct ptr_info_def; - -/* Immediate use linking structure. This structure is used for maintaining - a doubly linked list of uses of an SSA_NAME. */ -typedef struct GTY(()) ssa_use_operand_d { - struct ssa_use_operand_d* GTY((skip(""))) prev; - struct ssa_use_operand_d* GTY((skip(""))) next; - /* Immediate uses for a given SSA name are maintained as a cyclic - list. To recognize the root of this list, the location field - needs to point to the original SSA name. Since statements and - SSA names are of different data types, we need this union. See - the explanation in struct immediate_use_iterator_d. */ - union { gimple stmt; tree ssa_name; } GTY((skip(""))) loc; - tree *GTY((skip(""))) use; -} ssa_use_operand_t; + SSA_NAME_CHECK (N)->ssa_name.info.ptr_info + +/* True if SSA_NAME_RANGE_INFO describes an anti-range. */ +#define SSA_NAME_ANTI_RANGE_P(N) \ + SSA_NAME_CHECK (N)->base.static_flag + +/* The type of range described by SSA_NAME_RANGE_INFO. */ +#define SSA_NAME_RANGE_TYPE(N) \ + (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE) + +/* Value range info attributes for SSA_NAMEs of non pointer-type variables. */ +#define SSA_NAME_RANGE_INFO(N) \ + SSA_NAME_CHECK (N)->ssa_name.info.range_info /* Return the immediate_use information for an SSA_NAME. */ #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses -struct GTY(()) tree_ssa_name { - struct tree_common common; - - /* _DECL wrapped by this SSA name. */ - tree var; - - /* Statement that defines this SSA name. */ - gimple def_stmt; - - /* SSA version number. */ - unsigned int version; - - /* Pointer attributes used for alias analysis. */ - struct ptr_info_def *ptr_info; - - /* Immediate uses list for this SSA_NAME. */ - struct ssa_use_operand_d imm_uses; -}; - -struct GTY(()) phi_arg_d { - /* imm_use MUST be the first element in struct because we do some - pointer arithmetic with it. See phi_arg_index_from_use. */ - struct ssa_use_operand_d imm_use; - tree def; - location_t locus; -}; - - #define OMP_CLAUSE_CODE(NODE) \ (OMP_CLAUSE_CHECK (NODE))->omp_clause.code #define OMP_CLAUSE_SET_CODE(NODE, CODE) \ ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE)) -#define OMP_CLAUSE_CODE(NODE) \ - (OMP_CLAUSE_CHECK (NODE))->omp_clause.code - #define OMP_CLAUSE_OPERAND(NODE, I) \ OMP_CLAUSE_ELT_CHECK (NODE, I) -struct GTY(()) tree_omp_clause { - struct tree_common common; - location_t locus; - enum omp_clause_code code; - union omp_clause_subcode { - enum omp_clause_default_kind default_kind; - enum omp_clause_schedule_kind schedule_kind; - enum tree_code reduction_code; - } GTY ((skip)) subcode; - - /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's - usage. */ - gimple_seq gimple_reduction_init; - gimple_seq gimple_reduction_merge; - - tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1]; -}; - - /* In a BLOCK node. */ #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) #define BLOCK_NONLOCALIZED_VARS(NODE) \ (BLOCK_CHECK (NODE)->block.nonlocalized_vars) #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \ - VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE)) -#define BLOCK_NONLOCALIZED_VAR(NODE,N) \ - VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N) + vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE)) +#define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N] #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) -/* Note: when changing this, make sure to find the places - that use chainon or nreverse. */ -#define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE)) +#define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain) #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) +#define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die) + +/* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */ +#define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag) + +/* True if BLOCK appears in cold section. */ +#define BLOCK_IN_COLD_SECTION_P(NODE) \ + (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag) /* An index number for this block. These values are not guaranteed to be unique across functions -- whether or not they are depends on @@ -2027,24 +1796,11 @@ #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus) -struct GTY(()) tree_block { - struct tree_common common; - - unsigned abstract_flag : 1; - unsigned block_num : 31; - - location_t locus; - - tree vars; - VEC(tree,gc) *nonlocalized_vars; - - tree subblocks; - tree supercontext; - tree abstract_origin; - tree fragment_origin; - tree fragment_chain; -}; - +/* This gives the location of the end of the block, useful to attach + code implicitly generated for outgoing paths. */ + +#define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus) + /* Define fields and accessors for nodes representing data types. */ /* See tree.def for documentation of the use of these fields. @@ -2056,39 +1812,32 @@ type. Note also that some of the front-ends also overload these fields, so they must be checked as well. */ -#define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid) -#define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size) -#define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit) -#define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values) -#define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values) -#define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values) -#define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values) -#define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval) -#define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval) -#define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values) -#define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval) -#define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval) -#define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to) -#define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to) -#define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval) -#define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval) -#define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval) -#define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval) -#define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision) -#define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name) -#define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant) -#define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant) -#define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context) -#define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type.maxval) -#define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type.minval) - -/* Vector types need to check target flags to determine type. */ -extern enum machine_mode vector_type_mode (const_tree); +#define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid) +#define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size) +#define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit) +#define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to) +#define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to) +#define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision) +#define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name) +#define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant) +#define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant) +#define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context) + +#define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode) #define TYPE_MODE(NODE) \ - (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \ - ? vector_type_mode (NODE) : (NODE)->type.mode) + (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \ + ? vector_type_mode (NODE) : (NODE)->type_common.mode) +#define SCALAR_TYPE_MODE(NODE) \ + (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode)) +#define SCALAR_INT_TYPE_MODE(NODE) \ + (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode)) +#define SCALAR_FLOAT_TYPE_MODE(NODE) \ + (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode)) #define SET_TYPE_MODE(NODE, MODE) \ - (TYPE_CHECK (NODE)->type.mode = (MODE)) + (TYPE_CHECK (NODE)->type_common.mode = (MODE)) + +extern machine_mode element_mode (const_tree); +extern machine_mode vector_type_mode (const_tree); /* The "canonical" type for this type node, which is used by frontends to compare the type for equality with another type. If two types are @@ -2106,7 +1855,7 @@ to each other without a conversion. The middle-end also makes sure to assign the same alias-sets to the type partition with equal TYPE_CANONICAL of their unqualified variants. */ -#define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical) +#define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical) /* Indicates that the type node requires structural equality checks. The compiler will need to look at the composition of the type to determine whether it is equal to another type, rather than @@ -2118,43 +1867,53 @@ type node requires structural equality. */ #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE) -#define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific) #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE))) #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE))) -/* For record and union types, information about this type, as a base type - for itself. */ -#define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo) - -/* For non record and union types, used in a language-dependent way. */ -#define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo) - /* The (language-specific) typed-based alias set for this type. Objects whose TYPE_ALIAS_SETs are different cannot alias each other. If the TYPE_ALIAS_SET is -1, no alias set has yet been assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this type can alias objects of any type. */ -#define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set) +#define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set) /* Nonzero iff the typed-based alias set for this type has been calculated. */ -#define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1) +#define TYPE_ALIAS_SET_KNOWN_P(NODE) \ + (TYPE_CHECK (NODE)->type_common.alias_set != -1) /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply to this type. */ -#define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes) +#define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes) /* The alignment necessary for objects of this type. - The value is an int, measured in bits. */ -#define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align) + The value is an int, measured in bits and must be a power of two. + We support also an "alignment" of zero. */ +#define TYPE_ALIGN(NODE) \ + (TYPE_CHECK (NODE)->type_common.align \ + ? ((unsigned)1) << ((NODE)->type_common.align - 1) : 0) + +/* Specify that TYPE_ALIGN(NODE) is X. */ +#define SET_TYPE_ALIGN(NODE, X) \ + (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X)) /* 1 if the alignment for this type was requested by "aligned" attribute, 0 if it is the default for this type. */ -#define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->common.base.user_align) +#define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align) /* The alignment for NODE, in bytes. */ #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT) +/* The minimum alignment necessary for objects of this type without + warning. The value is an int, measured in bits. */ +#define TYPE_WARN_IF_NOT_ALIGN(NODE) \ + (TYPE_CHECK (NODE)->type_common.warn_if_not_align \ + ? ((unsigned)1) << ((NODE)->type_common.warn_if_not_align - 1) : 0) + +/* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */ +#define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \ + (TYPE_CHECK (NODE)->type_common.warn_if_not_align = ffs_hwi (X)) + /* If your language allows you to declare types, and you want debug info for them, then you need to generate corresponding TYPE_DECL nodes. These "stub" TYPE_DECL nodes have no name, and simply point at the @@ -2162,48 +1921,32 @@ to point back at the TYPE_DECL node. This allows the debug routines to know that the two nodes represent the same type, so that we only get one debug info record for them. */ -#define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE) - -/* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type - has BLKmode only because it lacks the alignment requirement for +#define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE))) + +/* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means + the type has BLKmode only because it lacks the alignment required for its size. */ -#define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag) - -/* In an INTEGER_TYPE, it means the type represents a size. We use - this both for validity checking and to permit optimizations that - are unsafe for other types. Note that the C `size_t' type should - *not* have this flag set. The `size_t' type is simply a typedef - for an ordinary integer type that happens to be the type of an - expression returned by `sizeof'; `size_t' has no special - properties. Expressions whose type have TYPE_IS_SIZETYPE set are - always actual sizes. */ -#define TYPE_IS_SIZETYPE(NODE) \ - (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag) +#define TYPE_NO_FORCE_BLK(NODE) \ + (TYPE_CHECK (NODE)->type_common.no_force_blk_flag) /* Nonzero in a type considered volatile as a whole. */ #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag) +/* Nonzero in a type considered atomic as a whole. */ +#define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag) + /* Means this type is const-qualified. */ #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag) /* If nonzero, this type is `restrict'-qualified, in the C sense of the term. */ -#define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag) +#define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag) /* If nonzero, type's name shouldn't be emitted into debug info. */ -#define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.nameless_flag) +#define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag) /* The address space the type is in. */ -#define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.address_space) - -/* There is a TYPE_QUAL value for each type qualifier. They can be - combined by bitwise-or to form the complete set of qualifiers for a - type. */ - -#define TYPE_UNQUALIFIED 0x0 -#define TYPE_QUAL_CONST 0x1 -#define TYPE_QUAL_VOLATILE 0x2 -#define TYPE_QUAL_RESTRICT 0x4 +#define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space) /* Encode/decode the named memory support as part of the qualifier. If more than 8 qualifiers are added, these macros need to be adjusted. */ @@ -2219,25 +1962,35 @@ /* The set of type qualifiers for this type. */ #define TYPE_QUALS(NODE) \ - ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ - | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ - | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \ - | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))) + ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ + | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ + | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \ + | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \ + | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))) /* The same as TYPE_QUALS without the address space qualifications. */ #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \ - ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ - | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ - | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)) + ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ + | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ + | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \ + | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))) + +/* The same as TYPE_QUALS without the address space and atomic + qualifications. */ +#define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \ + ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ + | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ + | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))) /* These flags are available for each language front end to use internally. */ -#define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0) -#define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1) -#define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2) -#define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3) -#define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4) -#define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5) -#define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6) +#define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0) +#define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1) +#define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2) +#define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3) +#define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4) +#define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5) +#define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6) +#define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7) /* Used to keep track of visited nodes in tree traversals. This is set to 0 by copy_node and make_node. */ @@ -2246,22 +1999,16 @@ /* If set in an ARRAY_TYPE, indicates a string type (for languages that distinguish string from array of char). If set in a INTEGER_TYPE, indicates a character type. */ -#define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag) - -/* If non-NULL, this is an upper bound of the size (in bytes) of an - object of the given ARRAY_TYPE. This allows temporaries to be - allocated. */ -#define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ - (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval) +#define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag) /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */ #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \ - (((unsigned HOST_WIDE_INT) 1) \ - << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision) + (HOST_WIDE_INT_1U \ + << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision) /* Set precision to n when we have 2^n sub-parts of the vector. */ #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \ - (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X)) + (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X)) /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings about missing conversions to other vector types of the same size. */ @@ -2271,30 +2018,47 @@ /* Indicates that objects of this type must be initialized by calling a function when they are created. */ #define TYPE_NEEDS_CONSTRUCTING(NODE) \ - (TYPE_CHECK (NODE)->type.needs_constructing_flag) + (TYPE_CHECK (NODE)->type_common.needs_constructing_flag) /* Indicates that a UNION_TYPE object should be passed the same way that the first union alternative would be passed, or that a RECORD_TYPE object should be passed the same way that the first (and only) member would be passed. */ #define TYPE_TRANSPARENT_AGGR(NODE) \ - (RECORD_OR_UNION_CHECK (NODE)->type.transparent_aggr_flag) + (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag) /* For an ARRAY_TYPE, indicates that it is not permitted to take the address of a component of the type. This is the counterpart of DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */ #define TYPE_NONALIASED_COMPONENT(NODE) \ - (ARRAY_TYPE_CHECK (NODE)->type.transparent_aggr_flag) + (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag) + +/* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE + whether the array is typeless storage or the type contains a member + with this flag set. Such types are exempt from type-based alias + analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types + the flag should be inherited from the element type, can change + when type is finalized and because of that should not be used in + type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types + the flag should not be changed after the array is created and should + be used in type hashing. */ +#define TYPE_TYPELESS_STORAGE(NODE) \ + (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \ + ARRAY_TYPE)->type_common.typeless_storage) /* Indicated that objects of this type should be laid out in as compact a way as possible. */ -#define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->common.base.packed_flag) +#define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag) /* Used by type_contains_placeholder_p to avoid recomputation. Values are: 0 (unknown), 1 (false), 2 (true). Never access this field directly. */ #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \ - (TYPE_CHECK (NODE)->type.contains_placeholder_bits) + (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits) + +/* Nonzero if RECORD_TYPE represents a final derivation of class. */ +#define TYPE_FINAL_P(NODE) \ + (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag) /* The debug output functions use the symtab union field to store information specific to the debugging format. The different debug @@ -2305,15 +2069,18 @@ /* Symtab field as an integer. Used by stabs generator in dbxout.c to hold the type's number in the generated stabs. */ -#define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address) +#define TYPE_SYMTAB_ADDRESS(NODE) \ + (TYPE_CHECK (NODE)->type_common.symtab.address) /* Symtab field as a string. Used by COFF generator in sdbout.c to hold struct/union type tag names. */ -#define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer) +#define TYPE_SYMTAB_POINTER(NODE) \ + (TYPE_CHECK (NODE)->type_common.symtab.pointer) /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator in dwarf2out.c to point to the DIE generated for the type. */ -#define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die) +#define TYPE_SYMTAB_DIE(NODE) \ + (TYPE_CHECK (NODE)->type_common.symtab.die) /* The garbage collector needs to know the interpretation of the symtab field. These constants represent the different types in the @@ -2323,55 +2090,48 @@ #define TYPE_SYMTAB_IS_POINTER (1) #define TYPE_SYMTAB_IS_DIE (2) -struct die_struct; - -struct GTY(()) tree_type { - struct tree_common common; - tree values; - tree size; - tree size_unit; - tree attributes; - unsigned int uid; - - unsigned int precision : 10; - unsigned no_force_blk_flag : 1; - unsigned needs_constructing_flag : 1; - unsigned transparent_aggr_flag : 1; - unsigned restrict_flag : 1; - unsigned contains_placeholder_bits : 2; - - ENUM_BITFIELD(machine_mode) mode : 8; - - unsigned string_flag : 1; - unsigned lang_flag_0 : 1; - unsigned lang_flag_1 : 1; - unsigned lang_flag_2 : 1; - unsigned lang_flag_3 : 1; - unsigned lang_flag_4 : 1; - unsigned lang_flag_5 : 1; - unsigned lang_flag_6 : 1; - - unsigned int align; - alias_set_type alias_set; - tree pointer_to; - tree reference_to; - union tree_type_symtab { - int GTY ((tag ("TYPE_SYMTAB_IS_ADDRESS"))) address; - const char * GTY ((tag ("TYPE_SYMTAB_IS_POINTER"))) pointer; - struct die_struct * GTY ((tag ("TYPE_SYMTAB_IS_DIE"))) die; - } GTY ((desc ("debug_hooks->tree_type_symtab_field"))) symtab; - tree name; - tree minval; - tree maxval; - tree next_variant; - tree main_variant; - tree binfo; - tree context; - tree canonical; - /* Points to a structure whose details depend on the language in use. */ - struct lang_type *lang_specific; -}; - +#define TYPE_LANG_SPECIFIC(NODE) \ + (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific) + +#define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values) +#define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values) +#define TYPE_FIELDS(NODE) \ + (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values) +#define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values) +#define TYPE_ARG_TYPES(NODE) \ + (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values) +#define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values) + +#define TYPE_MIN_VALUE(NODE) \ + (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval) +#define TYPE_NEXT_PTR_TO(NODE) \ + (POINTER_TYPE_CHECK (NODE)->type_non_common.minval) +#define TYPE_NEXT_REF_TO(NODE) \ + (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval) +#define TYPE_VFIELD(NODE) \ + (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval) +#define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval) + +#define TYPE_MAX_VALUE(NODE) \ + (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval) +#define TYPE_METHOD_BASETYPE(NODE) \ + (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval) +#define TYPE_OFFSET_BASETYPE(NODE) \ + (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval) +/* If non-NULL, this is an upper bound of the size (in bytes) of an + object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be + allocated. */ +#define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ + (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval) +#define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval) +/* For record and union types, information about this type, as a base type + for itself. */ +#define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval) + +/* For types, used in a language-dependent way. */ +#define TYPE_LANG_SLOT_1(NODE) \ + (TYPE_CHECK (NODE)->type_non_common.lang_1) + /* Define accessor macros for information about type inheritance and basetypes. @@ -2393,16 +2153,16 @@ #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag) /* Flags for language dependent use. */ -#define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE)) -#define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE)) -#define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE)) -#define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE)) -#define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE)) -#define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE)) -#define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE)) +#define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE)) +#define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE)) +#define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE)) +#define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE)) +#define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE)) +#define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE)) +#define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE)) /* The actual data type node being inherited in this basetype. */ -#define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE)) +#define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE)) /* The offset where this basetype appears in its containing type. BINFO_OFFSET slot holds the offset (in bytes) @@ -2410,19 +2170,19 @@ object that is allocated on behalf of this `type'. This is always 0 except when there is multiple inheritance. */ -#define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset) +#define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset) #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) /* The virtual function table belonging to this basetype. Virtual function tables provide a mechanism for run-time method dispatching. The entries of a virtual function table are language-dependent. */ -#define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable) +#define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable) /* The virtual functions in the virtual function table. This is a TREE_LIST that is used as an initial approximation for building a virtual function table for this basetype. */ -#define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals) +#define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals) /* A vector of binfos for the direct basetypes inherited by this basetype. @@ -2430,96 +2190,63 @@ If this basetype describes type D as inherited in C, and if the basetypes of D are E and F, then this vector contains binfos for inheritance of E and F by C. */ -#define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos) +#define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos) /* The number of basetypes for NODE. */ -#define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE))) +#define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ()) /* Accessor macro to get to the Nth base binfo of this binfo. */ #define BINFO_BASE_BINFO(NODE,N) \ - (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N))) + ((*BINFO_BASE_BINFOS (NODE))[(N)]) #define BINFO_BASE_ITERATE(NODE,N,B) \ - (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B))) + (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B))) #define BINFO_BASE_APPEND(NODE,T) \ - (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T))) + (BINFO_BASE_BINFOS (NODE)->quick_push ((T))) /* For a BINFO record describing a virtual base class, i.e., one where TREE_VIA_VIRTUAL is set, this field assists in locating the virtual base. The actual contents are language-dependent. In the C++ front-end this field is an INTEGER_CST giving an offset into the vtable where the offset to the virtual base can be found. */ -#define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field) +#define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field) /* Indicates the accesses this binfo has to its bases. The values are access_public_node, access_protected_node or access_private_node. If this array is not present, public access is implied. */ -#define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses) +#define BINFO_BASE_ACCESSES(NODE) \ + (TREE_BINFO_CHECK (NODE)->binfo.base_accesses) #define BINFO_BASE_ACCESS(NODE,N) \ - VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N)) + (*BINFO_BASE_ACCESSES (NODE))[(N)] #define BINFO_BASE_ACCESS_APPEND(NODE,T) \ - VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T)) + BINFO_BASE_ACCESSES (NODE)->quick_push ((T)) /* The index in the VTT where this subobject's sub-VTT can be found. NULL_TREE if there is no sub-VTT. */ -#define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt) +#define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt) /* The index in the VTT where the vptr for this subobject can be found. NULL_TREE if there is no secondary vptr in the VTT. */ -#define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr) +#define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr) /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base inheriting this base for non-virtual bases. For virtual bases it points either to the binfo for which this is a primary binfo, or to the binfo of the most derived type. */ #define BINFO_INHERITANCE_CHAIN(NODE) \ - (TREE_BINFO_CHECK(NODE)->binfo.inheritance) - -struct GTY (()) tree_binfo { - struct tree_common common; - - tree offset; - tree vtable; - tree virtuals; - tree vptr_field; - VEC(tree,gc) *base_accesses; - tree inheritance; - - tree vtt_subvtt; - tree vtt_vptr; - - VEC(tree,none) base_binfos; -}; - - + (TREE_BINFO_CHECK (NODE)->binfo.inheritance) + + /* Define fields and accessors for nodes representing declared names. */ -/* Nonzero if DECL represents a variable for the SSA passes. */ +/* Nonzero if DECL represents an SSA name or a variable that can possibly + have an associated SSA name. */ #define SSA_VAR_P(DECL) \ (TREE_CODE (DECL) == VAR_DECL \ || TREE_CODE (DECL) == PARM_DECL \ || TREE_CODE (DECL) == RESULT_DECL \ - || (TREE_CODE (DECL) == SSA_NAME \ - && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \ - || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \ - || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL))) - - - - -/* Enumerate visibility settings. */ -#ifndef SYMBOL_VISIBILITY_DEFINED -#define SYMBOL_VISIBILITY_DEFINED -enum symbol_visibility -{ - VISIBILITY_DEFAULT, - VISIBILITY_PROTECTED, - VISIBILITY_HIDDEN, - VISIBILITY_INTERNAL -}; -#endif - -struct function; + || TREE_CODE (DECL) == SSA_NAME) + #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE))) @@ -2527,6 +2254,11 @@ It is an IDENTIFIER_NODE. */ #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name) +/* The IDENTIFIER_NODE associated with the TYPE_NAME field. */ +#define TYPE_IDENTIFIER(NODE) \ + (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \ + ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE)) + /* Every ..._DECL node gets a unique number. */ #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid) @@ -2555,8 +2287,15 @@ (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus) #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE)) #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE)) +#define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE)) +/* This accessor returns TRUE if the decl it operates on was created + by a front-end or back-end rather than by user code. In this case + builtin-ness is indicated by source location. */ #define DECL_IS_BUILTIN(DECL) \ - (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION) + (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION) + +#define DECL_LOCATION_RANGE(NODE) \ + (get_decl_source_range (DECL_MINIMAL_CHECK (NODE))) /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, @@ -2564,22 +2303,15 @@ nodes, this points to either the FUNCTION_DECL for the containing function, the RECORD_TYPE or UNION_TYPE for the containing type, or NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file - scope". */ + scope". In particular, for VAR_DECLs which are virtual table pointers + (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type + they belong to. */ #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context) #define DECL_FIELD_CONTEXT(NODE) \ (FIELD_DECL_CHECK (NODE)->decl_minimal.context) /* If nonzero, decl's name shouldn't be emitted into debug info. */ -#define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.nameless_flag) - -struct GTY(()) tree_decl_minimal { - struct tree_common common; - location_t locus; - unsigned int uid; - tree name; - tree context; -}; - +#define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag) /* For any sort of a ..._DECL node, this points to the original (abstract) decl node which this decl is an inlined/cloned instance of, or else it @@ -2624,18 +2356,38 @@ #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size) /* Likewise for the size in bytes. */ #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit) -/* Holds the alignment required for the datum, in bits. */ -#define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align) +/* Returns the alignment required for the datum, in bits. It must + be a power of two, but an "alignment" of zero is supported + (e.g. as "uninitialized" sentinel). */ +#define DECL_ALIGN(NODE) \ + (DECL_COMMON_CHECK (NODE)->decl_common.align \ + ? ((unsigned)1) << ((NODE)->decl_common.align - 1) : 0) +/* Specify that DECL_ALIGN(NODE) is X. */ +#define SET_DECL_ALIGN(NODE, X) \ + (DECL_COMMON_CHECK (NODE)->decl_common.align = ffs_hwi (X)) + +/* The minimum alignment necessary for the datum, in bits, without + warning. */ +#define DECL_WARN_IF_NOT_ALIGN(NODE) \ + (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align \ + ? ((unsigned)1) << ((NODE)->decl_common.warn_if_not_align - 1) : 0) + +/* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */ +#define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \ + (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align = ffs_hwi (X)) + /* The alignment of NODE, in bytes. */ #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) /* Set if the alignment of this DECL has been set by the user, for example with an 'aligned' attribute. */ #define DECL_USER_ALIGN(NODE) \ - (DECL_COMMON_CHECK (NODE)->common.base.user_align) + (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align) /* Holds the machine mode corresponding to the declaration of a variable or field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a FIELD_DECL. */ #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode) +#define SET_DECL_MODE(NODE, MODE) \ + (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE)) /* For FUNCTION_DECL, if it is built-in, this identifies which built-in operation it is. Note, however, that this field is overloaded, with @@ -2643,8 +2395,18 @@ checked before any access to the former. */ #define DECL_FUNCTION_CODE(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code) -#define DECL_DEBUG_EXPR_IS_FROM(NODE) \ - (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from) + +/* Test if FCODE is a function code for an alloca operation. */ +#define ALLOCA_FUNCTION_CODE_P(FCODE) \ + ((FCODE) == BUILT_IN_ALLOCA \ + || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \ + || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX) + +/* Generate case for an alloca operation. */ +#define CASE_BUILT_IN_ALLOCA \ + case BUILT_IN_ALLOCA: \ + case BUILT_IN_ALLOCA_WITH_ALIGN: \ + case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX #define DECL_FUNCTION_PERSONALITY(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.personality) @@ -2662,7 +2424,7 @@ information, we mustn't try to generate any address information for nodes marked as "abstract instances" because we don't actually generate any code or allocate any data space for such instances. */ -#define DECL_ABSTRACT(NODE) \ +#define DECL_ABSTRACT_P(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag) /* Language-specific decl information. */ @@ -2740,83 +2502,12 @@ #define DECL_GIMPLE_REG_P(DECL) \ DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag -struct GTY(()) tree_decl_common { - struct tree_decl_minimal common; - tree size; - - ENUM_BITFIELD(machine_mode) mode : 8; - - unsigned nonlocal_flag : 1; - unsigned virtual_flag : 1; - unsigned ignored_flag : 1; - unsigned abstract_flag : 1; - unsigned artificial_flag : 1; - unsigned preserve_flag: 1; - unsigned debug_expr_is_from : 1; - - unsigned lang_flag_0 : 1; - unsigned lang_flag_1 : 1; - unsigned lang_flag_2 : 1; - unsigned lang_flag_3 : 1; - unsigned lang_flag_4 : 1; - unsigned lang_flag_5 : 1; - unsigned lang_flag_6 : 1; - unsigned lang_flag_7 : 1; - unsigned lang_flag_8 : 1; - - /* In LABEL_DECL, this is DECL_ERROR_ISSUED. - In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */ - unsigned decl_flag_0 : 1; - /* In FIELD_DECL, this is DECL_BIT_FIELD - In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL. - In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */ - unsigned decl_flag_1 : 1; - /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P - In VAR_DECL, PARM_DECL and RESULT_DECL, this is - DECL_HAS_VALUE_EXPR_P. */ - unsigned decl_flag_2 : 1; - /* Logically, these two would go in a theoretical base shared by var and - parm decl. */ - unsigned gimple_reg_flag : 1; - /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */ - unsigned decl_by_reference_flag : 1; - /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */ - unsigned decl_restricted_flag : 1; - - /* In VAR_DECL and PARM_DECL set when the decl has been used except for - being set. */ - unsigned decl_read_flag : 1; - - /* Padding so that 'off_align' can be on a 32-bit boundary. */ - unsigned decl_common_unused : 1; - - /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */ - unsigned int off_align : 8; - - /* 24-bits unused. */ - - /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */ - unsigned int align; - - /* UID for points-to sets, stable over copying from inlining. */ - unsigned int pt_uid; - - tree size_unit; - tree initial; - tree attributes; - tree abstract_origin; - - /* Points to a structure whose details depend on the language in use. */ - struct lang_decl *lang_specific; -}; - extern tree decl_value_expr_lookup (tree); extern void decl_value_expr_insert (tree, tree); /* In a VAR_DECL or PARM_DECL, the location at which the value may be found, if transformations have made this more complicated than evaluating the - decl itself. This should only be used for debugging; once this field has - been set, the decl itself may not legitimately appear in the function. */ + decl itself. */ #define DECL_HAS_VALUE_EXPR_P(NODE) \ (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \ ->decl_common.decl_flag_2) @@ -2852,14 +2543,20 @@ /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) +#if (GCC_VERSION >= 2007) +#define DECL_RTL_KNOWN_SET(decl) __extension__ \ +({ tree const __d = (decl); \ + gcc_checking_assert (DECL_RTL_SET_P (__d)); \ + /* Dereference it so the compiler knows it can't be NULL even \ + without assertion checking. */ \ + &*DECL_RTL_IF_SET (__d); }) +#else +#define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl)) +#endif + /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0) -struct GTY(()) tree_decl_with_rtl { - struct tree_decl_common common; - rtx rtl; -}; - /* In a FIELD_DECL, this is the field position, counting in bytes, of the DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning of the structure. */ @@ -2878,6 +2575,11 @@ #define DECL_BIT_FIELD_TYPE(NODE) \ (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type) +/* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage + representative FIELD_DECL. */ +#define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \ + (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) + /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which if nonzero, indicates that the field occupies the type. */ #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) @@ -2889,7 +2591,7 @@ #define DECL_OFFSET_ALIGN(NODE) \ (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align) -/* Specify that DECL_ALIGN(NODE) is a multiple of X. */ +/* Specify that DECL_OFFSET_ALIGN(NODE) is X. */ #define SET_DECL_OFFSET_ALIGN(NODE, X) \ (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1) @@ -2899,7 +2601,7 @@ #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext) /* In a FIELD_DECL, indicates this field should be bit-packed. */ -#define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->common.base.packed_flag) +#define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag) /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed specially. */ @@ -2923,16 +2625,6 @@ #define DECL_NONADDRESSABLE_P(NODE) \ (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2) -struct GTY(()) tree_field_decl { - struct tree_decl_common common; - - tree offset; - tree bit_field_type; - tree qualifier; - tree bit_offset; - tree fcontext; -}; - /* A numeric unique identifier for a LABEL_DECL. The UID allocation is dense, unique within any one function, and may be used to index arrays. If the value is -1, then no UID has been assigned. */ @@ -2944,27 +2636,6 @@ #define EH_LANDING_PAD_NR(NODE) \ (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr) -/* In LABEL_DECL nodes, nonzero means that an error message about - jumping into such a binding contour has been printed for this label. */ -#define DECL_ERROR_ISSUED(NODE) \ - (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0) - -struct GTY(()) tree_label_decl { - struct tree_decl_with_rtl common; - int label_decl_uid; - int eh_landing_pad_nr; -}; - -struct var_ann_d; -struct GTY(()) tree_result_decl { - struct tree_decl_with_rtl common; - struct var_ann_d *ann; -}; - -struct GTY(()) tree_const_decl { - struct tree_decl_with_rtl common; -}; - /* For a PARM_DECL, records the data type used to pass the argument, which may be different from the type seen in the program. */ #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial) @@ -2974,13 +2645,6 @@ #define DECL_INCOMING_RTL(NODE) \ (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl) -struct GTY(()) tree_parm_decl { - struct tree_decl_with_rtl common; - rtx incoming_rtl; - struct var_ann_d *ann; -}; - - /* Nonzero for a given ..._DECL node means that no warnings should be generated just because this node is unused. */ #define DECL_IN_SYSTEM_HEADER(NODE) \ @@ -3032,17 +2696,26 @@ (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag) #define DECL_COMDAT_GROUP(NODE) \ - (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group) + decl_comdat_group (NODE) /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in multiple translation units should be merged. */ -#define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE) +#define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \ + && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE))) /* The name of the object as the assembler will see it (but before any translations made by ASM_OUTPUT_LABELREF). Often this is the same - as DECL_NAME. It is an IDENTIFIER_NODE. */ + as DECL_NAME. It is an IDENTIFIER_NODE. + + ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for + One Definition Rule based type merging at LTO. It is computed only for + LTO compilation and C++. */ #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE) +/* Raw accessor for DECL_ASSEMBLE_NAME. */ +#define DECL_ASSEMBLER_NAME_RAW(NODE) \ + (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name) + /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME. This is true of all DECL nodes except FIELD_DECL. */ #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \ @@ -3052,12 +2725,11 @@ the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set yet. */ #define DECL_ASSEMBLER_NAME_SET_P(NODE) \ - (HAS_DECL_ASSEMBLER_NAME_P (NODE) \ - && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE) + (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE) /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */ #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \ - (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME)) + (DECL_ASSEMBLER_NAME_RAW (NODE) = (NAME)) /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause @@ -3069,15 +2741,11 @@ which will try to set the DECL_ASSEMBLER_NAME for DECL1. */ #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \ - (DECL_ASSEMBLER_NAME_SET_P (DECL1) \ - ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \ - DECL_ASSEMBLER_NAME (DECL1)) \ - : (void) 0) + SET_DECL_ASSEMBLER_NAME (DECL2, DECL_ASSEMBLER_NAME_RAW (DECL1)) /* Records the section name in a section attribute. Used to pass the name from decl_attributes to make_function_rtl and make_decl_rtl. */ -#define DECL_SECTION_NAME(NODE) \ - (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name) +#define DECL_SECTION_NAME(NODE) decl_section_name (NODE) /* Nonzero in a decl means that the gimplifier has seen (or placed) this variable in a BIND_EXPR. */ @@ -3095,12 +2763,12 @@ /* In a VAR_DECL, the model to use if the data should be allocated from thread-local storage. */ -#define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model) +#define DECL_TLS_MODEL(NODE) decl_tls_model (NODE) /* In a VAR_DECL, nonzero if the data should be allocated from thread-local storage. */ #define DECL_THREAD_LOCAL_P(NODE) \ - (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL) + ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL) /* In a non-local VAR_DECL with static storage duration, true if the variable has an initialization priority. If false, the variable @@ -3108,58 +2776,18 @@ #define DECL_HAS_INIT_PRIORITY_P(NODE) \ (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p) -/* Specify whether the section name was set by user or by - compiler via -ffunction-sections. */ -#define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \ - (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p) - -struct GTY(()) tree_decl_with_vis { - struct tree_decl_with_rtl common; - tree assembler_name; - tree section_name; - tree comdat_group; - - /* Belong to VAR_DECL exclusively. */ - unsigned defer_output : 1; - unsigned hard_register : 1; - unsigned thread_local : 1; - unsigned common_flag : 1; - unsigned in_text_section : 1; - unsigned in_constant_pool : 1; - unsigned dllimport_flag : 1; - /* Don't belong to VAR_DECL exclusively. */ - unsigned weak_flag : 1; - - unsigned seen_in_bind_expr : 1; - unsigned comdat_flag : 1; - ENUM_BITFIELD(symbol_visibility) visibility : 2; - unsigned visibility_specified : 1; - /* Belongs to VAR_DECL exclusively. */ - ENUM_BITFIELD(tls_model) tls_model : 3; - - /* Belong to FUNCTION_DECL exclusively. */ - unsigned init_priority_p : 1; - /* Used by C++ only. Might become a generic decl flag. */ - unsigned shadowed_for_var_p : 1; - /* When SECTION_NAME is implied by -ffunsection-section. */ - unsigned implicit_section_name_p : 1; - /* 13 unused bits. */ -}; - extern tree decl_debug_expr_lookup (tree); extern void decl_debug_expr_insert (tree, tree); -/* For VAR_DECL, this is set to either an expression that it was split - from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of - subexpressions that it was split into. */ + +/* For VAR_DECL, this is set to an expression that it was split from. */ +#define DECL_HAS_DEBUG_EXPR_P(NODE) \ + (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from) #define DECL_DEBUG_EXPR(NODE) \ (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE))) #define SET_DECL_DEBUG_EXPR(NODE, VAL) \ (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL)) -/* An initialization priority. */ -typedef unsigned short priority_type; - extern priority_type decl_init_priority_lookup (tree); extern priority_type decl_fini_priority_lookup (tree); extern void decl_init_priority_insert (tree, priority_type); @@ -3191,17 +2819,17 @@ libraries. */ #define MAX_RESERVED_INIT_PRIORITY 100 -#define DECL_VAR_ANN_PTR(NODE) \ - (TREE_CODE (NODE) == VAR_DECL ? &(NODE)->var_decl.ann \ - : TREE_CODE (NODE) == PARM_DECL ? &(NODE)->parm_decl.ann \ - : TREE_CODE (NODE) == RESULT_DECL ? &(NODE)->result_decl.ann \ - : NULL) - -struct GTY(()) tree_var_decl { - struct tree_decl_with_vis common; - struct var_ann_d *ann; -}; - +/* In a VAR_DECL, nonzero if this is a global variable for VOPs. */ +#define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \ + (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag) + +/* In a VAR_DECL, nonzero if this is a non-local frame structure. */ +#define DECL_NONLOCAL_FRAME(NODE) \ + (VAR_DECL_CHECK (NODE)->base.default_def_flag) + +/* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */ +#define DECL_NONALIASED(NODE) \ + (VAR_DECL_CHECK (NODE)->base.nothrow_flag) /* This field is used to reference anything in decl.result and is meant only for use by the garbage collector. */ @@ -3214,23 +2842,9 @@ is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual function. When the class is laid out, this pointer is changed to an INTEGER_CST node which is suitable for use as an index - into the virtual function table. - C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */ + into the virtual function table. */ #define DECL_VINDEX(NODE) \ - (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex) - -struct GTY(()) - tree_decl_non_common { - struct tree_decl_with_vis common; - /* C++ uses this in namespaces. */ - tree saved_tree; - /* C++ uses this in templates. */ - tree arguments; - /* Almost all FE's use this. */ - tree result; - /* C++ uses this in namespaces. */ - tree vindex; -}; + (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex) /* In FUNCTION_DECL, holds the decl for the return value. */ #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result) @@ -3242,7 +2856,7 @@ /* In a FUNCTION_DECL, the saved representation of the body of the entire function. */ #define DECL_SAVED_TREE(NODE) \ - (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree) + (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree) /* Nonzero in a FUNCTION_DECL means this function should be treated as if it were a malloc, meaning it returns a pointer that is @@ -3300,7 +2914,7 @@ /* In a FUNCTION_DECL indicates that a static chain is needed. */ #define DECL_STATIC_CHAIN(NODE) \ - (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag) + (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag) /* Nonzero for a decl that cgraph has decided should be inlined into at least one call site. It is not meaningful to look at this @@ -3319,6 +2933,29 @@ #define DECL_NO_INLINE_WARNING_P(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag) +/* Nonzero if a FUNCTION_CODE is a TM load/store. */ +#define BUILTIN_TM_LOAD_STORE_P(FN) \ + ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE) + +/* Nonzero if a FUNCTION_CODE is a TM load. */ +#define BUILTIN_TM_LOAD_P(FN) \ + ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE) + +/* Nonzero if a FUNCTION_CODE is a TM store. */ +#define BUILTIN_TM_STORE_P(FN) \ + ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE) + +#define CASE_BUILT_IN_TM_LOAD(FN) \ + case BUILT_IN_TM_LOAD_##FN: \ + case BUILT_IN_TM_LOAD_RAR_##FN: \ + case BUILT_IN_TM_LOAD_RAW_##FN: \ + case BUILT_IN_TM_LOAD_RFW_##FN + +#define CASE_BUILT_IN_TM_STORE(FN) \ + case BUILT_IN_TM_STORE_##FN: \ + case BUILT_IN_TM_STORE_WAR_##FN: \ + case BUILT_IN_TM_STORE_WAW_##FN + /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner disregarding size and cost heuristics. This is equivalent to using the always_inline attribute without the required diagnostics if the @@ -3326,25 +2963,34 @@ #define DECL_DISREGARD_INLINE_LIMITS(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits) +extern vec<tree, va_gc> **decl_debug_args_lookup (tree); +extern vec<tree, va_gc> **decl_debug_args_insert (tree); + +/* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */ +#define DECL_HAS_DEBUG_ARGS_P(NODE) \ + (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag) + /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function") that describes the status of this function. */ #define DECL_STRUCT_FUNCTION(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.f) -/* In a FUNCTION_DECL, nonzero means a built in function. */ +/* In a FUNCTION_DECL, nonzero means a built in function of a + standard library or more generally a built in function that is + recognized by optimizers and expanders. + + Note that it is different from the DECL_IS_BUILTIN accessor. For + instance, user declared prototypes of C library functions are not + DECL_IS_BUILTIN but may be DECL_BUILT_IN. */ #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN) /* For a builtin function, identify which part of the compiler defined it. */ #define DECL_BUILT_IN_CLASS(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class) -/* In FUNCTION_DECL, a chain of ..._DECL nodes. - VAR_DECL and PARM_DECL reserve the arguments slot for language-specific - uses. */ +/* In FUNCTION_DECL, a chain of ..._DECL nodes. */ #define DECL_ARGUMENTS(NODE) \ - (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments) -#define DECL_ARGUMENT_FLD(NODE) \ - (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments) + (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments) /* In FUNCTION_DECL, the function specific target options to use when compiling this function. */ @@ -3356,52 +3002,28 @@ #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization) -/* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the - arguments/result/saved_tree fields by front ends. It was either inherit - FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL, - which seemed a bit strange. */ - -struct GTY(()) tree_function_decl { - struct tree_decl_non_common common; - - struct function *f; - - /* The personality function. Used for stack unwinding. */ - tree personality; - - /* Function specific options that are used by this function. */ - tree function_specific_target; /* target options */ - tree function_specific_optimization; /* optimization options */ - - /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is - DECL_FUNCTION_CODE. Otherwise unused. - ??? The bitfield needs to be able to hold all target function - codes as well. */ - ENUM_BITFIELD(built_in_function) function_code : 11; - ENUM_BITFIELD(built_in_class) built_in_class : 2; - - unsigned static_ctor_flag : 1; - unsigned static_dtor_flag : 1; - unsigned uninlinable : 1; - - unsigned possibly_inlined : 1; - unsigned novops_flag : 1; - unsigned returns_twice_flag : 1; - unsigned malloc_flag : 1; - unsigned operator_new_flag : 1; - unsigned declared_inline_flag : 1; - unsigned regdecl_flag : 1; - - unsigned no_inline_warning_flag : 1; - unsigned no_instrument_function_entry_exit : 1; - unsigned no_limit_stack : 1; - unsigned disregard_inline_limits : 1; - unsigned pure_flag : 1; - unsigned looping_const_or_pure_flag : 1; - - - /* 3 bits left */ -}; +/* In FUNCTION_DECL, this is set if this function has other versions generated + using "target" attributes. The default version is the one which does not + have any "target" attribute set. */ +#define DECL_FUNCTION_VERSIONED(NODE)\ + (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function) + +/* In FUNCTION_DECL, this is set if this function is a C++ constructor. + Devirtualization machinery uses this knowledge for determing type of the + object constructed. Also we assume that constructor address is not + important. */ +#define DECL_CXX_CONSTRUCTOR_P(NODE)\ + (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor) + +/* In FUNCTION_DECL, this is set if this function is a C++ destructor. + Devirtualization machinery uses this to track types in destruction. */ +#define DECL_CXX_DESTRUCTOR_P(NODE)\ + (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor) + +/* In FUNCTION_DECL that represent an virtual method this is set when + the method is final. */ +#define DECL_FINAL_P(NODE)\ + (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final) /* The source language of the translation-unit. */ #define TRANSLATION_UNIT_LANGUAGE(NODE) \ @@ -3409,17 +3031,6 @@ /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */ -struct GTY(()) tree_translation_unit_decl { - struct tree_decl_common common; - /* Source language of this translation unit. Used for DWARF output. */ - const char * GTY((skip(""))) language; - /* TODO: Non-optimization used to build this translation unit. */ - /* TODO: Root of a partial DWARF tree for global types and decls. */ -}; - -/* A vector of all translation-units. */ -extern GTY (()) VEC(tree,gc) *all_translation_units; - /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ #define DECL_ORIGINAL_TYPE(NODE) \ (TYPE_DECL_CHECK (NODE)->decl_non_common.result) @@ -3435,11 +3046,11 @@ #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \ (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE))) -struct GTY(()) tree_type_decl { - struct tree_decl_non_common common; - -}; - +/* Getter of the symbol declaration associated with the + NAMELIST_DECL node. */ +#define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \ + (DECL_INITIAL (NODE)) + /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE. To reduce overhead, the nodes containing the statements are not trees. This avoids the overhead of tree_common on all linked list elements. @@ -3451,253 +3062,586 @@ #define STATEMENT_LIST_TAIL(NODE) \ (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail) -struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node - { - struct tree_statement_list_node *prev; - struct tree_statement_list_node *next; - tree stmt; -}; - -struct GTY(()) tree_statement_list - { - struct tree_common common; - struct tree_statement_list_node *head; - struct tree_statement_list_node *tail; -}; - - -/* Optimization options used by a function. */ - -struct GTY(()) tree_optimization_option { - struct tree_common common; - - /* The optimization options used by the user. */ - struct cl_optimization opts; -}; - #define TREE_OPTIMIZATION(NODE) \ - (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts) - -/* Return a tree node that encapsulates the current optimization options. */ -extern tree build_optimization_node (void); - -/* Target options used by a function. */ - -struct GTY(()) tree_target_option { - struct tree_common common; - - /* The optimization options used by the user. */ - struct cl_target_option opts; -}; + (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts) + +#define TREE_OPTIMIZATION_OPTABS(NODE) \ + (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs) + +#define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \ + (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs) + +/* Return a tree node that encapsulates the optimization options in OPTS. */ +extern tree build_optimization_node (struct gcc_options *opts); #define TREE_TARGET_OPTION(NODE) \ - (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts) - -/* Return a tree node that encapsulates the current target options. */ -extern tree build_target_option_node (void); - - -/* Define the overall contents of a tree node. - It may be any of the structures declared above - for various types of node. */ - -union GTY ((ptr_alias (union lang_tree_node), - desc ("tree_node_structure (&%h)"), variable_size)) tree_node { - struct tree_base GTY ((tag ("TS_BASE"))) base; - struct tree_common GTY ((tag ("TS_COMMON"))) common; - struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst; - struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst; - struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst; - struct tree_vector GTY ((tag ("TS_VECTOR"))) vector; - struct tree_string GTY ((tag ("TS_STRING"))) string; - struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex; - struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier; - struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal; - struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common; - struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl; - struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common; - struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl; - struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis; - struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl; - struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl; - struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl; - struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl; - struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl; - struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl; - struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl; - struct tree_translation_unit_decl GTY ((tag ("TS_TRANSLATION_UNIT_DECL"))) - translation_unit_decl; - struct tree_type GTY ((tag ("TS_TYPE"))) type; - struct tree_list GTY ((tag ("TS_LIST"))) list; - struct tree_vec GTY ((tag ("TS_VEC"))) vec; - struct tree_exp GTY ((tag ("TS_EXP"))) exp; - struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name; - struct tree_block GTY ((tag ("TS_BLOCK"))) block; - struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo; - struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list; - struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor; - struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause; - struct tree_optimization_option GTY ((tag ("TS_OPTIMIZATION"))) optimization; - struct tree_target_option GTY ((tag ("TS_TARGET_OPTION"))) target_option; -}; - -/* Standard named or nameless data types of the C compiler. */ - -enum tree_index + (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts) + +#define TREE_TARGET_GLOBALS(NODE) \ + (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals) + +/* Return a tree node that encapsulates the target options in OPTS. */ +extern tree build_target_option_node (struct gcc_options *opts); + +extern void prepare_target_option_nodes_for_pch (void); + +#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) + +inline tree +tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c) +{ + if (TREE_CODE (__t) != __c) + tree_check_failed (__t, __f, __l, __g, __c, 0); + return __t; +} + +inline tree +tree_not_check (tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c) +{ + if (TREE_CODE (__t) == __c) + tree_not_check_failed (__t, __f, __l, __g, __c, 0); + return __t; +} + +inline tree +tree_check2 (tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2) +{ + if (TREE_CODE (__t) != __c1 + && TREE_CODE (__t) != __c2) + tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0); + return __t; +} + +inline tree +tree_not_check2 (tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2) +{ + if (TREE_CODE (__t) == __c1 + || TREE_CODE (__t) == __c2) + tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0); + return __t; +} + +inline tree +tree_check3 (tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) +{ + if (TREE_CODE (__t) != __c1 + && TREE_CODE (__t) != __c2 + && TREE_CODE (__t) != __c3) + tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); + return __t; +} + +inline tree +tree_not_check3 (tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) +{ + if (TREE_CODE (__t) == __c1 + || TREE_CODE (__t) == __c2 + || TREE_CODE (__t) == __c3) + tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); + return __t; +} + +inline tree +tree_check4 (tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, + enum tree_code __c4) +{ + if (TREE_CODE (__t) != __c1 + && TREE_CODE (__t) != __c2 + && TREE_CODE (__t) != __c3 + && TREE_CODE (__t) != __c4) + tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); + return __t; +} + +inline tree +tree_not_check4 (tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, + enum tree_code __c4) +{ + if (TREE_CODE (__t) == __c1 + || TREE_CODE (__t) == __c2 + || TREE_CODE (__t) == __c3 + || TREE_CODE (__t) == __c4) + tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); + return __t; +} + +inline tree +tree_check5 (tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, + enum tree_code __c4, enum tree_code __c5) +{ + if (TREE_CODE (__t) != __c1 + && TREE_CODE (__t) != __c2 + && TREE_CODE (__t) != __c3 + && TREE_CODE (__t) != __c4 + && TREE_CODE (__t) != __c5) + tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); + return __t; +} + +inline tree +tree_not_check5 (tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, + enum tree_code __c4, enum tree_code __c5) +{ + if (TREE_CODE (__t) == __c1 + || TREE_CODE (__t) == __c2 + || TREE_CODE (__t) == __c3 + || TREE_CODE (__t) == __c4 + || TREE_CODE (__t) == __c5) + tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); + return __t; +} + +inline tree +contains_struct_check (tree __t, const enum tree_node_structure_enum __s, + const char *__f, int __l, const char *__g) +{ + if (tree_contains_struct[TREE_CODE (__t)][__s] != 1) + tree_contains_struct_check_failed (__t, __s, __f, __l, __g); + return __t; +} + +inline tree +tree_class_check (tree __t, const enum tree_code_class __class, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class) + tree_class_check_failed (__t, __class, __f, __l, __g); + return __t; +} + +inline tree +tree_range_check (tree __t, + enum tree_code __code1, enum tree_code __code2, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2) + tree_range_check_failed (__t, __f, __l, __g, __code1, __code2); + return __t; +} + +inline tree +omp_clause_subcode_check (tree __t, enum omp_clause_code __code, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) != OMP_CLAUSE) + tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); + if (__t->omp_clause.code != __code) + omp_clause_check_failed (__t, __f, __l, __g, __code); + return __t; +} + +inline tree +omp_clause_range_check (tree __t, + enum omp_clause_code __code1, + enum omp_clause_code __code2, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) != OMP_CLAUSE) + tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); + if ((int) __t->omp_clause.code < (int) __code1 + || (int) __t->omp_clause.code > (int) __code2) + omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2); + return __t; +} + +/* These checks have to be special cased. */ + +inline tree +expr_check (tree __t, const char *__f, int __l, const char *__g) +{ + char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); + if (!IS_EXPR_CODE_CLASS (__c)) + tree_class_check_failed (__t, tcc_expression, __f, __l, __g); + return __t; +} + +/* These checks have to be special cased. */ + +inline tree +non_type_check (tree __t, const char *__f, int __l, const char *__g) +{ + if (TYPE_P (__t)) + tree_not_class_check_failed (__t, tcc_type, __f, __l, __g); + return __t; +} + +inline const HOST_WIDE_INT * +tree_int_cst_elt_check (const_tree __t, int __i, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) != INTEGER_CST) + tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0); + if (__i < 0 || __i >= __t->base.u.int_length.extended) + tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended, + __f, __l, __g); + return &CONST_CAST_TREE (__t)->int_cst.val[__i]; +} + +inline HOST_WIDE_INT * +tree_int_cst_elt_check (tree __t, int __i, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) != INTEGER_CST) + tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0); + if (__i < 0 || __i >= __t->base.u.int_length.extended) + tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended, + __f, __l, __g); + return &CONST_CAST_TREE (__t)->int_cst.val[__i]; +} + +/* Workaround -Wstrict-overflow false positive during profiledbootstrap. */ + +# if GCC_VERSION >= 4006 +#pragma GCC diagnostic push +#pragma GCC diagnostic ignored "-Wstrict-overflow" +#endif + +inline tree * +tree_vec_elt_check (tree __t, int __i, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) != TREE_VEC) + tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0); + if (__i < 0 || __i >= __t->base.u.length) + tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g); + return &CONST_CAST_TREE (__t)->vec.a[__i]; +} + +# if GCC_VERSION >= 4006 +#pragma GCC diagnostic pop +#endif + +inline tree * +omp_clause_elt_check (tree __t, int __i, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) != OMP_CLAUSE) + tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); + if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) + omp_clause_operand_check_failed (__i, __t, __f, __l, __g); + return &__t->omp_clause.ops[__i]; +} + +/* These checks have to be special cased. */ + +inline tree +any_integral_type_check (tree __t, const char *__f, int __l, const char *__g) +{ + if (!ANY_INTEGRAL_TYPE_P (__t)) + tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE, + INTEGER_TYPE, 0); + return __t; +} + +inline const_tree +tree_check (const_tree __t, const char *__f, int __l, const char *__g, + tree_code __c) +{ + if (TREE_CODE (__t) != __c) + tree_check_failed (__t, __f, __l, __g, __c, 0); + return __t; +} + +inline const_tree +tree_not_check (const_tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c) { - TI_ERROR_MARK, - TI_INTQI_TYPE, - TI_INTHI_TYPE, - TI_INTSI_TYPE, - TI_INTDI_TYPE, - TI_INTTI_TYPE, - - TI_UINTQI_TYPE, - TI_UINTHI_TYPE, - TI_UINTSI_TYPE, - TI_UINTDI_TYPE, - TI_UINTTI_TYPE, - - TI_UINT32_TYPE, - TI_UINT64_TYPE, - - TI_INTEGER_ZERO, - TI_INTEGER_ONE, - TI_INTEGER_THREE, - TI_INTEGER_MINUS_ONE, - TI_NULL_POINTER, - - TI_SIZE_ZERO, - TI_SIZE_ONE, - - TI_BITSIZE_ZERO, - TI_BITSIZE_ONE, - TI_BITSIZE_UNIT, - - TI_PUBLIC, - TI_PROTECTED, - TI_PRIVATE, - - TI_BOOLEAN_FALSE, - TI_BOOLEAN_TRUE, - - TI_COMPLEX_INTEGER_TYPE, - TI_COMPLEX_FLOAT_TYPE, - TI_COMPLEX_DOUBLE_TYPE, - TI_COMPLEX_LONG_DOUBLE_TYPE, - - TI_FLOAT_TYPE, - TI_DOUBLE_TYPE, - TI_LONG_DOUBLE_TYPE, - - TI_FLOAT_PTR_TYPE, - TI_DOUBLE_PTR_TYPE, - TI_LONG_DOUBLE_PTR_TYPE, - TI_INTEGER_PTR_TYPE, - - TI_VOID_TYPE, - TI_PTR_TYPE, - TI_CONST_PTR_TYPE, - TI_SIZE_TYPE, - TI_PID_TYPE, - TI_PTRDIFF_TYPE, - TI_VA_LIST_TYPE, - TI_VA_LIST_GPR_COUNTER_FIELD, - TI_VA_LIST_FPR_COUNTER_FIELD, - TI_BOOLEAN_TYPE, - TI_FILEPTR_TYPE, - - TI_DFLOAT32_TYPE, - TI_DFLOAT64_TYPE, - TI_DFLOAT128_TYPE, - TI_DFLOAT32_PTR_TYPE, - TI_DFLOAT64_PTR_TYPE, - TI_DFLOAT128_PTR_TYPE, - - TI_VOID_LIST_NODE, - - TI_MAIN_IDENTIFIER, - - TI_SAT_SFRACT_TYPE, - TI_SAT_FRACT_TYPE, - TI_SAT_LFRACT_TYPE, - TI_SAT_LLFRACT_TYPE, - TI_SAT_USFRACT_TYPE, - TI_SAT_UFRACT_TYPE, - TI_SAT_ULFRACT_TYPE, - TI_SAT_ULLFRACT_TYPE, - TI_SFRACT_TYPE, - TI_FRACT_TYPE, - TI_LFRACT_TYPE, - TI_LLFRACT_TYPE, - TI_USFRACT_TYPE, - TI_UFRACT_TYPE, - TI_ULFRACT_TYPE, - TI_ULLFRACT_TYPE, - TI_SAT_SACCUM_TYPE, - TI_SAT_ACCUM_TYPE, - TI_SAT_LACCUM_TYPE, - TI_SAT_LLACCUM_TYPE, - TI_SAT_USACCUM_TYPE, - TI_SAT_UACCUM_TYPE, - TI_SAT_ULACCUM_TYPE, - TI_SAT_ULLACCUM_TYPE, - TI_SACCUM_TYPE, - TI_ACCUM_TYPE, - TI_LACCUM_TYPE, - TI_LLACCUM_TYPE, - TI_USACCUM_TYPE, - TI_UACCUM_TYPE, - TI_ULACCUM_TYPE, - TI_ULLACCUM_TYPE, - TI_QQ_TYPE, - TI_HQ_TYPE, - TI_SQ_TYPE, - TI_DQ_TYPE, - TI_TQ_TYPE, - TI_UQQ_TYPE, - TI_UHQ_TYPE, - TI_USQ_TYPE, - TI_UDQ_TYPE, - TI_UTQ_TYPE, - TI_SAT_QQ_TYPE, - TI_SAT_HQ_TYPE, - TI_SAT_SQ_TYPE, - TI_SAT_DQ_TYPE, - TI_SAT_TQ_TYPE, - TI_SAT_UQQ_TYPE, - TI_SAT_UHQ_TYPE, - TI_SAT_USQ_TYPE, - TI_SAT_UDQ_TYPE, - TI_SAT_UTQ_TYPE, - TI_HA_TYPE, - TI_SA_TYPE, - TI_DA_TYPE, - TI_TA_TYPE, - TI_UHA_TYPE, - TI_USA_TYPE, - TI_UDA_TYPE, - TI_UTA_TYPE, - TI_SAT_HA_TYPE, - TI_SAT_SA_TYPE, - TI_SAT_DA_TYPE, - TI_SAT_TA_TYPE, - TI_SAT_UHA_TYPE, - TI_SAT_USA_TYPE, - TI_SAT_UDA_TYPE, - TI_SAT_UTA_TYPE, - - TI_OPTIMIZATION_DEFAULT, - TI_OPTIMIZATION_CURRENT, - TI_TARGET_OPTION_DEFAULT, - TI_TARGET_OPTION_CURRENT, - TI_CURRENT_TARGET_PRAGMA, - TI_CURRENT_OPTIMIZE_PRAGMA, - - TI_MAX -}; - -extern GTY(()) tree global_trees[TI_MAX]; + if (TREE_CODE (__t) == __c) + tree_not_check_failed (__t, __f, __l, __g, __c, 0); + return __t; +} + +inline const_tree +tree_check2 (const_tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2) +{ + if (TREE_CODE (__t) != __c1 + && TREE_CODE (__t) != __c2) + tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0); + return __t; +} + +inline const_tree +tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2) +{ + if (TREE_CODE (__t) == __c1 + || TREE_CODE (__t) == __c2) + tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0); + return __t; +} + +inline const_tree +tree_check3 (const_tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) +{ + if (TREE_CODE (__t) != __c1 + && TREE_CODE (__t) != __c2 + && TREE_CODE (__t) != __c3) + tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); + return __t; +} + +inline const_tree +tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) +{ + if (TREE_CODE (__t) == __c1 + || TREE_CODE (__t) == __c2 + || TREE_CODE (__t) == __c3) + tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); + return __t; +} + +inline const_tree +tree_check4 (const_tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, + enum tree_code __c4) +{ + if (TREE_CODE (__t) != __c1 + && TREE_CODE (__t) != __c2 + && TREE_CODE (__t) != __c3 + && TREE_CODE (__t) != __c4) + tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); + return __t; +} + +inline const_tree +tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, + enum tree_code __c4) +{ + if (TREE_CODE (__t) == __c1 + || TREE_CODE (__t) == __c2 + || TREE_CODE (__t) == __c3 + || TREE_CODE (__t) == __c4) + tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); + return __t; +} + +inline const_tree +tree_check5 (const_tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, + enum tree_code __c4, enum tree_code __c5) +{ + if (TREE_CODE (__t) != __c1 + && TREE_CODE (__t) != __c2 + && TREE_CODE (__t) != __c3 + && TREE_CODE (__t) != __c4 + && TREE_CODE (__t) != __c5) + tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); + return __t; +} + +inline const_tree +tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g, + enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, + enum tree_code __c4, enum tree_code __c5) +{ + if (TREE_CODE (__t) == __c1 + || TREE_CODE (__t) == __c2 + || TREE_CODE (__t) == __c3 + || TREE_CODE (__t) == __c4 + || TREE_CODE (__t) == __c5) + tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); + return __t; +} + +inline const_tree +contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s, + const char *__f, int __l, const char *__g) +{ + if (tree_contains_struct[TREE_CODE (__t)][__s] != 1) + tree_contains_struct_check_failed (__t, __s, __f, __l, __g); + return __t; +} + +inline const_tree +tree_class_check (const_tree __t, const enum tree_code_class __class, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class) + tree_class_check_failed (__t, __class, __f, __l, __g); + return __t; +} + +inline const_tree +tree_range_check (const_tree __t, + enum tree_code __code1, enum tree_code __code2, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2) + tree_range_check_failed (__t, __f, __l, __g, __code1, __code2); + return __t; +} + +inline const_tree +omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) != OMP_CLAUSE) + tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); + if (__t->omp_clause.code != __code) + omp_clause_check_failed (__t, __f, __l, __g, __code); + return __t; +} + +inline const_tree +omp_clause_range_check (const_tree __t, + enum omp_clause_code __code1, + enum omp_clause_code __code2, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) != OMP_CLAUSE) + tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); + if ((int) __t->omp_clause.code < (int) __code1 + || (int) __t->omp_clause.code > (int) __code2) + omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2); + return __t; +} + +inline const_tree +expr_check (const_tree __t, const char *__f, int __l, const char *__g) +{ + char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); + if (!IS_EXPR_CODE_CLASS (__c)) + tree_class_check_failed (__t, tcc_expression, __f, __l, __g); + return __t; +} + +inline const_tree +non_type_check (const_tree __t, const char *__f, int __l, const char *__g) +{ + if (TYPE_P (__t)) + tree_not_class_check_failed (__t, tcc_type, __f, __l, __g); + return __t; +} + +# if GCC_VERSION >= 4006 +#pragma GCC diagnostic push +#pragma GCC diagnostic ignored "-Wstrict-overflow" +#endif + +inline const_tree * +tree_vec_elt_check (const_tree __t, int __i, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) != TREE_VEC) + tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0); + if (__i < 0 || __i >= __t->base.u.length) + tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g); + return CONST_CAST (const_tree *, &__t->vec.a[__i]); + //return &__t->vec.a[__i]; +} + +# if GCC_VERSION >= 4006 +#pragma GCC diagnostic pop +#endif + +inline const_tree * +omp_clause_elt_check (const_tree __t, int __i, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) != OMP_CLAUSE) + tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); + if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) + omp_clause_operand_check_failed (__i, __t, __f, __l, __g); + return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]); +} + +inline const_tree +any_integral_type_check (const_tree __t, const char *__f, int __l, + const char *__g) +{ + if (!ANY_INTEGRAL_TYPE_P (__t)) + tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE, + INTEGER_TYPE, 0); + return __t; +} + +#endif + +/* Compute the number of operands in an expression node NODE. For + tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself, + otherwise it is looked up from the node's code. */ +static inline int +tree_operand_length (const_tree node) +{ + if (VL_EXP_CLASS_P (node)) + return VL_EXP_OPERAND_LENGTH (node); + else + return TREE_CODE_LENGTH (TREE_CODE (node)); +} + +#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) + +/* Special checks for TREE_OPERANDs. */ +inline tree * +tree_operand_check (tree __t, int __i, + const char *__f, int __l, const char *__g) +{ + const_tree __u = EXPR_CHECK (__t); + if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u)) + tree_operand_check_failed (__i, __u, __f, __l, __g); + return &CONST_CAST_TREE (__u)->exp.operands[__i]; +} + +inline tree * +tree_operand_check_code (tree __t, enum tree_code __code, int __i, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) != __code) + tree_check_failed (__t, __f, __l, __g, __code, 0); + if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) + tree_operand_check_failed (__i, __t, __f, __l, __g); + return &__t->exp.operands[__i]; +} + +inline const_tree * +tree_operand_check (const_tree __t, int __i, + const char *__f, int __l, const char *__g) +{ + const_tree __u = EXPR_CHECK (__t); + if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u)) + tree_operand_check_failed (__i, __u, __f, __l, __g); + return CONST_CAST (const_tree *, &__u->exp.operands[__i]); +} + +inline const_tree * +tree_operand_check_code (const_tree __t, enum tree_code __code, int __i, + const char *__f, int __l, const char *__g) +{ + if (TREE_CODE (__t) != __code) + tree_check_failed (__t, __f, __l, __g, __code, 0); + if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) + tree_operand_check_failed (__i, __t, __f, __l, __g); + return CONST_CAST (const_tree *, &__t->exp.operands[__i]); +} + +#endif + +/* True iff an identifier matches a C string. */ + +inline bool +id_equal (const_tree id, const char *str) +{ + return !strcmp (IDENTIFIER_POINTER (id), str); +} + +inline bool +id_equal (const char *str, const_tree id) +{ + return !strcmp (str, IDENTIFIER_POINTER (id)); +} #define error_mark_node global_trees[TI_ERROR_MARK] @@ -3713,9 +3657,18 @@ #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE] #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE] +#define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE] +#define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE] +#define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE] +#define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE] +#define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE] + +#define uint16_type_node global_trees[TI_UINT16_TYPE] #define uint32_type_node global_trees[TI_UINT32_TYPE] #define uint64_type_node global_trees[TI_UINT64_TYPE] +#define void_node global_trees[TI_VOID] + #define integer_zero_node global_trees[TI_INTEGER_ZERO] #define integer_one_node global_trees[TI_INTEGER_ONE] #define integer_three_node global_trees[TI_INTEGER_THREE] @@ -3737,6 +3690,22 @@ #define double_type_node global_trees[TI_DOUBLE_TYPE] #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE] +/* Nodes for particular _FloatN and _FloatNx types in sequence. */ +#define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)] +#define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)] +#define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)] + +/* Names for individual types (code should normally iterate over all + such types; these are only for back-end use, or in contexts such as + *.def where iteration is not possible). */ +#define float16_type_node global_trees[TI_FLOAT16_TYPE] +#define float32_type_node global_trees[TI_FLOAT32_TYPE] +#define float64_type_node global_trees[TI_FLOAT64_TYPE] +#define float128_type_node global_trees[TI_FLOAT128_TYPE] +#define float32x_type_node global_trees[TI_FLOAT32X_TYPE] +#define float64x_type_node global_trees[TI_FLOAT64X_TYPE] +#define float128x_type_node global_trees[TI_FLOAT128X_TYPE] + #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE] #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE] #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE] @@ -3747,6 +3716,10 @@ #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE] #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE] +#define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)] + +#define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE] + #define void_type_node global_trees[TI_VOID_TYPE] /* The C type `void *'. */ #define ptr_type_node global_trees[TI_PTR_TYPE] @@ -3761,6 +3734,15 @@ #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD] /* The C type `FILE *'. */ #define fileptr_type_node global_trees[TI_FILEPTR_TYPE] +/* The C type `const struct tm *'. */ +#define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE] +/* The C type `fenv_t *'. */ +#define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE] +#define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE] +/* The C type `fexcept_t *'. */ +#define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE] +#define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE] +#define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE] #define boolean_type_node global_trees[TI_BOOLEAN_TYPE] #define boolean_false_node global_trees[TI_BOOLEAN_FALSE] @@ -3877,34 +3859,6 @@ #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA] #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA] -/* An enumeration of the standard C integer types. These must be - ordered so that shorter types appear before longer ones, and so - that signed types appear before unsigned ones, for the correct - functioning of interpret_integer() in c-lex.c. */ -enum integer_type_kind -{ - itk_char, - itk_signed_char, - itk_unsigned_char, - itk_short, - itk_unsigned_short, - itk_int, - itk_unsigned_int, - itk_long, - itk_unsigned_long, - itk_long_long, - itk_unsigned_long_long, - itk_int128, - itk_unsigned_int128, - itk_none -}; - -typedef enum integer_type_kind integer_type_kind; - -/* The standard C integer types. Use integer_type_kind to index into - this array. */ -extern GTY(()) tree integer_types[itk_none]; - #define char_type_node integer_types[itk_char] #define signed_char_type_node integer_types[itk_signed_char] #define unsigned_char_type_node integer_types[itk_unsigned_char] @@ -3916,478 +3870,286 @@ #define long_unsigned_type_node integer_types[itk_unsigned_long] #define long_long_integer_type_node integer_types[itk_long_long] #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long] -#define int128_integer_type_node integer_types[itk_int128] -#define int128_unsigned_type_node integer_types[itk_unsigned_int128] - -/* A pointer-to-function member type looks like: - - struct { - __P __pfn; - ptrdiff_t __delta; - }; - - If __pfn is NULL, it is a NULL pointer-to-member-function. - - (Because the vtable is always the first thing in the object, we - don't need its offset.) If the function is virtual, then PFN is - one plus twice the index into the vtable; otherwise, it is just a - pointer to the function. - - Unfortunately, using the lowest bit of PFN doesn't work in - architectures that don't impose alignment requirements on function - addresses, or that use the lowest bit to tell one ISA from another, - for example. For such architectures, we use the lowest bit of - DELTA instead of the lowest bit of the PFN, and DELTA will be - multiplied by 2. */ - -enum ptrmemfunc_vbit_where_t -{ - ptrmemfunc_vbit_in_pfn, - ptrmemfunc_vbit_in_delta -}; - -#define NULL_TREE (tree) NULL + +/* True if NODE is an erroneous expression. */ + +#define error_operand_p(NODE) \ + ((NODE) == error_mark_node \ + || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node)) extern tree decl_assembler_name (tree); -extern bool decl_assembler_name_equal (tree decl, const_tree asmname); -extern hashval_t decl_assembler_name_hash (const_tree asmname); +extern tree decl_comdat_group (const_tree); +extern tree decl_comdat_group_id (const_tree); +extern const char *decl_section_name (const_tree); +extern void set_decl_section_name (tree, const char *); +extern enum tls_model decl_tls_model (const_tree); +extern void set_decl_tls_model (tree, enum tls_model); /* Compute the number of bytes occupied by 'node'. This routine only looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */ extern size_t tree_size (const_tree); -/* Compute the number of bytes occupied by a tree with code CODE. This - function cannot be used for TREE_VEC codes, which are of variable - length. */ +/* Compute the number of bytes occupied by a tree with code CODE. + This function cannot be used for TREE_VEC or INTEGER_CST nodes, + which are of variable length. */ extern size_t tree_code_size (enum tree_code); +/* Allocate and return a new UID from the DECL_UID namespace. */ +extern int allocate_decl_uid (void); + /* Lowest level primitive for allocating a node. The TREE_CODE is the only argument. Contents are initialized to zero except for a few of the common fields. */ -extern tree make_node_stat (enum tree_code MEM_STAT_DECL); -#define make_node(t) make_node_stat (t MEM_STAT_INFO) +extern tree make_node (enum tree_code CXX_MEM_STAT_INFO); + +/* Free tree node. */ + +extern void free_node (tree); /* Make a copy of a node, with all the same contents. */ -extern tree copy_node_stat (tree MEM_STAT_DECL); -#define copy_node(t) copy_node_stat (t MEM_STAT_INFO) +extern tree copy_node (tree CXX_MEM_STAT_INFO); /* Make a copy of a chain of TREE_LIST nodes. */ extern tree copy_list (tree); +/* Make a CASE_LABEL_EXPR. */ + +extern tree build_case_label (tree, tree, tree); + /* Make a BINFO. */ -extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL); -#define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO) +extern tree make_tree_binfo (unsigned CXX_MEM_STAT_INFO); + +/* Make an INTEGER_CST. */ + +extern tree make_int_cst (int, int CXX_MEM_STAT_INFO); /* Make a TREE_VEC. */ -extern tree make_tree_vec_stat (int MEM_STAT_DECL); -#define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO) - -/* Return the (unique) IDENTIFIER_NODE node for a given name. - The name is supplied as a char *. */ - -extern tree get_identifier (const char *); - -#if GCC_VERSION >= 3000 -#define get_identifier(str) \ - (__builtin_constant_p (str) \ - ? get_identifier_with_length ((str), strlen (str)) \ - : get_identifier (str)) -#endif - - -/* Identical to get_identifier, except that the length is assumed - known. */ - -extern tree get_identifier_with_length (const char *, size_t); - -/* If an identifier with the name TEXT (a null-terminated string) has - previously been referred to, return that node; otherwise return - NULL_TREE. */ - -extern tree maybe_get_identifier (const char *); +extern tree make_tree_vec (int CXX_MEM_STAT_INFO); + +/* Grow a TREE_VEC. */ + +extern tree grow_tree_vec (tree v, int CXX_MEM_STAT_INFO); /* Construct various types of nodes. */ extern tree build_nt (enum tree_code, ...); -extern tree build_nt_call_vec (tree, VEC(tree,gc) *); - -extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL); -#define build0(c,t) build0_stat (c,t MEM_STAT_INFO) -extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL); -#define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO) -extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL); -#define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO) -extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL); -#define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO) -extern tree build4_stat (enum tree_code, tree, tree, tree, tree, - tree MEM_STAT_DECL); -#define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO) -extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree, - tree MEM_STAT_DECL); -#define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO) -extern tree build6_stat (enum tree_code, tree, tree, tree, tree, tree, - tree, tree MEM_STAT_DECL); -#define build6(c,t1,t2,t3,t4,t5,t6,t7) \ - build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO) - -/* _loc versions of build[1-6]. */ +extern tree build_nt_call_vec (tree, vec<tree, va_gc> *); + +extern tree build0 (enum tree_code, tree CXX_MEM_STAT_INFO); +extern tree build1 (enum tree_code, tree, tree CXX_MEM_STAT_INFO); +extern tree build2 (enum tree_code, tree, tree, tree CXX_MEM_STAT_INFO); +extern tree build3 (enum tree_code, tree, tree, tree, tree CXX_MEM_STAT_INFO); +extern tree build4 (enum tree_code, tree, tree, tree, tree, + tree CXX_MEM_STAT_INFO); +extern tree build5 (enum tree_code, tree, tree, tree, tree, tree, + tree CXX_MEM_STAT_INFO); + +/* _loc versions of build[1-5]. */ static inline tree -build1_stat_loc (location_t loc, enum tree_code code, tree type, - tree arg1 MEM_STAT_DECL) +build1_loc (location_t loc, enum tree_code code, tree type, + tree arg1 CXX_MEM_STAT_INFO) { - tree t = build1_stat (code, type, arg1 PASS_MEM_STAT); + tree t = build1 (code, type, arg1 PASS_MEM_STAT); if (CAN_HAVE_LOCATION_P (t)) SET_EXPR_LOCATION (t, loc); return t; } -#define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO) static inline tree -build2_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, - tree arg1 MEM_STAT_DECL) +build2_loc (location_t loc, enum tree_code code, tree type, tree arg0, + tree arg1 CXX_MEM_STAT_INFO) { - tree t = build2_stat (code, type, arg0, arg1 PASS_MEM_STAT); + tree t = build2 (code, type, arg0, arg1 PASS_MEM_STAT); if (CAN_HAVE_LOCATION_P (t)) SET_EXPR_LOCATION (t, loc); return t; } -#define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO) static inline tree -build3_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, - tree arg1, tree arg2 MEM_STAT_DECL) +build3_loc (location_t loc, enum tree_code code, tree type, tree arg0, + tree arg1, tree arg2 CXX_MEM_STAT_INFO) { - tree t = build3_stat (code, type, arg0, arg1, arg2 PASS_MEM_STAT); + tree t = build3 (code, type, arg0, arg1, arg2 PASS_MEM_STAT); if (CAN_HAVE_LOCATION_P (t)) SET_EXPR_LOCATION (t, loc); return t; } -#define build3_loc(l,c,t1,t2,t3,t4) \ - build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO) static inline tree -build4_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, - tree arg1, tree arg2, tree arg3 MEM_STAT_DECL) +build4_loc (location_t loc, enum tree_code code, tree type, tree arg0, + tree arg1, tree arg2, tree arg3 CXX_MEM_STAT_INFO) { - tree t = build4_stat (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT); + tree t = build4 (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT); if (CAN_HAVE_LOCATION_P (t)) SET_EXPR_LOCATION (t, loc); return t; } -#define build4_loc(l,c,t1,t2,t3,t4,t5) \ - build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO) static inline tree -build5_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, - tree arg1, tree arg2, tree arg3, tree arg4 MEM_STAT_DECL) +build5_loc (location_t loc, enum tree_code code, tree type, tree arg0, + tree arg1, tree arg2, tree arg3, tree arg4 CXX_MEM_STAT_INFO) { - tree t = build5_stat (code, type, arg0, arg1, arg2, arg3, + tree t = build5 (code, type, arg0, arg1, arg2, arg3, arg4 PASS_MEM_STAT); if (CAN_HAVE_LOCATION_P (t)) SET_EXPR_LOCATION (t, loc); return t; } -#define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \ - build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO) - -static inline tree -build6_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, - tree arg1, tree arg2, tree arg3, tree arg4, - tree arg5 MEM_STAT_DECL) -{ - tree t = build6_stat (code, type, arg0, arg1, arg2, arg3, arg4, - arg5 PASS_MEM_STAT); - if (CAN_HAVE_LOCATION_P (t)) - SET_EXPR_LOCATION (t, loc); - return t; -} -#define build6_loc(l,c,t1,t2,t3,t4,t5,t6,t7) \ - build6_stat_loc (l,c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO) - -extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL); -#define build_var_debug_value(t1,t2) \ - build_var_debug_value_stat (t1,t2 MEM_STAT_INFO) /* Constructs double_int from tree CST. */ -static inline double_int -tree_to_double_int (const_tree cst) -{ - return TREE_INT_CST (cst); -} - extern tree double_int_to_tree (tree, double_int); -extern bool double_int_fits_to_tree_p (const_tree, double_int); -extern tree force_fit_type_double (tree, double_int, int, bool); + +extern tree wide_int_to_tree (tree type, const wide_int_ref &cst); +extern tree force_fit_type (tree, const wide_int_ref &, int, bool); /* Create an INT_CST node with a CST value zero extended. */ -static inline tree -build_int_cstu (tree type, unsigned HOST_WIDE_INT cst) -{ - return double_int_to_tree (type, uhwi_to_double_int (cst)); -} - +/* static inline */ extern tree build_int_cst (tree, HOST_WIDE_INT); +extern tree build_int_cstu (tree type, unsigned HOST_WIDE_INT cst); extern tree build_int_cst_type (tree, HOST_WIDE_INT); -extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT); -extern tree build_vector (tree, tree); -extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *); +extern tree make_vector (unsigned CXX_MEM_STAT_INFO); +extern tree build_vector (tree, vec<tree> CXX_MEM_STAT_INFO); +extern tree build_vector_from_ctor (tree, vec<constructor_elt, va_gc> *); extern tree build_vector_from_val (tree, tree); -extern tree build_constructor (tree, VEC(constructor_elt,gc) *); +extern void recompute_constructor_flags (tree); +extern void verify_constructor_flags (tree); +extern tree build_constructor (tree, vec<constructor_elt, va_gc> *); extern tree build_constructor_single (tree, tree, tree); extern tree build_constructor_from_list (tree, tree); +extern tree build_constructor_va (tree, int, ...); extern tree build_real_from_int_cst (tree, const_tree); extern tree build_complex (tree, tree, tree); +extern tree build_complex_inf (tree, bool); +extern tree build_each_one_cst (tree); extern tree build_one_cst (tree); +extern tree build_minus_one_cst (tree); +extern tree build_all_ones_cst (tree); extern tree build_zero_cst (tree); extern tree build_string (int, const char *); -extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL); -#define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO) -extern tree build_tree_list_vec_stat (const VEC(tree,gc) * MEM_STAT_DECL); -#define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO) -extern tree build_decl_stat (location_t, enum tree_code, - tree, tree MEM_STAT_DECL); +extern tree build_tree_list (tree, tree CXX_MEM_STAT_INFO); +extern tree build_tree_list_vec (const vec<tree, va_gc> * CXX_MEM_STAT_INFO); +extern tree build_decl (location_t, enum tree_code, + tree, tree CXX_MEM_STAT_INFO); extern tree build_fn_decl (const char *, tree); -#define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO) extern tree build_translation_unit_decl (tree); extern tree build_block (tree, tree, tree, tree); extern tree build_empty_stmt (location_t); extern tree build_omp_clause (location_t, enum omp_clause_code); -extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL); -#define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO) +extern tree build_vl_exp (enum tree_code, int CXX_MEM_STAT_INFO); extern tree build_call_nary (tree, tree, int, ...); extern tree build_call_valist (tree, tree, int, va_list); #define build_call_array(T1,T2,N,T3)\ build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3) extern tree build_call_array_loc (location_t, tree, tree, int, const tree *); -extern tree build_call_vec (tree, tree, VEC(tree,gc) *); +extern tree build_call_vec (tree, tree, vec<tree, va_gc> *); +extern tree build_call_expr_loc_array (location_t, tree, int, tree *); +extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *); +extern tree build_call_expr_loc (location_t, tree, int, ...); +extern tree build_call_expr (tree, int, ...); +extern tree build_call_expr_internal_loc (location_t, enum internal_fn, + tree, int, ...); +extern tree build_call_expr_internal_loc_array (location_t, enum internal_fn, + tree, int, const tree *); +extern tree maybe_build_call_expr_loc (location_t, combined_fn, tree, + int, ...); +extern tree build_alloca_call_expr (tree, unsigned int, HOST_WIDE_INT); +extern tree build_string_literal (int, const char *); /* Construct various nodes representing data types. */ -extern tree make_signed_type (int); -extern tree make_unsigned_type (int); extern tree signed_or_unsigned_type_for (int, tree); extern tree signed_type_for (tree); extern tree unsigned_type_for (tree); -extern void initialize_sizetypes (void); -extern void set_sizetype (tree); -extern void fixup_unsigned_type (tree); -extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool); +extern tree truth_type_for (tree); +extern tree build_pointer_type_for_mode (tree, machine_mode, bool); extern tree build_pointer_type (tree); -extern tree build_reference_type_for_mode (tree, enum machine_mode, bool); +extern tree build_reference_type_for_mode (tree, machine_mode, bool); extern tree build_reference_type (tree); -extern tree build_vector_type_for_mode (tree, enum machine_mode); +extern tree build_vector_type_for_mode (tree, machine_mode); extern tree build_vector_type (tree innertype, int nunits); +extern tree build_truth_vector_type (unsigned, unsigned); +extern tree build_same_sized_truth_vector_type (tree vectype); extern tree build_opaque_vector_type (tree innertype, int nunits); -extern tree build_type_no_quals (tree); extern tree build_index_type (tree); -extern tree build_array_type (tree, tree); +extern tree build_array_type (tree, tree, bool = false); extern tree build_nonshared_array_type (tree, tree); +extern tree build_array_type_nelts (tree, unsigned HOST_WIDE_INT); extern tree build_function_type (tree, tree); extern tree build_function_type_list (tree, ...); -extern tree build_function_type_skip_args (tree, bitmap); -extern tree build_function_decl_skip_args (tree, bitmap); extern tree build_varargs_function_type_list (tree, ...); +extern tree build_function_type_array (tree, int, tree *); +extern tree build_varargs_function_type_array (tree, int, tree *); +#define build_function_type_vec(RET, V) \ + build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V)) +#define build_varargs_function_type_vec(RET, V) \ + build_varargs_function_type_array (RET, vec_safe_length (V), \ + vec_safe_address (V)) extern tree build_method_type_directly (tree, tree, tree); extern tree build_method_type (tree, tree); extern tree build_offset_type (tree, tree); -extern tree build_complex_type (tree); +extern tree build_complex_type (tree, bool named = false); extern tree array_type_nelts (const_tree); -extern bool in_array_bounds_p (tree); -extern bool range_in_array_bounds_p (tree); extern tree value_member (tree, tree); extern tree purpose_member (const_tree, tree); -extern bool vec_member (const_tree, VEC(tree,gc) *); +extern bool vec_member (const_tree, vec<tree, va_gc> *); extern tree chain_index (int, tree); -extern int attribute_list_equal (const_tree, const_tree); -extern int attribute_list_contained (const_tree, const_tree); extern int tree_int_cst_equal (const_tree, const_tree); -extern int tree_int_cst_lt (const_tree, const_tree); -extern int tree_int_cst_compare (const_tree, const_tree); -extern int host_integerp (const_tree, int) -#ifndef ENABLE_TREE_CHECKING - ATTRIBUTE_PURE /* host_integerp is pure only when checking is disabled. */ -#endif - ; -extern HOST_WIDE_INT tree_low_cst (const_tree, int); + +extern bool tree_fits_shwi_p (const_tree) + ATTRIBUTE_PURE; +extern bool tree_fits_uhwi_p (const_tree) + ATTRIBUTE_PURE; +extern HOST_WIDE_INT tree_to_shwi (const_tree); +extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree); #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003) extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT -tree_low_cst (const_tree t, int pos) +tree_to_shwi (const_tree t) { - gcc_assert (host_integerp (t, pos)); + gcc_assert (tree_fits_shwi_p (t)); + return TREE_INT_CST_LOW (t); +} + +extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT +tree_to_uhwi (const_tree t) +{ + gcc_assert (tree_fits_uhwi_p (t)); return TREE_INT_CST_LOW (t); } #endif -extern int tree_int_cst_msb (const_tree); extern int tree_int_cst_sgn (const_tree); extern int tree_int_cst_sign_bit (const_tree); -extern unsigned int tree_int_cst_min_precision (tree, bool); -extern bool tree_expr_nonnegative_p (tree); -extern bool tree_expr_nonnegative_warnv_p (tree, bool *); -extern bool may_negate_without_overflow_p (const_tree); +extern unsigned int tree_int_cst_min_precision (tree, signop); extern tree strip_array_types (tree); extern tree excess_precision_type (tree); - -/* Construct various nodes representing fract or accum data types. */ - -extern tree make_fract_type (int, int, int); -extern tree make_accum_type (int, int, int); - -#define make_signed_fract_type(P) make_fract_type (P, 0, 0) -#define make_unsigned_fract_type(P) make_fract_type (P, 1, 0) -#define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1) -#define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1) -#define make_signed_accum_type(P) make_accum_type (P, 0, 0) -#define make_unsigned_accum_type(P) make_accum_type (P, 1, 0) -#define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1) -#define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1) - -#define make_or_reuse_signed_fract_type(P) \ - make_or_reuse_fract_type (P, 0, 0) -#define make_or_reuse_unsigned_fract_type(P) \ - make_or_reuse_fract_type (P, 1, 0) -#define make_or_reuse_sat_signed_fract_type(P) \ - make_or_reuse_fract_type (P, 0, 1) -#define make_or_reuse_sat_unsigned_fract_type(P) \ - make_or_reuse_fract_type (P, 1, 1) -#define make_or_reuse_signed_accum_type(P) \ - make_or_reuse_accum_type (P, 0, 0) -#define make_or_reuse_unsigned_accum_type(P) \ - make_or_reuse_accum_type (P, 1, 0) -#define make_or_reuse_sat_signed_accum_type(P) \ - make_or_reuse_accum_type (P, 0, 1) -#define make_or_reuse_sat_unsigned_accum_type(P) \ - make_or_reuse_accum_type (P, 1, 1) +extern bool valid_constant_size_p (const_tree); + /* From expmed.c. Since rtl.h is included after tree.h, we can't put the prototype here. Rtl.h does declare the prototype if tree.h had been included. */ extern tree make_tree (tree, rtx); - -/* Return a type like TTYPE except that its TYPE_ATTRIBUTES - is ATTRIBUTE. - - Such modified types already made are recorded so that duplicates - are not made. */ - -extern tree build_type_attribute_variant (tree, tree); -extern tree build_decl_attribute_variant (tree, tree); -extern tree build_type_attribute_qual_variant (tree, tree, int); - -/* Structure describing an attribute and a function to handle it. */ -struct attribute_spec -{ - /* The name of the attribute (without any leading or trailing __), - or NULL to mark the end of a table of attributes. */ - const char *const name; - /* The minimum length of the list of arguments of the attribute. */ - const int min_length; - /* The maximum length of the list of arguments of the attribute - (-1 for no maximum). */ - const int max_length; - /* Whether this attribute requires a DECL. If it does, it will be passed - from types of DECLs, function return types and array element types to - the DECLs, function types and array types respectively; but when - applied to a type in any other circumstances, it will be ignored with - a warning. (If greater control is desired for a given attribute, - this should be false, and the flags argument to the handler may be - used to gain greater control in that case.) */ - const bool decl_required; - /* Whether this attribute requires a type. If it does, it will be passed - from a DECL to the type of that DECL. */ - const bool type_required; - /* Whether this attribute requires a function (or method) type. If it does, - it will be passed from a function pointer type to the target type, - and from a function return type (which is not itself a function - pointer type) to the function type. */ - const bool function_type_required; - /* Function to handle this attribute. NODE points to the node to which - the attribute is to be applied. If a DECL, it should be modified in - place; if a TYPE, a copy should be created. NAME is the name of the - attribute (possibly with leading or trailing __). ARGS is the TREE_LIST - of the arguments (which may be NULL). FLAGS gives further information - about the context of the attribute. Afterwards, the attributes will - be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate, - unless *NO_ADD_ATTRS is set to true (which should be done on error, - as well as in any other cases when the attributes should not be added - to the DECL or TYPE). Depending on FLAGS, any attributes to be - applied to another type or DECL later may be returned; - otherwise the return value should be NULL_TREE. This pointer may be - NULL if no special handling is required beyond the checks implied - by the rest of this structure. */ - tree (*const handler) (tree *node, tree name, tree args, - int flags, bool *no_add_attrs); -}; - -/* Flags that may be passed in the third argument of decl_attributes, and - to handler functions for attributes. */ -enum attribute_flags -{ - /* The type passed in is the type of a DECL, and any attributes that - should be passed in again to be applied to the DECL rather than the - type should be returned. */ - ATTR_FLAG_DECL_NEXT = 1, - /* The type passed in is a function return type, and any attributes that - should be passed in again to be applied to the function type rather - than the return type should be returned. */ - ATTR_FLAG_FUNCTION_NEXT = 2, - /* The type passed in is an array element type, and any attributes that - should be passed in again to be applied to the array type rather - than the element type should be returned. */ - ATTR_FLAG_ARRAY_NEXT = 4, - /* The type passed in is a structure, union or enumeration type being - created, and should be modified in place. */ - ATTR_FLAG_TYPE_IN_PLACE = 8, - /* The attributes are being applied by default to a library function whose - name indicates known behavior, and should be silently ignored if they - are not in fact compatible with the function type. */ - ATTR_FLAG_BUILT_IN = 16 -}; - -/* Default versions of target-overridable functions. */ - -extern tree merge_decl_attributes (tree, tree); -extern tree merge_type_attributes (tree, tree); - -/* Given a tree node and a string, return nonzero if the tree node is - a valid attribute name for the string. */ - -extern int is_attribute_p (const char *, const_tree); - -/* Given an attribute name and a list of attributes, return the list element - of the attribute or NULL_TREE if not found. */ - -extern tree lookup_attribute (const char *, tree); - -/* Remove any instances of attribute ATTR_NAME in LIST and return the - modified list. */ - -extern tree remove_attribute (const char *, tree); - -/* Given two attributes lists, return a list of their union. */ - -extern tree merge_attributes (tree, tree); - -#if TARGET_DLLIMPORT_DECL_ATTRIBUTES -/* Given two Windows decl attributes lists, possibly including - dllimport, return a list of their union . */ -extern tree merge_dllimport_decl_attributes (tree, tree); - -/* Handle a "dllimport" or "dllexport" attribute. */ -extern tree handle_dll_attribute (tree *, tree, tree, int, bool *); -#endif + +/* Returns true iff CAND and BASE have equivalent language-specific + qualifiers. */ + +extern bool check_lang_type (const_tree cand, const_tree base); + +/* Returns true iff unqualified CAND and BASE are equivalent. */ + +extern bool check_base_type (const_tree cand, const_tree base); /* Check whether CAND is suitable to be returned from get_qualified_type (BASE, TYPE_QUALS). */ @@ -4403,7 +4165,7 @@ /* Like get_qualified_type, but creates the type if it does not exist. This function never returns NULL_TREE. */ -extern tree build_qualified_type (tree, int); +extern tree build_qualified_type (tree, int CXX_MEM_STAT_INFO); /* Create a variant of type T with alignment ALIGN. */ @@ -4421,164 +4183,52 @@ /* Make a copy of a type node. */ -extern tree build_distinct_type_copy (tree); -extern tree build_variant_type_copy (tree); - -/* Finish up a builtin RECORD_TYPE. Give it a name and provide its - fields. Optionally specify an alignment, and then lay it out. */ - -extern void finish_builtin_struct (tree, const char *, - tree, tree); - -/* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT, - TYPE_ALIGN and TYPE_MODE fields. If called more than once on one - node, does nothing except for the first time. */ - -extern void layout_type (tree); - -/* These functions allow a front-end to perform a manual layout of a - RECORD_TYPE. (For instance, if the placement of subsequent fields - depends on the placement of fields so far.) Begin by calling - start_record_layout. Then, call place_field for each of the - fields. Then, call finish_record_layout. See layout_type for the - default way in which these functions are used. */ - -typedef struct record_layout_info_s -{ - /* The RECORD_TYPE that we are laying out. */ - tree t; - /* The offset into the record so far, in bytes, not including bits in - BITPOS. */ - tree offset; - /* The last known alignment of SIZE. */ - unsigned int offset_align; - /* The bit position within the last OFFSET_ALIGN bits, in bits. */ - tree bitpos; - /* The alignment of the record so far, in bits. */ - unsigned int record_align; - /* The alignment of the record so far, ignoring #pragma pack and - __attribute__ ((packed)), in bits. */ - unsigned int unpacked_align; - /* The previous field layed out. */ - tree prev_field; - /* The static variables (i.e., class variables, as opposed to - instance variables) encountered in T. */ - VEC(tree,gc) *pending_statics; - /* Bits remaining in the current alignment group */ - int remaining_in_alignment; - /* True if we've seen a packed field that didn't have normal - alignment anyway. */ - int packed_maybe_necessary; -} *record_layout_info; - -extern record_layout_info start_record_layout (tree); -extern tree bit_from_pos (tree, tree); -extern tree byte_from_pos (tree, tree); -extern void pos_from_bit (tree *, tree *, unsigned int, tree); -extern void normalize_offset (tree *, tree *, unsigned int); -extern tree rli_size_unit_so_far (record_layout_info); -extern tree rli_size_so_far (record_layout_info); -extern void normalize_rli (record_layout_info); -extern void place_field (record_layout_info, tree); -extern void compute_record_mode (tree); -extern void finish_record_layout (record_layout_info, int); +extern tree build_distinct_type_copy (tree CXX_MEM_STAT_INFO); +extern tree build_variant_type_copy (tree CXX_MEM_STAT_INFO); /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), return a canonicalized ..._TYPE node, so that duplicates are not made. How the hash code is computed is up to the caller, as long as any two callers that could hash identical-looking type nodes agree. */ +extern hashval_t type_hash_canon_hash (tree); extern tree type_hash_canon (unsigned int, tree); -/* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node, - calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE - fields. Call this only once for any given decl node. - - Second argument is the boundary that this field can be assumed to - be starting at (in bits). Zero means it can be assumed aligned - on any boundary that may be needed. */ - -extern void layout_decl (tree, unsigned); - -/* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of - a previous call to layout_decl and calls it again. */ - -extern void relayout_decl (tree); - -/* Return the mode for data of a given size SIZE and mode class CLASS. - If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE. - The value is BLKmode if no other mode is found. This is like - mode_for_size, but is passed a tree. */ - -extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int); - -/* Return an expr equal to X but certainly not valid as an lvalue. */ - -#define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T) -extern tree non_lvalue_loc (location_t, tree); - extern tree convert (tree, tree); extern unsigned int expr_align (const_tree); -extern tree expr_first (tree); -extern tree expr_last (tree); -extern tree size_in_bytes (const_tree); +extern tree size_in_bytes_loc (location_t, const_tree); +inline tree +size_in_bytes (const_tree t) +{ + return size_in_bytes_loc (input_location, t); +} + extern HOST_WIDE_INT int_size_in_bytes (const_tree); extern HOST_WIDE_INT max_int_size_in_bytes (const_tree); -extern tree tree_expr_size (const_tree); extern tree bit_position (const_tree); -extern HOST_WIDE_INT int_bit_position (const_tree); extern tree byte_position (const_tree); extern HOST_WIDE_INT int_byte_position (const_tree); -/* Define data structures, macros, and functions for handling sizes - and the various types used to represent sizes. */ - -enum size_type_kind -{ - SIZETYPE, /* Normal representation of sizes in bytes. */ - SSIZETYPE, /* Signed representation of sizes in bytes. */ - BITSIZETYPE, /* Normal representation of sizes in bits. */ - SBITSIZETYPE, /* Signed representation of sizes in bits. */ - TYPE_KIND_LAST}; - -extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST]; - -#define sizetype sizetype_tab[(int) SIZETYPE] -#define bitsizetype sizetype_tab[(int) BITSIZETYPE] -#define ssizetype sizetype_tab[(int) SSIZETYPE] -#define sbitsizetype sizetype_tab[(int) SBITSIZETYPE] - -extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind); -#define size_binop(CODE,T1,T2)\ - size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2) -extern tree size_binop_loc (location_t, enum tree_code, tree, tree); -#define size_diffop(T1,T2)\ - size_diffop_loc (UNKNOWN_LOCATION, T1, T2) -extern tree size_diffop_loc (location_t, tree, tree); - -#define size_int(L) size_int_kind (L, SIZETYPE) -#define ssize_int(L) size_int_kind (L, SSIZETYPE) -#define bitsize_int(L) size_int_kind (L, BITSIZETYPE) -#define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE) - -#define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N) -extern tree round_up_loc (location_t, tree, int); -#define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N) -extern tree round_down_loc (location_t, tree, int); -extern VEC(tree,gc) *get_pending_sizes (void); -extern void put_pending_size (tree); -extern void put_pending_sizes (VEC(tree,gc) *); -extern void finalize_size_functions (void); - /* Type for sizes of data-type. */ -#define BITS_PER_UNIT_LOG \ - ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \ - + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \ - + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256)) - -/* If nonzero, an upper limit on alignment of structure fields, in bits, */ -extern unsigned int maximum_field_alignment; +#define sizetype sizetype_tab[(int) stk_sizetype] +#define bitsizetype sizetype_tab[(int) stk_bitsizetype] +#define ssizetype sizetype_tab[(int) stk_ssizetype] +#define sbitsizetype sizetype_tab[(int) stk_sbitsizetype] +#define size_int(L) size_int_kind (L, stk_sizetype) +#define ssize_int(L) size_int_kind (L, stk_ssizetype) +#define bitsize_int(L) size_int_kind (L, stk_bitsizetype) +#define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype) + +/* Log2 of BITS_PER_UNIT. */ + +#if BITS_PER_UNIT == 8 +#define LOG2_BITS_PER_UNIT 3 +#elif BITS_PER_UNIT == 16 +#define LOG2_BITS_PER_UNIT 4 +#else +#error Unknown BITS_PER_UNIT +#endif /* Concatenate two lists (chains of TREE_LIST nodes) X and Y by making the last node in X point to Y. @@ -4588,8 +4238,7 @@ /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ -extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL); -#define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO) +extern tree tree_cons (tree, tree, tree CXX_MEM_STAT_INFO); /* Return the last tree node in a chain. */ @@ -4604,10 +4253,6 @@ extern int list_length (const_tree); -/* Returns the number of FIELD_DECLs in a type. */ - -extern int fields_length (const_tree); - /* Returns the first FIELD_DECL in a type. */ extern tree first_field (const_tree); @@ -4617,25 +4262,18 @@ extern bool initializer_zerop (const_tree); +/* Given a vector VEC, return its first element if all elements are + the same. Otherwise return NULL_TREE. */ + +extern tree uniform_vector_p (const_tree); + /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */ -extern VEC(tree,gc) *ctor_to_vec (tree); - -/* Examine CTOR to discover: - * how many scalar fields are set to nonzero values, - and place it in *P_NZ_ELTS; - * how many scalar fields in total are in CTOR, - and place it in *P_ELT_COUNT. - * if a type is a union, and the initializer from the constructor - is not the largest element in the union, then set *p_must_clear. - - Return whether or not CTOR is a valid static constant initializer, the same - as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */ - -extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *, - bool *); - -extern HOST_WIDE_INT count_type_elements (const_tree, bool); +extern vec<tree, va_gc> *ctor_to_vec (tree); + +/* zerop (tree x) is nonzero if X is a constant of value 0. */ + +extern int zerop (const_tree); /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */ @@ -4645,11 +4283,21 @@ extern int integer_onep (const_tree); +/* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or + a vector or complex where each part is 1. */ + +extern int integer_each_onep (const_tree); + /* integer_all_onesp (tree x) is nonzero if X is an integer constant all of whose significant bits are 1. */ extern int integer_all_onesp (const_tree); +/* integer_minus_onep (tree x) is nonzero if X is an integer constant of + value -1. */ + +extern int integer_minus_onep (const_tree); + /* integer_pow2p (tree x) is nonzero is X is an integer constant with exactly one bit 1. */ @@ -4660,6 +4308,11 @@ extern int integer_nonzerop (const_tree); +/* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or + a vector where each element is an integer constant of value -1. */ + +extern int integer_truep (const_tree); + extern bool cst_and_fits_in_hwi (const_tree); extern tree num_ending_zeros (const_tree); @@ -4679,11 +4332,20 @@ extern tree save_expr (tree); -/* Look inside EXPR and into any simple arithmetic operations. Return - the innermost non-arithmetic node. */ +/* Return true if T is function-invariant. */ + +extern bool tree_invariant_p (tree); + +/* Look inside EXPR into any simple arithmetic operations. Return the + outermost non-arithmetic or non-invariant node. */ extern tree skip_simple_arithmetic (tree); +/* Look inside EXPR into simple arithmetic operations involving constants. + Return the outermost non-arithmetic or non-constant node. */ + +extern tree skip_simple_constant_arithmetic (tree); + /* Return which tree structure is used by T. */ enum tree_node_structure_enum tree_node_structure (const_tree); @@ -4705,14 +4367,14 @@ extern bool type_contains_placeholder_p (tree); -/* Given a tree EXP, find all occurences of references to fields +/* Given a tree EXP, find all occurrences of references to fields in a PLACEHOLDER_EXPR and place them in vector REFS without duplicates. Also record VAR_DECLs and CONST_DECLs. Note that we assume here that EXP contains only arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their argument list. */ -extern void find_placeholder_in_expr (tree, VEC (tree, heap) **); +extern void find_placeholder_in_expr (tree, vec<tree> *); /* This macro calls the above function but short-circuits the common case of a constant to save time and also checks for NULL. */ @@ -4750,13 +4412,6 @@ ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \ : substitute_placeholder_in_expr (EXP, OBJ)) -/* variable_size (EXP) is like save_expr (EXP) except that it - is for the special case of something that is part of a - variable size for a data type. It makes special arrangements - to compute the value at the right time when the data type - belongs to a function parameter. */ - -extern tree variable_size (tree); /* stabilize_reference (EXP) returns a reference equivalent to EXP but it can be used multiple times @@ -4764,12 +4419,6 @@ extern tree stabilize_reference (tree); -/* Subroutine of stabilize_reference; this is called for subtrees of - references. Any expression with side-effects must be put in a SAVE_EXPR - to ensure that it is only evaluated once. */ - -extern tree stabilize_reference_1 (tree); - /* Return EXP, stripped of any conversions to wider types in such a way that the result of converting to type FOR_TYPE is the same as if EXP were converted to FOR_TYPE. @@ -4791,13 +4440,13 @@ { switch (TREE_CODE (t)) { + case COMPONENT_REF: case BIT_FIELD_REF: - case COMPONENT_REF: case ARRAY_REF: case ARRAY_RANGE_REF: - case VIEW_CONVERT_EXPR: case REALPART_EXPR: case IMAGPART_EXPR: + case VIEW_CONVERT_EXPR: return true; default: @@ -4805,39 +4454,64 @@ } } -/* Given an expression EXP that is a handled_component_p, - look for the ultimate containing object, which is returned and specify - the access position and size. */ - -extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *, - tree *, enum machine_mode *, int *, int *, - bool); - -/* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an - ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within - EXP is marked as PACKED. */ - -extern bool contains_packed_reference (const_tree exp); - -/* Return a tree of sizetype representing the size, in bytes, of the element - of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ - -extern tree array_ref_element_size (tree); - -/* Return a tree representing the lower bound of the array mentioned in - EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ - -extern tree array_ref_low_bound (tree); - -/* Return a tree representing the upper bound of the array mentioned in - EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ - -extern tree array_ref_up_bound (tree); - -/* Return a tree representing the offset, in bytes, of the field referenced - by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */ - -extern tree component_ref_field_offset (tree); +/* Return true T is a component with reverse storage order. */ + +static inline bool +reverse_storage_order_for_component_p (tree t) +{ + /* The storage order only applies to scalar components. */ + if (AGGREGATE_TYPE_P (TREE_TYPE (t)) || VECTOR_TYPE_P (TREE_TYPE (t))) + return false; + + if (TREE_CODE (t) == REALPART_EXPR || TREE_CODE (t) == IMAGPART_EXPR) + t = TREE_OPERAND (t, 0); + + switch (TREE_CODE (t)) + { + case ARRAY_REF: + case COMPONENT_REF: + /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */ + /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */ + return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0))) + && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t, 0))); + + case BIT_FIELD_REF: + case MEM_REF: + return REF_REVERSE_STORAGE_ORDER (t); + + case ARRAY_RANGE_REF: + case VIEW_CONVERT_EXPR: + default: + return false; + } + + gcc_unreachable (); +} + +/* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR + that can modify the storage order of objects. Note that, even if the + TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the + outer type, a VIEW_CONVERT_EXPR can modify the storage order because + it can change the partition of the aggregate object into scalars. */ + +static inline bool +storage_order_barrier_p (const_tree t) +{ + if (TREE_CODE (t) != VIEW_CONVERT_EXPR) + return false; + + if (AGGREGATE_TYPE_P (TREE_TYPE (t)) + && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t))) + return true; + + tree op = TREE_OPERAND (t, 0); + + if (AGGREGATE_TYPE_P (TREE_TYPE (op)) + && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op))) + return true; + + return false; +} /* Given a DECL or TYPE, return the scope in which it was declared, or NUL_TREE if there is no containing scope. */ @@ -4854,25 +4528,6 @@ /* Return 1 if EXPR is the real constant zero. */ extern int real_zerop (const_tree); - -/* Declare commonly used variables for tree structure. */ - -/* Nonzero means lvalues are limited to those valid in pedantic ANSI C. - Zero means allow extended lvalues. */ - -extern int pedantic_lvalues; - -/* Points to the FUNCTION_DECL of the function whose body we are reading. */ - -extern GTY(()) tree current_function_decl; - -/* Nonzero means a FUNC_BEGIN label was emitted. */ -extern GTY(()) const char * current_function_func_begin_label; - -/* Iterator for going through the function arguments. */ -typedef struct { - tree next; /* TREE_LIST pointing to the next argument */ -} function_args_iterator; /* Initialize the iterator I with arguments from function FNDECL */ @@ -4913,7 +4568,7 @@ static inline bool inlined_function_outer_scope_p (const_tree block) { - return BLOCK_SOURCE_LOCATION (block) != UNKNOWN_LOCATION; + return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION; } /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set @@ -4932,195 +4587,68 @@ (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \ function_args_iter_next (&(ITER))) - - /* In tree.c */ +extern unsigned crc32_unsigned_n (unsigned, unsigned, unsigned); extern unsigned crc32_string (unsigned, const char *); +inline unsigned +crc32_unsigned (unsigned chksum, unsigned value) +{ + return crc32_unsigned_n (chksum, value, 4); +} +inline unsigned +crc32_byte (unsigned chksum, char byte) +{ + return crc32_unsigned_n (chksum, byte, 1); +} extern void clean_symbol_name (char *); extern tree get_file_function_name (const char *); extern tree get_callee_fndecl (const_tree); +extern combined_fn get_call_combined_fn (const_tree); extern int type_num_arguments (const_tree); extern bool associative_tree_code (enum tree_code); extern bool commutative_tree_code (enum tree_code); extern bool commutative_ternary_tree_code (enum tree_code); +extern bool operation_can_overflow (enum tree_code); +extern bool operation_no_trapping_overflow (tree, enum tree_code); extern tree upper_bound_in_type (tree, tree); extern tree lower_bound_in_type (tree, tree); extern int operand_equal_for_phi_arg_p (const_tree, const_tree); -extern tree call_expr_arg (tree, int); -extern tree *call_expr_argp (tree, int); extern tree create_artificial_label (location_t); extern const char *get_name (tree); extern bool stdarg_p (const_tree); -extern bool prototype_p (tree); -extern bool is_typedef_decl (tree x); -extern bool typedef_variant_p (tree); +extern bool prototype_p (const_tree); +extern bool is_typedef_decl (const_tree x); +extern bool typedef_variant_p (const_tree); extern bool auto_var_in_fn_p (const_tree, const_tree); extern tree build_low_bits_mask (tree, unsigned); +extern bool tree_nop_conversion_p (const_tree, const_tree); extern tree tree_strip_nop_conversions (tree); extern tree tree_strip_sign_nop_conversions (tree); +extern const_tree strip_invariant_refs (const_tree); extern tree lhd_gcc_personality (void); -extern void assign_assembler_name_if_neeeded (tree); +extern void assign_assembler_name_if_needed (tree); extern void warn_deprecated_use (tree, tree); - - -/* In cgraph.c */ -extern void change_decl_assembler_name (tree, tree); - -/* In gimplify.c */ -extern tree unshare_expr (tree); - -/* In stmt.c */ - -extern void expand_expr_stmt (tree); -extern int warn_if_unused_value (const_tree, location_t); -extern void expand_label (tree); -extern void expand_goto (tree); - -extern rtx expand_stack_save (void); -extern void expand_stack_restore (tree); -extern void expand_return (tree); - -/* In tree-eh.c */ -extern void using_eh_for_cleanups (void); - -/* In fold-const.c */ - -/* Non-zero if we are folding constants inside an initializer; zero - otherwise. */ -extern int folding_initializer; - -/* Convert between trees and native memory representation. */ -extern int native_encode_expr (const_tree, unsigned char *, int); -extern tree native_interpret_expr (tree, const unsigned char *, int); - -/* Fold constants as much as possible in an expression. - Returns the simplified expression. - Acts only on the top level of the expression; - if the argument itself cannot be simplified, its - subexpressions are not changed. */ - -extern tree fold (tree); -#define fold_unary(CODE,T1,T2)\ - fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2) -extern tree fold_unary_loc (location_t, enum tree_code, tree, tree); -#define fold_unary_ignore_overflow(CODE,T1,T2)\ - fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2) -extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree); -#define fold_binary(CODE,T1,T2,T3)\ - fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3) -extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree); -#define fold_ternary(CODE,T1,T2,T3,T4)\ - fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4) -extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree); -#define fold_build1(c,t1,t2)\ - fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO) -#define fold_build1_loc(l,c,t1,t2)\ - fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO) -extern tree fold_build1_stat_loc (location_t, enum tree_code, tree, - tree MEM_STAT_DECL); -#define fold_build2(c,t1,t2,t3)\ - fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO) -#define fold_build2_loc(l,c,t1,t2,t3)\ - fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO) -extern tree fold_build2_stat_loc (location_t, enum tree_code, tree, tree, - tree MEM_STAT_DECL); -#define fold_build3(c,t1,t2,t3,t4)\ - fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO) -#define fold_build3_loc(l,c,t1,t2,t3,t4)\ - fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO) -extern tree fold_build3_stat_loc (location_t, enum tree_code, tree, tree, tree, - tree MEM_STAT_DECL); -extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree); -extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree); -extern tree fold_build3_initializer_loc (location_t, enum tree_code, tree, tree, tree, tree); -#define fold_build_call_array(T1,T2,N,T4)\ - fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4) -extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *); -#define fold_build_call_array_initializer(T1,T2,N,T4)\ - fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4) -extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *); -extern bool fold_convertible_p (const_tree, const_tree); -#define fold_convert(T1,T2)\ - fold_convert_loc(UNKNOWN_LOCATION, T1, T2) -extern tree fold_convert_loc (location_t, tree, tree); -extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree); -extern tree fold_ignored_result (tree); -extern tree fold_abs_const (tree, tree); -extern tree fold_indirect_ref_1 (location_t, tree, tree); -extern void fold_defer_overflow_warnings (void); -extern void fold_undefer_overflow_warnings (bool, const_gimple, int); -extern void fold_undefer_and_ignore_overflow_warnings (void); -extern bool fold_deferring_overflow_warnings_p (void); -extern tree fold_fma (location_t, tree, tree, tree, tree); - -enum operand_equal_flag +extern void cache_integer_cst (tree); +extern const char *combined_fn_name (combined_fn); + +/* Compare and hash for any structure which begins with a canonical + pointer. Assumes all pointers are interchangeable, which is sort + of already assumed by gcc elsewhere IIRC. */ + +static inline int +struct_ptr_eq (const void *a, const void *b) { - OEP_ONLY_CONST = 1, - OEP_PURE_SAME = 2 -}; - -extern int operand_equal_p (const_tree, const_tree, unsigned int); -extern int multiple_of_p (tree, const_tree, const_tree); -#define omit_one_operand(T1,T2,T3)\ - omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3) -extern tree omit_one_operand_loc (location_t, tree, tree, tree); -#define omit_two_operands(T1,T2,T3,T4)\ - omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4) -extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree); -#define invert_truthvalue(T)\ - invert_truthvalue_loc(UNKNOWN_LOCATION, T) -extern tree invert_truthvalue_loc (location_t, tree); -extern tree fold_truth_not_expr (location_t, tree); -extern tree fold_unary_to_constant (enum tree_code, tree, tree); -extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree); -extern tree fold_read_from_constant_string (tree); -extern tree int_const_binop (enum tree_code, const_tree, const_tree, int); -#define build_fold_addr_expr(T)\ - build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T)) -extern tree build_fold_addr_expr_loc (location_t, tree); -#define build_fold_addr_expr_with_type(T,TYPE)\ - build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE) -extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree); -extern tree fold_build_cleanup_point_expr (tree type, tree expr); -extern tree fold_strip_sign_ops (tree); -#define build_fold_indirect_ref(T)\ - build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T) -extern tree build_fold_indirect_ref_loc (location_t, tree); -#define fold_indirect_ref(T)\ - fold_indirect_ref_loc (UNKNOWN_LOCATION, T) -extern tree fold_indirect_ref_loc (location_t, tree); -extern tree build_simple_mem_ref_loc (location_t, tree); -#define build_simple_mem_ref(T)\ - build_simple_mem_ref_loc (UNKNOWN_LOCATION, T) -extern double_int mem_ref_offset (const_tree); -extern tree reference_alias_ptr_type (const_tree); -extern tree constant_boolean_node (int, tree); -extern tree div_if_zero_remainder (enum tree_code, const_tree, const_tree); - -extern bool tree_swap_operands_p (const_tree, const_tree, bool); -extern enum tree_code swap_tree_comparison (enum tree_code); - -extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *); -extern enum tree_code invert_tree_comparison (enum tree_code, bool); - -extern bool tree_expr_nonzero_p (tree); -extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *); -extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1, - bool *); -extern bool tree_single_nonzero_warnv_p (tree, bool *); -extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *); -extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree, - bool *); -extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p); -extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p); -extern bool tree_call_nonnegative_warnv_p (tree, tree, tree, tree, bool *); - -extern bool tree_expr_nonzero_warnv_p (tree, bool *); - -extern bool fold_real_zero_addition_p (const_tree, const_tree, int); -extern tree combine_comparisons (location_t, enum tree_code, enum tree_code, - enum tree_code, tree, tree, tree); -extern void debug_fold_checksum (const_tree); + const void * const * x = (const void * const *) a; + const void * const * y = (const void * const *) b; + return *x == *y; +} + +static inline hashval_t +struct_ptr_hash (const void *a) +{ + const void * const * x = (const void * const *) a; + return (intptr_t)*x >> 4; +} /* Return nonzero if CODE is a tree code that represents a truth value. */ static inline bool @@ -5132,51 +4660,28 @@ || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR); } - -/* In builtins.c */ -extern tree fold_call_expr (location_t, tree, bool); -extern tree fold_builtin_fputs (location_t, tree, tree, bool, bool, tree); -extern tree fold_builtin_strcpy (location_t, tree, tree, tree, tree); -extern tree fold_builtin_strncpy (location_t, tree, tree, tree, tree, tree); -extern tree fold_builtin_memory_chk (location_t, tree, tree, tree, tree, tree, tree, bool, - enum built_in_function); -extern tree fold_builtin_stxcpy_chk (location_t, tree, tree, tree, tree, tree, bool, - enum built_in_function); -extern tree fold_builtin_strncpy_chk (location_t, tree, tree, tree, tree, tree); -extern tree fold_builtin_snprintf_chk (location_t, tree, tree, enum built_in_function); -extern bool fold_builtin_next_arg (tree, bool); -extern enum built_in_function builtin_mathfn_code (const_tree); -extern tree fold_builtin_call_array (location_t, tree, tree, int, tree *); -extern tree build_call_expr_loc_array (location_t, tree, int, tree *); -extern tree build_call_expr_loc_vec (location_t, tree, VEC(tree,gc) *); -extern tree build_call_expr_loc (location_t, tree, int, ...); -extern tree build_call_expr (tree, int, ...); -extern tree mathfn_built_in (tree, enum built_in_function fn); -extern tree c_strlen (tree, int); -extern tree std_gimplify_va_arg_expr (tree, tree, gimple_seq *, gimple_seq *); -extern tree build_va_arg_indirect_ref (tree); -extern tree build_string_literal (int, const char *); -extern bool validate_arglist (const_tree, ...); -extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode); -extern bool can_trust_pointer_alignment (void); -extern unsigned int get_pointer_alignment (tree, unsigned int); -extern bool is_builtin_name (const char *); -extern bool is_builtin_fn (tree); -extern unsigned int get_object_alignment (tree, unsigned int); -extern tree fold_call_stmt (gimple, bool); -extern tree gimple_fold_builtin_snprintf_chk (gimple, tree, enum built_in_function); -extern tree make_range (tree, int *, tree *, tree *, bool *); -extern tree build_range_check (location_t, tree, tree, int, tree, tree); -extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int, - tree, tree); -extern void set_builtin_user_assembler_name (tree decl, const char *asmspec); -extern bool is_simple_builtin (tree); -extern bool is_inexpensive_builtin (tree); - -/* In convert.c */ +/* Return whether TYPE is a type suitable for an offset for + a POINTER_PLUS_EXPR. */ +static inline bool +ptrofftype_p (tree type) +{ + return (INTEGRAL_TYPE_P (type) + && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype) + && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype)); +} + +/* Return true if the argument is a complete type or an array + of unknown bound (whose type is incomplete but) whose elements + have complete type. */ +static inline bool +complete_or_array_type_p (const_tree type) +{ + return COMPLETE_TYPE_P (type) + || (TREE_CODE (type) == ARRAY_TYPE + && COMPLETE_TYPE_P (TREE_TYPE (type))); +} + extern tree strip_float_extensions (tree); - -/* In tree.c */ extern int really_constant_p (const_tree); extern bool decl_address_invariant_p (const_tree); extern bool decl_address_ip_invariant_p (const_tree); @@ -5187,284 +4692,60 @@ extern bool variably_modified_type_p (tree, tree); extern int tree_log2 (const_tree); extern int tree_floor_log2 (const_tree); +extern unsigned int tree_ctz (const_tree); extern int simple_cst_equal (const_tree, const_tree); -extern hashval_t iterative_hash_expr (const_tree, hashval_t); -extern hashval_t iterative_hash_exprs_commutative (const_tree, - const_tree, hashval_t); -extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t); -extern hashval_t iterative_hash_hashval_t (hashval_t, hashval_t); -extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t); + +namespace inchash +{ + +extern void add_expr (const_tree, hash &, unsigned int = 0); + +} + +/* Compat version until all callers are converted. Return hash for + TREE with SEED. */ +static inline hashval_t iterative_hash_expr(const_tree tree, hashval_t seed) +{ + inchash::hash hstate (seed); + inchash::add_expr (tree, hstate); + return hstate.end (); +} + extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT); extern int type_list_equal (const_tree, const_tree); extern int chain_member (const_tree, const_tree); -extern tree type_hash_lookup (unsigned int, tree); -extern void type_hash_add (unsigned int, tree); -extern int simple_cst_list_equal (const_tree, const_tree); extern void dump_tree_statistics (void); extern void recompute_tree_invariant_for_addr_expr (tree); extern bool needs_to_live_in_memory (const_tree); extern tree reconstruct_complex_type (tree, tree); - extern int real_onep (const_tree); -extern int real_twop (const_tree); extern int real_minus_onep (const_tree); extern void init_ttree (void); extern void build_common_tree_nodes (bool); -extern void build_common_tree_nodes_2 (int); extern void build_common_builtin_nodes (void); extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int); +extern tree build_nonstandard_boolean_type (unsigned HOST_WIDE_INT); extern tree build_range_type (tree, tree, tree); extern tree build_nonshared_range_type (tree, tree, tree); extern bool subrange_type_for_debug_p (const_tree, tree *, tree *); extern HOST_WIDE_INT int_cst_value (const_tree); -extern HOST_WIDEST_INT widest_int_cst_value (const_tree); - -extern bool fields_compatible_p (const_tree, const_tree); -extern tree find_compatible_field (tree, tree); - -extern tree *tree_block (tree); +extern tree tree_block (tree); +extern void tree_set_block (tree, tree); extern location_t *block_nonartificial_location (tree); extern location_t tree_nonartificial_location (tree); - extern tree block_ultimate_origin (const_tree); - extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree); - -/* In tree-nested.c */ -extern tree build_addr (tree, tree); - -/* In function.c */ -extern void expand_main_function (void); -extern void expand_function_end (void); -extern void expand_function_start (tree); -extern void stack_protect_prologue (void); -extern void stack_protect_epilogue (void); -extern void init_dummy_function_start (void); -extern void expand_dummy_function_end (void); -extern unsigned int init_function_for_compilation (void); -extern void allocate_struct_function (tree, bool); -extern void push_struct_function (tree fndecl); -extern void init_function_start (tree); -extern bool use_register_for_decl (const_tree); -extern void generate_setjmp_warnings (void); -extern void init_temp_slots (void); -extern void free_temp_slots (void); -extern void pop_temp_slots (void); -extern void push_temp_slots (void); -extern void preserve_temp_slots (rtx); -extern int aggregate_value_p (const_tree, const_tree); -extern void push_function_context (void); -extern void pop_function_context (void); -extern gimple_seq gimplify_parameters (void); - -/* In print-rtl.c */ -#ifdef BUFSIZ -extern void print_rtl (FILE *, const_rtx); -#endif - -/* In print-tree.c */ -extern void debug_tree (tree); -extern void debug_vec_tree (VEC(tree,gc) *); -#ifdef BUFSIZ -extern void dump_addr (FILE*, const char *, const void *); -extern void print_node (FILE *, const char *, tree, int); -extern void print_vec_tree (FILE *, const char *, VEC(tree,gc) *, int); -extern void print_node_brief (FILE *, const char *, const_tree, int); -extern void indent_to (FILE *, int); -#endif - -/* In tree-inline.c: */ -extern bool debug_find_tree (tree, tree); -/* This is in tree-inline.c since the routine uses - data structures from the inliner. */ -extern tree unsave_expr_now (tree); -extern tree build_duplicate_type (tree); - -/* In calls.c */ - -/* Nonzero if this is a call to a function whose return value depends - solely on its arguments, has no side effects, and does not read - global memory. This corresponds to TREE_READONLY for function - decls. */ -#define ECF_CONST (1 << 0) -/* Nonzero if this is a call to "pure" function (like const function, - but may read memory. This corresponds to DECL_PURE_P for function - decls. */ -#define ECF_PURE (1 << 1) -/* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no - infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P - for function decls.*/ -#define ECF_LOOPING_CONST_OR_PURE (1 << 2) -/* Nonzero if this call will never return. */ -#define ECF_NORETURN (1 << 3) -/* Nonzero if this is a call to malloc or a related function. */ -#define ECF_MALLOC (1 << 4) -/* Nonzero if it is plausible that this is a call to alloca. */ -#define ECF_MAY_BE_ALLOCA (1 << 5) -/* Nonzero if this is a call to a function that won't throw an exception. */ -#define ECF_NOTHROW (1 << 6) -/* Nonzero if this is a call to setjmp or a related function. */ -#define ECF_RETURNS_TWICE (1 << 7) -/* Nonzero if this call replaces the current stack frame. */ -#define ECF_SIBCALL (1 << 8) -/* Function does not read or write memory (but may have side effects, so - it does not necessarily fit ECF_CONST). */ -#define ECF_NOVOPS (1 << 9) -/* The function does not lead to calls within current function unit. */ -#define ECF_LEAF (1 << 10) - -extern int flags_from_decl_or_type (const_tree); -extern int call_expr_flags (const_tree); - -/* Call argument flags. */ - -/* Nonzero if the argument is not dereferenced recursively, thus only - directly reachable memory is read or written. */ -#define EAF_DIRECT (1 << 0) -/* Nonzero if memory reached by the argument is not clobbered. */ -#define EAF_NOCLOBBER (1 << 1) -/* Nonzero if the argument does not escape. */ -#define EAF_NOESCAPE (1 << 2) -/* Nonzero if the argument is not used by the function. */ -#define EAF_UNUSED (1 << 3) - -/* Call return flags. */ - -/* Mask for the argument number that is returned. Lower two bits of - the return flags, encodes argument slots zero to three. */ -#define ERF_RETURN_ARG_MASK (3) -/* Nonzero if the return value is equal to the argument number - flags & ERF_RETURN_ARG_MASK. */ -#define ERF_RETURNS_ARG (1 << 2) -/* Nonzero if the return value does not alias with anything. Functions - with the malloc attribute have this set on their return value. */ -#define ERF_NOALIAS (1 << 3) - -extern int setjmp_call_p (const_tree); -extern bool gimple_alloca_call_p (const_gimple); -extern bool alloca_call_p (const_tree); -extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree); -extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree); - -/* In attribs.c. */ - -extern const struct attribute_spec *lookup_attribute_spec (const_tree); - -/* Process the attributes listed in ATTRIBUTES and install them in *NODE, - which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL, - it should be modified in place; if a TYPE, a copy should be created - unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further - information, in the form of a bitwise OR of flags in enum attribute_flags - from tree.h. Depending on these flags, some attributes may be - returned to be applied at a later stage (for example, to apply - a decl attribute to the declaration rather than to its type). */ -extern tree decl_attributes (tree *, tree, int); - -/* In integrate.c */ -extern void set_decl_abstract_flags (tree, int); -extern void set_decl_origin_self (tree); - -/* In stor-layout.c */ -extern void set_min_and_max_values_for_integral_type (tree, int, bool); -extern void fixup_signed_type (tree); -extern void internal_reference_types (void); -extern unsigned int update_alignment_for_field (record_layout_info, tree, - unsigned int); -/* varasm.c */ -extern tree tree_output_constant_def (tree); -extern void make_decl_rtl (tree); -extern rtx make_decl_rtl_for_debug (tree); -extern void make_decl_one_only (tree, tree); -extern int supports_one_only (void); -extern void resolve_unique_section (tree, int, int); -extern void mark_referenced (tree); -extern void mark_decl_referenced (tree); -extern void notice_global_symbol (tree); -extern void set_user_assembler_name (tree, const char *); -extern void process_pending_assemble_externals (void); -extern void finish_aliases_1 (void); -extern void finish_aliases_2 (void); -extern void remove_unreachable_alias_pairs (void); -extern bool decl_replaceable_p (tree); -extern bool decl_binds_to_current_def_p (tree); - -/* Derived type for use by compute_visible_aliases and callers. A symbol - alias set is a pointer set into which we enter IDENTIFIER_NODES bearing - the canonicalised assembler-level symbol names corresponding to decls - and their aliases. */ -typedef struct pointer_set_t symbol_alias_set_t; - -extern void symbol_alias_set_destroy (symbol_alias_set_t *); -extern int symbol_alias_set_contains (const symbol_alias_set_t *, tree); -extern symbol_alias_set_t * propagate_aliases_backward (bool (*) - (tree, tree, void *), - void *); - -/* In stmt.c */ -extern void expand_computed_goto (tree); -extern bool parse_output_constraint (const char **, int, int, int, - bool *, bool *, bool *); -extern bool parse_input_constraint (const char **, int, int, int, int, - const char * const *, bool *, bool *); -extern void expand_asm_stmt (gimple); -extern tree resolve_asm_operand_names (tree, tree, tree, tree); -extern bool expand_switch_using_bit_tests_p (tree, tree, unsigned int, - unsigned int); -extern void expand_case (gimple); -extern void expand_decl (tree); -#ifdef HARD_CONST -/* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */ -extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *); -#endif - - -/* In dwarf2out.c */ -/* Interface of the DWARF2 unwind info support. */ - -/* Generate a new label for the CFI info to refer to. */ - -extern char *dwarf2out_cfi_label (bool); - -/* Entry point to update the canonical frame address (CFA). */ - -extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT); - -/* Add the CFI for saving a register window. */ - -extern void dwarf2out_window_save (const char *); - -/* Entry point for saving a register to the stack. */ - -extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT); - -/* Entry point for saving the return address in the stack. */ - -extern void dwarf2out_return_save (const char *, HOST_WIDE_INT); - -/* Entry point for saving the return address in a register. */ - -extern void dwarf2out_return_reg (const char *, unsigned); - -/* Entry point for saving the first register into the second. */ - -extern void dwarf2out_reg_save_reg (const char *, rtx, rtx); - -/* In tree-inline.c */ - -/* The type of a set of already-visited pointers. Functions for creating - and manipulating it are declared in pointer-set.h */ -struct pointer_set_t; - -/* The type of a callback function for walking over tree structure. */ - -typedef tree (*walk_tree_fn) (tree *, int *, void *); - -/* The type of a callback function that represents a custom walk_tree. */ - -typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *), - void *, struct pointer_set_t*); - -extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*, +extern bool virtual_method_call_p (const_tree); +extern tree obj_type_ref_class (const_tree ref); +extern bool types_same_for_odr (const_tree type1, const_tree type2, + bool strict=false); +extern bool contains_bitfld_component_ref_p (const_tree); +extern bool block_may_fallthru (const_tree); +extern void using_eh_for_cleanups (void); +extern bool using_eh_for_cleanups_p (void); +extern const char *get_tree_code_name (enum tree_code); +extern void set_call_expr_flags (tree, int); +extern tree walk_tree_1 (tree*, walk_tree_fn, void*, hash_set<tree>*, walk_tree_lh); extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*, walk_tree_lh); @@ -5473,156 +4754,115 @@ #define walk_tree_without_duplicates(a,b,c) \ walk_tree_without_duplicates_1 (a, b, c, NULL) -/* In emit-rtl.c */ -/* Assign the RTX to declaration. */ - -extern void set_decl_rtl (tree, rtx); -extern void set_decl_incoming_rtl (tree, rtx, bool); - -/* Enum and arrays used for tree allocation stats. - Keep in sync with tree.c:tree_node_kind_names. */ -typedef enum -{ - d_kind, - t_kind, - b_kind, - s_kind, - r_kind, - e_kind, - c_kind, - id_kind, - vec_kind, - binfo_kind, - ssa_name_kind, - constr_kind, - x_kind, - lang_decl, - lang_type, - omp_clause_kind, - all_kinds -} tree_node_kind; - -extern int tree_node_counts[]; -extern int tree_node_sizes[]; - -/* True if we are in gimple form and the actions of the folders need to - be restricted. False if we are not in gimple form and folding is not - restricted to creating gimple expressions. */ -extern bool in_gimple_form; - -/* In gimple.c. */ +extern tree drop_tree_overflow (tree); + +/* Given a memory reference expression T, return its base address. + The base address of a memory reference expression is the main + object being referenced. */ extern tree get_base_address (tree t); -extern void mark_addressable (tree); - -/* In tree.c. */ - -struct GTY(()) tree_map_base { - tree from; -}; + +/* Return a tree of sizetype representing the size, in bytes, of the element + of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ +extern tree array_ref_element_size (tree); + +/* Return a tree representing the upper bound of the array mentioned in + EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ +extern tree array_ref_up_bound (tree); + +/* Return a tree representing the lower bound of the array mentioned in + EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ +extern tree array_ref_low_bound (tree); + +/* Returns true if REF is an array reference or a component reference + to an array at the end of a structure. If this is the case, the array + may be allocated larger than its upper bound implies. */ +extern bool array_at_struct_end_p (tree); + +/* Return a tree representing the offset, in bytes, of the field referenced + by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */ +extern tree component_ref_field_offset (tree); extern int tree_map_base_eq (const void *, const void *); extern unsigned int tree_map_base_hash (const void *); extern int tree_map_base_marked_p (const void *); -extern bool list_equal_p (const_tree, const_tree); - -/* Map from a tree to another tree. */ - -struct GTY(()) tree_map { - struct tree_map_base base; - unsigned int hash; - tree to; -}; +extern void DEBUG_FUNCTION verify_type (const_tree t); +extern bool gimple_canonical_types_compatible_p (const_tree, const_tree, + bool trust_type_canonical = true); +extern bool type_with_interoperable_signedness (const_tree); +extern bitmap get_nonnull_args (const_tree); +extern int get_range_pos_neg (tree); + +/* Return simplified tree code of type that is used for canonical type + merging. */ +inline enum tree_code +tree_code_for_canonical_type_merging (enum tree_code code) +{ + /* By C standard, each enumerated type shall be compatible with char, + a signed integer, or an unsigned integer. The choice of type is + implementation defined (in our case it depends on -fshort-enum). + + For this reason we make no distinction between ENUMERAL_TYPE and INTEGER + type and compare only by their signedness and precision. */ + if (code == ENUMERAL_TYPE) + return INTEGER_TYPE; + /* To allow inter-operability between languages having references and + C, we consider reference types and pointers alike. Note that this is + not strictly necessary for C-Fortran 2008 interoperability because + Fortran define C_PTR type that needs to be compatible with C pointers + and we handle this one as ptr_type_node. */ + if (code == REFERENCE_TYPE) + return POINTER_TYPE; + return code; +} + +/* Return ture if get_alias_set care about TYPE_CANONICAL of given type. + We don't define the types for pointers, arrays and vectors. The reason is + that pointers are handled specially: ptr_type_node accesses conflict with + accesses to all other pointers. This is done by alias.c. + Because alias sets of arrays and vectors are the same as types of their + elements, we can't compute canonical type either. Otherwise we could go + form void *[10] to int *[10] (because they are equivalent for canonical type + machinery) and get wrong TBAA. */ + +inline bool +canonical_type_used_p (const_tree t) +{ + return !(POINTER_TYPE_P (t) + || TREE_CODE (t) == ARRAY_TYPE + || TREE_CODE (t) == VECTOR_TYPE); +} #define tree_map_eq tree_map_base_eq extern unsigned int tree_map_hash (const void *); #define tree_map_marked_p tree_map_base_marked_p -/* Map from a decl tree to another tree. */ - -struct GTY(()) tree_decl_map { - struct tree_map_base base; - tree to; -}; - #define tree_decl_map_eq tree_map_base_eq extern unsigned int tree_decl_map_hash (const void *); #define tree_decl_map_marked_p tree_map_base_marked_p -/* Map from a tree to an int. */ - -struct GTY(()) tree_int_map { - struct tree_map_base base; - unsigned int to; +struct tree_decl_map_cache_hasher : ggc_cache_ptr_hash<tree_decl_map> +{ + static hashval_t hash (tree_decl_map *m) { return tree_decl_map_hash (m); } + static bool + equal (tree_decl_map *a, tree_decl_map *b) + { + return tree_decl_map_eq (a, b); + } + + static int + keep_cache_entry (tree_decl_map *&m) + { + return ggc_marked_p (m->base.from); + } }; #define tree_int_map_eq tree_map_base_eq #define tree_int_map_hash tree_map_base_hash #define tree_int_map_marked_p tree_map_base_marked_p -/* Map from a tree to initialization/finalization priorities. */ - -struct GTY(()) tree_priority_map { - struct tree_map_base base; - priority_type init; - priority_type fini; -}; - -#define tree_priority_map_eq tree_map_base_eq -#define tree_priority_map_hash tree_map_base_hash -#define tree_priority_map_marked_p tree_map_base_marked_p - -/* In tree-ssa.c */ - -tree target_for_debug_bind (tree); - -/* In tree-ssa-address.c. */ -extern tree tree_mem_ref_addr (tree, tree); -extern void copy_mem_ref_info (tree, tree); - -/* In tree-vrp.c */ -extern bool ssa_name_nonnegative_p (const_tree); - -/* In tree-object-size.c. */ -extern void init_object_sizes (void); -extern void fini_object_sizes (void); -extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int); - -/* In expr.c. */ -extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree); -extern tree build_personality_function (const char *); - -/* In tree-inline.c. */ - -void init_inline_once (void); - -/* Compute the number of operands in an expression node NODE. For - tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself, - otherwise it is looked up from the node's code. */ -static inline int -tree_operand_length (const_tree node) -{ - if (VL_EXP_CLASS_P (node)) - return VL_EXP_OPERAND_LENGTH (node); - else - return TREE_CODE_LENGTH (TREE_CODE (node)); -} - -/* Abstract iterators for CALL_EXPRs. These static inline definitions - have to go towards the end of tree.h so that union tree_node is fully - defined by this point. */ - -/* Structure containing iterator state. */ -typedef struct call_expr_arg_iterator_d { - tree t; /* the call_expr */ - int n; /* argument count */ - int i; /* next argument index */ -} call_expr_arg_iterator; - -typedef struct const_call_expr_arg_iterator_d { - const_tree t; /* the call_expr */ - int n; /* argument count */ - int i; /* next argument index */ -} const_call_expr_arg_iterator; +#define tree_vec_map_eq tree_map_base_eq +#define tree_vec_map_hash tree_decl_map_hash +#define tree_vec_map_marked_p tree_map_base_marked_p /* Initialize the abstract argument list iterator object ITER with the arguments from CALL_EXPR node EXP. */ @@ -5692,12 +4932,6 @@ return (iter->i < iter->n); } -static inline bool -more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter) -{ - return (iter->i < iter->n); -} - /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER (of type call_expr_arg_iterator) to hold the iteration state. */ #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \ @@ -5710,12 +4944,540 @@ /* Return true if tree node T is a language-specific node. */ static inline bool -is_lang_specific (tree t) +is_lang_specific (const_tree t) { return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES; } -/* In gimple-low.c. */ -extern bool block_may_fallthru (const_tree); +/* Valid builtin number. */ +#define BUILTIN_VALID_P(FNCODE) \ + (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1)) + +/* Return the tree node for an explicit standard builtin function or NULL. */ +static inline tree +builtin_decl_explicit (enum built_in_function fncode) +{ + gcc_checking_assert (BUILTIN_VALID_P (fncode)); + + return builtin_info[(size_t)fncode].decl; +} + +/* Return the tree node for an implicit builtin function or NULL. */ +static inline tree +builtin_decl_implicit (enum built_in_function fncode) +{ + size_t uns_fncode = (size_t)fncode; + gcc_checking_assert (BUILTIN_VALID_P (fncode)); + + if (!builtin_info[uns_fncode].implicit_p) + return NULL_TREE; + + return builtin_info[uns_fncode].decl; +} + +/* Set explicit builtin function nodes and whether it is an implicit + function. */ + +static inline void +set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p) +{ + size_t ufncode = (size_t)fncode; + + gcc_checking_assert (BUILTIN_VALID_P (fncode) + && (decl != NULL_TREE || !implicit_p)); + + builtin_info[ufncode].decl = decl; + builtin_info[ufncode].implicit_p = implicit_p; + builtin_info[ufncode].declared_p = false; +} + +/* Set the implicit flag for a builtin function. */ + +static inline void +set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p) +{ + size_t uns_fncode = (size_t)fncode; + + gcc_checking_assert (BUILTIN_VALID_P (fncode) + && builtin_info[uns_fncode].decl != NULL_TREE); + + builtin_info[uns_fncode].implicit_p = implicit_p; +} + +/* Set the declared flag for a builtin function. */ + +static inline void +set_builtin_decl_declared_p (enum built_in_function fncode, bool declared_p) +{ + size_t uns_fncode = (size_t)fncode; + + gcc_checking_assert (BUILTIN_VALID_P (fncode) + && builtin_info[uns_fncode].decl != NULL_TREE); + + builtin_info[uns_fncode].declared_p = declared_p; +} + +/* Return whether the standard builtin function can be used as an explicit + function. */ + +static inline bool +builtin_decl_explicit_p (enum built_in_function fncode) +{ + gcc_checking_assert (BUILTIN_VALID_P (fncode)); + return (builtin_info[(size_t)fncode].decl != NULL_TREE); +} + +/* Return whether the standard builtin function can be used implicitly. */ + +static inline bool +builtin_decl_implicit_p (enum built_in_function fncode) +{ + size_t uns_fncode = (size_t)fncode; + + gcc_checking_assert (BUILTIN_VALID_P (fncode)); + return (builtin_info[uns_fncode].decl != NULL_TREE + && builtin_info[uns_fncode].implicit_p); +} + +/* Return whether the standard builtin function was declared. */ + +static inline bool +builtin_decl_declared_p (enum built_in_function fncode) +{ + size_t uns_fncode = (size_t)fncode; + + gcc_checking_assert (BUILTIN_VALID_P (fncode)); + return (builtin_info[uns_fncode].decl != NULL_TREE + && builtin_info[uns_fncode].declared_p); +} + +/* Return true if T (assumed to be a DECL) is a global variable. + A variable is considered global if its storage is not automatic. */ + +static inline bool +is_global_var (const_tree t) +{ + return (TREE_STATIC (t) || DECL_EXTERNAL (t)); +} + +/* Return true if VAR may be aliased. A variable is considered as + maybe aliased if it has its address taken by the local TU + or possibly by another TU and might be modified through a pointer. */ + +static inline bool +may_be_aliased (const_tree var) +{ + return (TREE_CODE (var) != CONST_DECL + && (TREE_PUBLIC (var) + || DECL_EXTERNAL (var) + || TREE_ADDRESSABLE (var)) + && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var)) + && ((TREE_READONLY (var) + && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var))) + || (TREE_CODE (var) == VAR_DECL + && DECL_NONALIASED (var))))); +} + +/* Return pointer to optimization flags of FNDECL. */ +static inline struct cl_optimization * +opts_for_fn (const_tree fndecl) +{ + tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl); + if (fn_opts == NULL_TREE) + fn_opts = optimization_default_node; + return TREE_OPTIMIZATION (fn_opts); +} + +/* Return pointer to target flags of FNDECL. */ +static inline cl_target_option * +target_opts_for_fn (const_tree fndecl) +{ + tree fn_opts = DECL_FUNCTION_SPECIFIC_TARGET (fndecl); + if (fn_opts == NULL_TREE) + fn_opts = target_option_default_node; + return fn_opts == NULL_TREE ? NULL : TREE_TARGET_OPTION (fn_opts); +} + +/* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is + the optimization level of function fndecl. */ +#define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt) + +/* For anonymous aggregate types, we need some sort of name to + hold on to. In practice, this should not appear, but it should + not be harmful if it does. */ +extern const char *anon_aggrname_format(); +extern bool anon_aggrname_p (const_tree); + +/* The tree and const_tree overload templates. */ +namespace wi +{ + template <int N> + class extended_tree + { + private: + const_tree m_t; + + public: + extended_tree (const_tree); + + unsigned int get_precision () const; + const HOST_WIDE_INT *get_val () const; + unsigned int get_len () const; + }; + + template <int N> + struct int_traits <extended_tree <N> > + { + static const enum precision_type precision_type = CONST_PRECISION; + static const bool host_dependent_precision = false; + static const bool is_sign_extended = true; + static const unsigned int precision = N; + }; + + typedef const generic_wide_int <extended_tree <WIDE_INT_MAX_PRECISION> > + tree_to_widest_ref; + typedef const generic_wide_int <extended_tree <ADDR_MAX_PRECISION> > + tree_to_offset_ref; + typedef const generic_wide_int<wide_int_ref_storage<false, false> > + tree_to_wide_ref; + + tree_to_widest_ref to_widest (const_tree); + tree_to_offset_ref to_offset (const_tree); + tree_to_wide_ref to_wide (const_tree); + wide_int to_wide (const_tree, unsigned int); +} + +/* Refer to INTEGER_CST T as though it were a widest_int. + + This function gives T's actual numerical value, influenced by the + signedness of its type. For example, a signed byte with just the + top bit set would be -128 while an unsigned byte with the same + bit pattern would be 128. + + This is the right choice when operating on groups of INTEGER_CSTs + that might have different signedness or precision. It is also the + right choice in code that specifically needs an approximation of + infinite-precision arithmetic instead of normal modulo arithmetic. + + The approximation of infinite precision is good enough for realistic + numbers of additions and subtractions of INTEGER_CSTs (where + "realistic" includes any number less than 1 << 31) but it cannot + represent the result of multiplying the two largest supported + INTEGER_CSTs. The overflow-checking form of wi::mul provides a way + of multiplying two arbitrary INTEGER_CSTs and checking that the + result is representable as a widest_int. + + Note that any overflow checking done on these values is relative to + the range of widest_int rather than the range of a TREE_TYPE. + + Calling this function should have no overhead in release builds, + so it is OK to call it several times for the same tree. If it is + useful for readability reasons to reduce the number of calls, + it is more efficient to use: + + wi::tree_to_widest_ref wt = wi::to_widest (t); + + instead of: + + widest_int wt = wi::to_widest (t). */ + +inline wi::tree_to_widest_ref +wi::to_widest (const_tree t) +{ + return t; +} + +/* Refer to INTEGER_CST T as though it were an offset_int. + + This function is an optimisation of wi::to_widest for cases + in which T is known to be a bit or byte count in the range + (-(2 ^ (N + BITS_PER_UNIT)), 2 ^ (N + BITS_PER_UNIT)), where N is + the target's address size in bits. + + This is the right choice when operating on bit or byte counts as + untyped numbers rather than M-bit values. The wi::to_widest comments + about addition, subtraction and multiplication apply here: sequences + of 1 << 31 additions and subtractions do not induce overflow, but + multiplying the largest sizes might. Again, + + wi::tree_to_offset_ref wt = wi::to_offset (t); + + is more efficient than: + + offset_int wt = wi::to_offset (t). */ + +inline wi::tree_to_offset_ref +wi::to_offset (const_tree t) +{ + return t; +} + +/* Refer to INTEGER_CST T as though it were a wide_int. + + In contrast to the approximation of infinite-precision numbers given + by wi::to_widest and wi::to_offset, this function treats T as a + signless collection of N bits, where N is the precision of T's type. + As with machine registers, signedness is determined by the operation + rather than the operands; for example, there is a distinction between + signed and unsigned division. + + This is the right choice when operating on values with the same type + using normal modulo arithmetic. The overflow-checking forms of things + like wi::add check whether the result can be represented in T's type. + + Calling this function should have no overhead in release builds, + so it is OK to call it several times for the same tree. If it is + useful for readability reasons to reduce the number of calls, + it is more efficient to use: + + wi::tree_to_wide_ref wt = wi::to_wide (t); + + instead of: + + wide_int wt = wi::to_wide (t). */ + +inline wi::tree_to_wide_ref +wi::to_wide (const_tree t) +{ + return wi::storage_ref (&TREE_INT_CST_ELT (t, 0), TREE_INT_CST_NUNITS (t), + TYPE_PRECISION (TREE_TYPE (t))); +} + +/* Convert INTEGER_CST T to a wide_int of precision PREC, extending or + truncating as necessary. When extending, use sign extension if T's + type is signed and zero extension if T's type is unsigned. */ + +inline wide_int +wi::to_wide (const_tree t, unsigned int prec) +{ + return wide_int::from (wi::to_wide (t), prec, TYPE_SIGN (TREE_TYPE (t))); +} + +template <int N> +inline wi::extended_tree <N>::extended_tree (const_tree t) + : m_t (t) +{ + gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t)) <= N); +} + +template <int N> +inline unsigned int +wi::extended_tree <N>::get_precision () const +{ + return N; +} + +template <int N> +inline const HOST_WIDE_INT * +wi::extended_tree <N>::get_val () const +{ + return &TREE_INT_CST_ELT (m_t, 0); +} + +template <int N> +inline unsigned int +wi::extended_tree <N>::get_len () const +{ + if (N == ADDR_MAX_PRECISION) + return TREE_INT_CST_OFFSET_NUNITS (m_t); + else if (N >= WIDE_INT_MAX_PRECISION) + return TREE_INT_CST_EXT_NUNITS (m_t); + else + /* This class is designed to be used for specific output precisions + and needs to be as fast as possible, so there is no fallback for + other casees. */ + gcc_unreachable (); +} + +namespace wi +{ + template <typename T> + bool fits_to_boolean_p (const T &x, const_tree); + + template <typename T> + bool fits_to_tree_p (const T &x, const_tree); + + wide_int min_value (const_tree); + wide_int max_value (const_tree); + wide_int from_mpz (const_tree, mpz_t, bool); +} + +template <typename T> +bool +wi::fits_to_boolean_p (const T &x, const_tree type) +{ + return eq_p (x, 0) || eq_p (x, TYPE_UNSIGNED (type) ? 1 : -1); +} + +template <typename T> +bool +wi::fits_to_tree_p (const T &x, const_tree type) +{ + /* Non-standard boolean types can have arbitrary precision but various + transformations assume that they can only take values 0 and +/-1. */ + if (TREE_CODE (type) == BOOLEAN_TYPE) + return fits_to_boolean_p (x, type); + + if (TYPE_UNSIGNED (type)) + return eq_p (x, zext (x, TYPE_PRECISION (type))); + else + return eq_p (x, sext (x, TYPE_PRECISION (type))); +} + +/* Produce the smallest number that is represented in TYPE. The precision + and sign are taken from TYPE. */ +inline wide_int +wi::min_value (const_tree type) +{ + return min_value (TYPE_PRECISION (type), TYPE_SIGN (type)); +} + +/* Produce the largest number that is represented in TYPE. The precision + and sign are taken from TYPE. */ +inline wide_int +wi::max_value (const_tree type) +{ + return max_value (TYPE_PRECISION (type), TYPE_SIGN (type)); +} + +/* Return true if INTEGER_CST T1 is less than INTEGER_CST T2, + extending both according to their respective TYPE_SIGNs. */ + +inline bool +tree_int_cst_lt (const_tree t1, const_tree t2) +{ + return wi::to_widest (t1) < wi::to_widest (t2); +} + +/* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2, + extending both according to their respective TYPE_SIGNs. */ + +inline bool +tree_int_cst_le (const_tree t1, const_tree t2) +{ + return wi::to_widest (t1) <= wi::to_widest (t2); +} + +/* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2 + are both INTEGER_CSTs and their values are extended according to their + respective TYPE_SIGNs. */ + +inline int +tree_int_cst_compare (const_tree t1, const_tree t2) +{ + return wi::cmps (wi::to_widest (t1), wi::to_widest (t2)); +} + +/* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h, + but none of these files are allowed to be included from front ends. + They should be split in two. One suitable for the FEs, the other suitable + for the BE. */ + +/* Assign the RTX to declaration. */ +extern void set_decl_rtl (tree, rtx); +extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree); + +/* Given an expression EXP that is a handled_component_p, + look for the ultimate containing object, which is returned and specify + the access position and size. */ +extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *, + tree *, machine_mode *, int *, int *, int *); + +extern tree build_personality_function (const char *); + +struct GTY(()) int_n_trees_t { + /* These parts are initialized at runtime */ + tree signed_type; + tree unsigned_type; +}; + +/* This is also in machmode.h */ +extern bool int_n_enabled_p[NUM_INT_N_ENTS]; +extern GTY(()) struct int_n_trees_t int_n_trees[NUM_INT_N_ENTS]; + +/* Like bit_position, but return as an integer. It must be representable in + that way (since it could be a signed value, we don't have the + option of returning -1 like int_size_in_byte can. */ + +inline HOST_WIDE_INT +int_bit_position (const_tree field) +{ + return ((wi::to_offset (DECL_FIELD_OFFSET (field)) << LOG2_BITS_PER_UNIT) + + wi::to_offset (DECL_FIELD_BIT_OFFSET (field))).to_shwi (); +} + +/* Return true if it makes sense to consider alias set for a type T. */ + +inline bool +type_with_alias_set_p (const_tree t) +{ + /* Function and method types are never accessed as memory locations. */ + if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE) + return false; + + if (COMPLETE_TYPE_P (t)) + return true; + + /* Incomplete types can not be accessed in general except for arrays + where we can fetch its element despite we have no array bounds. */ + if (TREE_CODE (t) == ARRAY_TYPE && COMPLETE_TYPE_P (TREE_TYPE (t))) + return true; + + return false; +} + +extern location_t set_block (location_t loc, tree block); + +extern void gt_ggc_mx (tree &); +extern void gt_pch_nx (tree &); +extern void gt_pch_nx (tree &, gt_pointer_operator, void *); + +extern bool nonnull_arg_p (const_tree); +extern bool is_redundant_typedef (const_tree); + +extern location_t +set_source_range (tree expr, location_t start, location_t finish); + +extern location_t +set_source_range (tree expr, source_range src_range); + +static inline source_range +get_decl_source_range (tree decl) +{ + location_t loc = DECL_SOURCE_LOCATION (decl); + return get_range_from_loc (line_table, loc); +} + +/* Return true if it makes sense to promote/demote from_type to to_type. */ +inline bool +desired_pro_or_demotion_p (const_tree to_type, const_tree from_type) +{ + unsigned int to_type_precision = TYPE_PRECISION (to_type); + + /* OK to promote if to_type is no bigger than word_mode. */ + if (to_type_precision <= GET_MODE_PRECISION (word_mode)) + return true; + + /* Otherwise, allow only if narrowing or same precision conversions. */ + return to_type_precision <= TYPE_PRECISION (from_type); +} + +/* Pointer type used to declare builtins before we have seen its real + declaration. */ +struct builtin_structptr_type +{ + tree& node; + tree& base; + const char *str; +}; +extern const builtin_structptr_type builtin_structptr_types[6]; + +/* Return true if type T has the same precision as its underlying mode. */ + +inline bool +type_has_mode_precision_p (const_tree t) +{ + return TYPE_PRECISION (t) == GET_MODE_PRECISION (TYPE_MODE (t)); +} #endif /* GCC_TREE_H */