1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989 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. */
22 /* codes of tree nodes */
24 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
29 LAST_AND_UNUSED_TREE_CODE
/* A convenient way to get a value for
35 /* Number of tree codes. */
36 #define NUM_TREE_CODES ((int)LAST_AND_UNUSED_TREE_CODE)
38 /* Indexed by enum tree_code, contains a character which is
39 `<' for a comparison expression, `1', for a unary arithmetic
40 expression, `2' for a binary arithmetic expression, `e' for
41 other types of expressions, `r' for a reference, `c' for a
42 constant, `d' for a decl, `t' for a type, `s' for a statement,
43 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
45 extern char **tree_code_type
;
46 #define TREE_CODE_CLASS(CODE) (*tree_code_type[(int) (CODE)])
48 /* Number of argument-words in each kind of tree-node. */
50 extern int *tree_code_length
;
52 /* Names of tree components. */
54 extern char **tree_code_name
;
56 /* Codes that identify the various built in functions
57 so that expand_call can identify them quickly. */
59 enum built_in_function
85 BUILT_IN_CLASSIFY_TYPE
,
89 BUILT_IN_FRAME_ADDRESS
,
90 BUILT_IN_RETURN_ADDRESS
,
91 BUILT_IN_CALLER_RETURN_ADDRESS
,
103 /* The definition of tree nodes fills the next several pages. */
105 /* A tree node can represent a data type, a variable, an expression
106 or a statement. Each node has a TREE_CODE which says what kind of
107 thing it represents. Some common codes are:
108 INTEGER_TYPE -- represents a type of integers.
109 ARRAY_TYPE -- represents a type of pointer.
110 VAR_DECL -- represents a declared variable.
111 INTEGER_CST -- represents a constant integer value.
112 PLUS_EXPR -- represents a sum (an expression).
114 As for the contents of a tree node: there are some fields
115 that all nodes share. Each TREE_CODE has various special-purpose
116 fields as well. The fields of a node are never accessed directly,
117 always through accessor macros. */
119 /* This type is used everywhere to refer to a tree node. */
121 typedef union tree_node
*tree
;
123 /* Every kind of tree node starts with this structure,
124 so all nodes have these fields.
126 See the accessor macros, defined below, for documentation of the fields. */
130 union tree_node
*chain
;
131 union tree_node
*type
;
132 #ifdef ONLY_INT_FIELDS
133 unsigned int code
: 8;
135 enum tree_code code
: 8;
138 unsigned side_effects_flag
: 1;
139 unsigned constant_flag
: 1;
140 unsigned permanent_flag
: 1;
141 unsigned addressable_flag
: 1;
142 unsigned volatile_flag
: 1;
143 unsigned readonly_flag
: 1;
144 unsigned unsigned_flag
: 1;
145 unsigned asm_written_flag
: 1;
147 unsigned used_flag
: 1;
148 unsigned raises_flag
: 1;
149 unsigned static_flag
: 1;
150 unsigned public_flag
: 1;
151 unsigned private_flag
: 1;
152 unsigned protected_flag
: 1;
154 unsigned lang_flag_0
: 1;
155 unsigned lang_flag_1
: 1;
156 unsigned lang_flag_2
: 1;
157 unsigned lang_flag_3
: 1;
158 unsigned lang_flag_4
: 1;
159 unsigned lang_flag_5
: 1;
160 unsigned lang_flag_6
: 1;
161 /* There is room for two more flags. */
164 /* Define accessors for the fields that all tree nodes have
165 (though some fields are not used for all kinds of nodes). */
167 /* The tree-code says what kind of node it is.
168 Codes are defined in tree.def. */
169 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
170 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
172 /* In all nodes that are expressions, this is the data type of the expression.
173 In POINTER_TYPE nodes, this is the type that the pointer points to.
174 In ARRAY_TYPE nodes, this is the type of the elements. */
175 #define TREE_TYPE(NODE) ((NODE)->common.type)
177 /* Nodes are chained together for many purposes.
178 Types are chained together to record them for being output to the debugger
179 (see the function `chain_type').
180 Decls in the same scope are chained together to record the contents
182 Statement nodes for successive statements used to be chained together.
183 Often lists of things are represented by TREE_LIST nodes that
184 are chained together. */
186 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
188 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
189 that don't change the machine mode. */
191 #define STRIP_NOPS(EXP) \
192 while ((TREE_CODE (EXP) == NOP_EXPR \
193 || TREE_CODE (EXP) == CONVERT_EXPR \
194 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
195 && (TYPE_MODE (TREE_TYPE (EXP)) \
196 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
197 (EXP) = TREE_OPERAND (EXP, 0);
199 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
201 #define STRIP_TYPE_NOPS(EXP) \
202 while ((TREE_CODE (EXP) == NOP_EXPR \
203 || TREE_CODE (EXP) == CONVERT_EXPR \
204 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
205 && (TREE_TYPE (EXP) \
206 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
207 (EXP) = TREE_OPERAND (EXP, 0);
209 /* Define many boolean fields that all tree nodes have. */
211 /* In VAR_DECL nodes, nonzero means address of this is needed.
212 So it cannot be in a register.
213 In a FUNCTION_DECL, nonzero means its address is needed.
214 So it must be compiled even if it is an inline function.
215 In CONSTRUCTOR nodes, it means object constructed must be in memory.
216 In LABEL_DECL nodes, it means a goto for this label has been seen
217 from a place outside all binding contours that restore stack levels.
218 In ..._TYPE nodes, it means that objects of this type must
219 be fully addressable. This means that pieces of this
220 object cannot go into register parameters, for example.
221 In IDENTIFIER_NODEs, this means that some extern decl for this name
222 had its address taken. That matters for inline functions. */
223 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
225 /* In a VAR_DECL, nonzero means allocate static storage.
226 In a FUNCTION_DECL, nonzero if function has been defined.
227 In a CONSTRUCTOR, nonzero means allocate static storage. */
228 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
230 /* In a CONVERT_EXPR or NOP_EXPR, this means the node was made
231 implicitly and should not lead to an "unused value" warning. */
232 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
234 /* In an INTEGER_CST, this means there was overflow in folding. */
235 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
237 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
238 chain is via a `virtual' declaration. */
239 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
241 /* In a VAR_DECL or FUNCTION_DECL,
242 nonzero means name is to be accessible from outside this module.
243 In an identifier node, nonzero means an external declaration
244 accessible from outside this module was previously seen
245 for this name in an inner scope. */
246 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
248 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
249 base class is via a `public' declaration, which preserves public
250 fields from the base class as public. */
251 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
253 /* Ditto, for `private' declarations. */
254 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
256 /* Nonzero for TREE_LIST node means that the path to the
257 base class is via a `protected' declaration, which preserves
258 protected fields from the base class as protected.
260 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
262 /* In any expression, nonzero means it has side effects or reevaluation
263 of the whole expression could produce a different value.
264 This is set if any subexpression is a function call, a side effect
265 or a reference to a volatile variable.
266 In a ..._DECL, this is set only if the declaration said `volatile'. */
267 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
269 /* Nonzero means this expression is volatile in the C sense:
270 its address should be of type `volatile WHATEVER *'.
271 In other words, the declared item is volatile qualified.
272 This is used in _DECL nodes and _REF nodes.
274 In a ..._TYPE node, means this type is volatile-qualified.
275 But use TYPE_VOLATILE instead of this macro when the node is a type,
276 because eventually we may make that a different bit.
278 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
279 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
281 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
282 nonzero means it may not be the lhs of an assignment.
283 In a ..._TYPE node, means this type is const-qualified
284 (but the macro TYPE_READONLY should be used instead of this macro
285 when the node is a type). */
286 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
288 /* Value of expression is constant.
289 Always appears in all ..._CST nodes.
290 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
291 if the value is constant. */
292 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
294 /* Nonzero means permanent node;
295 node will continue to exist for the entire compiler run.
296 Otherwise it will be recycled at the end of the function. */
297 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
299 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
300 In FIELD_DECL nodes, means an unsigned bit field.
301 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
302 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
304 /* Nonzero in a VAR_DECL means assembler code has been written.
305 Nonzero in a FUNCTION_DECL means that the function has been compiled.
306 This is interesting in an inline function, since it might not need
307 to be compiled separately.
308 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
309 if the sdb debugging info for the type has been written.
310 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
311 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
313 /* Nonzero in a _DECL if the name is used in its scope.
314 Nonzero in an expr node means inhibit warning if value is unused.
315 In IDENTIFIER_NODEs, this means that some extern decl for this name
317 #define TREE_USED(NODE) ((NODE)->common.used_flag)
319 /* Nonzero for a tree node whose evaluation could result
320 in the raising of an exception. Not implemented yet. */
321 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
323 /* Used in classes in C++. */
324 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
325 /* Used in classes in C++.
326 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
327 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
329 /* These flags are available for each language front end to use internally. */
330 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
331 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
332 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
333 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
334 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
335 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
336 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
338 /* Define additional fields and accessors for nodes representing constants. */
340 /* In an INTEGER_CST node. These two together make a 2-word integer.
341 If the data type is signed, the value is sign-extended to 2 words
342 even though not all of them may really be in use.
343 In an unsigned constant shorter than 2 words, the extra bits are 0. */
344 #define TREE_INT_CST_LOW(NODE) ((NODE)->int_cst.int_cst_low)
345 #define TREE_INT_CST_HIGH(NODE) ((NODE)->int_cst.int_cst_high)
347 #define INT_CST_LT(A, B) \
348 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
349 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
350 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
351 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
353 #define INT_CST_LT_UNSIGNED(A, B) \
354 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
355 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
356 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
357 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
358 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
359 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
363 char common
[sizeof (struct tree_common
)];
364 HOST_WIDE_INT int_cst_low
;
365 HOST_WIDE_INT int_cst_high
;
368 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
369 and generally in all kinds of constants that could
370 be given labels (rather than being immediate). */
372 #define TREE_CST_RTL(NODE) ((NODE)->real_cst.rtl)
374 /* In a REAL_CST node. */
375 /* We can represent a real value as either a `double' or a string.
376 Strings don't allow for any optimization, but they do allow
377 for cross-compilation. */
379 #define TREE_REAL_CST(NODE) ((NODE)->real_cst.real_cst)
385 char common
[sizeof (struct tree_common
)];
386 struct rtx_def
*rtl
; /* acts as link to register transfer language
388 REAL_VALUE_TYPE real_cst
;
391 /* In a STRING_CST */
392 #define TREE_STRING_LENGTH(NODE) ((NODE)->string.length)
393 #define TREE_STRING_POINTER(NODE) ((NODE)->string.pointer)
397 char common
[sizeof (struct tree_common
)];
398 struct rtx_def
*rtl
; /* acts as link to register transfer language
404 /* In a COMPLEX_CST node. */
405 #define TREE_REALPART(NODE) ((NODE)->complex.real)
406 #define TREE_IMAGPART(NODE) ((NODE)->complex.imag)
410 char common
[sizeof (struct tree_common
)];
411 struct rtx_def
*rtl
; /* acts as link to register transfer language
413 union tree_node
*real
;
414 union tree_node
*imag
;
417 /* Define fields and accessors for some special-purpose tree nodes. */
419 #define IDENTIFIER_LENGTH(NODE) ((NODE)->identifier.length)
420 #define IDENTIFIER_POINTER(NODE) ((NODE)->identifier.pointer)
422 struct tree_identifier
424 char common
[sizeof (struct tree_common
)];
429 /* In a TREE_LIST node. */
430 #define TREE_PURPOSE(NODE) ((NODE)->list.purpose)
431 #define TREE_VALUE(NODE) ((NODE)->list.value)
435 char common
[sizeof (struct tree_common
)];
436 union tree_node
*purpose
;
437 union tree_node
*value
;
440 /* In a TREE_VEC node. */
441 #define TREE_VEC_LENGTH(NODE) ((NODE)->vec.length)
442 #define TREE_VEC_ELT(NODE,I) ((NODE)->vec.a[I])
443 #define TREE_VEC_END(NODE) (&((NODE)->vec.a[(NODE)->vec.length]))
447 char common
[sizeof (struct tree_common
)];
449 union tree_node
*a
[1];
452 /* Define fields and accessors for some nodes that represent expressions. */
454 /* In a SAVE_EXPR node. */
455 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
456 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
458 /* In a RTL_EXPR node. */
459 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[0])
460 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[1])
462 /* In a CALL_EXPR node. */
463 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
465 /* In a CONSTRUCTOR node. */
466 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
468 /* In ordinary expression nodes. */
469 #define TREE_OPERAND(NODE, I) ((NODE)->exp.operands[I])
470 #define TREE_COMPLEXITY(NODE) ((NODE)->exp.complexity)
474 char common
[sizeof (struct tree_common
)];
476 union tree_node
*operands
[1];
479 /* In a BLOCK node. */
480 #define BLOCK_VARS(NODE) ((NODE)->block.vars)
481 #define BLOCK_TYPE_TAGS(NODE) ((NODE)->block.type_tags)
482 #define BLOCK_SUBBLOCKS(NODE) ((NODE)->block.subblocks)
483 #define BLOCK_SUPERCONTEXT(NODE) ((NODE)->block.supercontext)
484 /* Note: when changing this, make sure to find the places
485 that use chainon or nreverse. */
486 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
487 #define BLOCK_ABSTRACT_ORIGIN(NODE) ((NODE)->block.abstract_origin)
488 #define BLOCK_ABSTRACT(NODE) ((NODE)->block.abstract_flag)
489 #define BLOCK_END_NOTE(NODE) ((NODE)->block.end_note)
491 /* Nonzero means that this block is prepared to handle exceptions
492 listed in the BLOCK_VARS slot. */
493 #define BLOCK_HANDLER_BLOCK(NODE) ((NODE)->block.handler_block_flag)
497 char common
[sizeof (struct tree_common
)];
499 unsigned handler_block_flag
: 1;
500 unsigned abstract_flag
: 1;
502 union tree_node
*vars
;
503 union tree_node
*type_tags
;
504 union tree_node
*subblocks
;
505 union tree_node
*supercontext
;
506 union tree_node
*abstract_origin
;
507 struct rtx_def
*end_note
;
510 /* Define fields and accessors for nodes representing data types. */
512 /* See tree.def for documentation of the use of these fields.
513 Look at the documentation of the various ..._TYPE tree codes. */
515 #define TYPE_UID(NODE) ((NODE)->type.uid)
516 #define TYPE_SIZE(NODE) ((NODE)->type.size)
517 #define TYPE_MODE(NODE) ((NODE)->type.mode)
518 #define TYPE_VALUES(NODE) ((NODE)->type.values)
519 #define TYPE_DOMAIN(NODE) ((NODE)->type.values)
520 #define TYPE_FIELDS(NODE) ((NODE)->type.values)
521 #define TYPE_METHODS(NODE) ((NODE)->type.maxval)
522 #define TYPE_VFIELD(NODE) ((NODE)->type.minval)
523 #define TYPE_ARG_TYPES(NODE) ((NODE)->type.values)
524 #define TYPE_METHOD_BASETYPE(NODE) ((NODE)->type.maxval)
525 #define TYPE_OFFSET_BASETYPE(NODE) ((NODE)->type.maxval)
526 #define TYPE_POINTER_TO(NODE) ((NODE)->type.pointer_to)
527 #define TYPE_REFERENCE_TO(NODE) ((NODE)->type.reference_to)
528 #define TYPE_MIN_VALUE(NODE) ((NODE)->type.minval)
529 #define TYPE_MAX_VALUE(NODE) ((NODE)->type.maxval)
530 #define TYPE_PRECISION(NODE) ((NODE)->type.precision)
531 #define TYPE_PARSE_INFO(NODE) ((NODE)->type.parse_info)
532 #define TYPE_SYMTAB_ADDRESS(NODE) ((NODE)->type.symtab_address)
533 #define TYPE_NAME(NODE) ((NODE)->type.name)
534 #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant)
535 #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant)
536 #define TYPE_BINFO(NODE) ((NODE)->type.binfo)
537 #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts)
538 #define TYPE_CONTEXT(NODE) ((NODE)->type.context)
539 #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific)
541 /* The alignment necessary for objects of this type.
542 The value is an int, measured in bits. */
543 #define TYPE_ALIGN(NODE) ((NODE)->type.align)
545 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
547 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
548 has BLKmode only because it lacks the alignment requirement for
550 #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag)
552 /* Nonzero in a type considered volatile as a whole. */
553 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
555 /* Means this type is const-qualified. */
556 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
558 /* These flags are available for each language front end to use internally. */
559 #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0)
560 #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1)
561 #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2)
562 #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3)
563 #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4)
564 #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5)
565 #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6)
569 char common
[sizeof (struct tree_common
)];
570 union tree_node
*values
;
571 union tree_node
*size
;
574 #ifdef ONLY_INT_FIELDS
577 enum machine_mode mode
: 8;
579 unsigned char precision
;
581 unsigned no_force_blk_flag
: 1;
582 unsigned lang_flag_0
: 1;
583 unsigned lang_flag_1
: 1;
584 unsigned lang_flag_2
: 1;
585 unsigned lang_flag_3
: 1;
586 unsigned lang_flag_4
: 1;
587 unsigned lang_flag_5
: 1;
588 unsigned lang_flag_6
: 1;
591 union tree_node
*pointer_to
;
592 union tree_node
*reference_to
;
595 union tree_node
*name
;
596 union tree_node
*minval
;
597 union tree_node
*maxval
;
598 union tree_node
*next_variant
;
599 union tree_node
*main_variant
;
600 union tree_node
*binfo
;
601 union tree_node
*noncopied_parts
;
602 union tree_node
*context
;
603 /* Points to a structure whose details depend on the language in use. */
604 struct lang_type
*lang_specific
;
607 /* Define accessor macros for information about type inheritance
610 A "basetype" means a particular usage of a data type for inheritance
611 in another type. Each such basetype usage has its own "binfo"
612 object to describe it. The binfo object is a TREE_VEC node.
614 Inheritance is represented by the binfo nodes allocated for a
615 given type. For example, given types C and D, such that D is
616 inherited by C, 3 binfo nodes will be allocated: one for describing
617 the binfo properties of C, similarly one for D, and one for
618 describing the binfo properties of D as a base type for C.
619 Thus, given a pointer to class C, one can get a pointer to the binfo
620 of D acting as a basetype for C by looking at C's binfo's basetypes. */
622 /* The actual data type node being inherited in this basetype. */
623 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
625 /* The offset where this basetype appears in its containing type.
626 BINFO_OFFSET slot holds the offset (in bytes)
627 from the base of the complete object to the base of the part of the
628 object that is allocated on behalf of this `type'.
629 This is always 0 except when there is multiple inheritance. */
631 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
632 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
633 #define BINFO_OFFSET_ZEROP(NODE) (BINFO_OFFSET (NODE) == integer_zero_node)
635 /* The virtual function table belonging to this basetype. Virtual
636 function tables provide a mechanism for run-time method dispatching.
637 The entries of a virtual function table are language-dependent. */
639 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
640 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
642 /* The virtual functions in the virtual function table. This is
643 a TREE_LIST that is used as an initial approximation for building
644 a virtual function table for this basetype. */
645 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
646 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
648 /* A vector of additional binfos for the types inherited by this basetype.
650 If this basetype describes type D as inherited in C,
651 and if the basetypes of D are E anf F,
652 then this vector contains binfos for inheritance of E and F by C.
654 ??? This could probably be done by just allocating the
655 base types at the end of this TREE_VEC (instead of using
656 another TREE_VEC). This would simplify the calculation
657 of how many basetypes a given type had. */
658 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
659 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
661 /* For a BINFO record describing an inheritance, this yields a pointer
662 to the artificial FIELD_DECL node which contains the "virtual base
663 class pointer" for the given inheritance. */
665 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
667 /* Accessor macro to get to the Nth basetype of this basetype. */
668 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
669 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
671 /* Slot used to build a chain that represents a use of inheritance.
672 For example, if X is derived from Y, and Y is derived from Z,
673 then this field can be used to link the binfo node for X to
674 the binfo node for X's Y to represent the use of inheritance
675 from X to Y. Similarly, this slot of the binfo node for X's Y
676 can point to the Z from which Y is inherited (in X's inheritance
677 hierarchy). In this fashion, one can represent and traverse specific
678 uses of inheritance using the binfo nodes themselves (instead of
679 consing new space pointing to binfo nodes).
680 It is up to the language-dependent front-ends to maintain
681 this information as necessary. */
682 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
684 /* Define fields and accessors for nodes representing declared names. */
686 /* This is the name of the object as written by the user.
687 It is an IDENTIFIER_NODE. */
688 #define DECL_NAME(NODE) ((NODE)->decl.name)
689 /* This macro is marked for death. */
690 #define DECL_PRINT_NAME(NODE) ((NODE)->decl.print_name)
691 /* This is the name of the object as the assembler will see it
692 (but before any translations made by ASM_OUTPUT_LABELREF).
693 Often this is the same as DECL_NAME.
694 It is an IDENTIFIER_NODE. */
695 #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name)
696 /* For FIELD_DECLs, this is the
697 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
698 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
699 and CONST_DECL nodes, this points to the FUNCTION_DECL for the
700 containing function, or else yields NULL_TREE if the given decl has "file scope". */
701 #define DECL_CONTEXT(NODE) ((NODE)->decl.context)
702 #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context)
703 /* In a FIELD_DECL, this is the field position, counting in bits,
704 of the bit closest to the beginning of the structure. */
705 #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments)
706 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
707 if so, the type that was originally specified for it.
708 TREE_TYPE may have been modified (in finish_struct). */
709 #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result)
710 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
711 /* VAR_DECL and PARM_DECL reserve the arguments slot
712 for language-specific uses. */
713 #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments)
714 /* In FUNCTION_DECL, holds the decl for the return value. */
715 #define DECL_RESULT(NODE) ((NODE)->decl.result)
716 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
717 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result)
718 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
719 For a VAR_DECL, holds the initial value.
720 For a PARM_DECL, not used--default
721 values for parameters are encoded in the type of the function,
722 not in the PARM_DECL slot. */
723 #define DECL_INITIAL(NODE) ((NODE)->decl.initial)
724 /* For a PARM_DECL, records the data type used to pass the argument,
725 which may be different from the type seen in the program. */
726 #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */
727 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
728 if nonzero, indicates that the field occupies the type. */
729 #define DECL_QUALIFIER(NODE) ((NODE)->decl.initial)
730 /* These two fields describe where in the source code the declaration was. */
731 #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename)
732 #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum)
733 /* Holds the size of the datum, as a tree expression.
734 Need not be constant. */
735 #define DECL_SIZE(NODE) ((NODE)->decl.size)
736 /* Holds the alignment required for the datum. */
737 #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size)
738 /* Holds the machine mode corresponding to the declaration of a variable or
739 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
741 #define DECL_MODE(NODE) ((NODE)->decl.mode)
742 /* Holds the RTL expression for the value of a variable or function. If
743 PROMOTED_MODE is defined, the mode of this expression may not be same
744 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
745 to the variable's data type, while the mode
746 of DECL_RTL is the mode actually used to contain the data. */
747 #define DECL_RTL(NODE) ((NODE)->decl.rtl)
748 /* For PARM_DECL, holds an RTL for the stack slot or register
749 where the data was actually passed. */
750 #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r)
751 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
752 #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r)
753 /* For FUNCTION_DECL, if it is inline,
754 holds the size of the stack frame, as an integer. */
755 #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size)
756 /* For FUNCTION_DECL, if it is built-in,
757 this identifies which built-in operation it is. */
758 #define DECL_FUNCTION_CODE(NODE) \
759 ((enum built_in_function) (NODE)->decl.frame_size)
760 #define DECL_SET_FUNCTION_CODE(NODE,VAL) \
761 ((NODE)->decl.frame_size = (int) (VAL))
762 /* For a FIELD_DECL, holds the size of the member as an integer. */
763 #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i)
765 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
766 Before the struct containing the FUNCTION_DECL is laid out,
767 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
768 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
769 function. When the class is laid out, this pointer is changed
770 to an INTEGER_CST node which is suitable for use as an index
771 into the virtual function table. */
772 #define DECL_VINDEX(NODE) ((NODE)->decl.vindex)
773 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
774 which this FIELD_DECL is defined. This information is needed when
775 writing debugging information about vfield and vbase decls for C++. */
776 #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex)
778 /* Every ..._DECL node gets a unique number. */
779 #define DECL_UID(NODE) ((NODE)->decl.uid)
781 /* For any sort of a ..._DECL node, this points to the original (abstract)
782 decl node which this decl is an instance of, or else it is NULL indicating
783 that this decl is not an instance of some other decl. */
784 #define DECL_ABSTRACT_ORIGIN(NODE) ((NODE)->decl.abstract_origin)
786 /* Nonzero for any sort of ..._DECL node means this decl node represents
787 an inline instance of some original (abstract) decl from an inline function;
788 suppress any warnings about shadowing some other variable. */
789 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
791 /* Nonzero if a _DECL means that the name of this decl should be ignored
792 for symbolic debug purposes. */
793 #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag)
795 /* Nonzero for a given ..._DECL node means that this node represents an
796 "abstract instance" of the given declaration (e.g. in the original
797 declaration of an inline function). When generating symbolic debugging
798 information, we musn't try to generate any address information for nodes
799 marked as "abstract instances" because we don't actually generate
800 any code or allocate any data space for such instances. */
801 #define DECL_ABSTRACT(NODE) ((NODE)->decl.abstract_flag)
803 /* Nonzero if a _DECL means that no warnings should be generated just
804 because this decl is unused. */
805 #define DECL_IN_SYSTEM_HEADER(NODE) ((NODE)->decl.in_system_header_flag)
807 /* Language-specific decl information. */
808 #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific)
810 /* In a VAR_DECL or FUNCTION_DECL,
811 nonzero means external reference:
812 do not allocate storage, and refer to a definition elsewhere. */
813 #define DECL_EXTERNAL(NODE) ((NODE)->decl.external_flag)
815 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'.
816 In LABEL_DECL nodes, nonzero means that an error message about
817 jumping into such a binding contour has been printed for this label. */
818 #define DECL_REGISTER(NODE) ((NODE)->decl.regdecl_flag)
819 /* In a FIELD_DECL, indicates this field should be bit-packed. */
820 #define DECL_PACKED(NODE) ((NODE)->decl.regdecl_flag)
822 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
823 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
825 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
827 Also set in some languages for variables, etc., outside the normal
828 lexical scope, such as class instance variables. */
829 #define DECL_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag)
831 /* Nonzero in a FUNCTION_DECL means this function can be substituted
832 where it is called. */
833 #define DECL_INLINE(NODE) ((NODE)->decl.inline_flag)
835 /* Nonzero in a FUNCTION_DECL means this is a built-in function
836 that is not specified by ansi C and that users are supposed to be allowed
837 to redefine for any purpose whatever. */
838 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
840 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
842 #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag)
843 /* In a LABEL_DECL, nonzero means label was defined inside a binding
844 contour that restored a stack level and which is now exited. */
845 #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag)
846 /* In a FUNCTION_DECL, nonzero means a built in function. */
847 #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag)
849 /* Used in VAR_DECLs to indicate that the variable is a vtable.
850 It is also used in FIELD_DECLs for vtable pointers. */
851 #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag)
853 /* Additional flags for language-specific uses. */
854 #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0)
855 #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1)
856 #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2)
857 #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3)
858 #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4)
859 #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5)
860 #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6)
861 #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7)
865 char common
[sizeof (struct tree_common
)];
868 union tree_node
*size
;
870 #ifdef ONLY_INT_FIELDS
873 enum machine_mode mode
: 8;
876 unsigned external_flag
: 1;
877 unsigned nonlocal_flag
: 1;
878 unsigned regdecl_flag
: 1;
879 unsigned inline_flag
: 1;
880 unsigned bit_field_flag
: 1;
881 unsigned virtual_flag
: 1;
882 unsigned ignored_flag
: 1;
883 unsigned abstract_flag
: 1;
885 unsigned in_system_header_flag
: 1;
886 /* room for seven more */
888 unsigned lang_flag_0
: 1;
889 unsigned lang_flag_1
: 1;
890 unsigned lang_flag_2
: 1;
891 unsigned lang_flag_3
: 1;
892 unsigned lang_flag_4
: 1;
893 unsigned lang_flag_5
: 1;
894 unsigned lang_flag_6
: 1;
895 unsigned lang_flag_7
: 1;
897 union tree_node
*name
;
898 union tree_node
*context
;
899 union tree_node
*arguments
;
900 union tree_node
*result
;
901 union tree_node
*initial
;
902 union tree_node
*abstract_origin
;
903 /* The PRINT_NAME field is marked for death. */
905 union tree_node
*assembler_name
;
906 struct rtx_def
*rtl
; /* acts as link to register transfer language
908 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
909 If built-in, this is the code for which built-in function.
910 For other kinds of decls, this is DECL_ALIGN. */
912 /* For FUNCTION_DECLs: points to insn that constitutes its definition
913 on the permanent obstack. For any other kind of decl, this is the
919 union tree_node
*vindex
;
920 /* Points to a structure whose details depend on the language in use. */
921 struct lang_decl
*lang_specific
;
924 /* Define the overall contents of a tree node.
925 It may be any of the structures declared above
926 for various types of node. */
930 struct tree_common common
;
931 struct tree_int_cst int_cst
;
932 struct tree_real_cst real_cst
;
933 struct tree_string string
;
934 struct tree_complex
complex;
935 struct tree_identifier identifier
;
936 struct tree_decl decl
;
937 struct tree_type type
;
938 struct tree_list list
;
941 struct tree_block block
;
944 /* Add prototype support. */
946 #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
947 #define PROTO(ARGS) ARGS
949 #define PROTO(ARGS) ()
954 #define NULL_TREE (tree) NULL
956 /* Define a generic NULL if one hasn't already been defined. */
963 #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
964 #define GENERIC_PTR void *
966 #define GENERIC_PTR char *
971 #define NULL_PTR ((GENERIC_PTR)0)
974 /* Format for global names of constructor and destructor functions. */
975 #ifndef CONSTRUCTOR_NAME_FORMAT /* Some machines need to override this. */
976 #ifndef NO_DOLLAR_IN_LABEL
977 #define CONSTRUCTOR_NAME_FORMAT "_GLOBAL_$I$%s"
979 #ifdef NO_DOT_IN_LABEL
980 #define CONSTRUCTOR_NAME_FORMAT "____GLOBAL__I_%s"
982 #define CONSTRUCTOR_NAME_FORMAT "_GLOBAL_.I.%s"
987 /* The following functions accept a wide integer argument. Rather than
988 having to cast on every function call, we use a macro instead, that is
989 defined here and in rtl.h. */
992 #define exact_log2(N) exact_log2_wide ((HOST_WIDE_INT) (N))
993 #define floor_log2(N) floor_log2_wide ((HOST_WIDE_INT) (N))
997 /* At present, don't prototype xrealloc, since all of the callers don't
998 cast their pointers to char *, and all of the xrealloc's don't use
1000 extern char *xrealloc
PROTO((void *, unsigned));
1002 extern char *xrealloc ();
1005 extern char *oballoc
PROTO((int));
1006 extern char *permalloc
PROTO((int));
1007 extern char *savealloc
PROTO((int));
1008 extern char *xmalloc
PROTO((unsigned));
1009 extern void free
PROTO((void *));
1011 /* Lowest level primitive for allocating a node.
1012 The TREE_CODE is the only argument. Contents are initialized
1013 to zero except for a few of the common fields. */
1015 extern tree make_node
PROTO((enum tree_code
));
1017 /* Make a copy of a node, with all the same contents except
1018 for TREE_PERMANENT. (The copy is permanent
1019 iff nodes being made now are permanent.) */
1021 extern tree copy_node
PROTO((tree
));
1023 /* Make a copy of a chain of TREE_LIST nodes. */
1025 extern tree copy_list
PROTO((tree
));
1027 /* Make a TREE_VEC. */
1029 extern tree make_tree_vec
PROTO((int));
1031 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1032 The name is supplied as a char *. */
1034 extern tree get_identifier
PROTO((char *));
1036 /* Construct various types of nodes. */
1038 #define build_int_2(LO,HI) \
1039 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1042 /* We cannot define prototypes for the variable argument functions,
1043 since they have not been ANSI-fied, and an ANSI compiler would
1044 complain when compiling the definition of these functions. */
1046 extern tree build
PROTO((enum tree_code
, tree
, ...));
1047 extern tree build_nt
PROTO((enum tree_code
, ...));
1048 extern tree build_parse_node
PROTO((enum tree_code
, ...));
1050 extern tree
build ();
1051 extern tree
build_nt ();
1052 extern tree
build_parse_node ();
1055 extern tree build_int_2_wide
PROTO((HOST_WIDE_INT
, HOST_WIDE_INT
));
1056 extern tree build_real
PROTO((tree
, REAL_VALUE_TYPE
));
1057 extern tree build_real_from_int_cst
PROTO((tree
, tree
));
1058 extern tree build_complex
PROTO((tree
, tree
));
1059 extern tree build_string
PROTO((int, char *));
1060 extern tree build1
PROTO((enum tree_code
, tree
, tree
));
1061 extern tree build_tree_list
PROTO((tree
, tree
));
1062 extern tree build_decl_list
PROTO((tree
, tree
));
1063 extern tree build_decl
PROTO((enum tree_code
, tree
, tree
));
1064 extern tree build_block
PROTO((tree
, tree
, tree
, tree
, tree
));
1066 /* Construct various nodes representing data types. */
1068 extern tree make_signed_type
PROTO((int));
1069 extern tree make_unsigned_type
PROTO((int));
1070 extern tree signed_or_unsigned_type
PROTO((int, tree
));
1071 extern void fixup_unsigned_type
PROTO((tree
));
1072 extern tree build_pointer_type
PROTO((tree
));
1073 extern tree build_reference_type
PROTO((tree
));
1074 extern tree build_index_type
PROTO((tree
));
1075 extern tree build_index_2_type
PROTO((tree
, tree
));
1076 extern tree build_array_type
PROTO((tree
, tree
));
1077 extern tree build_function_type
PROTO((tree
, tree
));
1078 extern tree build_method_type
PROTO((tree
, tree
));
1079 extern tree build_offset_type
PROTO((tree
, tree
));
1080 extern tree build_complex_type
PROTO((tree
));
1081 extern tree array_type_nelts
PROTO((tree
));
1083 extern tree value_member
PROTO((tree
, tree
));
1084 extern tree purpose_member
PROTO((tree
, tree
));
1085 extern tree binfo_member
PROTO((tree
, tree
));
1086 extern int tree_int_cst_equal
PROTO((tree
, tree
));
1087 extern int tree_int_cst_lt
PROTO((tree
, tree
));
1088 extern int index_type_equal
PROTO((tree
, tree
));
1090 /* Construct expressions, performing type checking.
1091 GCC and G++ use different calling sequences for build_binary_op,
1092 and build_indirect_ref, so don't include a prototype here. */
1094 extern tree
build_binary_op ();
1095 extern tree
build_indirect_ref ();
1096 extern tree build_unary_op
PROTO((enum tree_code
, tree
, int));
1098 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1099 put the prototype here. Rtl.h does declare the prototype if
1100 tree.h had been included. */
1102 extern tree
make_tree ();
1104 /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
1105 for the same kind of data as TYPE describes.
1106 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
1107 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
1108 so that duplicate variants are never made.
1109 Only main variants should ever appear as types of expressions. */
1111 extern tree build_type_variant
PROTO((tree
, int, int));
1113 /* Make a copy of a type node. */
1115 extern tree build_type_copy
PROTO((tree
));
1117 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1118 TYPE_ALIGN and TYPE_MODE fields.
1119 If called more than once on one node, does nothing except
1120 for the first time. */
1122 extern void layout_type
PROTO((tree
));
1124 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1125 return a canonicalized ..._TYPE node, so that duplicates are not made.
1126 How the hash code is computed is up to the caller, as long as any two
1127 callers that could hash identical-looking type nodes agree. */
1129 extern tree type_hash_canon
PROTO((int, tree
));
1131 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1132 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1133 fields. Call this only once for any given decl node.
1135 Second argument is the boundary that this field can be assumed to
1136 be starting at (in bits). Zero means it can be assumed aligned
1137 on any boundary that may be needed. */
1139 extern void layout_decl
PROTO((tree
, unsigned));
1141 /* Fold constants as much as possible in an expression.
1142 Returns the simplified expression.
1143 Acts only on the top level of the expression;
1144 if the argument itself cannot be simplified, its
1145 subexpressions are not changed. */
1147 extern tree fold
PROTO((tree
));
1149 /* Return an expr equal to X but certainly not valid as an lvalue. */
1151 extern tree non_lvalue
PROTO((tree
));
1153 extern tree convert
PROTO((tree
, tree
));
1154 extern tree size_in_bytes
PROTO((tree
));
1155 extern int int_size_in_bytes
PROTO((tree
));
1156 extern tree size_binop
PROTO((enum tree_code
, tree
, tree
));
1157 extern tree size_int
PROTO((unsigned));
1158 extern tree round_up
PROTO((tree
, int));
1159 extern tree get_pending_sizes
PROTO((void));
1161 /* Type for sizes of data-type. */
1163 extern tree sizetype
;
1165 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1166 by making the last node in X point to Y.
1167 Returns X, except if X is 0 returns Y. */
1169 extern tree chainon
PROTO((tree
, tree
));
1171 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1173 extern tree tree_cons
PROTO((tree
, tree
, tree
));
1174 extern tree perm_tree_cons
PROTO((tree
, tree
, tree
));
1175 extern tree temp_tree_cons
PROTO((tree
, tree
, tree
));
1176 extern tree saveable_tree_cons
PROTO((tree
, tree
, tree
));
1177 extern tree decl_tree_cons
PROTO((tree
, tree
, tree
));
1179 /* Return the last tree node in a chain. */
1181 extern tree tree_last
PROTO((tree
));
1183 /* Reverse the order of elements in a chain, and return the new head. */
1185 extern tree nreverse
PROTO((tree
));
1187 /* Returns the length of a chain of nodes
1188 (number of chain pointers to follow before reaching a null pointer). */
1190 extern int list_length
PROTO((tree
));
1192 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1194 extern int integer_zerop
PROTO((tree
));
1196 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1198 extern int integer_onep
PROTO((tree
));
1200 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1201 all of whose significant bits are 1. */
1203 extern int integer_all_onesp
PROTO((tree
));
1205 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1206 exactly one bit 1. */
1208 extern int integer_pow2p
PROTO((tree
));
1210 /* staticp (tree x) is nonzero if X is a reference to data allocated
1211 at a fixed address in memory. */
1213 extern int staticp
PROTO((tree
));
1215 /* Gets an error if argument X is not an lvalue.
1216 Also returns 1 if X is an lvalue, 0 if not. */
1218 extern int lvalue_or_else
PROTO((tree
, char *));
1220 /* save_expr (EXP) returns an expression equivalent to EXP
1221 but it can be used multiple times within context CTX
1222 and only evaluate EXP once. */
1224 extern tree save_expr
PROTO((tree
));
1226 /* variable_size (EXP) is like save_expr (EXP) except that it
1227 is for the special case of something that is part of a
1228 variable size for a data type. It makes special arrangements
1229 to compute the value at the right time when the data type
1230 belongs to a function parameter. */
1232 extern tree variable_size
PROTO((tree
));
1234 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1235 but it can be used multiple times
1236 and only evaluate the subexpressions once. */
1238 extern tree stabilize_reference
PROTO((tree
));
1240 /* Return EXP, stripped of any conversions to wider types
1241 in such a way that the result of converting to type FOR_TYPE
1242 is the same as if EXP were converted to FOR_TYPE.
1243 If FOR_TYPE is 0, it signifies EXP's type. */
1245 extern tree get_unwidened
PROTO((tree
, tree
));
1247 /* Return OP or a simpler expression for a narrower value
1248 which can be sign-extended or zero-extended to give back OP.
1249 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1250 or 0 if the value should be sign-extended. */
1252 extern tree get_narrower
PROTO((tree
, int *));
1254 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1256 The definition of this resides in language-specific code
1257 as the repertoire of available types may vary. */
1259 extern tree type_for_mode
PROTO((enum machine_mode
, int));
1261 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1262 for an integer type with at least that precision.
1263 The definition of this resides in language-specific code
1264 as the repertoire of available types may vary. */
1266 extern tree type_for_size
PROTO((unsigned, int));
1268 /* Given an integer type T, return a type like T but unsigned.
1269 If T is unsigned, the value is T.
1270 The definition of this resides in language-specific code
1271 as the repertoire of available types may vary. */
1273 extern tree unsigned_type
PROTO((tree
));
1275 /* Given an integer type T, return a type like T but signed.
1276 If T is signed, the value is T.
1277 The definition of this resides in language-specific code
1278 as the repertoire of available types may vary. */
1280 extern tree signed_type
PROTO((tree
));
1282 /* This function must be defined in the language-specific files.
1283 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1284 This is defined in a language-specific file. */
1286 extern tree maybe_build_cleanup
PROTO((tree
));
1288 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1289 look for nested component-refs or array-refs at constant positions
1290 and find the ultimate containing object, which is returned. */
1292 extern tree get_inner_reference
PROTO((tree
, int *, int *, tree
*, enum machine_mode
*, int *, int *));
1294 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1296 extern tree decl_function_context
PROTO((tree
));
1298 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1299 this _DECL with its context, or zero if none. */
1300 extern tree decl_type_context
PROTO((tree
));
1302 /* Given the FUNCTION_DECL for the current function,
1303 return zero if it is ok for this function to be inline.
1304 Otherwise return a warning message with a single %s
1305 for the function's name. */
1307 extern char *function_cannot_inline_p
PROTO((tree
));
1309 /* Return 1 if EXPR is the real constant zero. */
1310 extern int real_zerop
PROTO((tree
));
1312 /* Declare commonly used variables for tree structure. */
1314 /* An integer constant with value 0 */
1315 extern tree integer_zero_node
;
1317 /* An integer constant with value 1 */
1318 extern tree integer_one_node
;
1320 /* An integer constant with value 0 whose type is sizetype. */
1321 extern tree size_zero_node
;
1323 /* An integer constant with value 1 whose type is sizetype. */
1324 extern tree size_one_node
;
1326 /* A constant of type pointer-to-int and value 0 */
1327 extern tree null_pointer_node
;
1329 /* A node of type ERROR_MARK. */
1330 extern tree error_mark_node
;
1332 /* The type node for the void type. */
1333 extern tree void_type_node
;
1335 /* The type node for the ordinary (signed) integer type. */
1336 extern tree integer_type_node
;
1338 /* The type node for the unsigned integer type. */
1339 extern tree unsigned_type_node
;
1341 /* The type node for the ordinary character type. */
1342 extern tree char_type_node
;
1344 /* Points to the name of the input file from which the current input
1345 being parsed originally came (before it went into cpp). */
1346 extern char *input_filename
;
1348 /* Current line number in input file. */
1351 /* Nonzero for -pedantic switch: warn about anything
1352 that standard C forbids. */
1353 extern int pedantic
;
1355 /* Nonzero means can safely call expand_expr now;
1356 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1358 extern int immediate_size_expand
;
1360 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1362 extern tree current_function_decl
;
1364 /* Nonzero if function being compiled can call setjmp. */
1366 extern int current_function_calls_setjmp
;
1368 /* Nonzero if function being compiled can call longjmp. */
1370 extern int current_function_calls_longjmp
;
1372 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1374 extern int all_types_permanent
;
1376 /* Pointer to function to compute the name to use to print a declaration. */
1378 extern char *(*decl_printable_name
) ();
1380 /* Pointer to function to finish handling an incomplete decl at the
1381 end of compilation. */
1383 extern void (*incomplete_decl_finalize_hook
) ();
1386 extern char *perm_calloc
PROTO((int, long));
1390 extern tree expand_start_stmt_expr
PROTO((void));
1391 extern tree expand_end_stmt_expr
PROTO((tree
));
1392 extern void expand_expr_stmt
PROTO((tree
));
1393 extern void expand_decl_init
PROTO((tree
));
1394 extern void clear_last_expr
PROTO((void));
1395 extern void expand_label
PROTO((tree
));
1396 extern void expand_goto
PROTO((tree
));
1397 extern void expand_asm
PROTO((tree
));
1398 extern void expand_start_cond
PROTO((tree
, int));
1399 extern void expand_end_cond
PROTO((void));
1400 extern void expand_start_else
PROTO((void));
1401 extern void expand_start_elseif
PROTO((tree
));
1402 extern struct nesting
*expand_start_loop
PROTO((int));
1403 extern struct nesting
*expand_start_loop_continue_elsewhere
PROTO((int));
1404 extern void expand_loop_continue_here
PROTO((void));
1405 extern void expand_end_loop
PROTO((void));
1406 extern int expand_continue_loop
PROTO((struct nesting
*));
1407 extern int expand_exit_loop
PROTO((struct nesting
*));
1408 extern int expand_exit_loop_if_false
PROTO((struct nesting
*, tree
));
1409 extern int expand_exit_something
PROTO((void));
1411 extern void expand_null_return
PROTO((void));
1412 extern void expand_return
PROTO((tree
));
1413 extern void expand_start_bindings
PROTO((int));
1414 extern void expand_end_bindings
PROTO((tree
, int, int));
1415 extern tree last_cleanup_this_contour
PROTO((void));
1416 extern void expand_start_case
PROTO((int, tree
, tree
, char *));
1417 extern void expand_end_case
PROTO((tree
));
1418 extern int pushcase
PROTO((tree
, tree
, tree
*));
1419 extern int pushcase_range
PROTO((tree
, tree
, tree
, tree
*));
1421 /* In fold-const.c */
1423 extern tree invert_truthvalue
PROTO((tree
));
1425 /* The language front-end must define these functions. */
1427 /* Function of no arguments for initializing lexical scanning. */
1428 extern void init_lex
PROTO((void));
1429 /* Function of no arguments for initializing the symbol table. */
1430 extern void init_decl_processing
PROTO((void));
1432 /* Functions called with no arguments at the beginning and end or processing
1433 the input source file. */
1434 extern void lang_init
PROTO((void));
1435 extern void lang_finish
PROTO((void));
1437 /* Funtion to identify which front-end produced the output file. */
1438 extern char *lang_identify
PROTO((void));
1440 /* Function called with no arguments to parse and compile the input. */
1441 extern int yyparse
PROTO((void));
1442 /* Function called with option as argument
1443 to decode options starting with -f or -W or +.
1444 It should return nonzero if it handles the option. */
1445 extern int lang_decode_option
PROTO((char *));
1447 /* Functions for processing symbol declarations. */
1448 /* Function to enter a new lexical scope.
1449 Takes one argument: always zero when called from outside the front end. */
1450 extern void pushlevel
PROTO((int));
1451 /* Function to exit a lexical scope. It returns a BINDING for that scope.
1452 Takes three arguments:
1453 KEEP -- nonzero if there were declarations in this scope.
1454 REVERSE -- reverse the order of decls before returning them.
1455 FUNCTIONBODY -- nonzero if this level is the body of a function. */
1456 extern tree poplevel
PROTO((int, int, int));
1457 /* Set the BLOCK node for the current scope level. */
1458 extern void set_block
PROTO((tree
));
1459 /* Function to add a decl to the current scope level.
1460 Takes one argument, a decl to add.
1461 Returns that decl, or, if the same symbol is already declared, may
1462 return a different decl for that name. */
1463 extern tree pushdecl
PROTO((tree
));
1464 /* Function to return the chain of decls so far in the current scope level. */
1465 extern tree getdecls
PROTO((void));
1466 /* Function to return the chain of structure tags in the current scope level. */
1467 extern tree gettags
PROTO((void));
1469 extern tree build_range_type
PROTO((tree
, tree
, tree
));
1471 /* Call when starting to parse a declaration:
1472 make expressions in the declaration last the length of the function.
1473 Returns an argument that should be passed to resume_momentary later. */
1474 extern int suspend_momentary
PROTO((void));
1476 extern int allocation_temporary_p
PROTO((void));
1478 /* Call when finished parsing a declaration:
1479 restore the treatment of node-allocation that was
1480 in effect before the suspension.
1481 YES should be the value previously returned by suspend_momentary. */
1482 extern void resume_momentary
PROTO((int));
1484 /* Called after finishing a record, union or enumeral type. */
1485 extern void rest_of_type_compilation
PROTO((tree
, int));
1487 /* Save the current set of obstacks, but don't change them. */
1488 extern void push_obstacks_nochange
PROTO((void));
1490 extern void push_momentary
PROTO((void));
1492 extern void clear_momentary
PROTO((void));
1494 extern void pop_momentary
PROTO((void));
1496 extern void end_temporary_allocation
PROTO((void));
1498 /* Pop the obstack selection stack. */
1499 extern void pop_obstacks
PROTO((void));