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