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