1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
26 /* Codes of tree nodes */
28 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
33 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
39 /* Number of tree codes. */
40 #define NUM_TREE_CODES ((int)LAST_AND_UNUSED_TREE_CODE)
42 /* Indexed by enum tree_code, contains a character which is
43 `<' for a comparison expression, `1', for a unary arithmetic
44 expression, `2' for a binary arithmetic expression, `e' for
45 other types of expressions, `r' for a reference, `c' for a
46 constant, `d' for a decl, `t' for a type, `s' for a statement,
47 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
49 extern char **tree_code_type;
50 #define TREE_CODE_CLASS(CODE) (*tree_code_type[(int) (CODE)])
52 /* Number of argument-words in each kind of tree-node. */
54 extern int *tree_code_length;
56 /* Names of tree components. */
58 extern char **tree_code_name;
60 /* Codes that identify the various built in functions
61 so that expand_call can identify them quickly. */
63 enum built_in_function
89 BUILT_IN_CLASSIFY_TYPE,
93 BUILT_IN_FRAME_ADDRESS,
94 BUILT_IN_RETURN_ADDRESS,
95 BUILT_IN_CALLER_RETURN_ADDRESS,
106 /* Upper bound on non-language-specific builtins. */
110 /* The definition of tree nodes fills the next several pages. */
112 /* A tree node can represent a data type, a variable, an expression
113 or a statement. Each node has a TREE_CODE which says what kind of
114 thing it represents. Some common codes are:
115 INTEGER_TYPE -- represents a type of integers.
116 ARRAY_TYPE -- represents a type of pointer.
117 VAR_DECL -- represents a declared variable.
118 INTEGER_CST -- represents a constant integer value.
119 PLUS_EXPR -- represents a sum (an expression).
121 As for the contents of a tree node: there are some fields
122 that all nodes share. Each TREE_CODE has various special-purpose
123 fields as well. The fields of a node are never accessed directly,
124 always through accessor macros. */
126 /* This type is used everywhere to refer to a tree node. */
128 typedef union tree_node *tree;
130 /* Every kind of tree node starts with this structure,
131 so all nodes have these fields.
133 See the accessor macros, defined below, for documentation of the fields. */
137 union tree_node *chain;
138 union tree_node *type;
139 #ifdef ONLY_INT_FIELDS
140 unsigned int code : 8;
142 enum tree_code code : 8;
145 unsigned side_effects_flag : 1;
146 unsigned constant_flag : 1;
147 unsigned permanent_flag : 1;
148 unsigned addressable_flag : 1;
149 unsigned volatile_flag : 1;
150 unsigned readonly_flag : 1;
151 unsigned unsigned_flag : 1;
152 unsigned asm_written_flag: 1;
154 unsigned used_flag : 1;
155 unsigned raises_flag : 1;
156 unsigned static_flag : 1;
157 unsigned public_flag : 1;
158 unsigned private_flag : 1;
159 unsigned protected_flag : 1;
161 unsigned lang_flag_0 : 1;
162 unsigned lang_flag_1 : 1;
163 unsigned lang_flag_2 : 1;
164 unsigned lang_flag_3 : 1;
165 unsigned lang_flag_4 : 1;
166 unsigned lang_flag_5 : 1;
167 unsigned lang_flag_6 : 1;
168 /* There is room for two more flags. */
171 /* Define accessors for the fields that all tree nodes have
172 (though some fields are not used for all kinds of nodes). */
174 /* The tree-code says what kind of node it is.
175 Codes are defined in tree.def. */
176 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
177 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
179 /* In all nodes that are expressions, this is the data type of the expression.
180 In POINTER_TYPE nodes, this is the type that the pointer points to.
181 In ARRAY_TYPE nodes, this is the type of the elements. */
182 #define TREE_TYPE(NODE) ((NODE)->common.type)
184 /* Nodes are chained together for many purposes.
185 Types are chained together to record them for being output to the debugger
186 (see the function `chain_type').
187 Decls in the same scope are chained together to record the contents
189 Statement nodes for successive statements used to be chained together.
190 Often lists of things are represented by TREE_LIST nodes that
191 are chained together. */
193 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
195 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
196 that don't change the machine mode. */
198 #define STRIP_NOPS(EXP) \
199 while ((TREE_CODE (EXP) == NOP_EXPR \
200 || TREE_CODE (EXP) == CONVERT_EXPR \
201 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
202 && (TYPE_MODE (TREE_TYPE (EXP)) \
203 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
204 (EXP) = TREE_OPERAND (EXP, 0);
206 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
208 #define STRIP_TYPE_NOPS(EXP) \
209 while ((TREE_CODE (EXP) == NOP_EXPR \
210 || TREE_CODE (EXP) == CONVERT_EXPR \
211 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
212 && (TREE_TYPE (EXP) \
213 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
214 (EXP) = TREE_OPERAND (EXP, 0);
216 /* Nonzero if TYPE represents an integral type. Note that we do not
217 include COMPLEX types here. */
219 #define INTEGRAL_TYPE_P(TYPE) \
220 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
221 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
223 /* Nonzero if TYPE represents a floating-point type, including complex
224 floating-point types. */
226 #define FLOAT_TYPE_P(TYPE) \
227 (TREE_CODE (TYPE) == REAL_TYPE \
228 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
229 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
231 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
233 #define AGGREGATE_TYPE_P(TYPE) \
234 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
235 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
236 || TREE_CODE (TYPE) == SET_TYPE)
238 /* Define many boolean fields that all tree nodes have. */
240 /* In VAR_DECL nodes, nonzero means address of this is needed.
241 So it cannot be in a register.
242 In a FUNCTION_DECL, nonzero means its address is needed.
243 So it must be compiled even if it is an inline function.
244 In CONSTRUCTOR nodes, it means object constructed must be in memory.
245 In LABEL_DECL nodes, it means a goto for this label has been seen
246 from a place outside all binding contours that restore stack levels.
247 In ..._TYPE nodes, it means that objects of this type must
248 be fully addressable. This means that pieces of this
249 object cannot go into register parameters, for example.
250 In IDENTIFIER_NODEs, this means that some extern decl for this name
251 had its address taken. That matters for inline functions. */
252 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
254 /* In a VAR_DECL, nonzero means allocate static storage.
255 In a FUNCTION_DECL, nonzero if function has been defined.
256 In a CONSTRUCTOR, nonzero means allocate static storage. */
257 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
259 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
260 made implicitly and should not lead to an "unused value" warning. */
261 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
263 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
264 chain is via a `virtual' declaration. */
265 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
267 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
268 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
269 requires a diagnostic when overflows occur in constant expressions. */
270 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
272 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
273 overflow in folding, and no warning has been issued for this subexpression.
274 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
275 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
277 /* In a VAR_DECL or FUNCTION_DECL,
278 nonzero means name is to be accessible from outside this module.
279 In an identifier node, nonzero means an external declaration
280 accessible from outside this module was previously seen
281 for this name in an inner scope. */
282 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
284 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
285 base class is via a `public' declaration, which preserves public
286 fields from the base class as public. */
287 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
289 /* Ditto, for `private' declarations. */
290 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
292 /* Nonzero for TREE_LIST node means that the path to the
293 base class is via a `protected' declaration, which preserves
294 protected fields from the base class as protected.
296 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
298 /* In any expression, nonzero means it has side effects or reevaluation
299 of the whole expression could produce a different value.
300 This is set if any subexpression is a function call, a side effect
301 or a reference to a volatile variable.
302 In a ..._DECL, this is set only if the declaration said `volatile'. */
303 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
305 /* Nonzero means this expression is volatile in the C sense:
306 its address should be of type `volatile WHATEVER *'.
307 In other words, the declared item is volatile qualified.
308 This is used in _DECL nodes and _REF nodes.
310 In a ..._TYPE node, means this type is volatile-qualified.
311 But use TYPE_VOLATILE instead of this macro when the node is a type,
312 because eventually we may make that a different bit.
314 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
315 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
317 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
318 nonzero means it may not be the lhs of an assignment.
319 In a ..._TYPE node, means this type is const-qualified
320 (but the macro TYPE_READONLY should be used instead of this macro
321 when the node is a type). */
322 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
324 /* Value of expression is constant.
325 Always appears in all ..._CST nodes.
326 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
327 if the value is constant. */
328 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
330 /* Nonzero means permanent node;
331 node will continue to exist for the entire compiler run.
332 Otherwise it will be recycled at the end of the function. */
333 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
335 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
336 In FIELD_DECL nodes, means an unsigned bit field.
337 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
338 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
340 /* Nonzero in a VAR_DECL means assembler code has been written.
341 Nonzero in a FUNCTION_DECL means that the function has been compiled.
342 This is interesting in an inline function, since it might not need
343 to be compiled separately.
344 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
345 if the sdb debugging info for the type has been written.
346 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
347 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
349 /* Nonzero in a _DECL if the name is used in its scope.
350 Nonzero in an expr node means inhibit warning if value is unused.
351 In IDENTIFIER_NODEs, this means that some extern decl for this name
353 #define TREE_USED(NODE) ((NODE)->common.used_flag)
355 /* Nonzero for a tree node whose evaluation could result
356 in the raising of an exception. Not implemented yet. */
357 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
359 /* Used in classes in C++. */
360 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
361 /* Used in classes in C++.
362 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
363 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
365 /* These flags are available for each language front end to use internally. */
366 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
367 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
368 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
369 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
370 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
371 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
372 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
374 /* Define additional fields and accessors for nodes representing constants. */
376 /* In an INTEGER_CST node. These two together make a 2-word integer.
377 If the data type is signed, the value is sign-extended to 2 words
378 even though not all of them may really be in use.
379 In an unsigned constant shorter than 2 words, the extra bits are 0. */
380 #define TREE_INT_CST_LOW(NODE) ((NODE)->int_cst.int_cst_low)
381 #define TREE_INT_CST_HIGH(NODE) ((NODE)->int_cst.int_cst_high)
383 #define INT_CST_LT(A, B) \
384 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
385 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
386 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
387 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
389 #define INT_CST_LT_UNSIGNED(A, B) \
390 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
391 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
392 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
393 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
394 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
395 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
399 char common[sizeof (struct tree_common)];
400 HOST_WIDE_INT int_cst_low;
401 HOST_WIDE_INT int_cst_high;
404 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
405 and generally in all kinds of constants that could
406 be given labels (rather than being immediate). */
408 #define TREE_CST_RTL(NODE) ((NODE)->real_cst.rtl)
410 /* In a REAL_CST node. */
411 /* We can represent a real value as either a `double' or a string.
412 Strings don't allow for any optimization, but they do allow
413 for cross-compilation. */
415 #define TREE_REAL_CST(NODE) ((NODE)->real_cst.real_cst)
421 char common[sizeof (struct tree_common)];
422 struct rtx_def *rtl; /* acts as link to register transfer language
424 REAL_VALUE_TYPE real_cst;
427 /* In a STRING_CST */
428 #define TREE_STRING_LENGTH(NODE) ((NODE)->string.length)
429 #define TREE_STRING_POINTER(NODE) ((NODE)->string.pointer)
433 char common[sizeof (struct tree_common)];
434 struct rtx_def *rtl; /* acts as link to register transfer language
440 /* In a COMPLEX_CST node. */
441 #define TREE_REALPART(NODE) ((NODE)->complex.real)
442 #define TREE_IMAGPART(NODE) ((NODE)->complex.imag)
446 char common[sizeof (struct tree_common)];
447 struct rtx_def *rtl; /* acts as link to register transfer language
449 union tree_node *real;
450 union tree_node *imag;
453 /* Define fields and accessors for some special-purpose tree nodes. */
455 #define IDENTIFIER_LENGTH(NODE) ((NODE)->identifier.length)
456 #define IDENTIFIER_POINTER(NODE) ((NODE)->identifier.pointer)
458 struct tree_identifier
460 char common[sizeof (struct tree_common)];
465 /* In a TREE_LIST node. */
466 #define TREE_PURPOSE(NODE) ((NODE)->list.purpose)
467 #define TREE_VALUE(NODE) ((NODE)->list.value)
471 char common[sizeof (struct tree_common)];
472 union tree_node *purpose;
473 union tree_node *value;
476 /* In a TREE_VEC node. */
477 #define TREE_VEC_LENGTH(NODE) ((NODE)->vec.length)
478 #define TREE_VEC_ELT(NODE,I) ((NODE)->vec.a[I])
479 #define TREE_VEC_END(NODE) (&((NODE)->vec.a[(NODE)->vec.length]))
483 char common[sizeof (struct tree_common)];
485 union tree_node *a[1];
488 /* Define fields and accessors for some nodes that represent expressions. */
490 /* In a SAVE_EXPR node. */
491 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
492 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
494 /* In a RTL_EXPR node. */
495 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[0])
496 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[1])
498 /* In a CALL_EXPR node. */
499 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
501 /* In a CONSTRUCTOR node. */
502 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
504 /* In ordinary expression nodes. */
505 #define TREE_OPERAND(NODE, I) ((NODE)->exp.operands[I])
506 #define TREE_COMPLEXITY(NODE) ((NODE)->exp.complexity)
510 char common[sizeof (struct tree_common)];
512 union tree_node *operands[1];
515 /* In a BLOCK node. */
516 #define BLOCK_VARS(NODE) ((NODE)->block.vars)
517 #define BLOCK_TYPE_TAGS(NODE) ((NODE)->block.type_tags)
518 #define BLOCK_SUBBLOCKS(NODE) ((NODE)->block.subblocks)
519 #define BLOCK_SUPERCONTEXT(NODE) ((NODE)->block.supercontext)
520 /* Note: when changing this, make sure to find the places
521 that use chainon or nreverse. */
522 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
523 #define BLOCK_ABSTRACT_ORIGIN(NODE) ((NODE)->block.abstract_origin)
524 #define BLOCK_ABSTRACT(NODE) ((NODE)->block.abstract_flag)
525 #define BLOCK_END_NOTE(NODE) ((NODE)->block.end_note)
527 /* Nonzero means that this block is prepared to handle exceptions
528 listed in the BLOCK_VARS slot. */
529 #define BLOCK_HANDLER_BLOCK(NODE) ((NODE)->block.handler_block_flag)
533 char common[sizeof (struct tree_common)];
535 unsigned handler_block_flag : 1;
536 unsigned abstract_flag : 1;
538 union tree_node *vars;
539 union tree_node *type_tags;
540 union tree_node *subblocks;
541 union tree_node *supercontext;
542 union tree_node *abstract_origin;
543 struct rtx_def *end_note;
546 /* Define fields and accessors for nodes representing data types. */
548 /* See tree.def for documentation of the use of these fields.
549 Look at the documentation of the various ..._TYPE tree codes. */
551 #define TYPE_UID(NODE) ((NODE)->type.uid)
552 #define TYPE_SIZE(NODE) ((NODE)->type.size)
553 #define TYPE_MODE(NODE) ((NODE)->type.mode)
554 #define TYPE_VALUES(NODE) ((NODE)->type.values)
555 #define TYPE_DOMAIN(NODE) ((NODE)->type.values)
556 #define TYPE_FIELDS(NODE) ((NODE)->type.values)
557 #define TYPE_METHODS(NODE) ((NODE)->type.maxval)
558 #define TYPE_VFIELD(NODE) ((NODE)->type.minval)
559 #define TYPE_ARG_TYPES(NODE) ((NODE)->type.values)
560 #define TYPE_METHOD_BASETYPE(NODE) ((NODE)->type.maxval)
561 #define TYPE_OFFSET_BASETYPE(NODE) ((NODE)->type.maxval)
562 #define TYPE_POINTER_TO(NODE) ((NODE)->type.pointer_to)
563 #define TYPE_REFERENCE_TO(NODE) ((NODE)->type.reference_to)
564 #define TYPE_MIN_VALUE(NODE) ((NODE)->type.minval)
565 #define TYPE_MAX_VALUE(NODE) ((NODE)->type.maxval)
566 #define TYPE_PRECISION(NODE) ((NODE)->type.precision)
567 #define TYPE_PARSE_INFO(NODE) ((NODE)->type.parse_info)
568 #define TYPE_SYMTAB_ADDRESS(NODE) ((NODE)->type.symtab.address)
569 #define TYPE_SYMTAB_POINTER(NODE) ((NODE)->type.symtab.pointer)
570 #define TYPE_NAME(NODE) ((NODE)->type.name)
571 #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant)
572 #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant)
573 #define TYPE_BINFO(NODE) ((NODE)->type.binfo)
574 #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts)
575 #define TYPE_CONTEXT(NODE) ((NODE)->type.context)
576 #define TYPE_OBSTACK(NODE) ((NODE)->type.obstack)
577 #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific)
579 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
581 #define TYPE_ATTRIBUTES(NODE) ((NODE)->type.attributes)
583 /* The alignment necessary for objects of this type.
584 The value is an int, measured in bits. */
585 #define TYPE_ALIGN(NODE) ((NODE)->type.align)
587 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
589 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
590 has BLKmode only because it lacks the alignment requirement for
592 #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag)
594 /* Nonzero in a type considered volatile as a whole. */
595 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
597 /* Means this type is const-qualified. */
598 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
600 /* These flags are available for each language front end to use internally. */
601 #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0)
602 #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1)
603 #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2)
604 #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3)
605 #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4)
606 #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5)
607 #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6)
609 /* If set in an ARRAY_TYPE, indicates a string type (for languages
610 that distinguish string from array of char).
611 If set in a SET_TYPE, indicates a bitstring type. */
612 #define TYPE_STRING_FLAG(NODE) ((NODE)->type.string_flag)
616 char common[sizeof (struct tree_common)];
617 union tree_node *values;
618 union tree_node *size;
619 union tree_node *attributes;
622 unsigned char precision;
623 #ifdef ONLY_INT_FIELDS
626 enum machine_mode mode : 8;
629 unsigned string_flag : 1;
630 unsigned no_force_blk_flag : 1;
631 unsigned lang_flag_0 : 1;
632 unsigned lang_flag_1 : 1;
633 unsigned lang_flag_2 : 1;
634 unsigned lang_flag_3 : 1;
635 unsigned lang_flag_4 : 1;
636 unsigned lang_flag_5 : 1;
637 unsigned lang_flag_6 : 1;
638 /* room for 7 more bits */
641 union tree_node *pointer_to;
642 union tree_node *reference_to;
644 union {int address; char *pointer; } symtab;
645 union tree_node *name;
646 union tree_node *minval;
647 union tree_node *maxval;
648 union tree_node *next_variant;
649 union tree_node *main_variant;
650 union tree_node *binfo;
651 union tree_node *noncopied_parts;
652 union tree_node *context;
653 struct obstack *obstack;
654 /* Points to a structure whose details depend on the language in use. */
655 struct lang_type *lang_specific;
658 /* Define accessor macros for information about type inheritance
661 A "basetype" means a particular usage of a data type for inheritance
662 in another type. Each such basetype usage has its own "binfo"
663 object to describe it. The binfo object is a TREE_VEC node.
665 Inheritance is represented by the binfo nodes allocated for a
666 given type. For example, given types C and D, such that D is
667 inherited by C, 3 binfo nodes will be allocated: one for describing
668 the binfo properties of C, similarly one for D, and one for
669 describing the binfo properties of D as a base type for C.
670 Thus, given a pointer to class C, one can get a pointer to the binfo
671 of D acting as a basetype for C by looking at C's binfo's basetypes. */
673 /* The actual data type node being inherited in this basetype. */
674 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
676 /* The offset where this basetype appears in its containing type.
677 BINFO_OFFSET slot holds the offset (in bytes)
678 from the base of the complete object to the base of the part of the
679 object that is allocated on behalf of this `type'.
680 This is always 0 except when there is multiple inheritance. */
682 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
683 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
684 #define BINFO_OFFSET_ZEROP(NODE) (BINFO_OFFSET (NODE) == integer_zero_node)
686 /* The virtual function table belonging to this basetype. Virtual
687 function tables provide a mechanism for run-time method dispatching.
688 The entries of a virtual function table are language-dependent. */
690 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
691 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
693 /* The virtual functions in the virtual function table. This is
694 a TREE_LIST that is used as an initial approximation for building
695 a virtual function table for this basetype. */
696 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
697 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
699 /* A vector of additional binfos for the types inherited by this basetype.
701 If this basetype describes type D as inherited in C,
702 and if the basetypes of D are E anf F,
703 then this vector contains binfos for inheritance of E and F by C.
705 ??? This could probably be done by just allocating the
706 base types at the end of this TREE_VEC (instead of using
707 another TREE_VEC). This would simplify the calculation
708 of how many basetypes a given type had. */
709 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
710 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
712 /* For a BINFO record describing an inheritance, this yields a pointer
713 to the artificial FIELD_DECL node which contains the "virtual base
714 class pointer" for the given inheritance. */
716 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
718 /* Accessor macro to get to the Nth basetype of this basetype. */
719 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
720 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
722 /* Slot used to build a chain that represents a use of inheritance.
723 For example, if X is derived from Y, and Y is derived from Z,
724 then this field can be used to link the binfo node for X to
725 the binfo node for X's Y to represent the use of inheritance
726 from X to Y. Similarly, this slot of the binfo node for X's Y
727 can point to the Z from which Y is inherited (in X's inheritance
728 hierarchy). In this fashion, one can represent and traverse specific
729 uses of inheritance using the binfo nodes themselves (instead of
730 consing new space pointing to binfo nodes).
731 It is up to the language-dependent front-ends to maintain
732 this information as necessary. */
733 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
735 /* Define fields and accessors for nodes representing declared names. */
737 /* This is the name of the object as written by the user.
738 It is an IDENTIFIER_NODE. */
739 #define DECL_NAME(NODE) ((NODE)->decl.name)
740 /* This is the name of the object as the assembler will see it
741 (but before any translations made by ASM_OUTPUT_LABELREF).
742 Often this is the same as DECL_NAME.
743 It is an IDENTIFIER_NODE. */
744 #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name)
745 /* Records the section name in a section attribute. Used to pass
746 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
747 #define DECL_SECTION_NAME(NODE) ((NODE)->decl.section_name)
748 /* For FIELD_DECLs, this is the
749 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
750 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
751 and CONST_DECL nodes, this points to the FUNCTION_DECL for the
752 containing function, or else yields NULL_TREE if the given decl has "file scope". */
753 #define DECL_CONTEXT(NODE) ((NODE)->decl.context)
754 #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context)
755 /* In a FIELD_DECL, this is the field position, counting in bits,
756 of the bit closest to the beginning of the structure. */
757 #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments)
758 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
759 if so, the type that was originally specified for it.
760 TREE_TYPE may have been modified (in finish_struct). */
761 #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result)
762 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
763 /* VAR_DECL and PARM_DECL reserve the arguments slot
764 for language-specific uses. */
765 #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments)
766 /* In FUNCTION_DECL, holds the decl for the return value. */
767 #define DECL_RESULT(NODE) ((NODE)->decl.result)
768 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
769 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result)
770 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
771 For a VAR_DECL, holds the initial value.
772 For a PARM_DECL, not used--default
773 values for parameters are encoded in the type of the function,
774 not in the PARM_DECL slot. */
775 #define DECL_INITIAL(NODE) ((NODE)->decl.initial)
776 /* For a PARM_DECL, records the data type used to pass the argument,
777 which may be different from the type seen in the program. */
778 #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */
779 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
780 if nonzero, indicates that the field occupies the type. */
781 #define DECL_QUALIFIER(NODE) ((NODE)->decl.initial)
782 /* These two fields describe where in the source code the declaration was. */
783 #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename)
784 #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum)
785 /* Holds the size of the datum, as a tree expression.
786 Need not be constant. */
787 #define DECL_SIZE(NODE) ((NODE)->decl.size)
788 /* Holds the alignment required for the datum. */
789 #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size.u)
790 /* Holds the machine mode corresponding to the declaration of a variable or
791 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
793 #define DECL_MODE(NODE) ((NODE)->decl.mode)
794 /* Holds the RTL expression for the value of a variable or function. If
795 PROMOTED_MODE is defined, the mode of this expression may not be same
796 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
797 to the variable's data type, while the mode
798 of DECL_RTL is the mode actually used to contain the data. */
799 #define DECL_RTL(NODE) ((NODE)->decl.rtl)
800 /* For PARM_DECL, holds an RTL for the stack slot or register
801 where the data was actually passed. */
802 #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r)
803 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
804 #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r)
805 /* For FUNCTION_DECL, if it is inline,
806 holds the size of the stack frame, as an integer. */
807 #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size.i)
808 /* For FUNCTION_DECL, if it is built-in,
809 this identifies which built-in operation it is. */
810 #define DECL_FUNCTION_CODE(NODE) ((NODE)->decl.frame_size.f)
811 #define DECL_SET_FUNCTION_CODE(NODE,VAL) ((NODE)->decl.frame_size.f = (VAL))
812 /* For a FIELD_DECL, holds the size of the member as an integer. */
813 #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i)
815 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
816 Before the struct containing the FUNCTION_DECL is laid out,
817 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
818 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
819 function. When the class is laid out, this pointer is changed
820 to an INTEGER_CST node which is suitable for use as an index
821 into the virtual function table. */
822 #define DECL_VINDEX(NODE) ((NODE)->decl.vindex)
823 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
824 which this FIELD_DECL is defined. This information is needed when
825 writing debugging information about vfield and vbase decls for C++. */
826 #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex)
828 /* Every ..._DECL node gets a unique number. */
829 #define DECL_UID(NODE) ((NODE)->decl.uid)
831 /* For any sort of a ..._DECL node, this points to the original (abstract)
832 decl node which this decl is an instance of, or else it is NULL indicating
833 that this decl is not an instance of some other decl. */
834 #define DECL_ABSTRACT_ORIGIN(NODE) ((NODE)->decl.abstract_origin)
836 /* Nonzero for any sort of ..._DECL node means this decl node represents
837 an inline instance of some original (abstract) decl from an inline function;
838 suppress any warnings about shadowing some other variable. */
839 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
841 /* Nonzero if a _DECL means that the name of this decl should be ignored
842 for symbolic debug purposes. */
843 #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag)
845 /* Nonzero for a given ..._DECL node means that this node represents an
846 "abstract instance" of the given declaration (e.g. in the original
847 declaration of an inline function). When generating symbolic debugging
848 information, we musn't try to generate any address information for nodes
849 marked as "abstract instances" because we don't actually generate
850 any code or allocate any data space for such instances. */
851 #define DECL_ABSTRACT(NODE) ((NODE)->decl.abstract_flag)
853 /* Nonzero if a _DECL means that no warnings should be generated just
854 because this decl is unused. */
855 #define DECL_IN_SYSTEM_HEADER(NODE) ((NODE)->decl.in_system_header_flag)
857 /* Nonzero for a given ..._DECL node means that this node should be
858 put in .common, if possible. If a DECL_INITIAL is given, and it
859 is not error_mark_node, then the decl cannot be put in .common. */
860 #define DECL_COMMON(NODE) ((NODE)->decl.common_flag)
862 /* Language-specific decl information. */
863 #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific)
865 /* In a VAR_DECL or FUNCTION_DECL,
866 nonzero means external reference:
867 do not allocate storage, and refer to a definition elsewhere. */
868 #define DECL_EXTERNAL(NODE) ((NODE)->decl.external_flag)
871 nonzero means the detail info about this type is not dumped into stabs.
872 Instead it will generate cross reference ('x') of names.
873 This uses the same flag as DECL_EXTERNAL. */
874 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) ((NODE)->decl.external_flag)
877 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'.
878 In LABEL_DECL nodes, nonzero means that an error message about
879 jumping into such a binding contour has been printed for this label. */
880 #define DECL_REGISTER(NODE) ((NODE)->decl.regdecl_flag)
881 /* In a FIELD_DECL, indicates this field should be bit-packed. */
882 #define DECL_PACKED(NODE) ((NODE)->decl.regdecl_flag)
884 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
885 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
887 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
889 Also set in some languages for variables, etc., outside the normal
890 lexical scope, such as class instance variables. */
891 #define DECL_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag)
893 /* Nonzero in a FUNCTION_DECL means this function can be substituted
894 where it is called. */
895 #define DECL_INLINE(NODE) ((NODE)->decl.inline_flag)
897 /* Nonzero in a FUNCTION_DECL means this is a built-in function
898 that is not specified by ansi C and that users are supposed to be allowed
899 to redefine for any purpose whatever. */
900 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
902 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
904 #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag)
905 /* In a LABEL_DECL, nonzero means label was defined inside a binding
906 contour that restored a stack level and which is now exited. */
907 #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag)
908 /* In a FUNCTION_DECL, nonzero means a built in function. */
909 #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag)
910 /* In a VAR_DECL that's static,
911 nonzero if the space is in the text section. */
912 #define DECL_IN_TEXT_SECTION(NODE) ((NODE)->decl.bit_field_flag)
914 /* Used in VAR_DECLs to indicate that the variable is a vtable.
915 It is also used in FIELD_DECLs for vtable pointers. */
916 #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag)
918 /* Used to indicate that the linkage status of this DECL is not yet known,
919 so it should not be output now. */
920 #define DECL_DEFER_OUTPUT(NODE) ((NODE)->decl.defer_output)
922 /* Additional flags for language-specific uses. */
923 #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0)
924 #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1)
925 #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2)
926 #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3)
927 #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4)
928 #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5)
929 #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6)
930 #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7)
934 char common[sizeof (struct tree_common)];
937 union tree_node *size;
939 #ifdef ONLY_INT_FIELDS
942 enum machine_mode mode : 8;
945 unsigned external_flag : 1;
946 unsigned nonlocal_flag : 1;
947 unsigned regdecl_flag : 1;
948 unsigned inline_flag : 1;
949 unsigned bit_field_flag : 1;
950 unsigned virtual_flag : 1;
951 unsigned ignored_flag : 1;
952 unsigned abstract_flag : 1;
954 unsigned in_system_header_flag : 1;
955 unsigned common_flag : 1;
956 unsigned defer_output : 1;
957 /* room for five more */
959 unsigned lang_flag_0 : 1;
960 unsigned lang_flag_1 : 1;
961 unsigned lang_flag_2 : 1;
962 unsigned lang_flag_3 : 1;
963 unsigned lang_flag_4 : 1;
964 unsigned lang_flag_5 : 1;
965 unsigned lang_flag_6 : 1;
966 unsigned lang_flag_7 : 1;
968 union tree_node *name;
969 union tree_node *context;
970 union tree_node *arguments;
971 union tree_node *result;
972 union tree_node *initial;
973 union tree_node *abstract_origin;
974 union tree_node *assembler_name;
975 union tree_node *section_name;
976 struct rtx_def *rtl; /* acts as link to register transfer language
978 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
979 If built-in, this is the code for which built-in function.
980 For other kinds of decls, this is DECL_ALIGN. */
984 enum built_in_function f;
986 /* For FUNCTION_DECLs: points to insn that constitutes its definition
987 on the permanent obstack. For any other kind of decl, this is the
993 union tree_node *vindex;
994 /* Points to a structure whose details depend on the language in use. */
995 struct lang_decl *lang_specific;
998 /* Define the overall contents of a tree node.
999 It may be any of the structures declared above
1000 for various types of node. */
1004 struct tree_common common;
1005 struct tree_int_cst int_cst;
1006 struct tree_real_cst real_cst;
1007 struct tree_string string;
1008 struct tree_complex complex;
1009 struct tree_identifier identifier;
1010 struct tree_decl decl;
1011 struct tree_type type;
1012 struct tree_list list;
1013 struct tree_vec vec;
1014 struct tree_exp exp;
1015 struct tree_block block;
1018 /* Add prototype support. */
1020 #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
1021 #define PROTO(ARGS) ARGS
1023 #define PROTO(ARGS) ()
1029 #define PVPROTO(ARGS) ARGS
1030 #define VPROTO(ARGS) ARGS
1031 #define VA_START(va_list,var) va_start(va_list,var)
1033 #define PVPROTO(ARGS) ()
1034 #define VPROTO(ARGS) (va_alist) va_dcl
1035 #define VA_START(va_list,var) va_start(va_list)
1041 #define STDIO_PROTO(ARGS) PROTO(ARGS)
1043 #define STDIO_PROTO(ARGS) ()
1047 #define NULL_TREE (tree) NULL
1049 /* Define a generic NULL if one hasn't already been defined. */
1056 #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
1057 #define GENERIC_PTR void *
1059 #define GENERIC_PTR char *
1064 #define NULL_PTR ((GENERIC_PTR)0)
1067 /* The following functions accept a wide integer argument. Rather than
1068 having to cast on every function call, we use a macro instead, that is
1069 defined here and in rtl.h. */
1072 #define exact_log2(N) exact_log2_wide ((HOST_WIDE_INT) (N))
1073 #define floor_log2(N) floor_log2_wide ((HOST_WIDE_INT) (N))
1077 /* At present, don't prototype xrealloc, since all of the callers don't
1078 cast their pointers to char *, and all of the xrealloc's don't use
1080 extern char *xmalloc PROTO((size_t));
1081 extern char *xrealloc PROTO((void *, size_t));
1083 extern char *xmalloc ();
1084 extern char *xrealloc ();
1087 extern char *oballoc PROTO((int));
1088 extern char *permalloc PROTO((int));
1089 extern char *savealloc PROTO((int));
1090 extern void free PROTO((void *));
1092 /* Lowest level primitive for allocating a node.
1093 The TREE_CODE is the only argument. Contents are initialized
1094 to zero except for a few of the common fields. */
1096 extern tree make_node PROTO((enum tree_code));
1098 /* Make a copy of a node, with all the same contents except
1099 for TREE_PERMANENT. (The copy is permanent
1100 iff nodes being made now are permanent.) */
1102 extern tree copy_node PROTO((tree));
1104 /* Make a copy of a chain of TREE_LIST nodes. */
1106 extern tree copy_list PROTO((tree));
1108 /* Make a TREE_VEC. */
1110 extern tree make_tree_vec PROTO((int));
1112 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1113 The name is supplied as a char *. */
1115 extern tree get_identifier PROTO((char *));
1117 /* Construct various types of nodes. */
1119 #define build_int_2(LO,HI) \
1120 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1122 extern tree build PVPROTO((enum tree_code, tree, ...));
1123 extern tree build_nt PVPROTO((enum tree_code, ...));
1124 extern tree build_parse_node PVPROTO((enum tree_code, ...));
1126 extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT));
1127 extern tree build_real PROTO((tree, REAL_VALUE_TYPE));
1128 extern tree build_real_from_int_cst PROTO((tree, tree));
1129 extern tree build_complex PROTO((tree, tree));
1130 extern tree build_string PROTO((int, char *));
1131 extern tree build1 PROTO((enum tree_code, tree, tree));
1132 extern tree build_tree_list PROTO((tree, tree));
1133 extern tree build_decl_list PROTO((tree, tree));
1134 extern tree build_decl PROTO((enum tree_code, tree, tree));
1135 extern tree build_block PROTO((tree, tree, tree, tree, tree));
1137 /* Construct various nodes representing data types. */
1139 extern tree make_signed_type PROTO((int));
1140 extern tree make_unsigned_type PROTO((int));
1141 extern tree signed_or_unsigned_type PROTO((int, tree));
1142 extern void fixup_unsigned_type PROTO((tree));
1143 extern tree build_pointer_type PROTO((tree));
1144 extern tree build_reference_type PROTO((tree));
1145 extern tree build_index_type PROTO((tree));
1146 extern tree build_index_2_type PROTO((tree, tree));
1147 extern tree build_array_type PROTO((tree, tree));
1148 extern tree build_function_type PROTO((tree, tree));
1149 extern tree build_method_type PROTO((tree, tree));
1150 extern tree build_offset_type PROTO((tree, tree));
1151 extern tree build_complex_type PROTO((tree));
1152 extern tree array_type_nelts PROTO((tree));
1154 extern tree value_member PROTO((tree, tree));
1155 extern tree purpose_member PROTO((tree, tree));
1156 extern tree binfo_member PROTO((tree, tree));
1157 extern int attribute_list_equal PROTO((tree, tree));
1158 extern int attribute_list_contained PROTO((tree, tree));
1159 extern int tree_int_cst_equal PROTO((tree, tree));
1160 extern int tree_int_cst_lt PROTO((tree, tree));
1161 extern int tree_int_cst_sgn PROTO((tree));
1162 extern int index_type_equal PROTO((tree, tree));
1164 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1165 put the prototype here. Rtl.h does declare the prototype if
1166 tree.h had been included. */
1168 extern tree make_tree ();
1170 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1173 Such modified types already made are recorded so that duplicates
1176 extern tree build_type_attribute_variant PROTO((tree, tree));
1178 /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
1179 for the same kind of data as TYPE describes.
1180 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
1181 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
1182 so that duplicate variants are never made.
1183 Only main variants should ever appear as types of expressions. */
1185 extern tree build_type_variant PROTO((tree, int, int));
1187 /* Make a copy of a type node. */
1189 extern tree build_type_copy PROTO((tree));
1191 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1192 TYPE_ALIGN and TYPE_MODE fields.
1193 If called more than once on one node, does nothing except
1194 for the first time. */
1196 extern void layout_type PROTO((tree));
1198 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1199 return a canonicalized ..._TYPE node, so that duplicates are not made.
1200 How the hash code is computed is up to the caller, as long as any two
1201 callers that could hash identical-looking type nodes agree. */
1203 extern tree type_hash_canon PROTO((int, tree));
1205 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1206 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1207 fields. Call this only once for any given decl node.
1209 Second argument is the boundary that this field can be assumed to
1210 be starting at (in bits). Zero means it can be assumed aligned
1211 on any boundary that may be needed. */
1213 extern void layout_decl PROTO((tree, unsigned));
1215 /* Return an expr equal to X but certainly not valid as an lvalue. */
1217 extern tree non_lvalue PROTO((tree));
1218 extern tree pedantic_non_lvalue PROTO((tree));
1220 extern tree convert PROTO((tree, tree));
1221 extern tree size_in_bytes PROTO((tree));
1222 extern int int_size_in_bytes PROTO((tree));
1223 extern tree size_binop PROTO((enum tree_code, tree, tree));
1224 extern tree size_int PROTO((unsigned));
1225 extern tree round_up PROTO((tree, int));
1226 extern tree get_pending_sizes PROTO((void));
1228 /* Type for sizes of data-type. */
1230 extern tree sizetype;
1232 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1233 by making the last node in X point to Y.
1234 Returns X, except if X is 0 returns Y. */
1236 extern tree chainon PROTO((tree, tree));
1238 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1240 extern tree tree_cons PROTO((tree, tree, tree));
1241 extern tree perm_tree_cons PROTO((tree, tree, tree));
1242 extern tree temp_tree_cons PROTO((tree, tree, tree));
1243 extern tree saveable_tree_cons PROTO((tree, tree, tree));
1244 extern tree decl_tree_cons PROTO((tree, tree, tree));
1246 /* Return the last tree node in a chain. */
1248 extern tree tree_last PROTO((tree));
1250 /* Reverse the order of elements in a chain, and return the new head. */
1252 extern tree nreverse PROTO((tree));
1254 /* Returns the length of a chain of nodes
1255 (number of chain pointers to follow before reaching a null pointer). */
1257 extern int list_length PROTO((tree));
1259 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1261 extern int integer_zerop PROTO((tree));
1263 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1265 extern int integer_onep PROTO((tree));
1267 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1268 all of whose significant bits are 1. */
1270 extern int integer_all_onesp PROTO((tree));
1272 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1273 exactly one bit 1. */
1275 extern int integer_pow2p PROTO((tree));
1277 /* staticp (tree x) is nonzero if X is a reference to data allocated
1278 at a fixed address in memory. */
1280 extern int staticp PROTO((tree));
1282 /* Gets an error if argument X is not an lvalue.
1283 Also returns 1 if X is an lvalue, 0 if not. */
1285 extern int lvalue_or_else PROTO((tree, char *));
1287 /* save_expr (EXP) returns an expression equivalent to EXP
1288 but it can be used multiple times within context CTX
1289 and only evaluate EXP once. */
1291 extern tree save_expr PROTO((tree));
1293 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1294 or offset that depends on a field within a record.
1296 Note that we only allow such expressions within simple arithmetic
1299 extern int contains_placeholder_p PROTO((tree));
1301 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1302 return a tree with all occurrences of references to F in a
1303 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1304 contains only arithmetic expressions. */
1306 extern tree substitute_in_expr PROTO((tree, tree, tree));
1308 /* Given a type T, a FIELD_DECL F, and a replacement value R,
1309 return a new type with all size expressions that contain F
1310 updated by replacing the reference to F with R. */
1312 extern tree substitute_in_type PROTO((tree, tree, tree));
1314 /* variable_size (EXP) is like save_expr (EXP) except that it
1315 is for the special case of something that is part of a
1316 variable size for a data type. It makes special arrangements
1317 to compute the value at the right time when the data type
1318 belongs to a function parameter. */
1320 extern tree variable_size PROTO((tree));
1322 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1323 but it can be used multiple times
1324 and only evaluate the subexpressions once. */
1326 extern tree stabilize_reference PROTO((tree));
1328 /* Return EXP, stripped of any conversions to wider types
1329 in such a way that the result of converting to type FOR_TYPE
1330 is the same as if EXP were converted to FOR_TYPE.
1331 If FOR_TYPE is 0, it signifies EXP's type. */
1333 extern tree get_unwidened PROTO((tree, tree));
1335 /* Return OP or a simpler expression for a narrower value
1336 which can be sign-extended or zero-extended to give back OP.
1337 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1338 or 0 if the value should be sign-extended. */
1340 extern tree get_narrower PROTO((tree, int *));
1342 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1344 The definition of this resides in language-specific code
1345 as the repertoire of available types may vary. */
1347 extern tree type_for_mode PROTO((enum machine_mode, int));
1349 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1350 for an integer type with at least that precision.
1351 The definition of this resides in language-specific code
1352 as the repertoire of available types may vary. */
1354 extern tree type_for_size PROTO((unsigned, int));
1356 /* Given an integer type T, return a type like T but unsigned.
1357 If T is unsigned, the value is T.
1358 The definition of this resides in language-specific code
1359 as the repertoire of available types may vary. */
1361 extern tree unsigned_type PROTO((tree));
1363 /* Given an integer type T, return a type like T but signed.
1364 If T is signed, the value is T.
1365 The definition of this resides in language-specific code
1366 as the repertoire of available types may vary. */
1368 extern tree signed_type PROTO((tree));
1370 /* This function must be defined in the language-specific files.
1371 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1372 This is defined in a language-specific file. */
1374 extern tree maybe_build_cleanup PROTO((tree));
1376 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1377 look for nested component-refs or array-refs at constant positions
1378 and find the ultimate containing object, which is returned. */
1380 extern tree get_inner_reference PROTO((tree, int *, int *, tree *, enum machine_mode *, int *, int *));
1382 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1384 extern tree decl_function_context PROTO((tree));
1386 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1387 this _DECL with its context, or zero if none. */
1388 extern tree decl_type_context PROTO((tree));
1390 /* Given the FUNCTION_DECL for the current function,
1391 return zero if it is ok for this function to be inline.
1392 Otherwise return a warning message with a single %s
1393 for the function's name. */
1395 extern char *function_cannot_inline_p PROTO((tree));
1397 /* Return 1 if EXPR is the real constant zero. */
1398 extern int real_zerop PROTO((tree));
1400 /* Declare commonly used variables for tree structure. */
1402 /* An integer constant with value 0 */
1403 extern tree integer_zero_node;
1405 /* An integer constant with value 1 */
1406 extern tree integer_one_node;
1408 /* An integer constant with value 0 whose type is sizetype. */
1409 extern tree size_zero_node;
1411 /* An integer constant with value 1 whose type is sizetype. */
1412 extern tree size_one_node;
1414 /* A constant of type pointer-to-int and value 0 */
1415 extern tree null_pointer_node;
1417 /* A node of type ERROR_MARK. */
1418 extern tree error_mark_node;
1420 /* The type node for the void type. */
1421 extern tree void_type_node;
1423 /* The type node for the ordinary (signed) integer type. */
1424 extern tree integer_type_node;
1426 /* The type node for the unsigned integer type. */
1427 extern tree unsigned_type_node;
1429 /* The type node for the ordinary character type. */
1430 extern tree char_type_node;
1432 /* Points to the name of the input file from which the current input
1433 being parsed originally came (before it went into cpp). */
1434 extern char *input_filename;
1436 /* Current line number in input file. */
1439 /* Nonzero for -pedantic switch: warn about anything
1440 that standard C forbids. */
1441 extern int pedantic;
1443 /* Nonzero means can safely call expand_expr now;
1444 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1446 extern int immediate_size_expand;
1448 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1450 extern tree current_function_decl;
1452 /* Nonzero if function being compiled can call setjmp. */
1454 extern int current_function_calls_setjmp;
1456 /* Nonzero if function being compiled can call longjmp. */
1458 extern int current_function_calls_longjmp;
1460 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1462 extern int all_types_permanent;
1464 /* Pointer to function to compute the name to use to print a declaration. */
1466 extern char *(*decl_printable_name) ();
1468 /* Pointer to function to finish handling an incomplete decl at the
1469 end of compilation. */
1471 extern void (*incomplete_decl_finalize_hook) ();
1474 extern char *perm_calloc PROTO((int, long));
1478 extern void expand_fixups PROTO((struct rtx_def *));
1479 extern tree expand_start_stmt_expr PROTO((void));
1480 extern tree expand_end_stmt_expr PROTO((tree));
1481 extern void expand_expr_stmt PROTO((tree));
1482 extern void expand_decl_init PROTO((tree));
1483 extern void clear_last_expr PROTO((void));
1484 extern void expand_label PROTO((tree));
1485 extern void expand_goto PROTO((tree));
1486 extern void expand_asm PROTO((tree));
1487 extern void expand_start_cond PROTO((tree, int));
1488 extern void expand_end_cond PROTO((void));
1489 extern void expand_start_else PROTO((void));
1490 extern void expand_start_elseif PROTO((tree));
1491 extern struct nesting *expand_start_loop PROTO((int));
1492 extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int));
1493 extern void expand_loop_continue_here PROTO((void));
1494 extern void expand_end_loop PROTO((void));
1495 extern int expand_continue_loop PROTO((struct nesting *));
1496 extern int expand_exit_loop PROTO((struct nesting *));
1497 extern int expand_exit_loop_if_false PROTO((struct nesting *,
1499 extern int expand_exit_something PROTO((void));
1501 extern void expand_null_return PROTO((void));
1502 extern void expand_return PROTO((tree));
1503 extern void expand_start_bindings PROTO((int));
1504 extern void expand_end_bindings PROTO((tree, int, int));
1505 extern tree last_cleanup_this_contour PROTO((void));
1506 extern void expand_start_case PROTO((int, tree, tree,
1508 extern void expand_end_case PROTO((tree));
1509 extern int pushcase PROTO((tree,
1510 tree (*) (tree, tree),
1512 extern int pushcase_range PROTO((tree, tree,
1513 tree (*) (tree, tree),
1516 /* In fold-const.c */
1518 /* Fold constants as much as possible in an expression.
1519 Returns the simplified expression.
1520 Acts only on the top level of the expression;
1521 if the argument itself cannot be simplified, its
1522 subexpressions are not changed. */
1524 extern tree fold PROTO((tree));
1526 extern int force_fit_type PROTO((tree, int));
1527 extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1528 HOST_WIDE_INT, HOST_WIDE_INT,
1529 HOST_WIDE_INT *, HOST_WIDE_INT *));
1530 extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1531 HOST_WIDE_INT *, HOST_WIDE_INT *));
1532 extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1533 HOST_WIDE_INT, HOST_WIDE_INT,
1534 HOST_WIDE_INT *, HOST_WIDE_INT *));
1535 extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1536 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1537 HOST_WIDE_INT *, int));
1538 extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1540 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
1541 extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1542 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1544 extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1545 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1547 extern int operand_equal_p PROTO((tree, tree, int));
1548 extern tree invert_truthvalue PROTO((tree));
1550 /* The language front-end must define these functions. */
1552 /* Function of no arguments for initializing lexical scanning. */
1553 extern void init_lex PROTO((void));
1554 /* Function of no arguments for initializing the symbol table. */
1555 extern void init_decl_processing PROTO((void));
1557 /* Functions called with no arguments at the beginning and end or processing
1558 the input source file. */
1559 extern void lang_init PROTO((void));
1560 extern void lang_finish PROTO((void));
1562 /* Funtion to identify which front-end produced the output file. */
1563 extern char *lang_identify PROTO((void));
1565 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
1566 extern void copy_lang_decl PROTO((tree));
1568 /* Function called with no arguments to parse and compile the input. */
1569 extern int yyparse PROTO((void));
1570 /* Function called with option as argument
1571 to decode options starting with -f or -W or +.
1572 It should return nonzero if it handles the option. */
1573 extern int lang_decode_option PROTO((char *));
1575 /* Functions for processing symbol declarations. */
1576 /* Function to enter a new lexical scope.
1577 Takes one argument: always zero when called from outside the front end. */
1578 extern void pushlevel PROTO((int));
1579 /* Function to exit a lexical scope. It returns a BINDING for that scope.
1580 Takes three arguments:
1581 KEEP -- nonzero if there were declarations in this scope.
1582 REVERSE -- reverse the order of decls before returning them.
1583 FUNCTIONBODY -- nonzero if this level is the body of a function. */
1584 extern tree poplevel PROTO((int, int, int));
1585 /* Set the BLOCK node for the current scope level. */
1586 extern void set_block PROTO((tree));
1587 /* Function to add a decl to the current scope level.
1588 Takes one argument, a decl to add.
1589 Returns that decl, or, if the same symbol is already declared, may
1590 return a different decl for that name. */
1591 extern tree pushdecl PROTO((tree));
1592 /* Function to return the chain of decls so far in the current scope level. */
1593 extern tree getdecls PROTO((void));
1594 /* Function to return the chain of structure tags in the current scope level. */
1595 extern tree gettags PROTO((void));
1597 extern tree build_range_type PROTO((tree, tree, tree));
1599 /* Call when starting to parse a declaration:
1600 make expressions in the declaration last the length of the function.
1601 Returns an argument that should be passed to resume_momentary later. */
1602 extern int suspend_momentary PROTO((void));
1604 extern int allocation_temporary_p PROTO((void));
1606 /* Call when finished parsing a declaration:
1607 restore the treatment of node-allocation that was
1608 in effect before the suspension.
1609 YES should be the value previously returned by suspend_momentary. */
1610 extern void resume_momentary PROTO((int));
1612 /* Called after finishing a record, union or enumeral type. */
1613 extern void rest_of_type_compilation PROTO((tree, int));
1615 /* Save the current set of obstacks, but don't change them. */
1616 extern void push_obstacks_nochange PROTO((void));
1618 extern void permanent_allocation PROTO((int));
1620 extern void push_momentary PROTO((void));
1622 extern void clear_momentary PROTO((void));
1624 extern void pop_momentary PROTO((void));
1626 extern void end_temporary_allocation PROTO((void));
1628 /* Pop the obstack selection stack. */
1629 extern void pop_obstacks PROTO((void));