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 /* 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_NAME(NODE) ((NODE)->type.name)
556 #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant)
557 #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant)
558 #define TYPE_BINFO(NODE) ((NODE)->type.binfo)
559 #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts)
560 #define TYPE_CONTEXT(NODE) ((NODE)->type.context)
561 #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific)
563 /* The alignment necessary for objects of this type.
564 The value is an int, measured in bits. */
565 #define TYPE_ALIGN(NODE) ((NODE)->type.align)
567 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
569 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
570 has BLKmode only because it lacks the alignment requirement for
572 #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag)
574 /* Nonzero in a type considered volatile as a whole. */
575 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
577 /* Means this type is const-qualified. */
578 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
580 /* These flags are available for each language front end to use internally. */
581 #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0)
582 #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1)
583 #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2)
584 #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3)
585 #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4)
586 #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5)
587 #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6)
591 char common[sizeof (struct tree_common)];
592 union tree_node *values;
593 union tree_node *size;
596 #ifdef ONLY_INT_FIELDS
599 enum machine_mode mode : 8;
601 unsigned char precision;
603 unsigned no_force_blk_flag : 1;
604 unsigned lang_flag_0 : 1;
605 unsigned lang_flag_1 : 1;
606 unsigned lang_flag_2 : 1;
607 unsigned lang_flag_3 : 1;
608 unsigned lang_flag_4 : 1;
609 unsigned lang_flag_5 : 1;
610 unsigned lang_flag_6 : 1;
613 union tree_node *pointer_to;
614 union tree_node *reference_to;
617 union tree_node *name;
618 union tree_node *minval;
619 union tree_node *maxval;
620 union tree_node *next_variant;
621 union tree_node *main_variant;
622 union tree_node *binfo;
623 union tree_node *noncopied_parts;
624 union tree_node *context;
625 /* Points to a structure whose details depend on the language in use. */
626 struct lang_type *lang_specific;
629 /* Define accessor macros for information about type inheritance
632 A "basetype" means a particular usage of a data type for inheritance
633 in another type. Each such basetype usage has its own "binfo"
634 object to describe it. The binfo object is a TREE_VEC node.
636 Inheritance is represented by the binfo nodes allocated for a
637 given type. For example, given types C and D, such that D is
638 inherited by C, 3 binfo nodes will be allocated: one for describing
639 the binfo properties of C, similarly one for D, and one for
640 describing the binfo properties of D as a base type for C.
641 Thus, given a pointer to class C, one can get a pointer to the binfo
642 of D acting as a basetype for C by looking at C's binfo's basetypes. */
644 /* The actual data type node being inherited in this basetype. */
645 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
647 /* The offset where this basetype appears in its containing type.
648 BINFO_OFFSET slot holds the offset (in bytes)
649 from the base of the complete object to the base of the part of the
650 object that is allocated on behalf of this `type'.
651 This is always 0 except when there is multiple inheritance. */
653 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
654 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
655 #define BINFO_OFFSET_ZEROP(NODE) (BINFO_OFFSET (NODE) == integer_zero_node)
657 /* The virtual function table belonging to this basetype. Virtual
658 function tables provide a mechanism for run-time method dispatching.
659 The entries of a virtual function table are language-dependent. */
661 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
662 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
664 /* The virtual functions in the virtual function table. This is
665 a TREE_LIST that is used as an initial approximation for building
666 a virtual function table for this basetype. */
667 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
668 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
670 /* A vector of additional binfos for the types inherited by this basetype.
672 If this basetype describes type D as inherited in C,
673 and if the basetypes of D are E anf F,
674 then this vector contains binfos for inheritance of E and F by C.
676 ??? This could probably be done by just allocating the
677 base types at the end of this TREE_VEC (instead of using
678 another TREE_VEC). This would simplify the calculation
679 of how many basetypes a given type had. */
680 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
681 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
683 /* For a BINFO record describing an inheritance, this yields a pointer
684 to the artificial FIELD_DECL node which contains the "virtual base
685 class pointer" for the given inheritance. */
687 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
689 /* Accessor macro to get to the Nth basetype of this basetype. */
690 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
691 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
693 /* Slot used to build a chain that represents a use of inheritance.
694 For example, if X is derived from Y, and Y is derived from Z,
695 then this field can be used to link the binfo node for X to
696 the binfo node for X's Y to represent the use of inheritance
697 from X to Y. Similarly, this slot of the binfo node for X's Y
698 can point to the Z from which Y is inherited (in X's inheritance
699 hierarchy). In this fashion, one can represent and traverse specific
700 uses of inheritance using the binfo nodes themselves (instead of
701 consing new space pointing to binfo nodes).
702 It is up to the language-dependent front-ends to maintain
703 this information as necessary. */
704 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
706 /* Define fields and accessors for nodes representing declared names. */
708 /* This is the name of the object as written by the user.
709 It is an IDENTIFIER_NODE. */
710 #define DECL_NAME(NODE) ((NODE)->decl.name)
711 /* This macro is marked for death. */
712 #define DECL_PRINT_NAME(NODE) ((NODE)->decl.print_name)
713 /* This is the name of the object as the assembler will see it
714 (but before any translations made by ASM_OUTPUT_LABELREF).
715 Often this is the same as DECL_NAME.
716 It is an IDENTIFIER_NODE. */
717 #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name)
718 /* For FIELD_DECLs, this is the
719 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
720 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
721 and CONST_DECL nodes, this points to the FUNCTION_DECL for the
722 containing function, or else yields NULL_TREE if the given decl has "file scope". */
723 #define DECL_CONTEXT(NODE) ((NODE)->decl.context)
724 #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context)
725 /* In a FIELD_DECL, this is the field position, counting in bits,
726 of the bit closest to the beginning of the structure. */
727 #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments)
728 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
729 if so, the type that was originally specified for it.
730 TREE_TYPE may have been modified (in finish_struct). */
731 #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result)
732 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
733 /* VAR_DECL and PARM_DECL reserve the arguments slot
734 for language-specific uses. */
735 #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments)
736 /* In FUNCTION_DECL, holds the decl for the return value. */
737 #define DECL_RESULT(NODE) ((NODE)->decl.result)
738 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
739 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result)
740 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
741 For a VAR_DECL, holds the initial value.
742 For a PARM_DECL, not used--default
743 values for parameters are encoded in the type of the function,
744 not in the PARM_DECL slot. */
745 #define DECL_INITIAL(NODE) ((NODE)->decl.initial)
746 /* For a PARM_DECL, records the data type used to pass the argument,
747 which may be different from the type seen in the program. */
748 #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */
749 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
750 if nonzero, indicates that the field occupies the type. */
751 #define DECL_QUALIFIER(NODE) ((NODE)->decl.initial)
752 /* These two fields describe where in the source code the declaration was. */
753 #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename)
754 #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum)
755 /* Holds the size of the datum, as a tree expression.
756 Need not be constant. */
757 #define DECL_SIZE(NODE) ((NODE)->decl.size)
758 /* Holds the alignment required for the datum. */
759 #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size)
760 /* Holds the machine mode corresponding to the declaration of a variable or
761 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
763 #define DECL_MODE(NODE) ((NODE)->decl.mode)
764 /* Holds the RTL expression for the value of a variable or function. If
765 PROMOTED_MODE is defined, the mode of this expression may not be same
766 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
767 to the variable's data type, while the mode
768 of DECL_RTL is the mode actually used to contain the data. */
769 #define DECL_RTL(NODE) ((NODE)->decl.rtl)
770 /* For PARM_DECL, holds an RTL for the stack slot or register
771 where the data was actually passed. */
772 #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r)
773 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
774 #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r)
775 /* For FUNCTION_DECL, if it is inline,
776 holds the size of the stack frame, as an integer. */
777 #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size)
778 /* For FUNCTION_DECL, if it is built-in,
779 this identifies which built-in operation it is. */
780 #define DECL_FUNCTION_CODE(NODE) \
781 ((enum built_in_function) (NODE)->decl.frame_size)
782 #define DECL_SET_FUNCTION_CODE(NODE,VAL) \
783 ((NODE)->decl.frame_size = (int) (VAL))
784 /* For a FIELD_DECL, holds the size of the member as an integer. */
785 #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i)
787 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
788 Before the struct containing the FUNCTION_DECL is laid out,
789 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
790 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
791 function. When the class is laid out, this pointer is changed
792 to an INTEGER_CST node which is suitable for use as an index
793 into the virtual function table. */
794 #define DECL_VINDEX(NODE) ((NODE)->decl.vindex)
795 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
796 which this FIELD_DECL is defined. This information is needed when
797 writing debugging information about vfield and vbase decls for C++. */
798 #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex)
800 /* Every ..._DECL node gets a unique number. */
801 #define DECL_UID(NODE) ((NODE)->decl.uid)
803 /* For any sort of a ..._DECL node, this points to the original (abstract)
804 decl node which this decl is an instance of, or else it is NULL indicating
805 that this decl is not an instance of some other decl. */
806 #define DECL_ABSTRACT_ORIGIN(NODE) ((NODE)->decl.abstract_origin)
808 /* Nonzero for any sort of ..._DECL node means this decl node represents
809 an inline instance of some original (abstract) decl from an inline function;
810 suppress any warnings about shadowing some other variable. */
811 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
813 /* Nonzero if a _DECL means that the name of this decl should be ignored
814 for symbolic debug purposes. */
815 #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag)
817 /* Nonzero for a given ..._DECL node means that this node represents an
818 "abstract instance" of the given declaration (e.g. in the original
819 declaration of an inline function). When generating symbolic debugging
820 information, we musn't try to generate any address information for nodes
821 marked as "abstract instances" because we don't actually generate
822 any code or allocate any data space for such instances. */
823 #define DECL_ABSTRACT(NODE) ((NODE)->decl.abstract_flag)
825 /* Nonzero if a _DECL means that no warnings should be generated just
826 because this decl is unused. */
827 #define DECL_IN_SYSTEM_HEADER(NODE) ((NODE)->decl.in_system_header_flag)
829 /* Language-specific decl information. */
830 #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific)
832 /* In a VAR_DECL or FUNCTION_DECL,
833 nonzero means external reference:
834 do not allocate storage, and refer to a definition elsewhere. */
835 #define DECL_EXTERNAL(NODE) ((NODE)->decl.external_flag)
837 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'.
838 In LABEL_DECL nodes, nonzero means that an error message about
839 jumping into such a binding contour has been printed for this label. */
840 #define DECL_REGISTER(NODE) ((NODE)->decl.regdecl_flag)
841 /* In a FIELD_DECL, indicates this field should be bit-packed. */
842 #define DECL_PACKED(NODE) ((NODE)->decl.regdecl_flag)
844 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
845 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
847 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
849 Also set in some languages for variables, etc., outside the normal
850 lexical scope, such as class instance variables. */
851 #define DECL_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag)
853 /* Nonzero in a FUNCTION_DECL means this function can be substituted
854 where it is called. */
855 #define DECL_INLINE(NODE) ((NODE)->decl.inline_flag)
857 /* Nonzero in a FUNCTION_DECL means this is a built-in function
858 that is not specified by ansi C and that users are supposed to be allowed
859 to redefine for any purpose whatever. */
860 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
862 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
864 #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag)
865 /* In a LABEL_DECL, nonzero means label was defined inside a binding
866 contour that restored a stack level and which is now exited. */
867 #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag)
868 /* In a FUNCTION_DECL, nonzero means a built in function. */
869 #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag)
871 /* Used in VAR_DECLs to indicate that the variable is a vtable.
872 It is also used in FIELD_DECLs for vtable pointers. */
873 #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag)
875 /* Additional flags for language-specific uses. */
876 #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0)
877 #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1)
878 #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2)
879 #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3)
880 #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4)
881 #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5)
882 #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6)
883 #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7)
887 char common[sizeof (struct tree_common)];
890 union tree_node *size;
892 #ifdef ONLY_INT_FIELDS
895 enum machine_mode mode : 8;
898 unsigned external_flag : 1;
899 unsigned nonlocal_flag : 1;
900 unsigned regdecl_flag : 1;
901 unsigned inline_flag : 1;
902 unsigned bit_field_flag : 1;
903 unsigned virtual_flag : 1;
904 unsigned ignored_flag : 1;
905 unsigned abstract_flag : 1;
907 unsigned in_system_header_flag : 1;
908 /* room for seven more */
910 unsigned lang_flag_0 : 1;
911 unsigned lang_flag_1 : 1;
912 unsigned lang_flag_2 : 1;
913 unsigned lang_flag_3 : 1;
914 unsigned lang_flag_4 : 1;
915 unsigned lang_flag_5 : 1;
916 unsigned lang_flag_6 : 1;
917 unsigned lang_flag_7 : 1;
919 union tree_node *name;
920 union tree_node *context;
921 union tree_node *arguments;
922 union tree_node *result;
923 union tree_node *initial;
924 union tree_node *abstract_origin;
925 /* The PRINT_NAME field is marked for death. */
927 union tree_node *assembler_name;
928 struct rtx_def *rtl; /* acts as link to register transfer language
930 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
931 If built-in, this is the code for which built-in function.
932 For other kinds of decls, this is DECL_ALIGN. */
934 /* For FUNCTION_DECLs: points to insn that constitutes its definition
935 on the permanent obstack. For any other kind of decl, this is the
941 union tree_node *vindex;
942 /* Points to a structure whose details depend on the language in use. */
943 struct lang_decl *lang_specific;
946 /* Define the overall contents of a tree node.
947 It may be any of the structures declared above
948 for various types of node. */
952 struct tree_common common;
953 struct tree_int_cst int_cst;
954 struct tree_real_cst real_cst;
955 struct tree_string string;
956 struct tree_complex complex;
957 struct tree_identifier identifier;
958 struct tree_decl decl;
959 struct tree_type type;
960 struct tree_list list;
963 struct tree_block block;
966 /* Add prototype support. */
968 #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
969 #define PROTO(ARGS) ARGS
971 #define PROTO(ARGS) ()
976 #define NULL_TREE (tree) NULL
978 /* Define a generic NULL if one hasn't already been defined. */
985 #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
986 #define GENERIC_PTR void *
988 #define GENERIC_PTR char *
993 #define NULL_PTR ((GENERIC_PTR)0)
996 /* Format for global names of constructor and destructor functions. */
997 #ifndef CONSTRUCTOR_NAME_FORMAT /* Some machines need to override this. */
998 #ifndef NO_DOLLAR_IN_LABEL
999 #define CONSTRUCTOR_NAME_FORMAT "_GLOBAL_$I$%s"
1001 #ifdef NO_DOT_IN_LABEL
1002 #define CONSTRUCTOR_NAME_FORMAT "____GLOBAL__I_%s"
1004 #define CONSTRUCTOR_NAME_FORMAT "_GLOBAL_.I.%s"
1009 /* The following functions accept a wide integer argument. Rather than
1010 having to cast on every function call, we use a macro instead, that is
1011 defined here and in rtl.h. */
1014 #define exact_log2(N) exact_log2_wide ((HOST_WIDE_INT) (N))
1015 #define floor_log2(N) floor_log2_wide ((HOST_WIDE_INT) (N))
1019 /* At present, don't prototype xrealloc, since all of the callers don't
1020 cast their pointers to char *, and all of the xrealloc's don't use
1022 extern char *xmalloc PROTO((size_t));
1023 extern char *xrealloc PROTO((void *, size_t));
1025 extern char *xmalloc ();
1026 extern char *xrealloc ();
1029 extern char *oballoc PROTO((int));
1030 extern char *permalloc PROTO((int));
1031 extern char *savealloc PROTO((int));
1032 extern void free PROTO((void *));
1034 /* Lowest level primitive for allocating a node.
1035 The TREE_CODE is the only argument. Contents are initialized
1036 to zero except for a few of the common fields. */
1038 extern tree make_node PROTO((enum tree_code));
1040 /* Make a copy of a node, with all the same contents except
1041 for TREE_PERMANENT. (The copy is permanent
1042 iff nodes being made now are permanent.) */
1044 extern tree copy_node PROTO((tree));
1046 /* Make a copy of a chain of TREE_LIST nodes. */
1048 extern tree copy_list PROTO((tree));
1050 /* Make a TREE_VEC. */
1052 extern tree make_tree_vec PROTO((int));
1054 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1055 The name is supplied as a char *. */
1057 extern tree get_identifier PROTO((char *));
1059 /* Construct various types of nodes. */
1061 #define build_int_2(LO,HI) \
1062 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1065 /* We cannot define prototypes for the variable argument functions,
1066 since they have not been ANSI-fied, and an ANSI compiler would
1067 complain when compiling the definition of these functions. */
1069 extern tree build PROTO((enum tree_code, tree, ...));
1070 extern tree build_nt PROTO((enum tree_code, ...));
1071 extern tree build_parse_node PROTO((enum tree_code, ...));
1073 extern tree build ();
1074 extern tree build_nt ();
1075 extern tree build_parse_node ();
1078 extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT));
1079 extern tree build_real PROTO((tree, REAL_VALUE_TYPE));
1080 extern tree build_real_from_int_cst PROTO((tree, tree));
1081 extern tree build_complex PROTO((tree, tree));
1082 extern tree build_string PROTO((int, char *));
1083 extern tree build1 PROTO((enum tree_code, tree, tree));
1084 extern tree build_tree_list PROTO((tree, tree));
1085 extern tree build_decl_list PROTO((tree, tree));
1086 extern tree build_decl PROTO((enum tree_code, tree, tree));
1087 extern tree build_block PROTO((tree, tree, tree, tree, tree));
1089 /* Construct various nodes representing data types. */
1091 extern tree make_signed_type PROTO((int));
1092 extern tree make_unsigned_type PROTO((int));
1093 extern tree signed_or_unsigned_type PROTO((int, tree));
1094 extern void fixup_unsigned_type PROTO((tree));
1095 extern tree build_pointer_type PROTO((tree));
1096 extern tree build_reference_type PROTO((tree));
1097 extern tree build_index_type PROTO((tree));
1098 extern tree build_index_2_type PROTO((tree, tree));
1099 extern tree build_array_type PROTO((tree, tree));
1100 extern tree build_function_type PROTO((tree, tree));
1101 extern tree build_method_type PROTO((tree, tree));
1102 extern tree build_offset_type PROTO((tree, tree));
1103 extern tree build_complex_type PROTO((tree));
1104 extern tree array_type_nelts PROTO((tree));
1106 extern tree value_member PROTO((tree, tree));
1107 extern tree purpose_member PROTO((tree, tree));
1108 extern tree binfo_member PROTO((tree, tree));
1109 extern int tree_int_cst_equal PROTO((tree, tree));
1110 extern int tree_int_cst_lt PROTO((tree, tree));
1111 extern int index_type_equal PROTO((tree, tree));
1113 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1114 put the prototype here. Rtl.h does declare the prototype if
1115 tree.h had been included. */
1117 extern tree make_tree ();
1119 /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
1120 for the same kind of data as TYPE describes.
1121 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
1122 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
1123 so that duplicate variants are never made.
1124 Only main variants should ever appear as types of expressions. */
1126 extern tree build_type_variant PROTO((tree, int, int));
1128 /* Make a copy of a type node. */
1130 extern tree build_type_copy PROTO((tree));
1132 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1133 TYPE_ALIGN and TYPE_MODE fields.
1134 If called more than once on one node, does nothing except
1135 for the first time. */
1137 extern void layout_type PROTO((tree));
1139 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1140 return a canonicalized ..._TYPE node, so that duplicates are not made.
1141 How the hash code is computed is up to the caller, as long as any two
1142 callers that could hash identical-looking type nodes agree. */
1144 extern tree type_hash_canon PROTO((int, tree));
1146 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1147 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1148 fields. Call this only once for any given decl node.
1150 Second argument is the boundary that this field can be assumed to
1151 be starting at (in bits). Zero means it can be assumed aligned
1152 on any boundary that may be needed. */
1154 extern void layout_decl PROTO((tree, unsigned));
1156 /* Return an expr equal to X but certainly not valid as an lvalue. */
1158 extern tree non_lvalue PROTO((tree));
1160 extern tree convert PROTO((tree, tree));
1161 extern tree size_in_bytes PROTO((tree));
1162 extern int int_size_in_bytes PROTO((tree));
1163 extern tree size_binop PROTO((enum tree_code, tree, tree));
1164 extern tree size_int PROTO((unsigned));
1165 extern tree round_up PROTO((tree, int));
1166 extern tree get_pending_sizes PROTO((void));
1168 /* Type for sizes of data-type. */
1170 extern tree sizetype;
1172 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1173 by making the last node in X point to Y.
1174 Returns X, except if X is 0 returns Y. */
1176 extern tree chainon PROTO((tree, tree));
1178 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1180 extern tree tree_cons PROTO((tree, tree, tree));
1181 extern tree perm_tree_cons PROTO((tree, tree, tree));
1182 extern tree temp_tree_cons PROTO((tree, tree, tree));
1183 extern tree saveable_tree_cons PROTO((tree, tree, tree));
1184 extern tree decl_tree_cons PROTO((tree, tree, tree));
1186 /* Return the last tree node in a chain. */
1188 extern tree tree_last PROTO((tree));
1190 /* Reverse the order of elements in a chain, and return the new head. */
1192 extern tree nreverse PROTO((tree));
1194 /* Returns the length of a chain of nodes
1195 (number of chain pointers to follow before reaching a null pointer). */
1197 extern int list_length PROTO((tree));
1199 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1201 extern int integer_zerop PROTO((tree));
1203 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1205 extern int integer_onep PROTO((tree));
1207 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1208 all of whose significant bits are 1. */
1210 extern int integer_all_onesp PROTO((tree));
1212 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1213 exactly one bit 1. */
1215 extern int integer_pow2p PROTO((tree));
1217 /* staticp (tree x) is nonzero if X is a reference to data allocated
1218 at a fixed address in memory. */
1220 extern int staticp PROTO((tree));
1222 /* Gets an error if argument X is not an lvalue.
1223 Also returns 1 if X is an lvalue, 0 if not. */
1225 extern int lvalue_or_else PROTO((tree, char *));
1227 /* save_expr (EXP) returns an expression equivalent to EXP
1228 but it can be used multiple times within context CTX
1229 and only evaluate EXP once. */
1231 extern tree save_expr PROTO((tree));
1233 /* variable_size (EXP) is like save_expr (EXP) except that it
1234 is for the special case of something that is part of a
1235 variable size for a data type. It makes special arrangements
1236 to compute the value at the right time when the data type
1237 belongs to a function parameter. */
1239 extern tree variable_size PROTO((tree));
1241 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1242 but it can be used multiple times
1243 and only evaluate the subexpressions once. */
1245 extern tree stabilize_reference PROTO((tree));
1247 /* Return EXP, stripped of any conversions to wider types
1248 in such a way that the result of converting to type FOR_TYPE
1249 is the same as if EXP were converted to FOR_TYPE.
1250 If FOR_TYPE is 0, it signifies EXP's type. */
1252 extern tree get_unwidened PROTO((tree, tree));
1254 /* Return OP or a simpler expression for a narrower value
1255 which can be sign-extended or zero-extended to give back OP.
1256 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1257 or 0 if the value should be sign-extended. */
1259 extern tree get_narrower PROTO((tree, int *));
1261 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1263 The definition of this resides in language-specific code
1264 as the repertoire of available types may vary. */
1266 extern tree type_for_mode PROTO((enum machine_mode, int));
1268 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1269 for an integer type with at least that precision.
1270 The definition of this resides in language-specific code
1271 as the repertoire of available types may vary. */
1273 extern tree type_for_size PROTO((unsigned, int));
1275 /* Given an integer type T, return a type like T but unsigned.
1276 If T is unsigned, 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 unsigned_type PROTO((tree));
1282 /* Given an integer type T, return a type like T but signed.
1283 If T is signed, the value is T.
1284 The definition of this resides in language-specific code
1285 as the repertoire of available types may vary. */
1287 extern tree signed_type PROTO((tree));
1289 /* This function must be defined in the language-specific files.
1290 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1291 This is defined in a language-specific file. */
1293 extern tree maybe_build_cleanup PROTO((tree));
1295 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1296 look for nested component-refs or array-refs at constant positions
1297 and find the ultimate containing object, which is returned. */
1299 extern tree get_inner_reference PROTO((tree, int *, int *, tree *, enum machine_mode *, int *, int *));
1301 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1303 extern tree decl_function_context PROTO((tree));
1305 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1306 this _DECL with its context, or zero if none. */
1307 extern tree decl_type_context PROTO((tree));
1309 /* Given the FUNCTION_DECL for the current function,
1310 return zero if it is ok for this function to be inline.
1311 Otherwise return a warning message with a single %s
1312 for the function's name. */
1314 extern char *function_cannot_inline_p PROTO((tree));
1316 /* Return 1 if EXPR is the real constant zero. */
1317 extern int real_zerop PROTO((tree));
1319 /* Declare commonly used variables for tree structure. */
1321 /* An integer constant with value 0 */
1322 extern tree integer_zero_node;
1324 /* An integer constant with value 1 */
1325 extern tree integer_one_node;
1327 /* An integer constant with value 0 whose type is sizetype. */
1328 extern tree size_zero_node;
1330 /* An integer constant with value 1 whose type is sizetype. */
1331 extern tree size_one_node;
1333 /* A constant of type pointer-to-int and value 0 */
1334 extern tree null_pointer_node;
1336 /* A node of type ERROR_MARK. */
1337 extern tree error_mark_node;
1339 /* The type node for the void type. */
1340 extern tree void_type_node;
1342 /* The type node for the ordinary (signed) integer type. */
1343 extern tree integer_type_node;
1345 /* The type node for the unsigned integer type. */
1346 extern tree unsigned_type_node;
1348 /* The type node for the ordinary character type. */
1349 extern tree char_type_node;
1351 /* Points to the name of the input file from which the current input
1352 being parsed originally came (before it went into cpp). */
1353 extern char *input_filename;
1355 /* Current line number in input file. */
1358 /* Nonzero for -pedantic switch: warn about anything
1359 that standard C forbids. */
1360 extern int pedantic;
1362 /* Nonzero means can safely call expand_expr now;
1363 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1365 extern int immediate_size_expand;
1367 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1369 extern tree current_function_decl;
1371 /* Nonzero if function being compiled can call setjmp. */
1373 extern int current_function_calls_setjmp;
1375 /* Nonzero if function being compiled can call longjmp. */
1377 extern int current_function_calls_longjmp;
1379 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1381 extern int all_types_permanent;
1383 /* Pointer to function to compute the name to use to print a declaration. */
1385 extern char *(*decl_printable_name) ();
1387 /* Pointer to function to finish handling an incomplete decl at the
1388 end of compilation. */
1390 extern void (*incomplete_decl_finalize_hook) ();
1393 extern char *perm_calloc PROTO((int, long));
1397 extern tree expand_start_stmt_expr PROTO((void));
1398 extern tree expand_end_stmt_expr PROTO((tree));
1399 extern void expand_expr_stmt PROTO((tree));
1400 extern void expand_decl_init PROTO((tree));
1401 extern void clear_last_expr PROTO((void));
1402 extern void expand_label PROTO((tree));
1403 extern void expand_goto PROTO((tree));
1404 extern void expand_asm PROTO((tree));
1405 extern void expand_start_cond PROTO((tree, int));
1406 extern void expand_end_cond PROTO((void));
1407 extern void expand_start_else PROTO((void));
1408 extern void expand_start_elseif PROTO((tree));
1409 extern struct nesting *expand_start_loop PROTO((int));
1410 extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int));
1411 extern void expand_loop_continue_here PROTO((void));
1412 extern void expand_end_loop PROTO((void));
1413 extern int expand_continue_loop PROTO((struct nesting *));
1414 extern int expand_exit_loop PROTO((struct nesting *));
1415 extern int expand_exit_loop_if_false PROTO((struct nesting *, tree));
1416 extern int expand_exit_something PROTO((void));
1418 extern void expand_null_return PROTO((void));
1419 extern void expand_return PROTO((tree));
1420 extern void expand_start_bindings PROTO((int));
1421 extern void expand_end_bindings PROTO((tree, int, int));
1422 extern tree last_cleanup_this_contour PROTO((void));
1423 extern void expand_start_case PROTO((int, tree, tree, char *));
1424 extern void expand_end_case PROTO((tree));
1425 extern int pushcase PROTO((tree, tree (*) (tree, tree), tree, tree *));
1426 extern int pushcase_range PROTO((tree, tree, tree (*) (tree, tree), tree, tree *));
1428 /* In fold-const.c */
1430 /* Fold constants as much as possible in an expression.
1431 Returns the simplified expression.
1432 Acts only on the top level of the expression;
1433 if the argument itself cannot be simplified, its
1434 subexpressions are not changed. */
1436 extern tree fold PROTO((tree));
1438 extern int force_fit_type PROTO((tree, int));
1439 extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1440 HOST_WIDE_INT, HOST_WIDE_INT,
1441 HOST_WIDE_INT *, HOST_WIDE_INT *));
1442 extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1443 HOST_WIDE_INT *, HOST_WIDE_INT *));
1444 extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1445 HOST_WIDE_INT, HOST_WIDE_INT,
1446 HOST_WIDE_INT *, HOST_WIDE_INT *));
1447 extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1448 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1449 HOST_WIDE_INT *, int));
1450 extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1452 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
1453 extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1454 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1456 extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1457 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1459 extern int operand_equal_p PROTO((tree, tree, int));
1460 extern tree invert_truthvalue PROTO((tree));
1462 /* The language front-end must define these functions. */
1464 /* Function of no arguments for initializing lexical scanning. */
1465 extern void init_lex PROTO((void));
1466 /* Function of no arguments for initializing the symbol table. */
1467 extern void init_decl_processing PROTO((void));
1469 /* Functions called with no arguments at the beginning and end or processing
1470 the input source file. */
1471 extern void lang_init PROTO((void));
1472 extern void lang_finish PROTO((void));
1474 /* Funtion to identify which front-end produced the output file. */
1475 extern char *lang_identify PROTO((void));
1477 /* Function called with no arguments to parse and compile the input. */
1478 extern int yyparse PROTO((void));
1479 /* Function called with option as argument
1480 to decode options starting with -f or -W or +.
1481 It should return nonzero if it handles the option. */
1482 extern int lang_decode_option PROTO((char *));
1484 /* Functions for processing symbol declarations. */
1485 /* Function to enter a new lexical scope.
1486 Takes one argument: always zero when called from outside the front end. */
1487 extern void pushlevel PROTO((int));
1488 /* Function to exit a lexical scope. It returns a BINDING for that scope.
1489 Takes three arguments:
1490 KEEP -- nonzero if there were declarations in this scope.
1491 REVERSE -- reverse the order of decls before returning them.
1492 FUNCTIONBODY -- nonzero if this level is the body of a function. */
1493 extern tree poplevel PROTO((int, int, int));
1494 /* Set the BLOCK node for the current scope level. */
1495 extern void set_block PROTO((tree));
1496 /* Function to add a decl to the current scope level.
1497 Takes one argument, a decl to add.
1498 Returns that decl, or, if the same symbol is already declared, may
1499 return a different decl for that name. */
1500 extern tree pushdecl PROTO((tree));
1501 /* Function to return the chain of decls so far in the current scope level. */
1502 extern tree getdecls PROTO((void));
1503 /* Function to return the chain of structure tags in the current scope level. */
1504 extern tree gettags PROTO((void));
1506 extern tree build_range_type PROTO((tree, tree, tree));
1508 /* Call when starting to parse a declaration:
1509 make expressions in the declaration last the length of the function.
1510 Returns an argument that should be passed to resume_momentary later. */
1511 extern int suspend_momentary PROTO((void));
1513 extern int allocation_temporary_p PROTO((void));
1515 /* Call when finished parsing a declaration:
1516 restore the treatment of node-allocation that was
1517 in effect before the suspension.
1518 YES should be the value previously returned by suspend_momentary. */
1519 extern void resume_momentary PROTO((int));
1521 /* Called after finishing a record, union or enumeral type. */
1522 extern void rest_of_type_compilation PROTO((tree, int));
1524 /* Save the current set of obstacks, but don't change them. */
1525 extern void push_obstacks_nochange PROTO((void));
1527 extern void push_momentary PROTO((void));
1529 extern void clear_momentary PROTO((void));
1531 extern void pop_momentary PROTO((void));
1533 extern void end_temporary_allocation PROTO((void));
1535 /* Pop the obstack selection stack. */
1536 extern void pop_obstacks PROTO((void));