]>
Commit | Line | Data |
---|---|---|
8da1b058 | 1 | /* Front-end tree definitions for GNU compiler. |
41109364 | 2 | Copyright (C) 1989, 1993, 1994 Free Software Foundation, Inc. |
8da1b058 RS |
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 | ||
d6b12657 RK |
22 | #ifndef RTX_CODE |
23 | struct rtx_def; | |
24 | #endif | |
25 | ||
26 | /* Codes of tree nodes */ | |
8da1b058 RS |
27 | |
28 | #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, | |
29 | ||
30 | enum tree_code { | |
31 | #include "tree.def" | |
32 | ||
6dc42e49 | 33 | LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for |
8da1b058 RS |
34 | NUM_TREE_CODE. */ |
35 | }; | |
36 | ||
37 | #undef DEFTREECODE | |
38 | ||
39 | /* Number of tree codes. */ | |
40 | #define NUM_TREE_CODES ((int)LAST_AND_UNUSED_TREE_CODE) | |
41 | ||
42 | /* Indexed by enum tree_code, contains a character which is | |
43 | `<' for a comparison expression, `1', for a unary arithmetic | |
44 | expression, `2' for a binary arithmetic expression, `e' for | |
45 | other types of expressions, `r' for a reference, `c' for a | |
46 | constant, `d' for a decl, `t' for a type, `s' for a statement, | |
47 | and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */ | |
48 | ||
49 | extern char **tree_code_type; | |
50 | #define TREE_CODE_CLASS(CODE) (*tree_code_type[(int) (CODE)]) | |
51 | ||
52 | /* Number of argument-words in each kind of tree-node. */ | |
53 | ||
54 | extern int *tree_code_length; | |
55 | ||
56 | /* Names of tree components. */ | |
57 | ||
58 | extern char **tree_code_name; | |
59 | \f | |
60 | /* Codes that identify the various built in functions | |
61 | so that expand_call can identify them quickly. */ | |
62 | ||
63 | enum built_in_function | |
64 | { | |
65 | NOT_BUILT_IN, | |
66 | BUILT_IN_ALLOCA, | |
67 | BUILT_IN_ABS, | |
68 | BUILT_IN_FABS, | |
69 | BUILT_IN_LABS, | |
70 | BUILT_IN_FFS, | |
71 | BUILT_IN_DIV, | |
72 | BUILT_IN_LDIV, | |
73 | BUILT_IN_FFLOOR, | |
74 | BUILT_IN_FCEIL, | |
75 | BUILT_IN_FMOD, | |
76 | BUILT_IN_FREM, | |
77 | BUILT_IN_MEMCPY, | |
78 | BUILT_IN_MEMCMP, | |
79 | BUILT_IN_MEMSET, | |
80 | BUILT_IN_STRCPY, | |
81 | BUILT_IN_STRCMP, | |
82 | BUILT_IN_STRLEN, | |
83 | BUILT_IN_FSQRT, | |
a1ee10a4 JVA |
84 | BUILT_IN_SIN, |
85 | BUILT_IN_COS, | |
8da1b058 RS |
86 | BUILT_IN_GETEXP, |
87 | BUILT_IN_GETMAN, | |
88 | BUILT_IN_SAVEREGS, | |
89 | BUILT_IN_CLASSIFY_TYPE, | |
90 | BUILT_IN_NEXT_ARG, | |
91 | BUILT_IN_ARGS_INFO, | |
92 | BUILT_IN_CONSTANT_P, | |
93 | BUILT_IN_FRAME_ADDRESS, | |
94 | BUILT_IN_RETURN_ADDRESS, | |
95 | BUILT_IN_CALLER_RETURN_ADDRESS, | |
7f11e158 TW |
96 | BUILT_IN_APPLY_ARGS, |
97 | BUILT_IN_APPLY, | |
98 | BUILT_IN_RETURN, | |
8da1b058 RS |
99 | |
100 | /* C++ extensions */ | |
101 | BUILT_IN_NEW, | |
102 | BUILT_IN_VEC_NEW, | |
103 | BUILT_IN_DELETE, | |
972ded9c RS |
104 | BUILT_IN_VEC_DELETE, |
105 | ||
106 | /* Upper bound on non-language-specific builtins. */ | |
107 | END_BUILTINS | |
8da1b058 RS |
108 | }; |
109 | \f | |
110 | /* The definition of tree nodes fills the next several pages. */ | |
111 | ||
112 | /* A tree node can represent a data type, a variable, an expression | |
113 | or a statement. Each node has a TREE_CODE which says what kind of | |
114 | thing it represents. Some common codes are: | |
115 | INTEGER_TYPE -- represents a type of integers. | |
116 | ARRAY_TYPE -- represents a type of pointer. | |
117 | VAR_DECL -- represents a declared variable. | |
118 | INTEGER_CST -- represents a constant integer value. | |
119 | PLUS_EXPR -- represents a sum (an expression). | |
120 | ||
121 | As for the contents of a tree node: there are some fields | |
122 | that all nodes share. Each TREE_CODE has various special-purpose | |
123 | fields as well. The fields of a node are never accessed directly, | |
124 | always through accessor macros. */ | |
125 | ||
126 | /* This type is used everywhere to refer to a tree node. */ | |
127 | ||
128 | typedef union tree_node *tree; | |
129 | ||
8da1b058 RS |
130 | /* Every kind of tree node starts with this structure, |
131 | so all nodes have these fields. | |
132 | ||
133 | See the accessor macros, defined below, for documentation of the fields. */ | |
134 | ||
135 | struct tree_common | |
136 | { | |
137 | union tree_node *chain; | |
138 | union tree_node *type; | |
139 | #ifdef ONLY_INT_FIELDS | |
140 | unsigned int code : 8; | |
141 | #else | |
142 | enum tree_code code : 8; | |
143 | #endif | |
144 | ||
145 | unsigned side_effects_flag : 1; | |
146 | unsigned constant_flag : 1; | |
147 | unsigned permanent_flag : 1; | |
148 | unsigned addressable_flag : 1; | |
149 | unsigned volatile_flag : 1; | |
150 | unsigned readonly_flag : 1; | |
151 | unsigned unsigned_flag : 1; | |
152 | unsigned asm_written_flag: 1; | |
153 | ||
154 | unsigned used_flag : 1; | |
155 | unsigned raises_flag : 1; | |
156 | unsigned static_flag : 1; | |
157 | unsigned public_flag : 1; | |
158 | unsigned private_flag : 1; | |
159 | unsigned protected_flag : 1; | |
160 | ||
161 | unsigned lang_flag_0 : 1; | |
162 | unsigned lang_flag_1 : 1; | |
163 | unsigned lang_flag_2 : 1; | |
164 | unsigned lang_flag_3 : 1; | |
165 | unsigned lang_flag_4 : 1; | |
166 | unsigned lang_flag_5 : 1; | |
167 | unsigned lang_flag_6 : 1; | |
168 | /* There is room for two more flags. */ | |
169 | }; | |
170 | ||
171 | /* Define accessors for the fields that all tree nodes have | |
172 | (though some fields are not used for all kinds of nodes). */ | |
173 | ||
174 | /* The tree-code says what kind of node it is. | |
175 | Codes are defined in tree.def. */ | |
176 | #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code) | |
177 | #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE)) | |
178 | ||
179 | /* In all nodes that are expressions, this is the data type of the expression. | |
180 | In POINTER_TYPE nodes, this is the type that the pointer points to. | |
181 | In ARRAY_TYPE nodes, this is the type of the elements. */ | |
182 | #define TREE_TYPE(NODE) ((NODE)->common.type) | |
183 | ||
184 | /* Nodes are chained together for many purposes. | |
185 | Types are chained together to record them for being output to the debugger | |
186 | (see the function `chain_type'). | |
187 | Decls in the same scope are chained together to record the contents | |
188 | of the scope. | |
189 | Statement nodes for successive statements used to be chained together. | |
190 | Often lists of things are represented by TREE_LIST nodes that | |
191 | are chained together. */ | |
192 | ||
193 | #define TREE_CHAIN(NODE) ((NODE)->common.chain) | |
194 | ||
195 | /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs | |
196 | that don't change the machine mode. */ | |
197 | ||
198 | #define STRIP_NOPS(EXP) \ | |
199 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
200 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
201 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
202 | && (TYPE_MODE (TREE_TYPE (EXP)) \ | |
203 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
204 | (EXP) = TREE_OPERAND (EXP, 0); | |
0fafb45e RS |
205 | |
206 | /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ | |
207 | ||
208 | #define STRIP_TYPE_NOPS(EXP) \ | |
209 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
210 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
211 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
212 | && (TREE_TYPE (EXP) \ | |
213 | == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
214 | (EXP) = TREE_OPERAND (EXP, 0); | |
87291138 RK |
215 | |
216 | /* Nonzero if TYPE represents an integral type. Note that we do not | |
217 | include COMPLEX types here. */ | |
218 | ||
219 | #define INTEGRAL_TYPE_P(TYPE) \ | |
220 | (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \ | |
221 | || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE) | |
222 | ||
223 | /* Nonzero if TYPE represents a floating-point type, including complex | |
224 | floating-point types. */ | |
225 | ||
226 | #define FLOAT_TYPE_P(TYPE) \ | |
227 | (TREE_CODE (TYPE) == REAL_TYPE \ | |
228 | || (TREE_CODE (TYPE) == COMPLEX_TYPE \ | |
229 | && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)) | |
947765f9 PB |
230 | |
231 | /* Nonzero if TYPE represents an aggregate (multi-component) type. */ | |
232 | ||
233 | #define AGGREGATE_TYPE_P(TYPE) \ | |
234 | (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \ | |
235 | || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \ | |
236 | || TREE_CODE (TYPE) == SET_TYPE) | |
9e6cfc43 JM |
237 | |
238 | /* Nonzero if TYPE represents a pointer type. */ | |
239 | ||
240 | #define POINTER_TYPE_P(TYPE) \ | |
241 | (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) | |
8da1b058 RS |
242 | \f |
243 | /* Define many boolean fields that all tree nodes have. */ | |
244 | ||
245 | /* In VAR_DECL nodes, nonzero means address of this is needed. | |
246 | So it cannot be in a register. | |
247 | In a FUNCTION_DECL, nonzero means its address is needed. | |
248 | So it must be compiled even if it is an inline function. | |
249 | In CONSTRUCTOR nodes, it means object constructed must be in memory. | |
250 | In LABEL_DECL nodes, it means a goto for this label has been seen | |
251 | from a place outside all binding contours that restore stack levels. | |
252 | In ..._TYPE nodes, it means that objects of this type must | |
253 | be fully addressable. This means that pieces of this | |
254 | object cannot go into register parameters, for example. | |
255 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
256 | had its address taken. That matters for inline functions. */ | |
257 | #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag) | |
258 | ||
259 | /* In a VAR_DECL, nonzero means allocate static storage. | |
9f86614b | 260 | In a FUNCTION_DECL, nonzero if function has been defined. |
8da1b058 RS |
261 | In a CONSTRUCTOR, nonzero means allocate static storage. */ |
262 | #define TREE_STATIC(NODE) ((NODE)->common.static_flag) | |
263 | ||
248c0f74 JM |
264 | /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was |
265 | made implicitly and should not lead to an "unused value" warning. */ | |
8da1b058 RS |
266 | #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag) |
267 | ||
268 | /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation | |
269 | chain is via a `virtual' declaration. */ | |
270 | #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag) | |
271 | ||
ae202b56 RK |
272 | /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an |
273 | overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C | |
274 | requires a diagnostic when overflows occur in constant expressions. */ | |
261450e8 PE |
275 | #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag) |
276 | ||
d3568529 JM |
277 | /* In an IDENTIFIER_NODE, this means that assemble_name was called with |
278 | this string as an argument. */ | |
279 | #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag) | |
280 | ||
ae202b56 RK |
281 | /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an |
282 | overflow in folding, and no warning has been issued for this subexpression. | |
261450e8 PE |
283 | TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */ |
284 | #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag) | |
285 | ||
8da1b058 RS |
286 | /* In a VAR_DECL or FUNCTION_DECL, |
287 | nonzero means name is to be accessible from outside this module. | |
858a47b1 | 288 | In an identifier node, nonzero means an external declaration |
6dc42e49 | 289 | accessible from outside this module was previously seen |
8da1b058 RS |
290 | for this name in an inner scope. */ |
291 | #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag) | |
292 | ||
293 | /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the | |
294 | base class is via a `public' declaration, which preserves public | |
295 | fields from the base class as public. */ | |
296 | #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag) | |
297 | ||
9e5386db MS |
298 | /* Ditto, for `private' declarations. */ |
299 | #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag) | |
300 | ||
301 | /* Nonzero for TREE_LIST node means that the path to the | |
302 | base class is via a `protected' declaration, which preserves | |
303 | protected fields from the base class as protected. | |
304 | OVERLOADED. */ | |
026380ff | 305 | #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag) |
9e5386db | 306 | |
8da1b058 RS |
307 | /* In any expression, nonzero means it has side effects or reevaluation |
308 | of the whole expression could produce a different value. | |
309 | This is set if any subexpression is a function call, a side effect | |
310 | or a reference to a volatile variable. | |
311 | In a ..._DECL, this is set only if the declaration said `volatile'. */ | |
312 | #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag) | |
313 | ||
314 | /* Nonzero means this expression is volatile in the C sense: | |
315 | its address should be of type `volatile WHATEVER *'. | |
316 | In other words, the declared item is volatile qualified. | |
317 | This is used in _DECL nodes and _REF nodes. | |
318 | ||
319 | In a ..._TYPE node, means this type is volatile-qualified. | |
320 | But use TYPE_VOLATILE instead of this macro when the node is a type, | |
321 | because eventually we may make that a different bit. | |
322 | ||
323 | If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ | |
324 | #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag) | |
325 | ||
326 | /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, | |
327 | nonzero means it may not be the lhs of an assignment. | |
328 | In a ..._TYPE node, means this type is const-qualified | |
329 | (but the macro TYPE_READONLY should be used instead of this macro | |
330 | when the node is a type). */ | |
331 | #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag) | |
332 | ||
333 | /* Value of expression is constant. | |
334 | Always appears in all ..._CST nodes. | |
335 | May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR | |
336 | if the value is constant. */ | |
337 | #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag) | |
338 | ||
339 | /* Nonzero means permanent node; | |
340 | node will continue to exist for the entire compiler run. | |
341 | Otherwise it will be recycled at the end of the function. */ | |
342 | #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag) | |
343 | ||
344 | /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type. | |
345 | In FIELD_DECL nodes, means an unsigned bit field. | |
346 | The same bit is used in functions as DECL_BUILT_IN_NONANSI. */ | |
347 | #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag) | |
348 | ||
349 | /* Nonzero in a VAR_DECL means assembler code has been written. | |
350 | Nonzero in a FUNCTION_DECL means that the function has been compiled. | |
351 | This is interesting in an inline function, since it might not need | |
352 | to be compiled separately. | |
3635a54b | 353 | Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE |
9f86614b RS |
354 | if the sdb debugging info for the type has been written. |
355 | In a BLOCK node, nonzero if reorder_blocks has already seen this block. */ | |
8da1b058 RS |
356 | #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag) |
357 | ||
358 | /* Nonzero in a _DECL if the name is used in its scope. | |
359 | Nonzero in an expr node means inhibit warning if value is unused. | |
360 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
361 | was used. */ | |
362 | #define TREE_USED(NODE) ((NODE)->common.used_flag) | |
363 | ||
364 | /* Nonzero for a tree node whose evaluation could result | |
365 | in the raising of an exception. Not implemented yet. */ | |
366 | #define TREE_RAISES(NODE) ((NODE)->common.raises_flag) | |
367 | ||
9f86614b | 368 | /* Used in classes in C++. */ |
8da1b058 | 369 | #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag) |
9f86614b RS |
370 | /* Used in classes in C++. |
371 | In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */ | |
8da1b058 RS |
372 | #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag) |
373 | ||
9f86614b | 374 | /* These flags are available for each language front end to use internally. */ |
8da1b058 RS |
375 | #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0) |
376 | #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1) | |
377 | #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2) | |
378 | #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3) | |
379 | #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4) | |
380 | #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5) | |
381 | #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6) | |
382 | \f | |
383 | /* Define additional fields and accessors for nodes representing constants. */ | |
384 | ||
e5d70561 RK |
385 | /* In an INTEGER_CST node. These two together make a 2-word integer. |
386 | If the data type is signed, the value is sign-extended to 2 words | |
8da1b058 | 387 | even though not all of them may really be in use. |
e5d70561 | 388 | In an unsigned constant shorter than 2 words, the extra bits are 0. */ |
8da1b058 RS |
389 | #define TREE_INT_CST_LOW(NODE) ((NODE)->int_cst.int_cst_low) |
390 | #define TREE_INT_CST_HIGH(NODE) ((NODE)->int_cst.int_cst_high) | |
391 | ||
392 | #define INT_CST_LT(A, B) \ | |
393 | (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ | |
394 | || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ | |
e5d70561 RK |
395 | && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \ |
396 | < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))) | |
8da1b058 RS |
397 | |
398 | #define INT_CST_LT_UNSIGNED(A, B) \ | |
e5d70561 RK |
399 | (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ |
400 | < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ | |
401 | || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
402 | == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \ | |
403 | && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \ | |
404 | < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))) | |
8da1b058 RS |
405 | |
406 | struct tree_int_cst | |
407 | { | |
408 | char common[sizeof (struct tree_common)]; | |
e5d70561 RK |
409 | HOST_WIDE_INT int_cst_low; |
410 | HOST_WIDE_INT int_cst_high; | |
8da1b058 RS |
411 | }; |
412 | ||
413 | /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes, | |
414 | and generally in all kinds of constants that could | |
415 | be given labels (rather than being immediate). */ | |
416 | ||
417 | #define TREE_CST_RTL(NODE) ((NODE)->real_cst.rtl) | |
418 | ||
419 | /* In a REAL_CST node. */ | |
420 | /* We can represent a real value as either a `double' or a string. | |
421 | Strings don't allow for any optimization, but they do allow | |
422 | for cross-compilation. */ | |
423 | ||
424 | #define TREE_REAL_CST(NODE) ((NODE)->real_cst.real_cst) | |
425 | ||
426 | #include "real.h" | |
427 | ||
428 | struct tree_real_cst | |
429 | { | |
430 | char common[sizeof (struct tree_common)]; | |
431 | struct rtx_def *rtl; /* acts as link to register transfer language | |
432 | (rtl) info */ | |
433 | REAL_VALUE_TYPE real_cst; | |
434 | }; | |
435 | ||
436 | /* In a STRING_CST */ | |
437 | #define TREE_STRING_LENGTH(NODE) ((NODE)->string.length) | |
438 | #define TREE_STRING_POINTER(NODE) ((NODE)->string.pointer) | |
439 | ||
440 | struct tree_string | |
441 | { | |
442 | char common[sizeof (struct tree_common)]; | |
443 | struct rtx_def *rtl; /* acts as link to register transfer language | |
444 | (rtl) info */ | |
445 | int length; | |
446 | char *pointer; | |
447 | }; | |
448 | ||
449 | /* In a COMPLEX_CST node. */ | |
450 | #define TREE_REALPART(NODE) ((NODE)->complex.real) | |
451 | #define TREE_IMAGPART(NODE) ((NODE)->complex.imag) | |
452 | ||
453 | struct tree_complex | |
454 | { | |
455 | char common[sizeof (struct tree_common)]; | |
456 | struct rtx_def *rtl; /* acts as link to register transfer language | |
457 | (rtl) info */ | |
458 | union tree_node *real; | |
459 | union tree_node *imag; | |
460 | }; | |
461 | \f | |
462 | /* Define fields and accessors for some special-purpose tree nodes. */ | |
463 | ||
464 | #define IDENTIFIER_LENGTH(NODE) ((NODE)->identifier.length) | |
465 | #define IDENTIFIER_POINTER(NODE) ((NODE)->identifier.pointer) | |
8da1b058 RS |
466 | |
467 | struct tree_identifier | |
468 | { | |
469 | char common[sizeof (struct tree_common)]; | |
470 | int length; | |
471 | char *pointer; | |
472 | }; | |
473 | ||
474 | /* In a TREE_LIST node. */ | |
475 | #define TREE_PURPOSE(NODE) ((NODE)->list.purpose) | |
476 | #define TREE_VALUE(NODE) ((NODE)->list.value) | |
477 | ||
478 | struct tree_list | |
479 | { | |
480 | char common[sizeof (struct tree_common)]; | |
481 | union tree_node *purpose; | |
482 | union tree_node *value; | |
483 | }; | |
484 | ||
485 | /* In a TREE_VEC node. */ | |
486 | #define TREE_VEC_LENGTH(NODE) ((NODE)->vec.length) | |
487 | #define TREE_VEC_ELT(NODE,I) ((NODE)->vec.a[I]) | |
488 | #define TREE_VEC_END(NODE) (&((NODE)->vec.a[(NODE)->vec.length])) | |
489 | ||
490 | struct tree_vec | |
491 | { | |
492 | char common[sizeof (struct tree_common)]; | |
493 | int length; | |
494 | union tree_node *a[1]; | |
495 | }; | |
496 | ||
497 | /* Define fields and accessors for some nodes that represent expressions. */ | |
498 | ||
499 | /* In a SAVE_EXPR node. */ | |
500 | #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1) | |
501 | #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2]) | |
502 | ||
503 | /* In a RTL_EXPR node. */ | |
504 | #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[0]) | |
505 | #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[1]) | |
506 | ||
507 | /* In a CALL_EXPR node. */ | |
508 | #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &(NODE)->exp.operands[2]) | |
509 | ||
510 | /* In a CONSTRUCTOR node. */ | |
511 | #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1) | |
512 | ||
61131fa2 RS |
513 | /* In ordinary expression nodes. */ |
514 | #define TREE_OPERAND(NODE, I) ((NODE)->exp.operands[I]) | |
515 | #define TREE_COMPLEXITY(NODE) ((NODE)->exp.complexity) | |
516 | ||
517 | struct tree_exp | |
518 | { | |
519 | char common[sizeof (struct tree_common)]; | |
520 | int complexity; | |
521 | union tree_node *operands[1]; | |
522 | }; | |
523 | \f | |
8da1b058 | 524 | /* In a BLOCK node. */ |
61131fa2 RS |
525 | #define BLOCK_VARS(NODE) ((NODE)->block.vars) |
526 | #define BLOCK_TYPE_TAGS(NODE) ((NODE)->block.type_tags) | |
527 | #define BLOCK_SUBBLOCKS(NODE) ((NODE)->block.subblocks) | |
528 | #define BLOCK_SUPERCONTEXT(NODE) ((NODE)->block.supercontext) | |
8da1b058 RS |
529 | /* Note: when changing this, make sure to find the places |
530 | that use chainon or nreverse. */ | |
531 | #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE) | |
61131fa2 RS |
532 | #define BLOCK_ABSTRACT_ORIGIN(NODE) ((NODE)->block.abstract_origin) |
533 | #define BLOCK_ABSTRACT(NODE) ((NODE)->block.abstract_flag) | |
5b3f0db1 | 534 | #define BLOCK_END_NOTE(NODE) ((NODE)->block.end_note) |
8da1b058 RS |
535 | |
536 | /* Nonzero means that this block is prepared to handle exceptions | |
537 | listed in the BLOCK_VARS slot. */ | |
61131fa2 | 538 | #define BLOCK_HANDLER_BLOCK(NODE) ((NODE)->block.handler_block_flag) |
8da1b058 | 539 | |
61131fa2 | 540 | struct tree_block |
8da1b058 RS |
541 | { |
542 | char common[sizeof (struct tree_common)]; | |
61131fa2 RS |
543 | |
544 | unsigned handler_block_flag : 1; | |
545 | unsigned abstract_flag : 1; | |
546 | ||
547 | union tree_node *vars; | |
548 | union tree_node *type_tags; | |
549 | union tree_node *subblocks; | |
550 | union tree_node *supercontext; | |
551 | union tree_node *abstract_origin; | |
5b3f0db1 | 552 | struct rtx_def *end_note; |
8da1b058 RS |
553 | }; |
554 | \f | |
555 | /* Define fields and accessors for nodes representing data types. */ | |
556 | ||
557 | /* See tree.def for documentation of the use of these fields. | |
558 | Look at the documentation of the various ..._TYPE tree codes. */ | |
559 | ||
560 | #define TYPE_UID(NODE) ((NODE)->type.uid) | |
561 | #define TYPE_SIZE(NODE) ((NODE)->type.size) | |
562 | #define TYPE_MODE(NODE) ((NODE)->type.mode) | |
8da1b058 RS |
563 | #define TYPE_VALUES(NODE) ((NODE)->type.values) |
564 | #define TYPE_DOMAIN(NODE) ((NODE)->type.values) | |
565 | #define TYPE_FIELDS(NODE) ((NODE)->type.values) | |
566 | #define TYPE_METHODS(NODE) ((NODE)->type.maxval) | |
567 | #define TYPE_VFIELD(NODE) ((NODE)->type.minval) | |
568 | #define TYPE_ARG_TYPES(NODE) ((NODE)->type.values) | |
569 | #define TYPE_METHOD_BASETYPE(NODE) ((NODE)->type.maxval) | |
570 | #define TYPE_OFFSET_BASETYPE(NODE) ((NODE)->type.maxval) | |
571 | #define TYPE_POINTER_TO(NODE) ((NODE)->type.pointer_to) | |
572 | #define TYPE_REFERENCE_TO(NODE) ((NODE)->type.reference_to) | |
573 | #define TYPE_MIN_VALUE(NODE) ((NODE)->type.minval) | |
574 | #define TYPE_MAX_VALUE(NODE) ((NODE)->type.maxval) | |
575 | #define TYPE_PRECISION(NODE) ((NODE)->type.precision) | |
576 | #define TYPE_PARSE_INFO(NODE) ((NODE)->type.parse_info) | |
a0665b77 RK |
577 | #define TYPE_SYMTAB_ADDRESS(NODE) ((NODE)->type.symtab.address) |
578 | #define TYPE_SYMTAB_POINTER(NODE) ((NODE)->type.symtab.pointer) | |
8da1b058 RS |
579 | #define TYPE_NAME(NODE) ((NODE)->type.name) |
580 | #define TYPE_NEXT_VARIANT(NODE) ((NODE)->type.next_variant) | |
581 | #define TYPE_MAIN_VARIANT(NODE) ((NODE)->type.main_variant) | |
582 | #define TYPE_BINFO(NODE) ((NODE)->type.binfo) | |
583 | #define TYPE_NONCOPIED_PARTS(NODE) ((NODE)->type.noncopied_parts) | |
584 | #define TYPE_CONTEXT(NODE) ((NODE)->type.context) | |
b20e883e | 585 | #define TYPE_OBSTACK(NODE) ((NODE)->type.obstack) |
8da1b058 RS |
586 | #define TYPE_LANG_SPECIFIC(NODE) ((NODE)->type.lang_specific) |
587 | ||
bad1b4ba RK |
588 | /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply |
589 | to this type. */ | |
590 | #define TYPE_ATTRIBUTES(NODE) ((NODE)->type.attributes) | |
591 | ||
869637e6 RS |
592 | /* The alignment necessary for objects of this type. |
593 | The value is an int, measured in bits. */ | |
594 | #define TYPE_ALIGN(NODE) ((NODE)->type.align) | |
595 | ||
8da1b058 RS |
596 | #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE)) |
597 | ||
3635a54b RK |
598 | /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type |
599 | has BLKmode only because it lacks the alignment requirement for | |
600 | its size. */ | |
8da1b058 RS |
601 | #define TYPE_NO_FORCE_BLK(NODE) ((NODE)->type.no_force_blk_flag) |
602 | ||
603 | /* Nonzero in a type considered volatile as a whole. */ | |
604 | #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag) | |
605 | ||
606 | /* Means this type is const-qualified. */ | |
607 | #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag) | |
608 | ||
9f86614b | 609 | /* These flags are available for each language front end to use internally. */ |
8da1b058 RS |
610 | #define TYPE_LANG_FLAG_0(NODE) ((NODE)->type.lang_flag_0) |
611 | #define TYPE_LANG_FLAG_1(NODE) ((NODE)->type.lang_flag_1) | |
612 | #define TYPE_LANG_FLAG_2(NODE) ((NODE)->type.lang_flag_2) | |
613 | #define TYPE_LANG_FLAG_3(NODE) ((NODE)->type.lang_flag_3) | |
614 | #define TYPE_LANG_FLAG_4(NODE) ((NODE)->type.lang_flag_4) | |
615 | #define TYPE_LANG_FLAG_5(NODE) ((NODE)->type.lang_flag_5) | |
616 | #define TYPE_LANG_FLAG_6(NODE) ((NODE)->type.lang_flag_6) | |
617 | ||
74a3fd26 PB |
618 | /* If set in an ARRAY_TYPE, indicates a string type (for languages |
619 | that distinguish string from array of char). | |
620 | If set in a SET_TYPE, indicates a bitstring type. */ | |
621 | #define TYPE_STRING_FLAG(NODE) ((NODE)->type.string_flag) | |
622 | ||
4ac3d994 JM |
623 | /* Indicates that objects of this type must be initialized by calling a |
624 | function when they are created. */ | |
625 | #define TYPE_NEEDS_CONSTRUCTING(NODE) ((NODE)->type.needs_constructing_flag) | |
626 | ||
adb23061 RK |
627 | /* Indicates that objects of this type (a UNION_TYPE), should be passed |
628 | the same way that the first union alternative would be passed. */ | |
629 | #define TYPE_TRANSPARENT_UNION(NODE) ((NODE)->type.transparent_union_flag) | |
630 | ||
8da1b058 RS |
631 | struct tree_type |
632 | { | |
633 | char common[sizeof (struct tree_common)]; | |
634 | union tree_node *values; | |
635 | union tree_node *size; | |
bad1b4ba | 636 | union tree_node *attributes; |
8da1b058 RS |
637 | unsigned uid; |
638 | ||
bad1b4ba | 639 | unsigned char precision; |
8da1b058 RS |
640 | #ifdef ONLY_INT_FIELDS |
641 | int mode : 8; | |
642 | #else | |
643 | enum machine_mode mode : 8; | |
644 | #endif | |
bad1b4ba | 645 | |
74a3fd26 | 646 | unsigned string_flag : 1; |
8da1b058 | 647 | unsigned no_force_blk_flag : 1; |
4ac3d994 | 648 | unsigned needs_constructing_flag : 1; |
adb23061 | 649 | unsigned transparent_union_flag : 1; |
8da1b058 RS |
650 | unsigned lang_flag_0 : 1; |
651 | unsigned lang_flag_1 : 1; | |
652 | unsigned lang_flag_2 : 1; | |
653 | unsigned lang_flag_3 : 1; | |
654 | unsigned lang_flag_4 : 1; | |
655 | unsigned lang_flag_5 : 1; | |
656 | unsigned lang_flag_6 : 1; | |
adb23061 | 657 | /* room for 5 more bits */ |
8da1b058 | 658 | |
69b78d8d | 659 | unsigned int align; |
8da1b058 RS |
660 | union tree_node *pointer_to; |
661 | union tree_node *reference_to; | |
662 | int parse_info; | |
a0665b77 | 663 | union {int address; char *pointer; } symtab; |
8da1b058 RS |
664 | union tree_node *name; |
665 | union tree_node *minval; | |
666 | union tree_node *maxval; | |
667 | union tree_node *next_variant; | |
668 | union tree_node *main_variant; | |
669 | union tree_node *binfo; | |
670 | union tree_node *noncopied_parts; | |
671 | union tree_node *context; | |
b20e883e | 672 | struct obstack *obstack; |
8da1b058 RS |
673 | /* Points to a structure whose details depend on the language in use. */ |
674 | struct lang_type *lang_specific; | |
675 | }; | |
676 | \f | |
677 | /* Define accessor macros for information about type inheritance | |
678 | and basetypes. | |
679 | ||
680 | A "basetype" means a particular usage of a data type for inheritance | |
681 | in another type. Each such basetype usage has its own "binfo" | |
682 | object to describe it. The binfo object is a TREE_VEC node. | |
683 | ||
684 | Inheritance is represented by the binfo nodes allocated for a | |
685 | given type. For example, given types C and D, such that D is | |
686 | inherited by C, 3 binfo nodes will be allocated: one for describing | |
687 | the binfo properties of C, similarly one for D, and one for | |
688 | describing the binfo properties of D as a base type for C. | |
689 | Thus, given a pointer to class C, one can get a pointer to the binfo | |
690 | of D acting as a basetype for C by looking at C's binfo's basetypes. */ | |
691 | ||
692 | /* The actual data type node being inherited in this basetype. */ | |
693 | #define BINFO_TYPE(NODE) TREE_TYPE (NODE) | |
694 | ||
695 | /* The offset where this basetype appears in its containing type. | |
696 | BINFO_OFFSET slot holds the offset (in bytes) | |
697 | from the base of the complete object to the base of the part of the | |
698 | object that is allocated on behalf of this `type'. | |
699 | This is always 0 except when there is multiple inheritance. */ | |
700 | ||
701 | #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1) | |
702 | #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE)) | |
703 | #define BINFO_OFFSET_ZEROP(NODE) (BINFO_OFFSET (NODE) == integer_zero_node) | |
704 | ||
705 | /* The virtual function table belonging to this basetype. Virtual | |
706 | function tables provide a mechanism for run-time method dispatching. | |
707 | The entries of a virtual function table are language-dependent. */ | |
708 | ||
709 | #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2) | |
710 | #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE)) | |
711 | ||
712 | /* The virtual functions in the virtual function table. This is | |
713 | a TREE_LIST that is used as an initial approximation for building | |
714 | a virtual function table for this basetype. */ | |
715 | #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3) | |
716 | #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE)) | |
717 | ||
718 | /* A vector of additional binfos for the types inherited by this basetype. | |
719 | ||
720 | If this basetype describes type D as inherited in C, | |
721 | and if the basetypes of D are E anf F, | |
722 | then this vector contains binfos for inheritance of E and F by C. | |
723 | ||
724 | ??? This could probably be done by just allocating the | |
725 | base types at the end of this TREE_VEC (instead of using | |
726 | another TREE_VEC). This would simplify the calculation | |
727 | of how many basetypes a given type had. */ | |
728 | #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4) | |
729 | #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4) | |
730 | ||
2cc3ac7a MS |
731 | /* For a BINFO record describing an inheritance, this yields a pointer |
732 | to the artificial FIELD_DECL node which contains the "virtual base | |
733 | class pointer" for the given inheritance. */ | |
734 | ||
735 | #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5) | |
736 | ||
8da1b058 RS |
737 | /* Accessor macro to get to the Nth basetype of this basetype. */ |
738 | #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N)) | |
739 | #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N))) | |
740 | ||
741 | /* Slot used to build a chain that represents a use of inheritance. | |
742 | For example, if X is derived from Y, and Y is derived from Z, | |
743 | then this field can be used to link the binfo node for X to | |
744 | the binfo node for X's Y to represent the use of inheritance | |
745 | from X to Y. Similarly, this slot of the binfo node for X's Y | |
746 | can point to the Z from which Y is inherited (in X's inheritance | |
747 | hierarchy). In this fashion, one can represent and traverse specific | |
748 | uses of inheritance using the binfo nodes themselves (instead of | |
749 | consing new space pointing to binfo nodes). | |
750 | It is up to the language-dependent front-ends to maintain | |
751 | this information as necessary. */ | |
752 | #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0) | |
753 | \f | |
754 | /* Define fields and accessors for nodes representing declared names. */ | |
755 | ||
756 | /* This is the name of the object as written by the user. | |
757 | It is an IDENTIFIER_NODE. */ | |
758 | #define DECL_NAME(NODE) ((NODE)->decl.name) | |
8da1b058 RS |
759 | /* This is the name of the object as the assembler will see it |
760 | (but before any translations made by ASM_OUTPUT_LABELREF). | |
761 | Often this is the same as DECL_NAME. | |
762 | It is an IDENTIFIER_NODE. */ | |
763 | #define DECL_ASSEMBLER_NAME(NODE) ((NODE)->decl.assembler_name) | |
868e8789 DE |
764 | /* Records the section name in a section attribute. Used to pass |
765 | the name from decl_attributes to make_function_rtl and make_decl_rtl. */ | |
766 | #define DECL_SECTION_NAME(NODE) ((NODE)->decl.section_name) | |
9b800101 | 767 | /* For FIELD_DECLs, this is the |
3635a54b RK |
768 | RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is |
769 | a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL, | |
770 | and CONST_DECL nodes, this points to the FUNCTION_DECL for the | |
771 | containing function, or else yields NULL_TREE if the given decl has "file scope". */ | |
8da1b058 RS |
772 | #define DECL_CONTEXT(NODE) ((NODE)->decl.context) |
773 | #define DECL_FIELD_CONTEXT(NODE) ((NODE)->decl.context) | |
774 | /* In a FIELD_DECL, this is the field position, counting in bits, | |
775 | of the bit closest to the beginning of the structure. */ | |
776 | #define DECL_FIELD_BITPOS(NODE) ((NODE)->decl.arguments) | |
777 | /* In a FIELD_DECL, this indicates whether the field was a bit-field and | |
8e148bef RS |
778 | if so, the type that was originally specified for it. |
779 | TREE_TYPE may have been modified (in finish_struct). */ | |
8da1b058 RS |
780 | #define DECL_BIT_FIELD_TYPE(NODE) ((NODE)->decl.result) |
781 | /* In FUNCTION_DECL, a chain of ..._DECL nodes. */ | |
782 | /* VAR_DECL and PARM_DECL reserve the arguments slot | |
783 | for language-specific uses. */ | |
784 | #define DECL_ARGUMENTS(NODE) ((NODE)->decl.arguments) | |
785 | /* In FUNCTION_DECL, holds the decl for the return value. */ | |
786 | #define DECL_RESULT(NODE) ((NODE)->decl.result) | |
787 | /* In PARM_DECL, holds the type as written (perhaps a function or array). */ | |
788 | #define DECL_ARG_TYPE_AS_WRITTEN(NODE) ((NODE)->decl.result) | |
789 | /* For a FUNCTION_DECL, holds the tree of BINDINGs. | |
790 | For a VAR_DECL, holds the initial value. | |
791 | For a PARM_DECL, not used--default | |
792 | values for parameters are encoded in the type of the function, | |
793 | not in the PARM_DECL slot. */ | |
794 | #define DECL_INITIAL(NODE) ((NODE)->decl.initial) | |
795 | /* For a PARM_DECL, records the data type used to pass the argument, | |
796 | which may be different from the type seen in the program. */ | |
797 | #define DECL_ARG_TYPE(NODE) ((NODE)->decl.initial) /* In PARM_DECL. */ | |
3635a54b RK |
798 | /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which |
799 | if nonzero, indicates that the field occupies the type. */ | |
800 | #define DECL_QUALIFIER(NODE) ((NODE)->decl.initial) | |
8da1b058 RS |
801 | /* These two fields describe where in the source code the declaration was. */ |
802 | #define DECL_SOURCE_FILE(NODE) ((NODE)->decl.filename) | |
803 | #define DECL_SOURCE_LINE(NODE) ((NODE)->decl.linenum) | |
804 | /* Holds the size of the datum, as a tree expression. | |
805 | Need not be constant. */ | |
806 | #define DECL_SIZE(NODE) ((NODE)->decl.size) | |
807 | /* Holds the alignment required for the datum. */ | |
73f3c7c3 | 808 | #define DECL_ALIGN(NODE) ((NODE)->decl.frame_size.u) |
17c73321 RK |
809 | /* Holds the machine mode corresponding to the declaration of a variable or |
810 | field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a | |
811 | FIELD_DECL. */ | |
8da1b058 | 812 | #define DECL_MODE(NODE) ((NODE)->decl.mode) |
17c73321 RK |
813 | /* Holds the RTL expression for the value of a variable or function. If |
814 | PROMOTED_MODE is defined, the mode of this expression may not be same | |
815 | as DECL_MODE. In that case, DECL_MODE contains the mode corresponding | |
816 | to the variable's data type, while the mode | |
817 | of DECL_RTL is the mode actually used to contain the data. */ | |
8da1b058 RS |
818 | #define DECL_RTL(NODE) ((NODE)->decl.rtl) |
819 | /* For PARM_DECL, holds an RTL for the stack slot or register | |
820 | where the data was actually passed. */ | |
77f934bb | 821 | #define DECL_INCOMING_RTL(NODE) ((NODE)->decl.saved_insns.r) |
8da1b058 | 822 | /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */ |
77f934bb | 823 | #define DECL_SAVED_INSNS(NODE) ((NODE)->decl.saved_insns.r) |
66321686 RS |
824 | /* For FUNCTION_DECL, if it is inline, |
825 | holds the size of the stack frame, as an integer. */ | |
73f3c7c3 | 826 | #define DECL_FRAME_SIZE(NODE) ((NODE)->decl.frame_size.i) |
66321686 RS |
827 | /* For FUNCTION_DECL, if it is built-in, |
828 | this identifies which built-in operation it is. */ | |
73f3c7c3 RK |
829 | #define DECL_FUNCTION_CODE(NODE) ((NODE)->decl.frame_size.f) |
830 | #define DECL_SET_FUNCTION_CODE(NODE,VAL) ((NODE)->decl.frame_size.f = (VAL)) | |
77f934bb TW |
831 | /* For a FIELD_DECL, holds the size of the member as an integer. */ |
832 | #define DECL_FIELD_SIZE(NODE) ((NODE)->decl.saved_insns.i) | |
8da1b058 RS |
833 | |
834 | /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. | |
835 | Before the struct containing the FUNCTION_DECL is laid out, | |
836 | DECL_VINDEX may point to a FUNCTION_DECL in a base class which | |
837 | is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual | |
838 | function. When the class is laid out, this pointer is changed | |
839 | to an INTEGER_CST node which is suitable for use as an index | |
840 | into the virtual function table. */ | |
841 | #define DECL_VINDEX(NODE) ((NODE)->decl.vindex) | |
842 | /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in | |
843 | which this FIELD_DECL is defined. This information is needed when | |
844 | writing debugging information about vfield and vbase decls for C++. */ | |
845 | #define DECL_FCONTEXT(NODE) ((NODE)->decl.vindex) | |
846 | ||
0e77444b RS |
847 | /* Every ..._DECL node gets a unique number. */ |
848 | #define DECL_UID(NODE) ((NODE)->decl.uid) | |
849 | ||
c5caa350 CH |
850 | /* For any sort of a ..._DECL node, this points to the original (abstract) |
851 | decl node which this decl is an instance of, or else it is NULL indicating | |
852 | that this decl is not an instance of some other decl. */ | |
853 | #define DECL_ABSTRACT_ORIGIN(NODE) ((NODE)->decl.abstract_origin) | |
854 | ||
855 | /* Nonzero for any sort of ..._DECL node means this decl node represents | |
856 | an inline instance of some original (abstract) decl from an inline function; | |
8da1b058 | 857 | suppress any warnings about shadowing some other variable. */ |
c5caa350 | 858 | #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0) |
8da1b058 RS |
859 | |
860 | /* Nonzero if a _DECL means that the name of this decl should be ignored | |
861 | for symbolic debug purposes. */ | |
862 | #define DECL_IGNORED_P(NODE) ((NODE)->decl.ignored_flag) | |
863 | ||
c5caa350 CH |
864 | /* Nonzero for a given ..._DECL node means that this node represents an |
865 | "abstract instance" of the given declaration (e.g. in the original | |
866 | declaration of an inline function). When generating symbolic debugging | |
867 | information, we musn't try to generate any address information for nodes | |
868 | marked as "abstract instances" because we don't actually generate | |
869 | any code or allocate any data space for such instances. */ | |
870 | #define DECL_ABSTRACT(NODE) ((NODE)->decl.abstract_flag) | |
871 | ||
3110a56e RS |
872 | /* Nonzero if a _DECL means that no warnings should be generated just |
873 | because this decl is unused. */ | |
874 | #define DECL_IN_SYSTEM_HEADER(NODE) ((NODE)->decl.in_system_header_flag) | |
875 | ||
2c0d84d6 MS |
876 | /* Nonzero for a given ..._DECL node means that this node should be |
877 | put in .common, if possible. If a DECL_INITIAL is given, and it | |
878 | is not error_mark_node, then the decl cannot be put in .common. */ | |
879 | #define DECL_COMMON(NODE) ((NODE)->decl.common_flag) | |
880 | ||
3110a56e | 881 | /* Language-specific decl information. */ |
8da1b058 RS |
882 | #define DECL_LANG_SPECIFIC(NODE) ((NODE)->decl.lang_specific) |
883 | ||
884 | /* In a VAR_DECL or FUNCTION_DECL, | |
885 | nonzero means external reference: | |
886 | do not allocate storage, and refer to a definition elsewhere. */ | |
1394aabd | 887 | #define DECL_EXTERNAL(NODE) ((NODE)->decl.external_flag) |
8da1b058 | 888 | |
60e9e4b7 DE |
889 | /* In a TYPE_DECL |
890 | nonzero means the detail info about this type is not dumped into stabs. | |
5a783256 | 891 | Instead it will generate cross reference ('x') of names. |
60e9e4b7 DE |
892 | This uses the same flag as DECL_EXTERNAL. */ |
893 | #define TYPE_DECL_SUPPRESS_DEBUG(NODE) ((NODE)->decl.external_flag) | |
894 | ||
895 | ||
8da1b058 RS |
896 | /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. |
897 | In LABEL_DECL nodes, nonzero means that an error message about | |
898 | jumping into such a binding contour has been printed for this label. */ | |
1394aabd | 899 | #define DECL_REGISTER(NODE) ((NODE)->decl.regdecl_flag) |
5a1c7968 RS |
900 | /* In a FIELD_DECL, indicates this field should be bit-packed. */ |
901 | #define DECL_PACKED(NODE) ((NODE)->decl.regdecl_flag) | |
8da1b058 RS |
902 | |
903 | /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. | |
904 | For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. | |
905 | ||
906 | For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. | |
907 | ||
908 | Also set in some languages for variables, etc., outside the normal | |
909 | lexical scope, such as class instance variables. */ | |
1394aabd | 910 | #define DECL_NONLOCAL(NODE) ((NODE)->decl.nonlocal_flag) |
8da1b058 RS |
911 | |
912 | /* Nonzero in a FUNCTION_DECL means this function can be substituted | |
913 | where it is called. */ | |
1394aabd | 914 | #define DECL_INLINE(NODE) ((NODE)->decl.inline_flag) |
8da1b058 RS |
915 | |
916 | /* Nonzero in a FUNCTION_DECL means this is a built-in function | |
917 | that is not specified by ansi C and that users are supposed to be allowed | |
918 | to redefine for any purpose whatever. */ | |
919 | #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag) | |
920 | ||
921 | /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed | |
922 | specially. */ | |
923 | #define DECL_BIT_FIELD(NODE) ((NODE)->decl.bit_field_flag) | |
924 | /* In a LABEL_DECL, nonzero means label was defined inside a binding | |
925 | contour that restored a stack level and which is now exited. */ | |
926 | #define DECL_TOO_LATE(NODE) ((NODE)->decl.bit_field_flag) | |
927 | /* In a FUNCTION_DECL, nonzero means a built in function. */ | |
928 | #define DECL_BUILT_IN(NODE) ((NODE)->decl.bit_field_flag) | |
b8af45d0 RS |
929 | /* In a VAR_DECL that's static, |
930 | nonzero if the space is in the text section. */ | |
931 | #define DECL_IN_TEXT_SECTION(NODE) ((NODE)->decl.bit_field_flag) | |
8da1b058 | 932 | |
5a1c7968 RS |
933 | /* Used in VAR_DECLs to indicate that the variable is a vtable. |
934 | It is also used in FIELD_DECLs for vtable pointers. */ | |
8da1b058 | 935 | #define DECL_VIRTUAL_P(NODE) ((NODE)->decl.virtual_flag) |
8da1b058 | 936 | |
30801830 JM |
937 | /* Used to indicate that the linkage status of this DECL is not yet known, |
938 | so it should not be output now. */ | |
939 | #define DECL_DEFER_OUTPUT(NODE) ((NODE)->decl.defer_output) | |
940 | ||
adb23061 RK |
941 | /* Used in PARM_DECLs whose type are unions to indicate that the |
942 | argument should be passed in the same way that the first union | |
943 | alternative would be passed. */ | |
944 | #define DECL_TRANSPARENT_UNION(NODE) ((NODE)->decl.transparent_union) | |
945 | ||
8da1b058 RS |
946 | /* Additional flags for language-specific uses. */ |
947 | #define DECL_LANG_FLAG_0(NODE) ((NODE)->decl.lang_flag_0) | |
948 | #define DECL_LANG_FLAG_1(NODE) ((NODE)->decl.lang_flag_1) | |
949 | #define DECL_LANG_FLAG_2(NODE) ((NODE)->decl.lang_flag_2) | |
950 | #define DECL_LANG_FLAG_3(NODE) ((NODE)->decl.lang_flag_3) | |
951 | #define DECL_LANG_FLAG_4(NODE) ((NODE)->decl.lang_flag_4) | |
952 | #define DECL_LANG_FLAG_5(NODE) ((NODE)->decl.lang_flag_5) | |
953 | #define DECL_LANG_FLAG_6(NODE) ((NODE)->decl.lang_flag_6) | |
954 | #define DECL_LANG_FLAG_7(NODE) ((NODE)->decl.lang_flag_7) | |
955 | ||
956 | struct tree_decl | |
957 | { | |
958 | char common[sizeof (struct tree_common)]; | |
959 | char *filename; | |
960 | int linenum; | |
961 | union tree_node *size; | |
0e77444b | 962 | unsigned int uid; |
8da1b058 RS |
963 | #ifdef ONLY_INT_FIELDS |
964 | int mode : 8; | |
965 | #else | |
966 | enum machine_mode mode : 8; | |
967 | #endif | |
8da1b058 RS |
968 | |
969 | unsigned external_flag : 1; | |
970 | unsigned nonlocal_flag : 1; | |
971 | unsigned regdecl_flag : 1; | |
972 | unsigned inline_flag : 1; | |
973 | unsigned bit_field_flag : 1; | |
974 | unsigned virtual_flag : 1; | |
8da1b058 | 975 | unsigned ignored_flag : 1; |
c5caa350 | 976 | unsigned abstract_flag : 1; |
8da1b058 | 977 | |
3110a56e | 978 | unsigned in_system_header_flag : 1; |
2c0d84d6 | 979 | unsigned common_flag : 1; |
30801830 | 980 | unsigned defer_output : 1; |
adb23061 RK |
981 | unsigned transparent_union : 1; |
982 | /* room for four more */ | |
3110a56e | 983 | |
8da1b058 RS |
984 | unsigned lang_flag_0 : 1; |
985 | unsigned lang_flag_1 : 1; | |
986 | unsigned lang_flag_2 : 1; | |
987 | unsigned lang_flag_3 : 1; | |
988 | unsigned lang_flag_4 : 1; | |
989 | unsigned lang_flag_5 : 1; | |
990 | unsigned lang_flag_6 : 1; | |
991 | unsigned lang_flag_7 : 1; | |
992 | ||
993 | union tree_node *name; | |
994 | union tree_node *context; | |
995 | union tree_node *arguments; | |
996 | union tree_node *result; | |
997 | union tree_node *initial; | |
c5caa350 | 998 | union tree_node *abstract_origin; |
8da1b058 | 999 | union tree_node *assembler_name; |
868e8789 | 1000 | union tree_node *section_name; |
8da1b058 RS |
1001 | struct rtx_def *rtl; /* acts as link to register transfer language |
1002 | (rtl) info */ | |
c0920bf9 | 1003 | /* For a FUNCTION_DECL, if inline, this is the size of frame needed. |
66321686 RS |
1004 | If built-in, this is the code for which built-in function. |
1005 | For other kinds of decls, this is DECL_ALIGN. */ | |
73f3c7c3 RK |
1006 | union { |
1007 | int i; | |
1008 | unsigned int u; | |
1009 | enum built_in_function f; | |
1010 | } frame_size; | |
77f934bb TW |
1011 | /* For FUNCTION_DECLs: points to insn that constitutes its definition |
1012 | on the permanent obstack. For any other kind of decl, this is the | |
1013 | alignment. */ | |
1014 | union { | |
1015 | struct rtx_def *r; | |
1016 | int i; | |
1017 | } saved_insns; | |
8da1b058 RS |
1018 | union tree_node *vindex; |
1019 | /* Points to a structure whose details depend on the language in use. */ | |
1020 | struct lang_decl *lang_specific; | |
1021 | }; | |
1022 | \f | |
1023 | /* Define the overall contents of a tree node. | |
1024 | It may be any of the structures declared above | |
1025 | for various types of node. */ | |
1026 | ||
1027 | union tree_node | |
1028 | { | |
1029 | struct tree_common common; | |
1030 | struct tree_int_cst int_cst; | |
1031 | struct tree_real_cst real_cst; | |
1032 | struct tree_string string; | |
1033 | struct tree_complex complex; | |
1034 | struct tree_identifier identifier; | |
1035 | struct tree_decl decl; | |
1036 | struct tree_type type; | |
1037 | struct tree_list list; | |
1038 | struct tree_vec vec; | |
1039 | struct tree_exp exp; | |
61131fa2 | 1040 | struct tree_block block; |
8da1b058 RS |
1041 | }; |
1042 | ||
f837a861 MM |
1043 | /* Add prototype support. */ |
1044 | #ifndef PROTO | |
1045 | #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__) | |
1046 | #define PROTO(ARGS) ARGS | |
1047 | #else | |
1048 | #define PROTO(ARGS) () | |
1049 | #endif | |
1050 | #endif | |
1051 | ||
cc927263 | 1052 | #ifndef VPROTO |
41109364 | 1053 | #ifdef __STDC__ |
bdea67fa | 1054 | #define PVPROTO(ARGS) ARGS |
41109364 RK |
1055 | #define VPROTO(ARGS) ARGS |
1056 | #define VA_START(va_list,var) va_start(va_list,var) | |
1057 | #else | |
bdea67fa | 1058 | #define PVPROTO(ARGS) () |
41109364 RK |
1059 | #define VPROTO(ARGS) (va_alist) va_dcl |
1060 | #define VA_START(va_list,var) va_start(va_list) | |
1061 | #endif | |
cc927263 | 1062 | #endif |
f837a861 | 1063 | |
d6b12657 RK |
1064 | #ifndef STDIO_PROTO |
1065 | #ifdef BUFSIZ | |
1066 | #define STDIO_PROTO(ARGS) PROTO(ARGS) | |
1067 | #else | |
1068 | #define STDIO_PROTO(ARGS) () | |
1069 | #endif | |
1070 | #endif | |
1071 | ||
f837a861 MM |
1072 | #define NULL_TREE (tree) NULL |
1073 | ||
1074 | /* Define a generic NULL if one hasn't already been defined. */ | |
1075 | ||
1076 | #ifndef NULL | |
1077 | #define NULL 0 | |
1078 | #endif | |
1079 | ||
1080 | #ifndef GENERIC_PTR | |
1081 | #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__) | |
1082 | #define GENERIC_PTR void * | |
1083 | #else | |
1084 | #define GENERIC_PTR char * | |
1085 | #endif | |
1086 | #endif | |
1087 | ||
1088 | #ifndef NULL_PTR | |
1089 | #define NULL_PTR ((GENERIC_PTR)0) | |
1090 | #endif | |
8da1b058 | 1091 | \f |
e5d70561 RK |
1092 | /* The following functions accept a wide integer argument. Rather than |
1093 | having to cast on every function call, we use a macro instead, that is | |
1094 | defined here and in rtl.h. */ | |
1095 | ||
1096 | #ifndef exact_log2 | |
1097 | #define exact_log2(N) exact_log2_wide ((HOST_WIDE_INT) (N)) | |
1098 | #define floor_log2(N) floor_log2_wide ((HOST_WIDE_INT) (N)) | |
1099 | #endif | |
1100 | ||
f837a861 MM |
1101 | #if 0 |
1102 | /* At present, don't prototype xrealloc, since all of the callers don't | |
1103 | cast their pointers to char *, and all of the xrealloc's don't use | |
1104 | void * yet. */ | |
bbfd16d4 RK |
1105 | extern char *xmalloc PROTO((size_t)); |
1106 | extern char *xrealloc PROTO((void *, size_t)); | |
f837a861 | 1107 | #else |
bbfd16d4 | 1108 | extern char *xmalloc (); |
0e77444b | 1109 | extern char *xrealloc (); |
f837a861 MM |
1110 | #endif |
1111 | ||
1112 | extern char *oballoc PROTO((int)); | |
1113 | extern char *permalloc PROTO((int)); | |
1114 | extern char *savealloc PROTO((int)); | |
f837a861 | 1115 | extern void free PROTO((void *)); |
8da1b058 RS |
1116 | |
1117 | /* Lowest level primitive for allocating a node. | |
1118 | The TREE_CODE is the only argument. Contents are initialized | |
1119 | to zero except for a few of the common fields. */ | |
1120 | ||
f837a861 | 1121 | extern tree make_node PROTO((enum tree_code)); |
8da1b058 RS |
1122 | |
1123 | /* Make a copy of a node, with all the same contents except | |
1124 | for TREE_PERMANENT. (The copy is permanent | |
1125 | iff nodes being made now are permanent.) */ | |
1126 | ||
f837a861 | 1127 | extern tree copy_node PROTO((tree)); |
8da1b058 RS |
1128 | |
1129 | /* Make a copy of a chain of TREE_LIST nodes. */ | |
1130 | ||
f837a861 | 1131 | extern tree copy_list PROTO((tree)); |
8da1b058 RS |
1132 | |
1133 | /* Make a TREE_VEC. */ | |
1134 | ||
f837a861 | 1135 | extern tree make_tree_vec PROTO((int)); |
8da1b058 RS |
1136 | |
1137 | /* Return the (unique) IDENTIFIER_NODE node for a given name. | |
1138 | The name is supplied as a char *. */ | |
1139 | ||
f837a861 | 1140 | extern tree get_identifier PROTO((char *)); |
8da1b058 RS |
1141 | |
1142 | /* Construct various types of nodes. */ | |
1143 | ||
e5d70561 RK |
1144 | #define build_int_2(LO,HI) \ |
1145 | build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI)) | |
1146 | ||
bdea67fa RK |
1147 | extern tree build PVPROTO((enum tree_code, tree, ...)); |
1148 | extern tree build_nt PVPROTO((enum tree_code, ...)); | |
1149 | extern tree build_parse_node PVPROTO((enum tree_code, ...)); | |
f837a861 MM |
1150 | |
1151 | extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT)); | |
1152 | extern tree build_real PROTO((tree, REAL_VALUE_TYPE)); | |
1153 | extern tree build_real_from_int_cst PROTO((tree, tree)); | |
1154 | extern tree build_complex PROTO((tree, tree)); | |
1155 | extern tree build_string PROTO((int, char *)); | |
1156 | extern tree build1 PROTO((enum tree_code, tree, tree)); | |
1157 | extern tree build_tree_list PROTO((tree, tree)); | |
1158 | extern tree build_decl_list PROTO((tree, tree)); | |
1159 | extern tree build_decl PROTO((enum tree_code, tree, tree)); | |
1160 | extern tree build_block PROTO((tree, tree, tree, tree, tree)); | |
8da1b058 RS |
1161 | |
1162 | /* Construct various nodes representing data types. */ | |
1163 | ||
f837a861 MM |
1164 | extern tree make_signed_type PROTO((int)); |
1165 | extern tree make_unsigned_type PROTO((int)); | |
1166 | extern tree signed_or_unsigned_type PROTO((int, tree)); | |
1167 | extern void fixup_unsigned_type PROTO((tree)); | |
1168 | extern tree build_pointer_type PROTO((tree)); | |
1169 | extern tree build_reference_type PROTO((tree)); | |
1170 | extern tree build_index_type PROTO((tree)); | |
1171 | extern tree build_index_2_type PROTO((tree, tree)); | |
1172 | extern tree build_array_type PROTO((tree, tree)); | |
1173 | extern tree build_function_type PROTO((tree, tree)); | |
1174 | extern tree build_method_type PROTO((tree, tree)); | |
1175 | extern tree build_offset_type PROTO((tree, tree)); | |
1176 | extern tree build_complex_type PROTO((tree)); | |
1177 | extern tree array_type_nelts PROTO((tree)); | |
1178 | ||
12cfc830 BK |
1179 | extern tree value_member PROTO((tree, tree)); |
1180 | extern tree purpose_member PROTO((tree, tree)); | |
1181 | extern tree binfo_member PROTO((tree, tree)); | |
bad1b4ba RK |
1182 | extern int attribute_list_equal PROTO((tree, tree)); |
1183 | extern int attribute_list_contained PROTO((tree, tree)); | |
12cfc830 BK |
1184 | extern int tree_int_cst_equal PROTO((tree, tree)); |
1185 | extern int tree_int_cst_lt PROTO((tree, tree)); | |
40c9a549 | 1186 | extern int tree_int_cst_sgn PROTO((tree)); |
12cfc830 BK |
1187 | extern int index_type_equal PROTO((tree, tree)); |
1188 | ||
f837a861 MM |
1189 | /* From expmed.c. Since rtl.h is included after tree.h, we can't |
1190 | put the prototype here. Rtl.h does declare the prototype if | |
1191 | tree.h had been included. */ | |
1192 | ||
1193 | extern tree make_tree (); | |
8da1b058 | 1194 | \f |
bad1b4ba RK |
1195 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTES |
1196 | is ATTRIBUTE. | |
1197 | ||
1198 | Such modified types already made are recorded so that duplicates | |
1199 | are not made. */ | |
1200 | ||
1201 | extern tree build_type_attribute_variant PROTO((tree, tree)); | |
1202 | ||
8da1b058 RS |
1203 | /* Given a type node TYPE, and CONSTP and VOLATILEP, return a type |
1204 | for the same kind of data as TYPE describes. | |
1205 | Variants point to the "main variant" (which has neither CONST nor VOLATILE) | |
1206 | via TYPE_MAIN_VARIANT, and it points to a chain of other variants | |
1207 | so that duplicate variants are never made. | |
1208 | Only main variants should ever appear as types of expressions. */ | |
1209 | ||
f837a861 | 1210 | extern tree build_type_variant PROTO((tree, int, int)); |
8da1b058 | 1211 | |
43100b14 RS |
1212 | /* Make a copy of a type node. */ |
1213 | ||
f837a861 | 1214 | extern tree build_type_copy PROTO((tree)); |
43100b14 | 1215 | |
8da1b058 RS |
1216 | /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT, |
1217 | TYPE_ALIGN and TYPE_MODE fields. | |
1218 | If called more than once on one node, does nothing except | |
1219 | for the first time. */ | |
1220 | ||
f837a861 | 1221 | extern void layout_type PROTO((tree)); |
8da1b058 RS |
1222 | |
1223 | /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), | |
1224 | return a canonicalized ..._TYPE node, so that duplicates are not made. | |
1225 | How the hash code is computed is up to the caller, as long as any two | |
1226 | callers that could hash identical-looking type nodes agree. */ | |
1227 | ||
f837a861 | 1228 | extern tree type_hash_canon PROTO((int, tree)); |
8da1b058 RS |
1229 | |
1230 | /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node, | |
1231 | calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE | |
1232 | fields. Call this only once for any given decl node. | |
1233 | ||
1234 | Second argument is the boundary that this field can be assumed to | |
1235 | be starting at (in bits). Zero means it can be assumed aligned | |
1236 | on any boundary that may be needed. */ | |
1237 | ||
f837a861 | 1238 | extern void layout_decl PROTO((tree, unsigned)); |
8da1b058 | 1239 | |
8da1b058 RS |
1240 | /* Return an expr equal to X but certainly not valid as an lvalue. */ |
1241 | ||
f837a861 | 1242 | extern tree non_lvalue PROTO((tree)); |
f0d568b7 | 1243 | extern tree pedantic_non_lvalue PROTO((tree)); |
8da1b058 | 1244 | |
f837a861 MM |
1245 | extern tree convert PROTO((tree, tree)); |
1246 | extern tree size_in_bytes PROTO((tree)); | |
1247 | extern int int_size_in_bytes PROTO((tree)); | |
1248 | extern tree size_binop PROTO((enum tree_code, tree, tree)); | |
1249 | extern tree size_int PROTO((unsigned)); | |
1250 | extern tree round_up PROTO((tree, int)); | |
1251 | extern tree get_pending_sizes PROTO((void)); | |
8da1b058 RS |
1252 | |
1253 | /* Type for sizes of data-type. */ | |
1254 | ||
1255 | extern tree sizetype; | |
1256 | ||
8294accf PB |
1257 | /* If nonzero, an upper limit on alignment of structure fields, in bits. */ |
1258 | extern int maximum_field_alignment; | |
1259 | ||
1260 | /* If non-zero, the alignment of a bitsting or (power-)set value, in bits. */ | |
1261 | extern int set_alignment; | |
1262 | ||
8da1b058 RS |
1263 | /* Concatenate two lists (chains of TREE_LIST nodes) X and Y |
1264 | by making the last node in X point to Y. | |
1265 | Returns X, except if X is 0 returns Y. */ | |
1266 | ||
f837a861 | 1267 | extern tree chainon PROTO((tree, tree)); |
8da1b058 RS |
1268 | |
1269 | /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ | |
1270 | ||
f837a861 MM |
1271 | extern tree tree_cons PROTO((tree, tree, tree)); |
1272 | extern tree perm_tree_cons PROTO((tree, tree, tree)); | |
1273 | extern tree temp_tree_cons PROTO((tree, tree, tree)); | |
1274 | extern tree saveable_tree_cons PROTO((tree, tree, tree)); | |
1275 | extern tree decl_tree_cons PROTO((tree, tree, tree)); | |
8da1b058 RS |
1276 | |
1277 | /* Return the last tree node in a chain. */ | |
1278 | ||
f837a861 | 1279 | extern tree tree_last PROTO((tree)); |
8da1b058 RS |
1280 | |
1281 | /* Reverse the order of elements in a chain, and return the new head. */ | |
1282 | ||
f837a861 | 1283 | extern tree nreverse PROTO((tree)); |
8da1b058 RS |
1284 | |
1285 | /* Returns the length of a chain of nodes | |
1286 | (number of chain pointers to follow before reaching a null pointer). */ | |
1287 | ||
f837a861 | 1288 | extern int list_length PROTO((tree)); |
8da1b058 RS |
1289 | |
1290 | /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */ | |
1291 | ||
f837a861 | 1292 | extern int integer_zerop PROTO((tree)); |
8da1b058 RS |
1293 | |
1294 | /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */ | |
1295 | ||
f837a861 | 1296 | extern int integer_onep PROTO((tree)); |
8da1b058 RS |
1297 | |
1298 | /* integer_all_onesp (tree x) is nonzero if X is an integer constant | |
1299 | all of whose significant bits are 1. */ | |
1300 | ||
f837a861 | 1301 | extern int integer_all_onesp PROTO((tree)); |
8da1b058 RS |
1302 | |
1303 | /* integer_pow2p (tree x) is nonzero is X is an integer constant with | |
1304 | exactly one bit 1. */ | |
1305 | ||
f837a861 | 1306 | extern int integer_pow2p PROTO((tree)); |
8da1b058 RS |
1307 | |
1308 | /* staticp (tree x) is nonzero if X is a reference to data allocated | |
1309 | at a fixed address in memory. */ | |
1310 | ||
f837a861 | 1311 | extern int staticp PROTO((tree)); |
8da1b058 RS |
1312 | |
1313 | /* Gets an error if argument X is not an lvalue. | |
1314 | Also returns 1 if X is an lvalue, 0 if not. */ | |
1315 | ||
f837a861 | 1316 | extern int lvalue_or_else PROTO((tree, char *)); |
8da1b058 RS |
1317 | |
1318 | /* save_expr (EXP) returns an expression equivalent to EXP | |
1319 | but it can be used multiple times within context CTX | |
1320 | and only evaluate EXP once. */ | |
1321 | ||
f837a861 | 1322 | extern tree save_expr PROTO((tree)); |
8da1b058 | 1323 | |
7380d707 RK |
1324 | /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size |
1325 | or offset that depends on a field within a record. | |
1326 | ||
1327 | Note that we only allow such expressions within simple arithmetic | |
1328 | or a COND_EXPR. */ | |
1329 | ||
1330 | extern int contains_placeholder_p PROTO((tree)); | |
1331 | ||
1332 | /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, | |
1333 | return a tree with all occurrences of references to F in a | |
1334 | PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP | |
1335 | contains only arithmetic expressions. */ | |
1336 | ||
1337 | extern tree substitute_in_expr PROTO((tree, tree, tree)); | |
1338 | ||
1339 | /* Given a type T, a FIELD_DECL F, and a replacement value R, | |
1340 | return a new type with all size expressions that contain F | |
1341 | updated by replacing the reference to F with R. */ | |
1342 | ||
1343 | extern tree substitute_in_type PROTO((tree, tree, tree)); | |
1344 | ||
90ca31be RS |
1345 | /* variable_size (EXP) is like save_expr (EXP) except that it |
1346 | is for the special case of something that is part of a | |
1347 | variable size for a data type. It makes special arrangements | |
1348 | to compute the value at the right time when the data type | |
1349 | belongs to a function parameter. */ | |
1350 | ||
f837a861 | 1351 | extern tree variable_size PROTO((tree)); |
90ca31be | 1352 | |
8da1b058 RS |
1353 | /* stabilize_reference (EXP) returns an reference equivalent to EXP |
1354 | but it can be used multiple times | |
1355 | and only evaluate the subexpressions once. */ | |
1356 | ||
f837a861 | 1357 | extern tree stabilize_reference PROTO((tree)); |
8da1b058 RS |
1358 | |
1359 | /* Return EXP, stripped of any conversions to wider types | |
1360 | in such a way that the result of converting to type FOR_TYPE | |
1361 | is the same as if EXP were converted to FOR_TYPE. | |
1362 | If FOR_TYPE is 0, it signifies EXP's type. */ | |
1363 | ||
f837a861 | 1364 | extern tree get_unwidened PROTO((tree, tree)); |
8da1b058 RS |
1365 | |
1366 | /* Return OP or a simpler expression for a narrower value | |
1367 | which can be sign-extended or zero-extended to give back OP. | |
1368 | Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended | |
1369 | or 0 if the value should be sign-extended. */ | |
1370 | ||
f837a861 | 1371 | extern tree get_narrower PROTO((tree, int *)); |
8da1b058 RS |
1372 | |
1373 | /* Given MODE and UNSIGNEDP, return a suitable type-tree | |
1374 | with that mode. | |
1375 | The definition of this resides in language-specific code | |
1376 | as the repertoire of available types may vary. */ | |
1377 | ||
f837a861 | 1378 | extern tree type_for_mode PROTO((enum machine_mode, int)); |
8da1b058 RS |
1379 | |
1380 | /* Given PRECISION and UNSIGNEDP, return a suitable type-tree | |
1381 | for an integer type with at least that precision. | |
1382 | The definition of this resides in language-specific code | |
1383 | as the repertoire of available types may vary. */ | |
1384 | ||
f837a861 | 1385 | extern tree type_for_size PROTO((unsigned, int)); |
8da1b058 RS |
1386 | |
1387 | /* Given an integer type T, return a type like T but unsigned. | |
1388 | If T is unsigned, the value is T. | |
1389 | The definition of this resides in language-specific code | |
1390 | as the repertoire of available types may vary. */ | |
1391 | ||
f837a861 | 1392 | extern tree unsigned_type PROTO((tree)); |
8da1b058 RS |
1393 | |
1394 | /* Given an integer type T, return a type like T but signed. | |
1395 | If T is signed, the value is T. | |
1396 | The definition of this resides in language-specific code | |
1397 | as the repertoire of available types may vary. */ | |
1398 | ||
f837a861 | 1399 | extern tree signed_type PROTO((tree)); |
8da1b058 RS |
1400 | |
1401 | /* This function must be defined in the language-specific files. | |
1402 | expand_expr calls it to build the cleanup-expression for a TARGET_EXPR. | |
1403 | This is defined in a language-specific file. */ | |
1404 | ||
f837a861 | 1405 | extern tree maybe_build_cleanup PROTO((tree)); |
8da1b058 RS |
1406 | |
1407 | /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF, | |
1408 | look for nested component-refs or array-refs at constant positions | |
1409 | and find the ultimate containing object, which is returned. */ | |
1410 | ||
f837a861 | 1411 | extern tree get_inner_reference PROTO((tree, int *, int *, tree *, enum machine_mode *, int *, int *)); |
8da1b058 RS |
1412 | |
1413 | /* Return the FUNCTION_DECL which provides this _DECL with its context, | |
1414 | or zero if none. */ | |
f837a861 | 1415 | extern tree decl_function_context PROTO((tree)); |
8da1b058 | 1416 | |
3635a54b RK |
1417 | /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides |
1418 | this _DECL with its context, or zero if none. */ | |
f837a861 | 1419 | extern tree decl_type_context PROTO((tree)); |
8da1b058 RS |
1420 | |
1421 | /* Given the FUNCTION_DECL for the current function, | |
1422 | return zero if it is ok for this function to be inline. | |
1423 | Otherwise return a warning message with a single %s | |
1424 | for the function's name. */ | |
1425 | ||
f837a861 | 1426 | extern char *function_cannot_inline_p PROTO((tree)); |
a3c11cd3 JW |
1427 | |
1428 | /* Return 1 if EXPR is the real constant zero. */ | |
1429 | extern int real_zerop PROTO((tree)); | |
8da1b058 RS |
1430 | \f |
1431 | /* Declare commonly used variables for tree structure. */ | |
1432 | ||
1433 | /* An integer constant with value 0 */ | |
1434 | extern tree integer_zero_node; | |
1435 | ||
1436 | /* An integer constant with value 1 */ | |
1437 | extern tree integer_one_node; | |
1438 | ||
1439 | /* An integer constant with value 0 whose type is sizetype. */ | |
1440 | extern tree size_zero_node; | |
1441 | ||
1442 | /* An integer constant with value 1 whose type is sizetype. */ | |
1443 | extern tree size_one_node; | |
1444 | ||
1445 | /* A constant of type pointer-to-int and value 0 */ | |
1446 | extern tree null_pointer_node; | |
1447 | ||
1448 | /* A node of type ERROR_MARK. */ | |
1449 | extern tree error_mark_node; | |
1450 | ||
1451 | /* The type node for the void type. */ | |
1452 | extern tree void_type_node; | |
1453 | ||
1454 | /* The type node for the ordinary (signed) integer type. */ | |
1455 | extern tree integer_type_node; | |
1456 | ||
1457 | /* The type node for the unsigned integer type. */ | |
1458 | extern tree unsigned_type_node; | |
1459 | ||
1460 | /* The type node for the ordinary character type. */ | |
1461 | extern tree char_type_node; | |
1462 | ||
1463 | /* Points to the name of the input file from which the current input | |
1464 | being parsed originally came (before it went into cpp). */ | |
1465 | extern char *input_filename; | |
1466 | ||
1467 | /* Current line number in input file. */ | |
1468 | extern int lineno; | |
1469 | ||
1470 | /* Nonzero for -pedantic switch: warn about anything | |
1471 | that standard C forbids. */ | |
1472 | extern int pedantic; | |
1473 | ||
1474 | /* Nonzero means can safely call expand_expr now; | |
1475 | otherwise layout_type puts variable sizes onto `pending_sizes' instead. */ | |
1476 | ||
1477 | extern int immediate_size_expand; | |
1478 | ||
1479 | /* Points to the FUNCTION_DECL of the function whose body we are reading. */ | |
1480 | ||
1481 | extern tree current_function_decl; | |
1482 | ||
1483 | /* Nonzero if function being compiled can call setjmp. */ | |
1484 | ||
1485 | extern int current_function_calls_setjmp; | |
1486 | ||
1487 | /* Nonzero if function being compiled can call longjmp. */ | |
1488 | ||
1489 | extern int current_function_calls_longjmp; | |
1490 | ||
1491 | /* Nonzero means all ..._TYPE nodes should be allocated permanently. */ | |
1492 | ||
1493 | extern int all_types_permanent; | |
1494 | ||
1495 | /* Pointer to function to compute the name to use to print a declaration. */ | |
1496 | ||
1497 | extern char *(*decl_printable_name) (); | |
dc437e16 RS |
1498 | |
1499 | /* Pointer to function to finish handling an incomplete decl at the | |
1500 | end of compilation. */ | |
1501 | ||
1502 | extern void (*incomplete_decl_finalize_hook) (); | |
8da1b058 | 1503 | \f |
143f1945 BK |
1504 | /* In tree.c */ |
1505 | extern char *perm_calloc PROTO((int, long)); | |
bca949e2 PB |
1506 | extern tree get_set_constructor_bits PROTO((tree, char*, int)); |
1507 | extern tree get_set_constructor_words PROTO((tree, | |
1508 | HOST_WIDE_INT*, int)); | |
143f1945 | 1509 | \f |
8da1b058 RS |
1510 | /* In stmt.c */ |
1511 | ||
d6b12657 | 1512 | extern void expand_fixups PROTO((struct rtx_def *)); |
f837a861 MM |
1513 | extern tree expand_start_stmt_expr PROTO((void)); |
1514 | extern tree expand_end_stmt_expr PROTO((tree)); | |
1515 | extern void expand_expr_stmt PROTO((tree)); | |
12cfc830 | 1516 | extern void expand_decl_init PROTO((tree)); |
f837a861 MM |
1517 | extern void clear_last_expr PROTO((void)); |
1518 | extern void expand_label PROTO((tree)); | |
1519 | extern void expand_goto PROTO((tree)); | |
1520 | extern void expand_asm PROTO((tree)); | |
1521 | extern void expand_start_cond PROTO((tree, int)); | |
1522 | extern void expand_end_cond PROTO((void)); | |
1523 | extern void expand_start_else PROTO((void)); | |
1524 | extern void expand_start_elseif PROTO((tree)); | |
1525 | extern struct nesting *expand_start_loop PROTO((int)); | |
1526 | extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int)); | |
1527 | extern void expand_loop_continue_here PROTO((void)); | |
1528 | extern void expand_end_loop PROTO((void)); | |
1529 | extern int expand_continue_loop PROTO((struct nesting *)); | |
1530 | extern int expand_exit_loop PROTO((struct nesting *)); | |
d6b12657 RK |
1531 | extern int expand_exit_loop_if_false PROTO((struct nesting *, |
1532 | tree)); | |
f837a861 MM |
1533 | extern int expand_exit_something PROTO((void)); |
1534 | ||
1535 | extern void expand_null_return PROTO((void)); | |
1536 | extern void expand_return PROTO((tree)); | |
1537 | extern void expand_start_bindings PROTO((int)); | |
1538 | extern void expand_end_bindings PROTO((tree, int, int)); | |
1539 | extern tree last_cleanup_this_contour PROTO((void)); | |
d6b12657 RK |
1540 | extern void expand_start_case PROTO((int, tree, tree, |
1541 | char *)); | |
f837a861 | 1542 | extern void expand_end_case PROTO((tree)); |
d6b12657 RK |
1543 | extern int pushcase PROTO((tree, |
1544 | tree (*) (tree, tree), | |
1545 | tree, tree *)); | |
1546 | extern int pushcase_range PROTO((tree, tree, | |
1547 | tree (*) (tree, tree), | |
1548 | tree, tree *)); | |
8da1b058 RS |
1549 | |
1550 | /* In fold-const.c */ | |
1551 | ||
4b63dccb RK |
1552 | /* Fold constants as much as possible in an expression. |
1553 | Returns the simplified expression. | |
1554 | Acts only on the top level of the expression; | |
1555 | if the argument itself cannot be simplified, its | |
1556 | subexpressions are not changed. */ | |
1557 | ||
1558 | extern tree fold PROTO((tree)); | |
1559 | ||
1560 | extern int force_fit_type PROTO((tree, int)); | |
1561 | extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
1562 | HOST_WIDE_INT, HOST_WIDE_INT, | |
1563 | HOST_WIDE_INT *, HOST_WIDE_INT *)); | |
1564 | extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
1565 | HOST_WIDE_INT *, HOST_WIDE_INT *)); | |
1566 | extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
1567 | HOST_WIDE_INT, HOST_WIDE_INT, | |
1568 | HOST_WIDE_INT *, HOST_WIDE_INT *)); | |
1569 | extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
1570 | HOST_WIDE_INT, int, HOST_WIDE_INT *, | |
1571 | HOST_WIDE_INT *, int)); | |
1572 | extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
1573 | HOST_WIDE_INT, int, | |
1574 | HOST_WIDE_INT *, HOST_WIDE_INT *, int)); | |
1575 | extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
1576 | HOST_WIDE_INT, int, HOST_WIDE_INT *, | |
1577 | HOST_WIDE_INT *)); | |
1578 | extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
1579 | HOST_WIDE_INT, int, HOST_WIDE_INT *, | |
1580 | HOST_WIDE_INT *)); | |
1581 | extern int operand_equal_p PROTO((tree, tree, int)); | |
1582 | extern tree invert_truthvalue PROTO((tree)); | |
8da1b058 RS |
1583 | \f |
1584 | /* The language front-end must define these functions. */ | |
1585 | ||
1586 | /* Function of no arguments for initializing lexical scanning. */ | |
f837a861 | 1587 | extern void init_lex PROTO((void)); |
8da1b058 | 1588 | /* Function of no arguments for initializing the symbol table. */ |
f837a861 | 1589 | extern void init_decl_processing PROTO((void)); |
8da1b058 RS |
1590 | |
1591 | /* Functions called with no arguments at the beginning and end or processing | |
1592 | the input source file. */ | |
f837a861 MM |
1593 | extern void lang_init PROTO((void)); |
1594 | extern void lang_finish PROTO((void)); | |
8da1b058 | 1595 | |
d0d4af87 MS |
1596 | /* Funtion to identify which front-end produced the output file. */ |
1597 | extern char *lang_identify PROTO((void)); | |
1598 | ||
78b099bd JM |
1599 | /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */ |
1600 | extern void copy_lang_decl PROTO((tree)); | |
1601 | ||
8da1b058 | 1602 | /* Function called with no arguments to parse and compile the input. */ |
f837a861 | 1603 | extern int yyparse PROTO((void)); |
8da1b058 RS |
1604 | /* Function called with option as argument |
1605 | to decode options starting with -f or -W or +. | |
1606 | It should return nonzero if it handles the option. */ | |
f837a861 | 1607 | extern int lang_decode_option PROTO((char *)); |
8da1b058 RS |
1608 | |
1609 | /* Functions for processing symbol declarations. */ | |
1610 | /* Function to enter a new lexical scope. | |
1611 | Takes one argument: always zero when called from outside the front end. */ | |
f837a861 | 1612 | extern void pushlevel PROTO((int)); |
8da1b058 RS |
1613 | /* Function to exit a lexical scope. It returns a BINDING for that scope. |
1614 | Takes three arguments: | |
1615 | KEEP -- nonzero if there were declarations in this scope. | |
1616 | REVERSE -- reverse the order of decls before returning them. | |
1617 | FUNCTIONBODY -- nonzero if this level is the body of a function. */ | |
f837a861 | 1618 | extern tree poplevel PROTO((int, int, int)); |
69b78d8d RS |
1619 | /* Set the BLOCK node for the current scope level. */ |
1620 | extern void set_block PROTO((tree)); | |
8da1b058 RS |
1621 | /* Function to add a decl to the current scope level. |
1622 | Takes one argument, a decl to add. | |
1623 | Returns that decl, or, if the same symbol is already declared, may | |
1624 | return a different decl for that name. */ | |
f837a861 | 1625 | extern tree pushdecl PROTO((tree)); |
8da1b058 | 1626 | /* Function to return the chain of decls so far in the current scope level. */ |
f837a861 | 1627 | extern tree getdecls PROTO((void)); |
8da1b058 | 1628 | /* Function to return the chain of structure tags in the current scope level. */ |
f837a861 | 1629 | extern tree gettags PROTO((void)); |
a3c11cd3 JW |
1630 | |
1631 | extern tree build_range_type PROTO((tree, tree, tree)); | |
1632 | ||
1633 | /* Call when starting to parse a declaration: | |
1634 | make expressions in the declaration last the length of the function. | |
1635 | Returns an argument that should be passed to resume_momentary later. */ | |
1636 | extern int suspend_momentary PROTO((void)); | |
1637 | ||
1638 | extern int allocation_temporary_p PROTO((void)); | |
1639 | ||
1640 | /* Call when finished parsing a declaration: | |
1641 | restore the treatment of node-allocation that was | |
1642 | in effect before the suspension. | |
1643 | YES should be the value previously returned by suspend_momentary. */ | |
1644 | extern void resume_momentary PROTO((int)); | |
1645 | ||
1646 | /* Called after finishing a record, union or enumeral type. */ | |
1647 | extern void rest_of_type_compilation PROTO((tree, int)); | |
1648 | ||
1649 | /* Save the current set of obstacks, but don't change them. */ | |
1650 | extern void push_obstacks_nochange PROTO((void)); | |
1651 | ||
96bcb120 JW |
1652 | extern void permanent_allocation PROTO((int)); |
1653 | ||
a3c11cd3 JW |
1654 | extern void push_momentary PROTO((void)); |
1655 | ||
1656 | extern void clear_momentary PROTO((void)); | |
1657 | ||
1658 | extern void pop_momentary PROTO((void)); | |
1659 | ||
1660 | extern void end_temporary_allocation PROTO((void)); | |
1661 | ||
1662 | /* Pop the obstack selection stack. */ | |
1663 | extern void pop_obstacks PROTO((void)); |