![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to tree.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [GCC 2.x] / gcc|
Return to tree.h CVS log | Up to [GCC 2.x] / gcc |
1.1 root 1: /* Front-end tree definitions for GNU compiler.
2: Copyright (C) 1989 Free Software Foundation, Inc.
3:
4: This file is part of GNU CC.
5:
6: GNU CC is free software; you can redistribute it and/or modify
7: it under the terms of the GNU General Public License as published by
8: the Free Software Foundation; either version 2, or (at your option)
9: any later version.
10:
11: GNU CC is distributed in the hope that it will be useful,
12: but WITHOUT ANY WARRANTY; without even the implied warranty of
13: MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14: GNU General Public License for more details.
15:
16: You should have received a copy of the GNU General Public License
17: along with GNU CC; see the file COPYING. If not, write to
18: the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
19:
20: #include "machmode.h"
21:
22: /* codes of tree nodes */
23:
24: #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
25:
26: enum tree_code {
27: #include "tree.def"
28:
1.1.1.3 ! root 29: LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
1.1 root 30: NUM_TREE_CODE. */
31: };
32:
33: #undef DEFTREECODE
34:
35: /* Number of tree codes. */
36: #define NUM_TREE_CODES ((int)LAST_AND_UNUSED_TREE_CODE)
37:
38: /* Indexed by enum tree_code, contains a character which is
39: `<' for a comparison expression, `1', for a unary arithmetic
40: expression, `2' for a binary arithmetic expression, `e' for
41: other types of expressions, `r' for a reference, `c' for a
42: constant, `d' for a decl, `t' for a type, `s' for a statement,
43: and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
44:
45: extern char **tree_code_type;
46: #define TREE_CODE_CLASS(CODE) (*tree_code_type[(int) (CODE)])
47:
48: /* Number of argument-words in each kind of tree-node. */
49:
50: extern int *tree_code_length;
51:
52: /* Names of tree components. */
53:
54: extern char **tree_code_name;
55:
56: /* Codes that identify the various built in functions
57: so that expand_call can identify them quickly. */
58:
59: enum built_in_function
60: {
61: NOT_BUILT_IN,
62: BUILT_IN_ALLOCA,
63: BUILT_IN_ABS,
64: BUILT_IN_FABS,
65: BUILT_IN_LABS,
66: BUILT_IN_FFS,
67: BUILT_IN_DIV,
68: BUILT_IN_LDIV,
69: BUILT_IN_FFLOOR,
70: BUILT_IN_FCEIL,
71: BUILT_IN_FMOD,
72: BUILT_IN_FREM,
73: BUILT_IN_MEMCPY,
74: BUILT_IN_MEMCMP,
75: BUILT_IN_MEMSET,
76: BUILT_IN_STRCPY,
77: BUILT_IN_STRCMP,
78: BUILT_IN_STRLEN,
79: BUILT_IN_FSQRT,
80: BUILT_IN_GETEXP,
81: BUILT_IN_GETMAN,
82: BUILT_IN_SAVEREGS,
83: BUILT_IN_CLASSIFY_TYPE,
84: BUILT_IN_NEXT_ARG,
85: BUILT_IN_ARGS_INFO,
86: BUILT_IN_CONSTANT_P,
87: BUILT_IN_FRAME_ADDRESS,
88: BUILT_IN_RETURN_ADDRESS,
89: BUILT_IN_CALLER_RETURN_ADDRESS,
90:
91: /* C++ extensions */
92: BUILT_IN_NEW,
93: BUILT_IN_VEC_NEW,
94: BUILT_IN_DELETE,
95: BUILT_IN_VEC_DELETE
96: };
97:
98: /* The definition of tree nodes fills the next several pages. */
99:
100: /* A tree node can represent a data type, a variable, an expression
101: or a statement. Each node has a TREE_CODE which says what kind of
102: thing it represents. Some common codes are:
103: INTEGER_TYPE -- represents a type of integers.
104: ARRAY_TYPE -- represents a type of pointer.
105: VAR_DECL -- represents a declared variable.
106: INTEGER_CST -- represents a constant integer value.
107: PLUS_EXPR -- represents a sum (an expression).
108:
109: As for the contents of a tree node: there are some fields
110: that all nodes share. Each TREE_CODE has various special-purpose
111: fields as well. The fields of a node are never accessed directly,
112: always through accessor macros. */
113:
114: /* This type is used everywhere to refer to a tree node. */
115:
116: typedef union tree_node *tree;
117:
118: #define NULL_TREE (tree) NULL
119:
120: /* Every kind of tree node starts with this structure,
121: so all nodes have these fields.
122:
123: See the accessor macros, defined below, for documentation of the fields. */
124:
125: struct tree_common
126: {
127: union tree_node *chain;
128: union tree_node *type;
129: #ifdef ONLY_INT_FIELDS
130: unsigned int code : 8;
131: #else
132: enum tree_code code : 8;
133: #endif
134:
135: unsigned side_effects_flag : 1;
136: unsigned constant_flag : 1;
137: unsigned permanent_flag : 1;
138: unsigned addressable_flag : 1;
139: unsigned volatile_flag : 1;
140: unsigned readonly_flag : 1;
141: unsigned unsigned_flag : 1;
142: unsigned asm_written_flag: 1;
143:
144: unsigned used_flag : 1;
145: unsigned raises_flag : 1;
146: unsigned static_flag : 1;
147: unsigned public_flag : 1;
148: unsigned private_flag : 1;
149: unsigned protected_flag : 1;
150:
151: unsigned lang_flag_0 : 1;
152: unsigned lang_flag_1 : 1;
153: unsigned lang_flag_2 : 1;
154: unsigned lang_flag_3 : 1;
155: unsigned lang_flag_4 : 1;
156: unsigned lang_flag_5 : 1;
157: unsigned lang_flag_6 : 1;
158: /* There is room for two more flags. */
159: };
160:
161: /* Define accessors for the fields that all tree nodes have
162: (though some fields are not used for all kinds of nodes). */
163:
164: /* The tree-code says what kind of node it is.
165: Codes are defined in tree.def. */
166: #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
167: #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
168:
169: /* In all nodes that are expressions, this is the data type of the expression.
170: In POINTER_TYPE nodes, this is the type that the pointer points to.
171: In ARRAY_TYPE nodes, this is the type of the elements. */
172: #define TREE_TYPE(NODE) ((NODE)->common.type)
173:
174: /* Nodes are chained together for many purposes.
175: Types are chained together to record them for being output to the debugger
176: (see the function `chain_type').
177: Decls in the same scope are chained together to record the contents
178: of the scope.
179: Statement nodes for successive statements used to be chained together.
180: Often lists of things are represented by TREE_LIST nodes that
181: are chained together. */
182:
183: #define TREE_CHAIN(NODE) ((NODE)->common.chain)
184:
185: /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
186: that don't change the machine mode. */
187:
188: #define STRIP_NOPS(EXP) \
189: while ((TREE_CODE (EXP) == NOP_EXPR \
190: || TREE_CODE (EXP) == CONVERT_EXPR \
191: || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
192: && (TYPE_MODE (TREE_TYPE (EXP)) \
193: == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
194: (EXP) = TREE_OPERAND (EXP, 0);
195:
196: /* Define many boolean fields that all tree nodes have. */
197:
198: /* In VAR_DECL nodes, nonzero means address of this is needed.
199: So it cannot be in a register.
200: In a FUNCTION_DECL, nonzero means its address is needed.
201: So it must be compiled even if it is an inline function.
202: In CONSTRUCTOR nodes, it means object constructed must be in memory.
203: In LABEL_DECL nodes, it means a goto for this label has been seen
204: from a place outside all binding contours that restore stack levels.
205: In ..._TYPE nodes, it means that objects of this type must
206: be fully addressable. This means that pieces of this
207: object cannot go into register parameters, for example.
208: In IDENTIFIER_NODEs, this means that some extern decl for this name
209: had its address taken. That matters for inline functions. */
210: #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
211:
212: /* In a VAR_DECL, nonzero means allocate static storage.
213: In a FUNCTION_DECL, currently nonzero if function has been defined.
214: In a CONSTRUCTOR, nonzero means allocate static storage. */
215: #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
216:
217: /* In a CONVERT_EXPR or NOP_EXPR, this means the node was made
218: implicitly and should not lead to an "unused value" warning. */
219: #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
220:
1.1.1.3 ! root 221: /* In a NON_LVALUE_EXPR, this means there was overflow in folding.
! 222: The folded constant is inside the NON_LVALUE_EXPR. */
! 223: #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
! 224:
1.1 root 225: /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
226: chain is via a `virtual' declaration. */
227: #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
228:
229: /* In a VAR_DECL or FUNCTION_DECL,
230: nonzero means name is to be accessible from outside this module.
231: In an identifier node, nonzero means a external declaration
1.1.1.3 ! root 232: accessible from outside this module was previously seen
1.1 root 233: for this name in an inner scope. */
234: #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
235:
236: /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
237: base class is via a `public' declaration, which preserves public
238: fields from the base class as public. */
239: #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
240:
241: /* In any expression, nonzero means it has side effects or reevaluation
242: of the whole expression could produce a different value.
243: This is set if any subexpression is a function call, a side effect
244: or a reference to a volatile variable.
245: In a ..._DECL, this is set only if the declaration said `volatile'. */
246: #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
247:
248: /* Nonzero means this expression is volatile in the C sense:
249: its address should be of type `volatile WHATEVER *'.
250: In other words, the declared item is volatile qualified.
251: This is used in _DECL nodes and _REF nodes.
252:
253: In a ..._TYPE node, means this type is volatile-qualified.
254: But use TYPE_VOLATILE instead of this macro when the node is a type,
255: because eventually we may make that a different bit.
256:
257: If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
258: #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
259:
260: /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
261: nonzero means it may not be the lhs of an assignment.
262: In a ..._TYPE node, means this type is const-qualified
263: (but the macro TYPE_READONLY should be used instead of this macro
264: when the node is a type). */
265: #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
266:
267: /* Value of expression is constant.
268: Always appears in all ..._CST nodes.
269: May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
270: if the value is constant. */
271: #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
272:
273: /* Nonzero means permanent node;
274: node will continue to exist for the entire compiler run.
275: Otherwise it will be recycled at the end of the function. */
276: #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
277:
278: /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
279: In FIELD_DECL nodes, means an unsigned bit field.
280: The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
281: #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
282:
283: /* Nonzero in a VAR_DECL means assembler code has been written.
284: Nonzero in a FUNCTION_DECL means that the function has been compiled.
285: This is interesting in an inline function, since it might not need
286: to be compiled separately.
287: Nonzero in a RECORD_TYPE, UNION_TYPE or ENUMERAL_TYPE
288: if the sdb debugging info for the type has been written. */
289: #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
290:
291: /* Nonzero in a _DECL if the name is used in its scope.
292: Nonzero in an expr node means inhibit warning if value is unused.
293: In IDENTIFIER_NODEs, this means that some extern decl for this name
294: was used. */
295: #define TREE_USED(NODE) ((NODE)->common.used_flag)
296:
297: /* Nonzero for a tree node whose evaluation could result
298: in the raising of an exception. Not implemented yet. */
299: #define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
300:
301: /* These are currently used in classes in C++. */
302: #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
303: #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
304:
305: #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
306: #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
307: #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
308: #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
309: #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
310: #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
311: #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
312:
313: /* Define additional fields and accessors for nodes representing constants. */
314:
315: /* In an INTEGER_CST node. These two together make a 64 bit integer.
316: If the data type is signed, the value is sign-extended to 64 bits
317: even though not all of them may really be in use.
318: In an unsigned constant shorter than 64 bits, the extra bits are 0. */
319: #define TREE_INT_CST_LOW(NODE) ((NODE)->int_cst.int_cst_low)
320: #define TREE_INT_CST_HIGH(NODE) ((NODE)->int_cst.int_cst_high)
321:
322: #define INT_CST_LT(A, B) \
323: (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
324: || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
325: && ((unsigned) TREE_INT_CST_LOW (A) < (unsigned) TREE_INT_CST_LOW (B))))
326:
327: #define INT_CST_LT_UNSIGNED(A, B) \
328: ((unsigned) TREE_INT_CST_HIGH (A) < (unsigned) TREE_INT_CST_HIGH (B) \
329: || ((unsigned) TREE_INT_CST_HIGH (A) == (unsigned) TREE_INT_CST_HIGH (B) \
330: && ((unsigned) TREE_INT_CST_LOW (A) < (unsigned) TREE_INT_CST_LOW (B))))
331:
332: struct tree_int_cst
333: {
334: char common[sizeof (struct tree_common)];
335: long int_cst_low;
336: long int_cst_high;
337: };
338:
339: /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
340: and generally in all kinds of constants that could
341: be given labels (rather than being immediate). */
342:
343: #define TREE_CST_RTL(NODE) ((NODE)->real_cst.rtl)
344:
345: /* In a REAL_CST node. */
346: /* We can represent a real value as either a `double' or a string.
347: Strings don't allow for any optimization, but they do allow
348: for cross-compilation. */
349:
350: #define TREE_REAL_CST(NODE) ((NODE)->real_cst.real_cst)
351:
352: #include "real.h"
353:
354: struct tree_real_cst
355: {
356: char common[sizeof (struct tree_common)];
357: struct rtx_def *rtl; /* acts as link to register transfer language
358: (rtl) info */
359: REAL_VALUE_TYPE real_cst;
360: };
361:
362: /* In a STRING_CST */
363: #define TREE_STRING_LENGTH(NODE) ((NODE)->string.length)
364: #define TREE_STRING_POINTER(NODE) ((NODE)->string.pointer)
365:
366: struct tree_string
367: {
368: char common[sizeof (struct tree_common)];
369: struct rtx_def *rtl; /* acts as link to register transfer language
370: (rtl) info */
371: int length;
372: char *pointer;
373: };
374:
375: /* In a COMPLEX_CST node. */
376: #define TREE_REALPART(NODE) ((NODE)->complex.real)
377: #define TREE_IMAGPART(NODE) ((NODE)->complex.imag)
378:
379: struct tree_complex
380: {
381: char common[sizeof (struct tree_common)];
382: struct rtx_def *rtl; /* acts as link to register transfer language
383: (rtl) info */
384: union tree_node *real;
385: union tree_node *imag;
386: };
387:
388: /* Define fields and accessors for some special-purpose tree nodes. */
389:
390: #define IDENTIFIER_LENGTH(NODE) ((NODE)->identifier.length)
391: #define IDENTIFIER_POINTER(NODE) ((NODE)->identifier.pointer)
392: #define IDENTIFIER_VIRTUAL_P(NODE) TREE_LANG_FLAG_1(NODE)
393:
394: struct tree_identifier
395: {
396: char common[sizeof (struct tree_common)];
397: int length;
398: char *pointer;
399: };
400:
401: /* In a TREE_LIST node. */
402: #define TREE_PURPOSE(NODE) ((NODE)->list.purpose)
403: #define TREE_VALUE(NODE) ((NODE)->list.value)
404:
405: struct tree_list
406: {
407: char common[sizeof (struct tree_common)];
408: union tree_node *purpose;
409: union tree_node *value;
410: };
411:
412: /* In a TREE_VEC node. */
413: #define TREE_VEC_LENGTH(NODE) ((NODE)->vec.length)
414: #define TREE_VEC_ELT(NODE,I) ((NODE)->vec.a[I])
415: #define TREE_VEC_END(NODE) (&((NODE)->vec.a[(NODE)->vec.length]))
416:
417: struct tree_vec
418: {
419: char common[sizeof (struct tree_common)];
420: int length;
421: union tree_node *a[1];
422: };
423:
424: /* Define fields and accessors for some nodes that represent expressions. */
425:
426: /* In a SAVE_EXPR node. */
427: #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
428: #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
429:
430: /* In a RTL_EXPR node. */
431: #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[0])
432: #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[1])
433:
434: /* In a CALL_EXPR node. */
435: #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2])
436:
437: /* In a CONSTRUCTOR node. */
438: #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
439:
440: /* In a BLOCK node. */
441: #define BLOCK_VARS(NODE) ((NODE)->exp.operands[0])
442: #define BLOCK_TYPE_TAGS(NODE) ((NODE)->exp.operands[1])
443: #define BLOCK_SUBBLOCKS(NODE) ((NODE)->exp.operands[2])
444: #define BLOCK_SUPERCONTEXT(NODE) ((NODE)->exp.operands[3])
445: /* Note: when changing this, make sure to find the places
446: that use chainon or nreverse. */
447: #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
448:
449: /* Nonzero means that this block is prepared to handle exceptions
450: listed in the BLOCK_VARS slot. */
451: #define BLOCK_HANDLER_BLOCK(NODE) TREE_PROTECTED(NODE)
452:
453: /* In ordinary expression nodes. */
454: #define TREE_OPERAND(NODE, I) ((NODE)->exp.operands[I])
455: #define TREE_COMPLEXITY(NODE) ((NODE)->exp.complexity)
456:
457: struct tree_exp
458: {
459: char common[sizeof (struct tree_common)];
460: int complexity;
461: union tree_node *operands[1];
462: };
463:
464: /* Define fields and accessors for nodes representing data types. */
465:
466: /* See tree.def for documentation of the use of these fields.
467: Look at the documentation of the various ..._TYPE tree codes. */
468:
469: #define TYPE_UID(NODE) ((NODE)->type.uid)
470: #define TYPE_SIZE(NODE) ((NODE)->type.size)
471: #define TYPE_MODE(NODE) ((NODE)->type.mode)
472: #define TYPE_VALUES(NODE) ((NODE)->type.values)
473: #define TYPE_DOMAIN(NODE) ((NODE)->type.values)
474: #define TYPE_FIELDS(NODE) ((NODE)->type.values)
475: #define TYPE_METHODS(NODE) ((NODE)->type.maxval)
476: #define TYPE_VFIELD(NODE) ((NODE)->type.minval)
477: #define TYPE_ARG_TYPES(NODE) ((NODE)->type.values)
478: #define TYPE_METHOD_BASETYPE(NODE) ((NODE)->type.maxval)
479: #define TYPE_OFFSET_BASETYPE(NODE) ((NODE)->type.maxval)
480: #define TYPE_POINTER_TO(NODE) ((NODE)->type.pointer_to)
481: #define TYPE_REFERENCE_TO(NODE) ((NODE)->type.reference_to)
482: #define TYPE_MIN_VALUE(NODE) ((NODE)->type.minval)
483: #define TYPE_MAX_VALUE(NODE) ((NODE)->type.maxval)
484: #define TYPE_PRECISION(NODE) ((NODE)->type.precision)
485: #define TYPE_PARSE_INFO(NODE) ((NODE)->type.parse_info)
486: #define TYPE_SYMTAB_ADDRESS(NODE) ((NODE)->type.symtab_address)
487: #define TYPE_NAME(NODE) ((NODE)->type.name)
488: #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant)
489: #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant)
490: #define TYPE_BINFO(NODE) ((NODE)->type.binfo)
491: #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts)
492: #define TYPE_CONTEXT(NODE) ((NODE)->type.context)
493: #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific)
494:
1.1.1.3 ! root 495: /* The alignment necessary for objects of this type.
! 496: The value is an int, measured in bits. */
! 497: #define TYPE_ALIGN(NODE) ((NODE)->type.align)
! 498:
1.1 root 499: #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
500:
501: /* In a RECORD_TYPE or UNION_TYPE, it means the type has BLKmode
502: only because it lacks the alignment requirement for its size. */
503: #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag)
504:
505: /* Nonzero in a type considered volatile as a whole. */
506: #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
507:
508: /* Means this type is const-qualified. */
509: #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
510:
511: #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0)
512: #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1)
513: #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2)
514: #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3)
515: #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4)
516: #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5)
517: #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6)
518:
519: struct tree_type
520: {
521: char common[sizeof (struct tree_common)];
522: union tree_node *values;
523: union tree_node *size;
524: unsigned uid;
525:
526: #ifdef ONLY_INT_FIELDS
527: int mode : 8;
528: #else
529: enum machine_mode mode : 8;
530: #endif
531: unsigned char align;
532: unsigned char precision;
533:
534: unsigned no_force_blk_flag : 1;
535: unsigned lang_flag_0 : 1;
536: unsigned lang_flag_1 : 1;
537: unsigned lang_flag_2 : 1;
538: unsigned lang_flag_3 : 1;
539: unsigned lang_flag_4 : 1;
540: unsigned lang_flag_5 : 1;
541: unsigned lang_flag_6 : 1;
542:
543: union tree_node *pointer_to;
544: union tree_node *reference_to;
545: int parse_info;
546: int symtab_address;
547: union tree_node *name;
548: union tree_node *minval;
549: union tree_node *maxval;
550: union tree_node *next_variant;
551: union tree_node *main_variant;
552: union tree_node *binfo;
553: union tree_node *noncopied_parts;
554: union tree_node *context;
555: /* Points to a structure whose details depend on the language in use. */
556: struct lang_type *lang_specific;
557: };
558:
559: /* Define accessor macros for information about type inheritance
560: and basetypes.
561:
562: A "basetype" means a particular usage of a data type for inheritance
563: in another type. Each such basetype usage has its own "binfo"
564: object to describe it. The binfo object is a TREE_VEC node.
565:
566: Inheritance is represented by the binfo nodes allocated for a
567: given type. For example, given types C and D, such that D is
568: inherited by C, 3 binfo nodes will be allocated: one for describing
569: the binfo properties of C, similarly one for D, and one for
570: describing the binfo properties of D as a base type for C.
571: Thus, given a pointer to class C, one can get a pointer to the binfo
572: of D acting as a basetype for C by looking at C's binfo's basetypes. */
573:
574: /* The actual data type node being inherited in this basetype. */
575: #define BINFO_TYPE(NODE) TREE_TYPE (NODE)
576:
577: /* The offset where this basetype appears in its containing type.
578: BINFO_OFFSET slot holds the offset (in bytes)
579: from the base of the complete object to the base of the part of the
580: object that is allocated on behalf of this `type'.
581: This is always 0 except when there is multiple inheritance. */
582:
583: #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
584: #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
585: #define BINFO_OFFSET_ZEROP(NODE) (BINFO_OFFSET (NODE) == integer_zero_node)
586:
587: /* The virtual function table belonging to this basetype. Virtual
588: function tables provide a mechanism for run-time method dispatching.
589: The entries of a virtual function table are language-dependent. */
590:
591: #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
592: #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
593:
594: /* The virtual functions in the virtual function table. This is
595: a TREE_LIST that is used as an initial approximation for building
596: a virtual function table for this basetype. */
597: #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
598: #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
599:
600: /* A vector of additional binfos for the types inherited by this basetype.
601:
602: If this basetype describes type D as inherited in C,
603: and if the basetypes of D are E anf F,
604: then this vector contains binfos for inheritance of E and F by C.
605:
606: ??? This could probably be done by just allocating the
607: base types at the end of this TREE_VEC (instead of using
608: another TREE_VEC). This would simplify the calculation
609: of how many basetypes a given type had. */
610: #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
611: #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
612:
613: /* Accessor macro to get to the Nth basetype of this basetype. */
614: #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
615: #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
616:
617: /* Slot used to build a chain that represents a use of inheritance.
618: For example, if X is derived from Y, and Y is derived from Z,
619: then this field can be used to link the binfo node for X to
620: the binfo node for X's Y to represent the use of inheritance
621: from X to Y. Similarly, this slot of the binfo node for X's Y
622: can point to the Z from which Y is inherited (in X's inheritance
623: hierarchy). In this fashion, one can represent and traverse specific
624: uses of inheritance using the binfo nodes themselves (instead of
625: consing new space pointing to binfo nodes).
626: It is up to the language-dependent front-ends to maintain
627: this information as necessary. */
628: #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
629:
630: /* Define fields and accessors for nodes representing declared names. */
631:
632: /* This is the name of the object as written by the user.
633: It is an IDENTIFIER_NODE. */
634: #define DECL_NAME(NODE) ((NODE)->decl.name)
635: /* This macro is marked for death. */
636: #define DECL_PRINT_NAME(NODE) ((NODE)->decl.print_name)
637: /* This is the name of the object as the assembler will see it
638: (but before any translations made by ASM_OUTPUT_LABELREF).
639: Often this is the same as DECL_NAME.
640: It is an IDENTIFIER_NODE. */
641: #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name)
642: /* The containing binding context; either a BINDING
643: or a RECORD_TYPE or UNION_TYPE. */
644: #define DECL_CONTEXT(NODE) ((NODE)->decl.context)
645: #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context)
646: /* In a FIELD_DECL, this is the field position, counting in bits,
647: of the bit closest to the beginning of the structure. */
648: #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments)
649: /* In a FIELD_DECL, this indicates whether the field was a bit-field and
1.1.1.3 ! root 650: if so, the type that was originally specified for it.
! 651: TREE_TYPE may have been modified (in finish_struct). */
1.1 root 652: #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result)
653: /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
654: /* VAR_DECL and PARM_DECL reserve the arguments slot
655: for language-specific uses. */
656: #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments)
657: /* In FUNCTION_DECL, holds the decl for the return value. */
658: #define DECL_RESULT(NODE) ((NODE)->decl.result)
659: /* In PARM_DECL, holds the type as written (perhaps a function or array). */
660: #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result)
661: /* For a FUNCTION_DECL, holds the tree of BINDINGs.
662: For a VAR_DECL, holds the initial value.
663: For a PARM_DECL, not used--default
664: values for parameters are encoded in the type of the function,
665: not in the PARM_DECL slot. */
666: #define DECL_INITIAL(NODE) ((NODE)->decl.initial)
667: /* For a PARM_DECL, records the data type used to pass the argument,
668: which may be different from the type seen in the program. */
669: #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */
670: /* These two fields describe where in the source code the declaration was. */
671: #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename)
672: #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum)
673: /* Holds the size of the datum, as a tree expression.
674: Need not be constant. */
675: #define DECL_SIZE(NODE) ((NODE)->decl.size)
676: /* Holds the alignment required for the datum. */
1.1.1.3 ! root 677: #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size)
1.1 root 678: /* Holds the machine mode of a variable or field. */
679: #define DECL_MODE(NODE) ((NODE)->decl.mode)
680: /* Holds the RTL expression for the value of a variable or function. */
681: #define DECL_RTL(NODE) ((NODE)->decl.rtl)
682: /* For PARM_DECL, holds an RTL for the stack slot or register
683: where the data was actually passed. */
1.1.1.3 ! root 684: #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r)
1.1 root 685: /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1.1.1.3 ! root 686: #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r)
1.1 root 687: /* For FUNCTION_DECL for built-in function. */
688: #define DECL_FUNCTION_CODE(NODE) \
689: ((enum built_in_function) (NODE)->decl.frame_size)
690: #define DECL_SET_FUNCTION_CODE(NODE,VAL) \
691: ((NODE)->decl.frame_size = (int) (VAL))
692: /* For FUNCTION_DECL, if it is inline,
693: holds the size of the stack frame, as an integer. */
694: #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size)
1.1.1.3 ! root 695: /* For a FIELD_DECL, holds the size of the member as an integer. */
! 696: #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i)
1.1 root 697:
698: /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
699: Before the struct containing the FUNCTION_DECL is laid out,
700: DECL_VINDEX may point to a FUNCTION_DECL in a base class which
701: is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
702: function. When the class is laid out, this pointer is changed
703: to an INTEGER_CST node which is suitable for use as an index
704: into the virtual function table. */
705: #define DECL_VINDEX(NODE) ((NODE)->decl.vindex)
706: /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
707: which this FIELD_DECL is defined. This information is needed when
708: writing debugging information about vfield and vbase decls for C++. */
709: #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex)
710:
711: /* Nonzero in a VAR_DECL or PARM_DECL means this decl was made by inlining;
712: suppress any warnings about shadowing some other variable. */
713: #define DECL_FROM_INLINE(NODE) ((NODE)->decl.from_inline_flag)
714:
715: /* Nonzero if a _DECL means that the name of this decl should be ignored
716: for symbolic debug purposes. */
717: #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag)
718:
719: #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific)
720:
721: /* In a VAR_DECL or FUNCTION_DECL,
722: nonzero means external reference:
723: do not allocate storage, and refer to a definition elsewhere. */
724: #define TREE_EXTERNAL(NODE) ((NODE)->decl.external_flag)
725:
726: /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'.
727: In LABEL_DECL nodes, nonzero means that an error message about
728: jumping into such a binding contour has been printed for this label. */
729: #define TREE_REGDECL(NODE) ((NODE)->decl.regdecl_flag)
730:
731: /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
732: For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
733:
734: For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
735:
736: Also set in some languages for variables, etc., outside the normal
737: lexical scope, such as class instance variables. */
738: #define TREE_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag)
739:
740: /* Nonzero in a FUNCTION_DECL means this function can be substituted
741: where it is called. */
742: #define TREE_INLINE(NODE) ((NODE)->decl.inline_flag)
743:
744: /* Nonzero in a FUNCTION_DECL means this is a built-in function
745: that is not specified by ansi C and that users are supposed to be allowed
746: to redefine for any purpose whatever. */
747: #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
748:
749: /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
750: specially. */
751: #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag)
752: /* In a LABEL_DECL, nonzero means label was defined inside a binding
753: contour that restored a stack level and which is now exited. */
754: #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag)
755: /* In a FUNCTION_DECL, nonzero means a built in function. */
756: #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag)
757:
1.1.1.3 ! root 758: /* In a FUNCTION_DECL, indicates a method
! 759: for which each instance has a pointer. */
1.1 root 760: #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag)
761: /* In a FIELD_DECL, indicates this field should be bit-packed. */
762: #define DECL_PACKED(NODE) ((NODE)->decl.virtual_flag)
763:
764: /* Additional flags for language-specific uses. */
765: #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0)
766: #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1)
767: #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2)
768: #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3)
769: #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4)
770: #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5)
771: #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6)
772: #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7)
773:
774: struct tree_decl
775: {
776: char common[sizeof (struct tree_common)];
777: char *filename;
778: int linenum;
779: union tree_node *size;
780: #ifdef ONLY_INT_FIELDS
781: int mode : 8;
782: #else
783: enum machine_mode mode : 8;
784: #endif
785:
786: unsigned external_flag : 1;
787: unsigned nonlocal_flag : 1;
788: unsigned regdecl_flag : 1;
789: unsigned inline_flag : 1;
790: unsigned bit_field_flag : 1;
791: unsigned virtual_flag : 1;
792: unsigned from_inline_flag : 1;
793: unsigned ignored_flag : 1;
794:
795: unsigned lang_flag_0 : 1;
796: unsigned lang_flag_1 : 1;
797: unsigned lang_flag_2 : 1;
798: unsigned lang_flag_3 : 1;
799: unsigned lang_flag_4 : 1;
800: unsigned lang_flag_5 : 1;
801: unsigned lang_flag_6 : 1;
802: unsigned lang_flag_7 : 1;
803:
804: union tree_node *name;
805: union tree_node *context;
806: union tree_node *arguments;
807: union tree_node *result;
808: union tree_node *initial;
809: /* The PRINT_NAME field is marked for death. */
810: char *print_name;
811: union tree_node *assembler_name;
812: struct rtx_def *rtl; /* acts as link to register transfer language
813: (rtl) info */
1.1.1.3 ! root 814: /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
! 815: If built-in, this is the code for which built-in function. */
! 816: int frame_size;
! 817: /* For FUNCTION_DECLs: points to insn that constitutes its definition
! 818: on the permanent obstack. For any other kind of decl, this is the
! 819: alignment. */
! 820: union {
! 821: struct rtx_def *r;
! 822: int i;
! 823: } saved_insns;
1.1 root 824: union tree_node *vindex;
825: /* Points to a structure whose details depend on the language in use. */
826: struct lang_decl *lang_specific;
827: };
828:
829: /* Define the overall contents of a tree node.
830: It may be any of the structures declared above
831: for various types of node. */
832:
833: union tree_node
834: {
835: struct tree_common common;
836: struct tree_int_cst int_cst;
837: struct tree_real_cst real_cst;
838: struct tree_string string;
839: struct tree_complex complex;
840: struct tree_identifier identifier;
841: struct tree_decl decl;
842: struct tree_type type;
843: struct tree_list list;
844: struct tree_vec vec;
845: struct tree_exp exp;
846: };
847:
848: /* Format for global names of constructor and destructor functions. */
849: #ifndef NO_DOLLAR_IN_LABEL
850: #define CONSTRUCTOR_NAME_FORMAT "_GLOBAL_$I$%s"
851: #else
852: #define CONSTRUCTOR_NAME_FORMAT "_GLOBAL_.I.%s"
853: #endif
854:
855: extern char *oballoc ();
856: extern char *permalloc ();
857: extern char *savealloc ();
858:
859: /* Lowest level primitive for allocating a node.
860: The TREE_CODE is the only argument. Contents are initialized
861: to zero except for a few of the common fields. */
862:
863: extern tree make_node ();
864:
865: /* Make a copy of a node, with all the same contents except
866: for TREE_PERMANENT. (The copy is permanent
867: iff nodes being made now are permanent.) */
868:
869: extern tree copy_node ();
870:
871: /* Make a copy of a chain of TREE_LIST nodes. */
872:
873: extern tree copy_list ();
874:
875: /* Make a TREE_VEC. */
876:
877: extern tree make_tree_vec ();
878:
879: /* Return the (unique) IDENTIFIER_NODE node for a given name.
880: The name is supplied as a char *. */
881:
882: extern tree get_identifier ();
883:
884: /* Construct various types of nodes. */
885:
886: extern tree build_int_2 ();
887: extern tree build_real ();
888: extern tree build_real_from_string ();
889: extern tree build_real_from_int_cst ();
890: extern tree build_complex ();
891: extern tree build_string ();
892: extern tree build (), build1 ();
893: extern tree build_nt (), build_parse_node ();
894: extern tree build_tree_list (), build_decl_list ();
895: extern tree build_op_identifier ();
896: extern tree build_decl ();
897: extern tree build_block ();
898:
899: /* Construct various nodes representing data types. */
900:
901: extern tree make_signed_type ();
902: extern tree make_unsigned_type ();
903: extern tree signed_or_unsigned_type ();
904: extern void fixup_unsigned_type ();
905: extern tree build_pointer_type ();
906: extern tree build_reference_type ();
907: extern tree build_index_type (), build_index_2_type ();
908: extern tree build_array_type ();
909: extern tree build_function_type ();
910: extern tree build_method_type ();
911: extern tree build_offset_type ();
912: extern tree build_complex_type ();
913: extern tree array_type_nelts ();
914:
915: /* Construct expressions, performing type checking. */
916:
917: extern tree build_binary_op ();
918: extern tree build_indirect_ref ();
919: extern tree build_unary_op ();
920:
921: /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
922: for the same kind of data as TYPE describes.
923: Variants point to the "main variant" (which has neither CONST nor VOLATILE)
924: via TYPE_MAIN_VARIANT, and it points to a chain of other variants
925: so that duplicate variants are never made.
926: Only main variants should ever appear as types of expressions. */
927:
928: extern tree build_type_variant ();
929:
1.1.1.2 root 930: /* Make a copy of a type node. */
1.1 root 931:
1.1.1.2 root 932: extern tree build_type_copy ();
1.1 root 933:
934: /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
935: TYPE_ALIGN and TYPE_MODE fields.
936: If called more than once on one node, does nothing except
937: for the first time. */
938:
939: extern void layout_type ();
940:
941: /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
942: return a canonicalized ..._TYPE node, so that duplicates are not made.
943: How the hash code is computed is up to the caller, as long as any two
944: callers that could hash identical-looking type nodes agree. */
945:
946: extern tree type_hash_canon ();
947:
948: /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
949: calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
950: fields. Call this only once for any given decl node.
951:
952: Second argument is the boundary that this field can be assumed to
953: be starting at (in bits). Zero means it can be assumed aligned
954: on any boundary that may be needed. */
955:
956: extern void layout_decl ();
957:
958: /* Fold constants as much as possible in an expression.
959: Returns the simplified expression.
960: Acts only on the top level of the expression;
961: if the argument itself cannot be simplified, its
962: subexpressions are not changed. */
963:
964: extern tree fold ();
965:
966: /* Return an expr equal to X but certainly not valid as an lvalue. */
967:
968: extern tree non_lvalue ();
969:
970: extern tree convert ();
971: extern tree size_in_bytes ();
972: extern tree size_binop ();
973: extern tree size_int ();
974: extern tree round_up ();
975: extern tree get_pending_sizes ();
976: extern tree get_permanent_types (), get_temporary_types ();
977:
978: /* Type for sizes of data-type. */
979:
980: extern tree sizetype;
981:
982: /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
983: by making the last node in X point to Y.
984: Returns X, except if X is 0 returns Y. */
985:
986: extern tree chainon ();
987:
988: /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
989:
990: extern tree tree_cons (), perm_tree_cons (), temp_tree_cons ();
991: extern tree saveable_tree_cons (), decl_tree_cons ();
992:
993: /* Return the last tree node in a chain. */
994:
995: extern tree tree_last ();
996:
997: /* Reverse the order of elements in a chain, and return the new head. */
998:
999: extern tree nreverse ();
1000:
1001: /* Make a copy of a chain of tree nodes. */
1002:
1003: extern tree copy_chain ();
1004:
1005: /* Returns the length of a chain of nodes
1006: (number of chain pointers to follow before reaching a null pointer). */
1007:
1008: extern int list_length ();
1009:
1010: /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1011:
1012: extern int integer_zerop ();
1013:
1014: /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1015:
1016: extern int integer_onep ();
1017:
1018: /* integer_all_onesp (tree x) is nonzero if X is an integer constant
1019: all of whose significant bits are 1. */
1020:
1021: extern int integer_all_onesp ();
1022:
1023: /* integer_pow2p (tree x) is nonzero is X is an integer constant with
1024: exactly one bit 1. */
1025:
1026: extern int integer_pow2p ();
1027:
1028: /* type_unsigned_p (tree x) is nonzero if the type X is an unsigned type
1029: (all of its possible values are >= 0).
1030: If X is a pointer type, the value is 1.
1031: If X is a real type, the value is 0. */
1032:
1033: extern int type_unsigned_p ();
1034:
1035: /* staticp (tree x) is nonzero if X is a reference to data allocated
1036: at a fixed address in memory. */
1037:
1038: extern int staticp ();
1039:
1040: /* Gets an error if argument X is not an lvalue.
1041: Also returns 1 if X is an lvalue, 0 if not. */
1042:
1043: extern int lvalue_or_else ();
1044:
1045: /* save_expr (EXP) returns an expression equivalent to EXP
1046: but it can be used multiple times within context CTX
1047: and only evaluate EXP once. */
1048:
1049: extern tree save_expr ();
1050:
1.1.1.2 root 1051: /* variable_size (EXP) is like save_expr (EXP) except that it
1052: is for the special case of something that is part of a
1053: variable size for a data type. It makes special arrangements
1054: to compute the value at the right time when the data type
1055: belongs to a function parameter. */
1056:
1057: extern tree variable_size ();
1058:
1.1 root 1059: /* stabilize_reference (EXP) returns an reference equivalent to EXP
1060: but it can be used multiple times
1061: and only evaluate the subexpressions once. */
1062:
1063: extern tree stabilize_reference ();
1064:
1065: /* Return EXP, stripped of any conversions to wider types
1066: in such a way that the result of converting to type FOR_TYPE
1067: is the same as if EXP were converted to FOR_TYPE.
1068: If FOR_TYPE is 0, it signifies EXP's type. */
1069:
1070: extern tree get_unwidened ();
1071:
1072: /* Return OP or a simpler expression for a narrower value
1073: which can be sign-extended or zero-extended to give back OP.
1074: Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1075: or 0 if the value should be sign-extended. */
1076:
1077: extern tree get_narrower ();
1078:
1079: /* Given MODE and UNSIGNEDP, return a suitable type-tree
1080: with that mode.
1081: The definition of this resides in language-specific code
1082: as the repertoire of available types may vary. */
1083:
1084: extern tree type_for_mode ();
1085:
1086: /* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1087: for an integer type with at least that precision.
1088: The definition of this resides in language-specific code
1089: as the repertoire of available types may vary. */
1090:
1091: extern tree type_for_size ();
1092:
1093: /* Given an integer type T, return a type like T but unsigned.
1094: If T is unsigned, the value is T.
1095: The definition of this resides in language-specific code
1096: as the repertoire of available types may vary. */
1097:
1098: extern tree unsigned_type ();
1099:
1100: /* Given an integer type T, return a type like T but signed.
1101: If T is signed, the value is T.
1102: The definition of this resides in language-specific code
1103: as the repertoire of available types may vary. */
1104:
1105: extern tree signed_type ();
1106:
1107: /* This function must be defined in the language-specific files.
1108: expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1109: This is defined in a language-specific file. */
1110:
1111: extern tree maybe_build_cleanup ();
1112:
1113: /* Return the floating type node for a given floating machine mode. */
1114:
1115: extern tree get_floating_type ();
1116:
1117: /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1118: look for nested component-refs or array-refs at constant positions
1119: and find the ultimate containing object, which is returned. */
1120:
1121: extern tree get_inner_reference ();
1122:
1123: /* Return the FUNCTION_DECL which provides this _DECL with its context,
1124: or zero if none. */
1125: extern tree decl_function_context ();
1126:
1127: /* Return the RECORD_TYPE or UNION_TYPE which provides this _DECL
1128: with its context, or zero if none. */
1129: extern tree decl_type_context ();
1130:
1131: /* Given the FUNCTION_DECL for the current function,
1132: return zero if it is ok for this function to be inline.
1133: Otherwise return a warning message with a single %s
1134: for the function's name. */
1135:
1136: extern char *function_cannot_inline_p ();
1137:
1138: /* Declare commonly used variables for tree structure. */
1139:
1140: /* An integer constant with value 0 */
1141: extern tree integer_zero_node;
1142:
1143: /* An integer constant with value 1 */
1144: extern tree integer_one_node;
1145:
1146: /* An integer constant with value 0 whose type is sizetype. */
1147: extern tree size_zero_node;
1148:
1149: /* An integer constant with value 1 whose type is sizetype. */
1150: extern tree size_one_node;
1151:
1152: /* A constant of type pointer-to-int and value 0 */
1153: extern tree null_pointer_node;
1154:
1155: /* A node of type ERROR_MARK. */
1156: extern tree error_mark_node;
1157:
1158: /* The type node for the void type. */
1159: extern tree void_type_node;
1160:
1161: /* The type node for the ordinary (signed) integer type. */
1162: extern tree integer_type_node;
1163:
1164: /* The type node for the unsigned integer type. */
1165: extern tree unsigned_type_node;
1166:
1167: /* The type node for the ordinary character type. */
1168: extern tree char_type_node;
1169:
1170: /* Points to the name of the input file from which the current input
1171: being parsed originally came (before it went into cpp). */
1172: extern char *input_filename;
1173:
1174: /* Current line number in input file. */
1175: extern int lineno;
1176:
1177: /* Nonzero for -pedantic switch: warn about anything
1178: that standard C forbids. */
1179: extern int pedantic;
1180:
1181: /* Nonzero means can safely call expand_expr now;
1182: otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1183:
1184: extern int immediate_size_expand;
1185:
1186: /* Points to the FUNCTION_DECL of the function whose body we are reading. */
1187:
1188: extern tree current_function_decl;
1189:
1190: /* Nonzero if function being compiled can call setjmp. */
1191:
1192: extern int current_function_calls_setjmp;
1193:
1194: /* Nonzero if function being compiled can call longjmp. */
1195:
1196: extern int current_function_calls_longjmp;
1197:
1198: /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1199:
1200: extern int all_types_permanent;
1201:
1202: /* Pointer to function to compute the name to use to print a declaration. */
1203:
1204: extern char *(*decl_printable_name) ();
1205:
1206: /* In expmed.c */
1207: extern tree make_tree ();
1208:
1209: /* In stmt.c */
1210:
1211: extern tree expand_start_stmt_expr ();
1212: extern tree expand_end_stmt_expr ();
1213: extern void expand_expr_stmt (), clear_last_expr ();
1214: extern void expand_label (), expand_goto (), expand_asm ();
1215: extern void expand_start_cond (), expand_end_cond ();
1216: extern void expand_start_else (), expand_start_elseif ();
1217: extern struct nesting *expand_start_loop ();
1218: extern struct nesting *expand_start_loop_continue_elsewhere ();
1219: extern void expand_loop_continue_here ();
1220: extern void expand_end_loop ();
1221: extern int expand_continue_loop ();
1222: extern int expand_exit_loop (), expand_exit_loop_if_false ();
1223: extern int expand_exit_something ();
1224:
1225: extern void expand_start_delayed_expr ();
1226: extern tree expand_end_delayed_expr ();
1227: extern void expand_emit_delayed_expr ();
1228:
1229: extern void expand_null_return (), expand_return ();
1230: extern void expand_start_bindings (), expand_end_bindings ();
1231: extern tree last_cleanup_this_contour ();
1232: extern void expand_start_case (), expand_end_case ();
1233: extern int pushcase (), pushcase_range ();
1234: extern void expand_start_function (), expand_end_function ();
1235:
1236: /* In fold-const.c */
1237:
1238: extern tree invert_truthvalue ();
1239:
1240: /* The language front-end must define these functions. */
1241:
1242: /* Function of no arguments for initializing lexical scanning. */
1243: extern void init_lex ();
1244: /* Function of no arguments for initializing the symbol table. */
1245: extern void init_decl_processing ();
1246:
1247: /* Functions called with no arguments at the beginning and end or processing
1248: the input source file. */
1249: extern void lang_init ();
1250: extern void lang_finish ();
1251:
1252: /* Function called with no arguments to parse and compile the input. */
1253: extern int yyparse ();
1254: /* Function called with option as argument
1255: to decode options starting with -f or -W or +.
1256: It should return nonzero if it handles the option. */
1257: extern int lang_decode_option ();
1258:
1259: /* Functions for processing symbol declarations. */
1260: /* Function to enter a new lexical scope.
1261: Takes one argument: always zero when called from outside the front end. */
1262: extern void pushlevel ();
1263: /* Function to exit a lexical scope. It returns a BINDING for that scope.
1264: Takes three arguments:
1265: KEEP -- nonzero if there were declarations in this scope.
1266: REVERSE -- reverse the order of decls before returning them.
1267: FUNCTIONBODY -- nonzero if this level is the body of a function. */
1268: extern tree poplevel ();
1269: /* Function to add a decl to the current scope level.
1270: Takes one argument, a decl to add.
1271: Returns that decl, or, if the same symbol is already declared, may
1272: return a different decl for that name. */
1273: extern tree pushdecl ();
1274: /* Function to return the chain of decls so far in the current scope level. */
1275: extern tree getdecls ();
1276: /* Function to return the chain of structure tags in the current scope level. */
1277: extern tree gettags ();
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.