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
83 BUILT_IN_CLASSIFY_TYPE
,
87 BUILT_IN_FRAME_ADDRESS
,
88 BUILT_IN_RETURN_ADDRESS
,
89 BUILT_IN_CALLER_RETURN_ADDRESS
,
98 /* The definition of tree nodes fills the next several pages. */
100 /* A tree node can represent a data type, a variable, an expression
101 or a statement. Each node has a TREE_CODE which says what kind of
102 thing it represents. Some common codes are:
103 INTEGER_TYPE -- represents a type of integers.
104 ARRAY_TYPE -- represents a type of pointer.
105 VAR_DECL -- represents a declared variable.
106 INTEGER_CST -- represents a constant integer value.
107 PLUS_EXPR -- represents a sum (an expression).
109 As for the contents of a tree node: there are some fields
110 that all nodes share. Each TREE_CODE has various special-purpose
111 fields as well. The fields of a node are never accessed directly,
112 always through accessor macros. */
114 /* This type is used everywhere to refer to a tree node. */
116 typedef union tree_node
*tree
;
118 #define NULL_TREE (tree) NULL
120 /* Every kind of tree node starts with this structure,
121 so all nodes have these fields.
123 See the accessor macros, defined below, for documentation of the fields. */
127 union tree_node
*chain
;
128 union tree_node
*type
;
129 #ifdef ONLY_INT_FIELDS
130 unsigned int code
: 8;
132 enum tree_code code
: 8;
135 unsigned side_effects_flag
: 1;
136 unsigned constant_flag
: 1;
137 unsigned permanent_flag
: 1;
138 unsigned addressable_flag
: 1;
139 unsigned volatile_flag
: 1;
140 unsigned readonly_flag
: 1;
141 unsigned unsigned_flag
: 1;
142 unsigned asm_written_flag
: 1;
144 unsigned used_flag
: 1;
145 unsigned raises_flag
: 1;
146 unsigned static_flag
: 1;
147 unsigned public_flag
: 1;
148 unsigned private_flag
: 1;
149 unsigned protected_flag
: 1;
151 unsigned lang_flag_0
: 1;
152 unsigned lang_flag_1
: 1;
153 unsigned lang_flag_2
: 1;
154 unsigned lang_flag_3
: 1;
155 unsigned lang_flag_4
: 1;
156 unsigned lang_flag_5
: 1;
157 unsigned lang_flag_6
: 1;
158 /* There is room for two more flags. */
161 /* Define accessors for the fields that all tree nodes have
162 (though some fields are not used for all kinds of nodes). */
164 /* The tree-code says what kind of node it is.
165 Codes are defined in tree.def. */
166 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
167 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
169 /* In all nodes that are expressions, this is the data type of the expression.
170 In POINTER_TYPE nodes, this is the type that the pointer points to.
171 In ARRAY_TYPE nodes, this is the type of the elements. */
172 #define TREE_TYPE(NODE) ((NODE)->common.type)
174 /* Nodes are chained together for many purposes.
175 Types are chained together to record them for being output to the debugger
176 (see the function `chain_type').
177 Decls in the same scope are chained together to record the contents
179 Statement nodes for successive statements used to be chained together.
180 Often lists of things are represented by TREE_LIST nodes that
181 are chained together. */
183 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
185 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
186 that don't change the machine mode. */
188 #define STRIP_NOPS(EXP) \
189 while ((TREE_CODE (EXP) == NOP_EXPR \
190 || TREE_CODE (EXP) == CONVERT_EXPR \
191 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
192 && (TYPE_MODE (TREE_TYPE (EXP)) \
193 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
194 (EXP) = TREE_OPERAND (EXP, 0);
196 /* Define many boolean fields that all tree nodes have. */
198 /* In VAR_DECL nodes, nonzero means address of this is needed.
199 So it cannot be in a register.
200 In a FUNCTION_DECL, nonzero means its address is needed.
201 So it must be compiled even if it is an inline function.
202 In CONSTRUCTOR nodes, it means object constructed must be in memory.
203 In LABEL_DECL nodes, it means a goto for this label has been seen
204 from a place outside all binding contours that restore stack levels.
205 In ..._TYPE nodes, it means that objects of this type must
206 be fully addressable. This means that pieces of this
207 object cannot go into register parameters, for example.
208 In IDENTIFIER_NODEs, this means that some extern decl for this name
209 had its address taken. That matters for inline functions. */
210 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
212 /* In a VAR_DECL, nonzero means allocate static storage.
213 In a FUNCTION_DECL, currently nonzero if function has been defined.
214 In a CONSTRUCTOR, nonzero means allocate static storage. */
215 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
217 /* In a CONVERT_EXPR or NOP_EXPR, this means the node was made
218 implicitly and should not lead to an "unused value" warning. */
219 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
221 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
222 chain is via a `virtual' declaration. */
223 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
225 /* In a VAR_DECL or FUNCTION_DECL,
226 nonzero means name is to be accessible from outside this module.
227 In an identifier node, nonzero means a external declaration
228 accessible from outside this module was previously seen
229 for this name in an inner scope. */
230 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
232 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
233 base class is via a `public' declaration, which preserves public
234 fields from the base class as public. */
235 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
237 /* In any expression, nonzero means it has side effects or reevaluation
238 of the whole expression could produce a different value.
239 This is set if any subexpression is a function call, a side effect
240 or a reference to a volatile variable.
241 In a ..._DECL, this is set only if the declaration said `volatile'. */
242 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
244 /* Nonzero means this expression is volatile in the C sense:
245 its address should be of type `volatile WHATEVER *'.
246 In other words, the declared item is volatile qualified.
247 This is used in _DECL nodes and _REF nodes.
249 In a ..._TYPE node, means this type is volatile-qualified.
250 But use TYPE_VOLATILE instead of this macro when the node is a type,
251 because eventually we may make that a different bit.
253 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
254 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
256 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
257 nonzero means it may not be the lhs of an assignment.
258 In a ..._TYPE node, means this type is const-qualified
259 (but the macro TYPE_READONLY should be used instead of this macro
260 when the node is a type). */
261 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
263 /* Value of expression is constant.
264 Always appears in all ..._CST nodes.
265 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
266 if the value is constant. */
267 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
269 /* Nonzero means permanent node;
270 node will continue to exist for the entire compiler run.
271 Otherwise it will be recycled at the end of the function. */
272 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
274 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
275 In FIELD_DECL nodes, means an unsigned bit field.
276 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
277 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
279 /* Nonzero in a VAR_DECL means assembler code has been written.
280 Nonzero in a FUNCTION_DECL means that the function has been compiled.
281 This is interesting in an inline function, since it might not need
282 to be compiled separately.
283 Nonzero in a RECORD_TYPE, UNION_TYPE or ENUMERAL_TYPE
284 if the sdb debugging info for the type has been written. */
285 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
287 /* Nonzero in a _DECL if the name is used in its scope.
288 Nonzero in an expr node means inhibit warning if value is unused.
289 In IDENTIFIER_NODEs, this means that some extern decl for this name
291 #define TREE_USED(NODE) ((NODE)->common.used_flag)
293 /* Nonzero for a tree node whose evaluation could result
294 in the raising of an exception. Not implemented yet. */
295 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
297 /* These are currently used in classes in C++. */
298 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
299 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
301 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
302 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
303 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
304 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
305 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
306 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
307 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
309 /* Define additional fields and accessors for nodes representing constants. */
311 /* In an INTEGER_CST node. These two together make a 64 bit integer.
312 If the data type is signed, the value is sign-extended to 64 bits
313 even though not all of them may really be in use.
314 In an unsigned constant shorter than 64 bits, the extra bits are 0. */
315 #define TREE_INT_CST_LOW(NODE) ((NODE)->int_cst.int_cst_low)
316 #define TREE_INT_CST_HIGH(NODE) ((NODE)->int_cst.int_cst_high)
318 #define INT_CST_LT(A, B) \
319 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
320 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
321 && ((unsigned) TREE_INT_CST_LOW (A) < (unsigned) TREE_INT_CST_LOW (B))))
323 #define INT_CST_LT_UNSIGNED(A, B) \
324 ((unsigned) TREE_INT_CST_HIGH (A) < (unsigned) TREE_INT_CST_HIGH (B) \
325 || ((unsigned) TREE_INT_CST_HIGH (A) == (unsigned) TREE_INT_CST_HIGH (B) \
326 && ((unsigned) TREE_INT_CST_LOW (A) < (unsigned) TREE_INT_CST_LOW (B))))
330 char common
[sizeof (struct tree_common
)];
335 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
336 and generally in all kinds of constants that could
337 be given labels (rather than being immediate). */
339 #define TREE_CST_RTL(NODE) ((NODE)->real_cst.rtl)
341 /* In a REAL_CST node. */
342 /* We can represent a real value as either a `double' or a string.
343 Strings don't allow for any optimization, but they do allow
344 for cross-compilation. */
346 #define TREE_REAL_CST(NODE) ((NODE)->real_cst.real_cst)
352 char common
[sizeof (struct tree_common
)];
353 struct rtx_def
*rtl
; /* acts as link to register transfer language
355 REAL_VALUE_TYPE real_cst
;
358 /* In a STRING_CST */
359 #define TREE_STRING_LENGTH(NODE) ((NODE)->string.length)
360 #define TREE_STRING_POINTER(NODE) ((NODE)->string.pointer)
364 char common
[sizeof (struct tree_common
)];
365 struct rtx_def
*rtl
; /* acts as link to register transfer language
371 /* In a COMPLEX_CST node. */
372 #define TREE_REALPART(NODE) ((NODE)->complex.real)
373 #define TREE_IMAGPART(NODE) ((NODE)->complex.imag)
377 char common
[sizeof (struct tree_common
)];
378 struct rtx_def
*rtl
; /* acts as link to register transfer language
380 union tree_node
*real
;
381 union tree_node
*imag
;
384 /* Define fields and accessors for some special-purpose tree nodes. */
386 #define IDENTIFIER_LENGTH(NODE) ((NODE)->identifier.length)
387 #define IDENTIFIER_POINTER(NODE) ((NODE)->identifier.pointer)
388 #define IDENTIFIER_VIRTUAL_P(NODE) TREE_LANG_FLAG_1(NODE)
390 struct tree_identifier
392 char common
[sizeof (struct tree_common
)];
397 /* In a TREE_LIST node. */
398 #define TREE_PURPOSE(NODE) ((NODE)->list.purpose)
399 #define TREE_VALUE(NODE) ((NODE)->list.value)
403 char common
[sizeof (struct tree_common
)];
404 union tree_node
*purpose
;
405 union tree_node
*value
;
408 /* In a TREE_VEC node. */
409 #define TREE_VEC_LENGTH(NODE) ((NODE)->vec.length)
410 #define TREE_VEC_ELT(NODE,I) ((NODE)->vec.a[I])
411 #define TREE_VEC_END(NODE) (&((NODE)->vec.a[(NODE)->vec.length]))
415 char common
[sizeof (struct tree_common
)];
417 union tree_node
*a
[1];
420 /* Define fields and accessors for some nodes that represent expressions. */
422 /* In a SAVE_EXPR node. */
423 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
424 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
426 /* In a RTL_EXPR node. */
427 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[0])
428 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[1])
430 /* In a CALL_EXPR node. */
431 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
433 /* In a CONSTRUCTOR node. */
434 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
436 /* In a BLOCK node. */
437 #define BLOCK_VARS(NODE) ((NODE)->exp.operands[0])
438 #define BLOCK_TYPE_TAGS(NODE) ((NODE)->exp.operands[1])
439 #define BLOCK_SUBBLOCKS(NODE) ((NODE)->exp.operands[2])
440 #define BLOCK_SUPERCONTEXT(NODE) ((NODE)->exp.operands[3])
441 /* Note: when changing this, make sure to find the places
442 that use chainon or nreverse. */
443 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
445 /* Nonzero means that this block is prepared to handle exceptions
446 listed in the BLOCK_VARS slot. */
447 #define BLOCK_HANDLER_BLOCK(NODE) TREE_PROTECTED(NODE)
449 /* In ordinary expression nodes. */
450 #define TREE_OPERAND(NODE, I) ((NODE)->exp.operands[I])
451 #define TREE_COMPLEXITY(NODE) ((NODE)->exp.complexity)
455 char common
[sizeof (struct tree_common
)];
457 union tree_node
*operands
[1];
460 /* Define fields and accessors for nodes representing data types. */
462 /* See tree.def for documentation of the use of these fields.
463 Look at the documentation of the various ..._TYPE tree codes. */
465 #define TYPE_UID(NODE) ((NODE)->type.uid)
466 #define TYPE_SIZE(NODE) ((NODE)->type.size)
467 #define TYPE_MODE(NODE) ((NODE)->type.mode)
468 #define TYPE_VALUES(NODE) ((NODE)->type.values)
469 #define TYPE_DOMAIN(NODE) ((NODE)->type.values)
470 #define TYPE_FIELDS(NODE) ((NODE)->type.values)
471 #define TYPE_METHODS(NODE) ((NODE)->type.maxval)
472 #define TYPE_VFIELD(NODE) ((NODE)->type.minval)
473 #define TYPE_ARG_TYPES(NODE) ((NODE)->type.values)
474 #define TYPE_METHOD_BASETYPE(NODE) ((NODE)->type.maxval)
475 #define TYPE_OFFSET_BASETYPE(NODE) ((NODE)->type.maxval)
476 #define TYPE_POINTER_TO(NODE) ((NODE)->type.pointer_to)
477 #define TYPE_REFERENCE_TO(NODE) ((NODE)->type.reference_to)
478 #define TYPE_MIN_VALUE(NODE) ((NODE)->type.minval)
479 #define TYPE_MAX_VALUE(NODE) ((NODE)->type.maxval)
480 #define TYPE_PRECISION(NODE) ((NODE)->type.precision)
481 #define TYPE_PARSE_INFO(NODE) ((NODE)->type.parse_info)
482 #define TYPE_SYMTAB_ADDRESS(NODE) ((NODE)->type.symtab_address)
483 #define TYPE_NAME(NODE) ((NODE)->type.name)
484 #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant)
485 #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant)
486 #define TYPE_BINFO(NODE) ((NODE)->type.binfo)
487 #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts)
488 #define TYPE_CONTEXT(NODE) ((NODE)->type.context)
489 #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific)
491 /* The alignment necessary for objects of this type.
492 The value is an int, measured in bits. */
493 #define TYPE_ALIGN(NODE) ((NODE)->type.align)
495 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
497 /* In a RECORD_TYPE or UNION_TYPE, it means the type has BLKmode
498 only because it lacks the alignment requirement for its size. */
499 #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag)
501 /* Nonzero in a type considered volatile as a whole. */
502 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
504 /* Means this type is const-qualified. */
505 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
507 #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0)
508 #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1)
509 #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2)
510 #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3)
511 #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4)
512 #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5)
513 #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6)
517 char common
[sizeof (struct tree_common
)];
518 union tree_node
*values
;
519 union tree_node
*size
;
522 #ifdef ONLY_INT_FIELDS
525 enum machine_mode mode
: 8;
528 unsigned char precision
;
530 unsigned no_force_blk_flag
: 1;
531 unsigned lang_flag_0
: 1;
532 unsigned lang_flag_1
: 1;
533 unsigned lang_flag_2
: 1;
534 unsigned lang_flag_3
: 1;
535 unsigned lang_flag_4
: 1;
536 unsigned lang_flag_5
: 1;
537 unsigned lang_flag_6
: 1;
539 union tree_node
*pointer_to
;
540 union tree_node
*reference_to
;
543 union tree_node
*name
;
544 union tree_node
*minval
;
545 union tree_node
*maxval
;
546 union tree_node
*next_variant
;
547 union tree_node
*main_variant
;
548 union tree_node
*binfo
;
549 union tree_node
*noncopied_parts
;
550 union tree_node
*context
;
551 /* Points to a structure whose details depend on the language in use. */
552 struct lang_type
*lang_specific
;
555 /* Define accessor macros for information about type inheritance
558 A "basetype" means a particular usage of a data type for inheritance
559 in another type. Each such basetype usage has its own "binfo"
560 object to describe it. The binfo object is a TREE_VEC node.
562 Inheritance is represented by the binfo nodes allocated for a
563 given type. For example, given types C and D, such that D is
564 inherited by C, 3 binfo nodes will be allocated: one for describing
565 the binfo properties of C, similarly one for D, and one for
566 describing the binfo properties of D as a base type for C.
567 Thus, given a pointer to class C, one can get a pointer to the binfo
568 of D acting as a basetype for C by looking at C's binfo's basetypes. */
570 /* The actual data type node being inherited in this basetype. */
571 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
573 /* The offset where this basetype appears in its containing type.
574 BINFO_OFFSET slot holds the offset (in bytes)
575 from the base of the complete object to the base of the part of the
576 object that is allocated on behalf of this `type'.
577 This is always 0 except when there is multiple inheritance. */
579 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
580 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
581 #define BINFO_OFFSET_ZEROP(NODE) (BINFO_OFFSET (NODE) == integer_zero_node)
583 /* The virtual function table belonging to this basetype. Virtual
584 function tables provide a mechanism for run-time method dispatching.
585 The entries of a virtual function table are language-dependent. */
587 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
588 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
590 /* The virtual functions in the virtual function table. This is
591 a TREE_LIST that is used as an initial approximation for building
592 a virtual function table for this basetype. */
593 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
594 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
596 /* A vector of additional binfos for the types inherited by this basetype.
598 If this basetype describes type D as inherited in C,
599 and if the basetypes of D are E anf F,
600 then this vector contains binfos for inheritance of E and F by C.
602 ??? This could probably be done by just allocating the
603 base types at the end of this TREE_VEC (instead of using
604 another TREE_VEC). This would simplify the calculation
605 of how many basetypes a given type had. */
606 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
607 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
609 /* Accessor macro to get to the Nth basetype of this basetype. */
610 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
611 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
613 /* Slot used to build a chain that represents a use of inheritance.
614 For example, if X is derived from Y, and Y is derived from Z,
615 then this field can be used to link the binfo node for X to
616 the binfo node for X's Y to represent the use of inheritance
617 from X to Y. Similarly, this slot of the binfo node for X's Y
618 can point to the Z from which Y is inherited (in X's inheritance
619 hierarchy). In this fashion, one can represent and traverse specific
620 uses of inheritance using the binfo nodes themselves (instead of
621 consing new space pointing to binfo nodes).
622 It is up to the language-dependent front-ends to maintain
623 this information as necessary. */
624 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
626 /* Define fields and accessors for nodes representing declared names. */
628 /* This is the name of the object as written by the user.
629 It is an IDENTIFIER_NODE. */
630 #define DECL_NAME(NODE) ((NODE)->decl.name)
631 /* This macro is marked for death. */
632 #define DECL_PRINT_NAME(NODE) ((NODE)->decl.print_name)
633 /* This is the name of the object as the assembler will see it
634 (but before any translations made by ASM_OUTPUT_LABELREF).
635 Often this is the same as DECL_NAME.
636 It is an IDENTIFIER_NODE. */
637 #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name)
638 /* The containing binding context; either a BINDING
639 or a RECORD_TYPE or UNION_TYPE. */
640 #define DECL_CONTEXT(NODE) ((NODE)->decl.context)
641 #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context)
642 /* In a FIELD_DECL, this is the field position, counting in bits,
643 of the bit closest to the beginning of the structure. */
644 #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments)
645 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
646 if so, the type that was originally specified for it.
647 TREE_TYPE may have been modified (in finish_struct). */
648 #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result)
649 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
650 /* VAR_DECL and PARM_DECL reserve the arguments slot
651 for language-specific uses. */
652 #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments)
653 /* In FUNCTION_DECL, holds the decl for the return value. */
654 #define DECL_RESULT(NODE) ((NODE)->decl.result)
655 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
656 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result)
657 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
658 For a VAR_DECL, holds the initial value.
659 For a PARM_DECL, not used--default
660 values for parameters are encoded in the type of the function,
661 not in the PARM_DECL slot. */
662 #define DECL_INITIAL(NODE) ((NODE)->decl.initial)
663 /* For a PARM_DECL, records the data type used to pass the argument,
664 which may be different from the type seen in the program. */
665 #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */
666 /* These two fields describe where in the source code the declaration was. */
667 #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename)
668 #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum)
669 /* Holds the size of the datum, as a tree expression.
670 Need not be constant. */
671 #define DECL_SIZE(NODE) ((NODE)->decl.size)
672 /* Holds the alignment required for the datum. */
673 #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size)
674 /* Holds the machine mode of a variable or field. */
675 #define DECL_MODE(NODE) ((NODE)->decl.mode)
676 /* Holds the RTL expression for the value of a variable or function. */
677 #define DECL_RTL(NODE) ((NODE)->decl.rtl)
678 /* For PARM_DECL, holds an RTL for the stack slot or register
679 where the data was actually passed. */
680 #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r)
681 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
682 #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r)
683 /* For FUNCTION_DECL for built-in function. */
684 #define DECL_FUNCTION_CODE(NODE) \
685 ((enum built_in_function) (NODE)->decl.frame_size)
686 #define DECL_SET_FUNCTION_CODE(NODE,VAL) \
687 ((NODE)->decl.frame_size = (int) (VAL))
688 /* For FUNCTION_DECL, if it is inline,
689 holds the size of the stack frame, as an integer. */
690 #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size)
691 /* For a FIELD_DECL, holds the size of the member as an integer. */
692 #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i)
694 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
695 Before the struct containing the FUNCTION_DECL is laid out,
696 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
697 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
698 function. When the class is laid out, this pointer is changed
699 to an INTEGER_CST node which is suitable for use as an index
700 into the virtual function table. */
701 #define DECL_VINDEX(NODE) ((NODE)->decl.vindex)
702 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
703 which this FIELD_DECL is defined. This information is needed when
704 writing debugging information about vfield and vbase decls for C++. */
705 #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex)
707 /* Nonzero in a VAR_DECL or PARM_DECL means this decl was made by inlining;
708 suppress any warnings about shadowing some other variable. */
709 #define DECL_FROM_INLINE(NODE) ((NODE)->decl.from_inline_flag)
711 /* Nonzero if a _DECL means that the name of this decl should be ignored
712 for symbolic debug purposes. */
713 #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag)
715 #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific)
717 /* In a VAR_DECL or FUNCTION_DECL,
718 nonzero means external reference:
719 do not allocate storage, and refer to a definition elsewhere. */
720 #define TREE_EXTERNAL(NODE) ((NODE)->decl.external_flag)
722 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'.
723 In LABEL_DECL nodes, nonzero means that an error message about
724 jumping into such a binding contour has been printed for this label. */
725 #define TREE_REGDECL(NODE) ((NODE)->decl.regdecl_flag)
727 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
728 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
730 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
732 Also set in some languages for variables, etc., outside the normal
733 lexical scope, such as class instance variables. */
734 #define TREE_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag)
736 /* Nonzero in a FUNCTION_DECL means this function can be substituted
737 where it is called. */
738 #define TREE_INLINE(NODE) ((NODE)->decl.inline_flag)
740 /* Nonzero in a FUNCTION_DECL means this is a built-in function
741 that is not specified by ansi C and that users are supposed to be allowed
742 to redefine for any purpose whatever. */
743 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
745 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
747 #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag)
748 /* In a LABEL_DECL, nonzero means label was defined inside a binding
749 contour that restored a stack level and which is now exited. */
750 #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag)
751 /* In a FUNCTION_DECL, nonzero means a built in function. */
752 #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag)
754 /* In a METHOD_DECL, indicates a function for which each instance has a pointer. */
755 #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag)
756 /* In a FIELD_DECL, indicates this field should be bit-packed. */
757 #define DECL_PACKED(NODE) ((NODE)->decl.virtual_flag)
759 /* Additional flags for language-specific uses. */
760 #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0)
761 #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1)
762 #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2)
763 #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3)
764 #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4)
765 #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5)
766 #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6)
767 #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7)
771 char common
[sizeof (struct tree_common
)];
774 union tree_node
*size
;
775 #ifdef ONLY_INT_FIELDS
778 enum machine_mode mode
: 8;
781 unsigned external_flag
: 1;
782 unsigned nonlocal_flag
: 1;
783 unsigned regdecl_flag
: 1;
784 unsigned inline_flag
: 1;
785 unsigned bit_field_flag
: 1;
786 unsigned virtual_flag
: 1;
787 unsigned from_inline_flag
: 1;
788 unsigned ignored_flag
: 1;
790 unsigned lang_flag_0
: 1;
791 unsigned lang_flag_1
: 1;
792 unsigned lang_flag_2
: 1;
793 unsigned lang_flag_3
: 1;
794 unsigned lang_flag_4
: 1;
795 unsigned lang_flag_5
: 1;
796 unsigned lang_flag_6
: 1;
797 unsigned lang_flag_7
: 1;
799 union tree_node
*name
;
800 union tree_node
*context
;
801 union tree_node
*arguments
;
802 union tree_node
*result
;
803 union tree_node
*initial
;
804 /* The PRINT_NAME field is marked for death. */
806 union tree_node
*assembler_name
;
807 struct rtx_def
*rtl
; /* acts as link to register transfer language
809 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
810 If built-in, this is the code for which built-in function. */
812 /* For FUNCTION_DECLs: points to insn that constitutes its definition
813 on the permanent obstack. For any other kind of decl, this is the
819 union tree_node
*vindex
;
820 /* Points to a structure whose details depend on the language in use. */
821 struct lang_decl
*lang_specific
;
824 /* Define the overall contents of a tree node.
825 It may be any of the structures declared above
826 for various types of node. */
830 struct tree_common common
;
831 struct tree_int_cst int_cst
;
832 struct tree_real_cst real_cst
;
833 struct tree_string string
;
834 struct tree_complex
complex;
835 struct tree_identifier identifier
;
836 struct tree_decl decl
;
837 struct tree_type type
;
838 struct tree_list list
;
843 /* Format for global names of constructor and destructor functions. */
844 #ifndef NO_DOLLAR_IN_LABEL
845 #define CONSTRUCTOR_NAME_FORMAT "_GLOBAL_$I$%s"
847 #define CONSTRUCTOR_NAME_FORMAT "_GLOBAL_.I.%s"
850 extern char *oballoc ();
851 extern char *permalloc ();
852 extern char *savealloc ();
854 /* Lowest level primitive for allocating a node.
855 The TREE_CODE is the only argument. Contents are initialized
856 to zero except for a few of the common fields. */
858 extern tree
make_node ();
860 /* Make a copy of a node, with all the same contents except
861 for TREE_PERMANENT. (The copy is permanent
862 iff nodes being made now are permanent.) */
864 extern tree
copy_node ();
866 /* Make a copy of a chain of TREE_LIST nodes. */
868 extern tree
copy_list ();
870 /* Make a TREE_VEC. */
872 extern tree
make_tree_vec ();
874 /* Return the (unique) IDENTIFIER_NODE node for a given name.
875 The name is supplied as a char *. */
877 extern tree
get_identifier ();
879 /* Construct various types of nodes. */
881 extern tree
build_int_2 ();
882 extern tree
build_real ();
883 extern tree
build_real_from_string ();
884 extern tree
build_real_from_int_cst ();
885 extern tree
build_complex ();
886 extern tree
build_string ();
887 extern tree
build (), build1 ();
888 extern tree
build_nt (), build_parse_node ();
889 extern tree
build_tree_list (), build_decl_list ();
890 extern tree
build_op_identifier ();
891 extern tree
build_decl ();
892 extern tree
build_block ();
894 /* Construct various nodes representing data types. */
896 extern tree
make_signed_type ();
897 extern tree
make_unsigned_type ();
898 extern tree
signed_or_unsigned_type ();
899 extern void fixup_unsigned_type ();
900 extern tree
build_pointer_type ();
901 extern tree
build_reference_type ();
902 extern tree
build_index_type (), build_index_2_type ();
903 extern tree
build_array_type ();
904 extern tree
build_function_type ();
905 extern tree
build_method_type ();
906 extern tree
build_offset_type ();
907 extern tree
build_complex_type ();
908 extern tree
array_type_nelts ();
910 /* Construct expressions, performing type checking. */
912 extern tree
build_binary_op ();
913 extern tree
build_indirect_ref ();
914 extern tree
build_unary_op ();
916 /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
917 for the same kind of data as TYPE describes.
918 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
919 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
920 so that duplicate variants are never made.
921 Only main variants should ever appear as types of expressions. */
923 extern tree
build_type_variant ();
925 /* Make a copy of a type node. */
927 extern tree
build_type_copy ();
929 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
930 TYPE_ALIGN and TYPE_MODE fields.
931 If called more than once on one node, does nothing except
932 for the first time. */
934 extern void layout_type ();
936 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
937 return a canonicalized ..._TYPE node, so that duplicates are not made.
938 How the hash code is computed is up to the caller, as long as any two
939 callers that could hash identical-looking type nodes agree. */
941 extern tree
type_hash_canon ();
943 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
944 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
945 fields. Call this only once for any given decl node.
947 Second argument is the boundary that this field can be assumed to
948 be starting at (in bits). Zero means it can be assumed aligned
949 on any boundary that may be needed. */
951 extern void layout_decl ();
953 /* Fold constants as much as possible in an expression.
954 Returns the simplified expression.
955 Acts only on the top level of the expression;
956 if the argument itself cannot be simplified, its
957 subexpressions are not changed. */
961 /* Return an expr equal to X but certainly not valid as an lvalue. */
963 extern tree
non_lvalue ();
965 extern tree
convert ();
966 extern tree
size_in_bytes ();
967 extern tree
size_binop ();
968 extern tree
size_int ();
969 extern tree
round_up ();
970 extern tree
get_pending_sizes ();
971 extern tree
get_permanent_types (), get_temporary_types ();
973 /* Type for sizes of data-type. */
975 extern tree sizetype
;
977 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
978 by making the last node in X point to Y.
979 Returns X, except if X is 0 returns Y. */
981 extern tree
chainon ();
983 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
985 extern tree
tree_cons (), perm_tree_cons (), temp_tree_cons ();
986 extern tree
saveable_tree_cons (), decl_tree_cons ();
988 /* Return the last tree node in a chain. */
990 extern tree
tree_last ();
992 /* Reverse the order of elements in a chain, and return the new head. */
994 extern tree
nreverse ();
996 /* Make a copy of a chain of tree nodes. */
998 extern tree
copy_chain ();
1000 /* Returns the length of a chain of nodes
1001 (number of chain pointers to follow before reaching a null pointer). */
1003 extern int list_length ();
1005 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1007 extern int integer_zerop ();
1009 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1011 extern int integer_onep ();
1013 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1014 all of whose significant bits are 1. */
1016 extern int integer_all_onesp ();
1018 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1019 exactly one bit 1. */
1021 extern int integer_pow2p ();
1023 /* type_unsigned_p (tree x) is nonzero if the type X is an unsigned type
1024 (all of its possible values are >= 0).
1025 If X is a pointer type, the value is 1.
1026 If X is a real type, the value is 0. */
1028 extern int type_unsigned_p ();
1030 /* staticp (tree x) is nonzero if X is a reference to data allocated
1031 at a fixed address in memory. */
1033 extern int staticp ();
1035 /* Gets an error if argument X is not an lvalue.
1036 Also returns 1 if X is an lvalue, 0 if not. */
1038 extern int lvalue_or_else ();
1040 /* save_expr (EXP) returns an expression equivalent to EXP
1041 but it can be used multiple times within context CTX
1042 and only evaluate EXP once. */
1044 extern tree
save_expr ();
1046 /* variable_size (EXP) is like save_expr (EXP) except that it
1047 is for the special case of something that is part of a
1048 variable size for a data type. It makes special arrangements
1049 to compute the value at the right time when the data type
1050 belongs to a function parameter. */
1052 extern tree
variable_size ();
1054 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1055 but it can be used multiple times
1056 and only evaluate the subexpressions once. */
1058 extern tree
stabilize_reference ();
1060 /* Return EXP, stripped of any conversions to wider types
1061 in such a way that the result of converting to type FOR_TYPE
1062 is the same as if EXP were converted to FOR_TYPE.
1063 If FOR_TYPE is 0, it signifies EXP's type. */
1065 extern tree
get_unwidened ();
1067 /* Return OP or a simpler expression for a narrower value
1068 which can be sign-extended or zero-extended to give back OP.
1069 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1070 or 0 if the value should be sign-extended. */
1072 extern tree
get_narrower ();
1074 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1076 The definition of this resides in language-specific code
1077 as the repertoire of available types may vary. */
1079 extern tree
type_for_mode ();
1081 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1082 for an integer type with at least that precision.
1083 The definition of this resides in language-specific code
1084 as the repertoire of available types may vary. */
1086 extern tree
type_for_size ();
1088 /* Given an integer type T, return a type like T but unsigned.
1089 If T is unsigned, the value is T.
1090 The definition of this resides in language-specific code
1091 as the repertoire of available types may vary. */
1093 extern tree
unsigned_type ();
1095 /* Given an integer type T, return a type like T but signed.
1096 If T is signed, the value is T.
1097 The definition of this resides in language-specific code
1098 as the repertoire of available types may vary. */
1100 extern tree
signed_type ();
1102 /* This function must be defined in the language-specific files.
1103 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1104 This is defined in a language-specific file. */
1106 extern tree
maybe_build_cleanup ();
1108 /* Return the floating type node for a given floating machine mode. */
1110 extern tree
get_floating_type ();
1112 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1113 look for nested component-refs or array-refs at constant positions
1114 and find the ultimate containing object, which is returned. */
1116 extern tree
get_inner_reference ();
1118 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1120 extern tree
decl_function_context ();
1122 /* Return the RECORD_TYPE or UNION_TYPE which provides this _DECL
1123 with its context, or zero if none. */
1124 extern tree
decl_type_context ();
1126 /* Given the FUNCTION_DECL for the current function,
1127 return zero if it is ok for this function to be inline.
1128 Otherwise return a warning message with a single %s
1129 for the function's name. */
1131 extern char *function_cannot_inline_p ();
1133 /* Declare commonly used variables for tree structure. */
1135 /* An integer constant with value 0 */
1136 extern tree integer_zero_node
;
1138 /* An integer constant with value 1 */
1139 extern tree integer_one_node
;
1141 /* An integer constant with value 0 whose type is sizetype. */
1142 extern tree size_zero_node
;
1144 /* An integer constant with value 1 whose type is sizetype. */
1145 extern tree size_one_node
;
1147 /* A constant of type pointer-to-int and value 0 */
1148 extern tree null_pointer_node
;
1150 /* A node of type ERROR_MARK. */
1151 extern tree error_mark_node
;
1153 /* The type node for the void type. */
1154 extern tree void_type_node
;
1156 /* The type node for the ordinary (signed) integer type. */
1157 extern tree integer_type_node
;
1159 /* The type node for the unsigned integer type. */
1160 extern tree unsigned_type_node
;
1162 /* The type node for the ordinary character type. */
1163 extern tree char_type_node
;
1165 /* Points to the name of the input file from which the current input
1166 being parsed originally came (before it went into cpp). */
1167 extern char *input_filename
;
1169 /* Current line number in input file. */
1172 /* Nonzero for -pedantic switch: warn about anything
1173 that standard C forbids. */
1174 extern int pedantic
;
1176 /* Nonzero means can safely call expand_expr now;
1177 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1179 extern int immediate_size_expand
;
1181 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1183 extern tree current_function_decl
;
1185 /* Nonzero if function being compiled can call setjmp. */
1187 extern int current_function_calls_setjmp
;
1189 /* Nonzero if function being compiled can call longjmp. */
1191 extern int current_function_calls_longjmp
;
1193 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1195 extern int all_types_permanent
;
1197 /* Pointer to function to compute the name to use to print a declaration. */
1199 extern char *(*decl_printable_name
) ();
1202 extern tree
make_tree ();
1206 extern tree
expand_start_stmt_expr ();
1207 extern tree
expand_end_stmt_expr ();
1208 extern void expand_expr_stmt (), clear_last_expr ();
1209 extern void expand_label (), expand_goto (), expand_asm ();
1210 extern void expand_start_cond (), expand_end_cond ();
1211 extern void expand_start_else (), expand_start_elseif ();
1212 extern struct nesting
*expand_start_loop ();
1213 extern struct nesting
*expand_start_loop_continue_elsewhere ();
1214 extern void expand_loop_continue_here ();
1215 extern void expand_end_loop ();
1216 extern int expand_continue_loop ();
1217 extern int expand_exit_loop (), expand_exit_loop_if_false ();
1218 extern int expand_exit_something ();
1220 extern void expand_start_delayed_expr ();
1221 extern tree
expand_end_delayed_expr ();
1222 extern void expand_emit_delayed_expr ();
1224 extern void expand_null_return (), expand_return ();
1225 extern void expand_start_bindings (), expand_end_bindings ();
1226 extern tree
last_cleanup_this_contour ();
1227 extern void expand_start_case (), expand_end_case ();
1228 extern int pushcase (), pushcase_range ();
1229 extern void expand_start_function (), expand_end_function ();
1231 /* In fold-const.c */
1233 extern tree
invert_truthvalue ();
1235 /* The language front-end must define these functions. */
1237 /* Function of no arguments for initializing lexical scanning. */
1238 extern void init_lex ();
1239 /* Function of no arguments for initializing the symbol table. */
1240 extern void init_decl_processing ();
1242 /* Functions called with no arguments at the beginning and end or processing
1243 the input source file. */
1244 extern void lang_init ();
1245 extern void lang_finish ();
1247 /* Function called with no arguments to parse and compile the input. */
1248 extern int yyparse ();
1249 /* Function called with option as argument
1250 to decode options starting with -f or -W or +.
1251 It should return nonzero if it handles the option. */
1252 extern int lang_decode_option ();
1254 /* Functions for processing symbol declarations. */
1255 /* Function to enter a new lexical scope.
1256 Takes one argument: always zero when called from outside the front end. */
1257 extern void pushlevel ();
1258 /* Function to exit a lexical scope. It returns a BINDING for that scope.
1259 Takes three arguments:
1260 KEEP -- nonzero if there were declarations in this scope.
1261 REVERSE -- reverse the order of decls before returning them.
1262 FUNCTIONBODY -- nonzero if this level is the body of a function. */
1263 extern tree
poplevel ();
1264 /* Function to add a decl to the current scope level.
1265 Takes one argument, a decl to add.
1266 Returns that decl, or, if the same symbol is already declared, may
1267 return a different decl for that name. */
1268 extern tree
pushdecl ();
1269 /* Function to return the chain of decls so far in the current scope level. */
1270 extern tree
getdecls ();
1271 /* Function to return the chain of structure tags in the current scope level. */
1272 extern tree
gettags ();