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