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