* java/util/Properties.java (load): Only skip line if the first
[official-gcc.git] / gcc / tree.h
blob4dd753a085111666da9c1d5bcd2a0f4d4b4be7ad
1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003 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, IM) 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];
102 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
104 /* The definition of tree nodes fills the next several pages. */
106 /* A tree node can represent a data type, a variable, an expression
107 or a statement. Each node has a TREE_CODE which says what kind of
108 thing it represents. Some common codes are:
109 INTEGER_TYPE -- represents a type of integers.
110 ARRAY_TYPE -- represents a type of pointer.
111 VAR_DECL -- represents a declared variable.
112 INTEGER_CST -- represents a constant integer value.
113 PLUS_EXPR -- represents a sum (an expression).
115 As for the contents of a tree node: there are some fields
116 that all nodes share. Each TREE_CODE has various special-purpose
117 fields as well. The fields of a node are never accessed directly,
118 always through accessor macros. */
120 /* Every kind of tree node starts with this structure,
121 so all nodes have these fields.
123 See the accessor macros, defined below, for documentation of the
124 fields. */
126 struct tree_common GTY(())
128 tree chain;
129 tree type;
131 ENUM_BITFIELD(tree_code) code : 8;
133 unsigned side_effects_flag : 1;
134 unsigned constant_flag : 1;
135 unsigned addressable_flag : 1;
136 unsigned volatile_flag : 1;
137 unsigned readonly_flag : 1;
138 unsigned unsigned_flag : 1;
139 unsigned asm_written_flag: 1;
140 unsigned unused_0 : 1;
142 unsigned used_flag : 1;
143 unsigned nothrow_flag : 1;
144 unsigned static_flag : 1;
145 unsigned public_flag : 1;
146 unsigned private_flag : 1;
147 unsigned protected_flag : 1;
148 unsigned bounded_flag : 1;
149 unsigned deprecated_flag : 1;
151 unsigned lang_flag_0 : 1;
152 unsigned lang_flag_1 : 1;
153 unsigned lang_flag_2 : 1;
154 unsigned lang_flag_3 : 1;
155 unsigned lang_flag_4 : 1;
156 unsigned lang_flag_5 : 1;
157 unsigned lang_flag_6 : 1;
158 unsigned unused_1 : 1;
161 /* The following table lists the uses of each of the above flags and
162 for which types of nodes they are defined. Note that expressions
163 include decls.
165 addressable_flag:
167 TREE_ADDRESSABLE in
168 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
169 ..._TYPE, IDENTIFIER_NODE.
170 In a STMT_EXPR, it means we want the result of the enclosed
171 expression.
173 static_flag:
175 TREE_STATIC in
176 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
177 TREE_NO_UNUSED_WARNING in
178 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
179 TREE_VIA_VIRTUAL in
180 TREE_LIST or TREE_VEC
181 TREE_CONSTANT_OVERFLOW in
182 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
183 TREE_SYMBOL_REFERENCED in
184 IDENTIFIER_NODE
185 CLEANUP_EH_ONLY in
186 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT,
187 TREE_LIST elements of a block's cleanup list.
189 public_flag:
191 TREE_OVERFLOW in
192 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
193 TREE_PUBLIC in
194 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
195 EXPR_WFL_EMIT_LINE_NOTE in
196 EXPR_WITH_FILE_LOCATION
198 private_flag:
200 TREE_PRIVATE in
201 ..._DECL
202 CALL_EXPR_HAS_RETURN_SLOT_ADDR in
203 CALL_EXPR
205 protected_flag:
207 TREE_PROTECTED in
208 BLOCK
209 ..._DECL
211 side_effects_flag:
213 TREE_SIDE_EFFECTS in
214 all expressions
216 volatile_flag:
218 TREE_THIS_VOLATILE in
219 all expressions
220 TYPE_VOLATILE in
221 ..._TYPE
223 readonly_flag:
225 TREE_READONLY in
226 all expressions
227 TYPE_READONLY in
228 ..._TYPE
230 constant_flag:
232 TREE_CONSTANT in
233 all expressions
235 unsigned_flag:
237 TREE_UNSIGNED in
238 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
239 DECL_BUILT_IN_NONANSI in
240 FUNCTION_DECL
241 SAVE_EXPR_NOPLACEHOLDER in
242 SAVE_EXPR
244 asm_written_flag:
246 TREE_ASM_WRITTEN in
247 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
248 BLOCK
250 used_flag:
252 TREE_USED in
253 expressions, IDENTIFIER_NODE
255 nothrow_flag:
257 TREE_NOTHROW in
258 CALL_EXPR, FUNCTION_DECL
260 bounded_flag:
262 TREE_BOUNDED in
263 expressions, VAR_DECL, PARM_DECL, FIELD_DECL, FUNCTION_DECL,
264 IDENTIFIER_NODE
265 TYPE_BOUNDED in
266 ..._TYPE
268 deprecated_flag:
270 TREE_DEPRECATED in
271 ..._DECL
274 /* Define accessors for the fields that all tree nodes have
275 (though some fields are not used for all kinds of nodes). */
277 /* The tree-code says what kind of node it is.
278 Codes are defined in tree.def. */
279 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
280 #define TREE_SET_CODE(NODE, VALUE) \
281 ((NODE)->common.code = (ENUM_BITFIELD (tree_code)) (VALUE))
283 /* When checking is enabled, errors will be generated if a tree node
284 is accessed incorrectly. The macros abort with a fatal error. */
285 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
287 #define TREE_CHECK(t, code) __extension__ \
288 ({ const tree __t = (t); \
289 if (TREE_CODE(__t) != (code)) \
290 tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \
291 __t; })
292 #define TREE_CLASS_CHECK(t, class) __extension__ \
293 ({ const tree __t = (t); \
294 if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \
295 tree_class_check_failed (__t, class, __FILE__, __LINE__, \
296 __FUNCTION__); \
297 __t; })
299 /* These checks have to be special cased. */
300 #define CST_OR_CONSTRUCTOR_CHECK(t) __extension__ \
301 ({ const tree __t = (t); \
302 enum tree_code const __c = TREE_CODE(__t); \
303 if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \
304 tree_check_failed (__t, CONSTRUCTOR, __FILE__, __LINE__, \
305 __FUNCTION__); \
306 __t; })
307 #define EXPR_CHECK(t) __extension__ \
308 ({ const tree __t = (t); \
309 char const __c = TREE_CODE_CLASS(TREE_CODE(__t)); \
310 if (__c != 'r' && __c != 's' && __c != '<' \
311 && __c != '1' && __c != '2' && __c != 'e') \
312 tree_class_check_failed (__t, 'e', __FILE__, __LINE__, \
313 __FUNCTION__); \
314 __t; })
316 #define TREE_VEC_ELT_CHECK(t, i) __extension__ \
317 (*({const tree __t = t; \
318 const int __i = (i); \
319 if (TREE_CODE (__t) != TREE_VEC) \
320 tree_check_failed (__t, TREE_VEC, \
321 __FILE__, __LINE__, __FUNCTION__); \
322 if (__i < 0 || __i >= __t->vec.length) \
323 tree_vec_elt_check_failed (__i, __t->vec.length, \
324 __FILE__, __LINE__, __FUNCTION__); \
325 &__t->vec.a[__i]; }))
327 extern void tree_check_failed PARAMS ((const tree, enum tree_code,
328 const char *, int, const char *))
329 ATTRIBUTE_NORETURN;
330 extern void tree_class_check_failed PARAMS ((const tree, int,
331 const char *, int, const char *))
332 ATTRIBUTE_NORETURN;
333 extern void tree_vec_elt_check_failed PARAMS ((int, int, const char *,
334 int, const char *))
335 ATTRIBUTE_NORETURN;
337 #else /* not ENABLE_TREE_CHECKING, or not gcc */
339 #define TREE_CHECK(t, code) (t)
340 #define TREE_CLASS_CHECK(t, code) (t)
341 #define CST_OR_CONSTRUCTOR_CHECK(t) (t)
342 #define EXPR_CHECK(t) (t)
343 #define TREE_VEC_ELT_CHECK(t, i) ((t)->vec.a[i])
345 #endif
347 #include "tree-check.h"
349 #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't')
350 #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd')
351 #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c')
353 /* In all nodes that are expressions, this is the data type of the expression.
354 In POINTER_TYPE nodes, this is the type that the pointer points to.
355 In ARRAY_TYPE nodes, this is the type of the elements.
356 In VECTOR_TYPE nodes, this is the type of the elements. */
357 #define TREE_TYPE(NODE) ((NODE)->common.type)
359 /* Here is how primitive or already-canonicalized types' hash codes
360 are made. */
361 #define TYPE_HASH(TYPE) ((size_t) (TYPE) & 0777777)
363 /* Nodes are chained together for many purposes.
364 Types are chained together to record them for being output to the debugger
365 (see the function `chain_type').
366 Decls in the same scope are chained together to record the contents
367 of the scope.
368 Statement nodes for successive statements used to be chained together.
369 Often lists of things are represented by TREE_LIST nodes that
370 are chained together. */
372 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
374 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
375 that don't change the machine mode. */
377 #define STRIP_NOPS(EXP) \
378 while ((TREE_CODE (EXP) == NOP_EXPR \
379 || TREE_CODE (EXP) == CONVERT_EXPR \
380 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
381 && TREE_OPERAND (EXP, 0) != error_mark_node \
382 && (TYPE_MODE (TREE_TYPE (EXP)) \
383 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
384 (EXP) = TREE_OPERAND (EXP, 0)
386 /* Like STRIP_NOPS, but don't let the signedness change either. */
388 #define STRIP_SIGN_NOPS(EXP) \
389 while ((TREE_CODE (EXP) == NOP_EXPR \
390 || TREE_CODE (EXP) == CONVERT_EXPR \
391 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
392 && TREE_OPERAND (EXP, 0) != error_mark_node \
393 && (TYPE_MODE (TREE_TYPE (EXP)) \
394 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
395 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \
396 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
397 (EXP) = TREE_OPERAND (EXP, 0)
399 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
401 #define STRIP_TYPE_NOPS(EXP) \
402 while ((TREE_CODE (EXP) == NOP_EXPR \
403 || TREE_CODE (EXP) == CONVERT_EXPR \
404 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
405 && TREE_OPERAND (EXP, 0) != error_mark_node \
406 && (TREE_TYPE (EXP) \
407 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
408 (EXP) = TREE_OPERAND (EXP, 0)
410 /* Nonzero if TYPE represents an integral type. Note that we do not
411 include COMPLEX types here. */
413 #define INTEGRAL_TYPE_P(TYPE) \
414 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
415 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
417 /* Nonzero if TYPE represents a floating-point type, including complex
418 floating-point types. */
420 #define FLOAT_TYPE_P(TYPE) \
421 (TREE_CODE (TYPE) == REAL_TYPE \
422 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
423 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
425 /* Nonzero if TYPE represents an aggregate (multi-component) type. */
427 #define AGGREGATE_TYPE_P(TYPE) \
428 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
429 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
430 || TREE_CODE (TYPE) == SET_TYPE)
432 /* Nonzero if TYPE represents an unbounded pointer or unbounded
433 reference type. (It should be renamed to INDIRECT_TYPE_P.) */
435 #define POINTER_TYPE_P(TYPE) \
436 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
438 /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */
440 #define BOUNDED_INDIRECT_TYPE_P(TYPE) \
441 (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE))
443 /* Nonzero if TYPE represents a bounded pointer type. */
445 #define BOUNDED_POINTER_TYPE_P(TYPE) \
446 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
447 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE)
449 /* Nonzero if TYPE represents a bounded reference type. Bounded
450 reference types have two specific uses: (1) When a reference is
451 seated to a variable-length RECORD_TYPE that has an array of
452 indeterminate length as its final field. For all other objects, it
453 is sufficient to check bounds at the time the reference is seated,
454 and assume that all future uses of the reference are safe, since
455 the address of references cannot change. (2) When a reference
456 supertype is seated to a subtype object. The bounds "remember"
457 the true size of the complete object, so that subsequent upcasts of
458 the address of the reference will be checked properly (is such a
459 thing valid C++?). */
461 #define BOUNDED_REFERENCE_TYPE_P(TYPE) \
462 (BOUNDED_INDIRECT_TYPE_P (TYPE) \
463 && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE)
465 /* Nonzero if TYPE represents a pointer or reference type, either
466 bounded or unbounded. */
468 #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \
469 (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE))
471 /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */
473 #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \
474 (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE))
476 /* Nonzero if TYPE represents a reference type, either bounded or
477 unbounded. */
479 #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \
480 (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE))
482 /* Nonzero if this type is a complete type. */
483 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
485 /* Nonzero if this type is the (possibly qualified) void type. */
486 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
488 /* Nonzero if this type is complete or is cv void. */
489 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
490 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
492 /* Nonzero if this type is complete or is an array with unspecified bound. */
493 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
494 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
496 /* Nonzero if TYPE represents a type. */
498 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
500 /* Define many boolean fields that all tree nodes have. */
502 /* In VAR_DECL nodes, nonzero means address of this is needed.
503 So it cannot be in a register.
504 In a FUNCTION_DECL, nonzero means its address is needed.
505 So it must be compiled even if it is an inline function.
506 In a FIELD_DECL node, it means that the programmer is permitted to
507 construct the address of this field. This is used for aliasing
508 purposes: see record_component_aliases.
509 In CONSTRUCTOR nodes, it means object constructed must be in memory.
510 In LABEL_DECL nodes, it means a goto for this label has been seen
511 from a place outside all binding contours that restore stack levels.
512 In ..._TYPE nodes, it means that objects of this type must
513 be fully addressable. This means that pieces of this
514 object cannot go into register parameters, for example.
515 In IDENTIFIER_NODEs, this means that some extern decl for this name
516 had its address taken. That matters for inline functions. */
517 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
519 /* In a VAR_DECL, nonzero means allocate static storage.
520 In a FUNCTION_DECL, nonzero if function has been defined.
521 In a CONSTRUCTOR, nonzero means allocate static storage. */
522 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
524 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a
525 block's cleanup list, means that the pertinent cleanup should only be
526 executed if an exception is thrown, not on normal exit of its scope. */
527 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
529 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
530 made implicitly and should not lead to an "unused value" warning. */
531 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
533 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
534 chain is via a `virtual' declaration. */
535 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
537 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
538 there was an overflow in folding. This is distinct from
539 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
540 occur in constant expressions. */
541 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
543 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
544 this string as an argument. */
545 #define TREE_SYMBOL_REFERENCED(NODE) \
546 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
548 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
549 there was an overflow in folding, and no warning has been issued
550 for this subexpression. TREE_OVERFLOW implies
551 TREE_CONSTANT_OVERFLOW, but not vice versa. */
552 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
554 /* In a VAR_DECL or FUNCTION_DECL,
555 nonzero means name is to be accessible from outside this module.
556 In an IDENTIFIER_NODE, nonzero means an external declaration
557 accessible from outside this module was previously seen
558 for this name in an inner scope. */
559 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
561 /* In any expression, nonzero means it has side effects or reevaluation
562 of the whole expression could produce a different value.
563 This is set if any subexpression is a function call, a side effect
564 or a reference to a volatile variable.
565 In a ..._DECL, this is set only if the declaration said `volatile'. */
566 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
568 /* Nonzero means this expression is volatile in the C sense:
569 its address should be of type `volatile WHATEVER *'.
570 In other words, the declared item is volatile qualified.
571 This is used in _DECL nodes and _REF nodes.
573 In a ..._TYPE node, means this type is volatile-qualified.
574 But use TYPE_VOLATILE instead of this macro when the node is a type,
575 because eventually we may make that a different bit.
577 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
578 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
580 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
581 nonzero means it may not be the lhs of an assignment.
582 In a ..._TYPE node, means this type is const-qualified
583 (but the macro TYPE_READONLY should be used instead of this macro
584 when the node is a type). */
585 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
587 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
588 #define TREE_READONLY_DECL_P(NODE) (TREE_READONLY (NODE) && DECL_P (NODE))
590 /* Value of expression is constant.
591 Always appears in all ..._CST nodes.
592 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
593 if the value is constant. */
594 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
596 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
597 In FIELD_DECL nodes, means an unsigned bit field.
598 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
599 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
601 #define TYPE_TRAP_SIGNED(NODE) \
602 (flag_trapv && ! TREE_UNSIGNED (TYPE_CHECK (NODE)))
604 /* Nonzero in a VAR_DECL means assembler code has been written.
605 Nonzero in a FUNCTION_DECL means that the function has been compiled.
606 This is interesting in an inline function, since it might not need
607 to be compiled separately.
608 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
609 if the sdb debugging info for the type has been written.
610 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
611 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
613 /* Nonzero in a _DECL if the name is used in its scope.
614 Nonzero in an expr node means inhibit warning if value is unused.
615 In IDENTIFIER_NODEs, this means that some extern decl for this name
616 was used. */
617 #define TREE_USED(NODE) ((NODE)->common.used_flag)
619 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
620 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
621 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
623 /* In a CALL_EXPR, means that the address of the return slot is part of the
624 argument list. */
625 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag)
627 /* In a type, nonzero means that all objects of the type are guaranteed by the
628 language or front-end to be properly aligned, so we can indicate that a MEM
629 of this type is aligned at least to the alignment of the type, even if it
630 doesn't appear that it is. We see this, for example, in object-oriented
631 languages where a tag field may show this is an object of a more-aligned
632 variant of the more generic type. */
633 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
635 /* Used in classes in C++. */
636 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
637 /* Used in classes in C++.
638 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
639 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
641 /* In a ..._TYPE node, nonzero means that the type's size and layout,
642 (or the size and layout of its arguments and/or return value in the
643 case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence
644 of pointer bounds. Use TYPE_BOUNDED instead of this macro when the
645 node is a type, because eventually we may make that a different
646 bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect
647 type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P,
648 BOUNDED_INDIRECT_TYPE_P to test for that.
650 In a FUNCTION_DECL, nonzero means that the size and layout of one
651 of its arguments and/or return value was changed by the presence of
652 pointer bounds. This value can differ from the value of
653 TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly
654 declared, then later called with pointer args, or was declared with
655 a variable argument list and is later called with pointer values in
656 the variable argument list.
658 In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value
659 of the decl's type's BOUNDED_POINTER_TYPE_P.
661 In a CONSTRUCTOR or other expression, nonzero means the value is a
662 bounded pointer. It is insufficient to determine the boundedness
663 of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)),
664 since we allow pointer to be temporarily cast to integer for
665 rounding up to an alignment boundary in a way that preserves the
666 pointer's bounds.
668 In an IDENTIFIER_NODE, nonzero means that the name is prefixed with
669 BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME
670 of a function that has bounded pointer(s) for its return type and/or
671 argument type(s). */
673 #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag)
675 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a
676 deprecated feature by __attribute__((deprecated)). */
677 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag)
679 /* These flags are available for each language front end to use internally. */
680 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
681 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
682 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
683 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
684 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
685 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
686 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
688 /* Define additional fields and accessors for nodes representing constants. */
690 /* In an INTEGER_CST node. These two together make a 2-word integer.
691 If the data type is signed, the value is sign-extended to 2 words
692 even though not all of them may really be in use.
693 In an unsigned constant shorter than 2 words, the extra bits are 0. */
694 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
695 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
696 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
698 #define INT_CST_LT(A, B) \
699 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
700 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
701 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
703 #define INT_CST_LT_UNSIGNED(A, B) \
704 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
705 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
706 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
707 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
708 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
710 struct tree_int_cst GTY(())
712 struct tree_common common;
713 rtx rtl; /* acts as link to register transfer language
714 (rtl) info */
715 /* A sub-struct is necessary here because the function `const_hash'
716 wants to scan both words as a unit and taking the address of the
717 sub-struct yields the properly inclusive bounded pointer. */
718 struct tree_int_cst_lowhi {
719 unsigned HOST_WIDE_INT low;
720 HOST_WIDE_INT high;
721 } int_cst;
724 /* In REAL_CST, STRING_CST, COMPLEX_CST, VECTOR_CST nodes, and
725 CONSTRUCTOR nodes, and generally in all kinds of constants that
726 could be given labels (rather than being immediate). */
728 #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
730 /* In a REAL_CST node. struct real_value is an opaque entity, with
731 manipulators defined in real.h. We don't want tree.h depending on
732 real.h and transitively on tm.h. */
733 struct real_value;
735 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
736 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
738 struct tree_real_cst GTY(())
740 struct tree_common common;
741 rtx rtl; /* acts as link to register transfer language (rtl) info */
742 struct real_value * real_cst_ptr;
745 /* In a STRING_CST */
746 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
747 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
749 struct tree_string GTY(())
751 struct tree_common common;
752 rtx rtl; /* acts as link to register transfer language (rtl) info */
753 int length;
754 const char *pointer;
757 /* In a COMPLEX_CST node. */
758 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
759 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
761 struct tree_complex GTY(())
763 struct tree_common common;
764 rtx rtl; /* acts as link to register transfer language (rtl) info */
765 tree real;
766 tree imag;
769 /* In a VECTOR_CST node. */
770 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
772 struct tree_vector GTY(())
774 struct tree_common common;
775 rtx rtl;
776 tree elements;
779 #include "hashtable.h"
781 /* Define fields and accessors for some special-purpose tree nodes. */
783 #define IDENTIFIER_LENGTH(NODE) \
784 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
785 #define IDENTIFIER_POINTER(NODE) \
786 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
788 /* Translate a hash table identifier pointer to a tree_identifier
789 pointer, and vice versa. */
791 #define HT_IDENT_TO_GCC_IDENT(NODE) \
792 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
793 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
795 struct tree_identifier GTY(())
797 struct tree_common common;
798 struct ht_identifier id;
801 /* In a TREE_LIST node. */
802 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
803 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
805 struct tree_list GTY(())
807 struct tree_common common;
808 tree purpose;
809 tree value;
812 /* In a TREE_VEC node. */
813 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
814 #define TREE_VEC_END(NODE) \
815 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
817 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
819 struct tree_vec GTY(())
821 struct tree_common common;
822 int length;
823 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
826 /* Define fields and accessors for some nodes that represent expressions. */
828 /* In a SAVE_EXPR node. */
829 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND (SAVE_EXPR_CHECK (NODE), 1)
830 #define SAVE_EXPR_RTL(NODE) (*(rtx *) &SAVE_EXPR_CHECK (NODE)->exp.operands[2])
831 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (SAVE_EXPR_CHECK (NODE))
832 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs
833 both in normal code and in a handler. (Normally, in a handler, all
834 SAVE_EXPRs are unsaved, meaning that their values are
835 recalculated.) */
836 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE))
838 /* In a RTL_EXPR node. */
839 #define RTL_EXPR_SEQUENCE(NODE) \
840 (*(rtx *) &RTL_EXPR_CHECK (NODE)->exp.operands[0])
841 #define RTL_EXPR_RTL(NODE) (*(rtx *) &RTL_EXPR_CHECK (NODE)->exp.operands[1])
843 /* In a WITH_CLEANUP_EXPR node. */
844 #define WITH_CLEANUP_EXPR_RTL(NODE) \
845 (*(rtx *) &WITH_CLEANUP_EXPR_CHECK (NODE)->exp.operands[2])
847 /* In a CONSTRUCTOR node. */
848 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (CONSTRUCTOR_CHECK (NODE), 1)
850 /* In ordinary expression nodes. */
851 #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
852 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
854 /* In a LABELED_BLOCK_EXPR node. */
855 #define LABELED_BLOCK_LABEL(NODE) \
856 TREE_OPERAND (LABELED_BLOCK_EXPR_CHECK (NODE), 0)
857 #define LABELED_BLOCK_BODY(NODE) \
858 TREE_OPERAND (LABELED_BLOCK_EXPR_CHECK (NODE), 1)
860 /* In an EXIT_BLOCK_EXPR node. */
861 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \
862 TREE_OPERAND (EXIT_BLOCK_EXPR_CHECK (NODE), 0)
863 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (EXIT_BLOCK_EXPR_CHECK (NODE), 1)
865 /* In a LOOP_EXPR node. */
866 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (LOOP_EXPR_CHECK (NODE), 0)
868 /* In an EXPR_WITH_FILE_LOCATION node. */
869 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \
870 (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag)
871 #define EXPR_WFL_NODE(NODE) \
872 TREE_OPERAND (EXPR_WITH_FILE_LOCATION_CHECK (NODE), 0)
873 #define EXPR_WFL_FILENAME_NODE(NODE) \
874 TREE_OPERAND (EXPR_WITH_FILE_LOCATION_CHECK (NODE), 1)
875 #define EXPR_WFL_FILENAME(NODE) \
876 IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE (NODE))
877 /* ??? Java uses this in all expressions. */
878 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
879 #define EXPR_WFL_LINENO(NODE) (EXPR_WFL_LINECOL (NODE) >> 12)
880 #define EXPR_WFL_COLNO(NODE) (EXPR_WFL_LINECOL (NODE) & 0xfff)
881 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
882 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
884 /* In a TARGET_EXPR node. */
885 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND (TARGET_EXPR_CHECK (NODE), 0)
886 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND (TARGET_EXPR_CHECK (NODE), 1)
887 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND (TARGET_EXPR_CHECK (NODE), 2)
889 struct tree_exp GTY(())
891 struct tree_common common;
892 int complexity;
893 tree GTY ((special ("tree_exp"),
894 desc ("TREE_CODE ((tree) &%0)")))
895 operands[1];
898 /* In a BLOCK node. */
899 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
900 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
901 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
902 /* Note: when changing this, make sure to find the places
903 that use chainon or nreverse. */
904 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
905 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
906 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
908 /* Nonzero means that this block is prepared to handle exceptions
909 listed in the BLOCK_VARS slot. */
910 #define BLOCK_HANDLER_BLOCK(NODE) \
911 (BLOCK_CHECK (NODE)->block.handler_block_flag)
913 /* An index number for this block. These values are not guaranteed to
914 be unique across functions -- whether or not they are depends on
915 the debugging output format in use. */
916 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
918 /* If block reordering splits a lexical block into discontiguous
919 address ranges, we'll make a copy of the original block.
921 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
922 In that case, we have one source block that has been replicated
923 (through inlining or unrolling) into many logical blocks, and that
924 these logical blocks have different physical variables in them.
926 In this case, we have one logical block split into several
927 non-contiguous address ranges. Most debug formats can't actually
928 represent this idea directly, so we fake it by creating multiple
929 logical blocks with the same variables in them. However, for those
930 that do support non-contiguous regions, these allow the original
931 logical block to be reconstructed, along with the set of address
932 ranges.
934 One of the logical block fragments is arbitrarily chosen to be
935 the ORIGIN. The other fragments will point to the origin via
936 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
937 be null. The list of fragments will be chained through
938 BLOCK_FRAGMENT_CHAIN from the origin. */
940 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
941 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
943 struct tree_block GTY(())
945 struct tree_common common;
947 unsigned handler_block_flag : 1;
948 unsigned abstract_flag : 1;
949 unsigned block_num : 30;
951 tree vars;
952 tree subblocks;
953 tree supercontext;
954 tree abstract_origin;
955 tree fragment_origin;
956 tree fragment_chain;
959 /* Define fields and accessors for nodes representing data types. */
961 /* See tree.def for documentation of the use of these fields.
962 Look at the documentation of the various ..._TYPE tree codes. */
964 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
965 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
966 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
967 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
968 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
969 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
970 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
971 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
972 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
973 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
974 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
975 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
976 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
977 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
978 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
979 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
980 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
981 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
982 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
983 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
984 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
985 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
986 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
987 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
988 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
990 /* For a VECTOR_TYPE node, this describes a different type which is emitted
991 in the debugging output. We use this to describe a vector as a
992 structure containing an array. */
993 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values)
995 /* Indirect types present difficulties because they may be represented
996 as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as
997 RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might
998 be logically equivalent, but physically different. Simple
999 comparison of the main variant only tells if the types are
1000 logically equivalent. Use this predicate to compare for physical
1001 equivalency. */
1003 /* Types have the same main variant, and have the same boundedness. */
1004 #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \
1005 (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \
1006 && TREE_CODE (TYPE1) == TREE_CODE (TYPE2))
1008 /* Return the type variant that has no qualifiers (i.e., the main variant),
1009 except that the boundedness qualifier is preserved. */
1010 #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \
1011 (BOUNDED_POINTER_TYPE_P (TYPE) \
1012 ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \
1013 : TYPE_MAIN_VARIANT (TYPE))
1015 /* For aggregate types, information about this type, as a base type
1016 for itself. Used in a language-dependent way for types that are
1017 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
1018 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
1020 /* The (language-specific) typed-based alias set for this type.
1021 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1022 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1023 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1024 type can alias objects of any type. */
1025 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1027 /* Nonzero iff the typed-based alias set for this type has been
1028 calculated. */
1029 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1031 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1032 to this type. */
1033 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1035 /* The alignment necessary for objects of this type.
1036 The value is an int, measured in bits. */
1037 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1039 /* 1 if the alignment for this type was requested by "aligned" attribute,
1040 0 if it is the default for this type. */
1041 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1043 /* The alignment for NODE, in bytes. */
1044 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1046 /* If your language allows you to declare types, and you want debug info
1047 for them, then you need to generate corresponding TYPE_DECL nodes.
1048 These "stub" TYPE_DECL nodes have no name, and simply point at the
1049 type node. You then set the TYPE_STUB_DECL field of the type node
1050 to point back at the TYPE_DECL node. This allows the debug routines
1051 to know that the two nodes represent the same type, so that we only
1052 get one debug info record for them. */
1053 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1055 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1056 has BLKmode only because it lacks the alignment requirement for
1057 its size. */
1058 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1060 /* In an INTEGER_TYPE, it means the type represents a size. We use
1061 this both for validity checking and to permit optimizations that
1062 are unsafe for other types. Note that the C `size_t' type should
1063 *not* have this flag set. The `size_t' type is simply a typedef
1064 for an ordinary integer type that happens to be the type of an
1065 expression returned by `sizeof'; `size_t' has no special
1066 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1067 always actual sizes. */
1068 #define TYPE_IS_SIZETYPE(NODE) \
1069 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1071 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1072 pointer depressed. */
1073 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1074 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1076 /* Nonzero in a type considered volatile as a whole. */
1077 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1079 /* Means this type is const-qualified. */
1080 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1082 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1083 the term. */
1084 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1086 /* If nonzero, this type's size and layout, (or the size and layout of
1087 its arguments and/or return value in the case of a FUNCTION_TYPE or
1088 METHOD_TYPE) was changed by the presence of pointer bounds. */
1089 #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag)
1091 /* There is a TYPE_QUAL value for each type qualifier. They can be
1092 combined by bitwise-or to form the complete set of qualifiers for a
1093 type. */
1095 #define TYPE_UNQUALIFIED 0x0
1096 #define TYPE_QUAL_CONST 0x1
1097 #define TYPE_QUAL_VOLATILE 0x2
1098 #define TYPE_QUAL_RESTRICT 0x4
1099 #define TYPE_QUAL_BOUNDED 0x8
1101 /* The set of type qualifiers for this type. */
1102 #define TYPE_QUALS(NODE) \
1103 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1104 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1105 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1106 | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED))
1108 /* The set of qualifiers pertinent to an expression node. */
1109 #define TREE_EXPR_QUALS(NODE) \
1110 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1111 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1112 | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED))
1114 /* The set of qualifiers pertinent to a FUNCTION_DECL node. */
1115 #define TREE_FUNC_QUALS(NODE) \
1116 ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \
1117 | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE))
1119 /* These flags are available for each language front end to use internally. */
1120 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1121 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1122 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1123 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1124 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1125 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1126 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1128 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1129 that distinguish string from array of char).
1130 If set in a SET_TYPE, indicates a bitstring type. */
1131 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1133 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1134 object of the given ARRAY_TYPE. This allows temporaries to be
1135 allocated. */
1136 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1137 TYPE_MAX_VALUE (ARRAY_TYPE_CHECK (ARRAY_TYPE))
1139 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1140 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1141 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode)
1143 /* Indicates that objects of this type must be initialized by calling a
1144 function when they are created. */
1145 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1146 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1148 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1149 the same way that the first union alternative would be passed. */
1150 #define TYPE_TRANSPARENT_UNION(NODE) \
1151 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1153 /* For an ARRAY_TYPE, indicates that it is not permitted to
1154 take the address of a component of the type. */
1155 #define TYPE_NONALIASED_COMPONENT(NODE) \
1156 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1158 /* Indicated that objects of this type should be laid out in as
1159 compact a way as possible. */
1160 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1162 /* A bounded pointer or bounded reference type (collectively called
1163 indirect types) is represented as a RECORD_TYPE node containing
1164 three pointer fields whose type is the corresponding unbounded
1165 POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents
1166 a bounded indirect type differs from a normal RECORD_TYPE node in
1167 that its TREE_TYPE is non-NULL and has the pointed-to type just as
1168 a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE
1169 nodes are stored on the same type variant chain alongside the
1170 variants of the underlaying indirect types nodes. The main variant
1171 of such chains is always the unbounded type. */
1173 /* Access the field decls of a bounded-pointer type. */
1174 #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE)
1175 #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE))
1176 #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE))
1178 /* Access the simple-pointer subtype of a bounded-pointer type. */
1179 #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE))
1181 /* Find the unbounded counterpart to a type, or return TYPE if it is
1182 already unbounded. */
1183 #define TYPE_UNBOUNDED_VARIANT(TYPE) \
1184 (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE))
1186 /* This field comprises two bits, for values in the range 0..3:
1188 depth=0 means that type is a scalar, or an aggregate that contains
1189 only depth=0 types, or a function that has only depth=0 types for
1190 its return value and argument types.
1192 depth=1 means that type is a pointer to a depth=0 type, or an
1193 aggregate that contains only depth=0 and depth=1 types, or a
1194 function that has only depth=0 and depth=1 types for its return
1195 value and argument types.
1197 The meanings of depth=2 and depth=3 are obvious by induction.
1198 Varargs functions are depth=3. The type `va_list' is depth=3.
1200 The purpose of measuring pointer depth of a type is to determine
1201 the eligibility of a function for an automatically-generated
1202 bounded-pointer thunk. A depth=0 functions needs no thunk. A
1203 depth=1 function is eligible for an automatic thunk. Functions
1204 with depth 2 or more are too complex to get automatic thunks.
1206 Function decls also have a pointer_depth field, since we also
1207 consider the actual argument types for functions. */
1209 #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth)
1211 /* In a FUNCTION_TYPE node, this bit stores the value of
1212 default_pointer_boundedness at the time TYPE was created. It is
1213 useful for choosing default boundedness of function arguments for
1214 non-prototype function decls and for varargs/stdarg lists. */
1215 #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \
1216 (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag)
1218 #define MAX_POINTER_DEPTH 2
1219 #define VA_LIST_POINTER_DEPTH 3
1221 struct die_struct;
1223 struct tree_type GTY(())
1225 struct tree_common common;
1226 tree values;
1227 tree size;
1228 tree size_unit;
1229 tree attributes;
1230 unsigned int uid;
1232 unsigned int precision : 9;
1233 ENUM_BITFIELD(machine_mode) mode : 7;
1235 unsigned string_flag : 1;
1236 unsigned no_force_blk_flag : 1;
1237 unsigned needs_constructing_flag : 1;
1238 unsigned transparent_union_flag : 1;
1239 unsigned packed_flag : 1;
1240 unsigned restrict_flag : 1;
1241 unsigned pointer_depth : 2;
1243 unsigned lang_flag_0 : 1;
1244 unsigned lang_flag_1 : 1;
1245 unsigned lang_flag_2 : 1;
1246 unsigned lang_flag_3 : 1;
1247 unsigned lang_flag_4 : 1;
1248 unsigned lang_flag_5 : 1;
1249 unsigned lang_flag_6 : 1;
1250 unsigned user_align : 1;
1252 unsigned int align;
1253 tree pointer_to;
1254 tree reference_to;
1255 union tree_type_symtab {
1256 int GTY ((tag ("0"))) address;
1257 char * GTY ((tag ("1"))) pointer;
1258 struct die_struct * GTY ((tag ("2"))) die;
1259 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1260 descbits ("2"))) symtab;
1261 tree name;
1262 tree minval;
1263 tree maxval;
1264 tree next_variant;
1265 tree main_variant;
1266 tree binfo;
1267 tree context;
1268 HOST_WIDE_INT alias_set;
1269 /* Points to a structure whose details depend on the language in use. */
1270 struct lang_type *lang_specific;
1273 /* Define accessor macros for information about type inheritance
1274 and basetypes.
1276 A "basetype" means a particular usage of a data type for inheritance
1277 in another type. Each such basetype usage has its own "binfo"
1278 object to describe it. The binfo object is a TREE_VEC node.
1280 Inheritance is represented by the binfo nodes allocated for a
1281 given type. For example, given types C and D, such that D is
1282 inherited by C, 3 binfo nodes will be allocated: one for describing
1283 the binfo properties of C, similarly one for D, and one for
1284 describing the binfo properties of D as a base type for C.
1285 Thus, given a pointer to class C, one can get a pointer to the binfo
1286 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1288 /* The actual data type node being inherited in this basetype. */
1289 #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
1291 /* The offset where this basetype appears in its containing type.
1292 BINFO_OFFSET slot holds the offset (in bytes)
1293 from the base of the complete object to the base of the part of the
1294 object that is allocated on behalf of this `type'.
1295 This is always 0 except when there is multiple inheritance. */
1297 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
1298 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
1299 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1301 /* The virtual function table belonging to this basetype. Virtual
1302 function tables provide a mechanism for run-time method dispatching.
1303 The entries of a virtual function table are language-dependent. */
1305 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
1306 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
1308 /* The virtual functions in the virtual function table. This is
1309 a TREE_LIST that is used as an initial approximation for building
1310 a virtual function table for this basetype. */
1311 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
1312 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
1314 /* A vector of binfos for the direct basetypes inherited by this
1315 basetype.
1317 If this basetype describes type D as inherited in C, and if the
1318 basetypes of D are E and F, then this vector contains binfos for
1319 inheritance of E and F by C.
1321 ??? This could probably be done by just allocating the
1322 base types at the end of this TREE_VEC (instead of using
1323 another TREE_VEC). This would simplify the calculation
1324 of how many basetypes a given type had. */
1325 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
1326 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
1328 /* The number of basetypes for NODE. */
1329 #define BINFO_N_BASETYPES(NODE) \
1330 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0)
1332 /* Accessor macro to get to the Nth basetype of this basetype. */
1333 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
1334 #define TYPE_BINFO_BASETYPE(NODE,N) \
1335 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
1337 /* For a BINFO record describing a virtual base class, i.e., one where
1338 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1339 base. The actual contents are language-dependent. In the C++
1340 front-end this field is an INTEGER_CST giving an offset into the
1341 vtable where the offset to the virtual base can be found. */
1342 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5)
1344 /* Indicates the accesses this binfo has to its bases. The values are
1345 access_public_node, access_protected_node or access_private_node.
1346 If this array is not present, public access is implied. */
1347 #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6)
1348 #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N))
1350 /* Number of language independent elements in a binfo. Languages may
1351 add additional trailing elements. */
1353 #define BINFO_ELTS 7
1355 /* Slot used to build a chain that represents a use of inheritance.
1356 For example, if X is derived from Y, and Y is derived from Z,
1357 then this field can be used to link the binfo node for X to
1358 the binfo node for X's Y to represent the use of inheritance
1359 from X to Y. Similarly, this slot of the binfo node for X's Y
1360 can point to the Z from which Y is inherited (in X's inheritance
1361 hierarchy). In this fashion, one can represent and traverse specific
1362 uses of inheritance using the binfo nodes themselves (instead of
1363 consing new space pointing to binfo nodes).
1364 It is up to the language-dependent front-ends to maintain
1365 this information as necessary. */
1366 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1368 /* Define fields and accessors for nodes representing declared names. */
1370 /* Nonzero if DECL represents a decl. */
1371 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
1373 /* This is the name of the object as written by the user.
1374 It is an IDENTIFIER_NODE. */
1375 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1377 /* The name of the object as the assembler will see it (but before any
1378 translations made by ASM_OUTPUT_LABELREF). Often this is the same
1379 as DECL_NAME. It is an IDENTIFIER_NODE. */
1380 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
1382 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
1383 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
1384 yet. */
1385 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
1386 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE)
1388 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
1389 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
1390 (DECL_CHECK (NODE)->decl.assembler_name = (NAME))
1392 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
1393 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
1394 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
1395 semantics of using this macro, are different than saying:
1397 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
1399 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
1401 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
1402 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
1403 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
1404 DECL_ASSEMBLER_NAME (DECL1)) \
1405 : (void) 0)
1407 /* Records the section name in a section attribute. Used to pass
1408 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1409 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1411 /* For FIELD_DECLs, this is the
1412 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1413 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1414 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1415 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1416 type, or NULL_TREE if the given decl has "file scope". */
1417 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1418 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context)
1419 /* In a DECL this is the field where attributes are stored. */
1420 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes)
1421 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
1422 byte containing the bit closest to the beginning of the structure. */
1423 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments)
1424 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
1425 field from DECL_FIELD_OFFSET. */
1426 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t)
1427 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1428 if so, the type that was originally specified for it.
1429 TREE_TYPE may have been modified (in finish_struct). */
1430 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result)
1431 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
1432 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
1433 uses. */
1434 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1435 /* This field is used to reference anything in decl.result and is meant only
1436 for use by the garbage collector. */
1437 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result)
1438 /* In FUNCTION_DECL, holds the decl for the return value. */
1439 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result)
1440 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1441 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result)
1442 /* In PARM_DECL, holds the type as written (perhaps a function or array). */
1443 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result)
1444 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1445 For a VAR_DECL, holds the initial value.
1446 For a PARM_DECL, not used--default
1447 values for parameters are encoded in the type of the function,
1448 not in the PARM_DECL slot. */
1449 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1450 /* For a PARM_DECL, records the data type used to pass the argument,
1451 which may be different from the type seen in the program. */
1452 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial)
1453 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1454 if nonzero, indicates that the field occupies the type. */
1455 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial)
1456 /* These two fields describe where in the source code the declaration
1457 was. If the declaration appears in several places (as for a C
1458 function that is declared first and then defined later), this
1459 information should refer to the definition. */
1460 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus)
1461 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file)
1462 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line)
1463 /* Holds the size of the datum, in bits, as a tree expression.
1464 Need not be constant. */
1465 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1466 /* Likewise for the size in bytes. */
1467 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit)
1468 /* Holds the alignment required for the datum, in bits. */
1469 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align)
1470 /* The alignment of NODE, in bytes. */
1471 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1472 /* For FIELD_DECLs, off_align holds the number of low-order bits of
1473 DECL_FIELD_OFFSET which are known to be always zero.
1474 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
1475 has. */
1476 #define DECL_OFFSET_ALIGN(NODE) \
1477 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align)
1478 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
1479 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
1480 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X)))
1481 /* 1 if the alignment for this type was requested by "aligned" attribute,
1482 0 if it is the default for this type. */
1483 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align)
1484 /* Holds the machine mode corresponding to the declaration of a variable or
1485 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1486 FIELD_DECL. */
1487 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1488 /* Holds the RTL expression for the value of a variable or function. If
1489 PROMOTED_MODE is defined, the mode of this expression may not be same
1490 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1491 to the variable's data type, while the mode
1492 of DECL_RTL is the mode actually used to contain the data.
1494 This value can be evaluated lazily for functions, variables with
1495 static storage duration, and labels. */
1496 #define DECL_RTL(NODE) \
1497 (DECL_CHECK (NODE)->decl.rtl \
1498 ? (NODE)->decl.rtl \
1499 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl))
1500 /* Set the DECL_RTL for NODE to RTL. */
1501 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
1502 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
1503 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL)
1504 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
1505 NODE1, it will not be set for NODE2; this is a lazy copy. */
1506 #define COPY_DECL_RTL(NODE1, NODE2) \
1507 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl)
1508 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
1509 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
1511 /* For PARM_DECL, holds an RTL for the stack slot or register
1512 where the data was actually passed. */
1513 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r)
1515 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1516 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f)
1518 /* For FUNCTION_DECL, if it is built-in,
1519 this identifies which built-in operation it is. */
1520 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f)
1522 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1523 Before the struct containing the FUNCTION_DECL is laid out,
1524 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1525 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1526 function. When the class is laid out, this pointer is changed
1527 to an INTEGER_CST node which is suitable for use as an index
1528 into the virtual function table. */
1529 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1531 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1532 which this FIELD_DECL is defined. This information is needed when
1533 writing debugging information about vfield and vbase decls for C++. */
1534 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex)
1536 /* Every ..._DECL node gets a unique number. */
1537 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1539 /* For any sort of a ..._DECL node, this points to the original (abstract)
1540 decl node which this decl is an instance of, or else it is NULL indicating
1541 that this decl is not an instance of some other decl. For example,
1542 in a nested declaration of an inline function, this points back to the
1543 definition. */
1544 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1546 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1547 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1548 #define DECL_ORIGIN(NODE) \
1549 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1551 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1552 inline instance of some original (abstract) decl from an inline function;
1553 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1554 nodes can also have their abstract origin set to themselves. */
1555 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1556 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1558 /* Nonzero if a _DECL means that the name of this decl should be ignored
1559 for symbolic debug purposes. */
1560 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1562 /* Nonzero for a given ..._DECL node means that this node represents an
1563 "abstract instance" of the given declaration (e.g. in the original
1564 declaration of an inline function). When generating symbolic debugging
1565 information, we mustn't try to generate any address information for nodes
1566 marked as "abstract instances" because we don't actually generate
1567 any code or allocate any data space for such instances. */
1568 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1570 /* Nonzero if a _DECL means that no warnings should be generated just
1571 because this decl is unused. */
1572 #define DECL_IN_SYSTEM_HEADER(NODE) \
1573 (DECL_CHECK (NODE)->decl.in_system_header_flag)
1575 /* Nonzero for a given ..._DECL node means that this node should be
1576 put in .common, if possible. If a DECL_INITIAL is given, and it
1577 is not error_mark_node, then the decl cannot be put in .common. */
1578 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1580 /* Language-specific decl information. */
1581 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1583 /* In a VAR_DECL or FUNCTION_DECL,
1584 nonzero means external reference:
1585 do not allocate storage, and refer to a definition elsewhere. */
1586 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1588 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1589 initializations. */
1590 #define DEFAULT_INIT_PRIORITY 65535
1591 #define MAX_INIT_PRIORITY 65535
1592 #define MAX_RESERVED_INIT_PRIORITY 100
1594 /* In a TYPE_DECL
1595 nonzero means the detail info about this type is not dumped into stabs.
1596 Instead it will generate cross reference ('x') of names.
1597 This uses the same flag as DECL_EXTERNAL. */
1598 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
1599 (TYPE_DECL_CHECK (NODE)->decl.external_flag)
1601 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1602 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1604 /* In LABEL_DECL nodes, nonzero means that an error message about
1605 jumping into such a binding contour has been printed for this label. */
1606 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag)
1608 /* In a FIELD_DECL, indicates this field should be bit-packed. */
1609 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag)
1611 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
1612 static chain is not needed. */
1613 #define DECL_NO_STATIC_CHAIN(NODE) \
1614 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag)
1616 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1617 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1619 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1621 Also set in some languages for variables, etc., outside the normal
1622 lexical scope, such as class instance variables. */
1623 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1625 /* Nonzero in a FUNCTION_DECL means this function can be substituted
1626 where it is called. */
1627 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag)
1629 /* Nonzero in a FUNCTION_DECL means this function has been found inlinable
1630 only by virtue of -finline-functions */
1631 #define DID_INLINE_FUNC(NODE) \
1632 (FUNCTION_DECL_CHECK (NODE)->decl.inlined_function_flag)
1634 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
1635 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable)
1637 /* In a VAR_DECL, nonzero if the data should be allocated from
1638 thread-local storage. */
1639 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag)
1641 /* In a FUNCTION_DECL, the saved representation of the body of the
1642 entire function. Usually a COMPOUND_STMT, but in C++ this may also
1643 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
1644 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree)
1646 /* List of FUNCTION_DECLs inlined into this function's body. */
1647 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns)
1649 /* Nonzero in a FUNCTION_DECL means this is a built-in function
1650 that is not specified by ansi C and that users are supposed to be allowed
1651 to redefine for any purpose whatever. */
1652 #define DECL_BUILT_IN_NONANSI(NODE) \
1653 (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag)
1655 /* Nonzero in a FUNCTION_DECL means this function should be treated
1656 as if it were a malloc, meaning it returns a pointer that is
1657 not an alias. */
1658 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag)
1660 /* Nonzero in a FUNCTION_DECL means this function should be treated
1661 as "pure" function (like const function, but may read global memory). */
1662 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag)
1664 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1665 specially. */
1666 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag)
1668 /* In a LABEL_DECL, nonzero means label was defined inside a binding
1669 contour that restored a stack level and which is now exited. */
1670 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag)
1672 /* Unused in FUNCTION_DECL. */
1674 /* In a VAR_DECL that's static,
1675 nonzero if the space is in the text section. */
1676 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag)
1678 /* In a FUNCTION_DECL, nonzero means a built in function. */
1679 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
1681 /* For a builtin function, identify which part of the compiler defined it. */
1682 #define DECL_BUILT_IN_CLASS(NODE) \
1683 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class)
1685 /* Used in VAR_DECLs to indicate that the variable is a vtable.
1686 Used in FIELD_DECLs for vtable pointers.
1687 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1688 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1690 /* Used to indicate that the linkage status of this DECL is not yet known,
1691 so it should not be output now. */
1692 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1694 /* Used in PARM_DECLs whose type are unions to indicate that the
1695 argument should be passed in the same way that the first union
1696 alternative would be passed. */
1697 #define DECL_TRANSPARENT_UNION(NODE) \
1698 (PARM_DECL_CHECK (NODE)->decl.transparent_union)
1700 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
1701 at the beginning or end of execution. */
1702 #define DECL_STATIC_CONSTRUCTOR(NODE) \
1703 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag)
1705 #define DECL_STATIC_DESTRUCTOR(NODE) \
1706 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag)
1708 /* Used to indicate that this DECL represents a compiler-generated entity. */
1709 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1711 /* Used to indicate that this DECL has weak linkage. */
1712 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1714 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1715 multiple translation units should be merged. */
1716 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1718 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1719 not be put out unless it is needed in this translation unit.
1720 Entities like this are shared across translation units (like weak
1721 entities), but are guaranteed to be generated by any translation
1722 unit that needs them, and therefore need not be put out anywhere
1723 where they are not needed. DECL_COMDAT is just a hint to the
1724 back-end; it is up to front-ends which set this flag to ensure
1725 that there will never be any harm, other than bloat, in putting out
1726 something which is DECL_COMDAT. */
1727 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1729 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
1730 be instrumented with calls to support routines. */
1731 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
1732 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit)
1734 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
1735 disabled in this function. */
1736 #define DECL_NO_LIMIT_STACK(NODE) \
1737 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack)
1739 /* Additional flags for language-specific uses. */
1740 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1741 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1742 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1743 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1744 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1745 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1746 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1747 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1749 /* Used to indicate that the pointer to this DECL cannot be treated as
1750 an address constant. */
1751 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1753 /* Used in a FIELD_DECL to indicate that we cannot form the address of
1754 this component. */
1755 #define DECL_NONADDRESSABLE_P(NODE) \
1756 (FIELD_DECL_CHECK (NODE)->decl.non_addressable)
1758 /* Used to indicate an alias set for the memory pointed to by this
1759 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1760 pointer (or reference) type. */
1761 #define DECL_POINTER_ALIAS_SET(NODE) \
1762 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1764 /* Nonzero if an alias set has been assigned to this declaration. */
1765 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1766 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1768 /* The pointer_depth field comprises two bits for values in the range
1769 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's
1770 type node, but for functions it migth be greater. For example,
1771 this can happen when the function is declared to accept a parameter
1772 of type void* (depth=1), but is actually called with an argument of
1773 type foo** (depth=2). The function type will get the formal
1774 parameter's depth, but the function decl will get the actual
1775 argument's depth. */
1776 #define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth)
1778 struct function;
1780 struct tree_decl GTY(())
1782 struct tree_common common;
1783 location_t locus;
1784 unsigned int uid;
1785 tree size;
1786 ENUM_BITFIELD(machine_mode) mode : 8;
1788 unsigned external_flag : 1;
1789 unsigned nonlocal_flag : 1;
1790 unsigned regdecl_flag : 1;
1791 unsigned inline_flag : 1;
1792 unsigned bit_field_flag : 1;
1793 unsigned virtual_flag : 1;
1794 unsigned ignored_flag : 1;
1795 unsigned abstract_flag : 1;
1797 unsigned in_system_header_flag : 1;
1798 unsigned common_flag : 1;
1799 unsigned defer_output : 1;
1800 unsigned transparent_union : 1;
1801 unsigned static_ctor_flag : 1;
1802 unsigned static_dtor_flag : 1;
1803 unsigned artificial_flag : 1;
1804 unsigned weak_flag : 1;
1806 unsigned non_addr_const_p : 1;
1807 unsigned no_instrument_function_entry_exit : 1;
1808 unsigned comdat_flag : 1;
1809 unsigned malloc_flag : 1;
1810 unsigned no_limit_stack : 1;
1811 ENUM_BITFIELD(built_in_class) built_in_class : 2;
1812 unsigned pure_flag : 1;
1814 unsigned pointer_depth : 2;
1815 unsigned non_addressable : 1;
1816 unsigned user_align : 1;
1817 unsigned uninlinable : 1;
1818 unsigned thread_local_flag : 1;
1819 unsigned inlined_function_flag : 1;
1820 /* One unused bit. */
1822 unsigned lang_flag_0 : 1;
1823 unsigned lang_flag_1 : 1;
1824 unsigned lang_flag_2 : 1;
1825 unsigned lang_flag_3 : 1;
1826 unsigned lang_flag_4 : 1;
1827 unsigned lang_flag_5 : 1;
1828 unsigned lang_flag_6 : 1;
1829 unsigned lang_flag_7 : 1;
1831 union tree_decl_u1 {
1832 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
1833 DECL_FUNCTION_CODE. */
1834 enum built_in_function f;
1835 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
1836 is used by language-dependent code. */
1837 HOST_WIDE_INT i;
1838 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
1839 FUNCTION_DECLs). */
1840 struct tree_decl_u1_a {
1841 unsigned int align : 24;
1842 unsigned int off_align : 8;
1843 } a;
1844 } GTY ((skip (""))) u1;
1846 tree size_unit;
1847 tree name;
1848 tree context;
1849 tree arguments; /* Also used for DECL_FIELD_OFFSET */
1850 tree result; /* Also used for DECL_BIT_FIELD_TYPE */
1851 tree initial; /* Also used for DECL_QUALIFIER */
1852 tree abstract_origin;
1853 tree assembler_name;
1854 tree section_name;
1855 tree attributes;
1856 rtx rtl; /* RTL representation for object. */
1858 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain.
1859 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET.
1860 In PARM_DECL, holds an RTL for the stack slot
1861 of register where the data was actually passed.
1862 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */
1863 union tree_decl_u2 {
1864 struct function * GTY ((tag ("FUNCTION_DECL"))) f;
1865 rtx GTY ((tag ("PARM_DECL"))) r;
1866 tree GTY ((tag ("FIELD_DECL"))) t;
1867 int GTY ((tag ("VAR_DECL"))) i;
1868 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2;
1870 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
1871 tree saved_tree;
1873 /* In a FUNCTION_DECL, these are function data which is to be kept
1874 as long as FUNCTION_DECL is kept. */
1875 tree inlined_fns;
1877 tree vindex;
1878 HOST_WIDE_INT pointer_alias_set;
1879 /* Points to a structure whose details depend on the language in use. */
1880 struct lang_decl *lang_specific;
1883 enum tree_node_structure_enum {
1884 TS_COMMON,
1885 TS_INT_CST,
1886 TS_REAL_CST,
1887 TS_VECTOR,
1888 TS_STRING,
1889 TS_COMPLEX,
1890 TS_IDENTIFIER,
1891 TS_DECL,
1892 TS_TYPE,
1893 TS_LIST,
1894 TS_VEC,
1895 TS_EXP,
1896 TS_BLOCK,
1897 LAST_TS_ENUM
1900 /* Define the overall contents of a tree node.
1901 It may be any of the structures declared above
1902 for various types of node. */
1904 union tree_node GTY ((ptr_alias (union lang_tree_node),
1905 desc ("tree_node_structure (&%h)")))
1907 struct tree_common GTY ((tag ("TS_COMMON"))) common;
1908 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
1909 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
1910 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
1911 struct tree_string GTY ((tag ("TS_STRING"))) string;
1912 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
1913 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
1914 struct tree_decl GTY ((tag ("TS_DECL"))) decl;
1915 struct tree_type GTY ((tag ("TS_TYPE"))) type;
1916 struct tree_list GTY ((tag ("TS_LIST"))) list;
1917 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
1918 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
1919 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
1922 /* Standard named or nameless data types of the C compiler. */
1924 enum tree_index
1926 TI_ERROR_MARK,
1927 TI_INTQI_TYPE,
1928 TI_INTHI_TYPE,
1929 TI_INTSI_TYPE,
1930 TI_INTDI_TYPE,
1931 TI_INTTI_TYPE,
1933 TI_UINTQI_TYPE,
1934 TI_UINTHI_TYPE,
1935 TI_UINTSI_TYPE,
1936 TI_UINTDI_TYPE,
1937 TI_UINTTI_TYPE,
1939 TI_INTEGER_ZERO,
1940 TI_INTEGER_ONE,
1941 TI_INTEGER_MINUS_ONE,
1942 TI_NULL_POINTER,
1944 TI_SIZE_ZERO,
1945 TI_SIZE_ONE,
1947 TI_BITSIZE_ZERO,
1948 TI_BITSIZE_ONE,
1949 TI_BITSIZE_UNIT,
1951 TI_COMPLEX_INTEGER_TYPE,
1952 TI_COMPLEX_FLOAT_TYPE,
1953 TI_COMPLEX_DOUBLE_TYPE,
1954 TI_COMPLEX_LONG_DOUBLE_TYPE,
1956 TI_FLOAT_TYPE,
1957 TI_DOUBLE_TYPE,
1958 TI_LONG_DOUBLE_TYPE,
1960 TI_VOID_TYPE,
1961 TI_PTR_TYPE,
1962 TI_CONST_PTR_TYPE,
1963 TI_SIZE_TYPE,
1964 TI_PTRDIFF_TYPE,
1965 TI_VA_LIST_TYPE,
1967 TI_VOID_LIST_NODE,
1969 TI_UV4SF_TYPE,
1970 TI_UV4SI_TYPE,
1971 TI_UV8HI_TYPE,
1972 TI_UV8QI_TYPE,
1973 TI_UV4HI_TYPE,
1974 TI_UV2HI_TYPE,
1975 TI_UV2SI_TYPE,
1976 TI_UV2SF_TYPE,
1977 TI_UV2DI_TYPE,
1978 TI_UV1DI_TYPE,
1979 TI_UV16QI_TYPE,
1981 TI_V4SF_TYPE,
1982 TI_V16SF_TYPE,
1983 TI_V4SI_TYPE,
1984 TI_V8HI_TYPE,
1985 TI_V8QI_TYPE,
1986 TI_V4HI_TYPE,
1987 TI_V2HI_TYPE,
1988 TI_V2SI_TYPE,
1989 TI_V2SF_TYPE,
1990 TI_V2DF_TYPE,
1991 TI_V2DI_TYPE,
1992 TI_V1DI_TYPE,
1993 TI_V16QI_TYPE,
1995 TI_MAIN_IDENTIFIER,
1997 TI_MAX
2000 extern GTY(()) tree global_trees[TI_MAX];
2002 #define error_mark_node global_trees[TI_ERROR_MARK]
2004 #define intQI_type_node global_trees[TI_INTQI_TYPE]
2005 #define intHI_type_node global_trees[TI_INTHI_TYPE]
2006 #define intSI_type_node global_trees[TI_INTSI_TYPE]
2007 #define intDI_type_node global_trees[TI_INTDI_TYPE]
2008 #define intTI_type_node global_trees[TI_INTTI_TYPE]
2010 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
2011 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
2012 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
2013 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
2014 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
2016 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
2017 #define integer_one_node global_trees[TI_INTEGER_ONE]
2018 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
2019 #define size_zero_node global_trees[TI_SIZE_ZERO]
2020 #define size_one_node global_trees[TI_SIZE_ONE]
2021 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
2022 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
2023 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
2025 /* Base access nodes. */
2026 #define access_public_node NULL_TREE
2027 #define access_protected_node size_zero_node
2028 #define access_private_node size_one_node
2030 #define null_pointer_node global_trees[TI_NULL_POINTER]
2032 #define float_type_node global_trees[TI_FLOAT_TYPE]
2033 #define double_type_node global_trees[TI_DOUBLE_TYPE]
2034 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
2036 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
2037 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
2038 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
2039 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
2041 #define void_type_node global_trees[TI_VOID_TYPE]
2042 /* The C type `void *'. */
2043 #define ptr_type_node global_trees[TI_PTR_TYPE]
2044 /* The C type `const void *'. */
2045 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
2046 /* The C type `size_t'. */
2047 #define size_type_node global_trees[TI_SIZE_TYPE]
2048 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
2049 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
2051 /* The node that should be placed at the end of a parameter list to
2052 indicate that the function does not take a variable number of
2053 arguments. The TREE_VALUE will be void_type_node and there will be
2054 no TREE_CHAIN. Language-independent code should not assume
2055 anything else about this node. */
2056 #define void_list_node global_trees[TI_VOID_LIST_NODE]
2058 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
2059 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
2061 #define unsigned_V16QI_type_node global_trees[TI_UV16QI_TYPE]
2062 #define unsigned_V4SI_type_node global_trees[TI_UV4SI_TYPE]
2063 #define unsigned_V8QI_type_node global_trees[TI_UV8QI_TYPE]
2064 #define unsigned_V8HI_type_node global_trees[TI_UV8HI_TYPE]
2065 #define unsigned_V4HI_type_node global_trees[TI_UV4HI_TYPE]
2066 #define unsigned_V2HI_type_node global_trees[TI_UV2HI_TYPE]
2067 #define unsigned_V2SI_type_node global_trees[TI_UV2SI_TYPE]
2068 #define unsigned_V2DI_type_node global_trees[TI_UV2DI_TYPE]
2069 #define unsigned_V1DI_type_node global_trees[TI_UV1DI_TYPE]
2071 #define V16QI_type_node global_trees[TI_V16QI_TYPE]
2072 #define V4SF_type_node global_trees[TI_V4SF_TYPE]
2073 #define V4SI_type_node global_trees[TI_V4SI_TYPE]
2074 #define V8QI_type_node global_trees[TI_V8QI_TYPE]
2075 #define V8HI_type_node global_trees[TI_V8HI_TYPE]
2076 #define V4HI_type_node global_trees[TI_V4HI_TYPE]
2077 #define V2HI_type_node global_trees[TI_V2HI_TYPE]
2078 #define V2SI_type_node global_trees[TI_V2SI_TYPE]
2079 #define V2SF_type_node global_trees[TI_V2SF_TYPE]
2080 #define V2DI_type_node global_trees[TI_V2DI_TYPE]
2081 #define V2DF_type_node global_trees[TI_V2DF_TYPE]
2082 #define V16SF_type_node global_trees[TI_V16SF_TYPE]
2083 #define V1DI_type_node global_trees[TI_V1DI_TYPE]
2085 /* An enumeration of the standard C integer types. These must be
2086 ordered so that shorter types appear before longer ones, and so
2087 that signed types appear before unsigned ones, for the correct
2088 functioning of interpret_integer() in c-lex.c. */
2089 enum integer_type_kind
2091 itk_char,
2092 itk_signed_char,
2093 itk_unsigned_char,
2094 itk_short,
2095 itk_unsigned_short,
2096 itk_int,
2097 itk_unsigned_int,
2098 itk_long,
2099 itk_unsigned_long,
2100 itk_long_long,
2101 itk_unsigned_long_long,
2102 itk_none
2105 typedef enum integer_type_kind integer_type_kind;
2107 /* The standard C integer types. Use integer_type_kind to index into
2108 this array. */
2109 extern GTY(()) tree integer_types[itk_none];
2111 #define char_type_node integer_types[itk_char]
2112 #define signed_char_type_node integer_types[itk_signed_char]
2113 #define unsigned_char_type_node integer_types[itk_unsigned_char]
2114 #define short_integer_type_node integer_types[itk_short]
2115 #define short_unsigned_type_node integer_types[itk_unsigned_short]
2116 #define integer_type_node integer_types[itk_int]
2117 #define unsigned_type_node integer_types[itk_unsigned_int]
2118 #define long_integer_type_node integer_types[itk_long]
2119 #define long_unsigned_type_node integer_types[itk_unsigned_long]
2120 #define long_long_integer_type_node integer_types[itk_long_long]
2121 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
2123 /* Set to the default thread-local storage (tls) model to use. */
2125 enum tls_model {
2126 TLS_MODEL_GLOBAL_DYNAMIC = 1,
2127 TLS_MODEL_LOCAL_DYNAMIC,
2128 TLS_MODEL_INITIAL_EXEC,
2129 TLS_MODEL_LOCAL_EXEC
2132 extern enum tls_model flag_tls_default;
2134 /* Enumerate visibility settings. */
2136 enum symbol_visibility
2138 VISIBILITY_DEFAULT,
2139 VISIBILITY_INTERNAL,
2140 VISIBILITY_HIDDEN,
2141 VISIBILITY_PROTECTED
2144 /* A pointer-to-function member type looks like:
2146 struct {
2147 __P __pfn;
2148 ptrdiff_t __delta;
2151 If __pfn is NULL, it is a NULL pointer-to-member-function.
2153 (Because the vtable is always the first thing in the object, we
2154 don't need its offset.) If the function is virtual, then PFN is
2155 one plus twice the index into the vtable; otherwise, it is just a
2156 pointer to the function.
2158 Unfortunately, using the lowest bit of PFN doesn't work in
2159 architectures that don't impose alignment requirements on function
2160 addresses, or that use the lowest bit to tell one ISA from another,
2161 for example. For such architectures, we use the lowest bit of
2162 DELTA instead of the lowest bit of the PFN, and DELTA will be
2163 multiplied by 2. */
2165 enum ptrmemfunc_vbit_where_t
2167 ptrmemfunc_vbit_in_pfn,
2168 ptrmemfunc_vbit_in_delta
2171 #define NULL_TREE (tree) NULL
2173 /* Approximate positive square root of a host double. This is for
2174 statistical reports, not code generation. */
2175 extern double approx_sqrt PARAMS ((double));
2177 extern tree decl_assembler_name PARAMS ((tree));
2179 /* Compute the number of bytes occupied by 'node'. This routine only
2180 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
2182 extern size_t tree_size PARAMS ((tree));
2184 /* Lowest level primitive for allocating a node.
2185 The TREE_CODE is the only argument. Contents are initialized
2186 to zero except for a few of the common fields. */
2188 extern tree make_node PARAMS ((enum tree_code));
2190 /* Make a copy of a node, with all the same contents. */
2192 extern tree copy_node PARAMS ((tree));
2194 /* Make a copy of a chain of TREE_LIST nodes. */
2196 extern tree copy_list PARAMS ((tree));
2198 /* Make a TREE_VEC. */
2200 extern tree make_tree_vec PARAMS ((int));
2202 /* Return the (unique) IDENTIFIER_NODE node for a given name.
2203 The name is supplied as a char *. */
2205 extern tree get_identifier PARAMS ((const char *));
2207 /* Identical to get_identifier, except that the length is assumed
2208 known. */
2210 extern tree get_identifier_with_length PARAMS ((const char *, unsigned int));
2212 /* If an identifier with the name TEXT (a null-terminated string) has
2213 previously been referred to, return that node; otherwise return
2214 NULL_TREE. */
2216 extern tree maybe_get_identifier PARAMS ((const char *));
2218 /* Construct various types of nodes. */
2220 #define build_int_2(LO, HI) \
2221 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
2223 extern tree build PARAMS ((enum tree_code, tree, ...));
2224 extern tree build_nt PARAMS ((enum tree_code, ...));
2226 extern tree build_int_2_wide PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT));
2227 extern tree build_vector PARAMS ((tree, tree));
2228 extern tree build_real_from_int_cst PARAMS ((tree, tree));
2229 extern tree build_complex PARAMS ((tree, tree, tree));
2230 extern tree build_string PARAMS ((int, const char *));
2231 extern tree build1 PARAMS ((enum tree_code, tree, tree));
2232 extern tree build_tree_list PARAMS ((tree, tree));
2233 extern tree build_decl PARAMS ((enum tree_code, tree, tree));
2234 extern tree build_block PARAMS ((tree, tree, tree, tree, tree));
2235 extern tree build_expr_wfl PARAMS ((tree, const char *, int, int));
2237 /* Construct various nodes representing data types. */
2239 extern tree make_signed_type PARAMS ((int));
2240 extern tree make_unsigned_type PARAMS ((int));
2241 extern void initialize_sizetypes PARAMS ((void));
2242 extern void set_sizetype PARAMS ((tree));
2243 extern void fixup_unsigned_type PARAMS ((tree));
2244 extern tree build_pointer_type_for_mode PARAMS ((tree, enum machine_mode));
2245 extern tree build_pointer_type PARAMS ((tree));
2246 extern tree build_reference_type_for_mode PARAMS ((tree, enum machine_mode));
2247 extern tree build_reference_type PARAMS ((tree));
2248 extern tree build_type_no_quals PARAMS ((tree));
2249 extern tree build_index_type PARAMS ((tree));
2250 extern tree build_index_2_type PARAMS ((tree, tree));
2251 extern tree build_array_type PARAMS ((tree, tree));
2252 extern tree build_function_type PARAMS ((tree, tree));
2253 extern tree build_function_type_list PARAMS ((tree, ...));
2254 extern tree build_method_type PARAMS ((tree, tree));
2255 extern tree build_offset_type PARAMS ((tree, tree));
2256 extern tree build_complex_type PARAMS ((tree));
2257 extern tree array_type_nelts PARAMS ((tree));
2259 extern tree value_member PARAMS ((tree, tree));
2260 extern tree purpose_member PARAMS ((tree, tree));
2261 extern tree binfo_member PARAMS ((tree, tree));
2262 extern unsigned int attribute_hash_list PARAMS ((tree));
2263 extern int attribute_list_equal PARAMS ((tree, tree));
2264 extern int attribute_list_contained PARAMS ((tree, tree));
2265 extern int tree_int_cst_equal PARAMS ((tree, tree));
2266 extern int tree_int_cst_lt PARAMS ((tree, tree));
2267 extern int tree_int_cst_compare PARAMS ((tree, tree));
2268 extern int host_integerp PARAMS ((tree, int));
2269 extern HOST_WIDE_INT tree_low_cst PARAMS ((tree, int));
2270 extern int tree_int_cst_sgn PARAMS ((tree));
2271 extern int tree_expr_nonnegative_p PARAMS ((tree));
2272 extern int rtl_expr_nonnegative_p PARAMS ((rtx));
2273 extern tree get_inner_array_type PARAMS ((tree));
2275 /* From expmed.c. Since rtl.h is included after tree.h, we can't
2276 put the prototype here. Rtl.h does declare the prototype if
2277 tree.h had been included. */
2279 extern tree make_tree PARAMS ((tree, rtx));
2281 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
2282 is ATTRIBUTE.
2284 Such modified types already made are recorded so that duplicates
2285 are not made. */
2287 extern tree build_type_attribute_variant PARAMS ((tree, tree));
2288 extern tree build_decl_attribute_variant PARAMS ((tree, tree));
2290 /* Structure describing an attribute and a function to handle it. */
2291 struct attribute_spec
2293 /* The name of the attribute (without any leading or trailing __),
2294 or NULL to mark the end of a table of attributes. */
2295 const char *const name;
2296 /* The minimum length of the list of arguments of the attribute. */
2297 const int min_length;
2298 /* The maximum length of the list of arguments of the attribute
2299 (-1 for no maximum). */
2300 const int max_length;
2301 /* Whether this attribute requires a DECL. If it does, it will be passed
2302 from types of DECLs, function return types and array element types to
2303 the DECLs, function types and array types respectively; but when
2304 applied to a type in any other circumstances, it will be ignored with
2305 a warning. (If greater control is desired for a given attribute,
2306 this should be false, and the flags argument to the handler may be
2307 used to gain greater control in that case.) */
2308 const bool decl_required;
2309 /* Whether this attribute requires a type. If it does, it will be passed
2310 from a DECL to the type of that DECL. */
2311 const bool type_required;
2312 /* Whether this attribute requires a function (or method) type. If it does,
2313 it will be passed from a function pointer type to the target type,
2314 and from a function return type (which is not itself a function
2315 pointer type) to the function type. */
2316 const bool function_type_required;
2317 /* Function to handle this attribute. NODE points to the node to which
2318 the attribute is to be applied. If a DECL, it should be modified in
2319 place; if a TYPE, a copy should be created. NAME is the name of the
2320 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
2321 of the arguments (which may be NULL). FLAGS gives further information
2322 about the context of the attribute. Afterwards, the attributes will
2323 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
2324 unless *NO_ADD_ATTRS is set to true (which should be done on error,
2325 as well as in any other cases when the attributes should not be added
2326 to the DECL or TYPE). Depending on FLAGS, any attributes to be
2327 applied to another type or DECL later may be returned;
2328 otherwise the return value should be NULL_TREE. This pointer may be
2329 NULL if no special handling is required beyond the checks implied
2330 by the rest of this structure. */
2331 tree (*const handler) PARAMS ((tree *node, tree name, tree args,
2332 int flags, bool *no_add_attrs));
2335 /* Flags that may be passed in the third argument of decl_attributes, and
2336 to handler functions for attributes. */
2337 enum attribute_flags
2339 /* The type passed in is the type of a DECL, and any attributes that
2340 should be passed in again to be applied to the DECL rather than the
2341 type should be returned. */
2342 ATTR_FLAG_DECL_NEXT = 1,
2343 /* The type passed in is a function return type, and any attributes that
2344 should be passed in again to be applied to the function type rather
2345 than the return type should be returned. */
2346 ATTR_FLAG_FUNCTION_NEXT = 2,
2347 /* The type passed in is an array element type, and any attributes that
2348 should be passed in again to be applied to the array type rather
2349 than the element type should be returned. */
2350 ATTR_FLAG_ARRAY_NEXT = 4,
2351 /* The type passed in is a structure, union or enumeration type being
2352 created, and should be modified in place. */
2353 ATTR_FLAG_TYPE_IN_PLACE = 8,
2354 /* The attributes are being applied by default to a library function whose
2355 name indicates known behavior, and should be silently ignored if they
2356 are not in fact compatible with the function type. */
2357 ATTR_FLAG_BUILT_IN = 16
2360 /* Default versions of target-overridable functions. */
2362 extern tree merge_decl_attributes PARAMS ((tree, tree));
2363 extern tree merge_type_attributes PARAMS ((tree, tree));
2364 extern void default_register_cpp_builtins PARAMS ((struct cpp_reader *));
2366 /* Split a list of declspecs and attributes into two. */
2368 extern void split_specs_attrs PARAMS ((tree, tree *, tree *));
2370 /* Strip attributes from a list of combined specs and attrs. */
2372 extern tree strip_attrs PARAMS ((tree));
2374 /* Return 1 if an attribute and its arguments are valid for a decl or type. */
2376 extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree));
2378 /* Given a tree node and a string, return nonzero if the tree node is
2379 a valid attribute name for the string. */
2381 extern int is_attribute_p PARAMS ((const char *, tree));
2383 /* Given an attribute name and a list of attributes, return the list element
2384 of the attribute or NULL_TREE if not found. */
2386 extern tree lookup_attribute PARAMS ((const char *, tree));
2388 /* Given two attributes lists, return a list of their union. */
2390 extern tree merge_attributes PARAMS ((tree, tree));
2392 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2393 /* Given two Windows decl attributes lists, possibly including
2394 dllimport, return a list of their union . */
2395 extern tree merge_dllimport_decl_attributes PARAMS ((tree, tree));
2396 #endif
2398 /* Return a version of the TYPE, qualified as indicated by the
2399 TYPE_QUALS, if one exists. If no qualified version exists yet,
2400 return NULL_TREE. */
2402 extern tree get_qualified_type PARAMS ((tree, int));
2404 /* Like get_qualified_type, but creates the type if it does not
2405 exist. This function never returns NULL_TREE. */
2407 extern tree build_qualified_type PARAMS ((tree, int));
2409 /* Like build_qualified_type, but only deals with the `const' and
2410 `volatile' qualifiers. This interface is retained for backwards
2411 compatibility with the various front-ends; new code should use
2412 build_qualified_type instead. */
2414 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
2415 build_qualified_type ((TYPE), \
2416 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
2417 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
2419 /* Make a copy of a type node. */
2421 extern tree build_type_copy PARAMS ((tree));
2423 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
2424 fields. Optionally specify an alignment, and then lsy it out. */
2426 extern void finish_builtin_struct PARAMS ((tree, const char *,
2427 tree, tree));
2429 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
2430 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
2431 node, does nothing except for the first time. */
2433 extern void layout_type PARAMS ((tree));
2435 /* These functions allow a front-end to perform a manual layout of a
2436 RECORD_TYPE. (For instance, if the placement of subsequent fields
2437 depends on the placement of fields so far.) Begin by calling
2438 start_record_layout. Then, call place_field for each of the
2439 fields. Then, call finish_record_layout. See layout_type for the
2440 default way in which these functions are used. */
2442 typedef struct record_layout_info_s
2444 /* The RECORD_TYPE that we are laying out. */
2445 tree t;
2446 /* The offset into the record so far, in bytes, not including bits in
2447 BITPOS. */
2448 tree offset;
2449 /* The last known alignment of SIZE. */
2450 unsigned int offset_align;
2451 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
2452 tree bitpos;
2453 /* The alignment of the record so far, in bits. */
2454 unsigned int record_align;
2455 /* The alignment of the record so far, not including padding, in bits. */
2456 unsigned int unpacked_align;
2457 /* The alignment of the record so far, allowing for the record to be
2458 padded only at the end, in bits. */
2459 unsigned int unpadded_align;
2460 /* The previous field layed out. */
2461 tree prev_field;
2462 /* The static variables (i.e., class variables, as opposed to
2463 instance variables) encountered in T. */
2464 tree pending_statics;
2465 /* Bits remaining in the current alignment group */
2466 int remaining_in_alignment;
2467 int packed_maybe_necessary;
2468 } *record_layout_info;
2470 extern void set_lang_adjust_rli PARAMS ((void (*) PARAMS
2471 ((record_layout_info))));
2472 extern record_layout_info start_record_layout PARAMS ((tree));
2473 extern tree bit_from_pos PARAMS ((tree, tree));
2474 extern tree byte_from_pos PARAMS ((tree, tree));
2475 extern void pos_from_bit PARAMS ((tree *, tree *, unsigned int,
2476 tree));
2477 extern void normalize_offset PARAMS ((tree *, tree *,
2478 unsigned int));
2479 extern tree rli_size_unit_so_far PARAMS ((record_layout_info));
2480 extern tree rli_size_so_far PARAMS ((record_layout_info));
2481 extern void normalize_rli PARAMS ((record_layout_info));
2482 extern void place_field PARAMS ((record_layout_info, tree));
2483 extern void compute_record_mode PARAMS ((tree));
2484 extern void finish_record_layout PARAMS ((record_layout_info, int));
2486 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
2487 return a canonicalized ..._TYPE node, so that duplicates are not made.
2488 How the hash code is computed is up to the caller, as long as any two
2489 callers that could hash identical-looking type nodes agree. */
2491 extern tree type_hash_canon PARAMS ((unsigned int, tree));
2493 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
2494 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
2495 fields. Call this only once for any given decl node.
2497 Second argument is the boundary that this field can be assumed to
2498 be starting at (in bits). Zero means it can be assumed aligned
2499 on any boundary that may be needed. */
2501 extern void layout_decl PARAMS ((tree, unsigned));
2503 /* Return the mode for data of a given size SIZE and mode class CLASS.
2504 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
2505 The value is BLKmode if no other mode is found. This is like
2506 mode_for_size, but is passed a tree. */
2508 extern enum machine_mode mode_for_size_tree PARAMS ((tree, enum mode_class,
2509 int));
2511 /* Return an expr equal to X but certainly not valid as an lvalue. */
2513 extern tree non_lvalue PARAMS ((tree));
2514 extern tree pedantic_non_lvalue PARAMS ((tree));
2516 extern tree convert PARAMS ((tree, tree));
2517 extern unsigned int expr_align PARAMS ((tree));
2518 extern tree size_in_bytes PARAMS ((tree));
2519 extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree));
2520 extern tree bit_position PARAMS ((tree));
2521 extern HOST_WIDE_INT int_bit_position PARAMS ((tree));
2522 extern tree byte_position PARAMS ((tree));
2523 extern HOST_WIDE_INT int_byte_position PARAMS ((tree));
2525 /* Define data structures, macros, and functions for handling sizes
2526 and the various types used to represent sizes. */
2528 enum size_type_kind
2530 SIZETYPE, /* Normal representation of sizes in bytes. */
2531 SSIZETYPE, /* Signed representation of sizes in bytes. */
2532 USIZETYPE, /* Unsigned representation of sizes in bytes. */
2533 BITSIZETYPE, /* Normal representation of sizes in bits. */
2534 SBITSIZETYPE, /* Signed representation of sizes in bits. */
2535 UBITSIZETYPE, /* Unsifgned representation of sizes in bits. */
2536 TYPE_KIND_LAST};
2538 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
2540 #define sizetype sizetype_tab[(int) SIZETYPE]
2541 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
2542 #define ssizetype sizetype_tab[(int) SSIZETYPE]
2543 #define usizetype sizetype_tab[(int) USIZETYPE]
2544 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
2545 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE]
2547 extern tree size_binop PARAMS ((enum tree_code, tree, tree));
2548 extern tree size_diffop PARAMS ((tree, tree));
2549 extern tree size_int_wide PARAMS ((HOST_WIDE_INT,
2550 enum size_type_kind));
2551 extern tree size_int_type_wide PARAMS ((HOST_WIDE_INT, tree));
2553 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T)
2554 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE)
2555 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE)
2556 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE)
2557 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE)
2559 extern tree round_up PARAMS ((tree, int));
2560 extern tree round_down PARAMS ((tree, int));
2561 extern tree get_pending_sizes PARAMS ((void));
2562 extern int is_pending_size PARAMS ((tree));
2563 extern void put_pending_size PARAMS ((tree));
2564 extern void put_pending_sizes PARAMS ((tree));
2566 /* Type for sizes of data-type. */
2568 #define BITS_PER_UNIT_LOG \
2569 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
2570 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
2571 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
2573 /* If nonzero, an upper limit on alignment of structure fields, in bits. */
2574 extern unsigned int maximum_field_alignment;
2576 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */
2577 extern unsigned int set_alignment;
2579 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
2580 by making the last node in X point to Y.
2581 Returns X, except if X is 0 returns Y. */
2583 extern tree chainon PARAMS ((tree, tree));
2585 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
2587 extern tree tree_cons PARAMS ((tree, tree, tree));
2589 /* Return the last tree node in a chain. */
2591 extern tree tree_last PARAMS ((tree));
2593 /* Reverse the order of elements in a chain, and return the new head. */
2595 extern tree nreverse PARAMS ((tree));
2597 /* Returns the length of a chain of nodes
2598 (number of chain pointers to follow before reaching a null pointer). */
2600 extern int list_length PARAMS ((tree));
2602 /* Returns the number of FIELD_DECLs in a type. */
2604 extern int fields_length PARAMS ((tree));
2606 /* Given an initializer INIT, return TRUE if INIT is zero or some
2607 aggregate of zeros. Otherwise return FALSE. */
2609 extern bool initializer_zerop PARAMS ((tree));
2611 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
2613 extern int integer_zerop PARAMS ((tree));
2615 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
2617 extern int integer_onep PARAMS ((tree));
2619 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
2620 all of whose significant bits are 1. */
2622 extern int integer_all_onesp PARAMS ((tree));
2624 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
2625 exactly one bit 1. */
2627 extern int integer_pow2p PARAMS ((tree));
2629 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
2630 with a nonzero value. */
2632 extern int integer_nonzerop PARAMS ((tree));
2634 /* staticp (tree x) is nonzero if X is a reference to data allocated
2635 at a fixed address in memory. */
2637 extern int staticp PARAMS ((tree));
2639 /* Gets an error if argument X is not an lvalue.
2640 Also returns 1 if X is an lvalue, 0 if not. */
2642 extern int lvalue_or_else PARAMS ((tree, const char *));
2644 /* save_expr (EXP) returns an expression equivalent to EXP
2645 but it can be used multiple times within context CTX
2646 and only evaluate EXP once. */
2648 extern tree save_expr PARAMS ((tree));
2650 /* Returns the index of the first non-tree operand for CODE, or the number
2651 of operands if all are trees. */
2653 extern int first_rtl_op PARAMS ((enum tree_code));
2655 /* Return which tree structure is used by T. */
2657 enum tree_node_structure_enum tree_node_structure PARAMS ((tree));
2659 /* unsave_expr (EXP) returns an expression equivalent to EXP but it
2660 can be used multiple times and will evaluate EXP in its entirety
2661 each time. */
2663 extern tree unsave_expr PARAMS ((tree));
2665 /* Reset EXP in place so that it can be expanded again. Does not
2666 recurse into subtrees. */
2668 extern void unsave_expr_1 PARAMS ((tree));
2670 /* Return 0 if it is safe to evaluate EXPR multiple times,
2671 return 1 if it is safe if EXPR is unsaved afterward, or
2672 return 2 if it is completely unsafe. */
2673 extern int unsafe_for_reeval PARAMS ((tree));
2675 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2676 or offset that depends on a field within a record.
2678 Note that we only allow such expressions within simple arithmetic
2679 or a COND_EXPR. */
2681 extern int contains_placeholder_p PARAMS ((tree));
2683 /* Return 1 if EXP contains any expressions that produce cleanups for an
2684 outer scope to deal with. Used by fold. */
2686 extern int has_cleanups PARAMS ((tree));
2688 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2689 return a tree with all occurrences of references to F in a
2690 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2691 contains only arithmetic expressions. */
2693 extern tree substitute_in_expr PARAMS ((tree, tree, tree));
2695 /* variable_size (EXP) is like save_expr (EXP) except that it
2696 is for the special case of something that is part of a
2697 variable size for a data type. It makes special arrangements
2698 to compute the value at the right time when the data type
2699 belongs to a function parameter. */
2701 extern tree variable_size PARAMS ((tree));
2703 /* stabilize_reference (EXP) returns an reference equivalent to EXP
2704 but it can be used multiple times
2705 and only evaluate the subexpressions once. */
2707 extern tree stabilize_reference PARAMS ((tree));
2709 /* Subroutine of stabilize_reference; this is called for subtrees of
2710 references. Any expression with side-effects must be put in a SAVE_EXPR
2711 to ensure that it is only evaluated once. */
2713 extern tree stabilize_reference_1 PARAMS ((tree));
2715 /* Return EXP, stripped of any conversions to wider types
2716 in such a way that the result of converting to type FOR_TYPE
2717 is the same as if EXP were converted to FOR_TYPE.
2718 If FOR_TYPE is 0, it signifies EXP's type. */
2720 extern tree get_unwidened PARAMS ((tree, tree));
2722 /* Return OP or a simpler expression for a narrower value
2723 which can be sign-extended or zero-extended to give back OP.
2724 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
2725 or 0 if the value should be sign-extended. */
2727 extern tree get_narrower PARAMS ((tree, int *));
2729 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
2730 look for nested component-refs or array-refs at constant positions
2731 and find the ultimate containing object, which is returned. */
2733 extern tree get_inner_reference PARAMS ((tree, HOST_WIDE_INT *,
2734 HOST_WIDE_INT *, tree *,
2735 enum machine_mode *, int *,
2736 int *));
2738 /* Return 1 if T is an expression that get_inner_reference handles. */
2740 extern int handled_component_p PARAMS ((tree));
2742 /* Given a DECL or TYPE, return the scope in which it was declared, or
2743 NUL_TREE if there is no containing scope. */
2745 extern tree get_containing_scope PARAMS ((tree));
2747 /* Return the FUNCTION_DECL which provides this _DECL with its context,
2748 or zero if none. */
2749 extern tree decl_function_context PARAMS ((tree));
2751 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
2752 this _DECL with its context, or zero if none. */
2753 extern tree decl_type_context PARAMS ((tree));
2755 /* Given the FUNCTION_DECL for the current function,
2756 return zero if it is ok for this function to be inline.
2757 Otherwise return a warning message with a single %s
2758 for the function's name. */
2760 extern const char *function_cannot_inline_p PARAMS ((tree));
2762 /* Return 1 if EXPR is the real constant zero. */
2763 extern int real_zerop PARAMS ((tree));
2765 /* Declare commonly used variables for tree structure. */
2767 /* Points to the name of the input file from which the current input
2768 being parsed originally came (before it went into cpp). */
2769 extern const char *input_filename;
2771 /* Current line number in input file. */
2772 extern int lineno;
2774 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2775 Zero means allow extended lvalues. */
2777 extern int pedantic_lvalues;
2779 /* Nonzero means can safely call expand_expr now;
2780 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
2782 extern int immediate_size_expand;
2784 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
2786 extern GTY(()) tree current_function_decl;
2788 /* Nonzero means a FUNC_BEGIN label was emitted. */
2789 extern GTY(()) tree current_function_func_begin_label;
2791 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
2793 extern int all_types_permanent;
2795 /* Declare a predefined function. Return the declaration. This function is
2796 provided by each language frontend. */
2797 extern tree builtin_function PARAMS ((const char *, tree, int,
2798 enum built_in_class,
2799 const char *, tree));
2801 /* In tree.c */
2802 extern void clean_symbol_name PARAMS ((char *));
2803 extern tree get_file_function_name_long PARAMS ((const char *));
2804 extern tree get_set_constructor_bits PARAMS ((tree, char *, int));
2805 extern tree get_set_constructor_bytes PARAMS ((tree,
2806 unsigned char *, int));
2807 extern tree get_callee_fndecl PARAMS ((tree));
2808 extern void set_decl_assembler_name PARAMS ((tree));
2809 extern int type_num_arguments PARAMS ((tree));
2810 extern tree lhd_unsave_expr_now PARAMS ((tree));
2813 /* In stmt.c */
2815 extern void expand_fixups PARAMS ((rtx));
2816 extern tree expand_start_stmt_expr PARAMS ((int));
2817 extern tree expand_end_stmt_expr PARAMS ((tree));
2818 extern void expand_expr_stmt PARAMS ((tree));
2819 extern void expand_expr_stmt_value PARAMS ((tree, int, int));
2820 extern int warn_if_unused_value PARAMS ((tree));
2821 extern void expand_decl_init PARAMS ((tree));
2822 extern void clear_last_expr PARAMS ((void));
2823 extern void expand_label PARAMS ((tree));
2824 extern void expand_goto PARAMS ((tree));
2825 extern void expand_asm PARAMS ((tree, int));
2826 extern void expand_start_cond PARAMS ((tree, int));
2827 extern void expand_end_cond PARAMS ((void));
2828 extern void expand_start_else PARAMS ((void));
2829 extern void expand_start_elseif PARAMS ((tree));
2830 extern struct nesting *expand_start_loop PARAMS ((int));
2831 extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int));
2832 extern struct nesting *expand_start_null_loop PARAMS ((void));
2833 extern void expand_loop_continue_here PARAMS ((void));
2834 extern void expand_end_loop PARAMS ((void));
2835 extern void expand_end_null_loop PARAMS ((void));
2836 extern int expand_continue_loop PARAMS ((struct nesting *));
2837 extern int expand_exit_loop PARAMS ((struct nesting *));
2838 extern int expand_exit_loop_if_false PARAMS ((struct nesting *,
2839 tree));
2840 extern int expand_exit_loop_top_cond PARAMS ((struct nesting *,
2841 tree));
2842 extern int expand_exit_something PARAMS ((void));
2844 extern void expand_return PARAMS ((tree));
2845 extern int optimize_tail_recursion PARAMS ((tree, rtx));
2846 extern void expand_start_bindings_and_block PARAMS ((int, tree));
2847 #define expand_start_bindings(flags) \
2848 expand_start_bindings_and_block(flags, NULL_TREE)
2849 extern void expand_end_bindings PARAMS ((tree, int, int));
2850 extern void warn_about_unused_variables PARAMS ((tree));
2851 extern void start_cleanup_deferral PARAMS ((void));
2852 extern void end_cleanup_deferral PARAMS ((void));
2853 extern int is_body_block PARAMS ((tree));
2855 extern int conditional_context PARAMS ((void));
2856 extern struct nesting * current_nesting_level PARAMS ((void));
2857 extern tree last_cleanup_this_contour PARAMS ((void));
2858 extern void expand_start_case PARAMS ((int, tree, tree,
2859 const char *));
2860 extern void expand_end_case_type PARAMS ((tree, tree));
2861 #define expand_end_case(cond) expand_end_case_type (cond, NULL)
2862 extern int add_case_node PARAMS ((tree, tree,
2863 tree, tree *));
2864 extern int pushcase PARAMS ((tree,
2865 tree (*) (tree, tree),
2866 tree, tree *));
2867 extern int pushcase_range PARAMS ((tree, tree,
2868 tree (*) (tree, tree),
2869 tree, tree *));
2870 extern void using_eh_for_cleanups PARAMS ((void));
2872 /* In fold-const.c */
2874 /* Fold constants as much as possible in an expression.
2875 Returns the simplified expression.
2876 Acts only on the top level of the expression;
2877 if the argument itself cannot be simplified, its
2878 subexpressions are not changed. */
2880 extern tree fold PARAMS ((tree));
2882 extern int force_fit_type PARAMS ((tree, int));
2883 extern int add_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2884 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2885 unsigned HOST_WIDE_INT *,
2886 HOST_WIDE_INT *));
2887 extern int neg_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2888 unsigned HOST_WIDE_INT *,
2889 HOST_WIDE_INT *));
2890 extern int mul_double PARAMS ((unsigned HOST_WIDE_INT,
2891 HOST_WIDE_INT,
2892 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2893 unsigned HOST_WIDE_INT *,
2894 HOST_WIDE_INT *));
2895 extern void lshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2896 HOST_WIDE_INT, unsigned int,
2897 unsigned HOST_WIDE_INT *,
2898 HOST_WIDE_INT *, int));
2899 extern void rshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2900 HOST_WIDE_INT, unsigned int,
2901 unsigned HOST_WIDE_INT *,
2902 HOST_WIDE_INT *, int));
2903 extern void lrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2904 HOST_WIDE_INT, unsigned int,
2905 unsigned HOST_WIDE_INT *,
2906 HOST_WIDE_INT *));
2907 extern void rrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT,
2908 HOST_WIDE_INT, unsigned int,
2909 unsigned HOST_WIDE_INT *,
2910 HOST_WIDE_INT *));
2912 extern int div_and_round_double PARAMS ((enum tree_code, int,
2913 unsigned HOST_WIDE_INT,
2914 HOST_WIDE_INT,
2915 unsigned HOST_WIDE_INT,
2916 HOST_WIDE_INT,
2917 unsigned HOST_WIDE_INT *,
2918 HOST_WIDE_INT *,
2919 unsigned HOST_WIDE_INT *,
2920 HOST_WIDE_INT *));
2922 extern int operand_equal_p PARAMS ((tree, tree, int));
2923 extern tree omit_one_operand PARAMS ((tree, tree, tree));
2924 extern tree invert_truthvalue PARAMS ((tree));
2926 /* In builtins.c */
2927 extern tree fold_builtin PARAMS ((tree));
2928 extern enum built_in_function builtin_mathfn_code PARAMS ((tree));
2929 extern tree build_function_call_expr PARAMS ((tree, tree));
2930 extern tree mathfn_built_in PARAMS ((tree, enum built_in_function fn));
2931 extern tree strip_float_extensions PARAMS ((tree));
2933 /* In convert.c */
2934 extern tree strip_float_extensions PARAMS ((tree));
2936 /* In alias.c */
2937 extern void record_component_aliases PARAMS ((tree));
2938 extern HOST_WIDE_INT get_alias_set PARAMS ((tree));
2939 extern int alias_sets_conflict_p PARAMS ((HOST_WIDE_INT,
2940 HOST_WIDE_INT));
2941 extern int readonly_fields_p PARAMS ((tree));
2942 extern int objects_must_conflict_p PARAMS ((tree, tree));
2944 struct obstack;
2946 /* In tree.c */
2947 extern int really_constant_p PARAMS ((tree));
2948 extern int int_fits_type_p PARAMS ((tree, tree));
2949 extern bool variably_modified_type_p PARAMS ((tree));
2950 extern int tree_log2 PARAMS ((tree));
2951 extern int tree_floor_log2 PARAMS ((tree));
2952 extern int simple_cst_equal PARAMS ((tree, tree));
2953 extern int compare_tree_int PARAMS ((tree,
2954 unsigned HOST_WIDE_INT));
2955 extern int type_list_equal PARAMS ((tree, tree));
2956 extern int chain_member PARAMS ((tree, tree));
2957 extern tree type_hash_lookup PARAMS ((unsigned int, tree));
2958 extern void type_hash_add PARAMS ((unsigned int, tree));
2959 extern unsigned int type_hash_list PARAMS ((tree));
2960 extern int simple_cst_list_equal PARAMS ((tree, tree));
2961 extern void dump_tree_statistics PARAMS ((void));
2962 extern void print_obstack_statistics PARAMS ((const char *,
2963 struct obstack *));
2964 #ifdef BUFSIZ
2965 extern void print_obstack_name PARAMS ((char *, FILE *,
2966 const char *));
2967 #endif
2968 extern void expand_function_end PARAMS ((const char *, int, int));
2969 extern void expand_function_start PARAMS ((tree, int));
2970 extern void expand_pending_sizes PARAMS ((tree));
2972 extern int real_onep PARAMS ((tree));
2973 extern int real_twop PARAMS ((tree));
2974 extern int real_minus_onep PARAMS ((tree));
2975 extern void gcc_obstack_init PARAMS ((struct obstack *));
2976 extern void init_ttree PARAMS ((void));
2977 extern void build_common_tree_nodes PARAMS ((int));
2978 extern void build_common_tree_nodes_2 PARAMS ((int));
2979 extern tree build_range_type PARAMS ((tree, tree, tree));
2981 /* In function.c */
2982 extern void setjmp_protect_args PARAMS ((void));
2983 extern void setjmp_protect PARAMS ((tree));
2984 extern void expand_main_function PARAMS ((void));
2985 extern void init_dummy_function_start PARAMS ((void));
2986 extern void expand_dummy_function_end PARAMS ((void));
2987 extern void init_function_for_compilation PARAMS ((void));
2988 extern void init_function_start PARAMS ((tree, const char *, int));
2989 extern void assign_parms PARAMS ((tree));
2990 extern void put_var_into_stack PARAMS ((tree));
2991 extern void flush_addressof PARAMS ((tree));
2992 extern void uninitialized_vars_warning PARAMS ((tree));
2993 extern void setjmp_args_warning PARAMS ((void));
2994 extern void mark_all_temps_used PARAMS ((void));
2995 extern void init_temp_slots PARAMS ((void));
2996 extern void combine_temp_slots PARAMS ((void));
2997 extern void free_temp_slots PARAMS ((void));
2998 extern void pop_temp_slots PARAMS ((void));
2999 extern void push_temp_slots PARAMS ((void));
3000 extern void preserve_temp_slots PARAMS ((rtx));
3001 extern void preserve_rtl_expr_temps PARAMS ((tree));
3002 extern int aggregate_value_p PARAMS ((tree));
3003 extern void free_temps_for_rtl_expr PARAMS ((tree));
3004 extern void instantiate_virtual_regs PARAMS ((tree, rtx));
3005 extern void unshare_all_rtl PARAMS ((tree, rtx));
3006 extern void push_function_context PARAMS ((void));
3007 extern void pop_function_context PARAMS ((void));
3008 extern void push_function_context_to PARAMS ((tree));
3009 extern void pop_function_context_from PARAMS ((tree));
3011 /* In print-rtl.c */
3012 #ifdef BUFSIZ
3013 extern void print_rtl PARAMS ((FILE *, rtx));
3014 #endif
3016 /* In print-tree.c */
3017 extern void debug_tree PARAMS ((tree));
3018 #ifdef BUFSIZ
3019 extern void print_node PARAMS ((FILE *, const char *, tree,
3020 int));
3021 extern void print_node_brief PARAMS ((FILE *, const char *, tree,
3022 int));
3023 extern void indent_to PARAMS ((FILE *, int));
3024 #endif
3026 /* In expr.c */
3027 extern int apply_args_register_offset PARAMS ((int));
3028 extern rtx expand_builtin_return_addr
3029 PARAMS ((enum built_in_function, int, rtx));
3030 extern void check_max_integer_computation_mode PARAMS ((tree));
3032 /* In emit-rtl.c */
3033 extern void start_sequence_for_rtl_expr PARAMS ((tree));
3034 extern rtx emit_line_note PARAMS ((const char *, int));
3036 /* In calls.c */
3038 extern int setjmp_call_p PARAMS ((tree));
3039 extern bool alloca_call_p PARAMS ((tree));
3041 /* In attribs.c. */
3043 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
3044 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
3045 it should be modified in place; if a TYPE, a copy should be created
3046 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
3047 information, in the form of a bitwise OR of flags in enum attribute_flags
3048 from tree.h. Depending on these flags, some attributes may be
3049 returned to be applied at a later stage (for example, to apply
3050 a decl attribute to the declaration rather than to its type). */
3051 extern tree decl_attributes PARAMS ((tree *, tree, int));
3053 /* In integrate.c */
3054 extern void save_for_inline PARAMS ((tree));
3055 extern void set_decl_abstract_flags PARAMS ((tree, int));
3056 extern void output_inline_function PARAMS ((tree));
3057 extern void set_decl_origin_self PARAMS ((tree));
3059 /* In stor-layout.c */
3060 extern void fixup_signed_type PARAMS ((tree));
3061 extern void internal_reference_types PARAMS ((void));
3063 /* varasm.c */
3064 extern void make_decl_rtl PARAMS ((tree, const char *));
3065 extern void make_decl_one_only PARAMS ((tree));
3066 extern int supports_one_only PARAMS ((void));
3067 extern void variable_section PARAMS ((tree, int));
3068 enum tls_model decl_tls_model PARAMS ((tree));
3069 enum symbol_visibility decl_visibility PARAMS ((tree));
3071 /* In stmt.c */
3072 extern void emit_nop PARAMS ((void));
3073 extern void expand_computed_goto PARAMS ((tree));
3074 extern bool parse_output_constraint PARAMS ((const char **,
3075 int, int, int,
3076 bool *, bool *, bool *));
3077 extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int,
3078 const char *, int));
3079 extern int any_pending_cleanups PARAMS ((int));
3080 extern void init_stmt_for_function PARAMS ((void));
3081 extern void expand_start_target_temps PARAMS ((void));
3082 extern void expand_end_target_temps PARAMS ((void));
3083 extern void expand_elseif PARAMS ((tree));
3084 extern void save_stack_pointer PARAMS ((void));
3085 extern void expand_decl PARAMS ((tree));
3086 extern int expand_decl_cleanup PARAMS ((tree, tree));
3087 extern int expand_decl_cleanup_eh PARAMS ((tree, tree, int));
3088 extern void expand_anon_union_decl PARAMS ((tree, tree, tree));
3089 extern void expand_start_case_dummy PARAMS ((void));
3090 extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *));
3091 extern void check_for_full_enumeration_handling PARAMS ((tree));
3092 extern void declare_nonlocal_label PARAMS ((tree));
3094 /* If KIND=='I', return a suitable global initializer (constructor) name.
3095 If KIND=='D', return a suitable global clean-up (destructor) name. */
3096 extern tree get_file_function_name PARAMS ((int));
3098 /* Interface of the DWARF2 unwind info support. */
3100 /* Generate a new label for the CFI info to refer to. */
3102 extern char *dwarf2out_cfi_label PARAMS ((void));
3104 /* Entry point to update the canonical frame address (CFA). */
3106 extern void dwarf2out_def_cfa PARAMS ((const char *, unsigned, long));
3108 /* Add the CFI for saving a register window. */
3110 extern void dwarf2out_window_save PARAMS ((const char *));
3112 /* Add a CFI to update the running total of the size of arguments pushed
3113 onto the stack. */
3115 extern void dwarf2out_args_size PARAMS ((const char *, long));
3117 /* Entry point for saving a register to the stack. */
3119 extern void dwarf2out_reg_save PARAMS ((const char *, unsigned, long));
3121 /* Entry point for saving the return address in the stack. */
3123 extern void dwarf2out_return_save PARAMS ((const char *, long));
3125 /* Entry point for saving the return address in a register. */
3127 extern void dwarf2out_return_reg PARAMS ((const char *, unsigned));
3129 /* The type of a function that walks over tree structure. */
3131 typedef tree (*walk_tree_fn) PARAMS ((tree *, int *, void *));
3133 /* In tree-dump.c */
3135 /* Different tree dump places. When you add new tree dump places,
3136 extend the DUMP_FILES array in tree-dump.c */
3137 enum tree_dump_index
3139 TDI_all, /* dump the whole translation unit */
3140 TDI_class, /* dump class hierarchy */
3141 TDI_original, /* dump each function before optimizing it */
3142 TDI_optimized, /* dump each function after optimizing it */
3143 TDI_inlined, /* dump each function after inlining
3144 within it. */
3145 TDI_end
3148 /* Bit masks to control tree dumping. Not all values are applicable to
3149 all tree dumps. Add new ones at the end. When you define new
3150 values, extend the DUMP_OPTIONS array in tree-dump.c */
3151 #define TDF_ADDRESS (1 << 0) /* dump node addresses */
3152 #define TDF_SLIM (1 << 1) /* don't go wild following links */
3154 typedef struct dump_info *dump_info_p;
3156 extern int dump_flag PARAMS ((dump_info_p, int, tree));
3157 extern int dump_enabled_p PARAMS ((enum tree_dump_index));
3158 extern FILE *dump_begin PARAMS ((enum tree_dump_index, int *));
3159 extern void dump_end PARAMS ((enum tree_dump_index, FILE *));
3160 extern void dump_node PARAMS ((tree, int, FILE *));
3161 extern int dump_switch_p PARAMS ((const char *));
3162 extern const char *dump_flag_name PARAMS ((enum tree_dump_index));
3163 /* Assign the RTX to declaration. */
3165 extern void set_decl_rtl PARAMS ((tree, rtx));
3167 /* Redefine abort to report an internal error w/o coredump, and
3168 reporting the location of the error in the source file. This logic
3169 is duplicated in rtl.h and tree.h because every file that needs the
3170 special abort includes one or both. toplev.h gets too few files,
3171 system.h gets too many. */
3173 extern void fancy_abort PARAMS ((const char *, int, const char *))
3174 ATTRIBUTE_NORETURN;
3175 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__)
3177 #endif /* GCC_TREE_H */