1/* Front-end tree definitions for GNU compiler. 2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001 3 Free Software Foundation, Inc. 4 5This file is part of GNU CC. 6 7GNU CC is free software; you can redistribute it and/or modify 8it under the terms of the GNU General Public License as published by 9the Free Software Foundation; either version 2, or (at your option) 10any later version. 11 12GNU CC is distributed in the hope that it will be useful, 13but WITHOUT ANY WARRANTY; without even the implied warranty of 14MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15GNU General Public License for more details. 16 17You should have received a copy of the GNU General Public License 18along with GNU CC; see the file COPYING. If not, write to 19the Free Software Foundation, 59 Temple Place - Suite 330, 20Boston, MA 02111-1307, USA. */ 21 22#include "machmode.h" 23 24#ifndef RTX_CODE 25struct rtx_def; 26#endif 27 28/* Codes of tree nodes */ 29 30#define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, 31 32enum tree_code { 33#include "tree.def" 34 35 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for 36 NUM_TREE_CODE. */ 37}; 38 39#undef DEFTREECODE 40 41/* Number of tree codes. */ 42#define NUM_TREE_CODES ((int)LAST_AND_UNUSED_TREE_CODE) 43 44/* Indexed by enum tree_code, contains a character which is 45 `<' for a comparison expression, `1', for a unary arithmetic 46 expression, `2' for a binary arithmetic expression, `e' for 47 other types of expressions, `r' for a reference, `c' for a 48 constant, `d' for a decl, `t' for a type, `s' for a statement, 49 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */ 50 51#define MAX_TREE_CODES 256 52extern char tree_code_type[MAX_TREE_CODES]; 53#define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] 54 55/* Returns non-zero iff CLASS is the tree-code class of an 56 expression. */ 57 58#define IS_EXPR_CODE_CLASS(CLASS) \ 59 (CLASS == '<' || CLASS == '1' || CLASS == '2' || CLASS == 'e') 60 61/* Number of argument-words in each kind of tree-node. */ 62 63extern int tree_code_length[MAX_TREE_CODES]; 64 65/* Names of tree components. */ 66 67extern char *tree_code_name[MAX_TREE_CODES]; 68 69/* Codes that identify the various built in functions 70 so that expand_call can identify them quickly. */ 71 72enum built_in_function 73{ 74 NOT_BUILT_IN, 75 BUILT_IN_ALLOCA, 76 BUILT_IN_ABS, 77 BUILT_IN_FABS, 78 BUILT_IN_LABS, 79 BUILT_IN_FFS, 80 BUILT_IN_DIV, 81 BUILT_IN_LDIV, 82 BUILT_IN_FFLOOR, 83 BUILT_IN_FCEIL, 84 BUILT_IN_FMOD, 85 BUILT_IN_FREM, 86 BUILT_IN_MEMCPY, 87 BUILT_IN_MEMCMP, 88 BUILT_IN_MEMSET, 89 BUILT_IN_STRCPY, 90 BUILT_IN_STRCMP, 91 BUILT_IN_STRLEN, 92 BUILT_IN_FSQRT, 93 BUILT_IN_SIN, 94 BUILT_IN_COS, 95 BUILT_IN_GETEXP, 96 BUILT_IN_GETMAN, 97 BUILT_IN_SAVEREGS, 98 BUILT_IN_CLASSIFY_TYPE, 99 BUILT_IN_NEXT_ARG, 100 BUILT_IN_ARGS_INFO, 101 BUILT_IN_CONSTANT_P, 102 BUILT_IN_FRAME_ADDRESS, 103 BUILT_IN_RETURN_ADDRESS, 104 BUILT_IN_AGGREGATE_INCOMING_ADDRESS, 105 BUILT_IN_APPLY_ARGS, 106 BUILT_IN_APPLY, 107 BUILT_IN_RETURN, 108 BUILT_IN_SETJMP, 109 BUILT_IN_LONGJMP, 110 BUILT_IN_TRAP, 111 112 /* Various hooks for the DWARF 2 __throw routine. */ 113 BUILT_IN_UNWIND_INIT, 114 BUILT_IN_DWARF_CFA, 115 BUILT_IN_DWARF_FP_REGNUM, 116 BUILT_IN_DWARF_REG_SIZE, 117 BUILT_IN_FROB_RETURN_ADDR, 118 BUILT_IN_EXTRACT_RETURN_ADDR, 119 BUILT_IN_EH_RETURN, 120 121 /* C++ extensions */ 122 BUILT_IN_NEW, 123 BUILT_IN_VEC_NEW, 124 BUILT_IN_DELETE, 125 BUILT_IN_VEC_DELETE, 126 127 /* Upper bound on non-language-specific builtins. */ 128 END_BUILTINS 129}; 130 131/* The definition of tree nodes fills the next several pages. */ 132 133/* A tree node can represent a data type, a variable, an expression 134 or a statement. Each node has a TREE_CODE which says what kind of 135 thing it represents. Some common codes are: 136 INTEGER_TYPE -- represents a type of integers. 137 ARRAY_TYPE -- represents a type of pointer. 138 VAR_DECL -- represents a declared variable. 139 INTEGER_CST -- represents a constant integer value. 140 PLUS_EXPR -- represents a sum (an expression). 141 142 As for the contents of a tree node: there are some fields 143 that all nodes share. Each TREE_CODE has various special-purpose 144 fields as well. The fields of a node are never accessed directly, 145 always through accessor macros. */ 146 147/* This type is used everywhere to refer to a tree node. */ 148 149typedef union tree_node *tree; 150 151/* Every kind of tree node starts with this structure, 152 so all nodes have these fields. 153 154 See the accessor macros, defined below, for documentation of the fields. 155 156 DO NOT change the layout of tree_common unless absolutely necessary. Some 157 front-ends (namely g++) depend on the internal layout of this tructure. 158 See my_tree_cons in the cp subdir for such uglyness. Ugh. */ 159 160struct tree_common 161{ 162 union tree_node *chain; 163 union tree_node *type; 164#ifdef ONLY_INT_FIELDS 165 unsigned int code : 8; 166#else 167 enum tree_code code : 8; 168#endif 169 170 unsigned side_effects_flag : 1; 171 unsigned constant_flag : 1; 172 unsigned permanent_flag : 1; 173 unsigned addressable_flag : 1; 174 unsigned volatile_flag : 1; 175 unsigned readonly_flag : 1; 176 unsigned unsigned_flag : 1; 177 unsigned asm_written_flag: 1; 178 179 unsigned used_flag : 1; 180 unsigned raises_flag : 1; 181 unsigned static_flag : 1; 182 unsigned public_flag : 1; 183 unsigned private_flag : 1; 184 unsigned protected_flag : 1; 185 186 unsigned lang_flag_0 : 1; 187 unsigned lang_flag_1 : 1; 188 unsigned lang_flag_2 : 1; 189 unsigned lang_flag_3 : 1; 190 unsigned lang_flag_4 : 1; 191 unsigned lang_flag_5 : 1; 192 unsigned lang_flag_6 : 1; 193 /* There is room for three more flags. */ 194}; 195 196/* The following table lists the uses of each of the above flags and 197 for which types of nodes they are defined. Note that expressions 198 include decls. 199 200 addressable_flag: 201 202 TREE_ADDRESSABLE in 203 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE 204 IDENTIFIER_NODE 205 206 static_flag: 207 208 TREE_STATIC in 209 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR 210 TREE_NO_UNUSED_WARNING in 211 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR 212 TREE_VIA_VIRTUAL in 213 TREE_LIST or TREE_VEC 214 TREE_CONSTANT_OVERFLOW in 215 INTEGER_CST, REAL_CST, COMPLEX_CST 216 TREE_SYMBOL_REFERENCED in 217 IDENTIFIER_NODE 218 219 public_flag: 220 221 TREE_OVERFLOW in 222 INTEGER_CST, REAL_CST, COMPLEX_CST 223 TREE_PUBLIC in 224 VAR_DECL or FUNCTION_DECL 225 TREE_VIA_PUBLIC in 226 TREE_LIST or TREE_VEC 227 EXPR_WFL_EMIT_LINE_NOTE in 228 EXPR_WITH_FILE_LOCATION 229 230 private_flag: 231 232 TREE_VIA_PRIVATE in 233 TREE_LIST or TREE_VEC 234 TREE_PRIVATE in 235 ??? unspecified nodes 236 237 protected_flag: 238 239 TREE_VIA_PROTECTED in 240 TREE_LIST 241 TREE_PROTECTED in 242 BLOCK 243 ??? unspecified nodes 244 245 side_effects_flag: 246 247 TREE_SIDE_EFFECTS in 248 all expressions 249 250 volatile_flag: 251 252 TREE_THIS_VOLATILE in 253 all expressions 254 TYPE_VOLATILE in 255 ..._TYPE 256 257 readonly_flag: 258 259 TREE_READONLY in 260 all expressions 261 ITERATOR_BOUND_P in 262 VAR_DECL if iterator (C) 263 TYPE_READONLY in 264 ..._TYPE 265 266 constant_flag: 267 268 TREE_CONSTANT in 269 all expressions 270 271 permanent_flag: TREE_PERMANENT in all nodes 272 273 unsigned_flag: 274 275 TREE_UNSIGNED in 276 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL 277 DECL_BUILT_IN_NONANSI in 278 FUNCTION_DECL 279 TREE_PARMLIST in 280 TREE_PARMLIST (C++) 281 SAVE_EXPR_NOPLACEHOLDER in 282 SAVE_EXPR 283 284 asm_written_flag: 285 286 TREE_ASM_WRITTEN in 287 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE 288 BLOCK 289 290 used_flag: 291 292 TREE_USED in 293 expressions, IDENTIFIER_NODE 294 295 raises_flag: 296 297 TREE_RAISES in 298 expressions 299 300 */ 301/* Define accessors for the fields that all tree nodes have 302 (though some fields are not used for all kinds of nodes). */ 303 304/* The tree-code says what kind of node it is. 305 Codes are defined in tree.def. */ 306#define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code) 307#define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE)) 308 309/* When checking is enabled, errors will be generated if a tree node 310 is accessed incorrectly. The macros abort with a fatal error, 311 except for the *1 variants, which just return 0 on failure. The 312 latter variants should only be used for combination checks, which 313 succeed when one of the checks succeed. The CHAIN_CHECK macro helps 314 defining such checks. */ 315 316#ifdef ENABLE_CHECKING 317#define DO_CHECK(FUNC, t, param) FUNC (t, param, __FILE__, __LINE__, 0) 318#define DO_CHECK1(FUNC, t, param) FUNC (t, param, __FILE__, __LINE__, 1) 319#define CHAIN_CHECK(t, c1, c2) (c1 (t) ? t : c2 (t)) 320#else 321#define DO_CHECK(FUNC, t, param) (t) 322#define DO_CHECK1(FUNC, t, param) (t) 323#define CHAIN_CHECK(t, c1, c2) (t) 324#endif 325 326#define TREE_CHECK(t, code) DO_CHECK (tree_check, t, code) 327#define TREE_CHECK1(t, code) DO_CHECK1 (tree_check, t, code) 328 329#include "tree-check.h" 330 331#define TYPE_CHECK(tree) DO_CHECK (tree_class_check, tree, 't') 332#define TYPE_CHECK1(tree) DO_CHECK1 (tree_class_check, tree, 't') 333#define DECL_CHECK(t) DO_CHECK (tree_class_check, t, 'd') 334#define DECL_CHECK1(t) DO_CHECK1 (tree_class_check, t, 'd') 335#define CST_CHECK(t) DO_CHECK (tree_class_check, t, 'c') 336#define CST_CHECK1(t) DO_CHECK1 (tree_class_check, t, 'c') 337#define EXPR_CHECK(t) DO_CHECK (expr_check, t, 0) 338 339/* Chained checks. The last check has to succeed, the others may fail. */ 340#define CST_OR_CONSTRUCTOR_CHECK(t) \ 341 CHAIN_CHECK (t, CST_CHECK1, CONSTRUCTOR_CHECK) 342 343/* In all nodes that are expressions, this is the data type of the expression. 344 In POINTER_TYPE nodes, this is the type that the pointer points to. 345 In ARRAY_TYPE nodes, this is the type of the elements. */ 346#define TREE_TYPE(NODE) ((NODE)->common.type) 347 348/* Nodes are chained together for many purposes. 349 Types are chained together to record them for being output to the debugger 350 (see the function `chain_type'). 351 Decls in the same scope are chained together to record the contents 352 of the scope. 353 Statement nodes for successive statements used to be chained together. 354 Often lists of things are represented by TREE_LIST nodes that 355 are chained together. */ 356 357#define TREE_CHAIN(NODE) ((NODE)->common.chain) 358 359/* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs 360 that don't change the machine mode. */ 361 362#define STRIP_NOPS(EXP) \ 363 while ((TREE_CODE (EXP) == NOP_EXPR \ 364 || TREE_CODE (EXP) == CONVERT_EXPR \ 365 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ 366 && (TYPE_MODE (TREE_TYPE (EXP)) \ 367 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ 368 (EXP) = TREE_OPERAND (EXP, 0); 369 370/* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ 371 372#define STRIP_TYPE_NOPS(EXP) \ 373 while ((TREE_CODE (EXP) == NOP_EXPR \ 374 || TREE_CODE (EXP) == CONVERT_EXPR \ 375 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ 376 && (TREE_TYPE (EXP) \ 377 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ 378 (EXP) = TREE_OPERAND (EXP, 0); 379 380/* Nonzero if TYPE represents an integral type. Note that we do not 381 include COMPLEX types here. */ 382 383#define INTEGRAL_TYPE_P(TYPE) \ 384 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \ 385 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE) 386 387/* Nonzero if TYPE represents a floating-point type, including complex 388 floating-point types. */ 389 390#define FLOAT_TYPE_P(TYPE) \ 391 (TREE_CODE (TYPE) == REAL_TYPE \ 392 || (TREE_CODE (TYPE) == COMPLEX_TYPE \ 393 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)) 394 395/* Nonzero if TYPE represents an aggregate (multi-component) type. */ 396 397#define AGGREGATE_TYPE_P(TYPE) \ 398 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \ 399 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \ 400 || TREE_CODE (TYPE) == SET_TYPE) 401 402/* Nonzero if TYPE represents a pointer type. */ 403 404#define POINTER_TYPE_P(TYPE) \ 405 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) 406 407/* Nonzero if TYPE represents a type. */ 408 409#define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't') 410 411/* Define many boolean fields that all tree nodes have. */ 412 413/* In VAR_DECL nodes, nonzero means address of this is needed. 414 So it cannot be in a register. 415 In a FUNCTION_DECL, nonzero means its address is needed. 416 So it must be compiled even if it is an inline function. 417 In CONSTRUCTOR nodes, it means object constructed must be in memory. 418 In LABEL_DECL nodes, it means a goto for this label has been seen 419 from a place outside all binding contours that restore stack levels. 420 In ..._TYPE nodes, it means that objects of this type must 421 be fully addressable. This means that pieces of this 422 object cannot go into register parameters, for example. 423 In IDENTIFIER_NODEs, this means that some extern decl for this name 424 had its address taken. That matters for inline functions. */ 425#define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag) 426 427/* In a VAR_DECL, nonzero means allocate static storage. 428 In a FUNCTION_DECL, nonzero if function has been defined. 429 In a CONSTRUCTOR, nonzero means allocate static storage. */ 430#define TREE_STATIC(NODE) ((NODE)->common.static_flag) 431 432/* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was 433 made implicitly and should not lead to an "unused value" warning. */ 434#define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag) 435 436/* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation 437 chain is via a `virtual' declaration. */ 438#define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag) 439 440/* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an 441 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C 442 requires a diagnostic when overflows occur in constant expressions. */ 443#define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag) 444 445/* In an IDENTIFIER_NODE, this means that assemble_name was called with 446 this string as an argument. */ 447#define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag) 448 449/* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an 450 overflow in folding, and no warning has been issued for this subexpression. 451 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */ 452#define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag) 453 454/* In a VAR_DECL or FUNCTION_DECL, 455 nonzero means name is to be accessible from outside this module. 456 In an identifier node, nonzero means an external declaration 457 accessible from outside this module was previously seen 458 for this name in an inner scope. */ 459#define TREE_PUBLIC(NODE) ((NODE)->common.public_flag) 460 461/* Nonzero for TREE_LIST or TREE_VEC node means that the path to the 462 base class is via a `public' declaration, which preserves public 463 fields from the base class as public. */ 464#define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag) 465 466/* Ditto, for `private' declarations. */ 467#define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag) 468 469/* Nonzero for TREE_LIST node means that the path to the 470 base class is via a `protected' declaration, which preserves 471 protected fields from the base class as protected. 472 OVERLOADED. */ 473#define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag) 474 475/* In any expression, nonzero means it has side effects or reevaluation 476 of the whole expression could produce a different value. 477 This is set if any subexpression is a function call, a side effect 478 or a reference to a volatile variable. 479 In a ..._DECL, this is set only if the declaration said `volatile'. */ 480#define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag) 481 482/* Nonzero means this expression is volatile in the C sense: 483 its address should be of type `volatile WHATEVER *'. 484 In other words, the declared item is volatile qualified. 485 This is used in _DECL nodes and _REF nodes. 486 487 In a ..._TYPE node, means this type is volatile-qualified. 488 But use TYPE_VOLATILE instead of this macro when the node is a type, 489 because eventually we may make that a different bit. 490 491 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ 492#define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag) 493 494/* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, 495 nonzero means it may not be the lhs of an assignment. 496 In a ..._TYPE node, means this type is const-qualified 497 (but the macro TYPE_READONLY should be used instead of this macro 498 when the node is a type). */ 499#define TREE_READONLY(NODE) ((NODE)->common.readonly_flag) 500 501/* Value of expression is constant. 502 Always appears in all ..._CST nodes. 503 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR 504 if the value is constant. */ 505#define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag) 506 507/* Nonzero means permanent node; 508 node will continue to exist for the entire compiler run. 509 Otherwise it will be recycled at the end of the function. */ 510#define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag) 511 512/* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type. 513 In FIELD_DECL nodes, means an unsigned bit field. 514 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */ 515#define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag) 516 517/* Nonzero in a VAR_DECL means assembler code has been written. 518 Nonzero in a FUNCTION_DECL means that the function has been compiled. 519 This is interesting in an inline function, since it might not need 520 to be compiled separately. 521 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE 522 if the sdb debugging info for the type has been written. 523 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */ 524#define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag) 525 526/* Nonzero in a _DECL if the name is used in its scope. 527 Nonzero in an expr node means inhibit warning if value is unused. 528 In IDENTIFIER_NODEs, this means that some extern decl for this name 529 was used. */ 530#define TREE_USED(NODE) ((NODE)->common.used_flag) 531 532/* Nonzero for a tree node whose evaluation could result 533 in the raising of an exception. Not implemented yet. */ 534#define TREE_RAISES(NODE) ((NODE)->common.raises_flag) 535 536/* Used in classes in C++. */ 537#define TREE_PRIVATE(NODE) ((NODE)->common.private_flag) 538/* Used in classes in C++. 539 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */ 540#define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag) 541 542/* These flags are available for each language front end to use internally. */ 543#define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0) 544#define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1) 545#define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2) 546#define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3) 547#define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4) 548#define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5) 549#define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6) 550 551/* Define additional fields and accessors for nodes representing constants. */ 552 553/* In an INTEGER_CST node. These two together make a 2-word integer. 554 If the data type is signed, the value is sign-extended to 2 words 555 even though not all of them may really be in use. 556 In an unsigned constant shorter than 2 words, the extra bits are 0. */ 557#define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low) 558#define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high) 559 560#define INT_CST_LT(A, B) \ 561(TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ 562 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ 563 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \ 564 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))) 565 566#define INT_CST_LT_UNSIGNED(A, B) \ 567(((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ 568 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ 569 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ 570 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \ 571 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \ 572 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))) 573 574struct tree_int_cst 575{ 576 char common[sizeof (struct tree_common)]; 577 struct rtx_def *rtl; /* acts as link to register transfer language 578 (rtl) info */ 579 HOST_WIDE_INT int_cst_low; 580 HOST_WIDE_INT int_cst_high; 581}; 582 583/* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes, 584 and generally in all kinds of constants that could 585 be given labels (rather than being immediate). */ 586 587#define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl) 588 589/* In a REAL_CST node. */ 590/* We can represent a real value as either a `double' or a string. 591 Strings don't allow for any optimization, but they do allow 592 for cross-compilation. */ 593 594#define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst) 595 596#include "real.h" 597 598struct tree_real_cst 599{ 600 char common[sizeof (struct tree_common)]; 601 struct rtx_def *rtl; /* acts as link to register transfer language 602 (rtl) info */ 603 REAL_VALUE_TYPE real_cst; 604}; 605 606/* In a STRING_CST */ 607#define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) 608#define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer) 609 610struct tree_string 611{ 612 char common[sizeof (struct tree_common)]; 613 struct rtx_def *rtl; /* acts as link to register transfer language 614 (rtl) info */ 615 int length; 616 char *pointer; 617}; 618 619/* In a COMPLEX_CST node. */ 620#define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) 621#define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) 622 623struct tree_complex 624{ 625 char common[sizeof (struct tree_common)]; 626 struct rtx_def *rtl; /* acts as link to register transfer language 627 (rtl) info */ 628 union tree_node *real; 629 union tree_node *imag; 630}; 631 632/* Define fields and accessors for some special-purpose tree nodes. */ 633 634#define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length) 635#define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer) 636 637struct tree_identifier 638{ 639 char common[sizeof (struct tree_common)]; 640 int length; 641 char *pointer; 642}; 643 644/* In a TREE_LIST node. */ 645#define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) 646#define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) 647 648struct tree_list 649{ 650 char common[sizeof (struct tree_common)]; 651 union tree_node *purpose; 652 union tree_node *value; 653}; 654 655/* In a TREE_VEC node. */ 656#define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length) 657#define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I]) 658#define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length])) 659 660struct tree_vec 661{ 662 char common[sizeof (struct tree_common)]; 663 int length; 664 union tree_node *a[1]; 665}; 666 667/* Define fields and accessors for some nodes that represent expressions. */ 668 669/* In a SAVE_EXPR node. */ 670#define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1) 671#define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2]) 672#define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE) 673 674/* In a RTL_EXPR node. */ 675#define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0]) 676#define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1]) 677 678/* In a CALL_EXPR node. */ 679#define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2]) 680 681/* In a CONSTRUCTOR node. */ 682#define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1) 683 684/* In ordinary expression nodes. */ 685#define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I]) 686#define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity) 687 688/* In a LABELED_BLOCK_EXPR node. */ 689#define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0) 690#define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1) 691 692/* In a EXIT_BLOCK_EXPR node. */ 693#define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0) 694#define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1) 695 696/* In a LOOP_EXPR node. */ 697#define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0) 698 699/* In a EXPR_WITH_FILE_LOCATION node. */ 700#define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0) 701#define EXPR_WFL_FILENAME(NODE) (IDENTIFIER_POINTER ((NODE)->common.chain)) 702#define EXPR_WFL_FILENAME_NODE(NODE) ((NODE)->common.chain) 703#define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12) 704#define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff) 705#define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity) 706#define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \ 707 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff)) 708#define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag) 709 710struct tree_exp 711{ 712 char common[sizeof (struct tree_common)]; 713 int complexity; 714 union tree_node *operands[1]; 715}; 716 717/* In a BLOCK node. */ 718#define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) 719#define BLOCK_TYPE_TAGS(NODE) (BLOCK_CHECK (NODE)->block.type_tags) 720#define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) 721#define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) 722/* Note: when changing this, make sure to find the places 723 that use chainon or nreverse. */ 724#define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE) 725#define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) 726#define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) 727#define BLOCK_END_NOTE(NODE) (BLOCK_CHECK (NODE)->block.end_note) 728/* Nonzero means that this block has separate live range regions */ 729#define BLOCK_LIVE_RANGE_FLAG(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_flag) 730 731/* Nonzero means that this block has a variable declared in it 732 that is split into separate live ranges. */ 733#define BLOCK_LIVE_RANGE_VAR_FLAG(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_var_flag) 734 735/* Index for marking the start of the block for live ranges. */ 736#define BLOCK_LIVE_RANGE_START(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_start) 737 738/* Index for marking the end of the block for live ranges. */ 739#define BLOCK_LIVE_RANGE_END(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_end) 740 741/* Nonzero means that this block is prepared to handle exceptions 742 listed in the BLOCK_VARS slot. */ 743#define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag) 744 745struct tree_block 746{ 747 char common[sizeof (struct tree_common)]; 748 749 unsigned handler_block_flag : 1; 750 unsigned abstract_flag : 1; 751 unsigned live_range_flag : 1; 752 unsigned live_range_var_flag : 1; 753 754 union tree_node *vars; 755 union tree_node *type_tags; 756 union tree_node *subblocks; 757 union tree_node *supercontext; 758 union tree_node *abstract_origin; 759 struct rtx_def *end_note; 760 int live_range_start; 761 int live_range_end; 762}; 763 764/* Define fields and accessors for nodes representing data types. */ 765 766/* See tree.def for documentation of the use of these fields. 767 Look at the documentation of the various ..._TYPE tree codes. */ 768 769#define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid) 770#define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size) 771#define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit) 772#define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode) 773#define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values) 774#define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values) 775#define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values) 776#define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval) 777#define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval) 778#define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values) 779#define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval) 780#define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval) 781#define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to) 782#define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to) 783#define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval) 784#define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval) 785#define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision) 786#define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address) 787#define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer) 788#define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name) 789#define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant) 790#define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant) 791#define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts) 792#define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context) 793#define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack) 794#define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific) 795 796/* For aggregate types, information about this type, as a base type 797 for itself. Used in a language-dependent way for types that are 798 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */ 799#define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo) 800 801/* The (language-specific) typed-based alias set for this type. 802 Objects whose TYPE_ALIAS_SETs are different cannot alias each 803 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been 804 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this 805 type can alias objects of any type. */ 806#define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set) 807 808/* Nonzero iff the typed-based alias set for this type has been 809 calculated. */ 810#define TYPE_ALIAS_SET_KNOWN_P(NODE) \ 811 (TYPE_CHECK (NODE)->type.alias_set != -1) 812 813/* A TREE_LIST of IDENTIFIER nodes of the attributes that apply 814 to this type. */ 815#define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes) 816 817/* The alignment necessary for objects of this type. 818 The value is an int, measured in bits. */ 819#define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align) 820 821#define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE)) 822 823/* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type 824 has BLKmode only because it lacks the alignment requirement for 825 its size. */ 826#define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag) 827 828/* Nonzero in a type considered volatile as a whole. */ 829#define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag) 830 831/* Means this type is const-qualified. */ 832#define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag) 833 834/* If nonzero, this type is `restrict'-qualified, in the C sense of 835 the term. */ 836#define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag) 837 838/* There is a TYPE_QUAL value for each type qualifier. They can be 839 combined by bitwise-or to form the complete set of qualifiers for a 840 type. */ 841 842#define TYPE_UNQUALIFIED 0x0 843#define TYPE_QUAL_CONST 0x1 844#define TYPE_QUAL_VOLATILE 0x2 845#define TYPE_QUAL_RESTRICT 0x4 846 847/* The set of type qualifiers for this type. */ 848#define TYPE_QUALS(NODE) \ 849 ((TYPE_READONLY(NODE) * TYPE_QUAL_CONST) | \ 850 (TYPE_VOLATILE(NODE) * TYPE_QUAL_VOLATILE) | \ 851 (TYPE_RESTRICT(NODE) * TYPE_QUAL_RESTRICT)) 852 853/* These flags are available for each language front end to use internally. */ 854#define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0) 855#define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1) 856#define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2) 857#define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3) 858#define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4) 859#define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5) 860#define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6) 861 862/* If set in an ARRAY_TYPE, indicates a string type (for languages 863 that distinguish string from array of char). 864 If set in a SET_TYPE, indicates a bitstring type. */ 865#define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag) 866 867/* If non-NULL, this is a upper bound of the size (in bytes) of an 868 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */ 869#define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE) 870 871/* Indicates that objects of this type must be initialized by calling a 872 function when they are created. */ 873#define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag) 874 875/* Indicates that objects of this type (a UNION_TYPE), should be passed 876 the same way that the first union alternative would be passed. */ 877#define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag) 878 879/* Indicated that objects of this type should be laid out in as 880 compact a way as possible. */ 881#define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag) 882 883struct tree_type 884{ 885 char common[sizeof (struct tree_common)]; 886 union tree_node *values; 887 union tree_node *size; 888 union tree_node *size_unit; 889 union tree_node *attributes; 890 unsigned uid; 891 892 unsigned char precision; 893#ifdef ONLY_INT_FIELDS 894 int mode : 8; 895#else 896 enum machine_mode mode : 8; 897#endif 898 899 unsigned string_flag : 1; 900 unsigned no_force_blk_flag : 1; 901 unsigned needs_constructing_flag : 1; 902 unsigned transparent_union_flag : 1; 903 unsigned packed_flag : 1; 904 unsigned restrict_flag : 1; 905 906 unsigned lang_flag_0 : 1; 907 unsigned lang_flag_1 : 1; 908 unsigned lang_flag_2 : 1; 909 unsigned lang_flag_3 : 1; 910 unsigned lang_flag_4 : 1; 911 unsigned lang_flag_5 : 1; 912 unsigned lang_flag_6 : 1; 913 /* room for 3 more bits */ 914 915 unsigned int align; 916 union tree_node *pointer_to; 917 union tree_node *reference_to; 918 union {int address; char *pointer; } symtab; 919 union tree_node *name; 920 union tree_node *minval; 921 union tree_node *maxval; 922 union tree_node *next_variant; 923 union tree_node *main_variant; 924 union tree_node *binfo; 925 union tree_node *noncopied_parts; 926 union tree_node *context; 927 struct obstack *obstack; 928 int alias_set; 929 /* Points to a structure whose details depend on the language in use. */ 930 struct lang_type *lang_specific; 931}; 932 933/* Define accessor macros for information about type inheritance 934 and basetypes. 935 936 A "basetype" means a particular usage of a data type for inheritance 937 in another type. Each such basetype usage has its own "binfo" 938 object to describe it. The binfo object is a TREE_VEC node. 939 940 Inheritance is represented by the binfo nodes allocated for a 941 given type. For example, given types C and D, such that D is 942 inherited by C, 3 binfo nodes will be allocated: one for describing 943 the binfo properties of C, similarly one for D, and one for 944 describing the binfo properties of D as a base type for C. 945 Thus, given a pointer to class C, one can get a pointer to the binfo 946 of D acting as a basetype for C by looking at C's binfo's basetypes. */ 947 948/* The actual data type node being inherited in this basetype. */ 949#define BINFO_TYPE(NODE) TREE_TYPE (NODE) 950 951/* The offset where this basetype appears in its containing type. 952 BINFO_OFFSET slot holds the offset (in bytes) 953 from the base of the complete object to the base of the part of the 954 object that is allocated on behalf of this `type'. 955 This is always 0 except when there is multiple inheritance. */ 956 957#define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1) 958#define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE)) 959#define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) 960 961/* The virtual function table belonging to this basetype. Virtual 962 function tables provide a mechanism for run-time method dispatching. 963 The entries of a virtual function table are language-dependent. */ 964 965#define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2) 966#define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE)) 967 968/* The virtual functions in the virtual function table. This is 969 a TREE_LIST that is used as an initial approximation for building 970 a virtual function table for this basetype. */ 971#define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3) 972#define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE)) 973 974/* A vector of additional binfos for the types inherited by this basetype. 975 976 If this basetype describes type D as inherited in C, 977 and if the basetypes of D are E anf F, 978 then this vector contains binfos for inheritance of E and F by C. 979 980 ??? This could probably be done by just allocating the 981 base types at the end of this TREE_VEC (instead of using 982 another TREE_VEC). This would simplify the calculation 983 of how many basetypes a given type had. */ 984#define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4) 985#define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4) 986 987/* Accessor macro to get to the Nth basetype of this basetype. */ 988#define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N)) 989#define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N))) 990 991/* For a BINFO record describing an inheritance, this yields a pointer 992 to the artificial FIELD_DECL node which contains the "virtual base 993 class pointer" for the given inheritance. */ 994#define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5) 995 996/* The size of a base class subobject of this type. Not all frontends 997 currently allocate the space for this field. */ 998#define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6) 999#define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE)) 1000 1001/* Slot used to build a chain that represents a use of inheritance. 1002 For example, if X is derived from Y, and Y is derived from Z, 1003 then this field can be used to link the binfo node for X to 1004 the binfo node for X's Y to represent the use of inheritance 1005 from X to Y. Similarly, this slot of the binfo node for X's Y 1006 can point to the Z from which Y is inherited (in X's inheritance 1007 hierarchy). In this fashion, one can represent and traverse specific 1008 uses of inheritance using the binfo nodes themselves (instead of 1009 consing new space pointing to binfo nodes). 1010 It is up to the language-dependent front-ends to maintain 1011 this information as necessary. */ 1012#define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0) 1013 1014/* Define fields and accessors for nodes representing declared names. */ 1015 1016/* Nonzero if DECL represents a decl. */ 1017#define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd') 1018/* This is the name of the object as written by the user. 1019 It is an IDENTIFIER_NODE. */ 1020#define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name) 1021/* This is the name of the object as the assembler will see it 1022 (but before any translations made by ASM_OUTPUT_LABELREF). 1023 Often this is the same as DECL_NAME. 1024 It is an IDENTIFIER_NODE. */ 1025#define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name) 1026/* Records the section name in a section attribute. Used to pass 1027 the name from decl_attributes to make_function_rtl and make_decl_rtl. */ 1028#define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name) 1029/* For FIELD_DECLs, this is the 1030 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is 1031 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL, 1032 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the 1033 containing function, the RECORD_TYPE or UNION_TYPE for the containing 1034 type, or NULL_TREE if the given decl has "file scope". */ 1035#define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context) 1036#define DECL_FIELD_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context) 1037/* In a DECL this is the field where configuration dependent machine 1038 attributes are store */ 1039#define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes) 1040/* In a FIELD_DECL, this is the field position, counting in bits, 1041 of the bit closest to the beginning of the structure. */ 1042#define DECL_FIELD_BITPOS(NODE) (DECL_CHECK (NODE)->decl.arguments) 1043/* In a FIELD_DECL, this indicates whether the field was a bit-field and 1044 if so, the type that was originally specified for it. 1045 TREE_TYPE may have been modified (in finish_struct). */ 1046#define DECL_BIT_FIELD_TYPE(NODE) (DECL_CHECK (NODE)->decl.result) 1047/* In FUNCTION_DECL, a chain of ..._DECL nodes. */ 1048/* VAR_DECL and PARM_DECL reserve the arguments slot 1049 for language-specific uses. */ 1050#define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments) 1051/* In FUNCTION_DECL, holds the decl for the return value. */ 1052#define DECL_RESULT(NODE) (DECL_CHECK (NODE)->decl.result) 1053/* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ 1054#define DECL_ORIGINAL_TYPE(NODE) (DECL_CHECK (NODE)->decl.result) 1055/* In PARM_DECL, holds the type as written (perhaps a function or array). */ 1056#define DECL_ARG_TYPE_AS_WRITTEN(NODE) (DECL_CHECK (NODE)->decl.result) 1057/* For a FUNCTION_DECL, holds the tree of BINDINGs. 1058 For a VAR_DECL, holds the initial value. 1059 For a PARM_DECL, not used--default 1060 values for parameters are encoded in the type of the function, 1061 not in the PARM_DECL slot. */ 1062#define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial) 1063/* For a PARM_DECL, records the data type used to pass the argument, 1064 which may be different from the type seen in the program. */ 1065#define DECL_ARG_TYPE(NODE) (DECL_CHECK (NODE)->decl.initial) /* In PARM_DECL. */ 1066/* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which 1067 if nonzero, indicates that the field occupies the type. */ 1068#define DECL_QUALIFIER(NODE) (DECL_CHECK (NODE)->decl.initial) 1069/* These two fields describe where in the source code the declaration was. */ 1070#define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename) 1071#define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum) 1072/* Holds the size of the datum, as a tree expression. 1073 Need not be constant. */ 1074#define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size) 1075/* Holds the alignment required for the datum. */ 1076#define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.frame_size.u) 1077/* Holds the machine mode corresponding to the declaration of a variable or 1078 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a 1079 FIELD_DECL. */ 1080#define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode) 1081/* Holds the RTL expression for the value of a variable or function. If 1082 PROMOTED_MODE is defined, the mode of this expression may not be same 1083 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding 1084 to the variable's data type, while the mode 1085 of DECL_RTL is the mode actually used to contain the data. */ 1086#define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl) 1087/* Holds an INSN_LIST of all of the live ranges in which the variable 1088 has been moved to a possibly different register. */ 1089#define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl) 1090/* For PARM_DECL, holds an RTL for the stack slot or register 1091 where the data was actually passed. */ 1092#define DECL_INCOMING_RTL(NODE) (DECL_CHECK (NODE)->decl.saved_insns.r) 1093/* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */ 1094#define DECL_SAVED_INSNS(NODE) (DECL_CHECK (NODE)->decl.saved_insns.r) 1095/* For FUNCTION_DECL, if it is inline, 1096 holds the size of the stack frame, as an integer. */ 1097#define DECL_FRAME_SIZE(NODE) (DECL_CHECK (NODE)->decl.frame_size.i) 1098/* For FUNCTION_DECL, if it is built-in, 1099 this identifies which built-in operation it is. */ 1100#define DECL_FUNCTION_CODE(NODE) (DECL_CHECK (NODE)->decl.frame_size.f) 1101#define DECL_SET_FUNCTION_CODE(NODE,VAL) (DECL_CHECK (NODE)->decl.frame_size.f = (VAL)) 1102/* For a FIELD_DECL, holds the size of the member as an integer. */ 1103#define DECL_FIELD_SIZE(NODE) (DECL_CHECK (NODE)->decl.saved_insns.i) 1104 1105/* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. 1106 Before the struct containing the FUNCTION_DECL is laid out, 1107 DECL_VINDEX may point to a FUNCTION_DECL in a base class which 1108 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual 1109 function. When the class is laid out, this pointer is changed 1110 to an INTEGER_CST node which is suitable for use as an index 1111 into the virtual function table. */ 1112#define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex) 1113/* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in 1114 which this FIELD_DECL is defined. This information is needed when 1115 writing debugging information about vfield and vbase decls for C++. */ 1116#define DECL_FCONTEXT(NODE) (DECL_CHECK (NODE)->decl.vindex) 1117 1118/* Every ..._DECL node gets a unique number. */ 1119#define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid) 1120 1121/* For any sort of a ..._DECL node, this points to the original (abstract) 1122 decl node which this decl is an instance of, or else it is NULL indicating 1123 that this decl is not an instance of some other decl. For example, 1124 in a nested declaration of an inline function, this points back to the 1125 definition. */ 1126#define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin) 1127 1128/* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract 1129 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ 1130#define DECL_ORIGIN(NODE) \ 1131 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE) 1132 1133/* Nonzero for any sort of ..._DECL node means this decl node represents 1134 an inline instance of some original (abstract) decl from an inline function; 1135 suppress any warnings about shadowing some other variable. */ 1136#define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0) 1137 1138/* Nonzero if a _DECL means that the name of this decl should be ignored 1139 for symbolic debug purposes. */ 1140#define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag) 1141 1142/* Nonzero for a given ..._DECL node means that this node represents an 1143 "abstract instance" of the given declaration (e.g. in the original 1144 declaration of an inline function). When generating symbolic debugging 1145 information, we mustn't try to generate any address information for nodes 1146 marked as "abstract instances" because we don't actually generate 1147 any code or allocate any data space for such instances. */ 1148#define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag) 1149 1150/* Nonzero if a _DECL means that no warnings should be generated just 1151 because this decl is unused. */ 1152#define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag) 1153 1154/* Nonzero for a given ..._DECL node means that this node should be 1155 put in .common, if possible. If a DECL_INITIAL is given, and it 1156 is not error_mark_node, then the decl cannot be put in .common. */ 1157#define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag) 1158 1159/* Language-specific decl information. */ 1160#define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific) 1161 1162/* In a VAR_DECL or FUNCTION_DECL, 1163 nonzero means external reference: 1164 do not allocate storage, and refer to a definition elsewhere. */ 1165#define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag) 1166 1167/* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority 1168 initializatons. */ 1169#define DEFAULT_INIT_PRIORITY 65535 1170#define MAX_INIT_PRIORITY 65535 1171#define MAX_RESERVED_INIT_PRIORITY 100 1172 1173/* In a TYPE_DECL 1174 nonzero means the detail info about this type is not dumped into stabs. 1175 Instead it will generate cross reference ('x') of names. 1176 This uses the same flag as DECL_EXTERNAL. */ 1177#define TYPE_DECL_SUPPRESS_DEBUG(NODE) (DECL_CHECK (NODE)->decl.external_flag) 1178 1179 1180/* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ 1181#define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag) 1182/* In LABEL_DECL nodes, nonzero means that an error message about 1183 jumping into such a binding contour has been printed for this label. */ 1184#define DECL_ERROR_ISSUED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag) 1185/* In a FIELD_DECL, indicates this field should be bit-packed. */ 1186#define DECL_PACKED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag) 1187/* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a 1188 static chain is not needed. */ 1189#define DECL_NO_STATIC_CHAIN(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag) 1190 1191/* Nonzero in a ..._DECL means this variable is ref'd from a nested function. 1192 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. 1193 1194 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. 1195 1196 Also set in some languages for variables, etc., outside the normal 1197 lexical scope, such as class instance variables. */ 1198#define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag) 1199 1200/* Nonzero in a FUNCTION_DECL means this function can be substituted 1201 where it is called. */ 1202#define DECL_INLINE(NODE) (DECL_CHECK (NODE)->decl.inline_flag) 1203 1204/* Nonzero in a FUNCTION_DECL means this is a built-in function 1205 that is not specified by ansi C and that users are supposed to be allowed 1206 to redefine for any purpose whatever. */ 1207#define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag) 1208 1209/* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed 1210 specially. */ 1211#define DECL_BIT_FIELD(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag) 1212/* In a LABEL_DECL, nonzero means label was defined inside a binding 1213 contour that restored a stack level and which is now exited. */ 1214#define DECL_TOO_LATE(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag) 1215/* In a FUNCTION_DECL, nonzero means a built in function. */ 1216#define DECL_BUILT_IN(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag) 1217/* In a VAR_DECL that's static, 1218 nonzero if the space is in the text section. */ 1219#define DECL_IN_TEXT_SECTION(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag) 1220 1221/* Used in VAR_DECLs to indicate that the variable is a vtable. 1222 Used in FIELD_DECLs for vtable pointers. 1223 Used in FUNCTION_DECLs to indicate that the function is virtual. */ 1224#define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag) 1225 1226/* Used to indicate that the linkage status of this DECL is not yet known, 1227 so it should not be output now. */ 1228#define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output) 1229 1230/* Used in PARM_DECLs whose type are unions to indicate that the 1231 argument should be passed in the same way that the first union 1232 alternative would be passed. */ 1233#define DECL_TRANSPARENT_UNION(NODE) (DECL_CHECK (NODE)->decl.transparent_union) 1234 1235/* Used in FUNCTION_DECLs to indicate that they should be run automatically 1236 at the beginning or end of execution. */ 1237#define DECL_STATIC_CONSTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_ctor_flag) 1238#define DECL_STATIC_DESTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_dtor_flag) 1239 1240/* Used to indicate that this DECL represents a compiler-generated entity. */ 1241#define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag) 1242 1243/* Used to indicate that this DECL has weak linkage. */ 1244#define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag) 1245 1246/* Used in TREE_PUBLIC decls to indicate that copies of this DECL in 1247 multiple translation units should be merged. */ 1248#define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union) 1249 1250/* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need 1251 not be put out unless it is needed in this translation unit. 1252 Entities like this are shared across translation units (like weak 1253 entities), but are guaranteed to be generated by any translation 1254 unit that needs them, and therefore need not be put out anywhere 1255 where they are not needed. DECL_COMDAT is just a hint to the 1256 back-end; it is up to front-ends which set this flag to ensure 1257 that there will never be any harm, other than bloat, in putting out 1258 something which is DECL_COMDAT. */ 1259#define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag) 1260 1261/* Used in FUNCTION_DECLs to indicate that function entry and exit should 1262 be instrumented with calls to support routines. */ 1263#define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) ((NODE)->decl.no_instrument_function_entry_exit) 1264 1265/* Used in FUNCTION_DECLs to indicate that in this function, 1266 check-memory-usage should be disabled. */ 1267#define DECL_NO_CHECK_MEMORY_USAGE(NODE) ((NODE)->decl.no_check_memory_usage) 1268 1269/* Additional flags for language-specific uses. */ 1270#define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0) 1271#define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1) 1272#define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2) 1273#define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3) 1274#define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4) 1275#define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5) 1276#define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6) 1277#define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7) 1278 1279/* Used to indicate that the pointer to this DECL cannot be treated as 1280 an address constant. */ 1281#define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p) 1282 1283/* Used to indicate an alias set for the memory pointed to by this 1284 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have 1285 pointer (or reference) type. */ 1286#define DECL_POINTER_ALIAS_SET(NODE) \ 1287 (DECL_CHECK (NODE)->decl.pointer_alias_set) 1288 1289/* Nonzero if an alias set has been assigned to this declaration. */ 1290#define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \ 1291 (DECL_POINTER_ALIAS_SET (NODE) != - 1) 1292 1293struct tree_decl 1294{ 1295 char common[sizeof (struct tree_common)]; 1296 char *filename; 1297 int linenum; 1298 unsigned int uid; 1299 union tree_node *size; 1300#ifdef ONLY_INT_FIELDS 1301 int mode : 8; 1302#else 1303 enum machine_mode mode : 8; 1304#endif 1305 1306 unsigned external_flag : 1; 1307 unsigned nonlocal_flag : 1; 1308 unsigned regdecl_flag : 1; 1309 unsigned inline_flag : 1; 1310 unsigned bit_field_flag : 1; 1311 unsigned virtual_flag : 1; 1312 unsigned ignored_flag : 1; 1313 unsigned abstract_flag : 1; 1314 1315 unsigned in_system_header_flag : 1; 1316 unsigned common_flag : 1; 1317 unsigned defer_output : 1; 1318 unsigned transparent_union : 1; 1319 unsigned static_ctor_flag : 1; 1320 unsigned static_dtor_flag : 1; 1321 unsigned artificial_flag : 1; 1322 unsigned weak_flag : 1; 1323 1324 unsigned lang_flag_0 : 1; 1325 unsigned lang_flag_1 : 1; 1326 unsigned lang_flag_2 : 1; 1327 unsigned lang_flag_3 : 1; 1328 unsigned lang_flag_4 : 1; 1329 unsigned lang_flag_5 : 1; 1330 unsigned lang_flag_6 : 1; 1331 unsigned lang_flag_7 : 1; 1332 1333 unsigned non_addr_const_p : 1; 1334 unsigned no_instrument_function_entry_exit : 1; 1335 unsigned no_check_memory_usage : 1; 1336 unsigned comdat_flag : 1; 1337 1338 /* For a FUNCTION_DECL, if inline, this is the size of frame needed. 1339 If built-in, this is the code for which built-in function. 1340 For other kinds of decls, this is DECL_ALIGN. */ 1341 union { 1342 int i; 1343 unsigned int u; 1344 enum built_in_function f; 1345 } frame_size; 1346 1347 union tree_node *name; 1348 union tree_node *context; 1349 union tree_node *arguments; 1350 union tree_node *result; 1351 union tree_node *initial; 1352 union tree_node *abstract_origin; 1353 union tree_node *assembler_name; 1354 union tree_node *section_name; 1355 union tree_node *machine_attributes; 1356 struct rtx_def *rtl; /* acts as link to register transfer language 1357 (rtl) info */ 1358 struct rtx_def *live_range_rtl; 1359 /* For FUNCTION_DECLs: points to insn that constitutes its definition 1360 on the permanent obstack. For FIELD_DECL, this is DECL_FIELD_SIZE. */ 1361 union { 1362 struct rtx_def *r; 1363 HOST_WIDE_INT i; 1364 } saved_insns; 1365 union tree_node *vindex; 1366 int pointer_alias_set; 1367 /* Points to a structure whose details depend on the language in use. */ 1368 struct lang_decl *lang_specific; 1369}; 1370 1371/* Define the overall contents of a tree node. 1372 It may be any of the structures declared above 1373 for various types of node. */ 1374 1375union tree_node 1376{ 1377 struct tree_common common; 1378 struct tree_int_cst int_cst; 1379 struct tree_real_cst real_cst; 1380 struct tree_string string; 1381 struct tree_complex complex; 1382 struct tree_identifier identifier; 1383 struct tree_decl decl; 1384 struct tree_type type; 1385 struct tree_list list; 1386 struct tree_vec vec; 1387 struct tree_exp exp; 1388 struct tree_block block; 1389 }; 1390 1391#define NULL_TREE (tree) NULL 1392 1393/* The following functions accept a wide integer argument. Rather than 1394 having to cast on every function call, we use a macro instead, that is 1395 defined here and in rtl.h. */ 1396 1397#ifndef exact_log2 1398#define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N)) 1399#define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N)) 1400#endif 1401extern int exact_log2_wide PROTO((unsigned HOST_WIDE_INT)); 1402extern int floor_log2_wide PROTO((unsigned HOST_WIDE_INT)); 1403 1404extern char *oballoc PROTO((int)); 1405extern char *permalloc PROTO((int)); 1406extern char *savealloc PROTO((int)); 1407extern char *expralloc PROTO((int)); 1408 1409/* Lowest level primitive for allocating a node. 1410 The TREE_CODE is the only argument. Contents are initialized 1411 to zero except for a few of the common fields. */ 1412 1413extern tree make_node PROTO((enum tree_code)); 1414 1415/* Make a copy of a node, with all the same contents except 1416 for TREE_PERMANENT. (The copy is permanent 1417 iff nodes being made now are permanent.) */ 1418 1419extern tree copy_node PROTO((tree)); 1420 1421/* Make a copy of a chain of TREE_LIST nodes. */ 1422 1423extern tree copy_list PROTO((tree)); 1424 1425/* Make a TREE_VEC. */ 1426 1427extern tree make_tree_vec PROTO((int)); 1428 1429/* Return the (unique) IDENTIFIER_NODE node for a given name. 1430 The name is supplied as a char *. */ 1431 1432extern tree get_identifier PROTO((const char *)); 1433 1434/* If an identifier with the name TEXT (a null-terminated string) has 1435 previously been referred to, return that node; otherwise return 1436 NULL_TREE. */ 1437 1438extern tree maybe_get_identifier PROTO((const char *)); 1439 1440/* Construct various types of nodes. */ 1441 1442#define build_int_2(LO,HI) \ 1443 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI)) 1444 1445extern tree build PVPROTO((enum tree_code, tree, ...)); 1446extern tree build_nt PVPROTO((enum tree_code, ...)); 1447extern tree build_parse_node PVPROTO((enum tree_code, ...)); 1448 1449extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT)); 1450extern tree build_real PROTO((tree, REAL_VALUE_TYPE)); 1451extern tree build_real_from_int_cst PROTO((tree, tree)); 1452extern tree build_complex PROTO((tree, tree, tree)); 1453extern tree build_string PROTO((int, const char *)); 1454extern tree build1 PROTO((enum tree_code, tree, tree)); 1455extern tree build_tree_list PROTO((tree, tree)); 1456extern tree build_decl_list PROTO((tree, tree)); 1457extern tree build_expr_list PROTO((tree, tree)); 1458extern tree build_decl PROTO((enum tree_code, tree, tree)); 1459extern tree build_block PROTO((tree, tree, tree, tree, tree)); 1460extern tree build_expr_wfl PROTO((tree, const char *, int, int)); 1461 1462/* Construct various nodes representing data types. */ 1463 1464extern tree make_signed_type PROTO((int)); 1465extern tree make_unsigned_type PROTO((int)); 1466extern void set_sizetype PROTO((tree)); 1467extern tree signed_or_unsigned_type PROTO((int, tree)); 1468extern void fixup_unsigned_type PROTO((tree)); 1469extern tree build_pointer_type PROTO((tree)); 1470extern tree build_reference_type PROTO((tree)); 1471extern tree build_index_type PROTO((tree)); 1472extern tree build_index_2_type PROTO((tree, tree)); 1473extern tree build_array_type PROTO((tree, tree)); 1474extern tree build_function_type PROTO((tree, tree)); 1475extern tree build_method_type PROTO((tree, tree)); 1476extern tree build_offset_type PROTO((tree, tree)); 1477extern tree build_complex_type PROTO((tree)); 1478extern tree array_type_nelts PROTO((tree)); 1479 1480extern tree value_member PROTO((tree, tree)); 1481extern tree purpose_member PROTO((tree, tree)); 1482extern tree binfo_member PROTO((tree, tree)); 1483extern int attribute_hash_list PROTO((tree)); 1484extern int attribute_list_equal PROTO((tree, tree)); 1485extern int attribute_list_contained PROTO((tree, tree)); 1486extern int tree_int_cst_equal PROTO((tree, tree)); 1487extern int tree_int_cst_lt PROTO((tree, tree)); 1488extern int tree_int_cst_sgn PROTO((tree)); 1489extern int index_type_equal PROTO((tree, tree)); 1490extern tree get_inner_array_type PROTO((tree)); 1491 1492/* From expmed.c. Since rtl.h is included after tree.h, we can't 1493 put the prototype here. Rtl.h does declare the prototype if 1494 tree.h had been included. */ 1495 1496extern tree make_tree PROTO((tree, struct rtx_def *)); 1497 1498/* Return a type like TTYPE except that its TYPE_ATTRIBUTES 1499 is ATTRIBUTE. 1500 1501 Such modified types already made are recorded so that duplicates 1502 are not made. */ 1503 1504extern tree build_type_attribute_variant PROTO((tree, tree)); 1505extern tree build_decl_attribute_variant PROTO((tree, tree)); 1506 1507extern tree merge_machine_decl_attributes PROTO((tree, tree)); 1508extern tree merge_machine_type_attributes PROTO((tree, tree)); 1509 1510/* Split a list of declspecs and attributes into two. */ 1511 1512extern void split_specs_attrs PROTO((tree, tree *, tree *)); 1513 1514/* Strip attributes from a list of combined specs and attrs. */ 1515 1516extern tree strip_attrs PROTO((tree)); 1517 1518/* Return 1 if an attribute and its arguments are valid for a decl or type. */ 1519 1520extern int valid_machine_attribute PROTO((tree, tree, tree, tree)); 1521 1522/* Given a tree node and a string, return non-zero if the tree node is 1523 a valid attribute name for the string. */ 1524 1525extern int is_attribute_p PROTO((const char *, tree)); 1526 1527/* Given an attribute name and a list of attributes, return the list element 1528 of the attribute or NULL_TREE if not found. */ 1529 1530extern tree lookup_attribute PROTO((const char *, tree)); 1531 1532/* Given two attributes lists, return a list of their union. */ 1533 1534extern tree merge_attributes PROTO((tree, tree)); 1535 1536/* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for 1537 the same kind of data as TYPE describes. Variants point to the 1538 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT, 1539 and it points to a chain of other variants so that duplicate 1540 variants are never made. Only main variants should ever appear as 1541 types of expressions. */ 1542 1543extern tree build_qualified_type PROTO((tree, int)); 1544 1545/* Like build_qualified_type, but only deals with the `const' and 1546 `volatile' qualifiers. This interface is retained for backwards 1547 compatiblity with the various front-ends; new code should use 1548 build_qualified_type instead. */ 1549 1550#define build_type_variant(TYPE, CONST_P, VOLATILE_P) \ 1551 build_qualified_type (TYPE, \ 1552 ((CONST_P) ? TYPE_QUAL_CONST : 0) \ 1553 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0)) 1554 1555/* Make a copy of a type node. */ 1556 1557extern tree build_type_copy PROTO((tree)); 1558 1559/* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT, 1560 TYPE_ALIGN and TYPE_MODE fields. 1561 If called more than once on one node, does nothing except 1562 for the first time. */ 1563 1564extern void layout_type PROTO((tree)); 1565 1566/* Given a hashcode and a ..._TYPE node (for which the hashcode was made), 1567 return a canonicalized ..._TYPE node, so that duplicates are not made. 1568 How the hash code is computed is up to the caller, as long as any two 1569 callers that could hash identical-looking type nodes agree. */ 1570 1571extern tree type_hash_canon PROTO((int, tree)); 1572 1573/* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node, 1574 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE 1575 fields. Call this only once for any given decl node. 1576 1577 Second argument is the boundary that this field can be assumed to 1578 be starting at (in bits). Zero means it can be assumed aligned 1579 on any boundary that may be needed. */ 1580 1581extern void layout_decl PROTO((tree, unsigned)); 1582 1583/* Return an expr equal to X but certainly not valid as an lvalue. */ 1584 1585extern tree non_lvalue PROTO((tree)); 1586extern tree pedantic_non_lvalue PROTO((tree)); 1587 1588extern tree convert PROTO((tree, tree)); 1589extern tree size_in_bytes PROTO((tree)); 1590extern HOST_WIDE_INT int_size_in_bytes PROTO((tree)); 1591extern tree size_binop PROTO((enum tree_code, tree, tree)); 1592extern tree ssize_binop PROTO((enum tree_code, tree, tree)); 1593extern tree size_int_wide PROTO((unsigned HOST_WIDE_INT, 1594 unsigned HOST_WIDE_INT, int)); 1595#define size_int(L) size_int_2 ((L), 0, 0) 1596#define bitsize_int(L, H) size_int_2 ((L), (H), 1) 1597#define size_int_2(L, H, T) \ 1598 size_int_wide ((unsigned HOST_WIDE_INT) (L), \ 1599 (unsigned HOST_WIDE_INT) (H), (T)) 1600 1601extern tree round_up PROTO((tree, int)); 1602extern tree get_pending_sizes PROTO((void)); 1603extern void put_pending_sizes PROTO((tree)); 1604 1605/* Type for sizes of data-type. */ 1606 1607#define BITS_PER_UNIT_LOG \ 1608 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \ 1609 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \ 1610 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256)) 1611 1612struct sizetype_tab 1613{ 1614 tree xsizetype, xbitsizetype; 1615 tree xssizetype, xusizetype; 1616 tree xsbitsizetype, xubitsizetype; 1617}; 1618 1619extern struct sizetype_tab sizetype_tab; 1620 1621#define sizetype sizetype_tab.xsizetype 1622#define bitsizetype sizetype_tab.xbitsizetype 1623#define ssizetype sizetype_tab.xssizetype 1624#define usizetype sizetype_tab.xusizetype 1625#define sbitsizetype sizetype_tab.xsbitsizetype 1626#define ubitsizetype sizetype_tab.xubitsizetype 1627 1628/* If nonzero, an upper limit on alignment of structure fields, in bits. */ 1629extern int maximum_field_alignment; 1630 1631/* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */ 1632extern int set_alignment; 1633 1634/* Concatenate two lists (chains of TREE_LIST nodes) X and Y 1635 by making the last node in X point to Y. 1636 Returns X, except if X is 0 returns Y. */ 1637 1638extern tree chainon PROTO((tree, tree)); 1639 1640/* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ 1641 1642extern tree tree_cons PROTO((tree, tree, tree)); 1643extern tree perm_tree_cons PROTO((tree, tree, tree)); 1644extern tree temp_tree_cons PROTO((tree, tree, tree)); 1645extern tree saveable_tree_cons PROTO((tree, tree, tree)); 1646extern tree decl_tree_cons PROTO((tree, tree, tree)); 1647extern tree expr_tree_cons PROTO((tree, tree, tree)); 1648 1649/* Return the last tree node in a chain. */ 1650 1651extern tree tree_last PROTO((tree)); 1652 1653/* Reverse the order of elements in a chain, and return the new head. */ 1654 1655extern tree nreverse PROTO((tree)); 1656 1657/* Returns the length of a chain of nodes 1658 (number of chain pointers to follow before reaching a null pointer). */ 1659 1660extern int list_length PROTO((tree)); 1661 1662/* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */ 1663 1664extern int integer_zerop PROTO((tree)); 1665 1666/* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */ 1667 1668extern int integer_onep PROTO((tree)); 1669 1670/* integer_all_onesp (tree x) is nonzero if X is an integer constant 1671 all of whose significant bits are 1. */ 1672 1673extern int integer_all_onesp PROTO((tree)); 1674 1675/* integer_pow2p (tree x) is nonzero is X is an integer constant with 1676 exactly one bit 1. */ 1677 1678extern int integer_pow2p PROTO((tree)); 1679 1680/* staticp (tree x) is nonzero if X is a reference to data allocated 1681 at a fixed address in memory. */ 1682 1683extern int staticp PROTO((tree)); 1684 1685/* Gets an error if argument X is not an lvalue. 1686 Also returns 1 if X is an lvalue, 0 if not. */ 1687 1688extern int lvalue_or_else PROTO((tree, const char *)); 1689 1690/* save_expr (EXP) returns an expression equivalent to EXP 1691 but it can be used multiple times within context CTX 1692 and only evaluate EXP once. */ 1693 1694extern tree save_expr PROTO((tree)); 1695 1696/* Returns the index of the first non-tree operand for CODE, or the number 1697 of operands if all are trees. */ 1698 1699extern int first_rtl_op PROTO((enum tree_code)); 1700 1701/* unsave_expr (EXP) returns an expression equivalent to EXP but it 1702 can be used multiple times and will evaluate EXP, in its entirety 1703 each time. */ 1704 1705extern tree unsave_expr PROTO((tree)); 1706 1707/* unsave_expr_now (EXP) resets EXP in place, so that it can be 1708 expanded again. */ 1709 1710extern tree unsave_expr_now PROTO((tree)); 1711 1712/* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size 1713 or offset that depends on a field within a record. 1714 1715 Note that we only allow such expressions within simple arithmetic 1716 or a COND_EXPR. */ 1717 1718extern int contains_placeholder_p PROTO((tree)); 1719 1720/* Return 1 if EXP contains any expressions that produce cleanups for an 1721 outer scope to deal with. Used by fold. */ 1722 1723extern int has_cleanups PROTO((tree)); 1724 1725/* Given a tree EXP, a FIELD_DECL F, and a replacement value R, 1726 return a tree with all occurrences of references to F in a 1727 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP 1728 contains only arithmetic expressions. */ 1729 1730extern tree substitute_in_expr PROTO((tree, tree, tree)); 1731 1732/* variable_size (EXP) is like save_expr (EXP) except that it 1733 is for the special case of something that is part of a 1734 variable size for a data type. It makes special arrangements 1735 to compute the value at the right time when the data type 1736 belongs to a function parameter. */ 1737 1738extern tree variable_size PROTO((tree)); 1739 1740/* stabilize_reference (EXP) returns an reference equivalent to EXP 1741 but it can be used multiple times 1742 and only evaluate the subexpressions once. */ 1743 1744extern tree stabilize_reference PROTO((tree)); 1745 1746/* Subroutine of stabilize_reference; this is called for subtrees of 1747 references. Any expression with side-effects must be put in a SAVE_EXPR 1748 to ensure that it is only evaluated once. */ 1749 1750extern tree stabilize_reference_1 PROTO((tree)); 1751 1752/* Return EXP, stripped of any conversions to wider types 1753 in such a way that the result of converting to type FOR_TYPE 1754 is the same as if EXP were converted to FOR_TYPE. 1755 If FOR_TYPE is 0, it signifies EXP's type. */ 1756 1757extern tree get_unwidened PROTO((tree, tree)); 1758 1759/* Return OP or a simpler expression for a narrower value 1760 which can be sign-extended or zero-extended to give back OP. 1761 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended 1762 or 0 if the value should be sign-extended. */ 1763 1764extern tree get_narrower PROTO((tree, int *)); 1765 1766/* Given MODE and UNSIGNEDP, return a suitable type-tree 1767 with that mode. 1768 The definition of this resides in language-specific code 1769 as the repertoire of available types may vary. */ 1770 1771extern tree type_for_mode PROTO((enum machine_mode, int)); 1772 1773/* Given PRECISION and UNSIGNEDP, return a suitable type-tree 1774 for an integer type with at least that precision. 1775 The definition of this resides in language-specific code 1776 as the repertoire of available types may vary. */ 1777 1778extern tree type_for_size PROTO((unsigned, int)); 1779 1780/* Given an integer type T, return a type like T but unsigned. 1781 If T is unsigned, the value is T. 1782 The definition of this resides in language-specific code 1783 as the repertoire of available types may vary. */ 1784 1785extern tree unsigned_type PROTO((tree)); 1786 1787/* Given an integer type T, return a type like T but signed. 1788 If T is signed, the value is T. 1789 The definition of this resides in language-specific code 1790 as the repertoire of available types may vary. */ 1791 1792extern tree signed_type PROTO((tree)); 1793 1794/* This function must be defined in the language-specific files. 1795 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR. 1796 This is defined in a language-specific file. */ 1797 1798extern tree maybe_build_cleanup PROTO((tree)); 1799 1800/* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF, 1801 look for nested component-refs or array-refs at constant positions 1802 and find the ultimate containing object, which is returned. */ 1803 1804extern tree get_inner_reference PROTO((tree, int *, int *, tree *, 1805 enum machine_mode *, int *, 1806 int *, int *)); 1807 1808/* Return the FUNCTION_DECL which provides this _DECL with its context, 1809 or zero if none. */ 1810extern tree decl_function_context PROTO((tree)); 1811 1812/* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides 1813 this _DECL with its context, or zero if none. */ 1814extern tree decl_type_context PROTO((tree)); 1815 1816/* Given the FUNCTION_DECL for the current function, 1817 return zero if it is ok for this function to be inline. 1818 Otherwise return a warning message with a single %s 1819 for the function's name. */ 1820 1821extern const char *function_cannot_inline_p PROTO((tree)); 1822 1823/* Return 1 if EXPR is the real constant zero. */ 1824extern int real_zerop PROTO((tree)); 1825 1826/* Declare commonly used variables for tree structure. */ 1827 1828/* An integer constant with value 0 */ 1829extern tree integer_zero_node; 1830 1831/* An integer constant with value 1 */ 1832extern tree integer_one_node; 1833 1834/* An integer constant with value 0 whose type is sizetype. */ 1835extern tree size_zero_node; 1836 1837/* An integer constant with value 1 whose type is sizetype. */ 1838extern tree size_one_node; 1839 1840/* A constant of type pointer-to-int and value 0 */ 1841extern tree null_pointer_node; 1842 1843/* A node of type ERROR_MARK. */ 1844extern tree error_mark_node; 1845 1846/* The type node for the void type. */ 1847extern tree void_type_node; 1848 1849/* The type node for the ordinary (signed) integer type. */ 1850extern tree integer_type_node; 1851 1852/* The type node for the unsigned integer type. */ 1853extern tree unsigned_type_node; 1854 1855/* The type node for the ordinary character type. */ 1856extern tree char_type_node; 1857 1858/* Points to the name of the input file from which the current input 1859 being parsed originally came (before it went into cpp). */ 1860extern char *input_filename; 1861 1862/* Current line number in input file. */ 1863extern int lineno; 1864 1865/* Nonzero for -pedantic switch: warn about anything 1866 that standard C forbids. */ 1867extern int pedantic; 1868 1869/* Nonzero means lvalues are limited to those valid in pedantic ANSI C. 1870 Zero means allow extended lvalues. */ 1871 1872extern int pedantic_lvalues; 1873 1874/* Nonzero means can safely call expand_expr now; 1875 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */ 1876 1877extern int immediate_size_expand; 1878 1879/* Points to the FUNCTION_DECL of the function whose body we are reading. */ 1880 1881extern tree current_function_decl; 1882 1883/* Nonzero if function being compiled can call setjmp. */ 1884 1885extern int current_function_calls_setjmp; 1886 1887/* Nonzero if function being compiled can call longjmp. */ 1888 1889extern int current_function_calls_longjmp; 1890 1891/* Nonzero means all ..._TYPE nodes should be allocated permanently. */ 1892 1893extern int all_types_permanent; 1894 1895/* Pointer to function to compute the name to use to print a declaration. 1896 DECL is the declaration in question. 1897 VERBOSITY determines what information will be printed: 1898 0: DECL_NAME, demangled as necessary. 1899 1: and scope information. 1900 2: and any other information that might be interesting, such as function 1901 parameter types in C++. */ 1902 1903extern char *(*decl_printable_name) PROTO((tree, int)); 1904 1905/* Pointer to function to finish handling an incomplete decl at the 1906 end of compilation. */ 1907 1908extern void (*incomplete_decl_finalize_hook) PROTO((tree)); 1909 1910/* In tree.c */ 1911extern char *perm_calloc PROTO((int, long)); 1912extern tree get_file_function_name PROTO((int)); 1913extern tree get_file_function_name_long PROTO((const char *)); 1914extern tree get_set_constructor_bits PROTO((tree, char *, int)); 1915extern tree get_set_constructor_bytes PROTO((tree, 1916 unsigned char *, int)); 1917extern int get_alias_set PROTO((tree)); 1918extern int new_alias_set PROTO((void)); 1919extern int (*lang_get_alias_set) PROTO((tree)); 1920 1921/* In stmt.c */ 1922 1923extern void expand_fixups PROTO((struct rtx_def *)); 1924extern tree expand_start_stmt_expr PROTO((void)); 1925extern tree expand_end_stmt_expr PROTO((tree)); 1926extern void expand_expr_stmt PROTO((tree)); 1927extern int warn_if_unused_value PROTO((tree)); 1928extern void expand_decl_init PROTO((tree)); 1929extern void clear_last_expr PROTO((void)); 1930extern void expand_label PROTO((tree)); 1931extern void expand_goto PROTO((tree)); 1932extern void expand_asm PROTO((tree)); 1933extern void expand_start_cond PROTO((tree, int)); 1934extern void expand_end_cond PROTO((void)); 1935extern void expand_start_else PROTO((void)); 1936extern void expand_start_elseif PROTO((tree)); 1937extern struct nesting *expand_start_loop PROTO((int)); 1938extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int)); 1939extern void expand_loop_continue_here PROTO((void)); 1940extern void expand_end_loop PROTO((void)); 1941extern int expand_continue_loop PROTO((struct nesting *)); 1942extern int expand_exit_loop PROTO((struct nesting *)); 1943extern int expand_exit_loop_if_false PROTO((struct nesting *, 1944 tree)); 1945extern int expand_exit_something PROTO((void)); 1946 1947extern void expand_null_return PROTO((void)); 1948extern void expand_return PROTO((tree)); 1949extern int optimize_tail_recursion PROTO((tree, struct rtx_def *)); 1950extern void expand_start_bindings PROTO((int)); 1951extern void expand_end_bindings PROTO((tree, int, int)); 1952extern void start_cleanup_deferral PROTO((void)); 1953extern void end_cleanup_deferral PROTO((void)); 1954extern void mark_block_as_eh_region PROTO((void)); 1955extern void mark_block_as_not_eh_region PROTO((void)); 1956extern int is_eh_region PROTO((void)); 1957extern int conditional_context PROTO((void)); 1958extern tree last_cleanup_this_contour PROTO((void)); 1959extern int expand_dhc_cleanup PROTO((tree)); 1960extern int expand_dcc_cleanup PROTO((tree)); 1961extern void expand_start_case PROTO((int, tree, tree, 1962 const char *)); 1963extern void expand_end_case PROTO((tree)); 1964extern int pushcase PROTO((tree, 1965 tree (*) (tree, tree), 1966 tree, tree *)); 1967extern int pushcase_range PROTO((tree, tree, 1968 tree (*) (tree, tree), 1969 tree, tree *)); 1970extern void using_eh_for_cleanups PROTO((void)); 1971extern int stmt_loop_nest_empty PROTO((void)); 1972 1973/* In fold-const.c */ 1974 1975/* Fold constants as much as possible in an expression. 1976 Returns the simplified expression. 1977 Acts only on the top level of the expression; 1978 if the argument itself cannot be simplified, its 1979 subexpressions are not changed. */ 1980 1981extern tree fold PROTO((tree)); 1982 1983extern int force_fit_type PROTO((tree, int)); 1984extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, 1985 HOST_WIDE_INT, HOST_WIDE_INT, 1986 HOST_WIDE_INT *, HOST_WIDE_INT *)); 1987extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, 1988 HOST_WIDE_INT *, HOST_WIDE_INT *)); 1989extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, 1990 HOST_WIDE_INT, HOST_WIDE_INT, 1991 HOST_WIDE_INT *, HOST_WIDE_INT *)); 1992extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, 1993 HOST_WIDE_INT, int, HOST_WIDE_INT *, 1994 HOST_WIDE_INT *, int)); 1995extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, 1996 HOST_WIDE_INT, int, 1997 HOST_WIDE_INT *, HOST_WIDE_INT *, int)); 1998extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, 1999 HOST_WIDE_INT, int, HOST_WIDE_INT *, 2000 HOST_WIDE_INT *)); 2001extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, 2002 HOST_WIDE_INT, int, HOST_WIDE_INT *, 2003 HOST_WIDE_INT *)); 2004extern int operand_equal_p PROTO((tree, tree, int)); 2005extern tree invert_truthvalue PROTO((tree)); 2006 2007/* Interface of the DWARF2 unwind info support. */ 2008 2009/* Decide whether we want to emit frame unwind information for the current 2010 translation unit. */ 2011 2012extern int dwarf2out_do_frame PROTO((void)); 2013 2014/* Generate a new label for the CFI info to refer to. */ 2015 2016extern char *dwarf2out_cfi_label PROTO((void)); 2017 2018/* Entry point to update the canonical frame address (CFA). */ 2019 2020extern void dwarf2out_def_cfa PROTO((char *, unsigned, long)); 2021 2022/* Add the CFI for saving a register window. */ 2023 2024extern void dwarf2out_window_save PROTO((char *)); 2025 2026/* Add a CFI to update the running total of the size of arguments pushed 2027 onto the stack. */ 2028 2029extern void dwarf2out_args_size PROTO((char *, long)); 2030 2031/* Entry point for saving a register to the stack. */ 2032 2033extern void dwarf2out_reg_save PROTO((char *, unsigned, long)); 2034 2035/* Entry point for saving the return address in the stack. */ 2036 2037extern void dwarf2out_return_save PROTO((char *, long)); 2038 2039/* Entry point for saving the return address in a register. */ 2040 2041extern void dwarf2out_return_reg PROTO((char *, unsigned)); 2042 2043/* Output a marker (i.e. a label) for the beginning of a function, before 2044 the prologue. */ 2045 2046extern void dwarf2out_begin_prologue PROTO((void)); 2047 2048/* Output a marker (i.e. a label) for the absolute end of the generated 2049 code for a function definition. */ 2050 2051extern void dwarf2out_end_epilogue PROTO((void)); 2052 2053/* The language front-end must define these functions. */ 2054 2055/* Function of no arguments for initializing options. */ 2056extern void lang_init_options PROTO((void)); 2057 2058/* Function of no arguments for initializing lexical scanning. */ 2059extern void init_lex PROTO((void)); 2060/* Function of no arguments for initializing the symbol table. */ 2061extern void init_decl_processing PROTO((void)); 2062 2063/* Functions called with no arguments at the beginning and end or processing 2064 the input source file. */ 2065extern void lang_init PROTO((void)); 2066extern void lang_finish PROTO((void)); 2067 2068/* Function to identify which front-end produced the output file. */ 2069extern char *lang_identify PROTO((void)); 2070 2071/* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */ 2072extern void copy_lang_decl PROTO((tree)); 2073 2074/* Function called with no arguments to parse and compile the input. */ 2075extern int yyparse PROTO((void)); 2076/* Function called with option as argument 2077 to decode options starting with -f or -W or +. 2078 It should return nonzero if it handles the option. */ 2079extern int lang_decode_option PROTO((int, char **)); 2080 2081/* Functions for processing symbol declarations. */ 2082/* Function to enter a new lexical scope. 2083 Takes one argument: always zero when called from outside the front end. */ 2084extern void pushlevel PROTO((int)); 2085/* Function to exit a lexical scope. It returns a BINDING for that scope. 2086 Takes three arguments: 2087 KEEP -- nonzero if there were declarations in this scope. 2088 REVERSE -- reverse the order of decls before returning them. 2089 FUNCTIONBODY -- nonzero if this level is the body of a function. */ 2090extern tree poplevel PROTO((int, int, int)); 2091/* Set the BLOCK node for the current scope level. */ 2092extern void set_block PROTO((tree)); 2093/* Function to add a decl to the current scope level. 2094 Takes one argument, a decl to add. 2095 Returns that decl, or, if the same symbol is already declared, may 2096 return a different decl for that name. */ 2097extern tree pushdecl PROTO((tree)); 2098/* Function to return the chain of decls so far in the current scope level. */ 2099extern tree getdecls PROTO((void)); 2100/* Function to return the chain of structure tags in the current scope level. */ 2101extern tree gettags PROTO((void)); 2102 2103extern tree build_range_type PROTO((tree, tree, tree)); 2104 2105/* Call when starting to parse a declaration: 2106 make expressions in the declaration last the length of the function. 2107 Returns an argument that should be passed to resume_momentary later. */ 2108extern int suspend_momentary PROTO((void)); 2109 2110extern int allocation_temporary_p PROTO((void)); 2111 2112/* Call when finished parsing a declaration: 2113 restore the treatment of node-allocation that was 2114 in effect before the suspension. 2115 YES should be the value previously returned by suspend_momentary. */ 2116extern void resume_momentary PROTO((int)); 2117 2118/* Called after finishing a record, union or enumeral type. */ 2119extern void rest_of_type_compilation PROTO((tree, int)); 2120 2121/* Save the current set of obstacks, but don't change them. */ 2122extern void push_obstacks_nochange PROTO((void)); 2123 2124extern void permanent_allocation PROTO((int)); 2125 2126extern void push_momentary PROTO((void)); 2127 2128extern void clear_momentary PROTO((void)); 2129 2130extern void pop_momentary PROTO((void)); 2131 2132extern void end_temporary_allocation PROTO((void)); 2133 2134/* Pop the obstack selection stack. */ 2135extern void pop_obstacks PROTO((void)); 2136 2137/* In tree.c */ 2138extern int really_constant_p PROTO ((tree)); 2139extern void push_obstacks PROTO ((struct obstack *, 2140 struct obstack *)); 2141extern void pop_momentary_nofree PROTO ((void)); 2142extern void preserve_momentary PROTO ((void)); 2143extern void saveable_allocation PROTO ((void)); 2144extern void temporary_allocation PROTO ((void)); 2145extern void resume_temporary_allocation PROTO ((void)); 2146extern tree get_file_function_name PROTO ((int)); 2147extern void set_identifier_size PROTO ((int)); 2148extern int int_fits_type_p PROTO ((tree, tree)); 2149extern int tree_log2 PROTO ((tree)); 2150extern void preserve_initializer PROTO ((void)); 2151extern void preserve_data PROTO ((void)); 2152extern int object_permanent_p PROTO ((tree)); 2153extern int type_precision PROTO ((tree)); 2154extern int simple_cst_equal PROTO ((tree, tree)); 2155extern int type_list_equal PROTO ((tree, tree)); 2156extern int chain_member PROTO ((tree, tree)); 2157extern int chain_member_purpose PROTO ((tree, tree)); 2158extern int chain_member_value PROTO ((tree, tree)); 2159extern tree listify PROTO ((tree)); 2160extern tree type_hash_lookup PROTO ((int, tree)); 2161extern void type_hash_add PROTO ((int, tree)); 2162extern int type_hash_list PROTO ((tree)); 2163extern int simple_cst_list_equal PROTO ((tree, tree)); 2164extern void debug_obstack PROTO ((char *)); 2165extern void rtl_in_current_obstack PROTO ((void)); 2166extern void rtl_in_saveable_obstack PROTO ((void)); 2167extern void init_tree_codes PROTO ((void)); 2168extern void dump_tree_statistics PROTO ((void)); 2169extern void print_obstack_statistics PROTO ((const char *, 2170 struct obstack *)); 2171#ifdef BUFSIZ 2172extern void print_obstack_name PROTO ((char *, FILE *, const char *)); 2173#endif 2174extern void expand_function_end PROTO ((char *, int, int)); 2175extern void expand_function_start PROTO ((tree, int)); 2176extern int real_onep PROTO ((tree)); 2177extern int real_twop PROTO ((tree)); 2178extern void start_identifier_warnings PROTO ((void)); 2179extern void gcc_obstack_init PROTO ((struct obstack *)); 2180extern void init_obstacks PROTO ((void)); 2181extern void obfree PROTO ((char *)); 2182extern tree tree_check PROTO ((tree, enum tree_code, 2183 const char *, int, int)); 2184extern tree tree_class_check PROTO ((tree, char, const char *, 2185 int, int)); 2186extern tree expr_check PROTO ((tree, int, const char *, 2187 int, int)); 2188 2189/* In function.c */ 2190extern void setjmp_protect_args PROTO ((void)); 2191extern void setjmp_protect PROTO ((tree)); 2192extern void expand_main_function PROTO ((void)); 2193extern void mark_varargs PROTO ((void)); 2194extern void init_function_start PROTO ((tree, char *, int)); 2195extern void assign_parms PROTO ((tree, int)); 2196extern void put_var_into_stack PROTO ((tree)); 2197extern void uninitialized_vars_warning PROTO ((tree)); 2198extern void setjmp_args_warning PROTO ((void)); 2199extern void mark_all_temps_used PROTO ((void)); 2200extern void init_temp_slots PROTO ((void)); 2201extern void combine_temp_slots PROTO ((void)); 2202extern void free_temp_slots PROTO ((void)); 2203extern void pop_temp_slots PROTO ((void)); 2204extern void push_temp_slots PROTO ((void)); 2205extern void preserve_temp_slots PROTO ((struct rtx_def *)); 2206extern int aggregate_value_p PROTO ((tree)); 2207extern tree reorder_blocks PROTO ((tree *, tree, 2208 struct rtx_def *)); 2209extern void free_temps_for_rtl_expr PROTO ((tree)); 2210extern void instantiate_virtual_regs PROTO ((tree, struct rtx_def *)); 2211extern void unshare_all_rtl PROTO ((tree, struct rtx_def *)); 2212extern int max_parm_reg_num PROTO ((void)); 2213extern void push_function_context PROTO ((void)); 2214extern void pop_function_context PROTO ((void)); 2215extern void push_function_context_to PROTO ((tree)); 2216extern void pop_function_context_from PROTO ((tree)); 2217 2218/* In print-rtl.c */ 2219#ifdef BUFSIZ 2220extern void print_rtl PROTO ((FILE *, struct rtx_def *)); 2221#endif 2222 2223/* In print-tree.c */ 2224extern void debug_tree PROTO ((tree)); 2225#ifdef BUFSIZ 2226extern void print_node PROTO ((FILE *, const char *, tree, int)); 2227extern void print_node_brief PROTO ((FILE *, const char *, tree, int)); 2228extern void indent_to PROTO ((FILE *, int)); 2229#endif 2230 2231/* In expr.c */ 2232extern void emit_queue PROTO ((void)); 2233extern int apply_args_register_offset PROTO ((int)); 2234extern struct rtx_def *expand_builtin_return_addr 2235 PROTO ((enum built_in_function, int, struct rtx_def *)); 2236extern void do_pending_stack_adjust PROTO ((void)); 2237extern struct rtx_def *expand_assignment PROTO ((tree, tree, int, int)); 2238extern struct rtx_def *store_expr PROTO ((tree, struct rtx_def *, 2239 int)); 2240extern void check_max_integer_computation_mode PROTO ((tree)); 2241 2242/* In emit-rtl.c */ 2243extern void start_sequence_for_rtl_expr PROTO ((tree)); 2244extern struct rtx_def *emit_line_note_after PROTO ((char *, int, 2245 struct rtx_def *)); 2246extern struct rtx_def *emit_line_note PROTO ((char *, int)); 2247extern struct rtx_def *emit_line_note_force PROTO ((char *, int)); 2248 2249/* In c-typeck.c */ 2250extern int mark_addressable PROTO ((tree)); 2251extern void incomplete_type_error PROTO ((tree, tree)); 2252 2253/* In c-lang.c */ 2254extern void print_lang_statistics PROTO ((void)); 2255 2256/* In c-common.c */ 2257extern tree truthvalue_conversion PROTO ((tree)); 2258extern int min_precision PROTO ((tree, int)); 2259extern void split_specs_attrs PROTO ((tree, tree *, tree *)); 2260 2261/* In c-decl.c */ 2262#ifdef BUFSIZ 2263extern void print_lang_decl PROTO ((FILE *, tree, int)); 2264extern void print_lang_type PROTO ((FILE *, tree, int)); 2265extern void print_lang_identifier PROTO ((FILE *, tree, int)); 2266#endif 2267extern int global_bindings_p PROTO ((void)); 2268extern void insert_block PROTO ((tree)); 2269 2270/* In integrate.c */ 2271extern void save_for_inline_nocopy PROTO ((tree)); 2272extern void save_for_inline_copying PROTO ((tree)); 2273extern void set_decl_abstract_flags PROTO ((tree, int)); 2274extern void output_inline_function PROTO ((tree)); 2275 2276/* In c-lex.c */ 2277extern void set_yydebug PROTO ((int)); 2278 2279/* In stor-layout.c */ 2280extern void fixup_signed_type PROTO ((tree)); 2281 2282/* varasm.c */ 2283extern void make_decl_rtl PROTO ((tree, const char *, int)); 2284extern void make_decl_one_only PROTO ((tree)); 2285extern int supports_one_only PROTO ((void)); 2286extern void variable_section PROTO ((tree, int)); 2287 2288/* In fold-const.c */ 2289extern int div_and_round_double PROTO ((enum tree_code, int, 2290 HOST_WIDE_INT, HOST_WIDE_INT, 2291 HOST_WIDE_INT, HOST_WIDE_INT, 2292 HOST_WIDE_INT *, 2293 HOST_WIDE_INT *, 2294 HOST_WIDE_INT *, 2295 HOST_WIDE_INT *)); 2296 2297/* In stmt.c */ 2298extern void emit_nop PROTO ((void)); 2299extern void expand_computed_goto PROTO ((tree)); 2300extern struct rtx_def *label_rtx PROTO ((tree)); 2301extern void expand_asm_operands PROTO ((tree, tree, tree, tree, int, 2302 char *, int)); 2303extern int any_pending_cleanups PROTO ((int)); 2304extern void init_stmt PROTO ((void)); 2305extern void init_stmt_for_function PROTO ((void)); 2306extern void remember_end_note PROTO ((tree)); 2307extern int drop_through_at_end_p PROTO ((void)); 2308extern void expand_start_target_temps PROTO ((void)); 2309extern void expand_end_target_temps PROTO ((void)); 2310extern void expand_elseif PROTO ((tree)); 2311extern void expand_decl PROTO ((tree)); 2312extern int expand_decl_cleanup PROTO ((tree, tree)); 2313extern void expand_anon_union_decl PROTO ((tree, tree, tree)); 2314extern void move_cleanups_up PROTO ((void)); 2315extern void expand_start_case_dummy PROTO ((void)); 2316extern void expand_end_case_dummy PROTO ((void)); 2317extern tree case_index_expr_type PROTO ((void)); 2318extern HOST_WIDE_INT all_cases_count PROTO ((tree, int *)); 2319extern void check_for_full_enumeration_handling PROTO ((tree)); 2320extern void declare_nonlocal_label PROTO ((tree)); 2321#ifdef BUFSIZ 2322extern void lang_print_xnode PROTO ((FILE *, tree, int)); 2323#endif 2324 2325 2326/* If KIND=='I', return a suitable global initializer (constructor) name. 2327 If KIND=='D', return a suitable global clean-up (destructor) name. */ 2328extern tree get_file_function_name PROTO((int)); 2329 2330/* Interface of the DWARF2 unwind info support. */ 2331 2332/* Decide whether we want to emit frame unwind information for the current 2333 translation unit. */ 2334 2335extern int dwarf2out_do_frame PROTO((void)); 2336 2337/* Generate a new label for the CFI info to refer to. */ 2338 2339extern char *dwarf2out_cfi_label PROTO((void)); 2340 2341/* Entry point to update the canonical frame address (CFA). */ 2342 2343extern void dwarf2out_def_cfa PROTO((char *, unsigned, long)); 2344 2345/* Add the CFI for saving a register window. */ 2346 2347extern void dwarf2out_window_save PROTO((char *)); 2348 2349/* Add a CFI to update the running total of the size of arguments pushed 2350 onto the stack. */ 2351 2352extern void dwarf2out_args_size PROTO((char *, long)); 2353 2354/* Entry point for saving a register to the stack. */ 2355 2356extern void dwarf2out_reg_save PROTO((char *, unsigned, long)); 2357 2358/* Entry point for saving the return address in the stack. */ 2359 2360extern void dwarf2out_return_save PROTO((char *, long)); 2361 2362/* Entry point for saving the return address in a register. */ 2363 2364extern void dwarf2out_return_reg PROTO((char *, unsigned)); 2365 2366/* Output a marker (i.e. a label) for the beginning of a function, before 2367 the prologue. */ 2368 2369extern void dwarf2out_begin_prologue PROTO((void)); 2370 2371/* Output a marker (i.e. a label) for the absolute end of the generated 2372 code for a function definition. */ 2373 2374extern void dwarf2out_end_epilogue PROTO((void)); 2375