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