1 /* Definitions for the ubiquitous 'tree' type for GNU compilers. 2 Copyright (C) 1989-2018 Free Software Foundation, Inc. 3 4 This file is part of GCC. 5 6 GCC is free software; you can redistribute it and/or modify it under 7 the terms of the GNU General Public License as published by the Free 8 Software Foundation; either version 3, or (at your option) any later 9 version. 10 11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY 12 WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 for more details. 15 16 You should have received a copy of the GNU General Public License 17 along with GCC; see the file COPYING3. If not see 18 <http://www.gnu.org/licenses/>. */ 19 20 #ifndef GCC_TREE_H 21 #define GCC_TREE_H 22 23 #include "tree-core.h" 24 25 /* Convert a target-independent built-in function code to a combined_fn. */ 26 27 inline combined_fn 28 as_combined_fn (built_in_function fn) 29 { 30 return combined_fn (int (fn)); 31 } 32 33 /* Convert an internal function code to a combined_fn. */ 34 35 inline combined_fn 36 as_combined_fn (internal_fn fn) 37 { 38 return combined_fn (int (fn) + int (END_BUILTINS)); 39 } 40 41 /* Return true if CODE is a target-independent built-in function. */ 42 43 inline bool 44 builtin_fn_p (combined_fn code) 45 { 46 return int (code) < int (END_BUILTINS); 47 } 48 49 /* Return the target-independent built-in function represented by CODE. 50 Only valid if builtin_fn_p (CODE). */ 51 52 inline built_in_function 53 as_builtin_fn (combined_fn code) 54 { 55 gcc_checking_assert (builtin_fn_p (code)); 56 return built_in_function (int (code)); 57 } 58 59 /* Return true if CODE is an internal function. */ 60 61 inline bool 62 internal_fn_p (combined_fn code) 63 { 64 return int (code) >= int (END_BUILTINS); 65 } 66 67 /* Return the internal function represented by CODE. Only valid if 68 internal_fn_p (CODE). */ 69 70 inline internal_fn 71 as_internal_fn (combined_fn code) 72 { 73 gcc_checking_assert (internal_fn_p (code)); 74 return internal_fn (int (code) - int (END_BUILTINS)); 75 } 76 77 /* Macros for initializing `tree_contains_struct'. */ 78 #define MARK_TS_BASE(C) \ 79 (tree_contains_struct[C][TS_BASE] = true) 80 81 #define MARK_TS_TYPED(C) \ 82 (MARK_TS_BASE (C), \ 83 tree_contains_struct[C][TS_TYPED] = true) 84 85 #define MARK_TS_COMMON(C) \ 86 (MARK_TS_TYPED (C), \ 87 tree_contains_struct[C][TS_COMMON] = true) 88 89 #define MARK_TS_TYPE_COMMON(C) \ 90 (MARK_TS_COMMON (C), \ 91 tree_contains_struct[C][TS_TYPE_COMMON] = true) 92 93 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \ 94 (MARK_TS_TYPE_COMMON (C), \ 95 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = true) 96 97 #define MARK_TS_DECL_MINIMAL(C) \ 98 (MARK_TS_COMMON (C), \ 99 tree_contains_struct[C][TS_DECL_MINIMAL] = true) 100 101 #define MARK_TS_DECL_COMMON(C) \ 102 (MARK_TS_DECL_MINIMAL (C), \ 103 tree_contains_struct[C][TS_DECL_COMMON] = true) 104 105 #define MARK_TS_DECL_WRTL(C) \ 106 (MARK_TS_DECL_COMMON (C), \ 107 tree_contains_struct[C][TS_DECL_WRTL] = true) 108 109 #define MARK_TS_DECL_WITH_VIS(C) \ 110 (MARK_TS_DECL_WRTL (C), \ 111 tree_contains_struct[C][TS_DECL_WITH_VIS] = true) 112 113 #define MARK_TS_DECL_NON_COMMON(C) \ 114 (MARK_TS_DECL_WITH_VIS (C), \ 115 tree_contains_struct[C][TS_DECL_NON_COMMON] = true) 116 117 /* Returns the string representing CLASS. */ 118 119 #define TREE_CODE_CLASS_STRING(CLASS)\ 120 tree_code_class_strings[(int) (CLASS)] 121 122 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] 123 124 /* Nonzero if NODE represents an exceptional code. */ 125 126 #define EXCEPTIONAL_CLASS_P(NODE)\ 127 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional) 128 129 /* Nonzero if NODE represents a constant. */ 130 131 #define CONSTANT_CLASS_P(NODE)\ 132 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant) 133 134 /* Nonzero if NODE represents a type. */ 135 136 #define TYPE_P(NODE)\ 137 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type) 138 139 /* Nonzero if NODE represents a declaration. */ 140 141 #define DECL_P(NODE)\ 142 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration) 143 144 /* True if NODE designates a variable declaration. */ 145 #define VAR_P(NODE) \ 146 (TREE_CODE (NODE) == VAR_DECL) 147 148 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */ 149 150 #define VAR_OR_FUNCTION_DECL_P(DECL)\ 151 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL) 152 153 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in 154 ascending code order. */ 155 156 #define INDIRECT_REF_P(NODE)\ 157 (TREE_CODE (NODE) == INDIRECT_REF) 158 159 /* Nonzero if NODE represents a reference. */ 160 161 #define REFERENCE_CLASS_P(NODE)\ 162 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference) 163 164 /* Nonzero if NODE represents a comparison. */ 165 166 #define COMPARISON_CLASS_P(NODE)\ 167 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison) 168 169 /* Nonzero if NODE represents a unary arithmetic expression. */ 170 171 #define UNARY_CLASS_P(NODE)\ 172 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary) 173 174 /* Nonzero if NODE represents a binary arithmetic expression. */ 175 176 #define BINARY_CLASS_P(NODE)\ 177 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary) 178 179 /* Nonzero if NODE represents a statement expression. */ 180 181 #define STATEMENT_CLASS_P(NODE)\ 182 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement) 183 184 /* Nonzero if NODE represents a function call-like expression with a 185 variable-length operand vector. */ 186 187 #define VL_EXP_CLASS_P(NODE)\ 188 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp) 189 190 /* Nonzero if NODE represents any other expression. */ 191 192 #define EXPRESSION_CLASS_P(NODE)\ 193 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression) 194 195 /* Returns nonzero iff NODE represents a type or declaration. */ 196 197 #define IS_TYPE_OR_DECL_P(NODE)\ 198 (TYPE_P (NODE) || DECL_P (NODE)) 199 200 /* Returns nonzero iff CLASS is the tree-code class of an 201 expression. */ 202 203 #define IS_EXPR_CODE_CLASS(CLASS)\ 204 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression) 205 206 /* Returns nonzero iff NODE is an expression of some kind. */ 207 208 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) 209 210 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] 211 212 213 /* Helper macros for math builtins. */ 214 215 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L 216 #define CASE_FLT_FN_FLOATN_NX(FN) \ 217 case FN##F16: case FN##F32: case FN##F64: case FN##F128: \ 218 case FN##F32X: case FN##F64X: case FN##F128X 219 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R 220 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX 221 222 #define NULL_TREE (tree) NULL 223 224 /* Define accessors for the fields that all tree nodes have 225 (though some fields are not used for all kinds of nodes). */ 226 227 /* The tree-code says what kind of node it is. 228 Codes are defined in tree.def. */ 229 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code) 230 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE)) 231 232 /* When checking is enabled, errors will be generated if a tree node 233 is accessed incorrectly. The macros die with a fatal error. */ 234 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) 235 236 #define TREE_CHECK(T, CODE) \ 237 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE))) 238 239 #define TREE_NOT_CHECK(T, CODE) \ 240 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE))) 241 242 #define TREE_CHECK2(T, CODE1, CODE2) \ 243 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2))) 244 245 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \ 246 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2))) 247 248 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \ 249 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3))) 250 251 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \ 252 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \ 253 (CODE1), (CODE2), (CODE3))) 254 255 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \ 256 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \ 257 (CODE1), (CODE2), (CODE3), (CODE4))) 258 259 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \ 260 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \ 261 (CODE1), (CODE2), (CODE3), (CODE4))) 262 263 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \ 264 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \ 265 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5))) 266 267 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \ 268 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \ 269 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5))) 270 271 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \ 272 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__)) 273 274 #define TREE_CLASS_CHECK(T, CLASS) \ 275 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__)) 276 277 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \ 278 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__)) 279 280 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \ 281 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__)) 282 283 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \ 284 (omp_clause_range_check ((T), (CODE1), (CODE2), \ 285 __FILE__, __LINE__, __FUNCTION__)) 286 287 /* These checks have to be special cased. */ 288 #define EXPR_CHECK(T) \ 289 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__)) 290 291 /* These checks have to be special cased. */ 292 #define NON_TYPE_CHECK(T) \ 293 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__)) 294 295 /* These checks have to be special cased. */ 296 #define ANY_INTEGRAL_TYPE_CHECK(T) \ 297 (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__)) 298 299 #define TREE_INT_CST_ELT_CHECK(T, I) \ 300 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)) 301 302 #define TREE_VEC_ELT_CHECK(T, I) \ 303 (*(CONST_CAST2 (tree *, typeof (T)*, \ 304 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))) 305 306 #define OMP_CLAUSE_ELT_CHECK(T, I) \ 307 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))) 308 309 /* Special checks for TREE_OPERANDs. */ 310 #define TREE_OPERAND_CHECK(T, I) \ 311 (*(CONST_CAST2 (tree*, typeof (T)*, \ 312 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))) 313 314 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \ 315 (*(tree_operand_check_code ((T), (CODE), (I), \ 316 __FILE__, __LINE__, __FUNCTION__))) 317 318 /* Nodes are chained together for many purposes. 319 Types are chained together to record them for being output to the debugger 320 (see the function `chain_type'). 321 Decls in the same scope are chained together to record the contents 322 of the scope. 323 Statement nodes for successive statements used to be chained together. 324 Often lists of things are represented by TREE_LIST nodes that 325 are chained together. */ 326 327 #define TREE_CHAIN(NODE) \ 328 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain) 329 330 /* In all nodes that are expressions, this is the data type of the expression. 331 In POINTER_TYPE nodes, this is the type that the pointer points to. 332 In ARRAY_TYPE nodes, this is the type of the elements. 333 In VECTOR_TYPE nodes, this is the type of the elements. */ 334 #define TREE_TYPE(NODE) \ 335 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type) 336 337 extern void tree_contains_struct_check_failed (const_tree, 338 const enum tree_node_structure_enum, 339 const char *, int, const char *) 340 ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 341 342 extern void tree_check_failed (const_tree, const char *, int, const char *, 343 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 344 extern void tree_not_check_failed (const_tree, const char *, int, const char *, 345 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 346 extern void tree_class_check_failed (const_tree, const enum tree_code_class, 347 const char *, int, const char *) 348 ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 349 extern void tree_range_check_failed (const_tree, const char *, int, 350 const char *, enum tree_code, 351 enum tree_code) 352 ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 353 extern void tree_not_class_check_failed (const_tree, 354 const enum tree_code_class, 355 const char *, int, const char *) 356 ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 357 extern void tree_int_cst_elt_check_failed (int, int, const char *, 358 int, const char *) 359 ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 360 extern void tree_vec_elt_check_failed (int, int, const char *, 361 int, const char *) 362 ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 363 extern void phi_node_elt_check_failed (int, int, const char *, 364 int, const char *) 365 ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 366 extern void tree_operand_check_failed (int, const_tree, 367 const char *, int, const char *) 368 ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 369 extern void omp_clause_check_failed (const_tree, const char *, int, 370 const char *, enum omp_clause_code) 371 ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 372 extern void omp_clause_operand_check_failed (int, const_tree, const char *, 373 int, const char *) 374 ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 375 extern void omp_clause_range_check_failed (const_tree, const char *, int, 376 const char *, enum omp_clause_code, 377 enum omp_clause_code) 378 ATTRIBUTE_NORETURN ATTRIBUTE_COLD; 379 380 #else /* not ENABLE_TREE_CHECKING, or not gcc */ 381 382 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T) 383 #define TREE_CHECK(T, CODE) (T) 384 #define TREE_NOT_CHECK(T, CODE) (T) 385 #define TREE_CHECK2(T, CODE1, CODE2) (T) 386 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T) 387 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T) 388 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T) 389 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) 390 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) 391 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) 392 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) 393 #define TREE_CLASS_CHECK(T, CODE) (T) 394 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T) 395 #define EXPR_CHECK(T) (T) 396 #define NON_TYPE_CHECK(T) (T) 397 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I]) 398 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I]) 399 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I]) 400 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I]) 401 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i]) 402 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T) 403 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T) 404 #define ANY_INTEGRAL_TYPE_CHECK(T) (T) 405 406 #define TREE_CHAIN(NODE) ((NODE)->common.chain) 407 #define TREE_TYPE(NODE) ((NODE)->typed.type) 408 409 #endif 410 411 #define TREE_BLOCK(NODE) (tree_block (NODE)) 412 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B))) 413 414 #include "tree-check.h" 415 416 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type) 417 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL) 418 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON) 419 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL) 420 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS) 421 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON) 422 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant) 423 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement) 424 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp) 425 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE) 426 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE) 427 428 #define RECORD_OR_UNION_CHECK(T) \ 429 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) 430 #define NOT_RECORD_OR_UNION_CHECK(T) \ 431 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) 432 433 #define NUMERICAL_TYPE_CHECK(T) \ 434 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \ 435 FIXED_POINT_TYPE) 436 437 /* Here is how primitive or already-canonicalized types' hash codes 438 are made. */ 439 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE)) 440 441 /* A simple hash function for an arbitrary tree node. This must not be 442 used in hash tables which are saved to a PCH. */ 443 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777) 444 445 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */ 446 #define CONVERT_EXPR_CODE_P(CODE) \ 447 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR) 448 449 /* Similarly, but accept an expression instead of a tree code. */ 450 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP)) 451 452 /* Generate case for NOP_EXPR, CONVERT_EXPR. */ 453 454 #define CASE_CONVERT \ 455 case NOP_EXPR: \ 456 case CONVERT_EXPR 457 458 /* Given an expression as a tree, strip any conversion that generates 459 no instruction. Accepts both tree and const_tree arguments since 460 we are not modifying the tree itself. */ 461 462 #define STRIP_NOPS(EXP) \ 463 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP)) 464 465 /* Like STRIP_NOPS, but don't let the signedness change either. */ 466 467 #define STRIP_SIGN_NOPS(EXP) \ 468 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP)) 469 470 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ 471 472 #define STRIP_TYPE_NOPS(EXP) \ 473 while ((CONVERT_EXPR_P (EXP) \ 474 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ 475 && TREE_OPERAND (EXP, 0) != error_mark_node \ 476 && (TREE_TYPE (EXP) \ 477 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ 478 (EXP) = TREE_OPERAND (EXP, 0) 479 480 /* Remove unnecessary type conversions according to 481 tree_ssa_useless_type_conversion. */ 482 483 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \ 484 (EXP) = tree_ssa_strip_useless_type_conversions (EXP) 485 486 /* Remove any VIEW_CONVERT_EXPR or NON_LVALUE_EXPR that's purely 487 in use to provide a location_t. */ 488 489 #define STRIP_ANY_LOCATION_WRAPPER(EXP) \ 490 (EXP) = tree_strip_any_location_wrapper (CONST_CAST_TREE (EXP)) 491 492 /* Nonzero if TYPE represents a vector type. */ 493 494 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE) 495 496 /* Nonzero if TYPE represents a vector of booleans. */ 497 498 #define VECTOR_BOOLEAN_TYPE_P(TYPE) \ 499 (TREE_CODE (TYPE) == VECTOR_TYPE \ 500 && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE) 501 502 /* Nonzero if TYPE represents an integral type. Note that we do not 503 include COMPLEX types here. Keep these checks in ascending code 504 order. */ 505 506 #define INTEGRAL_TYPE_P(TYPE) \ 507 (TREE_CODE (TYPE) == ENUMERAL_TYPE \ 508 || TREE_CODE (TYPE) == BOOLEAN_TYPE \ 509 || TREE_CODE (TYPE) == INTEGER_TYPE) 510 511 /* Nonzero if TYPE represents an integral type, including complex 512 and vector integer types. */ 513 514 #define ANY_INTEGRAL_TYPE_P(TYPE) \ 515 (INTEGRAL_TYPE_P (TYPE) \ 516 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ 517 || VECTOR_TYPE_P (TYPE)) \ 518 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE)))) 519 520 /* Nonzero if TYPE represents a non-saturating fixed-point type. */ 521 522 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \ 523 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE)) 524 525 /* Nonzero if TYPE represents a saturating fixed-point type. */ 526 527 #define SAT_FIXED_POINT_TYPE_P(TYPE) \ 528 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE)) 529 530 /* Nonzero if TYPE represents a fixed-point type. */ 531 532 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE) 533 534 /* Nonzero if TYPE represents a scalar floating-point type. */ 535 536 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE) 537 538 /* Nonzero if TYPE represents a complex floating-point type. */ 539 540 #define COMPLEX_FLOAT_TYPE_P(TYPE) \ 541 (TREE_CODE (TYPE) == COMPLEX_TYPE \ 542 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) 543 544 /* Nonzero if TYPE represents a vector integer type. */ 545 546 #define VECTOR_INTEGER_TYPE_P(TYPE) \ 547 (VECTOR_TYPE_P (TYPE) \ 548 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE) 549 550 551 /* Nonzero if TYPE represents a vector floating-point type. */ 552 553 #define VECTOR_FLOAT_TYPE_P(TYPE) \ 554 (VECTOR_TYPE_P (TYPE) \ 555 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) 556 557 /* Nonzero if TYPE represents a floating-point type, including complex 558 and vector floating-point types. The vector and complex check does 559 not use the previous two macros to enable early folding. */ 560 561 #define FLOAT_TYPE_P(TYPE) \ 562 (SCALAR_FLOAT_TYPE_P (TYPE) \ 563 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ 564 || VECTOR_TYPE_P (TYPE)) \ 565 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE)))) 566 567 /* Nonzero if TYPE represents a decimal floating-point type. */ 568 #define DECIMAL_FLOAT_TYPE_P(TYPE) \ 569 (SCALAR_FLOAT_TYPE_P (TYPE) \ 570 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE))) 571 572 /* Nonzero if TYPE is a record or union type. */ 573 #define RECORD_OR_UNION_TYPE_P(TYPE) \ 574 (TREE_CODE (TYPE) == RECORD_TYPE \ 575 || TREE_CODE (TYPE) == UNION_TYPE \ 576 || TREE_CODE (TYPE) == QUAL_UNION_TYPE) 577 578 /* Nonzero if TYPE represents an aggregate (multi-component) type. 579 Keep these checks in ascending code order. */ 580 581 #define AGGREGATE_TYPE_P(TYPE) \ 582 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE)) 583 584 /* Nonzero if TYPE represents a pointer or reference type. 585 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in 586 ascending code order. */ 587 588 #define POINTER_TYPE_P(TYPE) \ 589 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) 590 591 /* Nonzero if TYPE represents a pointer to function. */ 592 #define FUNCTION_POINTER_TYPE_P(TYPE) \ 593 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE) 594 595 /* Nonzero if this type is a complete type. */ 596 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) 597 598 /* Nonzero if this type is a pointer bounds type. */ 599 #define POINTER_BOUNDS_TYPE_P(NODE) \ 600 (TREE_CODE (NODE) == POINTER_BOUNDS_TYPE) 601 602 /* Nonzero if this node has a pointer bounds type. */ 603 #define POINTER_BOUNDS_P(NODE) \ 604 (POINTER_BOUNDS_TYPE_P (TREE_TYPE (NODE))) 605 606 /* Nonzero if this type supposes bounds existence. */ 607 #define BOUNDED_TYPE_P(type) (POINTER_TYPE_P (type)) 608 609 /* Nonzero for objects with bounded type. */ 610 #define BOUNDED_P(node) \ 611 BOUNDED_TYPE_P (TREE_TYPE (node)) 612 613 /* Nonzero if this type is the (possibly qualified) void type. */ 614 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) 615 616 /* Nonzero if this type is complete or is cv void. */ 617 #define COMPLETE_OR_VOID_TYPE_P(NODE) \ 618 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE)) 619 620 /* Nonzero if this type is complete or is an array with unspecified bound. */ 621 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ 622 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE))) 623 624 #define FUNC_OR_METHOD_TYPE_P(NODE) \ 625 (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE) 626 627 /* Define many boolean fields that all tree nodes have. */ 628 629 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address 630 of this is needed. So it cannot be in a register. 631 In a FUNCTION_DECL it has no meaning. 632 In LABEL_DECL nodes, it means a goto for this label has been seen 633 from a place outside all binding contours that restore stack levels. 634 In an artificial SSA_NAME that points to a stack partition with at least 635 two variables, it means that at least one variable has TREE_ADDRESSABLE. 636 In ..._TYPE nodes, it means that objects of this type must be fully 637 addressable. This means that pieces of this object cannot go into 638 register parameters, for example. If this a function type, this 639 means that the value must be returned in memory. 640 In CONSTRUCTOR nodes, it means object constructed must be in memory. 641 In IDENTIFIER_NODEs, this means that some extern decl for this name 642 had its address taken. That matters for inline functions. 643 In a STMT_EXPR, it means we want the result of the enclosed expression. */ 644 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag) 645 646 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the 647 exit of a function. Calls for which this is true are candidates for tail 648 call optimizations. */ 649 #define CALL_EXPR_TAILCALL(NODE) \ 650 (CALL_EXPR_CHECK (NODE)->base.addressable_flag) 651 652 /* Set on a CALL_EXPR if the call has been marked as requiring tail call 653 optimization for correctness. */ 654 #define CALL_EXPR_MUST_TAIL_CALL(NODE) \ 655 (CALL_EXPR_CHECK (NODE)->base.static_flag) 656 657 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the 658 CASE_LOW operand has been processed. */ 659 #define CASE_LOW_SEEN(NODE) \ 660 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag) 661 662 #define PREDICT_EXPR_OUTCOME(NODE) \ 663 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag)) 664 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \ 665 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME) 666 #define PREDICT_EXPR_PREDICTOR(NODE) \ 667 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0))) 668 669 /* In a VAR_DECL, nonzero means allocate static storage. 670 In a FUNCTION_DECL, nonzero if function has been defined. 671 In a CONSTRUCTOR, nonzero means allocate static storage. */ 672 #define TREE_STATIC(NODE) ((NODE)->base.static_flag) 673 674 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */ 675 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag) 676 677 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup 678 should only be executed if an exception is thrown, not on normal exit 679 of its scope. */ 680 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag) 681 682 /* In a TRY_CATCH_EXPR, means that the handler should be considered a 683 separate cleanup in honor_protect_cleanup_actions. */ 684 #define TRY_CATCH_IS_CLEANUP(NODE) \ 685 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag) 686 687 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the 688 CASE_HIGH operand has been processed. */ 689 #define CASE_HIGH_SEEN(NODE) \ 690 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag) 691 692 /* Used to mark scoped enums. */ 693 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag) 694 695 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */ 696 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag) 697 698 /* In an expr node (usually a conversion) this means the node was made 699 implicitly and should not lead to any sort of warning. In a decl node, 700 warnings concerning the decl should be suppressed. This is used at 701 least for used-before-set warnings, and it set after one warning is 702 emitted. */ 703 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag) 704 705 /* Nonzero if we should warn about the change in empty class parameter 706 passing ABI in this TU. */ 707 #define TRANSLATION_UNIT_WARN_EMPTY_P(NODE) \ 708 (TRANSLATION_UNIT_DECL_CHECK (NODE)->decl_common.decl_flag_0) 709 710 /* Nonzero if this type is "empty" according to the particular psABI. */ 711 #define TYPE_EMPTY_P(NODE) (TYPE_CHECK (NODE)->type_common.empty_flag) 712 713 /* Used to indicate that this TYPE represents a compiler-generated entity. */ 714 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag) 715 716 /* In an IDENTIFIER_NODE, this means that assemble_name was called with 717 this string as an argument. */ 718 #define TREE_SYMBOL_REFERENCED(NODE) \ 719 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag) 720 721 /* Nonzero in a pointer or reference type means the data pointed to 722 by this type can alias anything. */ 723 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \ 724 (PTR_OR_REF_CHECK (NODE)->base.static_flag) 725 726 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means 727 there was an overflow in folding. */ 728 729 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag) 730 731 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */ 732 733 #define TREE_OVERFLOW_P(EXPR) \ 734 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR)) 735 736 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL, 737 nonzero means name is to be accessible from outside this translation unit. 738 In an IDENTIFIER_NODE, nonzero means an external declaration 739 accessible from outside this translation unit was previously seen 740 for this name in an inner scope. */ 741 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag) 742 743 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector 744 of cached values, or is something else. */ 745 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag) 746 747 /* In a SAVE_EXPR, indicates that the original expression has already 748 been substituted with a VAR_DECL that contains the value. */ 749 #define SAVE_EXPR_RESOLVED_P(NODE) \ 750 (SAVE_EXPR_CHECK (NODE)->base.public_flag) 751 752 /* Set on a CALL_EXPR if this stdarg call should be passed the argument 753 pack. */ 754 #define CALL_EXPR_VA_ARG_PACK(NODE) \ 755 (CALL_EXPR_CHECK (NODE)->base.public_flag) 756 757 /* In any expression, decl, or constant, nonzero means it has side effects or 758 reevaluation of the whole expression could produce a different value. 759 This is set if any subexpression is a function call, a side effect or a 760 reference to a volatile variable. In a ..._DECL, this is set only if the 761 declaration said `volatile'. This will never be set for a constant. */ 762 #define TREE_SIDE_EFFECTS(NODE) \ 763 (NON_TYPE_CHECK (NODE)->base.side_effects_flag) 764 765 /* In a LABEL_DECL, nonzero means this label had its address taken 766 and therefore can never be deleted and is a jump target for 767 computed gotos. */ 768 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag) 769 770 /* Whether a case or a user-defined label is allowed to fall through to. 771 This is used to implement -Wimplicit-fallthrough. */ 772 #define FALLTHROUGH_LABEL_P(NODE) \ 773 (LABEL_DECL_CHECK (NODE)->base.private_flag) 774 775 /* Set on the artificial label created for break; stmt from a switch. 776 This is used to implement -Wimplicit-fallthrough. */ 777 #define SWITCH_BREAK_LABEL_P(NODE) \ 778 (LABEL_DECL_CHECK (NODE)->base.protected_flag) 779 780 /* Nonzero means this expression is volatile in the C sense: 781 its address should be of type `volatile WHATEVER *'. 782 In other words, the declared item is volatile qualified. 783 This is used in _DECL nodes and _REF nodes. 784 On a FUNCTION_DECL node, this means the function does not 785 return normally. This is the same effect as setting 786 the attribute noreturn on the function in C. 787 788 In a ..._TYPE node, means this type is volatile-qualified. 789 But use TYPE_VOLATILE instead of this macro when the node is a type, 790 because eventually we may make that a different bit. 791 792 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ 793 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag) 794 795 /* Nonzero means this node will not trap. In an INDIRECT_REF, means 796 accessing the memory pointed to won't generate a trap. However, 797 this only applies to an object when used appropriately: it doesn't 798 mean that writing a READONLY mem won't trap. 799 800 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index 801 (or slice of the array) always belongs to the range of the array. 802 I.e. that the access will not trap, provided that the access to 803 the base to the array will not trap. */ 804 #define TREE_THIS_NOTRAP(NODE) \ 805 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \ 806 ARRAY_RANGE_REF)->base.nothrow_flag) 807 808 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, 809 nonzero means it may not be the lhs of an assignment. 810 Nonzero in a FUNCTION_DECL means this function should be treated 811 as "const" function (can only read its arguments). */ 812 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag) 813 814 /* Value of expression is constant. Always on in all ..._CST nodes. May 815 also appear in an expression or decl where the value is constant. */ 816 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag) 817 818 /* Nonzero if NODE, a type, has had its sizes gimplified. */ 819 #define TYPE_SIZES_GIMPLIFIED(NODE) \ 820 (TYPE_CHECK (NODE)->base.constant_flag) 821 822 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */ 823 #define DECL_UNSIGNED(NODE) \ 824 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag) 825 826 /* In integral and pointer types, means an unsigned type. */ 827 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag) 828 829 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */ 830 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE)) 831 832 /* True if overflow wraps around for the given integral or pointer type. That 833 is, TYPE_MAX + 1 == TYPE_MIN. */ 834 #define TYPE_OVERFLOW_WRAPS(TYPE) \ 835 (POINTER_TYPE_P (TYPE) \ 836 ? flag_wrapv_pointer \ 837 : (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \ 838 || flag_wrapv)) 839 840 /* True if overflow is undefined for the given integral or pointer type. 841 We may optimize on the assumption that values in the type never overflow. 842 843 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED 844 must issue a warning based on warn_strict_overflow. In some cases 845 it will be appropriate to issue the warning immediately, and in 846 other cases it will be appropriate to simply set a flag and let the 847 caller decide whether a warning is appropriate or not. */ 848 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \ 849 (POINTER_TYPE_P (TYPE) \ 850 ? !flag_wrapv_pointer \ 851 : (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \ 852 && !flag_wrapv && !flag_trapv)) 853 854 /* True if overflow for the given integral type should issue a 855 trap. */ 856 #define TYPE_OVERFLOW_TRAPS(TYPE) \ 857 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv) 858 859 /* True if an overflow is to be preserved for sanitization. */ 860 #define TYPE_OVERFLOW_SANITIZED(TYPE) \ 861 (INTEGRAL_TYPE_P (TYPE) \ 862 && !TYPE_OVERFLOW_WRAPS (TYPE) \ 863 && (flag_sanitize & SANITIZE_SI_OVERFLOW)) 864 865 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written. 866 Nonzero in a FUNCTION_DECL means that the function has been compiled. 867 This is interesting in an inline function, since it might not need 868 to be compiled separately. 869 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE 870 or TYPE_DECL if the debugging info for the type has been written. 871 In a BLOCK node, nonzero if reorder_blocks has already seen this block. 872 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal 873 PHI node. */ 874 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag) 875 876 /* Nonzero in a _DECL if the name is used in its scope. 877 Nonzero in an expr node means inhibit warning if value is unused. 878 In IDENTIFIER_NODEs, this means that some extern decl for this name 879 was used. 880 In a BLOCK, this means that the block contains variables that are used. */ 881 #define TREE_USED(NODE) ((NODE)->base.used_flag) 882 883 /* In a FUNCTION_DECL, nonzero means a call to the function cannot 884 throw an exception. In a CALL_EXPR, nonzero means the call cannot 885 throw. We can't easily check the node type here as the C++ 886 frontend also uses this flag (for AGGR_INIT_EXPR). */ 887 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag) 888 889 /* In a CALL_EXPR, means that it's safe to use the target of the call 890 expansion as the return slot for a call that returns in memory. */ 891 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \ 892 (CALL_EXPR_CHECK (NODE)->base.private_flag) 893 894 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is 895 passed by invisible reference (and the TREE_TYPE is a pointer to the true 896 type). */ 897 #define DECL_BY_REFERENCE(NODE) \ 898 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \ 899 RESULT_DECL)->decl_common.decl_by_reference_flag) 900 901 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for 902 being set. */ 903 #define DECL_READ_P(NODE) \ 904 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag) 905 906 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes 907 attempting to share the stack slot with some other variable. */ 908 #define DECL_NONSHAREABLE(NODE) \ 909 (TREE_CHECK2 (NODE, VAR_DECL, \ 910 RESULT_DECL)->decl_common.decl_nonshareable_flag) 911 912 /* In a PARM_DECL, set for Fortran hidden string length arguments that some 913 buggy callers don't pass to the callee. */ 914 #define DECL_HIDDEN_STRING_LENGTH(NODE) \ 915 (TREE_CHECK (NODE, PARM_DECL)->decl_common.decl_nonshareable_flag) 916 917 /* In a CALL_EXPR, means that the call is the jump from a thunk to the 918 thunked-to function. */ 919 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag) 920 921 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that 922 it has been built for the declaration of a variable-sized object. */ 923 #define CALL_ALLOCA_FOR_VAR_P(NODE) \ 924 (CALL_EXPR_CHECK (NODE)->base.protected_flag) 925 926 /* In a CALL_EXPR, means call was instrumented by Pointer Bounds Checker. */ 927 #define CALL_WITH_BOUNDS_P(NODE) (CALL_EXPR_CHECK (NODE)->base.deprecated_flag) 928 929 /* Used in classes in C++. */ 930 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag) 931 /* Used in classes in C++. */ 932 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag) 933 934 /* True if reference type NODE is a C++ rvalue reference. */ 935 #define TYPE_REF_IS_RVALUE(NODE) \ 936 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag) 937 938 /* Nonzero in a _DECL if the use of the name is defined as a 939 deprecated feature by __attribute__((deprecated)). */ 940 #define TREE_DEPRECATED(NODE) \ 941 ((NODE)->base.deprecated_flag) 942 943 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose 944 uses are to be substituted for uses of the TREE_CHAINed identifier. */ 945 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \ 946 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag) 947 948 /* In an aggregate type, indicates that the scalar fields of the type are 949 stored in reverse order from the target order. This effectively 950 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */ 951 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \ 952 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag) 953 954 /* In a non-aggregate type, indicates a saturating type. */ 955 #define TYPE_SATURATING(NODE) \ 956 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag) 957 958 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group 959 of bits stored in reverse order from the target order. This effectively 960 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference. 961 962 The overall strategy is to preserve the invariant that every scalar in 963 memory is associated with a single storage order, i.e. all accesses to 964 this scalar are done with the same storage order. This invariant makes 965 it possible to factor out the storage order in most transformations, as 966 only the address and/or the value (in target order) matter for them. 967 But, of course, the storage order must be preserved when the accesses 968 themselves are rewritten or transformed. */ 969 #define REF_REVERSE_STORAGE_ORDER(NODE) \ 970 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag) 971 972 /* In an ADDR_EXPR, indicates that this is a pointer to nested function 973 represented by a descriptor instead of a trampoline. */ 974 #define FUNC_ADDR_BY_DESCRIPTOR(NODE) \ 975 (TREE_CHECK (NODE, ADDR_EXPR)->base.default_def_flag) 976 977 /* In a CALL_EXPR, indicates that this is an indirect call for which 978 pointers to nested function are descriptors instead of trampolines. */ 979 #define CALL_EXPR_BY_DESCRIPTOR(NODE) \ 980 (TREE_CHECK (NODE, CALL_EXPR)->base.default_def_flag) 981 982 /* These flags are available for each language front end to use internally. */ 983 #define TREE_LANG_FLAG_0(NODE) \ 984 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0) 985 #define TREE_LANG_FLAG_1(NODE) \ 986 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1) 987 #define TREE_LANG_FLAG_2(NODE) \ 988 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2) 989 #define TREE_LANG_FLAG_3(NODE) \ 990 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3) 991 #define TREE_LANG_FLAG_4(NODE) \ 992 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4) 993 #define TREE_LANG_FLAG_5(NODE) \ 994 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5) 995 #define TREE_LANG_FLAG_6(NODE) \ 996 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6) 997 998 /* Define additional fields and accessors for nodes representing constants. */ 999 1000 #define TREE_INT_CST_NUNITS(NODE) \ 1001 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended) 1002 #define TREE_INT_CST_EXT_NUNITS(NODE) \ 1003 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended) 1004 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \ 1005 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset) 1006 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I) 1007 #define TREE_INT_CST_LOW(NODE) \ 1008 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0)) 1009 1010 /* Return true if NODE is a POLY_INT_CST. This is only ever true on 1011 targets with variable-sized modes. */ 1012 #define POLY_INT_CST_P(NODE) \ 1013 (NUM_POLY_INT_COEFFS > 1 && TREE_CODE (NODE) == POLY_INT_CST) 1014 1015 /* In a POLY_INT_CST node. */ 1016 #define POLY_INT_CST_COEFF(NODE, I) \ 1017 (POLY_INT_CST_CHECK (NODE)->poly_int_cst.coeffs[I]) 1018 1019 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr) 1020 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE)) 1021 1022 #define TREE_FIXED_CST_PTR(NODE) \ 1023 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr) 1024 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE)) 1025 1026 /* In a STRING_CST */ 1027 /* In C terms, this is sizeof, not strlen. */ 1028 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) 1029 #define TREE_STRING_POINTER(NODE) \ 1030 ((const char *)(STRING_CST_CHECK (NODE)->string.str)) 1031 1032 /* In a COMPLEX_CST node. */ 1033 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) 1034 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) 1035 1036 /* In a VECTOR_CST node. See generic.texi for details. */ 1037 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE))) 1038 #define VECTOR_CST_ELT(NODE,IDX) vector_cst_elt (NODE, IDX) 1039 1040 #define VECTOR_CST_LOG2_NPATTERNS(NODE) \ 1041 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.log2_npatterns) 1042 #define VECTOR_CST_NPATTERNS(NODE) \ 1043 (1U << VECTOR_CST_LOG2_NPATTERNS (NODE)) 1044 #define VECTOR_CST_NELTS_PER_PATTERN(NODE) \ 1045 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.nelts_per_pattern) 1046 #define VECTOR_CST_DUPLICATE_P(NODE) \ 1047 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 1) 1048 #define VECTOR_CST_STEPPED_P(NODE) \ 1049 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 3) 1050 #define VECTOR_CST_ENCODED_ELTS(NODE) \ 1051 (VECTOR_CST_CHECK (NODE)->vector.elts) 1052 #define VECTOR_CST_ENCODED_ELT(NODE, ELT) \ 1053 (VECTOR_CST_CHECK (NODE)->vector.elts[ELT]) 1054 1055 /* Define fields and accessors for some special-purpose tree nodes. */ 1056 1057 #define IDENTIFIER_LENGTH(NODE) \ 1058 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len) 1059 #define IDENTIFIER_POINTER(NODE) \ 1060 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str) 1061 #define IDENTIFIER_HASH_VALUE(NODE) \ 1062 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value) 1063 1064 /* Translate a hash table identifier pointer to a tree_identifier 1065 pointer, and vice versa. */ 1066 1067 #define HT_IDENT_TO_GCC_IDENT(NODE) \ 1068 ((tree) ((char *) (NODE) - sizeof (struct tree_common))) 1069 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id) 1070 1071 /* In a TREE_LIST node. */ 1072 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) 1073 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) 1074 1075 /* In a TREE_VEC node. */ 1076 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length) 1077 #define TREE_VEC_END(NODE) \ 1078 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length])) 1079 1080 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) 1081 1082 /* In a CONSTRUCTOR node. */ 1083 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts) 1084 #define CONSTRUCTOR_ELT(NODE,IDX) \ 1085 (&(*CONSTRUCTOR_ELTS (NODE))[IDX]) 1086 #define CONSTRUCTOR_NELTS(NODE) \ 1087 (vec_safe_length (CONSTRUCTOR_ELTS (NODE))) 1088 #define CONSTRUCTOR_NO_CLEARING(NODE) \ 1089 (CONSTRUCTOR_CHECK (NODE)->base.public_flag) 1090 1091 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the 1092 value of each element (stored within VAL). IX must be a scratch variable 1093 of unsigned integer type. */ 1094 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \ 1095 for (IX = 0; (IX >= vec_safe_length (V)) \ 1096 ? false \ 1097 : ((VAL = (*(V))[IX].value), \ 1098 true); \ 1099 (IX)++) 1100 1101 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both 1102 the value of each element (stored within VAL) and its index (stored 1103 within INDEX). IX must be a scratch variable of unsigned integer type. */ 1104 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \ 1105 for (IX = 0; (IX >= vec_safe_length (V)) \ 1106 ? false \ 1107 : (((void) (VAL = (*V)[IX].value)), \ 1108 (INDEX = (*V)[IX].index), \ 1109 true); \ 1110 (IX)++) 1111 1112 /* Append a new constructor element to V, with the specified INDEX and VAL. */ 1113 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \ 1114 do { \ 1115 constructor_elt _ce___ = {INDEX, VALUE}; \ 1116 vec_safe_push ((V), _ce___); \ 1117 } while (0) 1118 1119 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for 1120 constructor output purposes. */ 1121 #define CONSTRUCTOR_BITFIELD_P(NODE) \ 1122 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode) 1123 1124 /* True if NODE is a clobber right hand side, an expression of indeterminate 1125 value that clobbers the LHS in a copy instruction. We use a volatile 1126 empty CONSTRUCTOR for this, as it matches most of the necessary semantic. 1127 In particular the volatile flag causes us to not prematurely remove 1128 such clobber instructions. */ 1129 #define TREE_CLOBBER_P(NODE) \ 1130 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE)) 1131 1132 /* Define fields and accessors for some nodes that represent expressions. */ 1133 1134 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */ 1135 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \ 1136 && VOID_TYPE_P (TREE_TYPE (NODE)) \ 1137 && integer_zerop (TREE_OPERAND (NODE, 0))) 1138 1139 /* In ordinary expression nodes. */ 1140 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE) 1141 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I) 1142 1143 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand 1144 length. Its value includes the length operand itself; that is, 1145 the minimum valid length is 1. 1146 Note that we have to bypass the use of TREE_OPERAND to access 1147 that field to avoid infinite recursion in expanding the macros. */ 1148 #define VL_EXP_OPERAND_LENGTH(NODE) \ 1149 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0])) 1150 1151 /* Nonzero if gimple_debug_nonbind_marker_p() may possibly hold. */ 1152 #define MAY_HAVE_DEBUG_MARKER_STMTS debug_nonbind_markers_p 1153 /* Nonzero if gimple_debug_bind_p() (and thus 1154 gimple_debug_source_bind_p()) may possibly hold. */ 1155 #define MAY_HAVE_DEBUG_BIND_STMTS flag_var_tracking_assignments 1156 /* Nonzero if is_gimple_debug() may possibly hold. */ 1157 #define MAY_HAVE_DEBUG_STMTS \ 1158 (MAY_HAVE_DEBUG_MARKER_STMTS || MAY_HAVE_DEBUG_BIND_STMTS) 1159 1160 /* In a LOOP_EXPR node. */ 1161 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0) 1162 1163 /* The source location of this expression. Non-tree_exp nodes such as 1164 decls and constants can be shared among multiple locations, so 1165 return nothing. */ 1166 #define EXPR_LOCATION(NODE) \ 1167 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION) 1168 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS) 1169 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \ 1170 != UNKNOWN_LOCATION) 1171 /* The location to be used in a diagnostic about this expression. Do not 1172 use this macro if the location will be assigned to other expressions. */ 1173 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \ 1174 ? (NODE)->exp.locus : (LOCUS)) 1175 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus) 1176 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus) 1177 1178 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE)) 1179 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE)))) 1180 1181 #define EXPR_HAS_RANGE(NODE) \ 1182 (CAN_HAVE_RANGE_P (NODE) \ 1183 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \ 1184 : false) 1185 1186 /* True if a tree is an expression or statement that can have a 1187 location. */ 1188 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE)) 1189 1190 static inline source_range 1191 get_expr_source_range (tree expr) 1192 { 1193 location_t loc = EXPR_LOCATION (expr); 1194 return get_range_from_loc (line_table, loc); 1195 } 1196 1197 extern void protected_set_expr_location (tree, location_t); 1198 1199 extern tree maybe_wrap_with_location (tree, location_t); 1200 1201 /* In a TARGET_EXPR node. */ 1202 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0) 1203 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1) 1204 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2) 1205 /* Don't elide the initialization of TARGET_EXPR_SLOT for this TARGET_EXPR 1206 on rhs of MODIFY_EXPR. */ 1207 #define TARGET_EXPR_NO_ELIDE(NODE) (TARGET_EXPR_CHECK (NODE)->base.private_flag) 1208 1209 /* DECL_EXPR accessor. This gives access to the DECL associated with 1210 the given declaration statement. */ 1211 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0) 1212 1213 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0) 1214 1215 /* COMPOUND_LITERAL_EXPR accessors. */ 1216 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \ 1217 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0) 1218 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \ 1219 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE)) 1220 1221 /* SWITCH_EXPR accessors. These give access to the condition and body. */ 1222 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0) 1223 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1) 1224 /* True if there are case labels for all possible values of SWITCH_COND, either 1225 because there is a default: case label or because the case label ranges cover 1226 all values. */ 1227 #define SWITCH_ALL_CASES_P(NODE) (SWITCH_EXPR_CHECK (NODE)->base.private_flag) 1228 1229 /* CASE_LABEL_EXPR accessors. These give access to the high and low values 1230 of a case label, respectively. */ 1231 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0) 1232 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1) 1233 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2) 1234 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3) 1235 1236 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match 1237 corresponding MEM_REF operands. */ 1238 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0)) 1239 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1)) 1240 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2)) 1241 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3)) 1242 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4)) 1243 1244 #define MR_DEPENDENCE_CLIQUE(NODE) \ 1245 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique) 1246 #define MR_DEPENDENCE_BASE(NODE) \ 1247 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base) 1248 1249 /* The operands of a BIND_EXPR. */ 1250 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0)) 1251 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1)) 1252 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2)) 1253 1254 /* GOTO_EXPR accessor. This gives access to the label associated with 1255 a goto statement. */ 1256 #define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_EXPR_CHECK (NODE), 0) 1257 1258 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the 1259 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and 1260 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the 1261 statement. */ 1262 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0) 1263 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1) 1264 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2) 1265 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3) 1266 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4) 1267 /* Nonzero if we want to create an ASM_INPUT instead of an 1268 ASM_OPERAND with no operands. */ 1269 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag) 1270 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag) 1271 /* Nonzero if we want to consider this asm as minimum length and cost 1272 for inlining decisions. */ 1273 #define ASM_INLINE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.protected_flag) 1274 1275 /* COND_EXPR accessors. */ 1276 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0)) 1277 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1)) 1278 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2)) 1279 1280 /* Accessors for the chains of recurrences. */ 1281 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0) 1282 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1) 1283 #define CHREC_VARIABLE(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.u.chrec_var 1284 1285 /* LABEL_EXPR accessor. This gives access to the label associated with 1286 the given label expression. */ 1287 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0) 1288 1289 /* CATCH_EXPR accessors. */ 1290 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0) 1291 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1) 1292 1293 /* EH_FILTER_EXPR accessors. */ 1294 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0) 1295 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1) 1296 1297 /* OBJ_TYPE_REF accessors. */ 1298 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0) 1299 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1) 1300 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2) 1301 1302 /* ASSERT_EXPR accessors. */ 1303 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0) 1304 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1) 1305 1306 /* CALL_EXPR accessors. */ 1307 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1) 1308 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2) 1309 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3) 1310 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3) 1311 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn) 1312 1313 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE. 1314 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if 1315 the argument count is zero when checking is enabled. Instead, do 1316 the pointer arithmetic to advance past the 3 fixed operands in a 1317 CALL_EXPR. That produces a valid pointer to just past the end of the 1318 operand array, even if it's not valid to dereference it. */ 1319 #define CALL_EXPR_ARGP(NODE) \ 1320 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3) 1321 1322 /* TM directives and accessors. */ 1323 #define TRANSACTION_EXPR_BODY(NODE) \ 1324 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0) 1325 #define TRANSACTION_EXPR_OUTER(NODE) \ 1326 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag) 1327 #define TRANSACTION_EXPR_RELAXED(NODE) \ 1328 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag) 1329 1330 /* OpenMP and OpenACC directive and clause accessors. */ 1331 1332 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses 1333 as operand 1. */ 1334 #define OMP_BODY(NODE) \ 1335 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_TASKGROUP), 0) 1336 #define OMP_CLAUSES(NODE) \ 1337 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SINGLE), 1) 1338 1339 /* Generic accessors for OMP nodes that keep clauses as operand 0. */ 1340 #define OMP_STANDALONE_CLAUSES(NODE) \ 1341 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0) 1342 1343 #define OACC_DATA_BODY(NODE) \ 1344 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0) 1345 #define OACC_DATA_CLAUSES(NODE) \ 1346 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1) 1347 1348 #define OACC_HOST_DATA_BODY(NODE) \ 1349 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0) 1350 #define OACC_HOST_DATA_CLAUSES(NODE) \ 1351 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1) 1352 1353 #define OACC_CACHE_CLAUSES(NODE) \ 1354 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0) 1355 1356 #define OACC_DECLARE_CLAUSES(NODE) \ 1357 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0) 1358 1359 #define OACC_ENTER_DATA_CLAUSES(NODE) \ 1360 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0) 1361 1362 #define OACC_EXIT_DATA_CLAUSES(NODE) \ 1363 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0) 1364 1365 #define OACC_UPDATE_CLAUSES(NODE) \ 1366 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0) 1367 1368 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0) 1369 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1) 1370 1371 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0) 1372 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1) 1373 1374 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK) 1375 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0) 1376 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1) 1377 1378 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP) 1379 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0) 1380 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1) 1381 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2) 1382 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3) 1383 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4) 1384 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5) 1385 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 6) 1386 1387 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0) 1388 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1) 1389 1390 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0) 1391 1392 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0) 1393 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1) 1394 1395 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0) 1396 1397 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0) 1398 1399 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0) 1400 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1) 1401 1402 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0) 1403 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1) 1404 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2) 1405 1406 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0) 1407 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1) 1408 1409 #define OMP_TARGET_DATA_BODY(NODE) \ 1410 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0) 1411 #define OMP_TARGET_DATA_CLAUSES(NODE)\ 1412 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1) 1413 1414 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0) 1415 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1) 1416 1417 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\ 1418 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0) 1419 1420 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\ 1421 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0) 1422 1423 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\ 1424 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0) 1425 1426 #define OMP_CLAUSE_SIZE(NODE) \ 1427 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \ 1428 OMP_CLAUSE_FROM, \ 1429 OMP_CLAUSE__CACHE_), 1) 1430 1431 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE)) 1432 #define OMP_CLAUSE_DECL(NODE) \ 1433 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \ 1434 OMP_CLAUSE_PRIVATE, \ 1435 OMP_CLAUSE__LOOPTEMP_), 0) 1436 #define OMP_CLAUSE_HAS_LOCATION(NODE) \ 1437 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \ 1438 != UNKNOWN_LOCATION) 1439 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus 1440 1441 /* True on an OMP_SECTION statement that was the last lexical member. 1442 This status is meaningful in the implementation of lastprivate. */ 1443 #define OMP_SECTION_LAST(NODE) \ 1444 (OMP_SECTION_CHECK (NODE)->base.private_flag) 1445 1446 /* True on an OMP_PARALLEL statement if it represents an explicit 1447 combined parallel work-sharing constructs. */ 1448 #define OMP_PARALLEL_COMBINED(NODE) \ 1449 (OMP_PARALLEL_CHECK (NODE)->base.private_flag) 1450 1451 /* True on an OMP_TEAMS statement if it represents an explicit 1452 combined teams distribute constructs. */ 1453 #define OMP_TEAMS_COMBINED(NODE) \ 1454 (OMP_TEAMS_CHECK (NODE)->base.private_flag) 1455 1456 /* True on an OMP_TARGET statement if it represents explicit 1457 combined target teams, target parallel or target simd constructs. */ 1458 #define OMP_TARGET_COMBINED(NODE) \ 1459 (OMP_TARGET_CHECK (NODE)->base.private_flag) 1460 1461 /* True if OMP_ATOMIC* is supposed to be sequentially consistent 1462 as opposed to relaxed. */ 1463 #define OMP_ATOMIC_SEQ_CST(NODE) \ 1464 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \ 1465 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag) 1466 1467 /* True on a PRIVATE clause if its decl is kept around for debugging 1468 information only and its DECL_VALUE_EXPR is supposed to point 1469 to what it has been remapped to. */ 1470 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \ 1471 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag) 1472 1473 /* True on a PRIVATE clause if ctor needs access to outer region's 1474 variable. */ 1475 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \ 1476 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)) 1477 1478 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct 1479 (thus should be private on the outer taskloop and firstprivate on 1480 task). */ 1481 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \ 1482 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)) 1483 1484 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */ 1485 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \ 1486 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag) 1487 1488 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same 1489 decl is present in the chain. */ 1490 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \ 1491 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag) 1492 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \ 1493 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ 1494 OMP_CLAUSE_LASTPRIVATE),\ 1495 1) 1496 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \ 1497 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init 1498 1499 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop construct 1500 (thus should be lastprivate on the outer taskloop and firstprivate on 1501 task). */ 1502 #define OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV(NODE) \ 1503 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)) 1504 1505 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same 1506 decl is present in the chain (this can happen only for taskloop 1507 with FIRSTPRIVATE/LASTPRIVATE on it originally. */ 1508 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \ 1509 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag) 1510 1511 /* True on a SHARED clause if a scalar is not modified in the body and 1512 thus could be optimized as firstprivate. */ 1513 #define OMP_CLAUSE_SHARED_READONLY(NODE) \ 1514 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)) 1515 1516 #define OMP_CLAUSE_IF_MODIFIER(NODE) \ 1517 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier) 1518 1519 #define OMP_CLAUSE_FINAL_EXPR(NODE) \ 1520 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0) 1521 #define OMP_CLAUSE_IF_EXPR(NODE) \ 1522 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0) 1523 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \ 1524 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0) 1525 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \ 1526 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0) 1527 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \ 1528 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0) 1529 #define OMP_CLAUSE_HINT_EXPR(NODE) \ 1530 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0) 1531 1532 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \ 1533 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0) 1534 1535 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \ 1536 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0) 1537 1538 /* OpenACC clause expressions */ 1539 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \ 1540 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0) 1541 #define OMP_CLAUSE_GANG_EXPR(NODE) \ 1542 OMP_CLAUSE_OPERAND ( \ 1543 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0) 1544 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \ 1545 OMP_CLAUSE_OPERAND ( \ 1546 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1) 1547 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \ 1548 OMP_CLAUSE_OPERAND ( \ 1549 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0) 1550 #define OMP_CLAUSE_WAIT_EXPR(NODE) \ 1551 OMP_CLAUSE_OPERAND ( \ 1552 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0) 1553 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \ 1554 OMP_CLAUSE_OPERAND ( \ 1555 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0) 1556 #define OMP_CLAUSE_WORKER_EXPR(NODE) \ 1557 OMP_CLAUSE_OPERAND ( \ 1558 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0) 1559 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \ 1560 OMP_CLAUSE_OPERAND ( \ 1561 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0) 1562 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \ 1563 OMP_CLAUSE_OPERAND ( \ 1564 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0) 1565 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \ 1566 OMP_CLAUSE_OPERAND ( \ 1567 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0) 1568 1569 #define OMP_CLAUSE_DEPEND_KIND(NODE) \ 1570 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind) 1571 1572 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \ 1573 TREE_PUBLIC (TREE_LIST_CHECK (NODE)) 1574 1575 #define OMP_CLAUSE_MAP_KIND(NODE) \ 1576 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind) 1577 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \ 1578 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \ 1579 = (unsigned int) (MAP_KIND)) 1580 1581 /* Nonzero if this map clause is for array (rather than pointer) based array 1582 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding 1583 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */ 1584 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \ 1585 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag) 1586 /* Nonzero if this is a mapped array section, that might need special 1587 treatment if OMP_CLAUSE_SIZE is zero. */ 1588 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \ 1589 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)) 1590 /* Nonzero if this map clause is for an ACC parallel reduction variable. */ 1591 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \ 1592 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)) 1593 1594 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \ 1595 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind) 1596 1597 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \ 1598 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0) 1599 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \ 1600 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1) 1601 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \ 1602 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2) 1603 1604 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \ 1605 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0) 1606 1607 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \ 1608 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code) 1609 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \ 1610 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1) 1611 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \ 1612 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2) 1613 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \ 1614 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init 1615 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \ 1616 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge 1617 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \ 1618 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3) 1619 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \ 1620 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 4) 1621 1622 /* True if a REDUCTION clause may reference the original list item (omp_orig) 1623 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */ 1624 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \ 1625 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag) 1626 1627 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which 1628 are always initialized inside of the loop construct, false otherwise. */ 1629 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \ 1630 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag) 1631 1632 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which 1633 are declared inside of the simd construct. */ 1634 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \ 1635 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)) 1636 1637 /* True if a LINEAR clause has a stride that is variable. */ 1638 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \ 1639 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)) 1640 1641 /* True if a LINEAR clause is for an array or allocatable variable that 1642 needs special handling by the frontend. */ 1643 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \ 1644 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag) 1645 1646 #define OMP_CLAUSE_LINEAR_STEP(NODE) \ 1647 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1) 1648 1649 #define OMP_CLAUSE_LINEAR_STMT(NODE) \ 1650 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2) 1651 1652 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \ 1653 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init 1654 1655 #define OMP_CLAUSE_LINEAR_KIND(NODE) \ 1656 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind) 1657 1658 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \ 1659 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1) 1660 1661 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \ 1662 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0) 1663 1664 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \ 1665 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ 1666 OMP_CLAUSE_THREAD_LIMIT), 0) 1667 1668 #define OMP_CLAUSE_DEVICE_ID(NODE) \ 1669 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0) 1670 1671 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \ 1672 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ 1673 OMP_CLAUSE_DIST_SCHEDULE), 0) 1674 1675 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \ 1676 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0) 1677 1678 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \ 1679 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0) 1680 1681 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \ 1682 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0) 1683 1684 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \ 1685 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind) 1686 1687 /* True if a SCHEDULE clause has the simd modifier on it. */ 1688 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \ 1689 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag) 1690 1691 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \ 1692 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind) 1693 1694 #define OMP_CLAUSE_TILE_LIST(NODE) \ 1695 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0) 1696 #define OMP_CLAUSE_TILE_ITERVAR(NODE) \ 1697 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1) 1698 #define OMP_CLAUSE_TILE_COUNT(NODE) \ 1699 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2) 1700 1701 #define OMP_CLAUSE__GRIDDIM__DIMENSION(NODE) \ 1702 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_)\ 1703 ->omp_clause.subcode.dimension) 1704 #define OMP_CLAUSE__GRIDDIM__SIZE(NODE) \ 1705 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 0) 1706 #define OMP_CLAUSE__GRIDDIM__GROUP(NODE) \ 1707 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 1) 1708 1709 /* SSA_NAME accessors. */ 1710 1711 /* Whether SSA_NAME NODE is a virtual operand. This simply caches the 1712 information in the underlying SSA_NAME_VAR for efficiency. */ 1713 #define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \ 1714 SSA_NAME_CHECK (NODE)->base.public_flag 1715 1716 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE 1717 if there is no name associated with it. */ 1718 #define SSA_NAME_IDENTIFIER(NODE) \ 1719 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \ 1720 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \ 1721 ? (NODE)->ssa_name.var \ 1722 : DECL_NAME ((NODE)->ssa_name.var)) \ 1723 : NULL_TREE) 1724 1725 /* Returns the variable being referenced. This can be NULL_TREE for 1726 temporaries not associated with any user variable. 1727 Once released, this is the only field that can be relied upon. */ 1728 #define SSA_NAME_VAR(NODE) \ 1729 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \ 1730 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \ 1731 ? NULL_TREE : (NODE)->ssa_name.var) 1732 1733 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \ 1734 do \ 1735 { \ 1736 tree var_ = (VAR); \ 1737 SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \ 1738 SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \ 1739 = (var_ \ 1740 && TREE_CODE (var_) == VAR_DECL \ 1741 && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \ 1742 } \ 1743 while (0) 1744 1745 /* Returns the statement which defines this SSA name. */ 1746 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt 1747 1748 /* Returns the SSA version number of this SSA name. Note that in 1749 tree SSA, version numbers are not per variable and may be recycled. */ 1750 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version 1751 1752 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are 1753 never output, so we can safely use the ASM_WRITTEN_FLAG for this 1754 status bit. */ 1755 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \ 1756 SSA_NAME_CHECK (NODE)->base.asm_written_flag 1757 1758 /* Nonzero if this SSA_NAME expression is currently on the free list of 1759 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing 1760 has no meaning for an SSA_NAME. */ 1761 #define SSA_NAME_IN_FREE_LIST(NODE) \ 1762 SSA_NAME_CHECK (NODE)->base.nothrow_flag 1763 1764 /* Nonzero if this SSA_NAME is the default definition for the 1765 underlying symbol. A default SSA name is created for symbol S if 1766 the very first reference to S in the function is a read operation. 1767 Default definitions are always created by an empty statement and 1768 belong to no basic block. */ 1769 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \ 1770 SSA_NAME_CHECK (NODE)->base.default_def_flag 1771 1772 /* Attributes for SSA_NAMEs for pointer-type variables. */ 1773 #define SSA_NAME_PTR_INFO(N) \ 1774 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info 1775 1776 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */ 1777 #define SSA_NAME_ANTI_RANGE_P(N) \ 1778 SSA_NAME_CHECK (N)->base.static_flag 1779 1780 /* The type of range described by SSA_NAME_RANGE_INFO. */ 1781 #define SSA_NAME_RANGE_TYPE(N) \ 1782 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE) 1783 1784 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */ 1785 #define SSA_NAME_RANGE_INFO(N) \ 1786 SSA_NAME_CHECK (N)->ssa_name.info.range_info 1787 1788 /* Return the immediate_use information for an SSA_NAME. */ 1789 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses 1790 1791 #define OMP_CLAUSE_CODE(NODE) \ 1792 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code 1793 1794 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \ 1795 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE)) 1796 1797 #define OMP_CLAUSE_OPERAND(NODE, I) \ 1798 OMP_CLAUSE_ELT_CHECK (NODE, I) 1799 1800 /* In a BLOCK node. */ 1801 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) 1802 #define BLOCK_NONLOCALIZED_VARS(NODE) \ 1803 (BLOCK_CHECK (NODE)->block.nonlocalized_vars) 1804 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \ 1805 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE)) 1806 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N] 1807 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) 1808 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) 1809 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain) 1810 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) 1811 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) 1812 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die) 1813 1814 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */ 1815 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag) 1816 1817 /* True if BLOCK appears in cold section. */ 1818 #define BLOCK_IN_COLD_SECTION_P(NODE) \ 1819 (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag) 1820 1821 /* An index number for this block. These values are not guaranteed to 1822 be unique across functions -- whether or not they are depends on 1823 the debugging output format in use. */ 1824 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num) 1825 1826 /* If block reordering splits a lexical block into discontiguous 1827 address ranges, we'll make a copy of the original block. 1828 1829 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN. 1830 In that case, we have one source block that has been replicated 1831 (through inlining or unrolling) into many logical blocks, and that 1832 these logical blocks have different physical variables in them. 1833 1834 In this case, we have one logical block split into several 1835 non-contiguous address ranges. Most debug formats can't actually 1836 represent this idea directly, so we fake it by creating multiple 1837 logical blocks with the same variables in them. However, for those 1838 that do support non-contiguous regions, these allow the original 1839 logical block to be reconstructed, along with the set of address 1840 ranges. 1841 1842 One of the logical block fragments is arbitrarily chosen to be 1843 the ORIGIN. The other fragments will point to the origin via 1844 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer 1845 be null. The list of fragments will be chained through 1846 BLOCK_FRAGMENT_CHAIN from the origin. */ 1847 1848 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin) 1849 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain) 1850 1851 /* For an inlined function, this gives the location where it was called 1852 from. This is only set in the top level block, which corresponds to the 1853 inlined function scope. This is used in the debug output routines. */ 1854 1855 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus) 1856 1857 /* This gives the location of the end of the block, useful to attach 1858 code implicitly generated for outgoing paths. */ 1859 1860 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus) 1861 1862 /* Define fields and accessors for nodes representing data types. */ 1863 1864 /* See tree.def for documentation of the use of these fields. 1865 Look at the documentation of the various ..._TYPE tree codes. 1866 1867 Note that the type.values, type.minval, and type.maxval fields are 1868 overloaded and used for different macros in different kinds of types. 1869 Each macro must check to ensure the tree node is of the proper kind of 1870 type. Note also that some of the front-ends also overload these fields, 1871 so they must be checked as well. */ 1872 1873 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid) 1874 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size) 1875 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit) 1876 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to) 1877 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to) 1878 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision) 1879 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name) 1880 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant) 1881 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant) 1882 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context) 1883 1884 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode) 1885 #define TYPE_MODE(NODE) \ 1886 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \ 1887 ? vector_type_mode (NODE) : (NODE)->type_common.mode) 1888 #define SCALAR_TYPE_MODE(NODE) \ 1889 (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode)) 1890 #define SCALAR_INT_TYPE_MODE(NODE) \ 1891 (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode)) 1892 #define SCALAR_FLOAT_TYPE_MODE(NODE) \ 1893 (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode)) 1894 #define SET_TYPE_MODE(NODE, MODE) \ 1895 (TYPE_CHECK (NODE)->type_common.mode = (MODE)) 1896 1897 extern machine_mode element_mode (const_tree); 1898 extern machine_mode vector_type_mode (const_tree); 1899 1900 /* The "canonical" type for this type node, which is used by frontends to 1901 compare the type for equality with another type. If two types are 1902 equal (based on the semantics of the language), then they will have 1903 equivalent TYPE_CANONICAL entries. 1904 1905 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus 1906 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot 1907 be used for comparison against other types. Instead, the type is 1908 said to require structural equality checks, described in 1909 TYPE_STRUCTURAL_EQUALITY_P. 1910 1911 For unqualified aggregate and function types the middle-end relies on 1912 TYPE_CANONICAL to tell whether two variables can be assigned 1913 to each other without a conversion. The middle-end also makes sure 1914 to assign the same alias-sets to the type partition with equal 1915 TYPE_CANONICAL of their unqualified variants. */ 1916 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical) 1917 /* Indicates that the type node requires structural equality 1918 checks. The compiler will need to look at the composition of the 1919 type to determine whether it is equal to another type, rather than 1920 just comparing canonical type pointers. For instance, we would need 1921 to look at the return and parameter types of a FUNCTION_TYPE 1922 node. */ 1923 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE) 1924 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the 1925 type node requires structural equality. */ 1926 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE) 1927 1928 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE))) 1929 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE))) 1930 1931 /* The (language-specific) typed-based alias set for this type. 1932 Objects whose TYPE_ALIAS_SETs are different cannot alias each 1933 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been 1934 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this 1935 type can alias objects of any type. */ 1936 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set) 1937 1938 /* Nonzero iff the typed-based alias set for this type has been 1939 calculated. */ 1940 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \ 1941 (TYPE_CHECK (NODE)->type_common.alias_set != -1) 1942 1943 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply 1944 to this type. */ 1945 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes) 1946 1947 /* The alignment necessary for objects of this type. 1948 The value is an int, measured in bits and must be a power of two. 1949 We support also an "alignment" of zero. */ 1950 #define TYPE_ALIGN(NODE) \ 1951 (TYPE_CHECK (NODE)->type_common.align \ 1952 ? ((unsigned)1) << ((NODE)->type_common.align - 1) : 0) 1953 1954 /* Specify that TYPE_ALIGN(NODE) is X. */ 1955 #define SET_TYPE_ALIGN(NODE, X) \ 1956 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X)) 1957 1958 /* 1 if the alignment for this type was requested by "aligned" attribute, 1959 0 if it is the default for this type. */ 1960 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align) 1961 1962 /* The alignment for NODE, in bytes. */ 1963 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT) 1964 1965 /* The minimum alignment necessary for objects of this type without 1966 warning. The value is an int, measured in bits. */ 1967 #define TYPE_WARN_IF_NOT_ALIGN(NODE) \ 1968 (TYPE_CHECK (NODE)->type_common.warn_if_not_align \ 1969 ? ((unsigned)1) << ((NODE)->type_common.warn_if_not_align - 1) : 0) 1970 1971 /* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */ 1972 #define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \ 1973 (TYPE_CHECK (NODE)->type_common.warn_if_not_align = ffs_hwi (X)) 1974 1975 /* If your language allows you to declare types, and you want debug info 1976 for them, then you need to generate corresponding TYPE_DECL nodes. 1977 These "stub" TYPE_DECL nodes have no name, and simply point at the 1978 type node. You then set the TYPE_STUB_DECL field of the type node 1979 to point back at the TYPE_DECL node. This allows the debug routines 1980 to know that the two nodes represent the same type, so that we only 1981 get one debug info record for them. */ 1982 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE))) 1983 1984 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means 1985 the type has BLKmode only because it lacks the alignment required for 1986 its size. */ 1987 #define TYPE_NO_FORCE_BLK(NODE) \ 1988 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag) 1989 1990 /* Nonzero in a type considered volatile as a whole. */ 1991 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag) 1992 1993 /* Nonzero in a type considered atomic as a whole. */ 1994 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag) 1995 1996 /* Means this type is const-qualified. */ 1997 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag) 1998 1999 /* If nonzero, this type is `restrict'-qualified, in the C sense of 2000 the term. */ 2001 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag) 2002 2003 /* If nonzero, type's name shouldn't be emitted into debug info. */ 2004 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag) 2005 2006 /* The address space the type is in. */ 2007 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space) 2008 2009 /* Encode/decode the named memory support as part of the qualifier. If more 2010 than 8 qualifiers are added, these macros need to be adjusted. */ 2011 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8) 2012 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF) 2013 2014 /* Return all qualifiers except for the address space qualifiers. */ 2015 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00) 2016 2017 /* Only keep the address space out of the qualifiers and discard the other 2018 qualifiers. */ 2019 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00) 2020 2021 /* The set of type qualifiers for this type. */ 2022 #define TYPE_QUALS(NODE) \ 2023 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ 2024 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ 2025 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \ 2026 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \ 2027 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))) 2028 2029 /* The same as TYPE_QUALS without the address space qualifications. */ 2030 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \ 2031 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ 2032 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ 2033 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \ 2034 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))) 2035 2036 /* The same as TYPE_QUALS without the address space and atomic 2037 qualifications. */ 2038 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \ 2039 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ 2040 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ 2041 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))) 2042 2043 /* These flags are available for each language front end to use internally. */ 2044 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0) 2045 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1) 2046 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2) 2047 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3) 2048 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4) 2049 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5) 2050 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6) 2051 #define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7) 2052 2053 /* Used to keep track of visited nodes in tree traversals. This is set to 2054 0 by copy_node and make_node. */ 2055 #define TREE_VISITED(NODE) ((NODE)->base.visited) 2056 2057 /* If set in an ARRAY_TYPE, indicates a string type (for languages 2058 that distinguish string from array of char). 2059 If set in a INTEGER_TYPE, indicates a character type. */ 2060 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag) 2061 2062 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings 2063 about missing conversions to other vector types of the same size. */ 2064 #define TYPE_VECTOR_OPAQUE(NODE) \ 2065 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag) 2066 2067 /* Indicates that objects of this type must be initialized by calling a 2068 function when they are created. */ 2069 #define TYPE_NEEDS_CONSTRUCTING(NODE) \ 2070 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag) 2071 2072 /* Indicates that a UNION_TYPE object should be passed the same way that 2073 the first union alternative would be passed, or that a RECORD_TYPE 2074 object should be passed the same way that the first (and only) member 2075 would be passed. */ 2076 #define TYPE_TRANSPARENT_AGGR(NODE) \ 2077 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag) 2078 2079 /* For an ARRAY_TYPE, indicates that it is not permitted to take the 2080 address of a component of the type. This is the counterpart of 2081 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */ 2082 #define TYPE_NONALIASED_COMPONENT(NODE) \ 2083 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag) 2084 2085 /* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE 2086 whether the array is typeless storage or the type contains a member 2087 with this flag set. Such types are exempt from type-based alias 2088 analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types 2089 the flag should be inherited from the element type, can change 2090 when type is finalized and because of that should not be used in 2091 type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types 2092 the flag should not be changed after the array is created and should 2093 be used in type hashing. */ 2094 #define TYPE_TYPELESS_STORAGE(NODE) \ 2095 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \ 2096 ARRAY_TYPE)->type_common.typeless_storage) 2097 2098 /* Indicated that objects of this type should be laid out in as 2099 compact a way as possible. */ 2100 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag) 2101 2102 /* Used by type_contains_placeholder_p to avoid recomputation. 2103 Values are: 0 (unknown), 1 (false), 2 (true). Never access 2104 this field directly. */ 2105 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \ 2106 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits) 2107 2108 /* Nonzero if RECORD_TYPE represents a final derivation of class. */ 2109 #define TYPE_FINAL_P(NODE) \ 2110 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag) 2111 2112 /* The debug output functions use the symtab union field to store 2113 information specific to the debugging format. The different debug 2114 output hooks store different types in the union field. These three 2115 macros are used to access different fields in the union. The debug 2116 hooks are responsible for consistently using only a specific 2117 macro. */ 2118 2119 /* Symtab field as an integer. Used by stabs generator in dbxout.c to 2120 hold the type's number in the generated stabs. */ 2121 #define TYPE_SYMTAB_ADDRESS(NODE) \ 2122 (TYPE_CHECK (NODE)->type_common.symtab.address) 2123 2124 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator 2125 in dwarf2out.c to point to the DIE generated for the type. */ 2126 #define TYPE_SYMTAB_DIE(NODE) \ 2127 (TYPE_CHECK (NODE)->type_common.symtab.die) 2128 2129 /* The garbage collector needs to know the interpretation of the 2130 symtab field. These constants represent the different types in the 2131 union. */ 2132 2133 #define TYPE_SYMTAB_IS_ADDRESS (0) 2134 #define TYPE_SYMTAB_IS_DIE (1) 2135 2136 #define TYPE_LANG_SPECIFIC(NODE) \ 2137 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific) 2138 2139 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values) 2140 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values) 2141 #define TYPE_FIELDS(NODE) \ 2142 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values) 2143 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values) 2144 #define TYPE_ARG_TYPES(NODE) \ 2145 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values) 2146 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values) 2147 2148 #define TYPE_MIN_VALUE(NODE) \ 2149 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval) 2150 #define TYPE_NEXT_PTR_TO(NODE) \ 2151 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval) 2152 #define TYPE_NEXT_REF_TO(NODE) \ 2153 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval) 2154 #define TYPE_VFIELD(NODE) \ 2155 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval) 2156 #define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval) 2157 2158 #define TYPE_MAX_VALUE(NODE) \ 2159 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval) 2160 #define TYPE_METHOD_BASETYPE(NODE) \ 2161 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval) 2162 #define TYPE_OFFSET_BASETYPE(NODE) \ 2163 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval) 2164 /* If non-NULL, this is an upper bound of the size (in bytes) of an 2165 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be 2166 allocated. */ 2167 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ 2168 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval) 2169 #define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval) 2170 /* For record and union types, information about this type, as a base type 2171 for itself. */ 2172 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval) 2173 2174 /* For types, used in a language-dependent way. */ 2175 #define TYPE_LANG_SLOT_1(NODE) \ 2176 (TYPE_CHECK (NODE)->type_non_common.lang_1) 2177 2178 /* Define accessor macros for information about type inheritance 2179 and basetypes. 2180 2181 A "basetype" means a particular usage of a data type for inheritance 2182 in another type. Each such basetype usage has its own "binfo" 2183 object to describe it. The binfo object is a TREE_VEC node. 2184 2185 Inheritance is represented by the binfo nodes allocated for a 2186 given type. For example, given types C and D, such that D is 2187 inherited by C, 3 binfo nodes will be allocated: one for describing 2188 the binfo properties of C, similarly one for D, and one for 2189 describing the binfo properties of D as a base type for C. 2190 Thus, given a pointer to class C, one can get a pointer to the binfo 2191 of D acting as a basetype for C by looking at C's binfo's basetypes. */ 2192 2193 /* BINFO specific flags. */ 2194 2195 /* Nonzero means that the derivation chain is via a `virtual' declaration. */ 2196 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag) 2197 2198 /* Flags for language dependent use. */ 2199 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE)) 2200 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE)) 2201 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE)) 2202 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE)) 2203 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE)) 2204 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE)) 2205 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE)) 2206 2207 /* The actual data type node being inherited in this basetype. */ 2208 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE)) 2209 2210 /* The offset where this basetype appears in its containing type. 2211 BINFO_OFFSET slot holds the offset (in bytes) 2212 from the base of the complete object to the base of the part of the 2213 object that is allocated on behalf of this `type'. 2214 This is always 0 except when there is multiple inheritance. */ 2215 2216 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset) 2217 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) 2218 2219 /* The virtual function table belonging to this basetype. Virtual 2220 function tables provide a mechanism for run-time method dispatching. 2221 The entries of a virtual function table are language-dependent. */ 2222 2223 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable) 2224 2225 /* The virtual functions in the virtual function table. This is 2226 a TREE_LIST that is used as an initial approximation for building 2227 a virtual function table for this basetype. */ 2228 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals) 2229 2230 /* A vector of binfos for the direct basetypes inherited by this 2231 basetype. 2232 2233 If this basetype describes type D as inherited in C, and if the 2234 basetypes of D are E and F, then this vector contains binfos for 2235 inheritance of E and F by C. */ 2236 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos) 2237 2238 /* The number of basetypes for NODE. */ 2239 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ()) 2240 2241 /* Accessor macro to get to the Nth base binfo of this binfo. */ 2242 #define BINFO_BASE_BINFO(NODE,N) \ 2243 ((*BINFO_BASE_BINFOS (NODE))[(N)]) 2244 #define BINFO_BASE_ITERATE(NODE,N,B) \ 2245 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B))) 2246 #define BINFO_BASE_APPEND(NODE,T) \ 2247 (BINFO_BASE_BINFOS (NODE)->quick_push ((T))) 2248 2249 /* For a BINFO record describing a virtual base class, i.e., one where 2250 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual 2251 base. The actual contents are language-dependent. In the C++ 2252 front-end this field is an INTEGER_CST giving an offset into the 2253 vtable where the offset to the virtual base can be found. */ 2254 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field) 2255 2256 /* Indicates the accesses this binfo has to its bases. The values are 2257 access_public_node, access_protected_node or access_private_node. 2258 If this array is not present, public access is implied. */ 2259 #define BINFO_BASE_ACCESSES(NODE) \ 2260 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses) 2261 2262 #define BINFO_BASE_ACCESS(NODE,N) \ 2263 (*BINFO_BASE_ACCESSES (NODE))[(N)] 2264 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \ 2265 BINFO_BASE_ACCESSES (NODE)->quick_push ((T)) 2266 2267 /* The index in the VTT where this subobject's sub-VTT can be found. 2268 NULL_TREE if there is no sub-VTT. */ 2269 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt) 2270 2271 /* The index in the VTT where the vptr for this subobject can be 2272 found. NULL_TREE if there is no secondary vptr in the VTT. */ 2273 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr) 2274 2275 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base 2276 inheriting this base for non-virtual bases. For virtual bases it 2277 points either to the binfo for which this is a primary binfo, or to 2278 the binfo of the most derived type. */ 2279 #define BINFO_INHERITANCE_CHAIN(NODE) \ 2280 (TREE_BINFO_CHECK (NODE)->binfo.inheritance) 2281 2282 2283 /* Define fields and accessors for nodes representing declared names. */ 2284 2285 /* Nonzero if DECL represents an SSA name or a variable that can possibly 2286 have an associated SSA name. */ 2287 #define SSA_VAR_P(DECL) \ 2288 (TREE_CODE (DECL) == VAR_DECL \ 2289 || TREE_CODE (DECL) == PARM_DECL \ 2290 || TREE_CODE (DECL) == RESULT_DECL \ 2291 || TREE_CODE (DECL) == SSA_NAME) 2292 2293 2294 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE))) 2295 2296 /* This is the name of the object as written by the user. 2297 It is an IDENTIFIER_NODE. */ 2298 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name) 2299 2300 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */ 2301 #define TYPE_IDENTIFIER(NODE) \ 2302 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \ 2303 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE)) 2304 2305 /* Every ..._DECL node gets a unique number. */ 2306 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid) 2307 2308 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous 2309 uses. */ 2310 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL))) 2311 2312 /* Every ..._DECL node gets a unique number that stays the same even 2313 when the decl is copied by the inliner once it is set. */ 2314 #define DECL_PT_UID(NODE) \ 2315 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \ 2316 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid) 2317 /* Initialize the ..._DECL node pt-uid to the decls uid. */ 2318 #define SET_DECL_PT_UID(NODE, UID) \ 2319 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID)) 2320 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to 2321 be preserved when copyin the decl. */ 2322 #define DECL_PT_UID_SET_P(NODE) \ 2323 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u) 2324 2325 /* These two fields describe where in the source code the declaration 2326 was. If the declaration appears in several places (as for a C 2327 function that is declared first and then defined later), this 2328 information should refer to the definition. */ 2329 #define DECL_SOURCE_LOCATION(NODE) \ 2330 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus) 2331 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE)) 2332 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE)) 2333 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE)) 2334 /* This accessor returns TRUE if the decl it operates on was created 2335 by a front-end or back-end rather than by user code. In this case 2336 builtin-ness is indicated by source location. */ 2337 #define DECL_IS_BUILTIN(DECL) \ 2338 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION) 2339 2340 #define DECL_LOCATION_RANGE(NODE) \ 2341 (get_decl_source_range (DECL_MINIMAL_CHECK (NODE))) 2342 2343 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or 2344 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, 2345 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL 2346 nodes, this points to either the FUNCTION_DECL for the containing 2347 function, the RECORD_TYPE or UNION_TYPE for the containing type, or 2348 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file 2349 scope". In particular, for VAR_DECLs which are virtual table pointers 2350 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type 2351 they belong to. */ 2352 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context) 2353 #define DECL_FIELD_CONTEXT(NODE) \ 2354 (FIELD_DECL_CHECK (NODE)->decl_minimal.context) 2355 2356 /* If nonzero, decl's name shouldn't be emitted into debug info. */ 2357 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag) 2358 2359 /* For any sort of a ..._DECL node, this points to the original (abstract) 2360 decl node which this decl is an inlined/cloned instance of, or else it 2361 is NULL indicating that this decl is not an instance of some other decl. 2362 2363 The C front-end also uses this in a nested declaration of an inline 2364 function, to point back to the definition. */ 2365 #define DECL_ABSTRACT_ORIGIN(NODE) \ 2366 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin) 2367 2368 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract 2369 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ 2370 #define DECL_ORIGIN(NODE) \ 2371 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE)) 2372 2373 /* Nonzero for any sort of ..._DECL node means this decl node represents an 2374 inline instance of some original (abstract) decl from an inline function; 2375 suppress any warnings about shadowing some other variable. FUNCTION_DECL 2376 nodes can also have their abstract origin set to themselves. */ 2377 #define DECL_FROM_INLINE(NODE) \ 2378 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \ 2379 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) 2380 2381 /* In a DECL this is the field where attributes are stored. */ 2382 #define DECL_ATTRIBUTES(NODE) \ 2383 (DECL_COMMON_CHECK (NODE)->decl_common.attributes) 2384 2385 /* For a FUNCTION_DECL, holds the tree of BINDINGs. 2386 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK. 2387 For a VAR_DECL, holds the initial value. 2388 For a PARM_DECL, used for DECL_ARG_TYPE--default 2389 values for parameters are encoded in the type of the function, 2390 not in the PARM_DECL slot. 2391 For a FIELD_DECL, this is used for enumeration values and the C 2392 frontend uses it for temporarily storing bitwidth of bitfields. 2393 2394 ??? Need to figure out some way to check this isn't a PARM_DECL. */ 2395 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial) 2396 2397 /* Holds the size of the datum, in bits, as a tree expression. 2398 Need not be constant. */ 2399 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size) 2400 /* Likewise for the size in bytes. */ 2401 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit) 2402 /* Returns the alignment required for the datum, in bits. It must 2403 be a power of two, but an "alignment" of zero is supported 2404 (e.g. as "uninitialized" sentinel). */ 2405 #define DECL_ALIGN(NODE) \ 2406 (DECL_COMMON_CHECK (NODE)->decl_common.align \ 2407 ? ((unsigned)1) << ((NODE)->decl_common.align - 1) : 0) 2408 /* Specify that DECL_ALIGN(NODE) is X. */ 2409 #define SET_DECL_ALIGN(NODE, X) \ 2410 (DECL_COMMON_CHECK (NODE)->decl_common.align = ffs_hwi (X)) 2411 2412 /* The minimum alignment necessary for the datum, in bits, without 2413 warning. */ 2414 #define DECL_WARN_IF_NOT_ALIGN(NODE) \ 2415 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align \ 2416 ? ((unsigned)1) << ((NODE)->decl_common.warn_if_not_align - 1) : 0) 2417 2418 /* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */ 2419 #define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \ 2420 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align = ffs_hwi (X)) 2421 2422 /* The alignment of NODE, in bytes. */ 2423 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) 2424 /* Set if the alignment of this DECL has been set by the user, for 2425 example with an 'aligned' attribute. */ 2426 #define DECL_USER_ALIGN(NODE) \ 2427 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align) 2428 /* Holds the machine mode corresponding to the declaration of a variable or 2429 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a 2430 FIELD_DECL. */ 2431 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode) 2432 #define SET_DECL_MODE(NODE, MODE) \ 2433 (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE)) 2434 2435 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in 2436 operation it is. Note, however, that this field is overloaded, with 2437 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be 2438 checked before any access to the former. */ 2439 #define DECL_FUNCTION_CODE(NODE) \ 2440 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code) 2441 2442 /* Test if FCODE is a function code for an alloca operation. */ 2443 #define ALLOCA_FUNCTION_CODE_P(FCODE) \ 2444 ((FCODE) == BUILT_IN_ALLOCA \ 2445 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \ 2446 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX) 2447 2448 /* Generate case for an alloca operation. */ 2449 #define CASE_BUILT_IN_ALLOCA \ 2450 case BUILT_IN_ALLOCA: \ 2451 case BUILT_IN_ALLOCA_WITH_ALIGN: \ 2452 case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX 2453 2454 #define DECL_FUNCTION_PERSONALITY(NODE) \ 2455 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality) 2456 2457 /* Nonzero for a given ..._DECL node means that the name of this node should 2458 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that 2459 the associated type should be ignored. For a FUNCTION_DECL, the body of 2460 the function should also be ignored. */ 2461 #define DECL_IGNORED_P(NODE) \ 2462 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag) 2463 2464 /* Nonzero for a given ..._DECL node means that this node represents an 2465 "abstract instance" of the given declaration (e.g. in the original 2466 declaration of an inline function). When generating symbolic debugging 2467 information, we mustn't try to generate any address information for nodes 2468 marked as "abstract instances" because we don't actually generate 2469 any code or allocate any data space for such instances. */ 2470 #define DECL_ABSTRACT_P(NODE) \ 2471 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag) 2472 2473 /* Language-specific decl information. */ 2474 #define DECL_LANG_SPECIFIC(NODE) \ 2475 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific) 2476 2477 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference: 2478 do not allocate storage, and refer to a definition elsewhere. Note that 2479 this does not necessarily imply the entity represented by NODE 2480 has no program source-level definition in this translation unit. For 2481 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and 2482 DECL_EXTERNAL may be true simultaneously; that can be the case for 2483 a C99 "extern inline" function. */ 2484 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1) 2485 2486 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. 2487 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. 2488 2489 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. 2490 2491 Also set in some languages for variables, etc., outside the normal 2492 lexical scope, such as class instance variables. */ 2493 #define DECL_NONLOCAL(NODE) \ 2494 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag) 2495 2496 /* Used in VAR_DECLs to indicate that the variable is a vtable. 2497 Used in FIELD_DECLs for vtable pointers. 2498 Used in FUNCTION_DECLs to indicate that the function is virtual. */ 2499 #define DECL_VIRTUAL_P(NODE) \ 2500 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag) 2501 2502 /* Used to indicate that this DECL represents a compiler-generated entity. */ 2503 #define DECL_ARTIFICIAL(NODE) \ 2504 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag) 2505 2506 /* Additional flags for language-specific uses. */ 2507 #define DECL_LANG_FLAG_0(NODE) \ 2508 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0) 2509 #define DECL_LANG_FLAG_1(NODE) \ 2510 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1) 2511 #define DECL_LANG_FLAG_2(NODE) \ 2512 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2) 2513 #define DECL_LANG_FLAG_3(NODE) \ 2514 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3) 2515 #define DECL_LANG_FLAG_4(NODE) \ 2516 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4) 2517 #define DECL_LANG_FLAG_5(NODE) \ 2518 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5) 2519 #define DECL_LANG_FLAG_6(NODE) \ 2520 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6) 2521 #define DECL_LANG_FLAG_7(NODE) \ 2522 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7) 2523 #define DECL_LANG_FLAG_8(NODE) \ 2524 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8) 2525 2526 /* Nonzero for a scope which is equal to file scope. */ 2527 #define SCOPE_FILE_SCOPE_P(EXP) \ 2528 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL) 2529 /* Nonzero for a decl which is at file scope. */ 2530 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP)) 2531 /* Nonzero for a type which is at file scope. */ 2532 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP)) 2533 2534 /* Nonzero for a decl that is decorated using attribute used. 2535 This indicates to compiler tools that this decl needs to be preserved. */ 2536 #define DECL_PRESERVE_P(DECL) \ 2537 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag 2538 2539 /* For function local variables of COMPLEX and VECTOR types, 2540 indicates that the variable is not aliased, and that all 2541 modifications to the variable have been adjusted so that 2542 they are killing assignments. Thus the variable may now 2543 be treated as a GIMPLE register, and use real instead of 2544 virtual ops in SSA form. */ 2545 #define DECL_GIMPLE_REG_P(DECL) \ 2546 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag 2547 2548 extern tree decl_value_expr_lookup (tree); 2549 extern void decl_value_expr_insert (tree, tree); 2550 2551 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found, 2552 if transformations have made this more complicated than evaluating the 2553 decl itself. */ 2554 #define DECL_HAS_VALUE_EXPR_P(NODE) \ 2555 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \ 2556 ->decl_common.decl_flag_2) 2557 #define DECL_VALUE_EXPR(NODE) \ 2558 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE))) 2559 #define SET_DECL_VALUE_EXPR(NODE, VAL) \ 2560 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL)) 2561 2562 /* Holds the RTL expression for the value of a variable or function. 2563 This value can be evaluated lazily for functions, variables with 2564 static storage duration, and labels. */ 2565 #define DECL_RTL(NODE) \ 2566 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \ 2567 ? (NODE)->decl_with_rtl.rtl \ 2568 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl)) 2569 2570 /* Set the DECL_RTL for NODE to RTL. */ 2571 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL) 2572 2573 /* Returns nonzero if NODE is a tree node that can contain RTL. */ 2574 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL)) 2575 2576 /* Returns nonzero if the DECL_RTL for NODE has already been set. */ 2577 #define DECL_RTL_SET_P(NODE) \ 2578 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL) 2579 2580 /* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for 2581 SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */ 2582 #define COPY_DECL_RTL(SRC_DECL, DST_DECL) \ 2583 (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \ 2584 = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl) 2585 2586 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ 2587 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) 2588 2589 #if (GCC_VERSION >= 2007) 2590 #define DECL_RTL_KNOWN_SET(decl) __extension__ \ 2591 ({ tree const __d = (decl); \ 2592 gcc_checking_assert (DECL_RTL_SET_P (__d)); \ 2593 /* Dereference it so the compiler knows it can't be NULL even \ 2594 without assertion checking. */ \ 2595 &*DECL_RTL_IF_SET (__d); }) 2596 #else 2597 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl)) 2598 #endif 2599 2600 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ 2601 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0) 2602 2603 /* In a FIELD_DECL, this is the field position, counting in bytes, of the 2604 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning 2605 of the structure. */ 2606 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset) 2607 2608 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the 2609 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields 2610 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the 2611 natural alignment of the field's type). */ 2612 #define DECL_FIELD_BIT_OFFSET(NODE) \ 2613 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset) 2614 2615 /* In a FIELD_DECL, this indicates whether the field was a bit-field and 2616 if so, the type that was originally specified for it. 2617 TREE_TYPE may have been modified (in finish_struct). */ 2618 #define DECL_BIT_FIELD_TYPE(NODE) \ 2619 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type) 2620 2621 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage 2622 representative FIELD_DECL. */ 2623 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \ 2624 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) 2625 2626 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which 2627 if nonzero, indicates that the field occupies the type. */ 2628 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) 2629 2630 /* For FIELD_DECLs, off_align holds the number of low-order bits of 2631 DECL_FIELD_OFFSET which are known to be always zero. 2632 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET 2633 has. */ 2634 #define DECL_OFFSET_ALIGN(NODE) \ 2635 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align) 2636 2637 /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */ 2638 #define SET_DECL_OFFSET_ALIGN(NODE, X) \ 2639 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1) 2640 2641 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in 2642 which this FIELD_DECL is defined. This information is needed when 2643 writing debugging information about vfield and vbase decls for C++. */ 2644 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext) 2645 2646 /* In a FIELD_DECL, indicates this field should be bit-packed. */ 2647 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag) 2648 2649 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed 2650 specially. */ 2651 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1) 2652 2653 /* Used in a FIELD_DECL to indicate that we cannot form the address of 2654 this component. This makes it possible for Type-Based Alias Analysis 2655 to disambiguate accesses to this field with indirect accesses using 2656 the field's type: 2657 2658 struct S { int i; } s; 2659 int *p; 2660 2661 If the flag is set on 'i', TBAA computes that s.i and *p never conflict. 2662 2663 From the implementation's viewpoint, the alias set of the type of the 2664 field 'i' (int) will not be recorded as a subset of that of the type of 2665 's' (struct S) in record_component_aliases. The counterpart is that 2666 accesses to s.i must not be given the alias set of the type of 'i' 2667 (int) but instead directly that of the type of 's' (struct S). */ 2668 #define DECL_NONADDRESSABLE_P(NODE) \ 2669 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2) 2670 2671 /* Used in a FIELD_DECL to indicate that this field is padding. */ 2672 #define DECL_PADDING_P(NODE) \ 2673 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3) 2674 2675 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is 2676 dense, unique within any one function, and may be used to index arrays. 2677 If the value is -1, then no UID has been assigned. */ 2678 #define LABEL_DECL_UID(NODE) \ 2679 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid) 2680 2681 /* In a LABEL_DECL, the EH region number for which the label is the 2682 post_landing_pad. */ 2683 #define EH_LANDING_PAD_NR(NODE) \ 2684 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr) 2685 2686 /* For a PARM_DECL, records the data type used to pass the argument, 2687 which may be different from the type seen in the program. */ 2688 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial) 2689 2690 /* For PARM_DECL, holds an RTL for the stack slot or register 2691 where the data was actually passed. */ 2692 #define DECL_INCOMING_RTL(NODE) \ 2693 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl) 2694 2695 /* Nonzero for a given ..._DECL node means that no warnings should be 2696 generated just because this node is unused. */ 2697 #define DECL_IN_SYSTEM_HEADER(NODE) \ 2698 (in_system_header_at (DECL_SOURCE_LOCATION (NODE))) 2699 2700 /* Used to indicate that the linkage status of this DECL is not yet known, 2701 so it should not be output now. */ 2702 #define DECL_DEFER_OUTPUT(NODE) \ 2703 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output) 2704 2705 /* In a VAR_DECL that's static, 2706 nonzero if the space is in the text section. */ 2707 #define DECL_IN_TEXT_SECTION(NODE) \ 2708 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section) 2709 2710 /* In a VAR_DECL that's static, 2711 nonzero if it belongs to the global constant pool. */ 2712 #define DECL_IN_CONSTANT_POOL(NODE) \ 2713 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool) 2714 2715 /* Nonzero for a given ..._DECL node means that this node should be 2716 put in .common, if possible. If a DECL_INITIAL is given, and it 2717 is not error_mark_node, then the decl cannot be put in .common. */ 2718 #define DECL_COMMON(NODE) \ 2719 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag) 2720 2721 /* In a VAR_DECL, nonzero if the decl is a register variable with 2722 an explicit asm specification. */ 2723 #define DECL_HARD_REGISTER(NODE) \ 2724 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register) 2725 2726 /* Used to indicate that this DECL has weak linkage. */ 2727 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag) 2728 2729 /* Used to indicate that the DECL is a dllimport. */ 2730 #define DECL_DLLIMPORT_P(NODE) \ 2731 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag) 2732 2733 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need 2734 not be put out unless it is needed in this translation unit. 2735 Entities like this are shared across translation units (like weak 2736 entities), but are guaranteed to be generated by any translation 2737 unit that needs them, and therefore need not be put out anywhere 2738 where they are not needed. DECL_COMDAT is just a hint to the 2739 back-end; it is up to front-ends which set this flag to ensure 2740 that there will never be any harm, other than bloat, in putting out 2741 something which is DECL_COMDAT. */ 2742 #define DECL_COMDAT(NODE) \ 2743 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag) 2744 2745 #define DECL_COMDAT_GROUP(NODE) \ 2746 decl_comdat_group (NODE) 2747 2748 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in 2749 multiple translation units should be merged. */ 2750 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \ 2751 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE))) 2752 2753 /* The name of the object as the assembler will see it (but before any 2754 translations made by ASM_OUTPUT_LABELREF). Often this is the same 2755 as DECL_NAME. It is an IDENTIFIER_NODE. 2756 2757 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for 2758 One Definition Rule based type merging at LTO. It is computed only for 2759 LTO compilation and C++. */ 2760 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE) 2761 2762 /* Raw accessor for DECL_ASSEMBLE_NAME. */ 2763 #define DECL_ASSEMBLER_NAME_RAW(NODE) \ 2764 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name) 2765 2766 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME. 2767 This is true of all DECL nodes except FIELD_DECL. */ 2768 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \ 2769 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS)) 2770 2771 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero, 2772 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set 2773 yet. */ 2774 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \ 2775 (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE) 2776 2777 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */ 2778 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \ 2779 overwrite_decl_assembler_name (NODE, NAME) 2780 2781 /* Copy the DECL_ASSEMBLER_NAME from SRC_DECL to DST_DECL. Note that 2782 if SRC_DECL's DECL_ASSEMBLER_NAME has not yet been set, using this 2783 macro will not cause the DECL_ASSEMBLER_NAME to be set, but will 2784 clear DECL_ASSEMBLER_NAME of DST_DECL, if it was already set. In 2785 other words, the semantics of using this macro, are different than 2786 saying: 2787 2788 SET_DECL_ASSEMBLER_NAME(DST_DECL, DECL_ASSEMBLER_NAME (SRC_DECL)) 2789 2790 which will try to set the DECL_ASSEMBLER_NAME for SRC_DECL. */ 2791 2792 #define COPY_DECL_ASSEMBLER_NAME(SRC_DECL, DST_DECL) \ 2793 SET_DECL_ASSEMBLER_NAME (DST_DECL, DECL_ASSEMBLER_NAME_RAW (SRC_DECL)) 2794 2795 /* Records the section name in a section attribute. Used to pass 2796 the name from decl_attributes to make_function_rtl and make_decl_rtl. */ 2797 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE) 2798 2799 /* Nonzero in a decl means that the gimplifier has seen (or placed) 2800 this variable in a BIND_EXPR. */ 2801 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \ 2802 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr) 2803 2804 /* Value of the decls's visibility attribute */ 2805 #define DECL_VISIBILITY(NODE) \ 2806 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility) 2807 2808 /* Nonzero means that the decl had its visibility specified rather than 2809 being inferred. */ 2810 #define DECL_VISIBILITY_SPECIFIED(NODE) \ 2811 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified) 2812 2813 /* In a VAR_DECL, the model to use if the data should be allocated from 2814 thread-local storage. */ 2815 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE) 2816 2817 /* In a VAR_DECL, nonzero if the data should be allocated from 2818 thread-local storage. */ 2819 #define DECL_THREAD_LOCAL_P(NODE) \ 2820 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL) 2821 2822 /* In a non-local VAR_DECL with static storage duration, true if the 2823 variable has an initialization priority. If false, the variable 2824 will be initialized at the DEFAULT_INIT_PRIORITY. */ 2825 #define DECL_HAS_INIT_PRIORITY_P(NODE) \ 2826 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p) 2827 2828 extern tree decl_debug_expr_lookup (tree); 2829 extern void decl_debug_expr_insert (tree, tree); 2830 2831 /* For VAR_DECL, this is set to an expression that it was split from. */ 2832 #define DECL_HAS_DEBUG_EXPR_P(NODE) \ 2833 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from) 2834 #define DECL_DEBUG_EXPR(NODE) \ 2835 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE))) 2836 2837 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \ 2838 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL)) 2839 2840 extern priority_type decl_init_priority_lookup (tree); 2841 extern priority_type decl_fini_priority_lookup (tree); 2842 extern void decl_init_priority_insert (tree, priority_type); 2843 extern void decl_fini_priority_insert (tree, priority_type); 2844 2845 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of 2846 NODE. */ 2847 #define DECL_INIT_PRIORITY(NODE) \ 2848 (decl_init_priority_lookup (NODE)) 2849 /* Set the initialization priority for NODE to VAL. */ 2850 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \ 2851 (decl_init_priority_insert (NODE, VAL)) 2852 2853 /* For a FUNCTION_DECL the finalization priority of NODE. */ 2854 #define DECL_FINI_PRIORITY(NODE) \ 2855 (decl_fini_priority_lookup (NODE)) 2856 /* Set the finalization priority for NODE to VAL. */ 2857 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \ 2858 (decl_fini_priority_insert (NODE, VAL)) 2859 2860 /* The initialization priority for entities for which no explicit 2861 initialization priority has been specified. */ 2862 #define DEFAULT_INIT_PRIORITY 65535 2863 2864 /* The maximum allowed initialization priority. */ 2865 #define MAX_INIT_PRIORITY 65535 2866 2867 /* The largest priority value reserved for use by system runtime 2868 libraries. */ 2869 #define MAX_RESERVED_INIT_PRIORITY 100 2870 2871 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */ 2872 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \ 2873 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag) 2874 2875 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */ 2876 #define DECL_NONLOCAL_FRAME(NODE) \ 2877 (VAR_DECL_CHECK (NODE)->base.default_def_flag) 2878 2879 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */ 2880 #define DECL_NONALIASED(NODE) \ 2881 (VAR_DECL_CHECK (NODE)->base.nothrow_flag) 2882 2883 /* This field is used to reference anything in decl.result and is meant only 2884 for use by the garbage collector. */ 2885 #define DECL_RESULT_FLD(NODE) \ 2886 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result) 2887 2888 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. 2889 Before the struct containing the FUNCTION_DECL is laid out, 2890 DECL_VINDEX may point to a FUNCTION_DECL in a base class which 2891 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual 2892 function. When the class is laid out, this pointer is changed 2893 to an INTEGER_CST node which is suitable for use as an index 2894 into the virtual function table. */ 2895 #define DECL_VINDEX(NODE) \ 2896 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex) 2897 2898 /* In FUNCTION_DECL, holds the decl for the return value. */ 2899 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result) 2900 2901 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */ 2902 #define DECL_UNINLINABLE(NODE) \ 2903 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable) 2904 2905 /* In a FUNCTION_DECL, the saved representation of the body of the 2906 entire function. */ 2907 #define DECL_SAVED_TREE(NODE) \ 2908 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree) 2909 2910 /* Nonzero in a FUNCTION_DECL means this function should be treated 2911 as if it were a malloc, meaning it returns a pointer that is 2912 not an alias. */ 2913 #define DECL_IS_MALLOC(NODE) \ 2914 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag) 2915 2916 /* Nonzero in a FUNCTION_DECL means this function should be treated as 2917 C++ operator new, meaning that it returns a pointer for which we 2918 should not use type based aliasing. */ 2919 #define DECL_IS_OPERATOR_NEW(NODE) \ 2920 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag) 2921 2922 /* Nonzero in a FUNCTION_DECL means this function may return more 2923 than once. */ 2924 #define DECL_IS_RETURNS_TWICE(NODE) \ 2925 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag) 2926 2927 /* Nonzero in a FUNCTION_DECL means this function should be treated 2928 as "pure" function (like const function, but may read global memory). */ 2929 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag) 2930 2931 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND 2932 the const or pure function may not terminate. When this is nonzero 2933 for a const or pure function, it can be dealt with by cse passes 2934 but cannot be removed by dce passes since you are not allowed to 2935 change an infinite looping program into one that terminates without 2936 error. */ 2937 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \ 2938 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag) 2939 2940 /* Nonzero in a FUNCTION_DECL means this function should be treated 2941 as "novops" function (function that does not read global memory, 2942 but may have arbitrary side effects). */ 2943 #define DECL_IS_NOVOPS(NODE) \ 2944 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag) 2945 2946 /* Used in FUNCTION_DECLs to indicate that they should be run automatically 2947 at the beginning or end of execution. */ 2948 #define DECL_STATIC_CONSTRUCTOR(NODE) \ 2949 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag) 2950 2951 #define DECL_STATIC_DESTRUCTOR(NODE) \ 2952 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag) 2953 2954 /* Used in FUNCTION_DECLs to indicate that function entry and exit should 2955 be instrumented with calls to support routines. */ 2956 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \ 2957 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit) 2958 2959 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be 2960 disabled in this function. */ 2961 #define DECL_NO_LIMIT_STACK(NODE) \ 2962 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack) 2963 2964 /* In a FUNCTION_DECL indicates that a static chain is needed. */ 2965 #define DECL_STATIC_CHAIN(NODE) \ 2966 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag) 2967 2968 /* Nonzero for a decl that cgraph has decided should be inlined into 2969 at least one call site. It is not meaningful to look at this 2970 directly; always use cgraph_function_possibly_inlined_p. */ 2971 #define DECL_POSSIBLY_INLINED(DECL) \ 2972 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined 2973 2974 /* Nonzero in a FUNCTION_DECL means that this function was declared inline, 2975 such as via the `inline' keyword in C/C++. This flag controls the linkage 2976 semantics of 'inline' */ 2977 #define DECL_DECLARED_INLINE_P(NODE) \ 2978 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag) 2979 2980 /* Nonzero in a FUNCTION_DECL means this function should not get 2981 -Winline warnings. */ 2982 #define DECL_NO_INLINE_WARNING_P(NODE) \ 2983 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag) 2984 2985 /* Nonzero if a FUNCTION_CODE is a TM load/store. */ 2986 #define BUILTIN_TM_LOAD_STORE_P(FN) \ 2987 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE) 2988 2989 /* Nonzero if a FUNCTION_CODE is a TM load. */ 2990 #define BUILTIN_TM_LOAD_P(FN) \ 2991 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE) 2992 2993 /* Nonzero if a FUNCTION_CODE is a TM store. */ 2994 #define BUILTIN_TM_STORE_P(FN) \ 2995 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE) 2996 2997 #define CASE_BUILT_IN_TM_LOAD(FN) \ 2998 case BUILT_IN_TM_LOAD_##FN: \ 2999 case BUILT_IN_TM_LOAD_RAR_##FN: \ 3000 case BUILT_IN_TM_LOAD_RAW_##FN: \ 3001 case BUILT_IN_TM_LOAD_RFW_##FN 3002 3003 #define CASE_BUILT_IN_TM_STORE(FN) \ 3004 case BUILT_IN_TM_STORE_##FN: \ 3005 case BUILT_IN_TM_STORE_WAR_##FN: \ 3006 case BUILT_IN_TM_STORE_WAW_##FN 3007 3008 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner 3009 disregarding size and cost heuristics. This is equivalent to using 3010 the always_inline attribute without the required diagnostics if the 3011 function cannot be inlined. */ 3012 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \ 3013 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits) 3014 3015 extern vec<tree, va_gc> **decl_debug_args_lookup (tree); 3016 extern vec<tree, va_gc> **decl_debug_args_insert (tree); 3017 3018 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */ 3019 #define DECL_HAS_DEBUG_ARGS_P(NODE) \ 3020 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag) 3021 3022 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function") 3023 that describes the status of this function. */ 3024 #define DECL_STRUCT_FUNCTION(NODE) \ 3025 (FUNCTION_DECL_CHECK (NODE)->function_decl.f) 3026 3027 /* In a FUNCTION_DECL, nonzero means a built in function of a 3028 standard library or more generally a built in function that is 3029 recognized by optimizers and expanders. 3030 3031 Note that it is different from the DECL_IS_BUILTIN accessor. For 3032 instance, user declared prototypes of C library functions are not 3033 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */ 3034 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN) 3035 3036 /* For a builtin function, identify which part of the compiler defined it. */ 3037 #define DECL_BUILT_IN_CLASS(NODE) \ 3038 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class) 3039 3040 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */ 3041 #define DECL_ARGUMENTS(NODE) \ 3042 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments) 3043 3044 /* In FUNCTION_DECL, the function specific target options to use when compiling 3045 this function. */ 3046 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \ 3047 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target) 3048 3049 /* In FUNCTION_DECL, the function specific optimization options to use when 3050 compiling this function. */ 3051 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \ 3052 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization) 3053 3054 /* In FUNCTION_DECL, this is set if this function has other versions generated 3055 using "target" attributes. The default version is the one which does not 3056 have any "target" attribute set. */ 3057 #define DECL_FUNCTION_VERSIONED(NODE)\ 3058 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function) 3059 3060 /* In FUNCTION_DECL, this is set if this function is a C++ constructor. 3061 Devirtualization machinery uses this knowledge for determing type of the 3062 object constructed. Also we assume that constructor address is not 3063 important. */ 3064 #define DECL_CXX_CONSTRUCTOR_P(NODE)\ 3065 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor) 3066 3067 /* In FUNCTION_DECL, this is set if this function is a C++ destructor. 3068 Devirtualization machinery uses this to track types in destruction. */ 3069 #define DECL_CXX_DESTRUCTOR_P(NODE)\ 3070 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor) 3071 3072 /* In FUNCTION_DECL, this is set if this function is a lambda function. */ 3073 #define DECL_LAMBDA_FUNCTION(NODE) \ 3074 (FUNCTION_DECL_CHECK (NODE)->function_decl.lambda_function) 3075 3076 /* In FUNCTION_DECL that represent an virtual method this is set when 3077 the method is final. */ 3078 #define DECL_FINAL_P(NODE)\ 3079 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final) 3080 3081 /* The source language of the translation-unit. */ 3082 #define TRANSLATION_UNIT_LANGUAGE(NODE) \ 3083 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language) 3084 3085 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */ 3086 3087 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ 3088 #define DECL_ORIGINAL_TYPE(NODE) \ 3089 (TYPE_DECL_CHECK (NODE)->decl_non_common.result) 3090 3091 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped 3092 into stabs. Instead it will generate cross reference ('x') of names. 3093 This uses the same flag as DECL_EXTERNAL. */ 3094 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \ 3095 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1) 3096 3097 /* Getter of the imported declaration associated to the 3098 IMPORTED_DECL node. */ 3099 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \ 3100 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE))) 3101 3102 /* Getter of the symbol declaration associated with the 3103 NAMELIST_DECL node. */ 3104 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \ 3105 (DECL_INITIAL (NODE)) 3106 3107 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE. 3108 To reduce overhead, the nodes containing the statements are not trees. 3109 This avoids the overhead of tree_common on all linked list elements. 3110 3111 Use the interface in tree-iterator.h to access this node. */ 3112 3113 #define STATEMENT_LIST_HEAD(NODE) \ 3114 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head) 3115 #define STATEMENT_LIST_TAIL(NODE) \ 3116 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail) 3117 3118 #define TREE_OPTIMIZATION(NODE) \ 3119 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts) 3120 3121 #define TREE_OPTIMIZATION_OPTABS(NODE) \ 3122 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs) 3123 3124 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \ 3125 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs) 3126 3127 /* Return a tree node that encapsulates the optimization options in OPTS. */ 3128 extern tree build_optimization_node (struct gcc_options *opts); 3129 3130 #define TREE_TARGET_OPTION(NODE) \ 3131 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts) 3132 3133 #define TREE_TARGET_GLOBALS(NODE) \ 3134 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals) 3135 3136 /* Return a tree node that encapsulates the target options in OPTS. */ 3137 extern tree build_target_option_node (struct gcc_options *opts); 3138 3139 extern void prepare_target_option_nodes_for_pch (void); 3140 3141 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) 3142 3143 inline tree 3144 tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c) 3145 { 3146 if (TREE_CODE (__t) != __c) 3147 tree_check_failed (__t, __f, __l, __g, __c, 0); 3148 return __t; 3149 } 3150 3151 inline tree 3152 tree_not_check (tree __t, const char *__f, int __l, const char *__g, 3153 enum tree_code __c) 3154 { 3155 if (TREE_CODE (__t) == __c) 3156 tree_not_check_failed (__t, __f, __l, __g, __c, 0); 3157 return __t; 3158 } 3159 3160 inline tree 3161 tree_check2 (tree __t, const char *__f, int __l, const char *__g, 3162 enum tree_code __c1, enum tree_code __c2) 3163 { 3164 if (TREE_CODE (__t) != __c1 3165 && TREE_CODE (__t) != __c2) 3166 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0); 3167 return __t; 3168 } 3169 3170 inline tree 3171 tree_not_check2 (tree __t, const char *__f, int __l, const char *__g, 3172 enum tree_code __c1, enum tree_code __c2) 3173 { 3174 if (TREE_CODE (__t) == __c1 3175 || TREE_CODE (__t) == __c2) 3176 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0); 3177 return __t; 3178 } 3179 3180 inline tree 3181 tree_check3 (tree __t, const char *__f, int __l, const char *__g, 3182 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) 3183 { 3184 if (TREE_CODE (__t) != __c1 3185 && TREE_CODE (__t) != __c2 3186 && TREE_CODE (__t) != __c3) 3187 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); 3188 return __t; 3189 } 3190 3191 inline tree 3192 tree_not_check3 (tree __t, const char *__f, int __l, const char *__g, 3193 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) 3194 { 3195 if (TREE_CODE (__t) == __c1 3196 || TREE_CODE (__t) == __c2 3197 || TREE_CODE (__t) == __c3) 3198 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); 3199 return __t; 3200 } 3201 3202 inline tree 3203 tree_check4 (tree __t, const char *__f, int __l, const char *__g, 3204 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, 3205 enum tree_code __c4) 3206 { 3207 if (TREE_CODE (__t) != __c1 3208 && TREE_CODE (__t) != __c2 3209 && TREE_CODE (__t) != __c3 3210 && TREE_CODE (__t) != __c4) 3211 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); 3212 return __t; 3213 } 3214 3215 inline tree 3216 tree_not_check4 (tree __t, const char *__f, int __l, const char *__g, 3217 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, 3218 enum tree_code __c4) 3219 { 3220 if (TREE_CODE (__t) == __c1 3221 || TREE_CODE (__t) == __c2 3222 || TREE_CODE (__t) == __c3 3223 || TREE_CODE (__t) == __c4) 3224 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); 3225 return __t; 3226 } 3227 3228 inline tree 3229 tree_check5 (tree __t, const char *__f, int __l, const char *__g, 3230 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, 3231 enum tree_code __c4, enum tree_code __c5) 3232 { 3233 if (TREE_CODE (__t) != __c1 3234 && TREE_CODE (__t) != __c2 3235 && TREE_CODE (__t) != __c3 3236 && TREE_CODE (__t) != __c4 3237 && TREE_CODE (__t) != __c5) 3238 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); 3239 return __t; 3240 } 3241 3242 inline tree 3243 tree_not_check5 (tree __t, const char *__f, int __l, const char *__g, 3244 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, 3245 enum tree_code __c4, enum tree_code __c5) 3246 { 3247 if (TREE_CODE (__t) == __c1 3248 || TREE_CODE (__t) == __c2 3249 || TREE_CODE (__t) == __c3 3250 || TREE_CODE (__t) == __c4 3251 || TREE_CODE (__t) == __c5) 3252 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); 3253 return __t; 3254 } 3255 3256 inline tree 3257 contains_struct_check (tree __t, const enum tree_node_structure_enum __s, 3258 const char *__f, int __l, const char *__g) 3259 { 3260 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1) 3261 tree_contains_struct_check_failed (__t, __s, __f, __l, __g); 3262 return __t; 3263 } 3264 3265 inline tree 3266 tree_class_check (tree __t, const enum tree_code_class __class, 3267 const char *__f, int __l, const char *__g) 3268 { 3269 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class) 3270 tree_class_check_failed (__t, __class, __f, __l, __g); 3271 return __t; 3272 } 3273 3274 inline tree 3275 tree_range_check (tree __t, 3276 enum tree_code __code1, enum tree_code __code2, 3277 const char *__f, int __l, const char *__g) 3278 { 3279 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2) 3280 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2); 3281 return __t; 3282 } 3283 3284 inline tree 3285 omp_clause_subcode_check (tree __t, enum omp_clause_code __code, 3286 const char *__f, int __l, const char *__g) 3287 { 3288 if (TREE_CODE (__t) != OMP_CLAUSE) 3289 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); 3290 if (__t->omp_clause.code != __code) 3291 omp_clause_check_failed (__t, __f, __l, __g, __code); 3292 return __t; 3293 } 3294 3295 inline tree 3296 omp_clause_range_check (tree __t, 3297 enum omp_clause_code __code1, 3298 enum omp_clause_code __code2, 3299 const char *__f, int __l, const char *__g) 3300 { 3301 if (TREE_CODE (__t) != OMP_CLAUSE) 3302 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); 3303 if ((int) __t->omp_clause.code < (int) __code1 3304 || (int) __t->omp_clause.code > (int) __code2) 3305 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2); 3306 return __t; 3307 } 3308 3309 /* These checks have to be special cased. */ 3310 3311 inline tree 3312 expr_check (tree __t, const char *__f, int __l, const char *__g) 3313 { 3314 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); 3315 if (!IS_EXPR_CODE_CLASS (__c)) 3316 tree_class_check_failed (__t, tcc_expression, __f, __l, __g); 3317 return __t; 3318 } 3319 3320 /* These checks have to be special cased. */ 3321 3322 inline tree 3323 non_type_check (tree __t, const char *__f, int __l, const char *__g) 3324 { 3325 if (TYPE_P (__t)) 3326 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g); 3327 return __t; 3328 } 3329 3330 inline const HOST_WIDE_INT * 3331 tree_int_cst_elt_check (const_tree __t, int __i, 3332 const char *__f, int __l, const char *__g) 3333 { 3334 if (TREE_CODE (__t) != INTEGER_CST) 3335 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0); 3336 if (__i < 0 || __i >= __t->base.u.int_length.extended) 3337 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended, 3338 __f, __l, __g); 3339 return &CONST_CAST_TREE (__t)->int_cst.val[__i]; 3340 } 3341 3342 inline HOST_WIDE_INT * 3343 tree_int_cst_elt_check (tree __t, int __i, 3344 const char *__f, int __l, const char *__g) 3345 { 3346 if (TREE_CODE (__t) != INTEGER_CST) 3347 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0); 3348 if (__i < 0 || __i >= __t->base.u.int_length.extended) 3349 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended, 3350 __f, __l, __g); 3351 return &CONST_CAST_TREE (__t)->int_cst.val[__i]; 3352 } 3353 3354 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */ 3355 3356 # if GCC_VERSION >= 4006 3357 #pragma GCC diagnostic push 3358 #pragma GCC diagnostic ignored "-Wstrict-overflow" 3359 #endif 3360 3361 inline tree * 3362 tree_vec_elt_check (tree __t, int __i, 3363 const char *__f, int __l, const char *__g) 3364 { 3365 if (TREE_CODE (__t) != TREE_VEC) 3366 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0); 3367 if (__i < 0 || __i >= __t->base.u.length) 3368 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g); 3369 return &CONST_CAST_TREE (__t)->vec.a[__i]; 3370 } 3371 3372 # if GCC_VERSION >= 4006 3373 #pragma GCC diagnostic pop 3374 #endif 3375 3376 inline tree * 3377 omp_clause_elt_check (tree __t, int __i, 3378 const char *__f, int __l, const char *__g) 3379 { 3380 if (TREE_CODE (__t) != OMP_CLAUSE) 3381 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); 3382 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) 3383 omp_clause_operand_check_failed (__i, __t, __f, __l, __g); 3384 return &__t->omp_clause.ops[__i]; 3385 } 3386 3387 /* These checks have to be special cased. */ 3388 3389 inline tree 3390 any_integral_type_check (tree __t, const char *__f, int __l, const char *__g) 3391 { 3392 if (!ANY_INTEGRAL_TYPE_P (__t)) 3393 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE, 3394 INTEGER_TYPE, 0); 3395 return __t; 3396 } 3397 3398 inline const_tree 3399 tree_check (const_tree __t, const char *__f, int __l, const char *__g, 3400 tree_code __c) 3401 { 3402 if (TREE_CODE (__t) != __c) 3403 tree_check_failed (__t, __f, __l, __g, __c, 0); 3404 return __t; 3405 } 3406 3407 inline const_tree 3408 tree_not_check (const_tree __t, const char *__f, int __l, const char *__g, 3409 enum tree_code __c) 3410 { 3411 if (TREE_CODE (__t) == __c) 3412 tree_not_check_failed (__t, __f, __l, __g, __c, 0); 3413 return __t; 3414 } 3415 3416 inline const_tree 3417 tree_check2 (const_tree __t, const char *__f, int __l, const char *__g, 3418 enum tree_code __c1, enum tree_code __c2) 3419 { 3420 if (TREE_CODE (__t) != __c1 3421 && TREE_CODE (__t) != __c2) 3422 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0); 3423 return __t; 3424 } 3425 3426 inline const_tree 3427 tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g, 3428 enum tree_code __c1, enum tree_code __c2) 3429 { 3430 if (TREE_CODE (__t) == __c1 3431 || TREE_CODE (__t) == __c2) 3432 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0); 3433 return __t; 3434 } 3435 3436 inline const_tree 3437 tree_check3 (const_tree __t, const char *__f, int __l, const char *__g, 3438 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) 3439 { 3440 if (TREE_CODE (__t) != __c1 3441 && TREE_CODE (__t) != __c2 3442 && TREE_CODE (__t) != __c3) 3443 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); 3444 return __t; 3445 } 3446 3447 inline const_tree 3448 tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g, 3449 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) 3450 { 3451 if (TREE_CODE (__t) == __c1 3452 || TREE_CODE (__t) == __c2 3453 || TREE_CODE (__t) == __c3) 3454 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); 3455 return __t; 3456 } 3457 3458 inline const_tree 3459 tree_check4 (const_tree __t, const char *__f, int __l, const char *__g, 3460 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, 3461 enum tree_code __c4) 3462 { 3463 if (TREE_CODE (__t) != __c1 3464 && TREE_CODE (__t) != __c2 3465 && TREE_CODE (__t) != __c3 3466 && TREE_CODE (__t) != __c4) 3467 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); 3468 return __t; 3469 } 3470 3471 inline const_tree 3472 tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g, 3473 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, 3474 enum tree_code __c4) 3475 { 3476 if (TREE_CODE (__t) == __c1 3477 || TREE_CODE (__t) == __c2 3478 || TREE_CODE (__t) == __c3 3479 || TREE_CODE (__t) == __c4) 3480 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); 3481 return __t; 3482 } 3483 3484 inline const_tree 3485 tree_check5 (const_tree __t, const char *__f, int __l, const char *__g, 3486 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, 3487 enum tree_code __c4, enum tree_code __c5) 3488 { 3489 if (TREE_CODE (__t) != __c1 3490 && TREE_CODE (__t) != __c2 3491 && TREE_CODE (__t) != __c3 3492 && TREE_CODE (__t) != __c4 3493 && TREE_CODE (__t) != __c5) 3494 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); 3495 return __t; 3496 } 3497 3498 inline const_tree 3499 tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g, 3500 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, 3501 enum tree_code __c4, enum tree_code __c5) 3502 { 3503 if (TREE_CODE (__t) == __c1 3504 || TREE_CODE (__t) == __c2 3505 || TREE_CODE (__t) == __c3 3506 || TREE_CODE (__t) == __c4 3507 || TREE_CODE (__t) == __c5) 3508 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); 3509 return __t; 3510 } 3511 3512 inline const_tree 3513 contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s, 3514 const char *__f, int __l, const char *__g) 3515 { 3516 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1) 3517 tree_contains_struct_check_failed (__t, __s, __f, __l, __g); 3518 return __t; 3519 } 3520 3521 inline const_tree 3522 tree_class_check (const_tree __t, const enum tree_code_class __class, 3523 const char *__f, int __l, const char *__g) 3524 { 3525 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class) 3526 tree_class_check_failed (__t, __class, __f, __l, __g); 3527 return __t; 3528 } 3529 3530 inline const_tree 3531 tree_range_check (const_tree __t, 3532 enum tree_code __code1, enum tree_code __code2, 3533 const char *__f, int __l, const char *__g) 3534 { 3535 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2) 3536 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2); 3537 return __t; 3538 } 3539 3540 inline const_tree 3541 omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code, 3542 const char *__f, int __l, const char *__g) 3543 { 3544 if (TREE_CODE (__t) != OMP_CLAUSE) 3545 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); 3546 if (__t->omp_clause.code != __code) 3547 omp_clause_check_failed (__t, __f, __l, __g, __code); 3548 return __t; 3549 } 3550 3551 inline const_tree 3552 omp_clause_range_check (const_tree __t, 3553 enum omp_clause_code __code1, 3554 enum omp_clause_code __code2, 3555 const char *__f, int __l, const char *__g) 3556 { 3557 if (TREE_CODE (__t) != OMP_CLAUSE) 3558 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); 3559 if ((int) __t->omp_clause.code < (int) __code1 3560 || (int) __t->omp_clause.code > (int) __code2) 3561 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2); 3562 return __t; 3563 } 3564 3565 inline const_tree 3566 expr_check (const_tree __t, const char *__f, int __l, const char *__g) 3567 { 3568 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); 3569 if (!IS_EXPR_CODE_CLASS (__c)) 3570 tree_class_check_failed (__t, tcc_expression, __f, __l, __g); 3571 return __t; 3572 } 3573 3574 inline const_tree 3575 non_type_check (const_tree __t, const char *__f, int __l, const char *__g) 3576 { 3577 if (TYPE_P (__t)) 3578 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g); 3579 return __t; 3580 } 3581 3582 # if GCC_VERSION >= 4006 3583 #pragma GCC diagnostic push 3584 #pragma GCC diagnostic ignored "-Wstrict-overflow" 3585 #endif 3586 3587 inline const_tree * 3588 tree_vec_elt_check (const_tree __t, int __i, 3589 const char *__f, int __l, const char *__g) 3590 { 3591 if (TREE_CODE (__t) != TREE_VEC) 3592 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0); 3593 if (__i < 0 || __i >= __t->base.u.length) 3594 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g); 3595 return CONST_CAST (const_tree *, &__t->vec.a[__i]); 3596 //return &__t->vec.a[__i]; 3597 } 3598 3599 # if GCC_VERSION >= 4006 3600 #pragma GCC diagnostic pop 3601 #endif 3602 3603 inline const_tree * 3604 omp_clause_elt_check (const_tree __t, int __i, 3605 const char *__f, int __l, const char *__g) 3606 { 3607 if (TREE_CODE (__t) != OMP_CLAUSE) 3608 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); 3609 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) 3610 omp_clause_operand_check_failed (__i, __t, __f, __l, __g); 3611 return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]); 3612 } 3613 3614 inline const_tree 3615 any_integral_type_check (const_tree __t, const char *__f, int __l, 3616 const char *__g) 3617 { 3618 if (!ANY_INTEGRAL_TYPE_P (__t)) 3619 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE, 3620 INTEGER_TYPE, 0); 3621 return __t; 3622 } 3623 3624 #endif 3625 3626 /* Compute the number of operands in an expression node NODE. For 3627 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself, 3628 otherwise it is looked up from the node's code. */ 3629 static inline int 3630 tree_operand_length (const_tree node) 3631 { 3632 if (VL_EXP_CLASS_P (node)) 3633 return VL_EXP_OPERAND_LENGTH (node); 3634 else 3635 return TREE_CODE_LENGTH (TREE_CODE (node)); 3636 } 3637 3638 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) 3639 3640 /* Special checks for TREE_OPERANDs. */ 3641 inline tree * 3642 tree_operand_check (tree __t, int __i, 3643 const char *__f, int __l, const char *__g) 3644 { 3645 const_tree __u = EXPR_CHECK (__t); 3646 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u)) 3647 tree_operand_check_failed (__i, __u, __f, __l, __g); 3648 return &CONST_CAST_TREE (__u)->exp.operands[__i]; 3649 } 3650 3651 inline tree * 3652 tree_operand_check_code (tree __t, enum tree_code __code, int __i, 3653 const char *__f, int __l, const char *__g) 3654 { 3655 if (TREE_CODE (__t) != __code) 3656 tree_check_failed (__t, __f, __l, __g, __code, 0); 3657 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) 3658 tree_operand_check_failed (__i, __t, __f, __l, __g); 3659 return &__t->exp.operands[__i]; 3660 } 3661 3662 inline const_tree * 3663 tree_operand_check (const_tree __t, int __i, 3664 const char *__f, int __l, const char *__g) 3665 { 3666 const_tree __u = EXPR_CHECK (__t); 3667 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u)) 3668 tree_operand_check_failed (__i, __u, __f, __l, __g); 3669 return CONST_CAST (const_tree *, &__u->exp.operands[__i]); 3670 } 3671 3672 inline const_tree * 3673 tree_operand_check_code (const_tree __t, enum tree_code __code, int __i, 3674 const char *__f, int __l, const char *__g) 3675 { 3676 if (TREE_CODE (__t) != __code) 3677 tree_check_failed (__t, __f, __l, __g, __code, 0); 3678 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) 3679 tree_operand_check_failed (__i, __t, __f, __l, __g); 3680 return CONST_CAST (const_tree *, &__t->exp.operands[__i]); 3681 } 3682 3683 #endif 3684 3685 /* True iff an identifier matches a C string. */ 3686 3687 inline bool 3688 id_equal (const_tree id, const char *str) 3689 { 3690 return !strcmp (IDENTIFIER_POINTER (id), str); 3691 } 3692 3693 inline bool 3694 id_equal (const char *str, const_tree id) 3695 { 3696 return !strcmp (str, IDENTIFIER_POINTER (id)); 3697 } 3698 3699 /* Return the number of elements in the VECTOR_TYPE given by NODE. */ 3700 3701 inline poly_uint64 3702 TYPE_VECTOR_SUBPARTS (const_tree node) 3703 { 3704 STATIC_ASSERT (NUM_POLY_INT_COEFFS <= 2); 3705 unsigned int precision = VECTOR_TYPE_CHECK (node)->type_common.precision; 3706 if (NUM_POLY_INT_COEFFS == 2) 3707 { 3708 poly_uint64 res = 0; 3709 res.coeffs[0] = 1 << (precision & 0xff); 3710 if (precision & 0x100) 3711 res.coeffs[1] = 1 << (precision & 0xff); 3712 return res; 3713 } 3714 else 3715 return 1 << precision; 3716 } 3717 3718 /* Set the number of elements in VECTOR_TYPE NODE to SUBPARTS, which must 3719 satisfy valid_vector_subparts_p. */ 3720 3721 inline void 3722 SET_TYPE_VECTOR_SUBPARTS (tree node, poly_uint64 subparts) 3723 { 3724 STATIC_ASSERT (NUM_POLY_INT_COEFFS <= 2); 3725 unsigned HOST_WIDE_INT coeff0 = subparts.coeffs[0]; 3726 int index = exact_log2 (coeff0); 3727 gcc_assert (index >= 0); 3728 if (NUM_POLY_INT_COEFFS == 2) 3729 { 3730 unsigned HOST_WIDE_INT coeff1 = subparts.coeffs[1]; 3731 gcc_assert (coeff1 == 0 || coeff1 == coeff0); 3732 VECTOR_TYPE_CHECK (node)->type_common.precision 3733 = index + (coeff1 != 0 ? 0x100 : 0); 3734 } 3735 else 3736 VECTOR_TYPE_CHECK (node)->type_common.precision = index; 3737 } 3738 3739 /* Return true if we can construct vector types with the given number 3740 of subparts. */ 3741 3742 static inline bool 3743 valid_vector_subparts_p (poly_uint64 subparts) 3744 { 3745 unsigned HOST_WIDE_INT coeff0 = subparts.coeffs[0]; 3746 if (!pow2p_hwi (coeff0)) 3747 return false; 3748 if (NUM_POLY_INT_COEFFS == 2) 3749 { 3750 unsigned HOST_WIDE_INT coeff1 = subparts.coeffs[1]; 3751 if (coeff1 != 0 && coeff1 != coeff0) 3752 return false; 3753 } 3754 return true; 3755 } 3756 3757 /* In NON_LVALUE_EXPR and VIEW_CONVERT_EXPR, set when this node is merely a 3758 wrapper added to express a location_t on behalf of the node's child 3759 (e.g. by maybe_wrap_with_location). */ 3760 3761 #define EXPR_LOCATION_WRAPPER_P(NODE) \ 3762 (TREE_CHECK2(NODE, NON_LVALUE_EXPR, VIEW_CONVERT_EXPR)->base.public_flag) 3763 3764 /* Test if EXP is merely a wrapper node, added to express a location_t 3765 on behalf of the node's child (e.g. by maybe_wrap_with_location). */ 3766 3767 inline bool 3768 location_wrapper_p (const_tree exp) 3769 { 3770 /* A wrapper node has code NON_LVALUE_EXPR or VIEW_CONVERT_EXPR, and 3771 the flag EXPR_LOCATION_WRAPPER_P is set. 3772 It normally has the same type as its operand, but it can have a 3773 different one if the type of the operand has changed (e.g. when 3774 merging duplicate decls). 3775 3776 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST. 3777 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST. */ 3778 if ((TREE_CODE (exp) == NON_LVALUE_EXPR 3779 || TREE_CODE (exp) == VIEW_CONVERT_EXPR) 3780 && EXPR_LOCATION_WRAPPER_P (exp)) 3781 return true; 3782 return false; 3783 } 3784 3785 /* Implementation of STRIP_ANY_LOCATION_WRAPPER. */ 3786 3787 inline tree 3788 tree_strip_any_location_wrapper (tree exp) 3789 { 3790 if (location_wrapper_p (exp)) 3791 return TREE_OPERAND (exp, 0); 3792 else 3793 return exp; 3794 } 3795 3796 #define error_mark_node global_trees[TI_ERROR_MARK] 3797 3798 #define intQI_type_node global_trees[TI_INTQI_TYPE] 3799 #define intHI_type_node global_trees[TI_INTHI_TYPE] 3800 #define intSI_type_node global_trees[TI_INTSI_TYPE] 3801 #define intDI_type_node global_trees[TI_INTDI_TYPE] 3802 #define intTI_type_node global_trees[TI_INTTI_TYPE] 3803 3804 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE] 3805 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE] 3806 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE] 3807 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE] 3808 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE] 3809 3810 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE] 3811 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE] 3812 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE] 3813 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE] 3814 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE] 3815 3816 #define uint16_type_node global_trees[TI_UINT16_TYPE] 3817 #define uint32_type_node global_trees[TI_UINT32_TYPE] 3818 #define uint64_type_node global_trees[TI_UINT64_TYPE] 3819 3820 #define void_node global_trees[TI_VOID] 3821 3822 #define integer_zero_node global_trees[TI_INTEGER_ZERO] 3823 #define integer_one_node global_trees[TI_INTEGER_ONE] 3824 #define integer_three_node global_trees[TI_INTEGER_THREE] 3825 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE] 3826 #define size_zero_node global_trees[TI_SIZE_ZERO] 3827 #define size_one_node global_trees[TI_SIZE_ONE] 3828 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO] 3829 #define bitsize_one_node global_trees[TI_BITSIZE_ONE] 3830 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT] 3831 3832 /* Base access nodes. */ 3833 #define access_public_node global_trees[TI_PUBLIC] 3834 #define access_protected_node global_trees[TI_PROTECTED] 3835 #define access_private_node global_trees[TI_PRIVATE] 3836 3837 #define null_pointer_node global_trees[TI_NULL_POINTER] 3838 3839 #define float_type_node global_trees[TI_FLOAT_TYPE] 3840 #define double_type_node global_trees[TI_DOUBLE_TYPE] 3841 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE] 3842 3843 /* Nodes for particular _FloatN and _FloatNx types in sequence. */ 3844 #define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)] 3845 #define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)] 3846 #define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)] 3847 3848 /* Names for individual types (code should normally iterate over all 3849 such types; these are only for back-end use, or in contexts such as 3850 *.def where iteration is not possible). */ 3851 #define float16_type_node global_trees[TI_FLOAT16_TYPE] 3852 #define float32_type_node global_trees[TI_FLOAT32_TYPE] 3853 #define float64_type_node global_trees[TI_FLOAT64_TYPE] 3854 #define float128_type_node global_trees[TI_FLOAT128_TYPE] 3855 #define float32x_type_node global_trees[TI_FLOAT32X_TYPE] 3856 #define float64x_type_node global_trees[TI_FLOAT64X_TYPE] 3857 #define float128x_type_node global_trees[TI_FLOAT128X_TYPE] 3858 3859 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE] 3860 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE] 3861 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE] 3862 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE] 3863 3864 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE] 3865 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE] 3866 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE] 3867 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE] 3868 3869 #define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)] 3870 3871 #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE] 3872 3873 #define void_type_node global_trees[TI_VOID_TYPE] 3874 /* The C type `void *'. */ 3875 #define ptr_type_node global_trees[TI_PTR_TYPE] 3876 /* The C type `const void *'. */ 3877 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE] 3878 /* The C type `size_t'. */ 3879 #define size_type_node global_trees[TI_SIZE_TYPE] 3880 #define pid_type_node global_trees[TI_PID_TYPE] 3881 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE] 3882 #define va_list_type_node global_trees[TI_VA_LIST_TYPE] 3883 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD] 3884 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD] 3885 /* The C type `FILE *'. */ 3886 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE] 3887 /* The C type `const struct tm *'. */ 3888 #define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE] 3889 /* The C type `fenv_t *'. */ 3890 #define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE] 3891 #define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE] 3892 /* The C type `fexcept_t *'. */ 3893 #define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE] 3894 #define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE] 3895 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE] 3896 3897 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE] 3898 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE] 3899 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE] 3900 3901 /* The decimal floating point types. */ 3902 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE] 3903 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE] 3904 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE] 3905 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE] 3906 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE] 3907 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE] 3908 3909 /* The fixed-point types. */ 3910 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE] 3911 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE] 3912 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE] 3913 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE] 3914 #define sat_unsigned_short_fract_type_node \ 3915 global_trees[TI_SAT_USFRACT_TYPE] 3916 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE] 3917 #define sat_unsigned_long_fract_type_node \ 3918 global_trees[TI_SAT_ULFRACT_TYPE] 3919 #define sat_unsigned_long_long_fract_type_node \ 3920 global_trees[TI_SAT_ULLFRACT_TYPE] 3921 #define short_fract_type_node global_trees[TI_SFRACT_TYPE] 3922 #define fract_type_node global_trees[TI_FRACT_TYPE] 3923 #define long_fract_type_node global_trees[TI_LFRACT_TYPE] 3924 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE] 3925 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE] 3926 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE] 3927 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE] 3928 #define unsigned_long_long_fract_type_node \ 3929 global_trees[TI_ULLFRACT_TYPE] 3930 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE] 3931 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE] 3932 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE] 3933 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE] 3934 #define sat_unsigned_short_accum_type_node \ 3935 global_trees[TI_SAT_USACCUM_TYPE] 3936 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE] 3937 #define sat_unsigned_long_accum_type_node \ 3938 global_trees[TI_SAT_ULACCUM_TYPE] 3939 #define sat_unsigned_long_long_accum_type_node \ 3940 global_trees[TI_SAT_ULLACCUM_TYPE] 3941 #define short_accum_type_node global_trees[TI_SACCUM_TYPE] 3942 #define accum_type_node global_trees[TI_ACCUM_TYPE] 3943 #define long_accum_type_node global_trees[TI_LACCUM_TYPE] 3944 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE] 3945 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE] 3946 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE] 3947 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE] 3948 #define unsigned_long_long_accum_type_node \ 3949 global_trees[TI_ULLACCUM_TYPE] 3950 #define qq_type_node global_trees[TI_QQ_TYPE] 3951 #define hq_type_node global_trees[TI_HQ_TYPE] 3952 #define sq_type_node global_trees[TI_SQ_TYPE] 3953 #define dq_type_node global_trees[TI_DQ_TYPE] 3954 #define tq_type_node global_trees[TI_TQ_TYPE] 3955 #define uqq_type_node global_trees[TI_UQQ_TYPE] 3956 #define uhq_type_node global_trees[TI_UHQ_TYPE] 3957 #define usq_type_node global_trees[TI_USQ_TYPE] 3958 #define udq_type_node global_trees[TI_UDQ_TYPE] 3959 #define utq_type_node global_trees[TI_UTQ_TYPE] 3960 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE] 3961 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE] 3962 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE] 3963 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE] 3964 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE] 3965 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE] 3966 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE] 3967 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE] 3968 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE] 3969 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE] 3970 #define ha_type_node global_trees[TI_HA_TYPE] 3971 #define sa_type_node global_trees[TI_SA_TYPE] 3972 #define da_type_node global_trees[TI_DA_TYPE] 3973 #define ta_type_node global_trees[TI_TA_TYPE] 3974 #define uha_type_node global_trees[TI_UHA_TYPE] 3975 #define usa_type_node global_trees[TI_USA_TYPE] 3976 #define uda_type_node global_trees[TI_UDA_TYPE] 3977 #define uta_type_node global_trees[TI_UTA_TYPE] 3978 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE] 3979 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE] 3980 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE] 3981 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE] 3982 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE] 3983 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE] 3984 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE] 3985 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE] 3986 3987 /* The node that should be placed at the end of a parameter list to 3988 indicate that the function does not take a variable number of 3989 arguments. The TREE_VALUE will be void_type_node and there will be 3990 no TREE_CHAIN. Language-independent code should not assume 3991 anything else about this node. */ 3992 #define void_list_node global_trees[TI_VOID_LIST_NODE] 3993 3994 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER] 3995 #define MAIN_NAME_P(NODE) \ 3996 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node) 3997 3998 /* Optimization options (OPTIMIZATION_NODE) to use for default and current 3999 functions. */ 4000 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT] 4001 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT] 4002 4003 /* Default/current target options (TARGET_OPTION_NODE). */ 4004 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT] 4005 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT] 4006 4007 /* Default tree list option(), optimize() pragmas to be linked into the 4008 attribute list. */ 4009 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA] 4010 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA] 4011 4012 #define char_type_node integer_types[itk_char] 4013 #define signed_char_type_node integer_types[itk_signed_char] 4014 #define unsigned_char_type_node integer_types[itk_unsigned_char] 4015 #define short_integer_type_node integer_types[itk_short] 4016 #define short_unsigned_type_node integer_types[itk_unsigned_short] 4017 #define integer_type_node integer_types[itk_int] 4018 #define unsigned_type_node integer_types[itk_unsigned_int] 4019 #define long_integer_type_node integer_types[itk_long] 4020 #define long_unsigned_type_node integer_types[itk_unsigned_long] 4021 #define long_long_integer_type_node integer_types[itk_long_long] 4022 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long] 4023 4024 /* True if NODE is an erroneous expression. */ 4025 4026 #define error_operand_p(NODE) \ 4027 ((NODE) == error_mark_node \ 4028 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node)) 4029 4030 /* Return the number of elements encoded directly in a VECTOR_CST. */ 4031 4032 inline unsigned int 4033 vector_cst_encoded_nelts (const_tree t) 4034 { 4035 return VECTOR_CST_NPATTERNS (t) * VECTOR_CST_NELTS_PER_PATTERN (t); 4036 } 4037 4038 extern tree decl_assembler_name (tree); 4039 extern void overwrite_decl_assembler_name (tree decl, tree name); 4040 extern tree decl_comdat_group (const_tree); 4041 extern tree decl_comdat_group_id (const_tree); 4042 extern const char *decl_section_name (const_tree); 4043 extern void set_decl_section_name (tree, const char *); 4044 extern enum tls_model decl_tls_model (const_tree); 4045 extern void set_decl_tls_model (tree, enum tls_model); 4046 4047 /* Compute the number of bytes occupied by 'node'. This routine only 4048 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */ 4049 4050 extern size_t tree_size (const_tree); 4051 4052 /* Compute the number of bytes occupied by a tree with code CODE. 4053 This function cannot be used for TREE_VEC or INTEGER_CST nodes, 4054 which are of variable length. */ 4055 extern size_t tree_code_size (enum tree_code); 4056 4057 /* Allocate and return a new UID from the DECL_UID namespace. */ 4058 extern int allocate_decl_uid (void); 4059 4060 /* Lowest level primitive for allocating a node. 4061 The TREE_CODE is the only argument. Contents are initialized 4062 to zero except for a few of the common fields. */ 4063 4064 extern tree make_node (enum tree_code CXX_MEM_STAT_INFO); 4065 4066 /* Free tree node. */ 4067 4068 extern void free_node (tree); 4069 4070 /* Make a copy of a node, with all the same contents. */ 4071 4072 extern tree copy_node (tree CXX_MEM_STAT_INFO); 4073 4074 /* Make a copy of a chain of TREE_LIST nodes. */ 4075 4076 extern tree copy_list (tree); 4077 4078 /* Make a CASE_LABEL_EXPR. */ 4079 4080 extern tree build_case_label (tree, tree, tree); 4081 4082 /* Make a BINFO. */ 4083 extern tree make_tree_binfo (unsigned CXX_MEM_STAT_INFO); 4084 4085 /* Make an INTEGER_CST. */ 4086 4087 extern tree make_int_cst (int, int CXX_MEM_STAT_INFO); 4088 4089 /* Make a TREE_VEC. */ 4090 4091 extern tree make_tree_vec (int CXX_MEM_STAT_INFO); 4092 4093 /* Grow a TREE_VEC. */ 4094 4095 extern tree grow_tree_vec (tree v, int CXX_MEM_STAT_INFO); 4096 4097 /* Construct various types of nodes. */ 4098 4099 extern tree build_nt (enum tree_code, ...); 4100 extern tree build_nt_call_vec (tree, vec<tree, va_gc> *); 4101 4102 extern tree build0 (enum tree_code, tree CXX_MEM_STAT_INFO); 4103 extern tree build1 (enum tree_code, tree, tree CXX_MEM_STAT_INFO); 4104 extern tree build2 (enum tree_code, tree, tree, tree CXX_MEM_STAT_INFO); 4105 extern tree build3 (enum tree_code, tree, tree, tree, tree CXX_MEM_STAT_INFO); 4106 extern tree build4 (enum tree_code, tree, tree, tree, tree, 4107 tree CXX_MEM_STAT_INFO); 4108 extern tree build5 (enum tree_code, tree, tree, tree, tree, tree, 4109 tree CXX_MEM_STAT_INFO); 4110 4111 /* _loc versions of build[1-5]. */ 4112 4113 static inline tree 4114 build1_loc (location_t loc, enum tree_code code, tree type, 4115 tree arg1 CXX_MEM_STAT_INFO) 4116 { 4117 tree t = build1 (code, type, arg1 PASS_MEM_STAT); 4118 if (CAN_HAVE_LOCATION_P (t)) 4119 SET_EXPR_LOCATION (t, loc); 4120 return t; 4121 } 4122 4123 static inline tree 4124 build2_loc (location_t loc, enum tree_code code, tree type, tree arg0, 4125 tree arg1 CXX_MEM_STAT_INFO) 4126 { 4127 tree t = build2 (code, type, arg0, arg1 PASS_MEM_STAT); 4128 if (CAN_HAVE_LOCATION_P (t)) 4129 SET_EXPR_LOCATION (t, loc); 4130 return t; 4131 } 4132 4133 static inline tree 4134 build3_loc (location_t loc, enum tree_code code, tree type, tree arg0, 4135 tree arg1, tree arg2 CXX_MEM_STAT_INFO) 4136 { 4137 tree t = build3 (code, type, arg0, arg1, arg2 PASS_MEM_STAT); 4138 if (CAN_HAVE_LOCATION_P (t)) 4139 SET_EXPR_LOCATION (t, loc); 4140 return t; 4141 } 4142 4143 static inline tree 4144 build4_loc (location_t loc, enum tree_code code, tree type, tree arg0, 4145 tree arg1, tree arg2, tree arg3 CXX_MEM_STAT_INFO) 4146 { 4147 tree t = build4 (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT); 4148 if (CAN_HAVE_LOCATION_P (t)) 4149 SET_EXPR_LOCATION (t, loc); 4150 return t; 4151 } 4152 4153 static inline tree 4154 build5_loc (location_t loc, enum tree_code code, tree type, tree arg0, 4155 tree arg1, tree arg2, tree arg3, tree arg4 CXX_MEM_STAT_INFO) 4156 { 4157 tree t = build5 (code, type, arg0, arg1, arg2, arg3, 4158 arg4 PASS_MEM_STAT); 4159 if (CAN_HAVE_LOCATION_P (t)) 4160 SET_EXPR_LOCATION (t, loc); 4161 return t; 4162 } 4163 4164 /* Constructs double_int from tree CST. */ 4165 4166 extern tree double_int_to_tree (tree, double_int); 4167 4168 extern tree wide_int_to_tree (tree type, const poly_wide_int_ref &cst); 4169 extern tree force_fit_type (tree, const poly_wide_int_ref &, int, bool); 4170 4171 /* Create an INT_CST node with a CST value zero extended. */ 4172 4173 /* static inline */ 4174 extern tree build_int_cst (tree, poly_int64); 4175 extern tree build_int_cstu (tree type, poly_uint64); 4176 extern tree build_int_cst_type (tree, poly_int64); 4177 extern tree make_vector (unsigned, unsigned CXX_MEM_STAT_INFO); 4178 extern tree build_vector_from_ctor (tree, vec<constructor_elt, va_gc> *); 4179 extern tree build_vector_from_val (tree, tree); 4180 extern tree build_vec_series (tree, tree, tree); 4181 extern tree build_index_vector (tree, poly_uint64, poly_uint64); 4182 extern void recompute_constructor_flags (tree); 4183 extern void verify_constructor_flags (tree); 4184 extern tree build_constructor (tree, vec<constructor_elt, va_gc> *); 4185 extern tree build_constructor_single (tree, tree, tree); 4186 extern tree build_constructor_from_list (tree, tree); 4187 extern tree build_constructor_va (tree, int, ...); 4188 extern tree build_real_from_int_cst (tree, const_tree); 4189 extern tree build_complex (tree, tree, tree); 4190 extern tree build_complex_inf (tree, bool); 4191 extern tree build_each_one_cst (tree); 4192 extern tree build_one_cst (tree); 4193 extern tree build_minus_one_cst (tree); 4194 extern tree build_all_ones_cst (tree); 4195 extern tree build_zero_cst (tree); 4196 extern tree build_string (int, const char *); 4197 extern tree build_poly_int_cst (tree, const poly_wide_int_ref &); 4198 extern tree build_tree_list (tree, tree CXX_MEM_STAT_INFO); 4199 extern tree build_tree_list_vec (const vec<tree, va_gc> * CXX_MEM_STAT_INFO); 4200 extern tree build_decl (location_t, enum tree_code, 4201 tree, tree CXX_MEM_STAT_INFO); 4202 extern tree build_fn_decl (const char *, tree); 4203 extern tree build_translation_unit_decl (tree); 4204 extern tree build_block (tree, tree, tree, tree); 4205 extern tree build_empty_stmt (location_t); 4206 extern tree build_omp_clause (location_t, enum omp_clause_code); 4207 4208 extern tree build_vl_exp (enum tree_code, int CXX_MEM_STAT_INFO); 4209 4210 extern tree build_call_nary (tree, tree, int, ...); 4211 extern tree build_call_valist (tree, tree, int, va_list); 4212 #define build_call_array(T1,T2,N,T3)\ 4213 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3) 4214 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *); 4215 extern tree build_call_vec (tree, tree, vec<tree, va_gc> *); 4216 extern tree build_call_expr_loc_array (location_t, tree, int, tree *); 4217 extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *); 4218 extern tree build_call_expr_loc (location_t, tree, int, ...); 4219 extern tree build_call_expr (tree, int, ...); 4220 extern tree build_call_expr_internal_loc (location_t, enum internal_fn, 4221 tree, int, ...); 4222 extern tree build_call_expr_internal_loc_array (location_t, enum internal_fn, 4223 tree, int, const tree *); 4224 extern tree maybe_build_call_expr_loc (location_t, combined_fn, tree, 4225 int, ...); 4226 extern tree build_alloca_call_expr (tree, unsigned int, HOST_WIDE_INT); 4227 extern tree build_string_literal (int, const char *); 4228 4229 /* Construct various nodes representing data types. */ 4230 4231 extern tree signed_or_unsigned_type_for (int, tree); 4232 extern tree signed_type_for (tree); 4233 extern tree unsigned_type_for (tree); 4234 extern tree truth_type_for (tree); 4235 extern tree build_pointer_type_for_mode (tree, machine_mode, bool); 4236 extern tree build_pointer_type (tree); 4237 extern tree build_reference_type_for_mode (tree, machine_mode, bool); 4238 extern tree build_reference_type (tree); 4239 extern tree build_vector_type_for_mode (tree, machine_mode); 4240 extern tree build_vector_type (tree, poly_int64); 4241 extern tree build_truth_vector_type (poly_uint64, poly_uint64); 4242 extern tree build_same_sized_truth_vector_type (tree vectype); 4243 extern tree build_opaque_vector_type (tree, poly_int64); 4244 extern tree build_index_type (tree); 4245 extern tree build_array_type (tree, tree, bool = false); 4246 extern tree build_nonshared_array_type (tree, tree); 4247 extern tree build_array_type_nelts (tree, poly_uint64); 4248 extern tree build_function_type (tree, tree); 4249 extern tree build_function_type_list (tree, ...); 4250 extern tree build_varargs_function_type_list (tree, ...); 4251 extern tree build_function_type_array (tree, int, tree *); 4252 extern tree build_varargs_function_type_array (tree, int, tree *); 4253 #define build_function_type_vec(RET, V) \ 4254 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V)) 4255 #define build_varargs_function_type_vec(RET, V) \ 4256 build_varargs_function_type_array (RET, vec_safe_length (V), \ 4257 vec_safe_address (V)) 4258 extern tree build_method_type_directly (tree, tree, tree); 4259 extern tree build_method_type (tree, tree); 4260 extern tree build_offset_type (tree, tree); 4261 extern tree build_complex_type (tree, bool named = false); 4262 extern tree array_type_nelts (const_tree); 4263 4264 extern tree value_member (tree, tree); 4265 extern tree purpose_member (const_tree, tree); 4266 extern bool vec_member (const_tree, vec<tree, va_gc> *); 4267 extern tree chain_index (int, tree); 4268 4269 extern int tree_int_cst_equal (const_tree, const_tree); 4270 4271 extern bool tree_fits_shwi_p (const_tree) ATTRIBUTE_PURE; 4272 extern bool tree_fits_poly_int64_p (const_tree) ATTRIBUTE_PURE; 4273 extern bool tree_fits_uhwi_p (const_tree) ATTRIBUTE_PURE; 4274 extern bool tree_fits_poly_uint64_p (const_tree) ATTRIBUTE_PURE; 4275 extern HOST_WIDE_INT tree_to_shwi (const_tree); 4276 extern poly_int64 tree_to_poly_int64 (const_tree); 4277 extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree); 4278 extern poly_uint64 tree_to_poly_uint64 (const_tree); 4279 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003) 4280 extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT 4281 tree_to_shwi (const_tree t) 4282 { 4283 gcc_assert (tree_fits_shwi_p (t)); 4284 return TREE_INT_CST_LOW (t); 4285 } 4286 4287 extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT 4288 tree_to_uhwi (const_tree t) 4289 { 4290 gcc_assert (tree_fits_uhwi_p (t)); 4291 return TREE_INT_CST_LOW (t); 4292 } 4293 #if NUM_POLY_INT_COEFFS == 1 4294 extern inline __attribute__ ((__gnu_inline__)) poly_int64 4295 tree_to_poly_int64 (const_tree t) 4296 { 4297 gcc_assert (tree_fits_poly_int64_p (t)); 4298 return TREE_INT_CST_LOW (t); 4299 } 4300 4301 extern inline __attribute__ ((__gnu_inline__)) poly_uint64 4302 tree_to_poly_uint64 (const_tree t) 4303 { 4304 gcc_assert (tree_fits_poly_uint64_p (t)); 4305 return TREE_INT_CST_LOW (t); 4306 } 4307 #endif 4308 #endif 4309 extern int tree_int_cst_sgn (const_tree); 4310 extern int tree_int_cst_sign_bit (const_tree); 4311 extern unsigned int tree_int_cst_min_precision (tree, signop); 4312 extern tree strip_array_types (tree); 4313 extern tree excess_precision_type (tree); 4314 extern bool valid_constant_size_p (const_tree); 4315 4316 /* Return true if T holds a value that can be represented as a poly_int64 4317 without loss of precision. Store the value in *VALUE if so. */ 4318 4319 inline bool 4320 poly_int_tree_p (const_tree t, poly_int64_pod *value) 4321 { 4322 if (tree_fits_poly_int64_p (t)) 4323 { 4324 *value = tree_to_poly_int64 (t); 4325 return true; 4326 } 4327 return false; 4328 } 4329 4330 /* Return true if T holds a value that can be represented as a poly_uint64 4331 without loss of precision. Store the value in *VALUE if so. */ 4332 4333 inline bool 4334 poly_int_tree_p (const_tree t, poly_uint64_pod *value) 4335 { 4336 if (tree_fits_poly_uint64_p (t)) 4337 { 4338 *value = tree_to_poly_uint64 (t); 4339 return true; 4340 } 4341 return false; 4342 } 4343 4344 /* From expmed.c. Since rtl.h is included after tree.h, we can't 4345 put the prototype here. Rtl.h does declare the prototype if 4346 tree.h had been included. */ 4347 4348 extern tree make_tree (tree, rtx); 4349 4350 /* Returns true iff CAND and BASE have equivalent language-specific 4351 qualifiers. */ 4352 4353 extern bool check_lang_type (const_tree cand, const_tree base); 4354 4355 /* Returns true iff unqualified CAND and BASE are equivalent. */ 4356 4357 extern bool check_base_type (const_tree cand, const_tree base); 4358 4359 /* Check whether CAND is suitable to be returned from get_qualified_type 4360 (BASE, TYPE_QUALS). */ 4361 4362 extern bool check_qualified_type (const_tree, const_tree, int); 4363 4364 /* Return a version of the TYPE, qualified as indicated by the 4365 TYPE_QUALS, if one exists. If no qualified version exists yet, 4366 return NULL_TREE. */ 4367 4368 extern tree get_qualified_type (tree, int); 4369 4370 /* Like get_qualified_type, but creates the type if it does not 4371 exist. This function never returns NULL_TREE. */ 4372 4373 extern tree build_qualified_type (tree, int CXX_MEM_STAT_INFO); 4374 4375 /* Create a variant of type T with alignment ALIGN. */ 4376 4377 extern tree build_aligned_type (tree, unsigned int); 4378 4379 /* Like build_qualified_type, but only deals with the `const' and 4380 `volatile' qualifiers. This interface is retained for backwards 4381 compatibility with the various front-ends; new code should use 4382 build_qualified_type instead. */ 4383 4384 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \ 4385 build_qualified_type ((TYPE), \ 4386 ((CONST_P) ? TYPE_QUAL_CONST : 0) \ 4387 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0)) 4388 4389 /* Make a copy of a type node. */ 4390 4391 extern tree build_distinct_type_copy (tree CXX_MEM_STAT_INFO); 4392 extern tree build_variant_type_copy (tree CXX_MEM_STAT_INFO); 4393 4394 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), 4395 return a canonicalized ..._TYPE node, so that duplicates are not made. 4396 How the hash code is computed is up to the caller, as long as any two 4397 callers that could hash identical-looking type nodes agree. */ 4398 4399 extern hashval_t type_hash_canon_hash (tree); 4400 extern tree type_hash_canon (unsigned int, tree); 4401 4402 extern tree convert (tree, tree); 4403 extern unsigned int expr_align (const_tree); 4404 extern tree size_in_bytes_loc (location_t, const_tree); 4405 inline tree 4406 size_in_bytes (const_tree t) 4407 { 4408 return size_in_bytes_loc (input_location, t); 4409 } 4410 4411 extern HOST_WIDE_INT int_size_in_bytes (const_tree); 4412 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree); 4413 extern tree bit_position (const_tree); 4414 extern tree byte_position (const_tree); 4415 extern HOST_WIDE_INT int_byte_position (const_tree); 4416 4417 /* Type for sizes of data-type. */ 4418 4419 #define sizetype sizetype_tab[(int) stk_sizetype] 4420 #define bitsizetype sizetype_tab[(int) stk_bitsizetype] 4421 #define ssizetype sizetype_tab[(int) stk_ssizetype] 4422 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype] 4423 #define size_int(L) size_int_kind (L, stk_sizetype) 4424 #define ssize_int(L) size_int_kind (L, stk_ssizetype) 4425 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype) 4426 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype) 4427 4428 /* Log2 of BITS_PER_UNIT. */ 4429 4430 #if BITS_PER_UNIT == 8 4431 #define LOG2_BITS_PER_UNIT 3 4432 #elif BITS_PER_UNIT == 16 4433 #define LOG2_BITS_PER_UNIT 4 4434 #else 4435 #error Unknown BITS_PER_UNIT 4436 #endif 4437 4438 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y 4439 by making the last node in X point to Y. 4440 Returns X, except if X is 0 returns Y. */ 4441 4442 extern tree chainon (tree, tree); 4443 4444 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ 4445 4446 extern tree tree_cons (tree, tree, tree CXX_MEM_STAT_INFO); 4447 4448 /* Return the last tree node in a chain. */ 4449 4450 extern tree tree_last (tree); 4451 4452 /* Reverse the order of elements in a chain, and return the new head. */ 4453 4454 extern tree nreverse (tree); 4455 4456 /* Returns the length of a chain of nodes 4457 (number of chain pointers to follow before reaching a null pointer). */ 4458 4459 extern int list_length (const_tree); 4460 4461 /* Returns the first FIELD_DECL in a type. */ 4462 4463 extern tree first_field (const_tree); 4464 4465 /* Given an initializer INIT, return TRUE if INIT is zero or some 4466 aggregate of zeros. Otherwise return FALSE. */ 4467 4468 extern bool initializer_zerop (const_tree); 4469 4470 extern wide_int vector_cst_int_elt (const_tree, unsigned int); 4471 extern tree vector_cst_elt (const_tree, unsigned int); 4472 4473 /* Given a vector VEC, return its first element if all elements are 4474 the same. Otherwise return NULL_TREE. */ 4475 4476 extern tree uniform_vector_p (const_tree); 4477 4478 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */ 4479 4480 extern vec<tree, va_gc> *ctor_to_vec (tree); 4481 4482 /* zerop (tree x) is nonzero if X is a constant of value 0. */ 4483 4484 extern int zerop (const_tree); 4485 4486 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */ 4487 4488 extern int integer_zerop (const_tree); 4489 4490 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */ 4491 4492 extern int integer_onep (const_tree); 4493 4494 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or 4495 a vector or complex where each part is 1. */ 4496 4497 extern int integer_each_onep (const_tree); 4498 4499 /* integer_all_onesp (tree x) is nonzero if X is an integer constant 4500 all of whose significant bits are 1. */ 4501 4502 extern int integer_all_onesp (const_tree); 4503 4504 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of 4505 value -1. */ 4506 4507 extern int integer_minus_onep (const_tree); 4508 4509 /* integer_pow2p (tree x) is nonzero is X is an integer constant with 4510 exactly one bit 1. */ 4511 4512 extern int integer_pow2p (const_tree); 4513 4514 /* integer_nonzerop (tree x) is nonzero if X is an integer constant 4515 with a nonzero value. */ 4516 4517 extern int integer_nonzerop (const_tree); 4518 4519 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or 4520 a vector where each element is an integer constant of value -1. */ 4521 4522 extern int integer_truep (const_tree); 4523 4524 extern bool cst_and_fits_in_hwi (const_tree); 4525 extern tree num_ending_zeros (const_tree); 4526 4527 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of 4528 value 0. */ 4529 4530 extern int fixed_zerop (const_tree); 4531 4532 /* staticp (tree x) is nonzero if X is a reference to data allocated 4533 at a fixed address in memory. Returns the outermost data. */ 4534 4535 extern tree staticp (tree); 4536 4537 /* save_expr (EXP) returns an expression equivalent to EXP 4538 but it can be used multiple times within context CTX 4539 and only evaluate EXP once. */ 4540 4541 extern tree save_expr (tree); 4542 4543 /* Return true if T is function-invariant. */ 4544 4545 extern bool tree_invariant_p (tree); 4546 4547 /* Look inside EXPR into any simple arithmetic operations. Return the 4548 outermost non-arithmetic or non-invariant node. */ 4549 4550 extern tree skip_simple_arithmetic (tree); 4551 4552 /* Look inside EXPR into simple arithmetic operations involving constants. 4553 Return the outermost non-arithmetic or non-constant node. */ 4554 4555 extern tree skip_simple_constant_arithmetic (tree); 4556 4557 /* Return which tree structure is used by T. */ 4558 4559 enum tree_node_structure_enum tree_node_structure (const_tree); 4560 4561 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a 4562 size or offset that depends on a field within a record. */ 4563 4564 extern bool contains_placeholder_p (const_tree); 4565 4566 /* This macro calls the above function but short-circuits the common 4567 case of a constant to save time. Also check for null. */ 4568 4569 #define CONTAINS_PLACEHOLDER_P(EXP) \ 4570 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP)) 4571 4572 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR 4573 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and 4574 field positions. */ 4575 4576 extern bool type_contains_placeholder_p (tree); 4577 4578 /* Given a tree EXP, find all occurrences of references to fields 4579 in a PLACEHOLDER_EXPR and place them in vector REFS without 4580 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that 4581 we assume here that EXP contains only arithmetic expressions 4582 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their 4583 argument list. */ 4584 4585 extern void find_placeholder_in_expr (tree, vec<tree> *); 4586 4587 /* This macro calls the above function but short-circuits the common 4588 case of a constant to save time and also checks for NULL. */ 4589 4590 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \ 4591 do { \ 4592 if((EXP) && !TREE_CONSTANT (EXP)) \ 4593 find_placeholder_in_expr (EXP, V); \ 4594 } while (0) 4595 4596 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, 4597 return a tree with all occurrences of references to F in a 4598 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and 4599 CONST_DECLs. Note that we assume here that EXP contains only 4600 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs 4601 occurring only in their argument list. */ 4602 4603 extern tree substitute_in_expr (tree, tree, tree); 4604 4605 /* This macro calls the above function but short-circuits the common 4606 case of a constant to save time and also checks for NULL. */ 4607 4608 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \ 4609 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R)) 4610 4611 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement 4612 for it within OBJ, a tree that is an object or a chain of references. */ 4613 4614 extern tree substitute_placeholder_in_expr (tree, tree); 4615 4616 /* This macro calls the above function but short-circuits the common 4617 case of a constant to save time and also checks for NULL. */ 4618 4619 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \ 4620 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \ 4621 : substitute_placeholder_in_expr (EXP, OBJ)) 4622 4623 4624 /* stabilize_reference (EXP) returns a reference equivalent to EXP 4625 but it can be used multiple times 4626 and only evaluate the subexpressions once. */ 4627 4628 extern tree stabilize_reference (tree); 4629 4630 /* Return EXP, stripped of any conversions to wider types 4631 in such a way that the result of converting to type FOR_TYPE 4632 is the same as if EXP were converted to FOR_TYPE. 4633 If FOR_TYPE is 0, it signifies EXP's type. */ 4634 4635 extern tree get_unwidened (tree, tree); 4636 4637 /* Return OP or a simpler expression for a narrower value 4638 which can be sign-extended or zero-extended to give back OP. 4639 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended 4640 or 0 if the value should be sign-extended. */ 4641 4642 extern tree get_narrower (tree, int *); 4643 4644 /* Return true if T is an expression that get_inner_reference handles. */ 4645 4646 static inline bool 4647 handled_component_p (const_tree t) 4648 { 4649 switch (TREE_CODE (t)) 4650 { 4651 case COMPONENT_REF: 4652 case BIT_FIELD_REF: 4653 case ARRAY_REF: 4654 case ARRAY_RANGE_REF: 4655 case REALPART_EXPR: 4656 case IMAGPART_EXPR: 4657 case VIEW_CONVERT_EXPR: 4658 return true; 4659 4660 default: 4661 return false; 4662 } 4663 } 4664 4665 /* Return true T is a component with reverse storage order. */ 4666 4667 static inline bool 4668 reverse_storage_order_for_component_p (tree t) 4669 { 4670 /* The storage order only applies to scalar components. */ 4671 if (AGGREGATE_TYPE_P (TREE_TYPE (t)) || VECTOR_TYPE_P (TREE_TYPE (t))) 4672 return false; 4673 4674 if (TREE_CODE (t) == REALPART_EXPR || TREE_CODE (t) == IMAGPART_EXPR) 4675 t = TREE_OPERAND (t, 0); 4676 4677 switch (TREE_CODE (t)) 4678 { 4679 case ARRAY_REF: 4680 case COMPONENT_REF: 4681 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */ 4682 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */ 4683 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0))) 4684 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t, 0))); 4685 4686 case BIT_FIELD_REF: 4687 case MEM_REF: 4688 return REF_REVERSE_STORAGE_ORDER (t); 4689 4690 case ARRAY_RANGE_REF: 4691 case VIEW_CONVERT_EXPR: 4692 default: 4693 return false; 4694 } 4695 4696 gcc_unreachable (); 4697 } 4698 4699 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR 4700 that can modify the storage order of objects. Note that, even if the 4701 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the 4702 outer type, a VIEW_CONVERT_EXPR can modify the storage order because 4703 it can change the partition of the aggregate object into scalars. */ 4704 4705 static inline bool 4706 storage_order_barrier_p (const_tree t) 4707 { 4708 if (TREE_CODE (t) != VIEW_CONVERT_EXPR) 4709 return false; 4710 4711 if (AGGREGATE_TYPE_P (TREE_TYPE (t)) 4712 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t))) 4713 return true; 4714 4715 tree op = TREE_OPERAND (t, 0); 4716 4717 if (AGGREGATE_TYPE_P (TREE_TYPE (op)) 4718 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op))) 4719 return true; 4720 4721 return false; 4722 } 4723 4724 /* Given a DECL or TYPE, return the scope in which it was declared, or 4725 NUL_TREE if there is no containing scope. */ 4726 4727 extern tree get_containing_scope (const_tree); 4728 4729 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */ 4730 4731 extern const_tree get_ultimate_context (const_tree); 4732 4733 /* Return the FUNCTION_DECL which provides this _DECL with its context, 4734 or zero if none. */ 4735 extern tree decl_function_context (const_tree); 4736 4737 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides 4738 this _DECL with its context, or zero if none. */ 4739 extern tree decl_type_context (const_tree); 4740 4741 /* Return 1 if EXPR is the real constant zero. */ 4742 extern int real_zerop (const_tree); 4743 4744 /* Initialize the iterator I with arguments from function FNDECL */ 4745 4746 static inline void 4747 function_args_iter_init (function_args_iterator *i, const_tree fntype) 4748 { 4749 i->next = TYPE_ARG_TYPES (fntype); 4750 } 4751 4752 /* Return a pointer that holds the next argument if there are more arguments to 4753 handle, otherwise return NULL. */ 4754 4755 static inline tree * 4756 function_args_iter_cond_ptr (function_args_iterator *i) 4757 { 4758 return (i->next) ? &TREE_VALUE (i->next) : NULL; 4759 } 4760 4761 /* Return the next argument if there are more arguments to handle, otherwise 4762 return NULL. */ 4763 4764 static inline tree 4765 function_args_iter_cond (function_args_iterator *i) 4766 { 4767 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE; 4768 } 4769 4770 /* Advance to the next argument. */ 4771 static inline void 4772 function_args_iter_next (function_args_iterator *i) 4773 { 4774 gcc_assert (i->next != NULL_TREE); 4775 i->next = TREE_CHAIN (i->next); 4776 } 4777 4778 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */ 4779 4780 static inline bool 4781 inlined_function_outer_scope_p (const_tree block) 4782 { 4783 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION; 4784 } 4785 4786 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set 4787 to point to the next tree element. ITER is an instance of 4788 function_args_iterator used to iterate the arguments. */ 4789 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \ 4790 for (function_args_iter_init (&(ITER), (FNTYPE)); \ 4791 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \ 4792 function_args_iter_next (&(ITER))) 4793 4794 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set 4795 to the next tree element. ITER is an instance of function_args_iterator 4796 used to iterate the arguments. */ 4797 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \ 4798 for (function_args_iter_init (&(ITER), (FNTYPE)); \ 4799 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \ 4800 function_args_iter_next (&(ITER))) 4801 4802 /* In tree.c */ 4803 extern unsigned crc32_unsigned_n (unsigned, unsigned, unsigned); 4804 extern unsigned crc32_string (unsigned, const char *); 4805 inline unsigned 4806 crc32_unsigned (unsigned chksum, unsigned value) 4807 { 4808 return crc32_unsigned_n (chksum, value, 4); 4809 } 4810 inline unsigned 4811 crc32_byte (unsigned chksum, char byte) 4812 { 4813 return crc32_unsigned_n (chksum, byte, 1); 4814 } 4815 extern void clean_symbol_name (char *); 4816 extern tree get_file_function_name (const char *); 4817 extern tree get_callee_fndecl (const_tree); 4818 extern combined_fn get_call_combined_fn (const_tree); 4819 extern int type_num_arguments (const_tree); 4820 extern bool associative_tree_code (enum tree_code); 4821 extern bool commutative_tree_code (enum tree_code); 4822 extern bool commutative_ternary_tree_code (enum tree_code); 4823 extern bool operation_can_overflow (enum tree_code); 4824 extern bool operation_no_trapping_overflow (tree, enum tree_code); 4825 extern tree upper_bound_in_type (tree, tree); 4826 extern tree lower_bound_in_type (tree, tree); 4827 extern int operand_equal_for_phi_arg_p (const_tree, const_tree); 4828 extern tree create_artificial_label (location_t); 4829 extern const char *get_name (tree); 4830 extern bool stdarg_p (const_tree); 4831 extern bool prototype_p (const_tree); 4832 extern bool is_typedef_decl (const_tree x); 4833 extern bool typedef_variant_p (const_tree); 4834 extern bool auto_var_in_fn_p (const_tree, const_tree); 4835 extern tree build_low_bits_mask (tree, unsigned); 4836 extern bool tree_nop_conversion_p (const_tree, const_tree); 4837 extern tree tree_strip_nop_conversions (tree); 4838 extern tree tree_strip_sign_nop_conversions (tree); 4839 extern const_tree strip_invariant_refs (const_tree); 4840 extern tree lhd_gcc_personality (void); 4841 extern void assign_assembler_name_if_needed (tree); 4842 extern void warn_deprecated_use (tree, tree); 4843 extern void cache_integer_cst (tree); 4844 extern const char *combined_fn_name (combined_fn); 4845 4846 /* Compare and hash for any structure which begins with a canonical 4847 pointer. Assumes all pointers are interchangeable, which is sort 4848 of already assumed by gcc elsewhere IIRC. */ 4849 4850 static inline int 4851 struct_ptr_eq (const void *a, const void *b) 4852 { 4853 const void * const * x = (const void * const *) a; 4854 const void * const * y = (const void * const *) b; 4855 return *x == *y; 4856 } 4857 4858 static inline hashval_t 4859 struct_ptr_hash (const void *a) 4860 { 4861 const void * const * x = (const void * const *) a; 4862 return (intptr_t)*x >> 4; 4863 } 4864 4865 /* Return nonzero if CODE is a tree code that represents a truth value. */ 4866 static inline bool 4867 truth_value_p (enum tree_code code) 4868 { 4869 return (TREE_CODE_CLASS (code) == tcc_comparison 4870 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR 4871 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR 4872 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR); 4873 } 4874 4875 /* Return whether TYPE is a type suitable for an offset for 4876 a POINTER_PLUS_EXPR. */ 4877 static inline bool 4878 ptrofftype_p (tree type) 4879 { 4880 return (INTEGRAL_TYPE_P (type) 4881 && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype) 4882 && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype)); 4883 } 4884 4885 /* Return true if the argument is a complete type or an array 4886 of unknown bound (whose type is incomplete but) whose elements 4887 have complete type. */ 4888 static inline bool 4889 complete_or_array_type_p (const_tree type) 4890 { 4891 return COMPLETE_TYPE_P (type) 4892 || (TREE_CODE (type) == ARRAY_TYPE 4893 && COMPLETE_TYPE_P (TREE_TYPE (type))); 4894 } 4895 4896 /* Return true if the value of T could be represented as a poly_widest_int. */ 4897 4898 inline bool 4899 poly_int_tree_p (const_tree t) 4900 { 4901 return (TREE_CODE (t) == INTEGER_CST || POLY_INT_CST_P (t)); 4902 } 4903 4904 /* Return the bit size of BIT_FIELD_REF T, in cases where it is known 4905 to be a poly_uint64. (This is always true at the gimple level.) */ 4906 4907 inline poly_uint64 4908 bit_field_size (const_tree t) 4909 { 4910 return tree_to_poly_uint64 (TREE_OPERAND (t, 1)); 4911 } 4912 4913 /* Return the starting bit offset of BIT_FIELD_REF T, in cases where it is 4914 known to be a poly_uint64. (This is always true at the gimple level.) */ 4915 4916 inline poly_uint64 4917 bit_field_offset (const_tree t) 4918 { 4919 return tree_to_poly_uint64 (TREE_OPERAND (t, 2)); 4920 } 4921 4922 extern tree strip_float_extensions (tree); 4923 extern int really_constant_p (const_tree); 4924 extern bool ptrdiff_tree_p (const_tree, poly_int64_pod *); 4925 extern bool decl_address_invariant_p (const_tree); 4926 extern bool decl_address_ip_invariant_p (const_tree); 4927 extern bool int_fits_type_p (const_tree, const_tree); 4928 #ifndef GENERATOR_FILE 4929 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t); 4930 #endif 4931 extern bool variably_modified_type_p (tree, tree); 4932 extern int tree_log2 (const_tree); 4933 extern int tree_floor_log2 (const_tree); 4934 extern unsigned int tree_ctz (const_tree); 4935 extern int simple_cst_equal (const_tree, const_tree); 4936 4937 namespace inchash 4938 { 4939 4940 extern void add_expr (const_tree, hash &, unsigned int = 0); 4941 4942 } 4943 4944 /* Compat version until all callers are converted. Return hash for 4945 TREE with SEED. */ 4946 static inline hashval_t iterative_hash_expr(const_tree tree, hashval_t seed) 4947 { 4948 inchash::hash hstate (seed); 4949 inchash::add_expr (tree, hstate); 4950 return hstate.end (); 4951 } 4952 4953 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT); 4954 extern int type_list_equal (const_tree, const_tree); 4955 extern int chain_member (const_tree, const_tree); 4956 extern void dump_tree_statistics (void); 4957 extern void recompute_tree_invariant_for_addr_expr (tree); 4958 extern bool needs_to_live_in_memory (const_tree); 4959 extern tree reconstruct_complex_type (tree, tree); 4960 extern int real_onep (const_tree); 4961 extern int real_minus_onep (const_tree); 4962 extern void init_ttree (void); 4963 extern void build_common_tree_nodes (bool); 4964 extern void build_common_builtin_nodes (void); 4965 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int); 4966 extern tree build_nonstandard_boolean_type (unsigned HOST_WIDE_INT); 4967 extern tree build_range_type (tree, tree, tree); 4968 extern tree build_nonshared_range_type (tree, tree, tree); 4969 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *); 4970 extern HOST_WIDE_INT int_cst_value (const_tree); 4971 extern tree tree_block (tree); 4972 extern void tree_set_block (tree, tree); 4973 extern location_t *block_nonartificial_location (tree); 4974 extern location_t tree_nonartificial_location (tree); 4975 extern tree block_ultimate_origin (const_tree); 4976 extern tree get_binfo_at_offset (tree, poly_int64, tree); 4977 extern bool virtual_method_call_p (const_tree); 4978 extern tree obj_type_ref_class (const_tree ref); 4979 extern bool types_same_for_odr (const_tree type1, const_tree type2, 4980 bool strict=false); 4981 extern bool contains_bitfld_component_ref_p (const_tree); 4982 extern bool block_may_fallthru (const_tree); 4983 extern void using_eh_for_cleanups (void); 4984 extern bool using_eh_for_cleanups_p (void); 4985 extern const char *get_tree_code_name (enum tree_code); 4986 extern void set_call_expr_flags (tree, int); 4987 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, hash_set<tree>*, 4988 walk_tree_lh); 4989 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*, 4990 walk_tree_lh); 4991 #define walk_tree(a,b,c,d) \ 4992 walk_tree_1 (a, b, c, d, NULL) 4993 #define walk_tree_without_duplicates(a,b,c) \ 4994 walk_tree_without_duplicates_1 (a, b, c, NULL) 4995 4996 extern tree drop_tree_overflow (tree); 4997 4998 /* Given a memory reference expression T, return its base address. 4999 The base address of a memory reference expression is the main 5000 object being referenced. */ 5001 extern tree get_base_address (tree t); 5002 5003 /* Return a tree of sizetype representing the size, in bytes, of the element 5004 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ 5005 extern tree array_ref_element_size (tree); 5006 5007 /* Return a tree representing the upper bound of the array mentioned in 5008 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ 5009 extern tree array_ref_up_bound (tree); 5010 5011 /* Return a tree representing the lower bound of the array mentioned in 5012 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ 5013 extern tree array_ref_low_bound (tree); 5014 5015 /* Returns true if REF is an array reference or a component reference 5016 to an array at the end of a structure. If this is the case, the array 5017 may be allocated larger than its upper bound implies. */ 5018 extern bool array_at_struct_end_p (tree); 5019 5020 /* Return a tree representing the offset, in bytes, of the field referenced 5021 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */ 5022 extern tree component_ref_field_offset (tree); 5023 5024 extern int tree_map_base_eq (const void *, const void *); 5025 extern unsigned int tree_map_base_hash (const void *); 5026 extern int tree_map_base_marked_p (const void *); 5027 extern void DEBUG_FUNCTION verify_type (const_tree t); 5028 extern bool gimple_canonical_types_compatible_p (const_tree, const_tree, 5029 bool trust_type_canonical = true); 5030 extern bool type_with_interoperable_signedness (const_tree); 5031 extern bitmap get_nonnull_args (const_tree); 5032 extern int get_range_pos_neg (tree); 5033 5034 /* Return simplified tree code of type that is used for canonical type 5035 merging. */ 5036 inline enum tree_code 5037 tree_code_for_canonical_type_merging (enum tree_code code) 5038 { 5039 /* By C standard, each enumerated type shall be compatible with char, 5040 a signed integer, or an unsigned integer. The choice of type is 5041 implementation defined (in our case it depends on -fshort-enum). 5042 5043 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER 5044 type and compare only by their signedness and precision. */ 5045 if (code == ENUMERAL_TYPE) 5046 return INTEGER_TYPE; 5047 /* To allow inter-operability between languages having references and 5048 C, we consider reference types and pointers alike. Note that this is 5049 not strictly necessary for C-Fortran 2008 interoperability because 5050 Fortran define C_PTR type that needs to be compatible with C pointers 5051 and we handle this one as ptr_type_node. */ 5052 if (code == REFERENCE_TYPE) 5053 return POINTER_TYPE; 5054 return code; 5055 } 5056 5057 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type. 5058 We don't define the types for pointers, arrays and vectors. The reason is 5059 that pointers are handled specially: ptr_type_node accesses conflict with 5060 accesses to all other pointers. This is done by alias.c. 5061 Because alias sets of arrays and vectors are the same as types of their 5062 elements, we can't compute canonical type either. Otherwise we could go 5063 form void *[10] to int *[10] (because they are equivalent for canonical type 5064 machinery) and get wrong TBAA. */ 5065 5066 inline bool 5067 canonical_type_used_p (const_tree t) 5068 { 5069 return !(POINTER_TYPE_P (t) 5070 || TREE_CODE (t) == ARRAY_TYPE 5071 || TREE_CODE (t) == VECTOR_TYPE); 5072 } 5073 5074 #define tree_map_eq tree_map_base_eq 5075 extern unsigned int tree_map_hash (const void *); 5076 #define tree_map_marked_p tree_map_base_marked_p 5077 5078 #define tree_decl_map_eq tree_map_base_eq 5079 extern unsigned int tree_decl_map_hash (const void *); 5080 #define tree_decl_map_marked_p tree_map_base_marked_p 5081 5082 struct tree_decl_map_cache_hasher : ggc_cache_ptr_hash<tree_decl_map> 5083 { 5084 static hashval_t hash (tree_decl_map *m) { return tree_decl_map_hash (m); } 5085 static bool 5086 equal (tree_decl_map *a, tree_decl_map *b) 5087 { 5088 return tree_decl_map_eq (a, b); 5089 } 5090 5091 static int 5092 keep_cache_entry (tree_decl_map *&m) 5093 { 5094 return ggc_marked_p (m->base.from); 5095 } 5096 }; 5097 5098 #define tree_int_map_eq tree_map_base_eq 5099 #define tree_int_map_hash tree_map_base_hash 5100 #define tree_int_map_marked_p tree_map_base_marked_p 5101 5102 #define tree_vec_map_eq tree_map_base_eq 5103 #define tree_vec_map_hash tree_decl_map_hash 5104 #define tree_vec_map_marked_p tree_map_base_marked_p 5105 5106 /* A hash_map of two trees for use with GTY((cache)). Garbage collection for 5107 such a map will not mark keys, and will mark values if the key is already 5108 marked. */ 5109 struct tree_cache_traits 5110 : simple_cache_map_traits<default_hash_traits<tree>, tree> { }; 5111 typedef hash_map<tree,tree,tree_cache_traits> tree_cache_map; 5112 5113 /* Initialize the abstract argument list iterator object ITER with the 5114 arguments from CALL_EXPR node EXP. */ 5115 static inline void 5116 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter) 5117 { 5118 iter->t = exp; 5119 iter->n = call_expr_nargs (exp); 5120 iter->i = 0; 5121 } 5122 5123 static inline void 5124 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter) 5125 { 5126 iter->t = exp; 5127 iter->n = call_expr_nargs (exp); 5128 iter->i = 0; 5129 } 5130 5131 /* Return the next argument from abstract argument list iterator object ITER, 5132 and advance its state. Return NULL_TREE if there are no more arguments. */ 5133 static inline tree 5134 next_call_expr_arg (call_expr_arg_iterator *iter) 5135 { 5136 tree result; 5137 if (iter->i >= iter->n) 5138 return NULL_TREE; 5139 result = CALL_EXPR_ARG (iter->t, iter->i); 5140 iter->i++; 5141 return result; 5142 } 5143 5144 static inline const_tree 5145 next_const_call_expr_arg (const_call_expr_arg_iterator *iter) 5146 { 5147 const_tree result; 5148 if (iter->i >= iter->n) 5149 return NULL_TREE; 5150 result = CALL_EXPR_ARG (iter->t, iter->i); 5151 iter->i++; 5152 return result; 5153 } 5154 5155 /* Initialize the abstract argument list iterator object ITER, then advance 5156 past and return the first argument. Useful in for expressions, e.g. 5157 for (arg = first_call_expr_arg (exp, &iter); arg; 5158 arg = next_call_expr_arg (&iter)) */ 5159 static inline tree 5160 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter) 5161 { 5162 init_call_expr_arg_iterator (exp, iter); 5163 return next_call_expr_arg (iter); 5164 } 5165 5166 static inline const_tree 5167 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter) 5168 { 5169 init_const_call_expr_arg_iterator (exp, iter); 5170 return next_const_call_expr_arg (iter); 5171 } 5172 5173 /* Test whether there are more arguments in abstract argument list iterator 5174 ITER, without changing its state. */ 5175 static inline bool 5176 more_call_expr_args_p (const call_expr_arg_iterator *iter) 5177 { 5178 return (iter->i < iter->n); 5179 } 5180 5181 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER 5182 (of type call_expr_arg_iterator) to hold the iteration state. */ 5183 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \ 5184 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \ 5185 (arg) = next_call_expr_arg (&(iter))) 5186 5187 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \ 5188 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \ 5189 (arg) = next_const_call_expr_arg (&(iter))) 5190 5191 /* Return true if tree node T is a language-specific node. */ 5192 static inline bool 5193 is_lang_specific (const_tree t) 5194 { 5195 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES; 5196 } 5197 5198 /* Valid builtin number. */ 5199 #define BUILTIN_VALID_P(FNCODE) \ 5200 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1)) 5201 5202 /* Return the tree node for an explicit standard builtin function or NULL. */ 5203 static inline tree 5204 builtin_decl_explicit (enum built_in_function fncode) 5205 { 5206 gcc_checking_assert (BUILTIN_VALID_P (fncode)); 5207 5208 return builtin_info[(size_t)fncode].decl; 5209 } 5210 5211 /* Return the tree node for an implicit builtin function or NULL. */ 5212 static inline tree 5213 builtin_decl_implicit (enum built_in_function fncode) 5214 { 5215 size_t uns_fncode = (size_t)fncode; 5216 gcc_checking_assert (BUILTIN_VALID_P (fncode)); 5217 5218 if (!builtin_info[uns_fncode].implicit_p) 5219 return NULL_TREE; 5220 5221 return builtin_info[uns_fncode].decl; 5222 } 5223 5224 /* Set explicit builtin function nodes and whether it is an implicit 5225 function. */ 5226 5227 static inline void 5228 set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p) 5229 { 5230 size_t ufncode = (size_t)fncode; 5231 5232 gcc_checking_assert (BUILTIN_VALID_P (fncode) 5233 && (decl != NULL_TREE || !implicit_p)); 5234 5235 builtin_info[ufncode].decl = decl; 5236 builtin_info[ufncode].implicit_p = implicit_p; 5237 builtin_info[ufncode].declared_p = false; 5238 } 5239 5240 /* Set the implicit flag for a builtin function. */ 5241 5242 static inline void 5243 set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p) 5244 { 5245 size_t uns_fncode = (size_t)fncode; 5246 5247 gcc_checking_assert (BUILTIN_VALID_P (fncode) 5248 && builtin_info[uns_fncode].decl != NULL_TREE); 5249 5250 builtin_info[uns_fncode].implicit_p = implicit_p; 5251 } 5252 5253 /* Set the declared flag for a builtin function. */ 5254 5255 static inline void 5256 set_builtin_decl_declared_p (enum built_in_function fncode, bool declared_p) 5257 { 5258 size_t uns_fncode = (size_t)fncode; 5259 5260 gcc_checking_assert (BUILTIN_VALID_P (fncode) 5261 && builtin_info[uns_fncode].decl != NULL_TREE); 5262 5263 builtin_info[uns_fncode].declared_p = declared_p; 5264 } 5265 5266 /* Return whether the standard builtin function can be used as an explicit 5267 function. */ 5268 5269 static inline bool 5270 builtin_decl_explicit_p (enum built_in_function fncode) 5271 { 5272 gcc_checking_assert (BUILTIN_VALID_P (fncode)); 5273 return (builtin_info[(size_t)fncode].decl != NULL_TREE); 5274 } 5275 5276 /* Return whether the standard builtin function can be used implicitly. */ 5277 5278 static inline bool 5279 builtin_decl_implicit_p (enum built_in_function fncode) 5280 { 5281 size_t uns_fncode = (size_t)fncode; 5282 5283 gcc_checking_assert (BUILTIN_VALID_P (fncode)); 5284 return (builtin_info[uns_fncode].decl != NULL_TREE 5285 && builtin_info[uns_fncode].implicit_p); 5286 } 5287 5288 /* Return whether the standard builtin function was declared. */ 5289 5290 static inline bool 5291 builtin_decl_declared_p (enum built_in_function fncode) 5292 { 5293 size_t uns_fncode = (size_t)fncode; 5294 5295 gcc_checking_assert (BUILTIN_VALID_P (fncode)); 5296 return (builtin_info[uns_fncode].decl != NULL_TREE 5297 && builtin_info[uns_fncode].declared_p); 5298 } 5299 5300 /* Return true if T (assumed to be a DECL) is a global variable. 5301 A variable is considered global if its storage is not automatic. */ 5302 5303 static inline bool 5304 is_global_var (const_tree t) 5305 { 5306 return (TREE_STATIC (t) || DECL_EXTERNAL (t)); 5307 } 5308 5309 /* Return true if VAR may be aliased. A variable is considered as 5310 maybe aliased if it has its address taken by the local TU 5311 or possibly by another TU and might be modified through a pointer. */ 5312 5313 static inline bool 5314 may_be_aliased (const_tree var) 5315 { 5316 return (TREE_CODE (var) != CONST_DECL 5317 && (TREE_PUBLIC (var) 5318 || DECL_EXTERNAL (var) 5319 || TREE_ADDRESSABLE (var)) 5320 && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var)) 5321 && ((TREE_READONLY (var) 5322 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var))) 5323 || (TREE_CODE (var) == VAR_DECL 5324 && DECL_NONALIASED (var))))); 5325 } 5326 5327 /* Return pointer to optimization flags of FNDECL. */ 5328 static inline struct cl_optimization * 5329 opts_for_fn (const_tree fndecl) 5330 { 5331 tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl); 5332 if (fn_opts == NULL_TREE) 5333 fn_opts = optimization_default_node; 5334 return TREE_OPTIMIZATION (fn_opts); 5335 } 5336 5337 /* Return pointer to target flags of FNDECL. */ 5338 static inline cl_target_option * 5339 target_opts_for_fn (const_tree fndecl) 5340 { 5341 tree fn_opts = DECL_FUNCTION_SPECIFIC_TARGET (fndecl); 5342 if (fn_opts == NULL_TREE) 5343 fn_opts = target_option_default_node; 5344 return fn_opts == NULL_TREE ? NULL : TREE_TARGET_OPTION (fn_opts); 5345 } 5346 5347 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is 5348 the optimization level of function fndecl. */ 5349 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt) 5350 5351 /* For anonymous aggregate types, we need some sort of name to 5352 hold on to. In practice, this should not appear, but it should 5353 not be harmful if it does. */ 5354 extern const char *anon_aggrname_format(); 5355 extern bool anon_aggrname_p (const_tree); 5356 5357 /* The tree and const_tree overload templates. */ 5358 namespace wi 5359 { 5360 class unextended_tree 5361 { 5362 private: 5363 const_tree m_t; 5364 5365 public: 5366 unextended_tree () {} 5367 unextended_tree (const_tree t) : m_t (t) {} 5368 5369 unsigned int get_precision () const; 5370 const HOST_WIDE_INT *get_val () const; 5371 unsigned int get_len () const; 5372 const_tree get_tree () const { return m_t; } 5373 }; 5374 5375 template <> 5376 struct int_traits <unextended_tree> 5377 { 5378 static const enum precision_type precision_type = VAR_PRECISION; 5379 static const bool host_dependent_precision = false; 5380 static const bool is_sign_extended = false; 5381 }; 5382 5383 template <int N> 5384 class extended_tree 5385 { 5386 private: 5387 const_tree m_t; 5388 5389 public: 5390 extended_tree () {} 5391 extended_tree (const_tree); 5392 5393 unsigned int get_precision () const; 5394 const HOST_WIDE_INT *get_val () const; 5395 unsigned int get_len () const; 5396 const_tree get_tree () const { return m_t; } 5397 }; 5398 5399 template <int N> 5400 struct int_traits <extended_tree <N> > 5401 { 5402 static const enum precision_type precision_type = CONST_PRECISION; 5403 static const bool host_dependent_precision = false; 5404 static const bool is_sign_extended = true; 5405 static const unsigned int precision = N; 5406 }; 5407 5408 typedef extended_tree <WIDE_INT_MAX_PRECISION> widest_extended_tree; 5409 typedef extended_tree <ADDR_MAX_PRECISION> offset_extended_tree; 5410 5411 typedef const generic_wide_int <widest_extended_tree> tree_to_widest_ref; 5412 typedef const generic_wide_int <offset_extended_tree> tree_to_offset_ref; 5413 typedef const generic_wide_int<wide_int_ref_storage<false, false> > 5414 tree_to_wide_ref; 5415 5416 tree_to_widest_ref to_widest (const_tree); 5417 tree_to_offset_ref to_offset (const_tree); 5418 tree_to_wide_ref to_wide (const_tree); 5419 wide_int to_wide (const_tree, unsigned int); 5420 5421 typedef const poly_int <NUM_POLY_INT_COEFFS, 5422 generic_wide_int <widest_extended_tree> > 5423 tree_to_poly_widest_ref; 5424 typedef const poly_int <NUM_POLY_INT_COEFFS, 5425 generic_wide_int <offset_extended_tree> > 5426 tree_to_poly_offset_ref; 5427 typedef const poly_int <NUM_POLY_INT_COEFFS, 5428 generic_wide_int <unextended_tree> > 5429 tree_to_poly_wide_ref; 5430 5431 tree_to_poly_widest_ref to_poly_widest (const_tree); 5432 tree_to_poly_offset_ref to_poly_offset (const_tree); 5433 tree_to_poly_wide_ref to_poly_wide (const_tree); 5434 5435 template <int N> 5436 struct ints_for <generic_wide_int <extended_tree <N> >, CONST_PRECISION> 5437 { 5438 typedef generic_wide_int <extended_tree <N> > extended; 5439 static extended zero (const extended &); 5440 }; 5441 5442 template <> 5443 struct ints_for <generic_wide_int <unextended_tree>, VAR_PRECISION> 5444 { 5445 typedef generic_wide_int <unextended_tree> unextended; 5446 static unextended zero (const unextended &); 5447 }; 5448 } 5449 5450 /* Refer to INTEGER_CST T as though it were a widest_int. 5451 5452 This function gives T's actual numerical value, influenced by the 5453 signedness of its type. For example, a signed byte with just the 5454 top bit set would be -128 while an unsigned byte with the same 5455 bit pattern would be 128. 5456 5457 This is the right choice when operating on groups of INTEGER_CSTs 5458 that might have different signedness or precision. It is also the 5459 right choice in code that specifically needs an approximation of 5460 infinite-precision arithmetic instead of normal modulo arithmetic. 5461 5462 The approximation of infinite precision is good enough for realistic 5463 numbers of additions and subtractions of INTEGER_CSTs (where 5464 "realistic" includes any number less than 1 << 31) but it cannot 5465 represent the result of multiplying the two largest supported 5466 INTEGER_CSTs. The overflow-checking form of wi::mul provides a way 5467 of multiplying two arbitrary INTEGER_CSTs and checking that the 5468 result is representable as a widest_int. 5469 5470 Note that any overflow checking done on these values is relative to 5471 the range of widest_int rather than the range of a TREE_TYPE. 5472 5473 Calling this function should have no overhead in release builds, 5474 so it is OK to call it several times for the same tree. If it is 5475 useful for readability reasons to reduce the number of calls, 5476 it is more efficient to use: 5477 5478 wi::tree_to_widest_ref wt = wi::to_widest (t); 5479 5480 instead of: 5481 5482 widest_int wt = wi::to_widest (t). */ 5483 5484 inline wi::tree_to_widest_ref 5485 wi::to_widest (const_tree t) 5486 { 5487 return t; 5488 } 5489 5490 /* Refer to INTEGER_CST T as though it were an offset_int. 5491 5492 This function is an optimisation of wi::to_widest for cases 5493 in which T is known to be a bit or byte count in the range 5494 (-(2 ^ (N + BITS_PER_UNIT)), 2 ^ (N + BITS_PER_UNIT)), where N is 5495 the target's address size in bits. 5496 5497 This is the right choice when operating on bit or byte counts as 5498 untyped numbers rather than M-bit values. The wi::to_widest comments 5499 about addition, subtraction and multiplication apply here: sequences 5500 of 1 << 31 additions and subtractions do not induce overflow, but 5501 multiplying the largest sizes might. Again, 5502 5503 wi::tree_to_offset_ref wt = wi::to_offset (t); 5504 5505 is more efficient than: 5506 5507 offset_int wt = wi::to_offset (t). */ 5508 5509 inline wi::tree_to_offset_ref 5510 wi::to_offset (const_tree t) 5511 { 5512 return t; 5513 } 5514 5515 /* Refer to INTEGER_CST T as though it were a wide_int. 5516 5517 In contrast to the approximation of infinite-precision numbers given 5518 by wi::to_widest and wi::to_offset, this function treats T as a 5519 signless collection of N bits, where N is the precision of T's type. 5520 As with machine registers, signedness is determined by the operation 5521 rather than the operands; for example, there is a distinction between 5522 signed and unsigned division. 5523 5524 This is the right choice when operating on values with the same type 5525 using normal modulo arithmetic. The overflow-checking forms of things 5526 like wi::add check whether the result can be represented in T's type. 5527 5528 Calling this function should have no overhead in release builds, 5529 so it is OK to call it several times for the same tree. If it is 5530 useful for readability reasons to reduce the number of calls, 5531 it is more efficient to use: 5532 5533 wi::tree_to_wide_ref wt = wi::to_wide (t); 5534 5535 instead of: 5536 5537 wide_int wt = wi::to_wide (t). */ 5538 5539 inline wi::tree_to_wide_ref 5540 wi::to_wide (const_tree t) 5541 { 5542 return wi::storage_ref (&TREE_INT_CST_ELT (t, 0), TREE_INT_CST_NUNITS (t), 5543 TYPE_PRECISION (TREE_TYPE (t))); 5544 } 5545 5546 /* Convert INTEGER_CST T to a wide_int of precision PREC, extending or 5547 truncating as necessary. When extending, use sign extension if T's 5548 type is signed and zero extension if T's type is unsigned. */ 5549 5550 inline wide_int 5551 wi::to_wide (const_tree t, unsigned int prec) 5552 { 5553 return wide_int::from (wi::to_wide (t), prec, TYPE_SIGN (TREE_TYPE (t))); 5554 } 5555 5556 template <int N> 5557 inline wi::extended_tree <N>::extended_tree (const_tree t) 5558 : m_t (t) 5559 { 5560 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t)) <= N); 5561 } 5562 5563 template <int N> 5564 inline unsigned int 5565 wi::extended_tree <N>::get_precision () const 5566 { 5567 return N; 5568 } 5569 5570 template <int N> 5571 inline const HOST_WIDE_INT * 5572 wi::extended_tree <N>::get_val () const 5573 { 5574 return &TREE_INT_CST_ELT (m_t, 0); 5575 } 5576 5577 template <int N> 5578 inline unsigned int 5579 wi::extended_tree <N>::get_len () const 5580 { 5581 if (N == ADDR_MAX_PRECISION) 5582 return TREE_INT_CST_OFFSET_NUNITS (m_t); 5583 else if (N >= WIDE_INT_MAX_PRECISION) 5584 return TREE_INT_CST_EXT_NUNITS (m_t); 5585 else 5586 /* This class is designed to be used for specific output precisions 5587 and needs to be as fast as possible, so there is no fallback for 5588 other casees. */ 5589 gcc_unreachable (); 5590 } 5591 5592 inline unsigned int 5593 wi::unextended_tree::get_precision () const 5594 { 5595 return TYPE_PRECISION (TREE_TYPE (m_t)); 5596 } 5597 5598 inline const HOST_WIDE_INT * 5599 wi::unextended_tree::get_val () const 5600 { 5601 return &TREE_INT_CST_ELT (m_t, 0); 5602 } 5603 5604 inline unsigned int 5605 wi::unextended_tree::get_len () const 5606 { 5607 return TREE_INT_CST_NUNITS (m_t); 5608 } 5609 5610 /* Return the value of a POLY_INT_CST in its native precision. */ 5611 5612 inline wi::tree_to_poly_wide_ref 5613 poly_int_cst_value (const_tree x) 5614 { 5615 poly_int <NUM_POLY_INT_COEFFS, generic_wide_int <wi::unextended_tree> > res; 5616 for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i) 5617 res.coeffs[i] = POLY_INT_CST_COEFF (x, i); 5618 return res; 5619 } 5620 5621 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a 5622 poly_widest_int. See wi::to_widest for more details. */ 5623 5624 inline wi::tree_to_poly_widest_ref 5625 wi::to_poly_widest (const_tree t) 5626 { 5627 if (POLY_INT_CST_P (t)) 5628 { 5629 poly_int <NUM_POLY_INT_COEFFS, 5630 generic_wide_int <widest_extended_tree> > res; 5631 for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i) 5632 res.coeffs[i] = POLY_INT_CST_COEFF (t, i); 5633 return res; 5634 } 5635 return t; 5636 } 5637 5638 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a 5639 poly_offset_int. See wi::to_offset for more details. */ 5640 5641 inline wi::tree_to_poly_offset_ref 5642 wi::to_poly_offset (const_tree t) 5643 { 5644 if (POLY_INT_CST_P (t)) 5645 { 5646 poly_int <NUM_POLY_INT_COEFFS, 5647 generic_wide_int <offset_extended_tree> > res; 5648 for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i) 5649 res.coeffs[i] = POLY_INT_CST_COEFF (t, i); 5650 return res; 5651 } 5652 return t; 5653 } 5654 5655 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a 5656 poly_wide_int. See wi::to_wide for more details. */ 5657 5658 inline wi::tree_to_poly_wide_ref 5659 wi::to_poly_wide (const_tree t) 5660 { 5661 if (POLY_INT_CST_P (t)) 5662 return poly_int_cst_value (t); 5663 return t; 5664 } 5665 5666 template <int N> 5667 inline generic_wide_int <wi::extended_tree <N> > 5668 wi::ints_for <generic_wide_int <wi::extended_tree <N> >, 5669 wi::CONST_PRECISION>::zero (const extended &x) 5670 { 5671 return build_zero_cst (TREE_TYPE (x.get_tree ())); 5672 } 5673 5674 inline generic_wide_int <wi::unextended_tree> 5675 wi::ints_for <generic_wide_int <wi::unextended_tree>, 5676 wi::VAR_PRECISION>::zero (const unextended &x) 5677 { 5678 return build_zero_cst (TREE_TYPE (x.get_tree ())); 5679 } 5680 5681 namespace wi 5682 { 5683 template <typename T> 5684 bool fits_to_boolean_p (const T &x, const_tree); 5685 5686 template <typename T> 5687 bool fits_to_tree_p (const T &x, const_tree); 5688 5689 wide_int min_value (const_tree); 5690 wide_int max_value (const_tree); 5691 wide_int from_mpz (const_tree, mpz_t, bool); 5692 } 5693 5694 template <typename T> 5695 bool 5696 wi::fits_to_boolean_p (const T &x, const_tree type) 5697 { 5698 typedef typename poly_int_traits<T>::int_type int_type; 5699 return (known_eq (x, int_type (0)) 5700 || known_eq (x, int_type (TYPE_UNSIGNED (type) ? 1 : -1))); 5701 } 5702 5703 template <typename T> 5704 bool 5705 wi::fits_to_tree_p (const T &x, const_tree type) 5706 { 5707 /* Non-standard boolean types can have arbitrary precision but various 5708 transformations assume that they can only take values 0 and +/-1. */ 5709 if (TREE_CODE (type) == BOOLEAN_TYPE) 5710 return fits_to_boolean_p (x, type); 5711 5712 if (TYPE_UNSIGNED (type)) 5713 return known_eq (x, zext (x, TYPE_PRECISION (type))); 5714 else 5715 return known_eq (x, sext (x, TYPE_PRECISION (type))); 5716 } 5717 5718 /* Produce the smallest number that is represented in TYPE. The precision 5719 and sign are taken from TYPE. */ 5720 inline wide_int 5721 wi::min_value (const_tree type) 5722 { 5723 return min_value (TYPE_PRECISION (type), TYPE_SIGN (type)); 5724 } 5725 5726 /* Produce the largest number that is represented in TYPE. The precision 5727 and sign are taken from TYPE. */ 5728 inline wide_int 5729 wi::max_value (const_tree type) 5730 { 5731 return max_value (TYPE_PRECISION (type), TYPE_SIGN (type)); 5732 } 5733 5734 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2, 5735 extending both according to their respective TYPE_SIGNs. */ 5736 5737 inline bool 5738 tree_int_cst_lt (const_tree t1, const_tree t2) 5739 { 5740 return wi::to_widest (t1) < wi::to_widest (t2); 5741 } 5742 5743 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2, 5744 extending both according to their respective TYPE_SIGNs. */ 5745 5746 inline bool 5747 tree_int_cst_le (const_tree t1, const_tree t2) 5748 { 5749 return wi::to_widest (t1) <= wi::to_widest (t2); 5750 } 5751 5752 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2 5753 are both INTEGER_CSTs and their values are extended according to their 5754 respective TYPE_SIGNs. */ 5755 5756 inline int 5757 tree_int_cst_compare (const_tree t1, const_tree t2) 5758 { 5759 return wi::cmps (wi::to_widest (t1), wi::to_widest (t2)); 5760 } 5761 5762 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h, 5763 but none of these files are allowed to be included from front ends. 5764 They should be split in two. One suitable for the FEs, the other suitable 5765 for the BE. */ 5766 5767 /* Assign the RTX to declaration. */ 5768 extern void set_decl_rtl (tree, rtx); 5769 extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree); 5770 5771 /* Given an expression EXP that is a handled_component_p, 5772 look for the ultimate containing object, which is returned and specify 5773 the access position and size. */ 5774 extern tree get_inner_reference (tree, poly_int64_pod *, poly_int64_pod *, 5775 tree *, machine_mode *, int *, int *, int *); 5776 5777 extern tree build_personality_function (const char *); 5778 5779 struct GTY(()) int_n_trees_t { 5780 /* These parts are initialized at runtime */ 5781 tree signed_type; 5782 tree unsigned_type; 5783 }; 5784 5785 /* This is also in machmode.h */ 5786 extern bool int_n_enabled_p[NUM_INT_N_ENTS]; 5787 extern GTY(()) struct int_n_trees_t int_n_trees[NUM_INT_N_ENTS]; 5788 5789 /* Like bit_position, but return as an integer. It must be representable in 5790 that way (since it could be a signed value, we don't have the 5791 option of returning -1 like int_size_in_byte can. */ 5792 5793 inline HOST_WIDE_INT 5794 int_bit_position (const_tree field) 5795 { 5796 return ((wi::to_offset (DECL_FIELD_OFFSET (field)) << LOG2_BITS_PER_UNIT) 5797 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field))).to_shwi (); 5798 } 5799 5800 /* Return true if it makes sense to consider alias set for a type T. */ 5801 5802 inline bool 5803 type_with_alias_set_p (const_tree t) 5804 { 5805 /* Function and method types are never accessed as memory locations. */ 5806 if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE) 5807 return false; 5808 5809 if (COMPLETE_TYPE_P (t)) 5810 return true; 5811 5812 /* Incomplete types can not be accessed in general except for arrays 5813 where we can fetch its element despite we have no array bounds. */ 5814 if (TREE_CODE (t) == ARRAY_TYPE && COMPLETE_TYPE_P (TREE_TYPE (t))) 5815 return true; 5816 5817 return false; 5818 } 5819 5820 extern location_t set_block (location_t loc, tree block); 5821 5822 extern void gt_ggc_mx (tree &); 5823 extern void gt_pch_nx (tree &); 5824 extern void gt_pch_nx (tree &, gt_pointer_operator, void *); 5825 5826 extern bool nonnull_arg_p (const_tree); 5827 extern bool is_redundant_typedef (const_tree); 5828 extern bool default_is_empty_record (const_tree); 5829 extern HOST_WIDE_INT arg_int_size_in_bytes (const_tree); 5830 extern tree arg_size_in_bytes (const_tree); 5831 extern bool expr_type_first_operand_type_p (tree_code); 5832 5833 extern location_t 5834 set_source_range (tree expr, location_t start, location_t finish); 5835 5836 extern location_t 5837 set_source_range (tree expr, source_range src_range); 5838 5839 static inline source_range 5840 get_decl_source_range (tree decl) 5841 { 5842 location_t loc = DECL_SOURCE_LOCATION (decl); 5843 return get_range_from_loc (line_table, loc); 5844 } 5845 5846 /* Return true if it makes sense to promote/demote from_type to to_type. */ 5847 inline bool 5848 desired_pro_or_demotion_p (const_tree to_type, const_tree from_type) 5849 { 5850 unsigned int to_type_precision = TYPE_PRECISION (to_type); 5851 5852 /* OK to promote if to_type is no bigger than word_mode. */ 5853 if (to_type_precision <= GET_MODE_PRECISION (word_mode)) 5854 return true; 5855 5856 /* Otherwise, allow only if narrowing or same precision conversions. */ 5857 return to_type_precision <= TYPE_PRECISION (from_type); 5858 } 5859 5860 /* Pointer type used to declare builtins before we have seen its real 5861 declaration. */ 5862 struct builtin_structptr_type 5863 { 5864 tree& node; 5865 tree& base; 5866 const char *str; 5867 }; 5868 extern const builtin_structptr_type builtin_structptr_types[6]; 5869 5870 /* Return true if type T has the same precision as its underlying mode. */ 5871 5872 inline bool 5873 type_has_mode_precision_p (const_tree t) 5874 { 5875 return known_eq (TYPE_PRECISION (t), GET_MODE_PRECISION (TYPE_MODE (t))); 5876 } 5877 5878 #endif /* GCC_TREE_H */ 5879