Call fatal_insn_not_found instead of abort
[official-gcc.git] / gcc / tree.h
blob6a88bee3ede8b168c0cc23a4dc239d2775ac88ef
1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 93, 94, 95, 96, 97, 1998 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)
9 any later version.
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, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
21 #include "machmode.h"
23 #ifndef RTX_CODE
24 struct rtx_def;
25 #endif
27 /* Codes of tree nodes */
29 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
31 enum tree_code {
32 #include "tree.def"
34 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
35 NUM_TREE_CODE. */
38 #undef DEFTREECODE
40 /* Number of tree codes. */
41 #define NUM_TREE_CODES ((int)LAST_AND_UNUSED_TREE_CODE)
43 /* Indexed by enum tree_code, contains a character which is
44 `<' for a comparison expression, `1', for a unary arithmetic
45 expression, `2' for a binary arithmetic expression, `e' for
46 other types of expressions, `r' for a reference, `c' for a
47 constant, `d' for a decl, `t' for a type, `s' for a statement,
48 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
50 #define MAX_TREE_CODES 256
51 extern char tree_code_type[MAX_TREE_CODES];
52 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
54 /* Returns non-zero iff CLASS is the tree-code class of an
55 expression. */
57 #define IS_EXPR_CODE_CLASS(CLASS) \
58 (CLASS == '<' || CLASS == '1' || CLASS == '2' || CLASS == 'e')
60 /* Number of argument-words in each kind of tree-node. */
62 extern int tree_code_length[MAX_TREE_CODES];
64 /* Names of tree components. */
66 extern char *tree_code_name[MAX_TREE_CODES];
68 /* Codes that identify the various built in functions
69 so that expand_call can identify them quickly. */
71 enum built_in_function
73 NOT_BUILT_IN,
74 BUILT_IN_ALLOCA,
75 BUILT_IN_ABS,
76 BUILT_IN_FABS,
77 BUILT_IN_LABS,
78 BUILT_IN_FFS,
79 BUILT_IN_DIV,
80 BUILT_IN_LDIV,
81 BUILT_IN_FFLOOR,
82 BUILT_IN_FCEIL,
83 BUILT_IN_FMOD,
84 BUILT_IN_FREM,
85 BUILT_IN_MEMCPY,
86 BUILT_IN_MEMCMP,
87 BUILT_IN_MEMSET,
88 BUILT_IN_STRCPY,
89 BUILT_IN_STRCMP,
90 BUILT_IN_STRLEN,
91 BUILT_IN_FSQRT,
92 BUILT_IN_SIN,
93 BUILT_IN_COS,
94 BUILT_IN_GETEXP,
95 BUILT_IN_GETMAN,
96 BUILT_IN_SAVEREGS,
97 BUILT_IN_CLASSIFY_TYPE,
98 BUILT_IN_NEXT_ARG,
99 BUILT_IN_ARGS_INFO,
100 BUILT_IN_CONSTANT_P,
101 BUILT_IN_FRAME_ADDRESS,
102 BUILT_IN_RETURN_ADDRESS,
103 BUILT_IN_AGGREGATE_INCOMING_ADDRESS,
104 BUILT_IN_CALLER_RETURN_ADDRESS,
105 BUILT_IN_APPLY_ARGS,
106 BUILT_IN_APPLY,
107 BUILT_IN_RETURN,
108 BUILT_IN_SETJMP,
109 BUILT_IN_LONGJMP,
110 BUILT_IN_TRAP,
112 /* Various hooks for the DWARF 2 __throw routine. */
113 BUILT_IN_FP, BUILT_IN_SP,
114 BUILT_IN_UNWIND_INIT,
115 BUILT_IN_DWARF_FP_REGNUM,
116 BUILT_IN_DWARF_REG_SIZE,
117 BUILT_IN_FROB_RETURN_ADDR,
118 BUILT_IN_EXTRACT_RETURN_ADDR,
119 BUILT_IN_SET_RETURN_ADDR_REG,
120 BUILT_IN_EH_STUB_OLD,
121 BUILT_IN_EH_STUB,
122 BUILT_IN_SET_EH_REGS,
124 /* C++ extensions */
125 BUILT_IN_NEW,
126 BUILT_IN_VEC_NEW,
127 BUILT_IN_DELETE,
128 BUILT_IN_VEC_DELETE,
130 /* Upper bound on non-language-specific builtins. */
131 END_BUILTINS
134 /* The definition of tree nodes fills the next several pages. */
136 /* A tree node can represent a data type, a variable, an expression
137 or a statement. Each node has a TREE_CODE which says what kind of
138 thing it represents. Some common codes are:
139 INTEGER_TYPE -- represents a type of integers.
140 ARRAY_TYPE -- represents a type of pointer.
141 VAR_DECL -- represents a declared variable.
142 INTEGER_CST -- represents a constant integer value.
143 PLUS_EXPR -- represents a sum (an expression).
145 As for the contents of a tree node: there are some fields
146 that all nodes share. Each TREE_CODE has various special-purpose
147 fields as well. The fields of a node are never accessed directly,
148 always through accessor macros. */
150 /* This type is used everywhere to refer to a tree node. */
152 typedef union tree_node *tree;
154 /* Every kind of tree node starts with this structure,
155 so all nodes have these fields.
157 See the accessor macros, defined below, for documentation of the fields. */
159 struct tree_common
161 union tree_node *chain;
162 union tree_node *type;
163 #ifdef ONLY_INT_FIELDS
164 unsigned int code : 8;
165 #else
166 enum tree_code code : 8;
167 #endif
169 unsigned side_effects_flag : 1;
170 unsigned constant_flag : 1;
171 unsigned permanent_flag : 1;
172 unsigned addressable_flag : 1;
173 unsigned volatile_flag : 1;
174 unsigned readonly_flag : 1;
175 unsigned unsigned_flag : 1;
176 unsigned asm_written_flag: 1;
178 unsigned used_flag : 1;
179 unsigned raises_flag : 1;
180 unsigned static_flag : 1;
181 unsigned public_flag : 1;
182 unsigned private_flag : 1;
183 unsigned protected_flag : 1;
185 unsigned lang_flag_0 : 1;
186 unsigned lang_flag_1 : 1;
187 unsigned lang_flag_2 : 1;
188 unsigned lang_flag_3 : 1;
189 unsigned lang_flag_4 : 1;
190 unsigned lang_flag_5 : 1;
191 unsigned lang_flag_6 : 1;
192 /* There is room for three more flags. */
195 /* The following table lists the uses of each of the above flags and
196 for which types of nodes they are defined. Note that expressions
197 include decls.
199 addressable_flag:
201 TREE_ADDRESSABLE in
202 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
203 IDENTIFIER_NODE
205 static_flag:
207 TREE_STATIC in
208 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
209 TREE_NO_UNUSED_WARNING in
210 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
211 TREE_VIA_VIRTUAL in
212 TREE_LIST or TREE_VEC
213 TREE_CONSTANT_OVERFLOW in
214 INTEGER_CST, REAL_CST, COMPLEX_CST
215 TREE_SYMBOL_REFERENCED in
216 IDENTIFIER_NODE
218 public_flag:
220 TREE_OVERFLOW in
221 INTEGER_CST, REAL_CST, COMPLEX_CST
222 TREE_PUBLIC in
223 VAR_DECL or FUNCTION_DECL
224 TREE_VIA_PUBLIC in
225 TREE_LIST or TREE_VEC
227 private_flag:
229 TREE_VIA_PRIVATE in
230 TREE_LIST or TREE_VEC
231 TREE_PRIVATE in
232 ??? unspecified nodes
234 protected_flag:
236 TREE_VIA_PROTECTED in
237 TREE_LIST
238 TREE_PROTECTED in
239 BLOCK
240 ??? unspecified nodes
242 side_effects_flag:
244 TREE_SIDE_EFFECTS in
245 all expressions
247 volatile_flag:
249 TREE_THIS_VOLATILE in
250 all expressions
251 TYPE_VOLATILE in
252 ..._TYPE
254 readonly_flag:
256 TREE_READONLY in
257 all expressions
258 ITERATOR_BOUND_P in
259 VAR_DECL if iterator (C)
260 TYPE_READONLY in
261 ..._TYPE
263 constant_flag:
265 TREE_CONSTANT in
266 all expressions
268 permanent_flag: TREE_PERMANENT in all nodes
270 unsigned_flag:
272 TREE_UNSIGNED in
273 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
274 DECL_BUILT_IN_NONANSI in
275 FUNCTION_DECL
276 TREE_PARMLIST in
277 TREE_PARMLIST (C++)
278 SAVE_EXPR_NOPLACEHOLDER in
279 SAVE_EXPR
281 asm_written_flag:
283 TREE_ASM_WRITTEN in
284 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
285 BLOCK
287 used_flag:
289 TREE_USED in
290 expressions, IDENTIFIER_NODE
292 raises_flag:
294 TREE_RAISES in
295 expressions
298 /* Define accessors for the fields that all tree nodes have
299 (though some fields are not used for all kinds of nodes). */
301 /* The tree-code says what kind of node it is.
302 Codes are defined in tree.def. */
303 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
304 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
306 /* When checking is enabled, errors will be generated if a tree node
307 is accessed incorrectly. The macros abort with a fatal error,
308 except for the *1 variants, which just return 0 on failure. The
309 latter variants should only be used for combination checks, which
310 succeed when one of the checks succeed. The CHAIN_CHECK macro helps
311 defining such checks. */
313 #ifdef ENABLE_CHECKING
314 #define DO_CHECK(FUNC, t, param) FUNC (t, param, __FILE__, __LINE__, 0)
315 #define DO_CHECK1(FUNC, t, param) FUNC (t, param, __FILE__, __LINE__, 1)
316 #define CHAIN_CHECK(t, c1, c2) (c1 (t) ? t : c2 (t))
317 #else
318 #define DO_CHECK(FUNC, t, param) (t)
319 #define DO_CHECK1(FUNC, t, param) (t)
320 #define CHAIN_CHECK(t, c1, c2) (t)
321 #endif
323 #define TREE_CHECK(t, code) DO_CHECK (tree_check, t, code)
324 #define TREE_CHECK1(t, code) DO_CHECK1 (tree_check, t, code)
326 #include "tree-check.h"
328 #define TYPE_CHECK(t) DO_CHECK (tree_class_check, t, 't')
329 #define TYPE_CHECK1(t) DO_CHECK1 (tree_class_check, t, 't')
330 #define DECL_CHECK(t) DO_CHECK (tree_class_check, t, 'd')
331 #define DECL_CHECK1(t) DO_CHECK1 (tree_class_check, t, 'd')
332 #define CST_CHECK(t) DO_CHECK (tree_class_check, t, 'c')
333 #define CST_CHECK1(t) DO_CHECK1 (tree_class_check, t, 'c')
334 #define EXPR_CHECK(t) DO_CHECK (expr_check, t, 0)
336 /* Chained checks. The last check has to succeed, the others may fail. */
337 #define CST_OR_CONSTRUCTOR_CHECK(t) \
338 CHAIN_CHECK (t, CST_CHECK1, CONSTRUCTOR_CHECK)
340 /* In all nodes that are expressions, this is the data type of the expression.
341 In POINTER_TYPE nodes, this is the type that the pointer points to.
342 In ARRAY_TYPE nodes, this is the type of the elements. */
343 #define TREE_TYPE(NODE) ((NODE)->common.type)
345 /* Nodes are chained together for many purposes.
346 Types are chained together to record them for being output to the debugger
347 (see the function `chain_type').
348 Decls in the same scope are chained together to record the contents
349 of the scope.
350 Statement nodes for successive statements used to be chained together.
351 Often lists of things are represented by TREE_LIST nodes that
352 are chained together. */
354 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
356 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
357 that don't change the machine mode. */
359 #define STRIP_NOPS(EXP) \
360 while ((TREE_CODE (EXP) == NOP_EXPR \
361 || TREE_CODE (EXP) == CONVERT_EXPR \
362 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
363 && (TYPE_MODE (TREE_TYPE (EXP)) \
364 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
365 (EXP) = TREE_OPERAND (EXP, 0);
367 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
369 #define STRIP_TYPE_NOPS(EXP) \
370 while ((TREE_CODE (EXP) == NOP_EXPR \
371 || TREE_CODE (EXP) == CONVERT_EXPR \
372 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
373 && (TREE_TYPE (EXP) \
374 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
375 (EXP) = TREE_OPERAND (EXP, 0);
377 /* Nonzero if TYPE represents an integral type. Note that we do not
378 include COMPLEX types here. */
380 #define INTEGRAL_TYPE_P(TYPE) \
381 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
382 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
384 /* Nonzero if TYPE represents a floating-point type, including complex
385 floating-point types. */
387 #define FLOAT_TYPE_P(TYPE) \
388 (TREE_CODE (TYPE) == REAL_TYPE \
389 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
390 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
392 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
394 #define AGGREGATE_TYPE_P(TYPE) \
395 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
396 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
397 || TREE_CODE (TYPE) == SET_TYPE)
399 /* Nonzero if TYPE represents a pointer type. */
401 #define POINTER_TYPE_P(TYPE) \
402 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
404 /* Define many boolean fields that all tree nodes have. */
406 /* In VAR_DECL nodes, nonzero means address of this is needed.
407 So it cannot be in a register.
408 In a FUNCTION_DECL, nonzero means its address is needed.
409 So it must be compiled even if it is an inline function.
410 In CONSTRUCTOR nodes, it means object constructed must be in memory.
411 In LABEL_DECL nodes, it means a goto for this label has been seen
412 from a place outside all binding contours that restore stack levels.
413 In ..._TYPE nodes, it means that objects of this type must
414 be fully addressable. This means that pieces of this
415 object cannot go into register parameters, for example.
416 In IDENTIFIER_NODEs, this means that some extern decl for this name
417 had its address taken. That matters for inline functions. */
418 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
420 /* In a VAR_DECL, nonzero means allocate static storage.
421 In a FUNCTION_DECL, nonzero if function has been defined.
422 In a CONSTRUCTOR, nonzero means allocate static storage. */
423 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
425 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
426 made implicitly and should not lead to an "unused value" warning. */
427 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
429 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
430 chain is via a `virtual' declaration. */
431 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
433 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
434 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
435 requires a diagnostic when overflows occur in constant expressions. */
436 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
438 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
439 this string as an argument. */
440 #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
442 /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
443 overflow in folding, and no warning has been issued for this subexpression.
444 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
445 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
447 /* In a VAR_DECL or FUNCTION_DECL,
448 nonzero means name is to be accessible from outside this module.
449 In an identifier node, nonzero means an external declaration
450 accessible from outside this module was previously seen
451 for this name in an inner scope. */
452 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
454 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
455 base class is via a `public' declaration, which preserves public
456 fields from the base class as public. */
457 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
459 /* Ditto, for `private' declarations. */
460 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
462 /* Nonzero for TREE_LIST node means that the path to the
463 base class is via a `protected' declaration, which preserves
464 protected fields from the base class as protected.
465 OVERLOADED. */
466 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
468 /* In any expression, nonzero means it has side effects or reevaluation
469 of the whole expression could produce a different value.
470 This is set if any subexpression is a function call, a side effect
471 or a reference to a volatile variable.
472 In a ..._DECL, this is set only if the declaration said `volatile'. */
473 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
475 /* Nonzero means this expression is volatile in the C sense:
476 its address should be of type `volatile WHATEVER *'.
477 In other words, the declared item is volatile qualified.
478 This is used in _DECL nodes and _REF nodes.
480 In a ..._TYPE node, means this type is volatile-qualified.
481 But use TYPE_VOLATILE instead of this macro when the node is a type,
482 because eventually we may make that a different bit.
484 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
485 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
487 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
488 nonzero means it may not be the lhs of an assignment.
489 In a ..._TYPE node, means this type is const-qualified
490 (but the macro TYPE_READONLY should be used instead of this macro
491 when the node is a type). */
492 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
494 /* Value of expression is constant.
495 Always appears in all ..._CST nodes.
496 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
497 if the value is constant. */
498 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
500 /* Nonzero means permanent node;
501 node will continue to exist for the entire compiler run.
502 Otherwise it will be recycled at the end of the function. */
503 #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
505 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
506 In FIELD_DECL nodes, means an unsigned bit field.
507 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
508 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
510 /* Nonzero in a VAR_DECL means assembler code has been written.
511 Nonzero in a FUNCTION_DECL means that the function has been compiled.
512 This is interesting in an inline function, since it might not need
513 to be compiled separately.
514 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
515 if the sdb debugging info for the type has been written.
516 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
517 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
519 /* Nonzero in a _DECL if the name is used in its scope.
520 Nonzero in an expr node means inhibit warning if value is unused.
521 In IDENTIFIER_NODEs, this means that some extern decl for this name
522 was used. */
523 #define TREE_USED(NODE) ((NODE)->common.used_flag)
525 /* Nonzero for a tree node whose evaluation could result
526 in the raising of an exception. Not implemented yet. */
527 #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
529 /* Used in classes in C++. */
530 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
531 /* Used in classes in C++.
532 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
533 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
535 /* These flags are available for each language front end to use internally. */
536 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
537 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
538 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
539 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
540 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
541 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
542 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
544 /* Define additional fields and accessors for nodes representing constants. */
546 /* In an INTEGER_CST node. These two together make a 2-word integer.
547 If the data type is signed, the value is sign-extended to 2 words
548 even though not all of them may really be in use.
549 In an unsigned constant shorter than 2 words, the extra bits are 0. */
550 #define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low)
551 #define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high)
553 #define INT_CST_LT(A, B) \
554 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
555 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
556 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
557 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
559 #define INT_CST_LT_UNSIGNED(A, B) \
560 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
561 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
562 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
563 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
564 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
565 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
567 struct tree_int_cst
569 char common[sizeof (struct tree_common)];
570 struct rtx_def *rtl; /* acts as link to register transfer language
571 (rtl) info */
572 HOST_WIDE_INT int_cst_low;
573 HOST_WIDE_INT int_cst_high;
576 /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
577 and generally in all kinds of constants that could
578 be given labels (rather than being immediate). */
580 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
582 /* In a REAL_CST node. */
583 /* We can represent a real value as either a `double' or a string.
584 Strings don't allow for any optimization, but they do allow
585 for cross-compilation. */
587 #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
589 #include "real.h"
591 struct tree_real_cst
593 char common[sizeof (struct tree_common)];
594 struct rtx_def *rtl; /* acts as link to register transfer language
595 (rtl) info */
596 REAL_VALUE_TYPE real_cst;
599 /* In a STRING_CST */
600 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
601 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
603 struct tree_string
605 char common[sizeof (struct tree_common)];
606 struct rtx_def *rtl; /* acts as link to register transfer language
607 (rtl) info */
608 int length;
609 char *pointer;
612 /* In a COMPLEX_CST node. */
613 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
614 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
616 struct tree_complex
618 char common[sizeof (struct tree_common)];
619 struct rtx_def *rtl; /* acts as link to register transfer language
620 (rtl) info */
621 union tree_node *real;
622 union tree_node *imag;
625 /* Define fields and accessors for some special-purpose tree nodes. */
627 #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
628 #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
630 struct tree_identifier
632 char common[sizeof (struct tree_common)];
633 int length;
634 char *pointer;
637 /* In a TREE_LIST node. */
638 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
639 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
641 struct tree_list
643 char common[sizeof (struct tree_common)];
644 union tree_node *purpose;
645 union tree_node *value;
648 /* In a TREE_VEC node. */
649 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
650 #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
651 #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
653 struct tree_vec
655 char common[sizeof (struct tree_common)];
656 int length;
657 union tree_node *a[1];
660 /* Define fields and accessors for some nodes that represent expressions. */
662 /* In a SAVE_EXPR node. */
663 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
664 #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
665 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
667 /* In a RTL_EXPR node. */
668 #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
669 #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
671 /* In a CALL_EXPR node. */
672 #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
674 /* In a CONSTRUCTOR node. */
675 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
677 /* In ordinary expression nodes. */
678 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
679 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
681 /* In expression with file location information. */
682 #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
683 #define EXPR_WFL_FILENAME(NODE) (IDENTIFIER_POINTER ((NODE)->common.chain))
684 #define EXPR_WFL_FILENAME_NODE(NODE) ((NODE)->common.chain)
685 #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
686 #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
687 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
688 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
689 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
690 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.lang_flag_0)
692 struct tree_exp
694 char common[sizeof (struct tree_common)];
695 int complexity;
696 union tree_node *operands[1];
699 /* In a BLOCK node. */
700 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
701 #define BLOCK_TYPE_TAGS(NODE) (BLOCK_CHECK (NODE)->block.type_tags)
702 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
703 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
704 /* Note: when changing this, make sure to find the places
705 that use chainon or nreverse. */
706 #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
707 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
708 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
709 #define BLOCK_END_NOTE(NODE) (BLOCK_CHECK (NODE)->block.end_note)
710 /* Nonzero means that this block has separate live range regions */
711 #define BLOCK_LIVE_RANGE_FLAG(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_flag)
713 /* Nonzero means that this block has a variable declared in it
714 that is split into separate live ranges. */
715 #define BLOCK_LIVE_RANGE_VAR_FLAG(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_var_flag)
717 /* Index for marking the start of the block for live ranges. */
718 #define BLOCK_LIVE_RANGE_START(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_start)
720 /* Index for marking the end of the block for live ranges. */
721 #define BLOCK_LIVE_RANGE_END(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_end)
723 /* Nonzero means that this block is prepared to handle exceptions
724 listed in the BLOCK_VARS slot. */
725 #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
727 struct tree_block
729 char common[sizeof (struct tree_common)];
731 unsigned handler_block_flag : 1;
732 unsigned abstract_flag : 1;
733 unsigned live_range_flag : 1;
734 unsigned live_range_var_flag : 1;
736 union tree_node *vars;
737 union tree_node *type_tags;
738 union tree_node *subblocks;
739 union tree_node *supercontext;
740 union tree_node *abstract_origin;
741 struct rtx_def *end_note;
742 int live_range_start;
743 int live_range_end;
746 /* Define fields and accessors for nodes representing data types. */
748 /* See tree.def for documentation of the use of these fields.
749 Look at the documentation of the various ..._TYPE tree codes. */
751 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
752 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
753 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
754 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
755 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
756 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
757 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
758 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
759 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
760 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
761 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
762 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
763 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
764 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
765 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
766 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
767 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
768 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
769 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
770 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
771 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
772 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
773 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
774 #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
775 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
776 #define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
777 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
779 /* The (language-specific) typed-based alias set for this type.
780 Objects whose TYPE_ALIAS_SETs are different cannot alias each
781 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
782 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
783 type can alias objects of any type. */
784 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
786 /* Nonzero iff the typed-based alias set for this type has been
787 calculated. */
788 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
789 (TYPE_CHECK (NODE)->type.alias_set != -1)
791 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
792 to this type. */
793 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
795 /* The alignment necessary for objects of this type.
796 The value is an int, measured in bits. */
797 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
799 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
801 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
802 has BLKmode only because it lacks the alignment requirement for
803 its size. */
804 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
806 /* Nonzero in a type considered volatile as a whole. */
807 #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
809 /* Means this type is const-qualified. */
810 #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
812 /* These flags are available for each language front end to use internally. */
813 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
814 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
815 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
816 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
817 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
818 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
819 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
821 /* If set in an ARRAY_TYPE, indicates a string type (for languages
822 that distinguish string from array of char).
823 If set in a SET_TYPE, indicates a bitstring type. */
824 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
826 /* If non-NULL, this is a upper bound of the size (in bytes) of an
827 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
828 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
830 /* Indicates that objects of this type must be initialized by calling a
831 function when they are created. */
832 #define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag)
834 /* Indicates that objects of this type (a UNION_TYPE), should be passed
835 the same way that the first union alternative would be passed. */
836 #define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag)
838 /* Indicated that objects of this type should be laid out in as
839 compact a way as possible. */
840 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
842 struct tree_type
844 char common[sizeof (struct tree_common)];
845 union tree_node *values;
846 union tree_node *size;
847 union tree_node *size_unit;
848 union tree_node *attributes;
849 unsigned uid;
851 unsigned char precision;
852 #ifdef ONLY_INT_FIELDS
853 int mode : 8;
854 #else
855 enum machine_mode mode : 8;
856 #endif
858 unsigned string_flag : 1;
859 unsigned no_force_blk_flag : 1;
860 unsigned needs_constructing_flag : 1;
861 unsigned transparent_union_flag : 1;
862 unsigned packed_flag : 1;
863 unsigned lang_flag_0 : 1;
864 unsigned lang_flag_1 : 1;
865 unsigned lang_flag_2 : 1;
866 unsigned lang_flag_3 : 1;
867 unsigned lang_flag_4 : 1;
868 unsigned lang_flag_5 : 1;
869 unsigned lang_flag_6 : 1;
870 /* room for 4 more bits */
872 unsigned int align;
873 union tree_node *pointer_to;
874 union tree_node *reference_to;
875 union {int address; char *pointer; } symtab;
876 union tree_node *name;
877 union tree_node *minval;
878 union tree_node *maxval;
879 union tree_node *next_variant;
880 union tree_node *main_variant;
881 union tree_node *binfo;
882 union tree_node *noncopied_parts;
883 union tree_node *context;
884 struct obstack *obstack;
885 int alias_set;
886 /* Points to a structure whose details depend on the language in use. */
887 struct lang_type *lang_specific;
890 /* Define accessor macros for information about type inheritance
891 and basetypes.
893 A "basetype" means a particular usage of a data type for inheritance
894 in another type. Each such basetype usage has its own "binfo"
895 object to describe it. The binfo object is a TREE_VEC node.
897 Inheritance is represented by the binfo nodes allocated for a
898 given type. For example, given types C and D, such that D is
899 inherited by C, 3 binfo nodes will be allocated: one for describing
900 the binfo properties of C, similarly one for D, and one for
901 describing the binfo properties of D as a base type for C.
902 Thus, given a pointer to class C, one can get a pointer to the binfo
903 of D acting as a basetype for C by looking at C's binfo's basetypes. */
905 /* The actual data type node being inherited in this basetype. */
906 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
908 /* The offset where this basetype appears in its containing type.
909 BINFO_OFFSET slot holds the offset (in bytes)
910 from the base of the complete object to the base of the part of the
911 object that is allocated on behalf of this `type'.
912 This is always 0 except when there is multiple inheritance. */
914 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
915 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
916 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
918 /* The virtual function table belonging to this basetype. Virtual
919 function tables provide a mechanism for run-time method dispatching.
920 The entries of a virtual function table are language-dependent. */
922 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
923 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
925 /* The virtual functions in the virtual function table. This is
926 a TREE_LIST that is used as an initial approximation for building
927 a virtual function table for this basetype. */
928 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
929 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
931 /* A vector of additional binfos for the types inherited by this basetype.
933 If this basetype describes type D as inherited in C,
934 and if the basetypes of D are E anf F,
935 then this vector contains binfos for inheritance of E and F by C.
937 ??? This could probably be done by just allocating the
938 base types at the end of this TREE_VEC (instead of using
939 another TREE_VEC). This would simplify the calculation
940 of how many basetypes a given type had. */
941 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
942 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
944 /* Accessor macro to get to the Nth basetype of this basetype. */
945 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
946 #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
948 /* For a BINFO record describing an inheritance, this yields a pointer
949 to the artificial FIELD_DECL node which contains the "virtual base
950 class pointer" for the given inheritance. */
951 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
953 /* The size of a base class subobject of this type. Not all frontends
954 currently allocate the space for this field. */
955 #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
956 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
958 /* Slot used to build a chain that represents a use of inheritance.
959 For example, if X is derived from Y, and Y is derived from Z,
960 then this field can be used to link the binfo node for X to
961 the binfo node for X's Y to represent the use of inheritance
962 from X to Y. Similarly, this slot of the binfo node for X's Y
963 can point to the Z from which Y is inherited (in X's inheritance
964 hierarchy). In this fashion, one can represent and traverse specific
965 uses of inheritance using the binfo nodes themselves (instead of
966 consing new space pointing to binfo nodes).
967 It is up to the language-dependent front-ends to maintain
968 this information as necessary. */
969 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
971 /* Define fields and accessors for nodes representing declared names. */
973 /* This is the name of the object as written by the user.
974 It is an IDENTIFIER_NODE. */
975 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
976 /* This is the name of the object as the assembler will see it
977 (but before any translations made by ASM_OUTPUT_LABELREF).
978 Often this is the same as DECL_NAME.
979 It is an IDENTIFIER_NODE. */
980 #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
981 /* Records the section name in a section attribute. Used to pass
982 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
983 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
984 /* For FIELD_DECLs, this is the
985 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
986 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
987 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
988 containing function, the RECORD_TYPE or UNION_TYPE for the containing
989 type, or NULL_TREE if the given decl has "file scope". */
990 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
991 #define DECL_FIELD_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
992 /* In a DECL this is the field where configuration dependent machine
993 attributes are store */
994 #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
995 /* In a FIELD_DECL, this is the field position, counting in bits,
996 of the bit closest to the beginning of the structure. */
997 #define DECL_FIELD_BITPOS(NODE) (DECL_CHECK (NODE)->decl.arguments)
998 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
999 if so, the type that was originally specified for it.
1000 TREE_TYPE may have been modified (in finish_struct). */
1001 #define DECL_BIT_FIELD_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1002 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1003 /* VAR_DECL and PARM_DECL reserve the arguments slot
1004 for language-specific uses. */
1005 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1006 /* In FUNCTION_DECL, holds the decl for the return value. */
1007 #define DECL_RESULT(NODE) (DECL_CHECK (NODE)->decl.result)
1008 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1009 #define DECL_ORIGINAL_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1010 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1011 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (DECL_CHECK (NODE)->decl.result)
1012 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1013 For a VAR_DECL, holds the initial value.
1014 For a PARM_DECL, not used--default
1015 values for parameters are encoded in the type of the function,
1016 not in the PARM_DECL slot. */
1017 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1018 /* For a PARM_DECL, records the data type used to pass the argument,
1019 which may be different from the type seen in the program. */
1020 #define DECL_ARG_TYPE(NODE) (DECL_CHECK (NODE)->decl.initial) /* In PARM_DECL. */
1021 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1022 if nonzero, indicates that the field occupies the type. */
1023 #define DECL_QUALIFIER(NODE) (DECL_CHECK (NODE)->decl.initial)
1024 /* These two fields describe where in the source code the declaration was. */
1025 #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1026 #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1027 /* Holds the size of the datum, as a tree expression.
1028 Need not be constant. */
1029 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1030 /* Holds the alignment required for the datum. */
1031 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.frame_size.u)
1032 /* Holds the machine mode corresponding to the declaration of a variable or
1033 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1034 FIELD_DECL. */
1035 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1036 /* Holds the RTL expression for the value of a variable or function. If
1037 PROMOTED_MODE is defined, the mode of this expression may not be same
1038 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1039 to the variable's data type, while the mode
1040 of DECL_RTL is the mode actually used to contain the data. */
1041 #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1042 /* Holds an INSN_LIST of all of the live ranges in which the variable
1043 has been moved to a possibly different register. */
1044 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1045 /* For PARM_DECL, holds an RTL for the stack slot or register
1046 where the data was actually passed. */
1047 #define DECL_INCOMING_RTL(NODE) (DECL_CHECK (NODE)->decl.saved_insns.r)
1048 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1049 #define DECL_SAVED_INSNS(NODE) (DECL_CHECK (NODE)->decl.saved_insns.r)
1050 /* For FUNCTION_DECL, if it is inline,
1051 holds the size of the stack frame, as an integer. */
1052 #define DECL_FRAME_SIZE(NODE) (DECL_CHECK (NODE)->decl.frame_size.i)
1053 /* For FUNCTION_DECL, if it is built-in,
1054 this identifies which built-in operation it is. */
1055 #define DECL_FUNCTION_CODE(NODE) (DECL_CHECK (NODE)->decl.frame_size.f)
1056 #define DECL_SET_FUNCTION_CODE(NODE,VAL) (DECL_CHECK (NODE)->decl.frame_size.f = (VAL))
1057 /* For a FIELD_DECL, holds the size of the member as an integer. */
1058 #define DECL_FIELD_SIZE(NODE) (DECL_CHECK (NODE)->decl.saved_insns.i)
1060 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1061 Before the struct containing the FUNCTION_DECL is laid out,
1062 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1063 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1064 function. When the class is laid out, this pointer is changed
1065 to an INTEGER_CST node which is suitable for use as an index
1066 into the virtual function table. */
1067 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1068 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1069 which this FIELD_DECL is defined. This information is needed when
1070 writing debugging information about vfield and vbase decls for C++. */
1071 #define DECL_FCONTEXT(NODE) (DECL_CHECK (NODE)->decl.vindex)
1073 /* Every ..._DECL node gets a unique number. */
1074 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1076 /* For any sort of a ..._DECL node, this points to the original (abstract)
1077 decl node which this decl is an instance of, or else it is NULL indicating
1078 that this decl is not an instance of some other decl. For example,
1079 in a nested declaration of an inline function, this points back to the
1080 definition. */
1081 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1083 /* Nonzero for any sort of ..._DECL node means this decl node represents
1084 an inline instance of some original (abstract) decl from an inline function;
1085 suppress any warnings about shadowing some other variable. */
1086 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
1088 /* Nonzero if a _DECL means that the name of this decl should be ignored
1089 for symbolic debug purposes. */
1090 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1092 /* Nonzero for a given ..._DECL node means that this node represents an
1093 "abstract instance" of the given declaration (e.g. in the original
1094 declaration of an inline function). When generating symbolic debugging
1095 information, we mustn't try to generate any address information for nodes
1096 marked as "abstract instances" because we don't actually generate
1097 any code or allocate any data space for such instances. */
1098 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1100 /* Nonzero if a _DECL means that no warnings should be generated just
1101 because this decl is unused. */
1102 #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1104 /* Nonzero for a given ..._DECL node means that this node should be
1105 put in .common, if possible. If a DECL_INITIAL is given, and it
1106 is not error_mark_node, then the decl cannot be put in .common. */
1107 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1109 /* Language-specific decl information. */
1110 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1112 /* In a VAR_DECL or FUNCTION_DECL,
1113 nonzero means external reference:
1114 do not allocate storage, and refer to a definition elsewhere. */
1115 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1117 /* In a TYPE_DECL
1118 nonzero means the detail info about this type is not dumped into stabs.
1119 Instead it will generate cross reference ('x') of names.
1120 This uses the same flag as DECL_EXTERNAL. */
1121 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1124 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1125 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1126 /* In LABEL_DECL nodes, nonzero means that an error message about
1127 jumping into such a binding contour has been printed for this label. */
1128 #define DECL_ERROR_ISSUED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1129 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1130 #define DECL_PACKED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1131 /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1132 static chain is not needed. */
1133 #define DECL_NO_STATIC_CHAIN(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1135 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1136 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1138 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1140 Also set in some languages for variables, etc., outside the normal
1141 lexical scope, such as class instance variables. */
1142 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1144 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1145 where it is called. */
1146 #define DECL_INLINE(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
1148 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1149 that is not specified by ansi C and that users are supposed to be allowed
1150 to redefine for any purpose whatever. */
1151 #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1153 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1154 specially. */
1155 #define DECL_BIT_FIELD(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1156 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1157 contour that restored a stack level and which is now exited. */
1158 #define DECL_TOO_LATE(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1159 /* In a FUNCTION_DECL, nonzero means a built in function. */
1160 #define DECL_BUILT_IN(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1161 /* In a VAR_DECL that's static,
1162 nonzero if the space is in the text section. */
1163 #define DECL_IN_TEXT_SECTION(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1165 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1166 Used in FIELD_DECLs for vtable pointers.
1167 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1168 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1170 /* Used to indicate that the linkage status of this DECL is not yet known,
1171 so it should not be output now. */
1172 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1174 /* Used in PARM_DECLs whose type are unions to indicate that the
1175 argument should be passed in the same way that the first union
1176 alternative would be passed. */
1177 #define DECL_TRANSPARENT_UNION(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1179 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1180 at the beginning or end of execution. */
1181 #define DECL_STATIC_CONSTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_ctor_flag)
1182 #define DECL_STATIC_DESTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_dtor_flag)
1184 /* Used to indicate that this DECL represents a compiler-generated entity. */
1185 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1187 /* Used to indicate that this DECL has weak linkage. */
1188 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1190 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1191 multiple translation units should be merged. */
1192 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1194 /* Additional flags for language-specific uses. */
1195 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1196 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1197 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1198 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1199 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1200 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1201 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1202 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1204 struct tree_decl
1206 char common[sizeof (struct tree_common)];
1207 char *filename;
1208 int linenum;
1209 unsigned int uid;
1210 union tree_node *size;
1211 #ifdef ONLY_INT_FIELDS
1212 int mode : 8;
1213 #else
1214 enum machine_mode mode : 8;
1215 #endif
1217 unsigned external_flag : 1;
1218 unsigned nonlocal_flag : 1;
1219 unsigned regdecl_flag : 1;
1220 unsigned inline_flag : 1;
1221 unsigned bit_field_flag : 1;
1222 unsigned virtual_flag : 1;
1223 unsigned ignored_flag : 1;
1224 unsigned abstract_flag : 1;
1226 unsigned in_system_header_flag : 1;
1227 unsigned common_flag : 1;
1228 unsigned defer_output : 1;
1229 unsigned transparent_union : 1;
1230 unsigned static_ctor_flag : 1;
1231 unsigned static_dtor_flag : 1;
1232 unsigned artificial_flag : 1;
1233 unsigned weak_flag : 1;
1234 /* room for no more */
1236 unsigned lang_flag_0 : 1;
1237 unsigned lang_flag_1 : 1;
1238 unsigned lang_flag_2 : 1;
1239 unsigned lang_flag_3 : 1;
1240 unsigned lang_flag_4 : 1;
1241 unsigned lang_flag_5 : 1;
1242 unsigned lang_flag_6 : 1;
1243 unsigned lang_flag_7 : 1;
1245 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1246 If built-in, this is the code for which built-in function.
1247 For other kinds of decls, this is DECL_ALIGN. */
1248 union {
1249 int i;
1250 unsigned int u;
1251 enum built_in_function f;
1252 } frame_size;
1254 union tree_node *name;
1255 union tree_node *context;
1256 union tree_node *arguments;
1257 union tree_node *result;
1258 union tree_node *initial;
1259 union tree_node *abstract_origin;
1260 union tree_node *assembler_name;
1261 union tree_node *section_name;
1262 union tree_node *machine_attributes;
1263 struct rtx_def *rtl; /* acts as link to register transfer language
1264 (rtl) info */
1265 struct rtx_def *live_range_rtl;
1266 /* For FUNCTION_DECLs: points to insn that constitutes its definition
1267 on the permanent obstack. For FIELD_DECL, this is DECL_FIELD_SIZE. */
1268 union {
1269 struct rtx_def *r;
1270 HOST_WIDE_INT i;
1271 } saved_insns;
1272 union tree_node *vindex;
1273 /* Points to a structure whose details depend on the language in use. */
1274 struct lang_decl *lang_specific;
1277 /* Define the overall contents of a tree node.
1278 It may be any of the structures declared above
1279 for various types of node. */
1281 union tree_node
1283 struct tree_common common;
1284 struct tree_int_cst int_cst;
1285 struct tree_real_cst real_cst;
1286 struct tree_string string;
1287 struct tree_complex complex;
1288 struct tree_identifier identifier;
1289 struct tree_decl decl;
1290 struct tree_type type;
1291 struct tree_list list;
1292 struct tree_vec vec;
1293 struct tree_exp exp;
1294 struct tree_block block;
1297 #include "gansidecl.h"
1299 #define NULL_TREE (tree) NULL
1301 /* The following functions accept a wide integer argument. Rather than
1302 having to cast on every function call, we use a macro instead, that is
1303 defined here and in rtl.h. */
1305 #ifndef exact_log2
1306 #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1307 #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1308 #endif
1309 extern int exact_log2_wide PROTO((unsigned HOST_WIDE_INT));
1310 extern int floor_log2_wide PROTO((unsigned HOST_WIDE_INT));
1312 #if 0
1313 /* At present, don't prototype xrealloc, since all of the callers don't
1314 cast their pointers to char *, and all of the xrealloc's don't use
1315 void * yet. */
1316 extern char *xmalloc PROTO((size_t));
1317 extern char *xrealloc PROTO((void *, size_t));
1318 #else
1319 extern char *xmalloc ();
1320 extern char *xrealloc ();
1321 #endif
1323 extern char *xstrdup PROTO((char *));
1325 extern char *oballoc PROTO((int));
1326 extern char *permalloc PROTO((int));
1327 extern char *savealloc PROTO((int));
1328 extern char *expralloc PROTO((int));
1330 /* Lowest level primitive for allocating a node.
1331 The TREE_CODE is the only argument. Contents are initialized
1332 to zero except for a few of the common fields. */
1334 extern tree make_node PROTO((enum tree_code));
1336 /* Make a copy of a node, with all the same contents except
1337 for TREE_PERMANENT. (The copy is permanent
1338 iff nodes being made now are permanent.) */
1340 extern tree copy_node PROTO((tree));
1342 /* Make a copy of a chain of TREE_LIST nodes. */
1344 extern tree copy_list PROTO((tree));
1346 /* Make a TREE_VEC. */
1348 extern tree make_tree_vec PROTO((int));
1350 /* Return the (unique) IDENTIFIER_NODE node for a given name.
1351 The name is supplied as a char *. */
1353 extern tree get_identifier PROTO((char *));
1355 /* If an identifier with the name TEXT (a null-terminated string) has
1356 previously been referred to, return that node; otherwise return
1357 NULL_TREE. */
1359 extern tree maybe_get_identifier PROTO((char *));
1361 /* Construct various types of nodes. */
1363 #define build_int_2(LO,HI) \
1364 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1366 extern tree build PVPROTO((enum tree_code, tree, ...));
1367 extern tree build_nt PVPROTO((enum tree_code, ...));
1368 extern tree build_parse_node PVPROTO((enum tree_code, ...));
1370 extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT));
1371 extern tree build_real PROTO((tree, REAL_VALUE_TYPE));
1372 extern tree build_real_from_int_cst PROTO((tree, tree));
1373 extern tree build_complex PROTO((tree, tree, tree));
1374 extern tree build_string PROTO((int, char *));
1375 extern tree build1 PROTO((enum tree_code, tree, tree));
1376 extern tree build_tree_list PROTO((tree, tree));
1377 extern tree build_decl_list PROTO((tree, tree));
1378 extern tree build_expr_list PROTO((tree, tree));
1379 extern tree build_decl PROTO((enum tree_code, tree, tree));
1380 extern tree build_block PROTO((tree, tree, tree, tree, tree));
1381 extern tree build_expr_wfl PROTO((tree, char *, int, int));
1383 /* Construct various nodes representing data types. */
1385 extern tree make_signed_type PROTO((int));
1386 extern tree make_unsigned_type PROTO((int));
1387 extern void set_sizetype PROTO((tree));
1388 extern tree signed_or_unsigned_type PROTO((int, tree));
1389 extern void fixup_unsigned_type PROTO((tree));
1390 extern tree build_pointer_type PROTO((tree));
1391 extern tree build_reference_type PROTO((tree));
1392 extern tree build_index_type PROTO((tree));
1393 extern tree build_index_2_type PROTO((tree, tree));
1394 extern tree build_array_type PROTO((tree, tree));
1395 extern tree build_function_type PROTO((tree, tree));
1396 extern tree build_method_type PROTO((tree, tree));
1397 extern tree build_offset_type PROTO((tree, tree));
1398 extern tree build_complex_type PROTO((tree));
1399 extern tree array_type_nelts PROTO((tree));
1401 extern tree value_member PROTO((tree, tree));
1402 extern tree purpose_member PROTO((tree, tree));
1403 extern tree binfo_member PROTO((tree, tree));
1404 extern int attribute_hash_list PROTO((tree));
1405 extern int attribute_list_equal PROTO((tree, tree));
1406 extern int attribute_list_contained PROTO((tree, tree));
1407 extern int tree_int_cst_equal PROTO((tree, tree));
1408 extern int tree_int_cst_lt PROTO((tree, tree));
1409 extern int tree_int_cst_sgn PROTO((tree));
1410 extern int index_type_equal PROTO((tree, tree));
1411 extern tree get_inner_array_type PROTO((tree));
1413 /* From expmed.c. Since rtl.h is included after tree.h, we can't
1414 put the prototype here. Rtl.h does declare the prototype if
1415 tree.h had been included. */
1417 extern tree make_tree PROTO((tree, struct rtx_def *));
1419 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1420 is ATTRIBUTE.
1422 Such modified types already made are recorded so that duplicates
1423 are not made. */
1425 extern tree build_type_attribute_variant PROTO((tree, tree));
1426 extern tree build_decl_attribute_variant PROTO((tree, tree));
1428 extern tree merge_machine_decl_attributes PROTO((tree, tree));
1429 extern tree merge_machine_type_attributes PROTO((tree, tree));
1431 /* Split a list of declspecs and attributes into two. */
1433 extern void split_specs_attrs PROTO((tree, tree *, tree *));
1435 /* Strip attributes from a list of combined specs and attrs. */
1437 extern tree strip_attrs PROTO((tree));
1439 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
1441 extern int valid_machine_attribute PROTO((tree, tree, tree, tree));
1443 /* Given a tree node and a string, return non-zero if the tree node is
1444 a valid attribute name for the string. */
1446 extern int is_attribute_p PROTO((char *, tree));
1448 /* Given an attribute name and a list of attributes, return the list element
1449 of the attribute or NULL_TREE if not found. */
1451 extern tree lookup_attribute PROTO((char *, tree));
1453 /* Given two attributes lists, return a list of their union. */
1455 extern tree merge_attributes PROTO((tree, tree));
1457 /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
1458 for the same kind of data as TYPE describes.
1459 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
1460 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
1461 so that duplicate variants are never made.
1462 Only main variants should ever appear as types of expressions. */
1464 extern tree build_type_variant PROTO((tree, int, int));
1466 /* Make a copy of a type node. */
1468 extern tree build_type_copy PROTO((tree));
1470 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1471 TYPE_ALIGN and TYPE_MODE fields.
1472 If called more than once on one node, does nothing except
1473 for the first time. */
1475 extern void layout_type PROTO((tree));
1477 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1478 return a canonicalized ..._TYPE node, so that duplicates are not made.
1479 How the hash code is computed is up to the caller, as long as any two
1480 callers that could hash identical-looking type nodes agree. */
1482 extern tree type_hash_canon PROTO((int, tree));
1484 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1485 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1486 fields. Call this only once for any given decl node.
1488 Second argument is the boundary that this field can be assumed to
1489 be starting at (in bits). Zero means it can be assumed aligned
1490 on any boundary that may be needed. */
1492 extern void layout_decl PROTO((tree, unsigned));
1494 /* Return an expr equal to X but certainly not valid as an lvalue. */
1496 extern tree non_lvalue PROTO((tree));
1497 extern tree pedantic_non_lvalue PROTO((tree));
1499 extern tree convert PROTO((tree, tree));
1500 extern tree size_in_bytes PROTO((tree));
1501 extern HOST_WIDE_INT int_size_in_bytes PROTO((tree));
1502 extern tree size_binop PROTO((enum tree_code, tree, tree));
1503 extern tree ssize_binop PROTO((enum tree_code, tree, tree));
1504 extern tree size_int_wide PROTO((unsigned HOST_WIDE_INT,
1505 unsigned HOST_WIDE_INT, int));
1506 #define size_int(L) size_int_2 ((L), 0, 0)
1507 #define bitsize_int(L, H) size_int_2 ((L), (H), 1)
1508 #define size_int_2(L, H, T) \
1509 size_int_wide ((unsigned HOST_WIDE_INT) (L), \
1510 (unsigned HOST_WIDE_INT) (H), (T))
1512 extern tree round_up PROTO((tree, int));
1513 extern tree get_pending_sizes PROTO((void));
1514 extern void put_pending_sizes PROTO((tree));
1516 /* Type for sizes of data-type. */
1518 #define BITS_PER_UNIT_LOG \
1519 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1520 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1521 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1523 struct sizetype_tab
1525 tree xsizetype, xbitsizetype;
1526 tree xssizetype, xusizetype;
1527 tree xsbitsizetype, xubitsizetype;
1530 extern struct sizetype_tab sizetype_tab;
1532 #define sizetype sizetype_tab.xsizetype
1533 #define bitsizetype sizetype_tab.xbitsizetype
1534 #define ssizetype sizetype_tab.xssizetype
1535 #define usizetype sizetype_tab.xusizetype
1536 #define sbitsizetype sizetype_tab.xsbitsizetype
1537 #define ubitsizetype sizetype_tab.xubitsizetype
1539 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
1540 extern int maximum_field_alignment;
1542 /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1543 extern int set_alignment;
1545 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1546 by making the last node in X point to Y.
1547 Returns X, except if X is 0 returns Y. */
1549 extern tree chainon PROTO((tree, tree));
1551 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1553 extern tree tree_cons PROTO((tree, tree, tree));
1554 extern tree perm_tree_cons PROTO((tree, tree, tree));
1555 extern tree temp_tree_cons PROTO((tree, tree, tree));
1556 extern tree saveable_tree_cons PROTO((tree, tree, tree));
1557 extern tree decl_tree_cons PROTO((tree, tree, tree));
1558 extern tree expr_tree_cons PROTO((tree, tree, tree));
1560 /* Return the last tree node in a chain. */
1562 extern tree tree_last PROTO((tree));
1564 /* Reverse the order of elements in a chain, and return the new head. */
1566 extern tree nreverse PROTO((tree));
1568 /* Returns the length of a chain of nodes
1569 (number of chain pointers to follow before reaching a null pointer). */
1571 extern int list_length PROTO((tree));
1573 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1575 extern int integer_zerop PROTO((tree));
1577 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1579 extern int integer_onep PROTO((tree));
1581 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1582 all of whose significant bits are 1. */
1584 extern int integer_all_onesp PROTO((tree));
1586 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1587 exactly one bit 1. */
1589 extern int integer_pow2p PROTO((tree));
1591 /* staticp (tree x) is nonzero if X is a reference to data allocated
1592 at a fixed address in memory. */
1594 extern int staticp PROTO((tree));
1596 /* Gets an error if argument X is not an lvalue.
1597 Also returns 1 if X is an lvalue, 0 if not. */
1599 extern int lvalue_or_else PROTO((tree, char *));
1601 /* save_expr (EXP) returns an expression equivalent to EXP
1602 but it can be used multiple times within context CTX
1603 and only evaluate EXP once. */
1605 extern tree save_expr PROTO((tree));
1607 /* Returns the index of the first non-tree operand for CODE, or the number
1608 of operands if all are trees. */
1610 extern int first_rtl_op PROTO((enum tree_code));
1612 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
1613 can be used multiple times and will evaluate EXP, in its entirety
1614 each time. */
1616 extern tree unsave_expr PROTO((tree));
1618 /* unsave_expr_now (EXP) resets EXP in place, so that it can be
1619 expanded again. */
1621 extern tree unsave_expr_now PROTO((tree));
1623 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1624 or offset that depends on a field within a record.
1626 Note that we only allow such expressions within simple arithmetic
1627 or a COND_EXPR. */
1629 extern int contains_placeholder_p PROTO((tree));
1631 /* Return 1 if EXP contains any expressions that produce cleanups for an
1632 outer scope to deal with. Used by fold. */
1634 extern int has_cleanups PROTO((tree));
1636 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1637 return a tree with all occurrences of references to F in a
1638 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1639 contains only arithmetic expressions. */
1641 extern tree substitute_in_expr PROTO((tree, tree, tree));
1643 /* variable_size (EXP) is like save_expr (EXP) except that it
1644 is for the special case of something that is part of a
1645 variable size for a data type. It makes special arrangements
1646 to compute the value at the right time when the data type
1647 belongs to a function parameter. */
1649 extern tree variable_size PROTO((tree));
1651 /* stabilize_reference (EXP) returns an reference equivalent to EXP
1652 but it can be used multiple times
1653 and only evaluate the subexpressions once. */
1655 extern tree stabilize_reference PROTO((tree));
1657 /* Subroutine of stabilize_reference; this is called for subtrees of
1658 references. Any expression with side-effects must be put in a SAVE_EXPR
1659 to ensure that it is only evaluated once. */
1661 extern tree stabilize_reference_1 PROTO((tree));
1663 /* Return EXP, stripped of any conversions to wider types
1664 in such a way that the result of converting to type FOR_TYPE
1665 is the same as if EXP were converted to FOR_TYPE.
1666 If FOR_TYPE is 0, it signifies EXP's type. */
1668 extern tree get_unwidened PROTO((tree, tree));
1670 /* Return OP or a simpler expression for a narrower value
1671 which can be sign-extended or zero-extended to give back OP.
1672 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1673 or 0 if the value should be sign-extended. */
1675 extern tree get_narrower PROTO((tree, int *));
1677 /* Given MODE and UNSIGNEDP, return a suitable type-tree
1678 with that mode.
1679 The definition of this resides in language-specific code
1680 as the repertoire of available types may vary. */
1682 extern tree type_for_mode PROTO((enum machine_mode, int));
1684 /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1685 for an integer type with at least that precision.
1686 The definition of this resides in language-specific code
1687 as the repertoire of available types may vary. */
1689 extern tree type_for_size PROTO((unsigned, int));
1691 /* Given an integer type T, return a type like T but unsigned.
1692 If T is unsigned, the value is T.
1693 The definition of this resides in language-specific code
1694 as the repertoire of available types may vary. */
1696 extern tree unsigned_type PROTO((tree));
1698 /* Given an integer type T, return a type like T but signed.
1699 If T is signed, the value is T.
1700 The definition of this resides in language-specific code
1701 as the repertoire of available types may vary. */
1703 extern tree signed_type PROTO((tree));
1705 /* This function must be defined in the language-specific files.
1706 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1707 This is defined in a language-specific file. */
1709 extern tree maybe_build_cleanup PROTO((tree));
1711 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1712 look for nested component-refs or array-refs at constant positions
1713 and find the ultimate containing object, which is returned. */
1715 extern tree get_inner_reference PROTO((tree, int *, int *, tree *,
1716 enum machine_mode *, int *,
1717 int *, int *));
1719 /* Return the FUNCTION_DECL which provides this _DECL with its context,
1720 or zero if none. */
1721 extern tree decl_function_context PROTO((tree));
1723 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1724 this _DECL with its context, or zero if none. */
1725 extern tree decl_type_context PROTO((tree));
1727 /* Given the FUNCTION_DECL for the current function,
1728 return zero if it is ok for this function to be inline.
1729 Otherwise return a warning message with a single %s
1730 for the function's name. */
1732 extern char *function_cannot_inline_p PROTO((tree));
1734 /* Return 1 if EXPR is the real constant zero. */
1735 extern int real_zerop PROTO((tree));
1737 /* Declare commonly used variables for tree structure. */
1739 /* An integer constant with value 0 */
1740 extern tree integer_zero_node;
1742 /* An integer constant with value 1 */
1743 extern tree integer_one_node;
1745 /* An integer constant with value 0 whose type is sizetype. */
1746 extern tree size_zero_node;
1748 /* An integer constant with value 1 whose type is sizetype. */
1749 extern tree size_one_node;
1751 /* A constant of type pointer-to-int and value 0 */
1752 extern tree null_pointer_node;
1754 /* A node of type ERROR_MARK. */
1755 extern tree error_mark_node;
1757 /* The type node for the void type. */
1758 extern tree void_type_node;
1760 /* The type node for the ordinary (signed) integer type. */
1761 extern tree integer_type_node;
1763 /* The type node for the unsigned integer type. */
1764 extern tree unsigned_type_node;
1766 /* The type node for the ordinary character type. */
1767 extern tree char_type_node;
1769 /* Points to the name of the input file from which the current input
1770 being parsed originally came (before it went into cpp). */
1771 extern char *input_filename;
1773 /* Current line number in input file. */
1774 extern int lineno;
1776 /* Nonzero for -pedantic switch: warn about anything
1777 that standard C forbids. */
1778 extern int pedantic;
1780 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
1781 Zero means allow extended lvalues. */
1783 extern int pedantic_lvalues;
1785 /* Nonzero means can safely call expand_expr now;
1786 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1788 extern int immediate_size_expand;
1790 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1792 extern tree current_function_decl;
1794 /* Nonzero if function being compiled can call setjmp. */
1796 extern int current_function_calls_setjmp;
1798 /* Nonzero if function being compiled can call longjmp. */
1800 extern int current_function_calls_longjmp;
1802 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1804 extern int all_types_permanent;
1806 /* Pointer to function to compute the name to use to print a declaration.
1807 DECL is the declaration in question.
1808 VERBOSITY determines what information will be printed:
1809 0: DECL_NAME, demangled as necessary.
1810 1: and scope information.
1811 2: and any other information that might be interesting, such as function
1812 parameter types in C++. */
1814 extern char *(*decl_printable_name) PROTO((tree, int));
1816 /* Pointer to function to finish handling an incomplete decl at the
1817 end of compilation. */
1819 extern void (*incomplete_decl_finalize_hook) PROTO((tree));
1821 /* In tree.c */
1822 extern char *perm_calloc PROTO((int, long));
1823 extern tree get_file_function_name PROTO((int));
1824 extern tree get_set_constructor_bits PROTO((tree, char *, int));
1825 extern tree get_set_constructor_bytes PROTO((tree,
1826 unsigned char *, int));
1827 extern int get_alias_set PROTO((tree));
1828 extern int (*lang_get_alias_set) PROTO((tree));
1830 /* In stmt.c */
1832 extern void expand_fixups PROTO((struct rtx_def *));
1833 extern tree expand_start_stmt_expr PROTO((void));
1834 extern tree expand_end_stmt_expr PROTO((tree));
1835 extern void expand_expr_stmt PROTO((tree));
1836 extern int warn_if_unused_value PROTO((tree));
1837 extern void expand_decl_init PROTO((tree));
1838 extern void clear_last_expr PROTO((void));
1839 extern void expand_label PROTO((tree));
1840 extern void expand_goto PROTO((tree));
1841 extern void expand_asm PROTO((tree));
1842 extern void expand_start_cond PROTO((tree, int));
1843 extern void expand_end_cond PROTO((void));
1844 extern void expand_start_else PROTO((void));
1845 extern void expand_start_elseif PROTO((tree));
1846 extern struct nesting *expand_start_loop PROTO((int));
1847 extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int));
1848 extern void expand_loop_continue_here PROTO((void));
1849 extern void expand_end_loop PROTO((void));
1850 extern int expand_continue_loop PROTO((struct nesting *));
1851 extern int expand_exit_loop PROTO((struct nesting *));
1852 extern int expand_exit_loop_if_false PROTO((struct nesting *,
1853 tree));
1854 extern int expand_exit_something PROTO((void));
1856 extern void expand_null_return PROTO((void));
1857 extern void expand_return PROTO((tree));
1858 extern void expand_start_bindings PROTO((int));
1859 extern void expand_end_bindings PROTO((tree, int, int));
1860 extern void start_cleanup_deferral PROTO((void));
1861 extern void end_cleanup_deferral PROTO((void));
1862 extern void mark_block_as_eh_region PROTO((void));
1863 extern void mark_block_as_not_eh_region PROTO((void));
1864 extern int is_eh_region PROTO((void));
1865 extern int conditional_context PROTO((void));
1866 extern tree last_cleanup_this_contour PROTO((void));
1867 extern int expand_dhc_cleanup PROTO((tree));
1868 extern int expand_dcc_cleanup PROTO((tree));
1869 extern void expand_start_case PROTO((int, tree, tree,
1870 char *));
1871 extern void expand_end_case PROTO((tree));
1872 extern int pushcase PROTO((tree,
1873 tree (*) (tree, tree),
1874 tree, tree *));
1875 extern int pushcase_range PROTO((tree, tree,
1876 tree (*) (tree, tree),
1877 tree, tree *));
1878 extern void using_eh_for_cleanups PROTO((void));
1880 /* In fold-const.c */
1882 /* Fold constants as much as possible in an expression.
1883 Returns the simplified expression.
1884 Acts only on the top level of the expression;
1885 if the argument itself cannot be simplified, its
1886 subexpressions are not changed. */
1888 extern tree fold PROTO((tree));
1890 extern int force_fit_type PROTO((tree, int));
1891 extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1892 HOST_WIDE_INT, HOST_WIDE_INT,
1893 HOST_WIDE_INT *, HOST_WIDE_INT *));
1894 extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1895 HOST_WIDE_INT *, HOST_WIDE_INT *));
1896 extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1897 HOST_WIDE_INT, HOST_WIDE_INT,
1898 HOST_WIDE_INT *, HOST_WIDE_INT *));
1899 extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1900 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1901 HOST_WIDE_INT *, int));
1902 extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1903 HOST_WIDE_INT, int,
1904 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
1905 extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1906 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1907 HOST_WIDE_INT *));
1908 extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1909 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1910 HOST_WIDE_INT *));
1911 extern int operand_equal_p PROTO((tree, tree, int));
1912 extern tree invert_truthvalue PROTO((tree));
1914 /* Interface of the DWARF2 unwind info support. */
1916 /* Decide whether we want to emit frame unwind information for the current
1917 translation unit. */
1919 extern int dwarf2out_do_frame PROTO((void));
1921 /* Generate a new label for the CFI info to refer to. */
1923 extern char *dwarf2out_cfi_label PROTO((void));
1925 /* Entry point to update the canonical frame address (CFA). */
1927 extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
1929 /* Add the CFI for saving a register window. */
1931 extern void dwarf2out_window_save PROTO((char *));
1933 /* Add a CFI to update the running total of the size of arguments pushed
1934 onto the stack. */
1936 extern void dwarf2out_args_size PROTO((char *, long));
1938 /* Entry point for saving a register to the stack. */
1940 extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
1942 /* Entry point for saving the return address in the stack. */
1944 extern void dwarf2out_return_save PROTO((char *, long));
1946 /* Entry point for saving the return address in a register. */
1948 extern void dwarf2out_return_reg PROTO((char *, unsigned));
1950 /* Output a marker (i.e. a label) for the beginning of a function, before
1951 the prologue. */
1953 extern void dwarf2out_begin_prologue PROTO((void));
1955 /* Output a marker (i.e. a label) for the absolute end of the generated
1956 code for a function definition. */
1958 extern void dwarf2out_end_epilogue PROTO((void));
1960 /* The language front-end must define these functions. */
1962 /* Function of no arguments for initializing options. */
1963 extern void lang_init_options PROTO((void));
1965 /* Function of no arguments for initializing lexical scanning. */
1966 extern void init_lex PROTO((void));
1967 /* Function of no arguments for initializing the symbol table. */
1968 extern void init_decl_processing PROTO((void));
1970 /* Functions called with no arguments at the beginning and end or processing
1971 the input source file. */
1972 extern void lang_init PROTO((void));
1973 extern void lang_finish PROTO((void));
1975 /* Function to identify which front-end produced the output file. */
1976 extern char *lang_identify PROTO((void));
1978 /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
1979 extern void copy_lang_decl PROTO((tree));
1981 /* Function called with no arguments to parse and compile the input. */
1982 extern int yyparse PROTO((void));
1983 /* Function called with option as argument
1984 to decode options starting with -f or -W or +.
1985 It should return nonzero if it handles the option. */
1986 extern int lang_decode_option PROTO((int, char **));
1988 /* Functions for processing symbol declarations. */
1989 /* Function to enter a new lexical scope.
1990 Takes one argument: always zero when called from outside the front end. */
1991 extern void pushlevel PROTO((int));
1992 /* Function to exit a lexical scope. It returns a BINDING for that scope.
1993 Takes three arguments:
1994 KEEP -- nonzero if there were declarations in this scope.
1995 REVERSE -- reverse the order of decls before returning them.
1996 FUNCTIONBODY -- nonzero if this level is the body of a function. */
1997 extern tree poplevel PROTO((int, int, int));
1998 /* Set the BLOCK node for the current scope level. */
1999 extern void set_block PROTO((tree));
2000 /* Function to add a decl to the current scope level.
2001 Takes one argument, a decl to add.
2002 Returns that decl, or, if the same symbol is already declared, may
2003 return a different decl for that name. */
2004 extern tree pushdecl PROTO((tree));
2005 /* Function to return the chain of decls so far in the current scope level. */
2006 extern tree getdecls PROTO((void));
2007 /* Function to return the chain of structure tags in the current scope level. */
2008 extern tree gettags PROTO((void));
2010 extern tree build_range_type PROTO((tree, tree, tree));
2012 /* Call when starting to parse a declaration:
2013 make expressions in the declaration last the length of the function.
2014 Returns an argument that should be passed to resume_momentary later. */
2015 extern int suspend_momentary PROTO((void));
2017 extern int allocation_temporary_p PROTO((void));
2019 /* Call when finished parsing a declaration:
2020 restore the treatment of node-allocation that was
2021 in effect before the suspension.
2022 YES should be the value previously returned by suspend_momentary. */
2023 extern void resume_momentary PROTO((int));
2025 /* Called after finishing a record, union or enumeral type. */
2026 extern void rest_of_type_compilation PROTO((tree, int));
2028 /* Save the current set of obstacks, but don't change them. */
2029 extern void push_obstacks_nochange PROTO((void));
2031 extern void permanent_allocation PROTO((int));
2033 extern void push_momentary PROTO((void));
2035 extern void clear_momentary PROTO((void));
2037 extern void pop_momentary PROTO((void));
2039 extern void end_temporary_allocation PROTO((void));
2041 /* Pop the obstack selection stack. */
2042 extern void pop_obstacks PROTO((void));
2044 /* In tree.c */
2045 extern int really_constant_p PROTO ((tree));
2046 extern void push_obstacks PROTO ((struct obstack *,
2047 struct obstack *));
2048 extern void pop_momentary_nofree PROTO ((void));
2049 extern void preserve_momentary PROTO ((void));
2050 extern void saveable_allocation PROTO ((void));
2051 extern void temporary_allocation PROTO ((void));
2052 extern void resume_temporary_allocation PROTO ((void));
2053 extern tree get_file_function_name PROTO ((int));
2054 extern void set_identifier_size PROTO ((int));
2055 extern int int_fits_type_p PROTO ((tree, tree));
2056 extern int tree_log2 PROTO ((tree));
2057 extern void preserve_initializer PROTO ((void));
2058 extern void preserve_data PROTO ((void));
2059 extern int object_permanent_p PROTO ((tree));
2060 extern int type_precision PROTO ((tree));
2061 extern int simple_cst_equal PROTO ((tree, tree));
2062 extern int type_list_equal PROTO ((tree, tree));
2063 extern int chain_member PROTO ((tree, tree));
2064 extern int chain_member_purpose PROTO ((tree, tree));
2065 extern int chain_member_value PROTO ((tree, tree));
2066 extern tree listify PROTO ((tree));
2067 extern tree type_hash_lookup PROTO ((int, tree));
2068 extern void type_hash_add PROTO ((int, tree));
2069 extern int type_hash_list PROTO ((tree));
2070 extern int simple_cst_list_equal PROTO ((tree, tree));
2071 extern void debug_obstack PROTO ((char *));
2072 extern void rtl_in_current_obstack PROTO ((void));
2073 extern void rtl_in_saveable_obstack PROTO ((void));
2074 extern void init_tree_codes PROTO ((void));
2075 extern void dump_tree_statistics PROTO ((void));
2076 extern void print_obstack_statistics PROTO ((char *, struct obstack *));
2077 #ifdef BUFSIZ
2078 extern void print_obstack_name PROTO ((char *, FILE *, char *));
2079 #endif
2080 extern void expand_function_end PROTO ((char *, int, int));
2081 extern void expand_function_start PROTO ((tree, int));
2082 extern int real_onep PROTO ((tree));
2083 extern int real_twop PROTO ((tree));
2084 extern void start_identifier_warnings PROTO ((void));
2085 extern void gcc_obstack_init PROTO ((struct obstack *));
2086 extern void init_obstacks PROTO ((void));
2087 extern void obfree PROTO ((char *));
2088 extern tree tree_check PROTO ((tree, enum tree_code, char*, int, int));
2089 extern tree tree_class_check PROTO ((tree, char, char*, int, int));
2090 extern tree expr_check PROTO ((tree, int, char*, int, int));
2092 /* In function.c */
2093 extern void setjmp_protect_args PROTO ((void));
2094 extern void setjmp_protect PROTO ((tree));
2095 extern void expand_main_function PROTO ((void));
2096 extern void mark_varargs PROTO ((void));
2097 extern void init_function_start PROTO ((tree, char *, int));
2098 extern void assign_parms PROTO ((tree, int));
2099 extern void put_var_into_stack PROTO ((tree));
2100 extern void uninitialized_vars_warning PROTO ((tree));
2101 extern void setjmp_args_warning PROTO ((void));
2102 extern void mark_all_temps_used PROTO ((void));
2103 extern void init_temp_slots PROTO ((void));
2104 extern void combine_temp_slots PROTO ((void));
2105 extern void free_temp_slots PROTO ((void));
2106 extern void pop_temp_slots PROTO ((void));
2107 extern void push_temp_slots PROTO ((void));
2108 extern void preserve_temp_slots PROTO ((struct rtx_def *));
2109 extern int aggregate_value_p PROTO ((tree));
2110 extern tree reorder_blocks PROTO ((tree *, tree,
2111 struct rtx_def *));
2112 extern void free_temps_for_rtl_expr PROTO ((tree));
2113 extern void instantiate_virtual_regs PROTO ((tree, struct rtx_def *));
2114 extern int max_parm_reg_num PROTO ((void));
2115 extern void push_function_context PROTO ((void));
2116 extern void pop_function_context PROTO ((void));
2117 extern void push_function_context_to PROTO ((tree));
2118 extern void pop_function_context_from PROTO ((tree));
2120 /* In print-rtl.c */
2121 #ifdef BUFSIZ
2122 extern void print_rtl PROTO ((FILE *, struct rtx_def *));
2123 #endif
2125 /* In print-tree.c */
2126 extern void debug_tree PROTO ((tree));
2127 #ifdef BUFSIZ
2128 extern void print_node PROTO ((FILE *, char *, tree, int));
2129 extern void print_node_brief PROTO ((FILE *, char *, tree, int));
2130 extern void indent_to PROTO ((FILE *, int));
2131 #endif
2133 /* In expr.c */
2134 extern void emit_queue PROTO ((void));
2135 extern int apply_args_register_offset PROTO ((int));
2136 extern struct rtx_def *expand_builtin_return_addr
2137 PROTO ((enum built_in_function, int, struct rtx_def *));
2138 extern void do_pending_stack_adjust PROTO ((void));
2139 extern struct rtx_def *expand_assignment PROTO ((tree, tree, int, int));
2140 extern struct rtx_def *store_expr PROTO ((tree, struct rtx_def *,
2141 int));
2142 extern void check_max_integer_computation_mode PROTO ((tree));
2144 /* In emit-rtl.c */
2145 extern void start_sequence_for_rtl_expr PROTO ((tree));
2146 extern struct rtx_def *emit_line_note_after PROTO ((char *, int,
2147 struct rtx_def *));
2148 extern struct rtx_def *emit_line_note PROTO ((char *, int));
2149 extern struct rtx_def *emit_line_note_force PROTO ((char *, int));
2151 /* In c-typeck.c */
2152 extern int mark_addressable PROTO ((tree));
2153 extern void incomplete_type_error PROTO ((tree, tree));
2155 /* In c-lang.c */
2156 extern void print_lang_statistics PROTO ((void));
2158 /* In c-common.c */
2159 extern tree truthvalue_conversion PROTO ((tree));
2160 extern int min_precision PROTO ((tree, int));
2161 extern void split_specs_attrs PROTO ((tree, tree *, tree *));
2163 /* In c-decl.c */
2164 #ifdef BUFSIZ
2165 extern void print_lang_decl PROTO ((FILE *, tree, int));
2166 extern void print_lang_type PROTO ((FILE *, tree, int));
2167 extern void print_lang_identifier PROTO ((FILE *, tree, int));
2168 #endif
2169 extern int global_bindings_p PROTO ((void));
2170 extern void insert_block PROTO ((tree));
2172 /* In integrate.c */
2173 extern void save_for_inline_nocopy PROTO ((tree));
2174 extern void save_for_inline_copying PROTO ((tree));
2175 extern void set_decl_abstract_flags PROTO ((tree, int));
2176 extern void output_inline_function PROTO ((tree));
2178 /* In c-lex.c */
2179 extern void set_yydebug PROTO ((int));
2181 /* In stor-layout.c */
2182 extern void fixup_signed_type PROTO ((tree));
2184 /* varasm.c */
2185 extern void make_decl_rtl PROTO ((tree, char *, int));
2186 extern void make_decl_one_only PROTO ((tree));
2187 extern int supports_one_only PROTO ((void));
2188 extern void variable_section PROTO ((tree, int));
2190 /* In fold-const.c */
2191 extern int div_and_round_double PROTO ((enum tree_code, int,
2192 HOST_WIDE_INT, HOST_WIDE_INT,
2193 HOST_WIDE_INT, HOST_WIDE_INT,
2194 HOST_WIDE_INT *,
2195 HOST_WIDE_INT *,
2196 HOST_WIDE_INT *,
2197 HOST_WIDE_INT *));
2199 /* In stmt.c */
2200 extern void emit_nop PROTO ((void));
2201 extern void expand_computed_goto PROTO ((tree));
2202 extern struct rtx_def *label_rtx PROTO ((tree));
2203 extern void expand_asm_operands PROTO ((tree, tree, tree, tree, int,
2204 char *, int));
2205 extern int any_pending_cleanups PROTO ((int));
2206 extern void init_stmt PROTO ((void));
2207 extern void init_stmt_for_function PROTO ((void));
2208 extern void remember_end_note PROTO ((tree));
2209 extern int drop_through_at_end_p PROTO ((void));
2210 extern void expand_start_target_temps PROTO ((void));
2211 extern void expand_end_target_temps PROTO ((void));
2212 extern void expand_elseif PROTO ((tree));
2213 extern void expand_decl PROTO ((tree));
2214 extern int expand_decl_cleanup PROTO ((tree, tree));
2215 extern void expand_anon_union_decl PROTO ((tree, tree, tree));
2216 extern void move_cleanups_up PROTO ((void));
2217 extern void expand_start_case_dummy PROTO ((void));
2218 extern void expand_end_case_dummy PROTO ((void));
2219 extern tree case_index_expr_type PROTO ((void));
2220 extern HOST_WIDE_INT all_cases_count PROTO ((tree, int *));
2221 extern void check_for_full_enumeration_handling PROTO ((tree));
2222 extern void declare_nonlocal_label PROTO ((tree));
2223 #ifdef BUFSIZ
2224 extern void lang_print_xnode PROTO ((FILE *, tree, int));
2225 #endif
2228 /* If KIND=='I', return a suitable global initializer (constructor) name.
2229 If KIND=='D', return a suitable global clean-up (destructor) name. */
2230 extern tree get_file_function_name PROTO((int));
2232 /* Interface of the DWARF2 unwind info support. */
2234 /* Decide whether we want to emit frame unwind information for the current
2235 translation unit. */
2237 extern int dwarf2out_do_frame PROTO((void));
2239 /* Generate a new label for the CFI info to refer to. */
2241 extern char *dwarf2out_cfi_label PROTO((void));
2243 /* Entry point to update the canonical frame address (CFA). */
2245 extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
2247 /* Add the CFI for saving a register window. */
2249 extern void dwarf2out_window_save PROTO((char *));
2251 /* Add a CFI to update the running total of the size of arguments pushed
2252 onto the stack. */
2254 extern void dwarf2out_args_size PROTO((char *, long));
2256 /* Entry point for saving a register to the stack. */
2258 extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
2260 /* Entry point for saving the return address in the stack. */
2262 extern void dwarf2out_return_save PROTO((char *, long));
2264 /* Entry point for saving the return address in a register. */
2266 extern void dwarf2out_return_reg PROTO((char *, unsigned));
2268 /* Output a marker (i.e. a label) for the beginning of a function, before
2269 the prologue. */
2271 extern void dwarf2out_begin_prologue PROTO((void));
2273 /* Output a marker (i.e. a label) for the absolute end of the generated
2274 code for a function definition. */
2276 extern void dwarf2out_end_epilogue PROTO((void));