1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993 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 /* Nonzero if TYPE represents an integral type. Note that we do not
210 include COMPLEX types here. */
212 #define INTEGRAL_TYPE_P(TYPE) \
213 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
214 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
216 /* Nonzero if TYPE represents a floating-point type, including complex
217 floating-point types. */
219 #define FLOAT_TYPE_P(TYPE) \
220 (TREE_CODE (TYPE) == REAL_TYPE \
221 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
222 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
224 /* Define many boolean fields that all tree nodes have. */
226 /* In VAR_DECL nodes, nonzero means address of this is needed.
227 So it cannot be in a register.
228 In a FUNCTION_DECL, nonzero means its address is needed.
229 So it must be compiled even if it is an inline function.
230 In CONSTRUCTOR nodes, it means object constructed must be in memory.
231 In LABEL_DECL nodes, it means a goto for this label has been seen
232 from a place outside all binding contours that restore stack levels.
233 In ..._TYPE nodes, it means that objects of this type must
234 be fully addressable. This means that pieces of this
235 object cannot go into register parameters, for example.
236 In IDENTIFIER_NODEs, this means that some extern decl for this name
237 had its address taken. That matters for inline functions. */
238 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
240 /* In a VAR_DECL, nonzero means allocate static storage.
241 In a FUNCTION_DECL, nonzero if function has been defined.
242 In a CONSTRUCTOR, nonzero means allocate static storage. */
243 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
245 /* In a CONVERT_EXPR or NOP_EXPR, this means the node was made
246 implicitly and should not lead to an "unused value" warning. */
247 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
249 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
250 chain is via a `virtual' declaration. */
251 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
253 /* In an INTEGER_CST, this means there was an overflow in folding.
254 This is distinct from TREE_OVERFLOW because ANSI C requires a diagnostic
255 when overflows occur in constant expressions. */
256 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
258 /* In an INTEGER_CST, this means there was an overflow in folding,
259 and no warning has been issued for this subexpression.
260 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
261 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
263 /* In a VAR_DECL or FUNCTION_DECL,
264 nonzero means name is to be accessible from outside this module.
265 In an identifier node, nonzero means an external declaration
266 accessible from outside this module was previously seen
267 for this name in an inner scope. */
268 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
270 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
271 base class is via a `public' declaration, which preserves public
272 fields from the base class as public. */
273 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
275 /* Ditto, for `private' declarations. */
276 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
278 /* Nonzero for TREE_LIST node means that the path to the
279 base class is via a `protected' declaration, which preserves
280 protected fields from the base class as protected.
282 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
284 /* In any expression, nonzero means it has side effects or reevaluation
285 of the whole expression could produce a different value.
286 This is set if any subexpression is a function call, a side effect
287 or a reference to a volatile variable.
288 In a ..._DECL, this is set only if the declaration said `volatile'. */
289 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
291 /* Nonzero means this expression is volatile in the C sense:
292 its address should be of type `volatile WHATEVER *'.
293 In other words, the declared item is volatile qualified.
294 This is used in _DECL nodes and _REF nodes.
296 In a ..._TYPE node, means this type is volatile-qualified.
297 But use TYPE_VOLATILE instead of this macro when the node is a type,
298 because eventually we may make that a different bit.
300 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
301 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
303 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
304 nonzero means it may not be the lhs of an assignment.
305 In a ..._TYPE node, means this type is const-qualified
306 (but the macro TYPE_READONLY should be used instead of this macro
307 when the node is a type). */
308 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
310 /* Value of expression is constant.
311 Always appears in all ..._CST nodes.
312 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
313 if the value is constant. */
314 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
316 /* Nonzero means permanent node;
317 node will continue to exist for the entire compiler run.
318 Otherwise it will be recycled at the end of the function. */
319 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
321 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
322 In FIELD_DECL nodes, means an unsigned bit field.
323 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
324 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
326 /* Nonzero in a VAR_DECL means assembler code has been written.
327 Nonzero in a FUNCTION_DECL means that the function has been compiled.
328 This is interesting in an inline function, since it might not need
329 to be compiled separately.
330 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
331 if the sdb debugging info for the type has been written.
332 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
333 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
335 /* Nonzero in a _DECL if the name is used in its scope.
336 Nonzero in an expr node means inhibit warning if value is unused.
337 In IDENTIFIER_NODEs, this means that some extern decl for this name
339 #define TREE_USED(NODE) ((NODE)->common.used_flag)
341 /* Nonzero for a tree node whose evaluation could result
342 in the raising of an exception. Not implemented yet. */
343 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
345 /* Used in classes in C++. */
346 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
347 /* Used in classes in C++.
348 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
349 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
351 /* These flags are available for each language front end to use internally. */
352 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
353 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
354 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
355 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
356 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
357 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
358 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
360 /* Define additional fields and accessors for nodes representing constants. */
362 /* In an INTEGER_CST node. These two together make a 2-word integer.
363 If the data type is signed, the value is sign-extended to 2 words
364 even though not all of them may really be in use.
365 In an unsigned constant shorter than 2 words, the extra bits are 0. */
366 #define TREE_INT_CST_LOW(NODE) ((NODE)->int_cst.int_cst_low)
367 #define TREE_INT_CST_HIGH(NODE) ((NODE)->int_cst.int_cst_high)
369 #define INT_CST_LT(A, B) \
370 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
371 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
372 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
373 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
375 #define INT_CST_LT_UNSIGNED(A, B) \
376 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
377 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
378 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
379 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
380 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
381 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
385 char common[sizeof (struct tree_common)];
386 HOST_WIDE_INT int_cst_low;
387 HOST_WIDE_INT int_cst_high;
390 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
391 and generally in all kinds of constants that could
392 be given labels (rather than being immediate). */
394 #define TREE_CST_RTL(NODE) ((NODE)->real_cst.rtl)
396 /* In a REAL_CST node. */
397 /* We can represent a real value as either a `double' or a string.
398 Strings don't allow for any optimization, but they do allow
399 for cross-compilation. */
401 #define TREE_REAL_CST(NODE) ((NODE)->real_cst.real_cst)
407 char common[sizeof (struct tree_common)];
408 struct rtx_def *rtl; /* acts as link to register transfer language
410 REAL_VALUE_TYPE real_cst;
413 /* In a STRING_CST */
414 #define TREE_STRING_LENGTH(NODE) ((NODE)->string.length)
415 #define TREE_STRING_POINTER(NODE) ((NODE)->string.pointer)
419 char common[sizeof (struct tree_common)];
420 struct rtx_def *rtl; /* acts as link to register transfer language
426 /* In a COMPLEX_CST node. */
427 #define TREE_REALPART(NODE) ((NODE)->complex.real)
428 #define TREE_IMAGPART(NODE) ((NODE)->complex.imag)
432 char common[sizeof (struct tree_common)];
433 struct rtx_def *rtl; /* acts as link to register transfer language
435 union tree_node *real;
436 union tree_node *imag;
439 /* Define fields and accessors for some special-purpose tree nodes. */
441 #define IDENTIFIER_LENGTH(NODE) ((NODE)->identifier.length)
442 #define IDENTIFIER_POINTER(NODE) ((NODE)->identifier.pointer)
444 struct tree_identifier
446 char common[sizeof (struct tree_common)];
451 /* In a TREE_LIST node. */
452 #define TREE_PURPOSE(NODE) ((NODE)->list.purpose)
453 #define TREE_VALUE(NODE) ((NODE)->list.value)
457 char common[sizeof (struct tree_common)];
458 union tree_node *purpose;
459 union tree_node *value;
462 /* In a TREE_VEC node. */
463 #define TREE_VEC_LENGTH(NODE) ((NODE)->vec.length)
464 #define TREE_VEC_ELT(NODE,I) ((NODE)->vec.a[I])
465 #define TREE_VEC_END(NODE) (&((NODE)->vec.a[(NODE)->vec.length]))
469 char common[sizeof (struct tree_common)];
471 union tree_node *a[1];
474 /* Define fields and accessors for some nodes that represent expressions. */
476 /* In a SAVE_EXPR node. */
477 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
478 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
480 /* In a RTL_EXPR node. */
481 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[0])
482 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[1])
484 /* In a CALL_EXPR node. */
485 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
487 /* In a CONSTRUCTOR node. */
488 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
490 /* In ordinary expression nodes. */
491 #define TREE_OPERAND(NODE, I) ((NODE)->exp.operands[I])
492 #define TREE_COMPLEXITY(NODE) ((NODE)->exp.complexity)
496 char common[sizeof (struct tree_common)];
498 union tree_node *operands[1];
501 /* In a BLOCK node. */
502 #define BLOCK_VARS(NODE) ((NODE)->block.vars)
503 #define BLOCK_TYPE_TAGS(NODE) ((NODE)->block.type_tags)
504 #define BLOCK_SUBBLOCKS(NODE) ((NODE)->block.subblocks)
505 #define BLOCK_SUPERCONTEXT(NODE) ((NODE)->block.supercontext)
506 /* Note: when changing this, make sure to find the places
507 that use chainon or nreverse. */
508 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
509 #define BLOCK_ABSTRACT_ORIGIN(NODE) ((NODE)->block.abstract_origin)
510 #define BLOCK_ABSTRACT(NODE) ((NODE)->block.abstract_flag)
511 #define BLOCK_END_NOTE(NODE) ((NODE)->block.end_note)
513 /* Nonzero means that this block is prepared to handle exceptions
514 listed in the BLOCK_VARS slot. */
515 #define BLOCK_HANDLER_BLOCK(NODE) ((NODE)->block.handler_block_flag)
519 char common[sizeof (struct tree_common)];
521 unsigned handler_block_flag : 1;
522 unsigned abstract_flag : 1;
524 union tree_node *vars;
525 union tree_node *type_tags;
526 union tree_node *subblocks;
527 union tree_node *supercontext;
528 union tree_node *abstract_origin;
529 struct rtx_def *end_note;
532 /* Define fields and accessors for nodes representing data types. */
534 /* See tree.def for documentation of the use of these fields.
535 Look at the documentation of the various ..._TYPE tree codes. */
537 #define TYPE_UID(NODE) ((NODE)->type.uid)
538 #define TYPE_SIZE(NODE) ((NODE)->type.size)
539 #define TYPE_MODE(NODE) ((NODE)->type.mode)
540 #define TYPE_VALUES(NODE) ((NODE)->type.values)
541 #define TYPE_DOMAIN(NODE) ((NODE)->type.values)
542 #define TYPE_FIELDS(NODE) ((NODE)->type.values)
543 #define TYPE_METHODS(NODE) ((NODE)->type.maxval)
544 #define TYPE_VFIELD(NODE) ((NODE)->type.minval)
545 #define TYPE_ARG_TYPES(NODE) ((NODE)->type.values)
546 #define TYPE_METHOD_BASETYPE(NODE) ((NODE)->type.maxval)
547 #define TYPE_OFFSET_BASETYPE(NODE) ((NODE)->type.maxval)
548 #define TYPE_POINTER_TO(NODE) ((NODE)->type.pointer_to)
549 #define TYPE_REFERENCE_TO(NODE) ((NODE)->type.reference_to)
550 #define TYPE_MIN_VALUE(NODE) ((NODE)->type.minval)
551 #define TYPE_MAX_VALUE(NODE) ((NODE)->type.maxval)
552 #define TYPE_PRECISION(NODE) ((NODE)->type.precision)
553 #define TYPE_PARSE_INFO(NODE) ((NODE)->type.parse_info)
554 #define TYPE_SYMTAB_ADDRESS(NODE) ((NODE)->type.symtab.address)
555 #define TYPE_SYMTAB_POINTER(NODE) ((NODE)->type.symtab.pointer)
556 #define TYPE_NAME(NODE) ((NODE)->type.name)
557 #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant)
558 #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant)
559 #define TYPE_BINFO(NODE) ((NODE)->type.binfo)
560 #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts)
561 #define TYPE_CONTEXT(NODE) ((NODE)->type.context)
562 #define TYPE_OBSTACK(NODE) ((NODE)->type.obstack)
563 #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific)
565 /* The alignment necessary for objects of this type.
566 The value is an int, measured in bits. */
567 #define TYPE_ALIGN(NODE) ((NODE)->type.align)
569 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
571 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
572 has BLKmode only because it lacks the alignment requirement for
574 #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag)
576 /* Nonzero in a type considered volatile as a whole. */
577 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
579 /* Means this type is const-qualified. */
580 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
582 /* These flags are available for each language front end to use internally. */
583 #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0)
584 #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1)
585 #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2)
586 #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3)
587 #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4)
588 #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5)
589 #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6)
593 char common[sizeof (struct tree_common)];
594 union tree_node *values;
595 union tree_node *size;
598 #ifdef ONLY_INT_FIELDS
601 enum machine_mode mode : 8;
603 unsigned char precision;
605 unsigned no_force_blk_flag : 1;
606 unsigned lang_flag_0 : 1;
607 unsigned lang_flag_1 : 1;
608 unsigned lang_flag_2 : 1;
609 unsigned lang_flag_3 : 1;
610 unsigned lang_flag_4 : 1;
611 unsigned lang_flag_5 : 1;
612 unsigned lang_flag_6 : 1;
615 union tree_node *pointer_to;
616 union tree_node *reference_to;
618 union {int address; char *pointer; } symtab;
619 union tree_node *name;
620 union tree_node *minval;
621 union tree_node *maxval;
622 union tree_node *next_variant;
623 union tree_node *main_variant;
624 union tree_node *binfo;
625 union tree_node *noncopied_parts;
626 union tree_node *context;
627 struct obstack *obstack;
628 /* Points to a structure whose details depend on the language in use. */
629 struct lang_type *lang_specific;
632 /* Define accessor macros for information about type inheritance
635 A "basetype" means a particular usage of a data type for inheritance
636 in another type. Each such basetype usage has its own "binfo"
637 object to describe it. The binfo object is a TREE_VEC node.
639 Inheritance is represented by the binfo nodes allocated for a
640 given type. For example, given types C and D, such that D is
641 inherited by C, 3 binfo nodes will be allocated: one for describing
642 the binfo properties of C, similarly one for D, and one for
643 describing the binfo properties of D as a base type for C.
644 Thus, given a pointer to class C, one can get a pointer to the binfo
645 of D acting as a basetype for C by looking at C's binfo's basetypes. */
647 /* The actual data type node being inherited in this basetype. */
648 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
650 /* The offset where this basetype appears in its containing type.
651 BINFO_OFFSET slot holds the offset (in bytes)
652 from the base of the complete object to the base of the part of the
653 object that is allocated on behalf of this `type'.
654 This is always 0 except when there is multiple inheritance. */
656 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
657 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
658 #define BINFO_OFFSET_ZEROP(NODE) (BINFO_OFFSET (NODE) == integer_zero_node)
660 /* The virtual function table belonging to this basetype. Virtual
661 function tables provide a mechanism for run-time method dispatching.
662 The entries of a virtual function table are language-dependent. */
664 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
665 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
667 /* The virtual functions in the virtual function table. This is
668 a TREE_LIST that is used as an initial approximation for building
669 a virtual function table for this basetype. */
670 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
671 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
673 /* A vector of additional binfos for the types inherited by this basetype.
675 If this basetype describes type D as inherited in C,
676 and if the basetypes of D are E anf F,
677 then this vector contains binfos for inheritance of E and F by C.
679 ??? This could probably be done by just allocating the
680 base types at the end of this TREE_VEC (instead of using
681 another TREE_VEC). This would simplify the calculation
682 of how many basetypes a given type had. */
683 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
684 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
686 /* For a BINFO record describing an inheritance, this yields a pointer
687 to the artificial FIELD_DECL node which contains the "virtual base
688 class pointer" for the given inheritance. */
690 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
692 /* Accessor macro to get to the Nth basetype of this basetype. */
693 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
694 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
696 /* Slot used to build a chain that represents a use of inheritance.
697 For example, if X is derived from Y, and Y is derived from Z,
698 then this field can be used to link the binfo node for X to
699 the binfo node for X's Y to represent the use of inheritance
700 from X to Y. Similarly, this slot of the binfo node for X's Y
701 can point to the Z from which Y is inherited (in X's inheritance
702 hierarchy). In this fashion, one can represent and traverse specific
703 uses of inheritance using the binfo nodes themselves (instead of
704 consing new space pointing to binfo nodes).
705 It is up to the language-dependent front-ends to maintain
706 this information as necessary. */
707 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
709 /* Define fields and accessors for nodes representing declared names. */
711 /* This is the name of the object as written by the user.
712 It is an IDENTIFIER_NODE. */
713 #define DECL_NAME(NODE) ((NODE)->decl.name)
714 /* This macro is marked for death. */
715 #define DECL_PRINT_NAME(NODE) ((NODE)->decl.print_name)
716 /* This is the name of the object as the assembler will see it
717 (but before any translations made by ASM_OUTPUT_LABELREF).
718 Often this is the same as DECL_NAME.
719 It is an IDENTIFIER_NODE. */
720 #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name)
721 /* For FIELD_DECLs, this is the
722 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
723 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
724 and CONST_DECL nodes, this points to the FUNCTION_DECL for the
725 containing function, or else yields NULL_TREE if the given decl has "file scope". */
726 #define DECL_CONTEXT(NODE) ((NODE)->decl.context)
727 #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context)
728 /* In a FIELD_DECL, this is the field position, counting in bits,
729 of the bit closest to the beginning of the structure. */
730 #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments)
731 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
732 if so, the type that was originally specified for it.
733 TREE_TYPE may have been modified (in finish_struct). */
734 #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result)
735 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
736 /* VAR_DECL and PARM_DECL reserve the arguments slot
737 for language-specific uses. */
738 #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments)
739 /* In FUNCTION_DECL, holds the decl for the return value. */
740 #define DECL_RESULT(NODE) ((NODE)->decl.result)
741 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
742 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result)
743 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
744 For a VAR_DECL, holds the initial value.
745 For a PARM_DECL, not used--default
746 values for parameters are encoded in the type of the function,
747 not in the PARM_DECL slot. */
748 #define DECL_INITIAL(NODE) ((NODE)->decl.initial)
749 /* For a PARM_DECL, records the data type used to pass the argument,
750 which may be different from the type seen in the program. */
751 #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */
752 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
753 if nonzero, indicates that the field occupies the type. */
754 #define DECL_QUALIFIER(NODE) ((NODE)->decl.initial)
755 /* These two fields describe where in the source code the declaration was. */
756 #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename)
757 #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum)
758 /* Holds the size of the datum, as a tree expression.
759 Need not be constant. */
760 #define DECL_SIZE(NODE) ((NODE)->decl.size)
761 /* Holds the alignment required for the datum. */
762 #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size)
763 /* Holds the machine mode corresponding to the declaration of a variable or
764 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
766 #define DECL_MODE(NODE) ((NODE)->decl.mode)
767 /* Holds the RTL expression for the value of a variable or function. If
768 PROMOTED_MODE is defined, the mode of this expression may not be same
769 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
770 to the variable's data type, while the mode
771 of DECL_RTL is the mode actually used to contain the data. */
772 #define DECL_RTL(NODE) ((NODE)->decl.rtl)
773 /* For PARM_DECL, holds an RTL for the stack slot or register
774 where the data was actually passed. */
775 #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r)
776 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
777 #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r)
778 /* For FUNCTION_DECL, if it is inline,
779 holds the size of the stack frame, as an integer. */
780 #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size)
781 /* For FUNCTION_DECL, if it is built-in,
782 this identifies which built-in operation it is. */
783 #define DECL_FUNCTION_CODE(NODE) \
784 ((enum built_in_function) (NODE)->decl.frame_size)
785 #define DECL_SET_FUNCTION_CODE(NODE,VAL) \
786 ((NODE)->decl.frame_size = (int) (VAL))
787 /* For a FIELD_DECL, holds the size of the member as an integer. */
788 #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i)
790 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
791 Before the struct containing the FUNCTION_DECL is laid out,
792 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
793 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
794 function. When the class is laid out, this pointer is changed
795 to an INTEGER_CST node which is suitable for use as an index
796 into the virtual function table. */
797 #define DECL_VINDEX(NODE) ((NODE)->decl.vindex)
798 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
799 which this FIELD_DECL is defined. This information is needed when
800 writing debugging information about vfield and vbase decls for C++. */
801 #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex)
803 /* Every ..._DECL node gets a unique number. */
804 #define DECL_UID(NODE) ((NODE)->decl.uid)
806 /* For any sort of a ..._DECL node, this points to the original (abstract)
807 decl node which this decl is an instance of, or else it is NULL indicating
808 that this decl is not an instance of some other decl. */
809 #define DECL_ABSTRACT_ORIGIN(NODE) ((NODE)->decl.abstract_origin)
811 /* Nonzero for any sort of ..._DECL node means this decl node represents
812 an inline instance of some original (abstract) decl from an inline function;
813 suppress any warnings about shadowing some other variable. */
814 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
816 /* Nonzero if a _DECL means that the name of this decl should be ignored
817 for symbolic debug purposes. */
818 #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag)
820 /* Nonzero for a given ..._DECL node means that this node represents an
821 "abstract instance" of the given declaration (e.g. in the original
822 declaration of an inline function). When generating symbolic debugging
823 information, we musn't try to generate any address information for nodes
824 marked as "abstract instances" because we don't actually generate
825 any code or allocate any data space for such instances. */
826 #define DECL_ABSTRACT(NODE) ((NODE)->decl.abstract_flag)
828 /* Nonzero if a _DECL means that no warnings should be generated just
829 because this decl is unused. */
830 #define DECL_IN_SYSTEM_HEADER(NODE) ((NODE)->decl.in_system_header_flag)
832 /* Language-specific decl information. */
833 #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific)
835 /* In a VAR_DECL or FUNCTION_DECL,
836 nonzero means external reference:
837 do not allocate storage, and refer to a definition elsewhere. */
838 #define DECL_EXTERNAL(NODE) ((NODE)->decl.external_flag)
840 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'.
841 In LABEL_DECL nodes, nonzero means that an error message about
842 jumping into such a binding contour has been printed for this label. */
843 #define DECL_REGISTER(NODE) ((NODE)->decl.regdecl_flag)
844 /* In a FIELD_DECL, indicates this field should be bit-packed. */
845 #define DECL_PACKED(NODE) ((NODE)->decl.regdecl_flag)
847 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
848 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
850 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
852 Also set in some languages for variables, etc., outside the normal
853 lexical scope, such as class instance variables. */
854 #define DECL_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag)
856 /* Nonzero in a FUNCTION_DECL means this function can be substituted
857 where it is called. */
858 #define DECL_INLINE(NODE) ((NODE)->decl.inline_flag)
860 /* Nonzero in a FUNCTION_DECL means this is a built-in function
861 that is not specified by ansi C and that users are supposed to be allowed
862 to redefine for any purpose whatever. */
863 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
865 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
867 #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag)
868 /* In a LABEL_DECL, nonzero means label was defined inside a binding
869 contour that restored a stack level and which is now exited. */
870 #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag)
871 /* In a FUNCTION_DECL, nonzero means a built in function. */
872 #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag)
874 /* Used in VAR_DECLs to indicate that the variable is a vtable.
875 It is also used in FIELD_DECLs for vtable pointers. */
876 #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag)
878 /* Additional flags for language-specific uses. */
879 #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0)
880 #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1)
881 #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2)
882 #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3)
883 #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4)
884 #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5)
885 #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6)
886 #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7)
890 char common[sizeof (struct tree_common)];
893 union tree_node *size;
895 #ifdef ONLY_INT_FIELDS
898 enum machine_mode mode : 8;
901 unsigned external_flag : 1;
902 unsigned nonlocal_flag : 1;
903 unsigned regdecl_flag : 1;
904 unsigned inline_flag : 1;
905 unsigned bit_field_flag : 1;
906 unsigned virtual_flag : 1;
907 unsigned ignored_flag : 1;
908 unsigned abstract_flag : 1;
910 unsigned in_system_header_flag : 1;
911 /* room for seven more */
913 unsigned lang_flag_0 : 1;
914 unsigned lang_flag_1 : 1;
915 unsigned lang_flag_2 : 1;
916 unsigned lang_flag_3 : 1;
917 unsigned lang_flag_4 : 1;
918 unsigned lang_flag_5 : 1;
919 unsigned lang_flag_6 : 1;
920 unsigned lang_flag_7 : 1;
922 union tree_node *name;
923 union tree_node *context;
924 union tree_node *arguments;
925 union tree_node *result;
926 union tree_node *initial;
927 union tree_node *abstract_origin;
928 /* The PRINT_NAME field is marked for death. */
930 union tree_node *assembler_name;
931 struct rtx_def *rtl; /* acts as link to register transfer language
933 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
934 If built-in, this is the code for which built-in function.
935 For other kinds of decls, this is DECL_ALIGN. */
937 /* For FUNCTION_DECLs: points to insn that constitutes its definition
938 on the permanent obstack. For any other kind of decl, this is the
944 union tree_node *vindex;
945 /* Points to a structure whose details depend on the language in use. */
946 struct lang_decl *lang_specific;
949 /* Define the overall contents of a tree node.
950 It may be any of the structures declared above
951 for various types of node. */
955 struct tree_common common;
956 struct tree_int_cst int_cst;
957 struct tree_real_cst real_cst;
958 struct tree_string string;
959 struct tree_complex complex;
960 struct tree_identifier identifier;
961 struct tree_decl decl;
962 struct tree_type type;
963 struct tree_list list;
966 struct tree_block block;
969 /* Add prototype support. */
971 #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
972 #define PROTO(ARGS) ARGS
974 #define PROTO(ARGS) ()
979 #define NULL_TREE (tree) NULL
981 /* Define a generic NULL if one hasn't already been defined. */
988 #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
989 #define GENERIC_PTR void *
991 #define GENERIC_PTR char *
996 #define NULL_PTR ((GENERIC_PTR)0)
999 /* The following functions accept a wide integer argument. Rather than
1000 having to cast on every function call, we use a macro instead, that is
1001 defined here and in rtl.h. */
1004 #define exact_log2(N) exact_log2_wide ((HOST_WIDE_INT) (N))
1005 #define floor_log2(N) floor_log2_wide ((HOST_WIDE_INT) (N))
1009 /* At present, don't prototype xrealloc, since all of the callers don't
1010 cast their pointers to char *, and all of the xrealloc's don't use
1012 extern char *xmalloc PROTO((size_t));
1013 extern char *xrealloc PROTO((void *, size_t));
1015 extern char *xmalloc ();
1016 extern char *xrealloc ();
1019 extern char *oballoc PROTO((int));
1020 extern char *permalloc PROTO((int));
1021 extern char *savealloc PROTO((int));
1022 extern void free PROTO((void *));
1024 /* Lowest level primitive for allocating a node.
1025 The TREE_CODE is the only argument. Contents are initialized
1026 to zero except for a few of the common fields. */
1028 extern tree make_node PROTO((enum tree_code));
1030 /* Make a copy of a node, with all the same contents except
1031 for TREE_PERMANENT. (The copy is permanent
1032 iff nodes being made now are permanent.) */
1034 extern tree copy_node PROTO((tree));
1036 /* Make a copy of a chain of TREE_LIST nodes. */
1038 extern tree copy_list PROTO((tree));
1040 /* Make a TREE_VEC. */
1042 extern tree make_tree_vec PROTO((int));
1044 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1045 The name is supplied as a char *. */
1047 extern tree get_identifier PROTO((char *));
1049 /* Construct various types of nodes. */
1051 #define build_int_2(LO,HI) \
1052 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1055 /* We cannot define prototypes for the variable argument functions,
1056 since they have not been ANSI-fied, and an ANSI compiler would
1057 complain when compiling the definition of these functions. */
1059 extern tree build PROTO((enum tree_code, tree, ...));
1060 extern tree build_nt PROTO((enum tree_code, ...));
1061 extern tree build_parse_node PROTO((enum tree_code, ...));
1063 extern tree build ();
1064 extern tree build_nt ();
1065 extern tree build_parse_node ();
1068 extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT));
1069 extern tree build_real PROTO((tree, REAL_VALUE_TYPE));
1070 extern tree build_real_from_int_cst PROTO((tree, tree));
1071 extern tree build_complex PROTO((tree, tree));
1072 extern tree build_string PROTO((int, char *));
1073 extern tree build1 PROTO((enum tree_code, tree, tree));
1074 extern tree build_tree_list PROTO((tree, tree));
1075 extern tree build_decl_list PROTO((tree, tree));
1076 extern tree build_decl PROTO((enum tree_code, tree, tree));
1077 extern tree build_block PROTO((tree, tree, tree, tree, tree));
1079 /* Construct various nodes representing data types. */
1081 extern tree make_signed_type PROTO((int));
1082 extern tree make_unsigned_type PROTO((int));
1083 extern tree signed_or_unsigned_type PROTO((int, tree));
1084 extern void fixup_unsigned_type PROTO((tree));
1085 extern tree build_pointer_type PROTO((tree));
1086 extern tree build_reference_type PROTO((tree));
1087 extern tree build_index_type PROTO((tree));
1088 extern tree build_index_2_type PROTO((tree, tree));
1089 extern tree build_array_type PROTO((tree, tree));
1090 extern tree build_function_type PROTO((tree, tree));
1091 extern tree build_method_type PROTO((tree, tree));
1092 extern tree build_offset_type PROTO((tree, tree));
1093 extern tree build_complex_type PROTO((tree));
1094 extern tree array_type_nelts PROTO((tree));
1096 extern tree value_member PROTO((tree, tree));
1097 extern tree purpose_member PROTO((tree, tree));
1098 extern tree binfo_member PROTO((tree, tree));
1099 extern int tree_int_cst_equal PROTO((tree, tree));
1100 extern int tree_int_cst_lt PROTO((tree, tree));
1101 extern int index_type_equal PROTO((tree, tree));
1103 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1104 put the prototype here. Rtl.h does declare the prototype if
1105 tree.h had been included. */
1107 extern tree make_tree ();
1109 /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
1110 for the same kind of data as TYPE describes.
1111 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
1112 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
1113 so that duplicate variants are never made.
1114 Only main variants should ever appear as types of expressions. */
1116 extern tree build_type_variant PROTO((tree, int, int));
1118 /* Make a copy of a type node. */
1120 extern tree build_type_copy PROTO((tree));
1122 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1123 TYPE_ALIGN and TYPE_MODE fields.
1124 If called more than once on one node, does nothing except
1125 for the first time. */
1127 extern void layout_type PROTO((tree));
1129 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1130 return a canonicalized ..._TYPE node, so that duplicates are not made.
1131 How the hash code is computed is up to the caller, as long as any two
1132 callers that could hash identical-looking type nodes agree. */
1134 extern tree type_hash_canon PROTO((int, tree));
1136 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1137 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1138 fields. Call this only once for any given decl node.
1140 Second argument is the boundary that this field can be assumed to
1141 be starting at (in bits). Zero means it can be assumed aligned
1142 on any boundary that may be needed. */
1144 extern void layout_decl PROTO((tree, unsigned));
1146 /* Return an expr equal to X but certainly not valid as an lvalue. */
1148 extern tree non_lvalue PROTO((tree));
1149 extern tree pedantic_non_lvalue PROTO((tree));
1151 extern tree convert PROTO((tree, tree));
1152 extern tree size_in_bytes PROTO((tree));
1153 extern int int_size_in_bytes PROTO((tree));
1154 extern tree size_binop PROTO((enum tree_code, tree, tree));
1155 extern tree size_int PROTO((unsigned));
1156 extern tree round_up PROTO((tree, int));
1157 extern tree get_pending_sizes PROTO((void));
1159 /* Type for sizes of data-type. */
1161 extern tree sizetype;
1163 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1164 by making the last node in X point to Y.
1165 Returns X, except if X is 0 returns Y. */
1167 extern tree chainon PROTO((tree, tree));
1169 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1171 extern tree tree_cons PROTO((tree, tree, tree));
1172 extern tree perm_tree_cons PROTO((tree, tree, tree));
1173 extern tree temp_tree_cons PROTO((tree, tree, tree));
1174 extern tree saveable_tree_cons PROTO((tree, tree, tree));
1175 extern tree decl_tree_cons PROTO((tree, tree, tree));
1177 /* Return the last tree node in a chain. */
1179 extern tree tree_last PROTO((tree));
1181 /* Reverse the order of elements in a chain, and return the new head. */
1183 extern tree nreverse PROTO((tree));
1185 /* Returns the length of a chain of nodes
1186 (number of chain pointers to follow before reaching a null pointer). */
1188 extern int list_length PROTO((tree));
1190 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1192 extern int integer_zerop PROTO((tree));
1194 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1196 extern int integer_onep PROTO((tree));
1198 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1199 all of whose significant bits are 1. */
1201 extern int integer_all_onesp PROTO((tree));
1203 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1204 exactly one bit 1. */
1206 extern int integer_pow2p PROTO((tree));
1208 /* staticp (tree x) is nonzero if X is a reference to data allocated
1209 at a fixed address in memory. */
1211 extern int staticp PROTO((tree));
1213 /* Gets an error if argument X is not an lvalue.
1214 Also returns 1 if X is an lvalue, 0 if not. */
1216 extern int lvalue_or_else PROTO((tree, char *));
1218 /* save_expr (EXP) returns an expression equivalent to EXP
1219 but it can be used multiple times within context CTX
1220 and only evaluate EXP once. */
1222 extern tree save_expr PROTO((tree));
1224 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1225 or offset that depends on a field within a record.
1227 Note that we only allow such expressions within simple arithmetic
1230 extern int contains_placeholder_p PROTO((tree));
1232 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1233 return a tree with all occurrences of references to F in a
1234 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1235 contains only arithmetic expressions. */
1237 extern tree substitute_in_expr PROTO((tree, tree, tree));
1239 /* Given a type T, a FIELD_DECL F, and a replacement value R,
1240 return a new type with all size expressions that contain F
1241 updated by replacing the reference to F with R. */
1243 extern tree substitute_in_type PROTO((tree, tree, tree));
1245 /* variable_size (EXP) is like save_expr (EXP) except that it
1246 is for the special case of something that is part of a
1247 variable size for a data type. It makes special arrangements
1248 to compute the value at the right time when the data type
1249 belongs to a function parameter. */
1251 extern tree variable_size PROTO((tree));
1253 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1254 but it can be used multiple times
1255 and only evaluate the subexpressions once. */
1257 extern tree stabilize_reference PROTO((tree));
1259 /* Return EXP, stripped of any conversions to wider types
1260 in such a way that the result of converting to type FOR_TYPE
1261 is the same as if EXP were converted to FOR_TYPE.
1262 If FOR_TYPE is 0, it signifies EXP's type. */
1264 extern tree get_unwidened PROTO((tree, tree));
1266 /* Return OP or a simpler expression for a narrower value
1267 which can be sign-extended or zero-extended to give back OP.
1268 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1269 or 0 if the value should be sign-extended. */
1271 extern tree get_narrower PROTO((tree, int *));
1273 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1275 The definition of this resides in language-specific code
1276 as the repertoire of available types may vary. */
1278 extern tree type_for_mode PROTO((enum machine_mode, int));
1280 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1281 for an integer type with at least that precision.
1282 The definition of this resides in language-specific code
1283 as the repertoire of available types may vary. */
1285 extern tree type_for_size PROTO((unsigned, int));
1287 /* Given an integer type T, return a type like T but unsigned.
1288 If T is unsigned, the value is T.
1289 The definition of this resides in language-specific code
1290 as the repertoire of available types may vary. */
1292 extern tree unsigned_type PROTO((tree));
1294 /* Given an integer type T, return a type like T but signed.
1295 If T is signed, the value is T.
1296 The definition of this resides in language-specific code
1297 as the repertoire of available types may vary. */
1299 extern tree signed_type PROTO((tree));
1301 /* This function must be defined in the language-specific files.
1302 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1303 This is defined in a language-specific file. */
1305 extern tree maybe_build_cleanup PROTO((tree));
1307 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1308 look for nested component-refs or array-refs at constant positions
1309 and find the ultimate containing object, which is returned. */
1311 extern tree get_inner_reference PROTO((tree, int *, int *, tree *, enum machine_mode *, int *, int *));
1313 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1315 extern tree decl_function_context PROTO((tree));
1317 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1318 this _DECL with its context, or zero if none. */
1319 extern tree decl_type_context PROTO((tree));
1321 /* Given the FUNCTION_DECL for the current function,
1322 return zero if it is ok for this function to be inline.
1323 Otherwise return a warning message with a single %s
1324 for the function's name. */
1326 extern char *function_cannot_inline_p PROTO((tree));
1328 /* Return 1 if EXPR is the real constant zero. */
1329 extern int real_zerop PROTO((tree));
1331 /* Declare commonly used variables for tree structure. */
1333 /* An integer constant with value 0 */
1334 extern tree integer_zero_node;
1336 /* An integer constant with value 1 */
1337 extern tree integer_one_node;
1339 /* An integer constant with value 0 whose type is sizetype. */
1340 extern tree size_zero_node;
1342 /* An integer constant with value 1 whose type is sizetype. */
1343 extern tree size_one_node;
1345 /* A constant of type pointer-to-int and value 0 */
1346 extern tree null_pointer_node;
1348 /* A node of type ERROR_MARK. */
1349 extern tree error_mark_node;
1351 /* The type node for the void type. */
1352 extern tree void_type_node;
1354 /* The type node for the ordinary (signed) integer type. */
1355 extern tree integer_type_node;
1357 /* The type node for the unsigned integer type. */
1358 extern tree unsigned_type_node;
1360 /* The type node for the ordinary character type. */
1361 extern tree char_type_node;
1363 /* Points to the name of the input file from which the current input
1364 being parsed originally came (before it went into cpp). */
1365 extern char *input_filename;
1367 /* Current line number in input file. */
1370 /* Nonzero for -pedantic switch: warn about anything
1371 that standard C forbids. */
1372 extern int pedantic;
1374 /* Nonzero means can safely call expand_expr now;
1375 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1377 extern int immediate_size_expand;
1379 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1381 extern tree current_function_decl;
1383 /* Nonzero if function being compiled can call setjmp. */
1385 extern int current_function_calls_setjmp;
1387 /* Nonzero if function being compiled can call longjmp. */
1389 extern int current_function_calls_longjmp;
1391 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1393 extern int all_types_permanent;
1395 /* Pointer to function to compute the name to use to print a declaration. */
1397 extern char *(*decl_printable_name) ();
1399 /* Pointer to function to finish handling an incomplete decl at the
1400 end of compilation. */
1402 extern void (*incomplete_decl_finalize_hook) ();
1405 extern char *perm_calloc PROTO((int, long));
1409 extern tree expand_start_stmt_expr PROTO((void));
1410 extern tree expand_end_stmt_expr PROTO((tree));
1411 extern void expand_expr_stmt PROTO((tree));
1412 extern void expand_decl_init PROTO((tree));
1413 extern void clear_last_expr PROTO((void));
1414 extern void expand_label PROTO((tree));
1415 extern void expand_goto PROTO((tree));
1416 extern void expand_asm PROTO((tree));
1417 extern void expand_start_cond PROTO((tree, int));
1418 extern void expand_end_cond PROTO((void));
1419 extern void expand_start_else PROTO((void));
1420 extern void expand_start_elseif PROTO((tree));
1421 extern struct nesting *expand_start_loop PROTO((int));
1422 extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int));
1423 extern void expand_loop_continue_here PROTO((void));
1424 extern void expand_end_loop PROTO((void));
1425 extern int expand_continue_loop PROTO((struct nesting *));
1426 extern int expand_exit_loop PROTO((struct nesting *));
1427 extern int expand_exit_loop_if_false PROTO((struct nesting *, tree));
1428 extern int expand_exit_something PROTO((void));
1430 extern void expand_null_return PROTO((void));
1431 extern void expand_return PROTO((tree));
1432 extern void expand_start_bindings PROTO((int));
1433 extern void expand_end_bindings PROTO((tree, int, int));
1434 extern tree last_cleanup_this_contour PROTO((void));
1435 extern void expand_start_case PROTO((int, tree, tree, char *));
1436 extern void expand_end_case PROTO((tree));
1437 extern int pushcase PROTO((tree, tree (*) (tree, tree), tree, tree *));
1438 extern int pushcase_range PROTO((tree, tree, tree (*) (tree, tree), tree, tree *));
1440 /* In fold-const.c */
1442 /* Fold constants as much as possible in an expression.
1443 Returns the simplified expression.
1444 Acts only on the top level of the expression;
1445 if the argument itself cannot be simplified, its
1446 subexpressions are not changed. */
1448 extern tree fold PROTO((tree));
1450 extern int force_fit_type PROTO((tree, int));
1451 extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1452 HOST_WIDE_INT, HOST_WIDE_INT,
1453 HOST_WIDE_INT *, HOST_WIDE_INT *));
1454 extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1455 HOST_WIDE_INT *, HOST_WIDE_INT *));
1456 extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1457 HOST_WIDE_INT, HOST_WIDE_INT,
1458 HOST_WIDE_INT *, HOST_WIDE_INT *));
1459 extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1460 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1461 HOST_WIDE_INT *, int));
1462 extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1464 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
1465 extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1466 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1468 extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1469 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1471 extern int operand_equal_p PROTO((tree, tree, int));
1472 extern tree invert_truthvalue PROTO((tree));
1474 /* The language front-end must define these functions. */
1476 /* Function of no arguments for initializing lexical scanning. */
1477 extern void init_lex PROTO((void));
1478 /* Function of no arguments for initializing the symbol table. */
1479 extern void init_decl_processing PROTO((void));
1481 /* Functions called with no arguments at the beginning and end or processing
1482 the input source file. */
1483 extern void lang_init PROTO((void));
1484 extern void lang_finish PROTO((void));
1486 /* Funtion to identify which front-end produced the output file. */
1487 extern char *lang_identify PROTO((void));
1489 /* Function called with no arguments to parse and compile the input. */
1490 extern int yyparse PROTO((void));
1491 /* Function called with option as argument
1492 to decode options starting with -f or -W or +.
1493 It should return nonzero if it handles the option. */
1494 extern int lang_decode_option PROTO((char *));
1496 /* Functions for processing symbol declarations. */
1497 /* Function to enter a new lexical scope.
1498 Takes one argument: always zero when called from outside the front end. */
1499 extern void pushlevel PROTO((int));
1500 /* Function to exit a lexical scope. It returns a BINDING for that scope.
1501 Takes three arguments:
1502 KEEP -- nonzero if there were declarations in this scope.
1503 REVERSE -- reverse the order of decls before returning them.
1504 FUNCTIONBODY -- nonzero if this level is the body of a function. */
1505 extern tree poplevel PROTO((int, int, int));
1506 /* Set the BLOCK node for the current scope level. */
1507 extern void set_block PROTO((tree));
1508 /* Function to add a decl to the current scope level.
1509 Takes one argument, a decl to add.
1510 Returns that decl, or, if the same symbol is already declared, may
1511 return a different decl for that name. */
1512 extern tree pushdecl PROTO((tree));
1513 /* Function to return the chain of decls so far in the current scope level. */
1514 extern tree getdecls PROTO((void));
1515 /* Function to return the chain of structure tags in the current scope level. */
1516 extern tree gettags PROTO((void));
1518 extern tree build_range_type PROTO((tree, tree, tree));
1520 /* Call when starting to parse a declaration:
1521 make expressions in the declaration last the length of the function.
1522 Returns an argument that should be passed to resume_momentary later. */
1523 extern int suspend_momentary PROTO((void));
1525 extern int allocation_temporary_p PROTO((void));
1527 /* Call when finished parsing a declaration:
1528 restore the treatment of node-allocation that was
1529 in effect before the suspension.
1530 YES should be the value previously returned by suspend_momentary. */
1531 extern void resume_momentary PROTO((int));
1533 /* Called after finishing a record, union or enumeral type. */
1534 extern void rest_of_type_compilation PROTO((tree, int));
1536 /* Save the current set of obstacks, but don't change them. */
1537 extern void push_obstacks_nochange PROTO((void));
1539 extern void push_momentary PROTO((void));
1541 extern void clear_momentary PROTO((void));
1543 extern void pop_momentary PROTO((void));
1545 extern void end_temporary_allocation PROTO((void));
1547 /* Pop the obstack selection stack. */
1548 extern void pop_obstacks PROTO((void));