Add an UNSPEC_PROLOGUE_USE to prevent the link register from being considered dead.
[official-gcc.git] / gcc / tree.h
blob212cfa427c704055058abcf96bf207ce589cf1c3
1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
10 version.
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
20 02111-1307, USA. */
22 #ifndef GCC_TREE_H
23 #define GCC_TREE_H
25 #include "machmode.h"
26 #include "version.h"
27 #include "location.h"
29 /* Codes of tree nodes */
31 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
33 enum tree_code {
34 #include "tree.def"
36 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
37 NUM_TREE_CODE. */
40 #undef DEFTREECODE
42 /* Number of language-independent tree codes. */
43 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
45 /* Indexed by enum tree_code, contains a character which is
46 `<' for a comparison expression, `1', for a unary arithmetic
47 expression, `2' for a binary arithmetic expression, `e' for
48 other types of expressions, `r' for a reference, `c' for a
49 constant, `d' for a decl, `t' for a type, `s' for a statement,
50 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
52 #define MAX_TREE_CODES 256
53 extern const char tree_code_type[];
54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
56 /* Returns nonzero iff CLASS is the tree-code class of an
57 expression. */
59 #define IS_EXPR_CODE_CLASS(CLASS) \
60 ((CLASS) == '<' || (CLASS) == '1' || (CLASS) == '2' || (CLASS) == 'e')
62 /* Number of argument-words in each kind of tree-node. */
64 extern const unsigned char tree_code_length[];
65 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
67 /* Names of tree components. */
69 extern const char *const tree_code_name[];
71 /* Classify which part of the compiler has defined a given builtin function.
72 Note that we assume below that this is no more than two bits. */
73 enum built_in_class
75 NOT_BUILT_IN = 0,
76 BUILT_IN_FRONTEND,
77 BUILT_IN_MD,
78 BUILT_IN_NORMAL
81 /* Names for the above. */
82 extern const char *const built_in_class_names[4];
84 /* Codes that identify the various built in functions
85 so that expand_call can identify them quickly. */
87 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT) ENUM,
88 enum built_in_function
90 #include "builtins.def"
92 /* Upper bound on non-language-specific builtins. */
93 END_BUILTINS
95 #undef DEF_BUILTIN
97 /* Names for the above. */
98 extern const char *const built_in_names[(int) END_BUILTINS];
100 /* An array of _DECL trees for the above. */
101 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
103 /* The definition of tree nodes fills the next several pages. */
105 /* A tree node can represent a data type, a variable, an expression
106 or a statement. Each node has a TREE_CODE which says what kind of
107 thing it represents. Some common codes are:
108 INTEGER_TYPE -- represents a type of integers.
109 ARRAY_TYPE -- represents a type of pointer.
110 VAR_DECL -- represents a declared variable.
111 INTEGER_CST -- represents a constant integer value.
112 PLUS_EXPR -- represents a sum (an expression).
114 As for the contents of a tree node: there are some fields
115 that all nodes share. Each TREE_CODE has various special-purpose
116 fields as well. The fields of a node are never accessed directly,
117 always through accessor macros. */
119 /* Every kind of tree node starts with this structure,
120 so all nodes have these fields.
122 See the accessor macros, defined below, for documentation of the
123 fields. */
125 struct tree_common GTY(())
127 tree chain;
128 tree type;
130 ENUM_BITFIELD(tree_code) code : 8;
132 unsigned side_effects_flag : 1;
133 unsigned constant_flag : 1;
134 unsigned addressable_flag : 1;
135 unsigned volatile_flag : 1;
136 unsigned readonly_flag : 1;
137 unsigned unsigned_flag : 1;
138 unsigned asm_written_flag: 1;
139 unsigned unused_0 : 1;
141 unsigned used_flag : 1;
142 unsigned nothrow_flag : 1;
143 unsigned static_flag : 1;
144 unsigned public_flag : 1;
145 unsigned private_flag : 1;
146 unsigned protected_flag : 1;
147 unsigned bounded_flag : 1;
148 unsigned deprecated_flag : 1;
150 unsigned lang_flag_0 : 1;
151 unsigned lang_flag_1 : 1;
152 unsigned lang_flag_2 : 1;
153 unsigned lang_flag_3 : 1;
154 unsigned lang_flag_4 : 1;
155 unsigned lang_flag_5 : 1;
156 unsigned lang_flag_6 : 1;
157 unsigned unused_1 : 1;
160 /* The following table lists the uses of each of the above flags and
161 for which types of nodes they are defined. Note that expressions
162 include decls.
164 addressable_flag:
166 TREE_ADDRESSABLE in
167 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
168 ..._TYPE, IDENTIFIER_NODE.
169 In a STMT_EXPR, it means we want the result of the enclosed
170 expression.
172 static_flag:
174 TREE_STATIC in
175 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
176 TREE_NO_UNUSED_WARNING in
177 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
178 TREE_VIA_VIRTUAL in
179 TREE_LIST or TREE_VEC
180 TREE_CONSTANT_OVERFLOW in
181 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
182 TREE_SYMBOL_REFERENCED in
183 IDENTIFIER_NODE
184 CLEANUP_EH_ONLY in
185 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT,
186 TREE_LIST elements of a block's cleanup list.
188 public_flag:
190 TREE_OVERFLOW in
191 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
192 TREE_PUBLIC in
193 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
194 TREE_VIA_PUBLIC in
195 TREE_LIST or TREE_VEC
196 EXPR_WFL_EMIT_LINE_NOTE in
197 EXPR_WITH_FILE_LOCATION
199 private_flag:
201 TREE_VIA_PRIVATE in
202 TREE_LIST or TREE_VEC
203 TREE_PRIVATE in
204 ..._DECL
205 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
206 CALL_EXPR
208 protected_flag:
210 TREE_VIA_PROTECTED in
211 TREE_LIST
212 TREE_VEC
213 TREE_PROTECTED in
214 BLOCK
215 ..._DECL
217 side_effects_flag:
219 TREE_SIDE_EFFECTS in
220 all expressions
222 volatile_flag:
224 TREE_THIS_VOLATILE in
225 all expressions
226 TYPE_VOLATILE in
227 ..._TYPE
229 readonly_flag:
231 TREE_READONLY in
232 all expressions
233 TYPE_READONLY in
234 ..._TYPE
236 constant_flag:
238 TREE_CONSTANT in
239 all expressions
241 unsigned_flag:
243 TREE_UNSIGNED in
244 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
245 DECL_BUILT_IN_NONANSI in
246 FUNCTION_DECL
247 SAVE_EXPR_NOPLACEHOLDER in
248 SAVE_EXPR
250 asm_written_flag:
252 TREE_ASM_WRITTEN in
253 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
254 BLOCK
256 used_flag:
258 TREE_USED in
259 expressions, IDENTIFIER_NODE
261 nothrow_flag:
263 TREE_NOTHROW in
264 CALL_EXPR, FUNCTION_DECL
266 bounded_flag:
268 TREE_BOUNDED in
269 expressions, VAR_DECL, PARM_DECL, FIELD_DECL, FUNCTION_DECL,
270 IDENTIFIER_NODE
271 TYPE_BOUNDED in
272 ..._TYPE
274 deprecated_flag:
276 TREE_DEPRECATED in
277 ..._DECL
280 /* Define accessors for the fields that all tree nodes have
281 (though some fields are not used for all kinds of nodes). */
283 /* The tree-code says what kind of node it is.
284 Codes are defined in tree.def. */
285 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
286 #define TREE_SET_CODE(NODE, VALUE) \
287 ((NODE)->common.code = (ENUM_BITFIELD (tree_code)) (VALUE))
289 /* When checking is enabled, errors will be generated if a tree node
290 is accessed incorrectly. The macros abort with a fatal error. */
291 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
293 #define TREE_CHECK(t, code) __extension__ \
294 ({ const tree __t = (t); \
295 if (TREE_CODE(__t) != (code)) \
296 tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \
297 __t; })
298 #define TREE_CLASS_CHECK(t, class) __extension__ \
299 ({ const tree __t = (t); \
300 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
301 tree_class_check_failed (__t, class, __FILE__, __LINE__, \
302 __FUNCTION__); \
303 __t; })
305 /* These checks have to be special cased. */
306 #define CST_OR_CONSTRUCTOR_CHECK(t) __extension__ \
307 ({ const tree __t = (t); \
308 enum tree_code const __c = TREE_CODE(__t); \
309 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
310 tree_check_failed (__t, CONSTRUCTOR, __FILE__, __LINE__, \
311 __FUNCTION__); \
312 __t; })
313 #define EXPR_CHECK(t) __extension__ \
314 ({ const tree __t = (t); \
315 char const __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
316 if (__c != 'r' && __c != 's' && __c != '<' \
317 && __c != '1' && __c != '2' && __c != 'e') \
318 tree_class_check_failed (__t, 'e', __FILE__, __LINE__, \
319 __FUNCTION__); \
320 __t; })
322 #define TREE_VEC_ELT_CHECK(t, i) __extension__ \
323 (*({const tree __t = t; \
324 const int __i = (i); \
325 if (TREE_CODE (__t) != TREE_VEC) \
326 tree_check_failed (__t, TREE_VEC, \
327 __FILE__, __LINE__, __FUNCTION__); \
328 if (__i < 0 || __i >= __t->vec.length) \
329 tree_vec_elt_check_failed (__i, __t->vec.length, \
330 __FILE__, __LINE__, __FUNCTION__); \
331 &__t->vec.a[__i]; }))
333 extern void tree_check_failed PARAMS ((const tree, enum tree_code,
334 const char *, int, const char *))
335 ATTRIBUTE_NORETURN;
336 extern void tree_class_check_failed PARAMS ((const tree, int,
337 const char *, int, const char *))
338 ATTRIBUTE_NORETURN;
339 extern void tree_vec_elt_check_failed PARAMS ((int, int, const char *,
340 int, const char *))
341 ATTRIBUTE_NORETURN;
343 #else /* not ENABLE_TREE_CHECKING, or not gcc */
345 #define TREE_CHECK(t, code) (t)
346 #define TREE_CLASS_CHECK(t, code) (t)
347 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
348 #define EXPR_CHECK(t) (t)
349 #define TREE_VEC_ELT_CHECK(t, i) ((t)->vec.a[i])
351 #endif
353 #include "tree-check.h"
355 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
356 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
357 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
359 /* In all nodes that are expressions, this is the data type of the expression.
360 In POINTER_TYPE nodes, this is the type that the pointer points to.
361 In ARRAY_TYPE nodes, this is the type of the elements.
362 In VECTOR_TYPE nodes, this is the type of the elements. */
363 #define TREE_TYPE(NODE) ((NODE)->common.type)
365 /* Here is how primitive or already-canonicalized types' hash codes
366 are made. */
367 #define TYPE_HASH(TYPE) ((size_t) (TYPE) & 0777777)
369 /* Nodes are chained together for many purposes.
370 Types are chained together to record them for being output to the debugger
371 (see the function `chain_type').
372 Decls in the same scope are chained together to record the contents
373 of the scope.
374 Statement nodes for successive statements used to be chained together.
375 Often lists of things are represented by TREE_LIST nodes that
376 are chained together. */
378 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
380 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
381 that don't change the machine mode. */
383 #define STRIP_NOPS(EXP) \
384 while ((TREE_CODE (EXP) == NOP_EXPR \
385 || TREE_CODE (EXP) == CONVERT_EXPR \
386 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
387 && TREE_OPERAND (EXP, 0) != error_mark_node \
388 && (TYPE_MODE (TREE_TYPE (EXP)) \
389 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
390 (EXP) = TREE_OPERAND (EXP, 0)
392 /* Like STRIP_NOPS, but don't let the signedness change either. */
394 #define STRIP_SIGN_NOPS(EXP) \
395 while ((TREE_CODE (EXP) == NOP_EXPR \
396 || TREE_CODE (EXP) == CONVERT_EXPR \
397 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
398 && TREE_OPERAND (EXP, 0) != error_mark_node \
399 && (TYPE_MODE (TREE_TYPE (EXP)) \
400 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
401 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
402 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
403 (EXP) = TREE_OPERAND (EXP, 0)
405 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
407 #define STRIP_TYPE_NOPS(EXP) \
408 while ((TREE_CODE (EXP) == NOP_EXPR \
409 || TREE_CODE (EXP) == CONVERT_EXPR \
410 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
411 && TREE_OPERAND (EXP, 0) != error_mark_node \
412 && (TREE_TYPE (EXP) \
413 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
414 (EXP) = TREE_OPERAND (EXP, 0)
416 /* Nonzero if TYPE represents an integral type. Note that we do not
417 include COMPLEX types here. */
419 #define INTEGRAL_TYPE_P(TYPE) \
420 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
421 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
423 /* Nonzero if TYPE represents a floating-point type, including complex
424 floating-point types. */
426 #define FLOAT_TYPE_P(TYPE) \
427 (TREE_CODE (TYPE) == REAL_TYPE \
428 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
429 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
431 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
433 #define AGGREGATE_TYPE_P(TYPE) \
434 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
435 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
436 || TREE_CODE (TYPE) == SET_TYPE)
438 /* Nonzero if TYPE represents an unbounded pointer or unbounded
439 reference type. (It should be renamed to INDIRECT_TYPE_P.) */
441 #define POINTER_TYPE_P(TYPE) \
442 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
444 /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
446 #define BOUNDED_INDIRECT_TYPE_P(TYPE) \
447 (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
449 /* Nonzero if TYPE represents a bounded pointer type. */
451 #define BOUNDED_POINTER_TYPE_P(TYPE) \
452 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
453 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
455 /* Nonzero if TYPE represents a bounded reference type. Bounded
456 reference types have two specific uses: (1) When a reference is
457 seated to a variable-length RECORD_TYPE that has an array of
458 indeterminate length as its final field. For all other objects, it
459 is sufficient to check bounds at the time the reference is seated,
460 and assume that all future uses of the reference are safe, since
461 the address of references cannot change. (2) When a reference
462 supertype is seated to a subtype object. The bounds "remember"
463 the true size of the complete object, so that subsequent upcasts of
464 the address of the reference will be checked properly (is such a
465 thing valid C++?). */
467 #define BOUNDED_REFERENCE_TYPE_P(TYPE) \
468 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
469 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
471 /* Nonzero if TYPE represents a pointer or reference type, either
472 bounded or unbounded. */
474 #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
475 (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
477 /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
479 #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
480 (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
482 /* Nonzero if TYPE represents a reference type, either bounded or
483 unbounded. */
485 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
486 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
488 /* Nonzero if this type is a complete type. */
489 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
491 /* Nonzero if this type is the (possibly qualified) void type. */
492 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
494 /* Nonzero if this type is complete or is cv void. */
495 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
496 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
498 /* Nonzero if this type is complete or is an array with unspecified bound. */
499 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
500 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
502 /* Nonzero if TYPE represents a type. */
504 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
506 /* Define many boolean fields that all tree nodes have. */
508 /* In VAR_DECL nodes, nonzero means address of this is needed.
509 So it cannot be in a register.
510 In a FUNCTION_DECL, nonzero means its address is needed.
511 So it must be compiled even if it is an inline function.
512 In a FIELD_DECL node, it means that the programmer is permitted to
513 construct the address of this field. This is used for aliasing
514 purposes: see record_component_aliases.
515 In CONSTRUCTOR nodes, it means object constructed must be in memory.
516 In LABEL_DECL nodes, it means a goto for this label has been seen
517 from a place outside all binding contours that restore stack levels.
518 In ..._TYPE nodes, it means that objects of this type must
519 be fully addressable. This means that pieces of this
520 object cannot go into register parameters, for example.
521 In IDENTIFIER_NODEs, this means that some extern decl for this name
522 had its address taken. That matters for inline functions. */
523 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
525 /* In a VAR_DECL, nonzero means allocate static storage.
526 In a FUNCTION_DECL, nonzero if function has been defined.
527 In a CONSTRUCTOR, nonzero means allocate static storage. */
528 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
530 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a
531 block's cleanup list, means that the pertinent cleanup should only be
532 executed if an exception is thrown, not on normal exit of its scope. */
533 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
535 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
536 made implicitly and should not lead to an "unused value" warning. */
537 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
539 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
540 chain is via a `virtual' declaration. */
541 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
543 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
544 there was an overflow in folding. This is distinct from
545 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
546 occur in constant expressions. */
547 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
549 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
550 this string as an argument. */
551 #define TREE_SYMBOL_REFERENCED(NODE) \
552 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
554 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
555 there was an overflow in folding, and no warning has been issued
556 for this subexpression. TREE_OVERFLOW implies
557 TREE_CONSTANT_OVERFLOW, but not vice versa. */
558 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
560 /* In a VAR_DECL or FUNCTION_DECL,
561 nonzero means name is to be accessible from outside this module.
562 In an IDENTIFIER_NODE, nonzero means an external declaration
563 accessible from outside this module was previously seen
564 for this name in an inner scope. */
565 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
567 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
568 base class is via a `public' declaration, which preserves public
569 fields from the base class as public. */
570 #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
572 /* Ditto, for `private' declarations. */
573 #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
575 /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
576 base class is via a `protected' declaration, which preserves
577 protected fields from the base class as protected.
578 OVERLOADED. */
579 #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
581 /* In any expression, nonzero means it has side effects or reevaluation
582 of the whole expression could produce a different value.
583 This is set if any subexpression is a function call, a side effect
584 or a reference to a volatile variable.
585 In a ..._DECL, this is set only if the declaration said `volatile'. */
586 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
588 /* Nonzero means this expression is volatile in the C sense:
589 its address should be of type `volatile WHATEVER *'.
590 In other words, the declared item is volatile qualified.
591 This is used in _DECL nodes and _REF nodes.
593 In a ..._TYPE node, means this type is volatile-qualified.
594 But use TYPE_VOLATILE instead of this macro when the node is a type,
595 because eventually we may make that a different bit.
597 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
598 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
600 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
601 nonzero means it may not be the lhs of an assignment.
602 In a ..._TYPE node, means this type is const-qualified
603 (but the macro TYPE_READONLY should be used instead of this macro
604 when the node is a type). */
605 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
607 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
608 #define TREE_READONLY_DECL_P(NODE) (TREE_READONLY (NODE) && DECL_P (NODE))
610 /* Value of expression is constant.
611 Always appears in all ..._CST nodes.
612 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
613 if the value is constant. */
614 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
616 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
617 In FIELD_DECL nodes, means an unsigned bit field.
618 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
619 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
621 #define TYPE_TRAP_SIGNED(NODE) \
622 (flag_trapv && ! TREE_UNSIGNED (TYPE_CHECK (NODE)))
624 /* Nonzero in a VAR_DECL means assembler code has been written.
625 Nonzero in a FUNCTION_DECL means that the function has been compiled.
626 This is interesting in an inline function, since it might not need
627 to be compiled separately.
628 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
629 if the sdb debugging info for the type has been written.
630 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
631 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
633 /* Nonzero in a _DECL if the name is used in its scope.
634 Nonzero in an expr node means inhibit warning if value is unused.
635 In IDENTIFIER_NODEs, this means that some extern decl for this name
636 was used. */
637 #define TREE_USED(NODE) ((NODE)->common.used_flag)
639 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
640 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
641 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
643 /* In a CALL_EXPR, means that the address of the return slot is part of the
644 argument list. */
645 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
647 /* In a type, nonzero means that all objects of the type are guaranteed by the
648 language or front-end to be properly aligned, so we can indicate that a MEM
649 of this type is aligned at least to the alignment of the type, even if it
650 doesn't appear that it is. We see this, for example, in object-oriented
651 languages where a tag field may show this is an object of a more-aligned
652 variant of the more generic type. */
653 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
655 /* Used in classes in C++. */
656 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
657 /* Used in classes in C++.
658 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
659 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
661 /* In a ..._TYPE node, nonzero means that the type's size and layout,
662 (or the size and layout of its arguments and/or return value in the
663 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
664 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
665 node is a type, because eventually we may make that a different
666 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
667 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
668 BOUNDED_INDIRECT_TYPE_P to test for that.
670 In a FUNCTION_DECL, nonzero means that the size and layout of one
671 of its arguments and/or return value was changed by the presence of
672 pointer bounds. This value can differ from the value of
673 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
674 declared, then later called with pointer args, or was declared with
675 a variable argument list and is later called with pointer values in
676 the variable argument list.
678 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
679 of the decl's type's BOUNDED_POINTER_TYPE_P.
681 In a CONSTRUCTOR or other expression, nonzero means the value is a
682 bounded pointer. It is insufficient to determine the boundedness
683 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
684 since we allow pointer to be temporarily cast to integer for
685 rounding up to an alignment boundary in a way that preserves the
686 pointer's bounds.
688 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
689 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
690 of a function that has bounded pointer(s) for its return type and/or
691 argument type(s). */
693 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
695 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
696 deprecated feature by __attribute__((deprecated)). */
697 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
699 /* These flags are available for each language front end to use internally. */
700 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
701 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
702 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
703 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
704 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
705 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
706 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
708 /* Define additional fields and accessors for nodes representing constants. */
710 /* In an INTEGER_CST node. These two together make a 2-word integer.
711 If the data type is signed, the value is sign-extended to 2 words
712 even though not all of them may really be in use.
713 In an unsigned constant shorter than 2 words, the extra bits are 0. */
714 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
715 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
716 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
718 #define INT_CST_LT(A, B) \
719 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
720 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
721 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
723 #define INT_CST_LT_UNSIGNED(A, B) \
724 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
725 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
726 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
727 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
728 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
730 struct tree_int_cst GTY(())
732 struct tree_common common;
733 rtx rtl; /* acts as link to register transfer language
734 (rtl) info */
735 /* A sub-struct is necessary here because the function `const_hash'
736 wants to scan both words as a unit and taking the address of the
737 sub-struct yields the properly inclusive bounded pointer. */
738 struct tree_int_cst_lowhi {
739 unsigned HOST_WIDE_INT low;
740 HOST_WIDE_INT high;
741 } int_cst;
744 /* In REAL_CST, STRING_CST, COMPLEX_CST, VECTOR_CST nodes, and
745 CONSTRUCTOR nodes, and generally in all kinds of constants that
746 could be given labels (rather than being immediate). */
748 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
750 /* In a REAL_CST node. struct real_value is an opaque entity, with
751 manipulators defined in real.h. We don't want tree.h depending on
752 real.h and transitively on tm.h. */
753 struct real_value;
755 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
756 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
758 struct tree_real_cst GTY(())
760 struct tree_common common;
761 rtx rtl; /* acts as link to register transfer language (rtl) info */
762 struct real_value * real_cst_ptr;
765 /* In a STRING_CST */
766 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
767 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
769 struct tree_string GTY(())
771 struct tree_common common;
772 rtx rtl; /* acts as link to register transfer language (rtl) info */
773 int length;
774 const char *pointer;
777 /* In a COMPLEX_CST node. */
778 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
779 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
781 struct tree_complex GTY(())
783 struct tree_common common;
784 rtx rtl; /* acts as link to register transfer language (rtl) info */
785 tree real;
786 tree imag;
789 /* In a VECTOR_CST node. */
790 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
792 struct tree_vector GTY(())
794 struct tree_common common;
795 rtx rtl;
796 tree elements;
799 #include "hashtable.h"
801 /* Define fields and accessors for some special-purpose tree nodes. */
803 #define IDENTIFIER_LENGTH(NODE) \
804 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
805 #define IDENTIFIER_POINTER(NODE) \
806 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
808 /* Translate a hash table identifier pointer to a tree_identifier
809 pointer, and vice versa. */
811 #define HT_IDENT_TO_GCC_IDENT(NODE) \
812 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
813 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
815 struct tree_identifier GTY(())
817 struct tree_common common;
818 struct ht_identifier id;
821 /* In a TREE_LIST node. */
822 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
823 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
825 struct tree_list GTY(())
827 struct tree_common common;
828 tree purpose;
829 tree value;
832 /* In a TREE_VEC node. */
833 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
834 #define TREE_VEC_END(NODE) \
835 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
837 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
839 struct tree_vec GTY(())
841 struct tree_common common;
842 int length;
843 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
846 /* Define fields and accessors for some nodes that represent expressions. */
848 /* In a SAVE_EXPR node. */
849 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND (SAVE_EXPR_CHECK (NODE), 1)
850 #define SAVE_EXPR_RTL(NODE) (*(rtx *) &SAVE_EXPR_CHECK (NODE)->exp.operands[2])
851 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (SAVE_EXPR_CHECK (NODE))
852 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
853 both in normal code and in a handler. (Normally, in a handler, all
854 SAVE_EXPRs are unsaved, meaning that their values are
855 recalculated.) */
856 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
858 /* In a RTL_EXPR node. */
859 #define RTL_EXPR_SEQUENCE(NODE) \
860 (*(rtx *) &RTL_EXPR_CHECK (NODE)->exp.operands[0])
861 #define RTL_EXPR_RTL(NODE) (*(rtx *) &RTL_EXPR_CHECK (NODE)->exp.operands[1])
863 /* In a WITH_CLEANUP_EXPR node. */
864 #define WITH_CLEANUP_EXPR_RTL(NODE) \
865 (*(rtx *) &WITH_CLEANUP_EXPR_CHECK (NODE)->exp.operands[2])
867 /* In a CONSTRUCTOR node. */
868 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (CONSTRUCTOR_CHECK (NODE), 1)
870 /* In ordinary expression nodes. */
871 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
872 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
874 /* In a LABELED_BLOCK_EXPR node. */
875 #define LABELED_BLOCK_LABEL(NODE) \
876 TREE_OPERAND (LABELED_BLOCK_EXPR_CHECK (NODE), 0)
877 #define LABELED_BLOCK_BODY(NODE) \
878 TREE_OPERAND (LABELED_BLOCK_EXPR_CHECK (NODE), 1)
880 /* In an EXIT_BLOCK_EXPR node. */
881 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
882 TREE_OPERAND (EXIT_BLOCK_EXPR_CHECK (NODE), 0)
883 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (EXIT_BLOCK_EXPR_CHECK (NODE), 1)
885 /* In a LOOP_EXPR node. */
886 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (LOOP_EXPR_CHECK (NODE), 0)
888 /* In an EXPR_WITH_FILE_LOCATION node. */
889 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \
890 (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag)
891 #define EXPR_WFL_NODE(NODE) \
892 TREE_OPERAND (EXPR_WITH_FILE_LOCATION_CHECK (NODE), 0)
893 #define EXPR_WFL_FILENAME_NODE(NODE) \
894 TREE_OPERAND (EXPR_WITH_FILE_LOCATION_CHECK (NODE), 1)
895 #define EXPR_WFL_FILENAME(NODE) \
896 IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE (NODE))
897 /* ??? Java uses this in all expressions. */
898 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
899 #define EXPR_WFL_LINENO(NODE) (EXPR_WFL_LINECOL (NODE) >> 12)
900 #define EXPR_WFL_COLNO(NODE) (EXPR_WFL_LINECOL (NODE) & 0xfff)
901 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
902 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
904 /* In a TARGET_EXPR node. */
905 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND (TARGET_EXPR_CHECK (NODE), 0)
906 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND (TARGET_EXPR_CHECK (NODE), 1)
907 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND (TARGET_EXPR_CHECK (NODE), 2)
909 struct tree_exp GTY(())
911 struct tree_common common;
912 int complexity;
913 tree GTY ((special ("tree_exp"),
914 desc ("TREE_CODE ((tree) &%0)")))
915 operands[1];
918 /* In a BLOCK node. */
919 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
920 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
921 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
922 /* Note: when changing this, make sure to find the places
923 that use chainon or nreverse. */
924 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
925 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
926 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
928 /* Nonzero means that this block is prepared to handle exceptions
929 listed in the BLOCK_VARS slot. */
930 #define BLOCK_HANDLER_BLOCK(NODE) \
931 (BLOCK_CHECK (NODE)->block.handler_block_flag)
933 /* An index number for this block. These values are not guaranteed to
934 be unique across functions -- whether or not they are depends on
935 the debugging output format in use. */
936 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
938 /* If block reordering splits a lexical block into discontiguous
939 address ranges, we'll make a copy of the original block.
941 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
942 In that case, we have one source block that has been replicated
943 (through inlining or unrolling) into many logical blocks, and that
944 these logical blocks have different physical variables in them.
946 In this case, we have one logical block split into several
947 non-contiguous address ranges. Most debug formats can't actually
948 represent this idea directly, so we fake it by creating multiple
949 logical blocks with the same variables in them. However, for those
950 that do support non-contiguous regions, these allow the original
951 logical block to be reconstructed, along with the set of address
952 ranges.
954 One of the logical block fragments is arbitrarily chosen to be
955 the ORIGIN. The other fragments will point to the origin via
956 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
957 be null. The list of fragments will be chained through
958 BLOCK_FRAGMENT_CHAIN from the origin. */
960 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
961 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
963 struct tree_block GTY(())
965 struct tree_common common;
967 unsigned handler_block_flag : 1;
968 unsigned abstract_flag : 1;
969 unsigned block_num : 30;
971 tree vars;
972 tree subblocks;
973 tree supercontext;
974 tree abstract_origin;
975 tree fragment_origin;
976 tree fragment_chain;
979 /* Define fields and accessors for nodes representing data types. */
981 /* See tree.def for documentation of the use of these fields.
982 Look at the documentation of the various ..._TYPE tree codes. */
984 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
985 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
986 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
987 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
988 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
989 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
990 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
991 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
992 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
993 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
994 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
995 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
996 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
997 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
998 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
999 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
1000 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1001 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1002 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1003 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1004 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1005 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1006 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1007 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1008 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1010 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1011 in the debugging output. We use this to describe a vector as a
1012 structure containing an array. */
1013 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
1015 /* Indirect types present difficulties because they may be represented
1016 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
1017 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
1018 be logically equivalent, but physically different. Simple
1019 comparison of the main variant only tells if the types are
1020 logically equivalent. Use this predicate to compare for physical
1021 equivalency. */
1023 /* Types have the same main variant, and have the same boundedness. */
1024 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
1025 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
1026 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
1028 /* Return the type variant that has no qualifiers (i.e., the main variant),
1029 except that the boundedness qualifier is preserved. */
1030 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
1031 (BOUNDED_POINTER_TYPE_P (TYPE) \
1032 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
1033 : TYPE_MAIN_VARIANT (TYPE))
1035 /* For aggregate types, information about this type, as a base type
1036 for itself. Used in a language-dependent way for types that are
1037 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
1038 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
1040 /* The (language-specific) typed-based alias set for this type.
1041 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1042 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1043 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1044 type can alias objects of any type. */
1045 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1047 /* Nonzero iff the typed-based alias set for this type has been
1048 calculated. */
1049 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1051 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1052 to this type. */
1053 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1055 /* The alignment necessary for objects of this type.
1056 The value is an int, measured in bits. */
1057 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1059 /* 1 if the alignment for this type was requested by "aligned" attribute,
1060 0 if it is the default for this type. */
1061 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1063 /* The alignment for NODE, in bytes. */
1064 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1066 /* If your language allows you to declare types, and you want debug info
1067 for them, then you need to generate corresponding TYPE_DECL nodes.
1068 These "stub" TYPE_DECL nodes have no name, and simply point at the
1069 type node. You then set the TYPE_STUB_DECL field of the type node
1070 to point back at the TYPE_DECL node. This allows the debug routines
1071 to know that the two nodes represent the same type, so that we only
1072 get one debug info record for them. */
1073 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1075 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1076 has BLKmode only because it lacks the alignment requirement for
1077 its size. */
1078 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1080 /* In an INTEGER_TYPE, it means the type represents a size. We use
1081 this both for validity checking and to permit optimizations that
1082 are unsafe for other types. Note that the C `size_t' type should
1083 *not* have this flag set. The `size_t' type is simply a typedef
1084 for an ordinary integer type that happens to be the type of an
1085 expression returned by `sizeof'; `size_t' has no special
1086 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1087 always actual sizes. */
1088 #define TYPE_IS_SIZETYPE(NODE) \
1089 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1091 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1092 pointer depressed. */
1093 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1094 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1096 /* Nonzero in a type considered volatile as a whole. */
1097 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1099 /* Means this type is const-qualified. */
1100 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1102 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1103 the term. */
1104 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1106 /* If nonzero, this type's size and layout, (or the size and layout of
1107 its arguments and/or return value in the case of a FUNCTION_TYPE or
1108 METHOD_TYPE) was changed by the presence of pointer bounds. */
1109 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
1111 /* There is a TYPE_QUAL value for each type qualifier. They can be
1112 combined by bitwise-or to form the complete set of qualifiers for a
1113 type. */
1115 #define TYPE_UNQUALIFIED 0x0
1116 #define TYPE_QUAL_CONST 0x1
1117 #define TYPE_QUAL_VOLATILE 0x2
1118 #define TYPE_QUAL_RESTRICT 0x4
1119 #define TYPE_QUAL_BOUNDED 0x8
1121 /* The set of type qualifiers for this type. */
1122 #define TYPE_QUALS(NODE) \
1123 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1124 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1125 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1126 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
1128 /* The set of qualifiers pertinent to an expression node. */
1129 #define TREE_EXPR_QUALS(NODE) \
1130 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1131 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1132 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
1134 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
1135 #define TREE_FUNC_QUALS(NODE) \
1136 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1137 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
1139 /* These flags are available for each language front end to use internally. */
1140 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1141 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1142 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1143 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1144 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1145 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1146 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1148 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1149 that distinguish string from array of char).
1150 If set in a SET_TYPE, indicates a bitstring type. */
1151 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1153 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1154 object of the given ARRAY_TYPE. This allows temporaries to be
1155 allocated. */
1156 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1157 TYPE_MAX_VALUE (ARRAY_TYPE_CHECK (ARRAY_TYPE))
1159 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1160 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1161 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1163 /* Indicates that objects of this type must be initialized by calling a
1164 function when they are created. */
1165 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1166 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1168 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1169 the same way that the first union alternative would be passed. */
1170 #define TYPE_TRANSPARENT_UNION(NODE) \
1171 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1173 /* For an ARRAY_TYPE, indicates that it is not permitted to
1174 take the address of a component of the type. */
1175 #define TYPE_NONALIASED_COMPONENT(NODE) \
1176 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1178 /* Indicated that objects of this type should be laid out in as
1179 compact a way as possible. */
1180 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1182 /* A bounded pointer or bounded reference type (collectively called
1183 indirect types) is represented as a RECORD_TYPE node containing
1184 three pointer fields whose type is the corresponding unbounded
1185 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1186 a bounded indirect type differs from a normal RECORD_TYPE node in
1187 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1188 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1189 nodes are stored on the same type variant chain alongside the
1190 variants of the underlaying indirect types nodes. The main variant
1191 of such chains is always the unbounded type. */
1193 /* Access the field decls of a bounded-pointer type. */
1194 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1195 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1196 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1198 /* Access the simple-pointer subtype of a bounded-pointer type. */
1199 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1201 /* Find the unbounded counterpart to a type, or return TYPE if it is
1202 already unbounded. */
1203 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1204 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1206 /* This field comprises two bits, for values in the range 0..3:
1208 depth=0 means that type is a scalar, or an aggregate that contains
1209 only depth=0 types, or a function that has only depth=0 types for
1210 its return value and argument types.
1212 depth=1 means that type is a pointer to a depth=0 type, or an
1213 aggregate that contains only depth=0 and depth=1 types, or a
1214 function that has only depth=0 and depth=1 types for its return
1215 value and argument types.
1217 The meanings of depth=2 and depth=3 are obvious by induction.
1218 Varargs functions are depth=3. The type `va_list' is depth=3.
1220 The purpose of measuring pointer depth of a type is to determine
1221 the eligibility of a function for an automatically-generated
1222 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1223 depth=1 function is eligible for an automatic thunk. Functions
1224 with depth 2 or more are too complex to get automatic thunks.
1226 Function decls also have a pointer_depth field, since we also
1227 consider the actual argument types for functions. */
1229 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1231 /* In a FUNCTION_TYPE node, this bit stores the value of
1232 default_pointer_boundedness at the time TYPE was created. It is
1233 useful for choosing default boundedness of function arguments for
1234 non-prototype function decls and for varargs/stdarg lists. */
1235 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1236 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1238 #define MAX_POINTER_DEPTH 2
1239 #define VA_LIST_POINTER_DEPTH 3
1241 struct die_struct;
1243 struct tree_type GTY(())
1245 struct tree_common common;
1246 tree values;
1247 tree size;
1248 tree size_unit;
1249 tree attributes;
1250 unsigned int uid;
1252 unsigned int precision : 9;
1253 ENUM_BITFIELD(machine_mode) mode : 7;
1255 unsigned string_flag : 1;
1256 unsigned no_force_blk_flag : 1;
1257 unsigned needs_constructing_flag : 1;
1258 unsigned transparent_union_flag : 1;
1259 unsigned packed_flag : 1;
1260 unsigned restrict_flag : 1;
1261 unsigned pointer_depth : 2;
1263 unsigned lang_flag_0 : 1;
1264 unsigned lang_flag_1 : 1;
1265 unsigned lang_flag_2 : 1;
1266 unsigned lang_flag_3 : 1;
1267 unsigned lang_flag_4 : 1;
1268 unsigned lang_flag_5 : 1;
1269 unsigned lang_flag_6 : 1;
1270 unsigned user_align : 1;
1272 unsigned int align;
1273 tree pointer_to;
1274 tree reference_to;
1275 union tree_type_symtab {
1276 int GTY ((tag ("0"))) address;
1277 char * GTY ((tag ("1"))) pointer;
1278 struct die_struct * GTY ((tag ("2"))) die;
1279 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1280 descbits ("2"))) symtab;
1281 tree name;
1282 tree minval;
1283 tree maxval;
1284 tree next_variant;
1285 tree main_variant;
1286 tree binfo;
1287 tree context;
1288 HOST_WIDE_INT alias_set;
1289 /* Points to a structure whose details depend on the language in use. */
1290 struct lang_type *lang_specific;
1293 /* Define accessor macros for information about type inheritance
1294 and basetypes.
1296 A "basetype" means a particular usage of a data type for inheritance
1297 in another type. Each such basetype usage has its own "binfo"
1298 object to describe it. The binfo object is a TREE_VEC node.
1300 Inheritance is represented by the binfo nodes allocated for a
1301 given type. For example, given types C and D, such that D is
1302 inherited by C, 3 binfo nodes will be allocated: one for describing
1303 the binfo properties of C, similarly one for D, and one for
1304 describing the binfo properties of D as a base type for C.
1305 Thus, given a pointer to class C, one can get a pointer to the binfo
1306 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1308 /* The actual data type node being inherited in this basetype. */
1309 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1311 /* The offset where this basetype appears in its containing type.
1312 BINFO_OFFSET slot holds the offset (in bytes)
1313 from the base of the complete object to the base of the part of the
1314 object that is allocated on behalf of this `type'.
1315 This is always 0 except when there is multiple inheritance. */
1317 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1318 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1319 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1321 /* The virtual function table belonging to this basetype. Virtual
1322 function tables provide a mechanism for run-time method dispatching.
1323 The entries of a virtual function table are language-dependent. */
1325 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1326 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1328 /* The virtual functions in the virtual function table. This is
1329 a TREE_LIST that is used as an initial approximation for building
1330 a virtual function table for this basetype. */
1331 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1332 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1334 /* A vector of binfos for the direct basetypes inherited by this
1335 basetype.
1337 If this basetype describes type D as inherited in C, and if the
1338 basetypes of D are E and F, then this vector contains binfos for
1339 inheritance of E and F by C.
1341 ??? This could probably be done by just allocating the
1342 base types at the end of this TREE_VEC (instead of using
1343 another TREE_VEC). This would simplify the calculation
1344 of how many basetypes a given type had. */
1345 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1346 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1348 /* The number of basetypes for NODE. */
1349 #define BINFO_N_BASETYPES(NODE) \
1350 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1352 /* Accessor macro to get to the Nth basetype of this basetype. */
1353 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1354 #define TYPE_BINFO_BASETYPE(NODE,N) \
1355 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1357 /* For a BINFO record describing a virtual base class, i.e., one where
1358 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1359 base. The actual contents are language-dependent. Under the old
1360 ABI, the C++ front-end uses a FIELD_DECL whose contents are a
1361 pointer to the virtual base; under the new ABI this field is
1362 instead an INTEGER_CST giving an offset into the vtable where the
1363 offset to the virtual base can be found. */
1364 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1366 /* The size of a base class subobject of this type. Not all frontends
1367 currently allocate the space for these fields. */
1368 #define BINFO_SIZE(NODE) TREE_VEC_ELT (NODE, 6)
1369 #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT (NODE, 7)
1370 #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
1371 #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE))
1373 /* Slot used to build a chain that represents a use of inheritance.
1374 For example, if X is derived from Y, and Y is derived from Z,
1375 then this field can be used to link the binfo node for X to
1376 the binfo node for X's Y to represent the use of inheritance
1377 from X to Y. Similarly, this slot of the binfo node for X's Y
1378 can point to the Z from which Y is inherited (in X's inheritance
1379 hierarchy). In this fashion, one can represent and traverse specific
1380 uses of inheritance using the binfo nodes themselves (instead of
1381 consing new space pointing to binfo nodes).
1382 It is up to the language-dependent front-ends to maintain
1383 this information as necessary. */
1384 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1386 /* Define fields and accessors for nodes representing declared names. */
1388 /* Nonzero if DECL represents a decl. */
1389 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1391 /* This is the name of the object as written by the user.
1392 It is an IDENTIFIER_NODE. */
1393 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1395 /* The name of the object as the assembler will see it (but before any
1396 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1397 as DECL_NAME. It is an IDENTIFIER_NODE. */
1398 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1400 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1401 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1402 yet. */
1403 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1404 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1406 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1407 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1408 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1410 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1411 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1412 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1413 semantics of using this macro, are different than saying:
1415 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1417 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1419 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1420 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1421 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1422 DECL_ASSEMBLER_NAME (DECL1)) \
1423 : (void) 0)
1425 /* Records the section name in a section attribute. Used to pass
1426 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1427 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1429 /* For FIELD_DECLs, this is the
1430 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1431 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1432 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1433 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1434 type, or NULL_TREE if the given decl has "file scope". */
1435 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1436 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1437 /* In a DECL this is the field where attributes are stored. */
1438 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1439 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1440 byte containing the bit closest to the beginning of the structure. */
1441 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1442 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1443 field from DECL_FIELD_OFFSET. */
1444 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1445 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1446 if so, the type that was originally specified for it.
1447 TREE_TYPE may have been modified (in finish_struct). */
1448 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1449 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1450 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1451 uses. */
1452 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1453 /* This field is used to reference anything in decl.result and is meant only
1454 for use by the garbage collector. */
1455 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1456 /* In FUNCTION_DECL, holds the decl for the return value. */
1457 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1458 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1459 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1460 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1461 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1462 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1463 For a VAR_DECL, holds the initial value.
1464 For a PARM_DECL, not used--default
1465 values for parameters are encoded in the type of the function,
1466 not in the PARM_DECL slot. */
1467 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1468 /* For a PARM_DECL, records the data type used to pass the argument,
1469 which may be different from the type seen in the program. */
1470 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1471 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1472 if nonzero, indicates that the field occupies the type. */
1473 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1474 /* These two fields describe where in the source code the declaration
1475 was. If the declaration appears in several places (as for a C
1476 function that is declared first and then defined later), this
1477 information should refer to the definition. */
1478 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1479 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1480 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1481 /* Holds the size of the datum, in bits, as a tree expression.
1482 Need not be constant. */
1483 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1484 /* Likewise for the size in bytes. */
1485 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1486 /* Holds the alignment required for the datum, in bits. */
1487 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1488 /* The alignment of NODE, in bytes. */
1489 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1490 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1491 DECL_FIELD_OFFSET which are known to be always zero.
1492 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1493 has. */
1494 #define DECL_OFFSET_ALIGN(NODE) \
1495 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1496 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1497 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1498 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1499 /* 1 if the alignment for this type was requested by "aligned" attribute,
1500 0 if it is the default for this type. */
1501 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1502 /* Holds the machine mode corresponding to the declaration of a variable or
1503 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1504 FIELD_DECL. */
1505 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1506 /* Holds the RTL expression for the value of a variable or function. If
1507 PROMOTED_MODE is defined, the mode of this expression may not be same
1508 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1509 to the variable's data type, while the mode
1510 of DECL_RTL is the mode actually used to contain the data.
1512 This value can be evaluated lazily for functions, variables with
1513 static storage duration, and labels. */
1514 #define DECL_RTL(NODE) \
1515 (DECL_CHECK (NODE)->decl.rtl \
1516 ? (NODE)->decl.rtl \
1517 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1518 /* Set the DECL_RTL for NODE to RTL. */
1519 #define SET_DECL_RTL(NODE, RTL) (DECL_CHECK (NODE)->decl.rtl = (RTL))
1520 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1521 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1522 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1523 NODE1, it will not be set for NODE2; this is a lazy copy. */
1524 #define COPY_DECL_RTL(NODE1, NODE2) \
1525 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1526 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1527 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1529 /* Holds an INSN_LIST of all of the live ranges in which the variable
1530 has been moved to a possibly different register. */
1531 #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1533 /* For PARM_DECL, holds an RTL for the stack slot or register
1534 where the data was actually passed. */
1535 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1537 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1538 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1540 /* For FUNCTION_DECL, if it is built-in,
1541 this identifies which built-in operation it is. */
1542 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1544 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1545 Before the struct containing the FUNCTION_DECL is laid out,
1546 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1547 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1548 function. When the class is laid out, this pointer is changed
1549 to an INTEGER_CST node which is suitable for use as an index
1550 into the virtual function table. */
1551 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1553 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1554 which this FIELD_DECL is defined. This information is needed when
1555 writing debugging information about vfield and vbase decls for C++. */
1556 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1558 /* Every ..._DECL node gets a unique number. */
1559 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1561 /* For any sort of a ..._DECL node, this points to the original (abstract)
1562 decl node which this decl is an instance of, or else it is NULL indicating
1563 that this decl is not an instance of some other decl. For example,
1564 in a nested declaration of an inline function, this points back to the
1565 definition. */
1566 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1568 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1569 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1570 #define DECL_ORIGIN(NODE) \
1571 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1573 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1574 inline instance of some original (abstract) decl from an inline function;
1575 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1576 nodes can also have their abstract origin set to themselves. */
1577 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1578 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1580 /* Nonzero if a _DECL means that the name of this decl should be ignored
1581 for symbolic debug purposes. */
1582 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1584 /* Nonzero for a given ..._DECL node means that this node represents an
1585 "abstract instance" of the given declaration (e.g. in the original
1586 declaration of an inline function). When generating symbolic debugging
1587 information, we mustn't try to generate any address information for nodes
1588 marked as "abstract instances" because we don't actually generate
1589 any code or allocate any data space for such instances. */
1590 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1592 /* Nonzero if a _DECL means that no warnings should be generated just
1593 because this decl is unused. */
1594 #define DECL_IN_SYSTEM_HEADER(NODE) \
1595 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1597 /* Nonzero for a given ..._DECL node means that this node should be
1598 put in .common, if possible. If a DECL_INITIAL is given, and it
1599 is not error_mark_node, then the decl cannot be put in .common. */
1600 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1602 /* Language-specific decl information. */
1603 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1605 /* In a VAR_DECL or FUNCTION_DECL,
1606 nonzero means external reference:
1607 do not allocate storage, and refer to a definition elsewhere. */
1608 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1610 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1611 initializations. */
1612 #define DEFAULT_INIT_PRIORITY 65535
1613 #define MAX_INIT_PRIORITY 65535
1614 #define MAX_RESERVED_INIT_PRIORITY 100
1616 /* In a TYPE_DECL
1617 nonzero means the detail info about this type is not dumped into stabs.
1618 Instead it will generate cross reference ('x') of names.
1619 This uses the same flag as DECL_EXTERNAL. */
1620 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1621 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1623 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1624 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1626 /* In LABEL_DECL nodes, nonzero means that an error message about
1627 jumping into such a binding contour has been printed for this label. */
1628 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1630 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1631 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1633 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1634 static chain is not needed. */
1635 #define DECL_NO_STATIC_CHAIN(NODE) \
1636 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1638 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1639 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1641 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1643 Also set in some languages for variables, etc., outside the normal
1644 lexical scope, such as class instance variables. */
1645 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1647 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1648 where it is called. */
1649 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1651 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1652 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1654 /* In a VAR_DECL, nonzero if the data should be allocated from
1655 thread-local storage. */
1656 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
1658 /* In a FUNCTION_DECL, the saved representation of the body of the
1659 entire function. Usually a COMPOUND_STMT, but in C++ this may also
1660 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
1661 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1663 /* List of FUNCTION_DECLs inlined into this function's body. */
1664 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1666 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1667 that is not specified by ansi C and that users are supposed to be allowed
1668 to redefine for any purpose whatever. */
1669 #define DECL_BUILT_IN_NONANSI(NODE) \
1670 (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag)
1672 /* Nonzero in a FUNCTION_DECL means this function should be treated
1673 as if it were a malloc, meaning it returns a pointer that is
1674 not an alias. */
1675 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1677 /* Nonzero in a FUNCTION_DECL means this function should be treated
1678 as "pure" function (like const function, but may read global memory). */
1679 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1681 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1682 specially. */
1683 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1685 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1686 contour that restored a stack level and which is now exited. */
1687 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1689 /* Unused in FUNCTION_DECL. */
1691 /* In a VAR_DECL that's static,
1692 nonzero if the space is in the text section. */
1693 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1695 /* In a FUNCTION_DECL, nonzero means a built in function. */
1696 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1698 /* For a builtin function, identify which part of the compiler defined it. */
1699 #define DECL_BUILT_IN_CLASS(NODE) \
1700 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1702 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1703 Used in FIELD_DECLs for vtable pointers.
1704 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1705 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1707 /* Used to indicate that the linkage status of this DECL is not yet known,
1708 so it should not be output now. */
1709 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1711 /* Used in PARM_DECLs whose type are unions to indicate that the
1712 argument should be passed in the same way that the first union
1713 alternative would be passed. */
1714 #define DECL_TRANSPARENT_UNION(NODE) \
1715 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1717 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1718 at the beginning or end of execution. */
1719 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1720 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1722 #define DECL_STATIC_DESTRUCTOR(NODE) \
1723 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1725 /* Used to indicate that this DECL represents a compiler-generated entity. */
1726 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1728 /* Used to indicate that this DECL has weak linkage. */
1729 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1731 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1732 multiple translation units should be merged. */
1733 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1735 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1736 not be put out unless it is needed in this translation unit.
1737 Entities like this are shared across translation units (like weak
1738 entities), but are guaranteed to be generated by any translation
1739 unit that needs them, and therefore need not be put out anywhere
1740 where they are not needed. DECL_COMDAT is just a hint to the
1741 back-end; it is up to front-ends which set this flag to ensure
1742 that there will never be any harm, other than bloat, in putting out
1743 something which is DECL_COMDAT. */
1744 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1746 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1747 be instrumented with calls to support routines. */
1748 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1749 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1751 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1752 disabled in this function. */
1753 #define DECL_NO_LIMIT_STACK(NODE) \
1754 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1756 /* Additional flags for language-specific uses. */
1757 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1758 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1759 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1760 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1761 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1762 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1763 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1764 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1766 /* Used to indicate that the pointer to this DECL cannot be treated as
1767 an address constant. */
1768 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1770 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1771 this component. */
1772 #define DECL_NONADDRESSABLE_P(NODE) \
1773 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1775 /* Used to indicate an alias set for the memory pointed to by this
1776 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1777 pointer (or reference) type. */
1778 #define DECL_POINTER_ALIAS_SET(NODE) \
1779 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1781 /* Nonzero if an alias set has been assigned to this declaration. */
1782 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1783 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1785 /* The pointer_depth field comprises two bits for values in the range
1786 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's
1787 type node, but for functions it migth be greater. For example,
1788 this can happen when the function is declared to accept a parameter
1789 of type void* (depth=1), but is actually called with an argument of
1790 type foo** (depth=2). The function type will get the formal
1791 parameter's depth, but the function decl will get the actual
1792 argument's depth. */
1793 #define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth)
1795 struct function;
1797 struct tree_decl GTY(())
1799 struct tree_common common;
1800 location_t locus;
1801 unsigned int uid;
1802 tree size;
1803 ENUM_BITFIELD(machine_mode) mode : 8;
1805 unsigned external_flag : 1;
1806 unsigned nonlocal_flag : 1;
1807 unsigned regdecl_flag : 1;
1808 unsigned inline_flag : 1;
1809 unsigned bit_field_flag : 1;
1810 unsigned virtual_flag : 1;
1811 unsigned ignored_flag : 1;
1812 unsigned abstract_flag : 1;
1814 unsigned in_system_header_flag : 1;
1815 unsigned common_flag : 1;
1816 unsigned defer_output : 1;
1817 unsigned transparent_union : 1;
1818 unsigned static_ctor_flag : 1;
1819 unsigned static_dtor_flag : 1;
1820 unsigned artificial_flag : 1;
1821 unsigned weak_flag : 1;
1823 unsigned non_addr_const_p : 1;
1824 unsigned no_instrument_function_entry_exit : 1;
1825 unsigned comdat_flag : 1;
1826 unsigned malloc_flag : 1;
1827 unsigned no_limit_stack : 1;
1828 ENUM_BITFIELD(built_in_class) built_in_class : 2;
1829 unsigned pure_flag : 1;
1831 unsigned pointer_depth : 2;
1832 unsigned non_addressable : 1;
1833 unsigned user_align : 1;
1834 unsigned uninlinable : 1;
1835 unsigned thread_local_flag : 1;
1836 /* Two unused bits. */
1838 unsigned lang_flag_0 : 1;
1839 unsigned lang_flag_1 : 1;
1840 unsigned lang_flag_2 : 1;
1841 unsigned lang_flag_3 : 1;
1842 unsigned lang_flag_4 : 1;
1843 unsigned lang_flag_5 : 1;
1844 unsigned lang_flag_6 : 1;
1845 unsigned lang_flag_7 : 1;
1847 union tree_decl_u1 {
1848 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1849 DECL_FUNCTION_CODE. */
1850 enum built_in_function f;
1851 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
1852 is used by language-dependent code. */
1853 HOST_WIDE_INT i;
1854 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1855 FUNCTION_DECLs). */
1856 struct tree_decl_u1_a {
1857 unsigned int align : 24;
1858 unsigned int off_align : 8;
1859 } a;
1860 } GTY ((skip (""))) u1;
1862 tree size_unit;
1863 tree name;
1864 tree context;
1865 tree arguments; /* Also used for DECL_FIELD_OFFSET */
1866 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
1867 tree initial; /* Also used for DECL_QUALIFIER */
1868 tree abstract_origin;
1869 tree assembler_name;
1870 tree section_name;
1871 tree attributes;
1872 rtx rtl; /* RTL representation for object. */
1873 rtx live_range_rtl;
1875 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1876 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1877 In PARM_DECL, holds an RTL for the stack slot
1878 of register where the data was actually passed.
1879 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1880 union tree_decl_u2 {
1881 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
1882 rtx GTY ((tag ("PARM_DECL"))) r;
1883 tree GTY ((tag ("FIELD_DECL"))) t;
1884 int GTY ((tag ("VAR_DECL"))) i;
1885 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
1887 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
1888 tree saved_tree;
1890 /* In a FUNCTION_DECL, these are function data which is to be kept
1891 as long as FUNCTION_DECL is kept. */
1892 tree inlined_fns;
1894 tree vindex;
1895 HOST_WIDE_INT pointer_alias_set;
1896 /* Points to a structure whose details depend on the language in use. */
1897 struct lang_decl *lang_specific;
1900 enum tree_node_structure_enum {
1901 TS_COMMON,
1902 TS_INT_CST,
1903 TS_REAL_CST,
1904 TS_VECTOR,
1905 TS_STRING,
1906 TS_COMPLEX,
1907 TS_IDENTIFIER,
1908 TS_DECL,
1909 TS_TYPE,
1910 TS_LIST,
1911 TS_VEC,
1912 TS_EXP,
1913 TS_BLOCK,
1914 LAST_TS_ENUM
1917 /* Define the overall contents of a tree node.
1918 It may be any of the structures declared above
1919 for various types of node. */
1921 union tree_node GTY ((ptr_alias (union lang_tree_node),
1922 desc ("tree_node_structure (&%h)")))
1924 struct tree_common GTY ((tag ("TS_COMMON"))) common;
1925 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
1926 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
1927 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
1928 struct tree_string GTY ((tag ("TS_STRING"))) string;
1929 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
1930 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
1931 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
1932 struct tree_type GTY ((tag ("TS_TYPE"))) type;
1933 struct tree_list GTY ((tag ("TS_LIST"))) list;
1934 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
1935 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
1936 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
1939 /* Standard named or nameless data types of the C compiler. */
1941 enum tree_index
1943 TI_ERROR_MARK,
1944 TI_INTQI_TYPE,
1945 TI_INTHI_TYPE,
1946 TI_INTSI_TYPE,
1947 TI_INTDI_TYPE,
1948 TI_INTTI_TYPE,
1950 TI_UINTQI_TYPE,
1951 TI_UINTHI_TYPE,
1952 TI_UINTSI_TYPE,
1953 TI_UINTDI_TYPE,
1954 TI_UINTTI_TYPE,
1956 TI_INTEGER_ZERO,
1957 TI_INTEGER_ONE,
1958 TI_INTEGER_MINUS_ONE,
1959 TI_NULL_POINTER,
1961 TI_SIZE_ZERO,
1962 TI_SIZE_ONE,
1964 TI_BITSIZE_ZERO,
1965 TI_BITSIZE_ONE,
1966 TI_BITSIZE_UNIT,
1968 TI_COMPLEX_INTEGER_TYPE,
1969 TI_COMPLEX_FLOAT_TYPE,
1970 TI_COMPLEX_DOUBLE_TYPE,
1971 TI_COMPLEX_LONG_DOUBLE_TYPE,
1973 TI_FLOAT_TYPE,
1974 TI_DOUBLE_TYPE,
1975 TI_LONG_DOUBLE_TYPE,
1977 TI_VOID_TYPE,
1978 TI_PTR_TYPE,
1979 TI_CONST_PTR_TYPE,
1980 TI_SIZE_TYPE,
1981 TI_PTRDIFF_TYPE,
1982 TI_VA_LIST_TYPE,
1984 TI_VOID_LIST_NODE,
1986 TI_UV4SF_TYPE,
1987 TI_UV4SI_TYPE,
1988 TI_UV8HI_TYPE,
1989 TI_UV8QI_TYPE,
1990 TI_UV4HI_TYPE,
1991 TI_UV2HI_TYPE,
1992 TI_UV2SI_TYPE,
1993 TI_UV2SF_TYPE,
1994 TI_UV2DI_TYPE,
1995 TI_UV1DI_TYPE,
1996 TI_UV16QI_TYPE,
1998 TI_V4SF_TYPE,
1999 TI_V16SF_TYPE,
2000 TI_V4SI_TYPE,
2001 TI_V8HI_TYPE,
2002 TI_V8QI_TYPE,
2003 TI_V4HI_TYPE,
2004 TI_V2HI_TYPE,
2005 TI_V2SI_TYPE,
2006 TI_V2SF_TYPE,
2007 TI_V2DF_TYPE,
2008 TI_V2DI_TYPE,
2009 TI_V1DI_TYPE,
2010 TI_V16QI_TYPE,
2012 TI_MAIN_IDENTIFIER,
2014 TI_MAX
2017 extern GTY(()) tree global_trees[TI_MAX];
2019 #define error_mark_node global_trees[TI_ERROR_MARK]
2021 #define intQI_type_node global_trees[TI_INTQI_TYPE]
2022 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2023 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2024 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2025 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2027 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2028 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2029 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2030 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2031 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2033 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2034 #define integer_one_node global_trees[TI_INTEGER_ONE]
2035 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2036 #define size_zero_node global_trees[TI_SIZE_ZERO]
2037 #define size_one_node global_trees[TI_SIZE_ONE]
2038 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2039 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2040 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2042 #define null_pointer_node global_trees[TI_NULL_POINTER]
2044 #define float_type_node global_trees[TI_FLOAT_TYPE]
2045 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2046 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2048 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2049 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2050 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2051 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2053 #define void_type_node global_trees[TI_VOID_TYPE]
2054 /* The C type `void *'. */
2055 #define ptr_type_node global_trees[TI_PTR_TYPE]
2056 /* The C type `const void *'. */
2057 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2058 /* The C type `size_t'. */
2059 #define size_type_node global_trees[TI_SIZE_TYPE]
2060 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2061 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2063 /* The node that should be placed at the end of a parameter list to
2064 indicate that the function does not take a variable number of
2065 arguments. The TREE_VALUE will be void_type_node and there will be
2066 no TREE_CHAIN. Language-independent code should not assume
2067 anything else about this node. */
2068 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2070 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2071 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2073 #define unsigned_V16QI_type_node global_trees[TI_UV16QI_TYPE]
2074 #define unsigned_V4SI_type_node global_trees[TI_UV4SI_TYPE]
2075 #define unsigned_V8QI_type_node global_trees[TI_UV8QI_TYPE]
2076 #define unsigned_V8HI_type_node global_trees[TI_UV8HI_TYPE]
2077 #define unsigned_V4HI_type_node global_trees[TI_UV4HI_TYPE]
2078 #define unsigned_V2HI_type_node global_trees[TI_UV2HI_TYPE]
2079 #define unsigned_V2SI_type_node global_trees[TI_UV2SI_TYPE]
2080 #define unsigned_V2DI_type_node global_trees[TI_UV2DI_TYPE]
2081 #define unsigned_V1DI_type_node global_trees[TI_UV1DI_TYPE]
2083 #define V16QI_type_node global_trees[TI_V16QI_TYPE]
2084 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
2085 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
2086 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
2087 #define V8HI_type_node global_trees[TI_V8HI_TYPE]
2088 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
2089 #define V2HI_type_node global_trees[TI_V2HI_TYPE]
2090 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
2091 #define V2SF_type_node global_trees[TI_V2SF_TYPE]
2092 #define V2DI_type_node global_trees[TI_V2DI_TYPE]
2093 #define V2DF_type_node global_trees[TI_V2DF_TYPE]
2094 #define V16SF_type_node global_trees[TI_V16SF_TYPE]
2095 #define V1DI_type_node global_trees[TI_V1DI_TYPE]
2097 /* An enumeration of the standard C integer types. These must be
2098 ordered so that shorter types appear before longer ones, and so
2099 that signed types appear before unsigned ones, for the correct
2100 functioning of interpret_integer() in c-lex.c. */
2101 enum integer_type_kind
2103 itk_char,
2104 itk_signed_char,
2105 itk_unsigned_char,
2106 itk_short,
2107 itk_unsigned_short,
2108 itk_int,
2109 itk_unsigned_int,
2110 itk_long,
2111 itk_unsigned_long,
2112 itk_long_long,
2113 itk_unsigned_long_long,
2114 itk_none
2117 typedef enum integer_type_kind integer_type_kind;
2119 /* The standard C integer types. Use integer_type_kind to index into
2120 this array. */
2121 extern GTY(()) tree integer_types[itk_none];
2123 #define char_type_node integer_types[itk_char]
2124 #define signed_char_type_node integer_types[itk_signed_char]
2125 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2126 #define short_integer_type_node integer_types[itk_short]
2127 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2128 #define integer_type_node integer_types[itk_int]
2129 #define unsigned_type_node integer_types[itk_unsigned_int]
2130 #define long_integer_type_node integer_types[itk_long]
2131 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2132 #define long_long_integer_type_node integer_types[itk_long_long]
2133 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2135 /* Set to the default thread-local storage (tls) model to use. */
2137 enum tls_model {
2138 TLS_MODEL_GLOBAL_DYNAMIC = 1,
2139 TLS_MODEL_LOCAL_DYNAMIC,
2140 TLS_MODEL_INITIAL_EXEC,
2141 TLS_MODEL_LOCAL_EXEC
2144 extern enum tls_model flag_tls_default;
2146 /* Enumerate visibility settings. */
2148 enum symbol_visibility
2150 VISIBILITY_DEFAULT,
2151 VISIBILITY_INTERNAL,
2152 VISIBILITY_HIDDEN,
2153 VISIBILITY_PROTECTED
2156 /* A pointer-to-function member type looks like:
2158 struct {
2159 __P __pfn;
2160 ptrdiff_t __delta;
2163 If __pfn is NULL, it is a NULL pointer-to-member-function.
2165 (Because the vtable is always the first thing in the object, we
2166 don't need its offset.) If the function is virtual, then PFN is
2167 one plus twice the index into the vtable; otherwise, it is just a
2168 pointer to the function.
2170 Unfortunately, using the lowest bit of PFN doesn't work in
2171 architectures that don't impose alignment requirements on function
2172 addresses, or that use the lowest bit to tell one ISA from another,
2173 for example. For such architectures, we use the lowest bit of
2174 DELTA instead of the lowest bit of the PFN, and DELTA will be
2175 multiplied by 2. */
2177 enum ptrmemfunc_vbit_where_t
2179 ptrmemfunc_vbit_in_pfn,
2180 ptrmemfunc_vbit_in_delta
2183 #define NULL_TREE (tree) NULL
2185 /* Approximate positive square root of a host double. This is for
2186 statistical reports, not code generation. */
2187 extern double approx_sqrt PARAMS ((double));
2189 extern tree decl_assembler_name PARAMS ((tree));
2191 /* Compute the number of bytes occupied by 'node'. This routine only
2192 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2194 extern size_t tree_size PARAMS ((tree));
2196 /* Lowest level primitive for allocating a node.
2197 The TREE_CODE is the only argument. Contents are initialized
2198 to zero except for a few of the common fields. */
2200 extern tree make_node PARAMS ((enum tree_code));
2202 /* Make a copy of a node, with all the same contents. */
2204 extern tree copy_node PARAMS ((tree));
2206 /* Make a copy of a chain of TREE_LIST nodes. */
2208 extern tree copy_list PARAMS ((tree));
2210 /* Make a TREE_VEC. */
2212 extern tree make_tree_vec PARAMS ((int));
2214 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2215 The name is supplied as a char *. */
2217 extern tree get_identifier PARAMS ((const char *));
2219 /* Identical to get_identifier, except that the length is assumed
2220 known. */
2222 extern tree get_identifier_with_length PARAMS ((const char *, unsigned int));
2224 /* If an identifier with the name TEXT (a null-terminated string) has
2225 previously been referred to, return that node; otherwise return
2226 NULL_TREE. */
2228 extern tree maybe_get_identifier PARAMS ((const char *));
2230 /* Construct various types of nodes. */
2232 #define build_int_2(LO, HI) \
2233 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2235 extern tree build PARAMS ((enum tree_code, tree, ...));
2236 extern tree build_nt PARAMS ((enum tree_code, ...));
2238 extern tree build_int_2_wide PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT));
2239 extern tree build_vector PARAMS ((tree, tree));
2240 extern tree build_real_from_int_cst PARAMS ((tree, tree));
2241 extern tree build_complex PARAMS ((tree, tree, tree));
2242 extern tree build_string PARAMS ((int, const char *));
2243 extern tree build1 PARAMS ((enum tree_code, tree, tree));
2244 extern tree build_tree_list PARAMS ((tree, tree));
2245 extern tree build_decl PARAMS ((enum tree_code, tree, tree));
2246 extern tree build_block PARAMS ((tree, tree, tree, tree, tree));
2247 extern tree build_expr_wfl PARAMS ((tree, const char *, int, int));
2249 /* Construct various nodes representing data types. */
2251 extern tree make_signed_type PARAMS ((int));
2252 extern tree make_unsigned_type PARAMS ((int));
2253 extern void initialize_sizetypes PARAMS ((void));
2254 extern void set_sizetype PARAMS ((tree));
2255 extern void fixup_unsigned_type PARAMS ((tree));
2256 extern tree build_pointer_type_for_mode PARAMS ((tree, enum machine_mode));
2257 extern tree build_pointer_type PARAMS ((tree));
2258 extern tree build_reference_type_for_mode PARAMS ((tree, enum machine_mode));
2259 extern tree build_reference_type PARAMS ((tree));
2260 extern tree build_type_no_quals PARAMS ((tree));
2261 extern tree build_index_type PARAMS ((tree));
2262 extern tree build_index_2_type PARAMS ((tree, tree));
2263 extern tree build_array_type PARAMS ((tree, tree));
2264 extern tree build_function_type PARAMS ((tree, tree));
2265 extern tree build_function_type_list PARAMS ((tree, ...));
2266 extern tree build_method_type PARAMS ((tree, tree));
2267 extern tree build_offset_type PARAMS ((tree, tree));
2268 extern tree build_complex_type PARAMS ((tree));
2269 extern tree array_type_nelts PARAMS ((tree));
2271 extern tree value_member PARAMS ((tree, tree));
2272 extern tree purpose_member PARAMS ((tree, tree));
2273 extern tree binfo_member PARAMS ((tree, tree));
2274 extern unsigned int attribute_hash_list PARAMS ((tree));
2275 extern int attribute_list_equal PARAMS ((tree, tree));
2276 extern int attribute_list_contained PARAMS ((tree, tree));
2277 extern int tree_int_cst_equal PARAMS ((tree, tree));
2278 extern int tree_int_cst_lt PARAMS ((tree, tree));
2279 extern int tree_int_cst_compare PARAMS ((tree, tree));
2280 extern int host_integerp PARAMS ((tree, int));
2281 extern HOST_WIDE_INT tree_low_cst PARAMS ((tree, int));
2282 extern int tree_int_cst_sgn PARAMS ((tree));
2283 extern int tree_expr_nonnegative_p PARAMS ((tree));
2284 extern int rtl_expr_nonnegative_p PARAMS ((rtx));
2285 extern tree get_inner_array_type PARAMS ((tree));
2287 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2288 put the prototype here. Rtl.h does declare the prototype if
2289 tree.h had been included. */
2291 extern tree make_tree PARAMS ((tree, rtx));
2293 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2294 is ATTRIBUTE.
2296 Such modified types already made are recorded so that duplicates
2297 are not made. */
2299 extern tree build_type_attribute_variant PARAMS ((tree, tree));
2300 extern tree build_decl_attribute_variant PARAMS ((tree, tree));
2302 /* Structure describing an attribute and a function to handle it. */
2303 struct attribute_spec
2305 /* The name of the attribute (without any leading or trailing __),
2306 or NULL to mark the end of a table of attributes. */
2307 const char *const name;
2308 /* The minimum length of the list of arguments of the attribute. */
2309 const int min_length;
2310 /* The maximum length of the list of arguments of the attribute
2311 (-1 for no maximum). */
2312 const int max_length;
2313 /* Whether this attribute requires a DECL. If it does, it will be passed
2314 from types of DECLs, function return types and array element types to
2315 the DECLs, function types and array types respectively; but when
2316 applied to a type in any other circumstances, it will be ignored with
2317 a warning. (If greater control is desired for a given attribute,
2318 this should be false, and the flags argument to the handler may be
2319 used to gain greater control in that case.) */
2320 const bool decl_required;
2321 /* Whether this attribute requires a type. If it does, it will be passed
2322 from a DECL to the type of that DECL. */
2323 const bool type_required;
2324 /* Whether this attribute requires a function (or method) type. If it does,
2325 it will be passed from a function pointer type to the target type,
2326 and from a function return type (which is not itself a function
2327 pointer type) to the function type. */
2328 const bool function_type_required;
2329 /* Function to handle this attribute. NODE points to the node to which
2330 the attribute is to be applied. If a DECL, it should be modified in
2331 place; if a TYPE, a copy should be created. NAME is the name of the
2332 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2333 of the arguments (which may be NULL). FLAGS gives further information
2334 about the context of the attribute. Afterwards, the attributes will
2335 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2336 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2337 as well as in any other cases when the attributes should not be added
2338 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2339 applied to another type or DECL later may be returned;
2340 otherwise the return value should be NULL_TREE. This pointer may be
2341 NULL if no special handling is required beyond the checks implied
2342 by the rest of this structure. */
2343 tree (*const handler) PARAMS ((tree *node, tree name, tree args,
2344 int flags, bool *no_add_attrs));
2347 /* Flags that may be passed in the third argument of decl_attributes, and
2348 to handler functions for attributes. */
2349 enum attribute_flags
2351 /* The type passed in is the type of a DECL, and any attributes that
2352 should be passed in again to be applied to the DECL rather than the
2353 type should be returned. */
2354 ATTR_FLAG_DECL_NEXT = 1,
2355 /* The type passed in is a function return type, and any attributes that
2356 should be passed in again to be applied to the function type rather
2357 than the return type should be returned. */
2358 ATTR_FLAG_FUNCTION_NEXT = 2,
2359 /* The type passed in is an array element type, and any attributes that
2360 should be passed in again to be applied to the array type rather
2361 than the element type should be returned. */
2362 ATTR_FLAG_ARRAY_NEXT = 4,
2363 /* The type passed in is a structure, union or enumeration type being
2364 created, and should be modified in place. */
2365 ATTR_FLAG_TYPE_IN_PLACE = 8,
2366 /* The attributes are being applied by default to a library function whose
2367 name indicates known behavior, and should be silently ignored if they
2368 are not in fact compatible with the function type. */
2369 ATTR_FLAG_BUILT_IN = 16
2372 /* Default versions of target-overridable functions. */
2374 extern tree merge_decl_attributes PARAMS ((tree, tree));
2375 extern tree merge_type_attributes PARAMS ((tree, tree));
2376 struct cpp_reader;
2377 extern void default_register_cpp_builtins PARAMS ((struct cpp_reader *));
2379 /* Split a list of declspecs and attributes into two. */
2381 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2383 /* Strip attributes from a list of combined specs and attrs. */
2385 extern tree strip_attrs PARAMS ((tree));
2387 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2389 extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree));
2391 /* Given a tree node and a string, return nonzero if the tree node is
2392 a valid attribute name for the string. */
2394 extern int is_attribute_p PARAMS ((const char *, tree));
2396 /* Given an attribute name and a list of attributes, return the list element
2397 of the attribute or NULL_TREE if not found. */
2399 extern tree lookup_attribute PARAMS ((const char *, tree));
2401 /* Given two attributes lists, return a list of their union. */
2403 extern tree merge_attributes PARAMS ((tree, tree));
2405 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2406 /* Given two Windows decl attributes lists, possibly including
2407 dllimport, return a list of their union . */
2408 extern tree merge_dllimport_decl_attributes PARAMS ((tree, tree));
2409 #endif
2411 /* Return a version of the TYPE, qualified as indicated by the
2412 TYPE_QUALS, if one exists. If no qualified version exists yet,
2413 return NULL_TREE. */
2415 extern tree get_qualified_type PARAMS ((tree, int));
2417 /* Like get_qualified_type, but creates the type if it does not
2418 exist. This function never returns NULL_TREE. */
2420 extern tree build_qualified_type PARAMS ((tree, int));
2422 /* Like build_qualified_type, but only deals with the `const' and
2423 `volatile' qualifiers. This interface is retained for backwards
2424 compatibility with the various front-ends; new code should use
2425 build_qualified_type instead. */
2427 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2428 build_qualified_type ((TYPE), \
2429 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2430 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2432 /* Make a copy of a type node. */
2434 extern tree build_type_copy PARAMS ((tree));
2436 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2437 fields. Optionally specify an alignment, and then lsy it out. */
2439 extern void finish_builtin_struct PARAMS ((tree, const char *,
2440 tree, tree));
2442 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2443 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2444 node, does nothing except for the first time. */
2446 extern void layout_type PARAMS ((tree));
2448 /* These functions allow a front-end to perform a manual layout of a
2449 RECORD_TYPE. (For instance, if the placement of subsequent fields
2450 depends on the placement of fields so far.) Begin by calling
2451 start_record_layout. Then, call place_field for each of the
2452 fields. Then, call finish_record_layout. See layout_type for the
2453 default way in which these functions are used. */
2455 typedef struct record_layout_info_s
2457 /* The RECORD_TYPE that we are laying out. */
2458 tree t;
2459 /* The offset into the record so far, in bytes, not including bits in
2460 BITPOS. */
2461 tree offset;
2462 /* The last known alignment of SIZE. */
2463 unsigned int offset_align;
2464 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2465 tree bitpos;
2466 /* The alignment of the record so far, in bits. */
2467 unsigned int record_align;
2468 /* The alignment of the record so far, not including padding, in bits. */
2469 unsigned int unpacked_align;
2470 /* The alignment of the record so far, allowing for the record to be
2471 padded only at the end, in bits. */
2472 unsigned int unpadded_align;
2473 /* The previous field layed out. */
2474 tree prev_field;
2475 /* The static variables (i.e., class variables, as opposed to
2476 instance variables) encountered in T. */
2477 tree pending_statics;
2478 /* Bits remaining in the current alignment group */
2479 int remaining_in_alignment;
2480 int packed_maybe_necessary;
2481 } *record_layout_info;
2483 extern void set_lang_adjust_rli PARAMS ((void (*) PARAMS
2484 ((record_layout_info))));
2485 extern record_layout_info start_record_layout PARAMS ((tree));
2486 extern tree bit_from_pos PARAMS ((tree, tree));
2487 extern tree byte_from_pos PARAMS ((tree, tree));
2488 extern void pos_from_bit PARAMS ((tree *, tree *, unsigned int,
2489 tree));
2490 extern void normalize_offset PARAMS ((tree *, tree *,
2491 unsigned int));
2492 extern tree rli_size_unit_so_far PARAMS ((record_layout_info));
2493 extern tree rli_size_so_far PARAMS ((record_layout_info));
2494 extern void normalize_rli PARAMS ((record_layout_info));
2495 extern void place_field PARAMS ((record_layout_info, tree));
2496 extern void compute_record_mode PARAMS ((tree));
2497 extern void finish_record_layout PARAMS ((record_layout_info, int));
2499 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2500 return a canonicalized ..._TYPE node, so that duplicates are not made.
2501 How the hash code is computed is up to the caller, as long as any two
2502 callers that could hash identical-looking type nodes agree. */
2504 extern tree type_hash_canon PARAMS ((unsigned int, tree));
2506 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2507 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2508 fields. Call this only once for any given decl node.
2510 Second argument is the boundary that this field can be assumed to
2511 be starting at (in bits). Zero means it can be assumed aligned
2512 on any boundary that may be needed. */
2514 extern void layout_decl PARAMS ((tree, unsigned));
2516 /* Return the mode for data of a given size SIZE and mode class CLASS.
2517 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2518 The value is BLKmode if no other mode is found. This is like
2519 mode_for_size, but is passed a tree. */
2521 extern enum machine_mode mode_for_size_tree PARAMS ((tree, enum mode_class,
2522 int));
2524 /* Return an expr equal to X but certainly not valid as an lvalue. */
2526 extern tree non_lvalue PARAMS ((tree));
2527 extern tree pedantic_non_lvalue PARAMS ((tree));
2529 extern tree convert PARAMS ((tree, tree));
2530 extern unsigned int expr_align PARAMS ((tree));
2531 extern tree size_in_bytes PARAMS ((tree));
2532 extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree));
2533 extern tree bit_position PARAMS ((tree));
2534 extern HOST_WIDE_INT int_bit_position PARAMS ((tree));
2535 extern tree byte_position PARAMS ((tree));
2536 extern HOST_WIDE_INT int_byte_position PARAMS ((tree));
2538 /* Define data structures, macros, and functions for handling sizes
2539 and the various types used to represent sizes. */
2541 enum size_type_kind
2543 SIZETYPE, /* Normal representation of sizes in bytes. */
2544 SSIZETYPE, /* Signed representation of sizes in bytes. */
2545 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2546 BITSIZETYPE, /* Normal representation of sizes in bits. */
2547 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2548 UBITSIZETYPE, /* Unsifgned representation of sizes in bits. */
2549 TYPE_KIND_LAST};
2551 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
2553 #define sizetype sizetype_tab[(int) SIZETYPE]
2554 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2555 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2556 #define usizetype sizetype_tab[(int) USIZETYPE]
2557 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2558 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2560 extern tree size_binop PARAMS ((enum tree_code, tree, tree));
2561 extern tree size_diffop PARAMS ((tree, tree));
2562 extern tree size_int_wide PARAMS ((HOST_WIDE_INT,
2563 enum size_type_kind));
2564 extern tree size_int_type_wide PARAMS ((HOST_WIDE_INT, tree));
2566 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2567 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2568 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2569 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2570 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2572 extern tree round_up PARAMS ((tree, int));
2573 extern tree round_down PARAMS ((tree, int));
2574 extern tree get_pending_sizes PARAMS ((void));
2575 extern int is_pending_size PARAMS ((tree));
2576 extern void put_pending_size PARAMS ((tree));
2577 extern void put_pending_sizes PARAMS ((tree));
2579 /* Type for sizes of data-type. */
2581 #define BITS_PER_UNIT_LOG \
2582 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2583 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2584 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2586 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2587 extern unsigned int maximum_field_alignment;
2589 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
2590 extern unsigned int set_alignment;
2592 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2593 by making the last node in X point to Y.
2594 Returns X, except if X is 0 returns Y. */
2596 extern tree chainon PARAMS ((tree, tree));
2598 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2600 extern tree tree_cons PARAMS ((tree, tree, tree));
2602 /* Return the last tree node in a chain. */
2604 extern tree tree_last PARAMS ((tree));
2606 /* Reverse the order of elements in a chain, and return the new head. */
2608 extern tree nreverse PARAMS ((tree));
2610 /* Returns the length of a chain of nodes
2611 (number of chain pointers to follow before reaching a null pointer). */
2613 extern int list_length PARAMS ((tree));
2615 /* Returns the number of FIELD_DECLs in a type. */
2617 extern int fields_length PARAMS ((tree));
2619 /* Given an initializer INIT, return TRUE if INIT is zero or some
2620 aggregate of zeros. Otherwise return FALSE. */
2622 extern bool initializer_zerop PARAMS ((tree));
2624 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2626 extern int integer_zerop PARAMS ((tree));
2628 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2630 extern int integer_onep PARAMS ((tree));
2632 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2633 all of whose significant bits are 1. */
2635 extern int integer_all_onesp PARAMS ((tree));
2637 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2638 exactly one bit 1. */
2640 extern int integer_pow2p PARAMS ((tree));
2642 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
2643 with a nonzero value. */
2645 extern int integer_nonzerop PARAMS ((tree));
2647 /* staticp (tree x) is nonzero if X is a reference to data allocated
2648 at a fixed address in memory. */
2650 extern int staticp PARAMS ((tree));
2652 /* Gets an error if argument X is not an lvalue.
2653 Also returns 1 if X is an lvalue, 0 if not. */
2655 extern int lvalue_or_else PARAMS ((tree, const char *));
2657 /* save_expr (EXP) returns an expression equivalent to EXP
2658 but it can be used multiple times within context CTX
2659 and only evaluate EXP once. */
2661 extern tree save_expr PARAMS ((tree));
2663 /* Returns the index of the first non-tree operand for CODE, or the number
2664 of operands if all are trees. */
2666 extern int first_rtl_op PARAMS ((enum tree_code));
2668 /* Return which tree structure is used by T. */
2670 enum tree_node_structure_enum tree_node_structure PARAMS ((tree));
2672 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2673 can be used multiple times and will evaluate EXP in its entirety
2674 each time. */
2676 extern tree unsave_expr PARAMS ((tree));
2678 /* Reset EXP in place so that it can be expanded again. Does not
2679 recurse into subtrees. */
2681 extern void unsave_expr_1 PARAMS ((tree));
2683 /* Return 0 if it is safe to evaluate EXPR multiple times,
2684 return 1 if it is safe if EXPR is unsaved afterward, or
2685 return 2 if it is completely unsafe. */
2686 extern int unsafe_for_reeval PARAMS ((tree));
2688 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2689 or offset that depends on a field within a record.
2691 Note that we only allow such expressions within simple arithmetic
2692 or a COND_EXPR. */
2694 extern int contains_placeholder_p PARAMS ((tree));
2696 /* Return 1 if EXP contains any expressions that produce cleanups for an
2697 outer scope to deal with. Used by fold. */
2699 extern int has_cleanups PARAMS ((tree));
2701 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2702 return a tree with all occurrences of references to F in a
2703 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2704 contains only arithmetic expressions. */
2706 extern tree substitute_in_expr PARAMS ((tree, tree, tree));
2708 /* variable_size (EXP) is like save_expr (EXP) except that it
2709 is for the special case of something that is part of a
2710 variable size for a data type. It makes special arrangements
2711 to compute the value at the right time when the data type
2712 belongs to a function parameter. */
2714 extern tree variable_size PARAMS ((tree));
2716 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2717 but it can be used multiple times
2718 and only evaluate the subexpressions once. */
2720 extern tree stabilize_reference PARAMS ((tree));
2722 /* Subroutine of stabilize_reference; this is called for subtrees of
2723 references. Any expression with side-effects must be put in a SAVE_EXPR
2724 to ensure that it is only evaluated once. */
2726 extern tree stabilize_reference_1 PARAMS ((tree));
2728 /* Return EXP, stripped of any conversions to wider types
2729 in such a way that the result of converting to type FOR_TYPE
2730 is the same as if EXP were converted to FOR_TYPE.
2731 If FOR_TYPE is 0, it signifies EXP's type. */
2733 extern tree get_unwidened PARAMS ((tree, tree));
2735 /* Return OP or a simpler expression for a narrower value
2736 which can be sign-extended or zero-extended to give back OP.
2737 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2738 or 0 if the value should be sign-extended. */
2740 extern tree get_narrower PARAMS ((tree, int *));
2742 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2743 look for nested component-refs or array-refs at constant positions
2744 and find the ultimate containing object, which is returned. */
2746 extern tree get_inner_reference PARAMS ((tree, HOST_WIDE_INT *,
2747 HOST_WIDE_INT *, tree *,
2748 enum machine_mode *, int *,
2749 int *));
2751 /* Return 1 if T is an expression that get_inner_reference handles. */
2753 extern int handled_component_p PARAMS ((tree));
2755 /* Given a DECL or TYPE, return the scope in which it was declared, or
2756 NUL_TREE if there is no containing scope. */
2758 extern tree get_containing_scope PARAMS ((tree));
2760 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2761 or zero if none. */
2762 extern tree decl_function_context PARAMS ((tree));
2764 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2765 this _DECL with its context, or zero if none. */
2766 extern tree decl_type_context PARAMS ((tree));
2768 /* Given the FUNCTION_DECL for the current function,
2769 return zero if it is ok for this function to be inline.
2770 Otherwise return a warning message with a single %s
2771 for the function's name. */
2773 extern const char *function_cannot_inline_p PARAMS ((tree));
2775 /* Return 1 if EXPR is the real constant zero. */
2776 extern int real_zerop PARAMS ((tree));
2778 /* Declare commonly used variables for tree structure. */
2780 /* Points to the name of the input file from which the current input
2781 being parsed originally came (before it went into cpp). */
2782 extern const char *input_filename;
2784 /* Current line number in input file. */
2785 extern int lineno;
2787 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2788 Zero means allow extended lvalues. */
2790 extern int pedantic_lvalues;
2792 /* Nonzero means can safely call expand_expr now;
2793 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2795 extern int immediate_size_expand;
2797 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2799 extern GTY(()) tree current_function_decl;
2801 /* Nonzero means a FUNC_BEGIN label was emitted. */
2802 extern GTY(()) tree current_function_func_begin_label;
2804 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2806 extern int all_types_permanent;
2808 /* Declare a predefined function. Return the declaration. This function is
2809 provided by each language frontend. */
2810 extern tree builtin_function PARAMS ((const char *, tree, int,
2811 enum built_in_class,
2812 const char *, tree));
2814 /* In tree.c */
2815 extern void clean_symbol_name PARAMS ((char *));
2816 extern tree get_file_function_name_long PARAMS ((const char *));
2817 extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
2818 extern tree get_set_constructor_bytes PARAMS ((tree,
2819 unsigned char *, int));
2820 extern tree get_callee_fndecl PARAMS ((tree));
2821 extern void set_decl_assembler_name PARAMS ((tree));
2822 extern int type_num_arguments PARAMS ((tree));
2823 extern tree lhd_unsave_expr_now PARAMS ((tree));
2826 /* In stmt.c */
2828 extern void expand_fixups PARAMS ((rtx));
2829 extern tree expand_start_stmt_expr PARAMS ((int));
2830 extern tree expand_end_stmt_expr PARAMS ((tree));
2831 extern void expand_expr_stmt PARAMS ((tree));
2832 extern void expand_expr_stmt_value PARAMS ((tree, int, int));
2833 extern int warn_if_unused_value PARAMS ((tree));
2834 extern void expand_decl_init PARAMS ((tree));
2835 extern void clear_last_expr PARAMS ((void));
2836 extern void expand_label PARAMS ((tree));
2837 extern void expand_goto PARAMS ((tree));
2838 extern void expand_asm PARAMS ((tree, int));
2839 extern void expand_start_cond PARAMS ((tree, int));
2840 extern void expand_end_cond PARAMS ((void));
2841 extern void expand_start_else PARAMS ((void));
2842 extern void expand_start_elseif PARAMS ((tree));
2843 extern struct nesting *expand_start_loop PARAMS ((int));
2844 extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int));
2845 extern struct nesting *expand_start_null_loop PARAMS ((void));
2846 extern void expand_loop_continue_here PARAMS ((void));
2847 extern void expand_end_loop PARAMS ((void));
2848 extern void expand_end_null_loop PARAMS ((void));
2849 extern int expand_continue_loop PARAMS ((struct nesting *));
2850 extern int expand_exit_loop PARAMS ((struct nesting *));
2851 extern int expand_exit_loop_if_false PARAMS ((struct nesting *,
2852 tree));
2853 extern int expand_exit_loop_top_cond PARAMS ((struct nesting *,
2854 tree));
2855 extern int expand_exit_something PARAMS ((void));
2857 extern void expand_return PARAMS ((tree));
2858 extern int optimize_tail_recursion PARAMS ((tree, rtx));
2859 extern void expand_start_bindings_and_block PARAMS ((int, tree));
2860 #define expand_start_bindings(flags) \
2861 expand_start_bindings_and_block(flags, NULL_TREE)
2862 extern void expand_end_bindings PARAMS ((tree, int, int));
2863 extern void warn_about_unused_variables PARAMS ((tree));
2864 extern void start_cleanup_deferral PARAMS ((void));
2865 extern void end_cleanup_deferral PARAMS ((void));
2866 extern int is_body_block PARAMS ((tree));
2868 extern int conditional_context PARAMS ((void));
2869 extern struct nesting * current_nesting_level PARAMS ((void));
2870 extern tree last_cleanup_this_contour PARAMS ((void));
2871 extern void expand_start_case PARAMS ((int, tree, tree,
2872 const char *));
2873 extern void expand_end_case_type PARAMS ((tree, tree));
2874 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
2875 extern int add_case_node PARAMS ((tree, tree,
2876 tree, tree *));
2877 extern int pushcase PARAMS ((tree,
2878 tree (*) (tree, tree),
2879 tree, tree *));
2880 extern int pushcase_range PARAMS ((tree, tree,
2881 tree (*) (tree, tree),
2882 tree, tree *));
2883 extern void using_eh_for_cleanups PARAMS ((void));
2885 /* In fold-const.c */
2887 /* Fold constants as much as possible in an expression.
2888 Returns the simplified expression.
2889 Acts only on the top level of the expression;
2890 if the argument itself cannot be simplified, its
2891 subexpressions are not changed. */
2893 extern tree fold PARAMS ((tree));
2895 extern int force_fit_type PARAMS ((tree, int));
2896 extern int add_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2897 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2898 unsigned HOST_WIDE_INT *,
2899 HOST_WIDE_INT *));
2900 extern int neg_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2901 unsigned HOST_WIDE_INT *,
2902 HOST_WIDE_INT *));
2903 extern int mul_double PARAMS ((unsigned HOST_WIDE_INT,
2904 HOST_WIDE_INT,
2905 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2906 unsigned HOST_WIDE_INT *,
2907 HOST_WIDE_INT *));
2908 extern void lshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2909 HOST_WIDE_INT, unsigned int,
2910 unsigned HOST_WIDE_INT *,
2911 HOST_WIDE_INT *, int));
2912 extern void rshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2913 HOST_WIDE_INT, unsigned int,
2914 unsigned HOST_WIDE_INT *,
2915 HOST_WIDE_INT *, int));
2916 extern void lrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2917 HOST_WIDE_INT, unsigned int,
2918 unsigned HOST_WIDE_INT *,
2919 HOST_WIDE_INT *));
2920 extern void rrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2921 HOST_WIDE_INT, unsigned int,
2922 unsigned HOST_WIDE_INT *,
2923 HOST_WIDE_INT *));
2924 extern int operand_equal_p PARAMS ((tree, tree, int));
2925 extern tree invert_truthvalue PARAMS ((tree));
2927 /* In builtins.c */
2928 extern tree fold_builtin PARAMS ((tree));
2929 extern enum built_in_function builtin_mathfn_code PARAMS ((tree));
2930 extern tree build_function_call_expr PARAMS ((tree, tree));
2932 /* In convert.c */
2933 extern tree strip_float_extensions PARAMS ((tree));
2935 /* In alias.c */
2936 extern void record_component_aliases PARAMS ((tree));
2937 extern HOST_WIDE_INT get_alias_set PARAMS ((tree));
2938 extern int alias_sets_conflict_p PARAMS ((HOST_WIDE_INT,
2939 HOST_WIDE_INT));
2940 extern int readonly_fields_p PARAMS ((tree));
2941 extern int objects_must_conflict_p PARAMS ((tree, tree));
2943 struct obstack;
2945 /* In tree.c */
2946 extern int really_constant_p PARAMS ((tree));
2947 extern int int_fits_type_p PARAMS ((tree, tree));
2948 extern bool variably_modified_type_p PARAMS ((tree));
2949 extern int tree_log2 PARAMS ((tree));
2950 extern int tree_floor_log2 PARAMS ((tree));
2951 extern int simple_cst_equal PARAMS ((tree, tree));
2952 extern int compare_tree_int PARAMS ((tree,
2953 unsigned HOST_WIDE_INT));
2954 extern int type_list_equal PARAMS ((tree, tree));
2955 extern int chain_member PARAMS ((tree, tree));
2956 extern tree type_hash_lookup PARAMS ((unsigned int, tree));
2957 extern void type_hash_add PARAMS ((unsigned int, tree));
2958 extern unsigned int type_hash_list PARAMS ((tree));
2959 extern int simple_cst_list_equal PARAMS ((tree, tree));
2960 extern void dump_tree_statistics PARAMS ((void));
2961 extern void print_obstack_statistics PARAMS ((const char *,
2962 struct obstack *));
2963 #ifdef BUFSIZ
2964 extern void print_obstack_name PARAMS ((char *, FILE *,
2965 const char *));
2966 #endif
2967 extern void expand_function_end PARAMS ((const char *, int, int));
2968 extern void expand_function_start PARAMS ((tree, int));
2969 extern void expand_pending_sizes PARAMS ((tree));
2971 extern int real_onep PARAMS ((tree));
2972 extern int real_twop PARAMS ((tree));
2973 extern int real_minus_onep PARAMS ((tree));
2974 extern void gcc_obstack_init PARAMS ((struct obstack *));
2975 extern void init_ttree PARAMS ((void));
2976 extern void build_common_tree_nodes PARAMS ((int));
2977 extern void build_common_tree_nodes_2 PARAMS ((int));
2978 extern tree build_range_type PARAMS ((tree, tree, tree));
2980 /* In function.c */
2981 extern void setjmp_protect_args PARAMS ((void));
2982 extern void setjmp_protect PARAMS ((tree));
2983 extern void expand_main_function PARAMS ((void));
2984 extern void init_dummy_function_start PARAMS ((void));
2985 extern void expand_dummy_function_end PARAMS ((void));
2986 extern void init_function_for_compilation PARAMS ((void));
2987 extern void init_function_start PARAMS ((tree, const char *, int));
2988 extern void assign_parms PARAMS ((tree));
2989 extern void put_var_into_stack PARAMS ((tree));
2990 extern void flush_addressof PARAMS ((tree));
2991 extern void uninitialized_vars_warning PARAMS ((tree));
2992 extern void setjmp_args_warning PARAMS ((void));
2993 extern void mark_all_temps_used PARAMS ((void));
2994 extern void init_temp_slots PARAMS ((void));
2995 extern void combine_temp_slots PARAMS ((void));
2996 extern void free_temp_slots PARAMS ((void));
2997 extern void pop_temp_slots PARAMS ((void));
2998 extern void push_temp_slots PARAMS ((void));
2999 extern void preserve_temp_slots PARAMS ((rtx));
3000 extern void preserve_rtl_expr_temps PARAMS ((tree));
3001 extern int aggregate_value_p PARAMS ((tree));
3002 extern void free_temps_for_rtl_expr PARAMS ((tree));
3003 extern void instantiate_virtual_regs PARAMS ((tree, rtx));
3004 extern void unshare_all_rtl PARAMS ((tree, rtx));
3005 extern void push_function_context PARAMS ((void));
3006 extern void pop_function_context PARAMS ((void));
3007 extern void push_function_context_to PARAMS ((tree));
3008 extern void pop_function_context_from PARAMS ((tree));
3010 /* In print-rtl.c */
3011 #ifdef BUFSIZ
3012 extern void print_rtl PARAMS ((FILE *, rtx));
3013 #endif
3015 /* In print-tree.c */
3016 extern void debug_tree PARAMS ((tree));
3017 #ifdef BUFSIZ
3018 extern void print_node PARAMS ((FILE *, const char *, tree,
3019 int));
3020 extern void print_node_brief PARAMS ((FILE *, const char *, tree,
3021 int));
3022 extern void indent_to PARAMS ((FILE *, int));
3023 #endif
3025 /* In expr.c */
3026 extern int apply_args_register_offset PARAMS ((int));
3027 extern rtx expand_builtin_return_addr
3028 PARAMS ((enum built_in_function, int, rtx));
3029 extern void check_max_integer_computation_mode PARAMS ((tree));
3031 /* In emit-rtl.c */
3032 extern void start_sequence_for_rtl_expr PARAMS ((tree));
3033 extern rtx emit_line_note PARAMS ((const char *, int));
3035 /* In calls.c */
3037 extern int setjmp_call_p PARAMS ((tree));
3038 extern bool alloca_call_p PARAMS ((tree));
3040 /* In attribs.c. */
3042 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3043 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3044 it should be modified in place; if a TYPE, a copy should be created
3045 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3046 information, in the form of a bitwise OR of flags in enum attribute_flags
3047 from tree.h. Depending on these flags, some attributes may be
3048 returned to be applied at a later stage (for example, to apply
3049 a decl attribute to the declaration rather than to its type). */
3050 extern tree decl_attributes PARAMS ((tree *, tree, int));
3052 /* In integrate.c */
3053 extern void save_for_inline PARAMS ((tree));
3054 extern void set_decl_abstract_flags PARAMS ((tree, int));
3055 extern void output_inline_function PARAMS ((tree));
3056 extern void set_decl_origin_self PARAMS ((tree));
3058 /* In stor-layout.c */
3059 extern void fixup_signed_type PARAMS ((tree));
3060 extern void internal_reference_types PARAMS ((void));
3062 /* varasm.c */
3063 extern void make_decl_rtl PARAMS ((tree, const char *));
3064 extern void make_decl_one_only PARAMS ((tree));
3065 extern int supports_one_only PARAMS ((void));
3066 extern void variable_section PARAMS ((tree, int));
3067 enum tls_model decl_tls_model PARAMS ((tree));
3068 enum symbol_visibility decl_visibility PARAMS ((tree));
3070 /* In fold-const.c */
3071 extern int div_and_round_double PARAMS ((enum tree_code, int,
3072 unsigned HOST_WIDE_INT,
3073 HOST_WIDE_INT,
3074 unsigned HOST_WIDE_INT,
3075 HOST_WIDE_INT,
3076 unsigned HOST_WIDE_INT *,
3077 HOST_WIDE_INT *,
3078 unsigned HOST_WIDE_INT *,
3079 HOST_WIDE_INT *));
3081 /* In stmt.c */
3082 extern void emit_nop PARAMS ((void));
3083 extern void expand_computed_goto PARAMS ((tree));
3084 extern bool parse_output_constraint PARAMS ((const char **,
3085 int, int, int,
3086 bool *, bool *, bool *));
3087 extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
3088 const char *, int));
3089 extern int any_pending_cleanups PARAMS ((int));
3090 extern void init_stmt_for_function PARAMS ((void));
3091 extern void expand_start_target_temps PARAMS ((void));
3092 extern void expand_end_target_temps PARAMS ((void));
3093 extern void expand_elseif PARAMS ((tree));
3094 extern void save_stack_pointer PARAMS ((void));
3095 extern void expand_decl PARAMS ((tree));
3096 extern int expand_decl_cleanup PARAMS ((tree, tree));
3097 extern int expand_decl_cleanup_eh PARAMS ((tree, tree, int));
3098 extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
3099 extern void expand_start_case_dummy PARAMS ((void));
3100 extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *));
3101 extern void check_for_full_enumeration_handling PARAMS ((tree));
3102 extern void declare_nonlocal_label PARAMS ((tree));
3104 /* If KIND=='I', return a suitable global initializer (constructor) name.
3105 If KIND=='D', return a suitable global clean-up (destructor) name. */
3106 extern tree get_file_function_name PARAMS ((int));
3108 /* Interface of the DWARF2 unwind info support. */
3110 /* Generate a new label for the CFI info to refer to. */
3112 extern char *dwarf2out_cfi_label PARAMS ((void));
3114 /* Entry point to update the canonical frame address (CFA). */
3116 extern void dwarf2out_def_cfa PARAMS ((const char *, unsigned, long));
3118 /* Add the CFI for saving a register window. */
3120 extern void dwarf2out_window_save PARAMS ((const char *));
3122 /* Add a CFI to update the running total of the size of arguments pushed
3123 onto the stack. */
3125 extern void dwarf2out_args_size PARAMS ((const char *, long));
3127 /* Entry point for saving a register to the stack. */
3129 extern void dwarf2out_reg_save PARAMS ((const char *, unsigned, long));
3131 /* Entry point for saving the return address in the stack. */
3133 extern void dwarf2out_return_save PARAMS ((const char *, long));
3135 /* Entry point for saving the return address in a register. */
3137 extern void dwarf2out_return_reg PARAMS ((const char *, unsigned));
3139 /* The type of a function that walks over tree structure. */
3141 typedef tree (*walk_tree_fn) PARAMS ((tree *, int *, void *));
3143 /* In tree-dump.c */
3145 /* Different tree dump places. When you add new tree dump places,
3146 extend the DUMP_FILES array in tree-dump.c */
3147 enum tree_dump_index
3149 TDI_all, /* dump the whole translation unit */
3150 TDI_class, /* dump class hierarchy */
3151 TDI_original, /* dump each function before optimizing it */
3152 TDI_optimized, /* dump each function after optimizing it */
3153 TDI_inlined, /* dump each function after inlining
3154 within it. */
3155 TDI_end
3158 /* Bit masks to control tree dumping. Not all values are applicable to
3159 all tree dumps. Add new ones at the end. When you define new
3160 values, extend the DUMP_OPTIONS array in tree-dump.c */
3161 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3162 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3164 typedef struct dump_info *dump_info_p;
3166 extern int dump_flag PARAMS ((dump_info_p, int, tree));
3167 extern int dump_enabled_p PARAMS ((enum tree_dump_index));
3168 extern FILE *dump_begin PARAMS ((enum tree_dump_index, int *));
3169 extern void dump_end PARAMS ((enum tree_dump_index, FILE *));
3170 extern void dump_node PARAMS ((tree, int, FILE *));
3171 extern int dump_switch_p PARAMS ((const char *));
3172 extern const char *dump_flag_name PARAMS ((enum tree_dump_index));
3175 /* Redefine abort to report an internal error w/o coredump, and
3176 reporting the location of the error in the source file. This logic
3177 is duplicated in rtl.h and tree.h because every file that needs the
3178 special abort includes one or both. toplev.h gets too few files,
3179 system.h gets too many. */
3181 extern void fancy_abort PARAMS ((const char *, int, const char *))
3182 ATTRIBUTE_NORETURN;
3183 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3185 #endif /* GCC_TREE_H */