]>
Commit | Line | Data |
---|---|---|
8da1b058 | 1 | /* Front-end tree definitions for GNU compiler. |
642cac7b | 2 | Copyright (C) 1989, 93-98, 1999 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 | |
e9fa0c7c RK |
18 | the Free Software Foundation, 59 Temple Place - Suite 330, |
19 | Boston, MA 02111-1307, USA. */ | |
8da1b058 RS |
20 | |
21 | #include "machmode.h" | |
22 | ||
d6b12657 RK |
23 | #ifndef RTX_CODE |
24 | struct rtx_def; | |
25 | #endif | |
26 | ||
27 | /* Codes of tree nodes */ | |
8da1b058 RS |
28 | |
29 | #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, | |
30 | ||
31 | enum tree_code { | |
32 | #include "tree.def" | |
33 | ||
6dc42e49 | 34 | LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for |
8da1b058 RS |
35 | NUM_TREE_CODE. */ |
36 | }; | |
37 | ||
38 | #undef DEFTREECODE | |
39 | ||
40 | /* Number of tree codes. */ | |
41 | #define NUM_TREE_CODES ((int)LAST_AND_UNUSED_TREE_CODE) | |
42 | ||
43 | /* Indexed by enum tree_code, contains a character which is | |
44 | `<' for a comparison expression, `1', for a unary arithmetic | |
45 | expression, `2' for a binary arithmetic expression, `e' for | |
46 | other types of expressions, `r' for a reference, `c' for a | |
47 | constant, `d' for a decl, `t' for a type, `s' for a statement, | |
48 | and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */ | |
49 | ||
0a6969ad JC |
50 | #define MAX_TREE_CODES 256 |
51 | extern char tree_code_type[MAX_TREE_CODES]; | |
52 | #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] | |
8da1b058 | 53 | |
4da05956 MM |
54 | /* Returns non-zero iff CLASS is the tree-code class of an |
55 | expression. */ | |
56 | ||
57 | #define IS_EXPR_CODE_CLASS(CLASS) \ | |
8830da36 | 58 | (CLASS == '<' || CLASS == '1' || CLASS == '2' || CLASS == 'e') |
4da05956 | 59 | |
8da1b058 RS |
60 | /* Number of argument-words in each kind of tree-node. */ |
61 | ||
0a6969ad | 62 | extern int tree_code_length[MAX_TREE_CODES]; |
8da1b058 RS |
63 | |
64 | /* Names of tree components. */ | |
65 | ||
5f8ded66 | 66 | extern const char *tree_code_name[MAX_TREE_CODES]; |
8da1b058 | 67 | \f |
26db82d8 BS |
68 | /* Classify which part of the compiler has defined a given builtin |
69 | function. */ | |
70 | enum built_in_class | |
71 | { | |
72 | NOT_BUILT_IN = 0, | |
73 | BUILT_IN_FRONTEND, | |
74 | BUILT_IN_MD, | |
75 | BUILT_IN_NORMAL | |
76 | }; | |
8da1b058 RS |
77 | /* Codes that identify the various built in functions |
78 | so that expand_call can identify them quickly. */ | |
79 | ||
80 | enum built_in_function | |
81 | { | |
8da1b058 RS |
82 | BUILT_IN_ALLOCA, |
83 | BUILT_IN_ABS, | |
84 | BUILT_IN_FABS, | |
85 | BUILT_IN_LABS, | |
86 | BUILT_IN_FFS, | |
87 | BUILT_IN_DIV, | |
88 | BUILT_IN_LDIV, | |
89 | BUILT_IN_FFLOOR, | |
90 | BUILT_IN_FCEIL, | |
91 | BUILT_IN_FMOD, | |
92 | BUILT_IN_FREM, | |
93 | BUILT_IN_MEMCPY, | |
94 | BUILT_IN_MEMCMP, | |
95 | BUILT_IN_MEMSET, | |
96 | BUILT_IN_STRCPY, | |
97 | BUILT_IN_STRCMP, | |
98 | BUILT_IN_STRLEN, | |
99 | BUILT_IN_FSQRT, | |
a1ee10a4 JVA |
100 | BUILT_IN_SIN, |
101 | BUILT_IN_COS, | |
8da1b058 RS |
102 | BUILT_IN_GETEXP, |
103 | BUILT_IN_GETMAN, | |
104 | BUILT_IN_SAVEREGS, | |
105 | BUILT_IN_CLASSIFY_TYPE, | |
106 | BUILT_IN_NEXT_ARG, | |
107 | BUILT_IN_ARGS_INFO, | |
108 | BUILT_IN_CONSTANT_P, | |
109 | BUILT_IN_FRAME_ADDRESS, | |
110 | BUILT_IN_RETURN_ADDRESS, | |
0844ee7f | 111 | BUILT_IN_AGGREGATE_INCOMING_ADDRESS, |
7f11e158 TW |
112 | BUILT_IN_APPLY_ARGS, |
113 | BUILT_IN_APPLY, | |
114 | BUILT_IN_RETURN, | |
33fb8b5f RK |
115 | BUILT_IN_SETJMP, |
116 | BUILT_IN_LONGJMP, | |
e0cd0770 | 117 | BUILT_IN_TRAP, |
8da1b058 | 118 | |
0021b564 | 119 | /* Various hooks for the DWARF 2 __throw routine. */ |
0021b564 | 120 | BUILT_IN_UNWIND_INIT, |
71038426 | 121 | BUILT_IN_DWARF_CFA, |
0021b564 | 122 | BUILT_IN_DWARF_FP_REGNUM, |
d9d5c9de | 123 | BUILT_IN_INIT_DWARF_REG_SIZES, |
0021b564 JM |
124 | BUILT_IN_FROB_RETURN_ADDR, |
125 | BUILT_IN_EXTRACT_RETURN_ADDR, | |
71038426 | 126 | BUILT_IN_EH_RETURN, |
0021b564 | 127 | |
d3707adb RH |
128 | BUILT_IN_VARARGS_START, |
129 | BUILT_IN_STDARG_START, | |
130 | BUILT_IN_VA_END, | |
131 | BUILT_IN_VA_COPY, | |
132 | ||
8da1b058 RS |
133 | /* C++ extensions */ |
134 | BUILT_IN_NEW, | |
135 | BUILT_IN_VEC_NEW, | |
136 | BUILT_IN_DELETE, | |
972ded9c RS |
137 | BUILT_IN_VEC_DELETE, |
138 | ||
139 | /* Upper bound on non-language-specific builtins. */ | |
140 | END_BUILTINS | |
8da1b058 RS |
141 | }; |
142 | \f | |
143 | /* The definition of tree nodes fills the next several pages. */ | |
144 | ||
145 | /* A tree node can represent a data type, a variable, an expression | |
146 | or a statement. Each node has a TREE_CODE which says what kind of | |
147 | thing it represents. Some common codes are: | |
148 | INTEGER_TYPE -- represents a type of integers. | |
149 | ARRAY_TYPE -- represents a type of pointer. | |
150 | VAR_DECL -- represents a declared variable. | |
151 | INTEGER_CST -- represents a constant integer value. | |
152 | PLUS_EXPR -- represents a sum (an expression). | |
153 | ||
154 | As for the contents of a tree node: there are some fields | |
155 | that all nodes share. Each TREE_CODE has various special-purpose | |
156 | fields as well. The fields of a node are never accessed directly, | |
157 | always through accessor macros. */ | |
158 | ||
159 | /* This type is used everywhere to refer to a tree node. */ | |
160 | ||
161 | typedef union tree_node *tree; | |
162 | ||
8da1b058 RS |
163 | /* Every kind of tree node starts with this structure, |
164 | so all nodes have these fields. | |
165 | ||
42801468 JL |
166 | See the accessor macros, defined below, for documentation of the fields. |
167 | ||
168 | DO NOT change the layout of tree_common unless absolutely necessary. Some | |
169 | front-ends (namely g++) depend on the internal layout of this tructure. | |
170 | See my_tree_cons in the cp subdir for such uglyness. Ugh. */ | |
8da1b058 RS |
171 | |
172 | struct tree_common | |
173 | { | |
174 | union tree_node *chain; | |
175 | union tree_node *type; | |
176 | #ifdef ONLY_INT_FIELDS | |
177 | unsigned int code : 8; | |
178 | #else | |
179 | enum tree_code code : 8; | |
180 | #endif | |
181 | ||
182 | unsigned side_effects_flag : 1; | |
183 | unsigned constant_flag : 1; | |
184 | unsigned permanent_flag : 1; | |
185 | unsigned addressable_flag : 1; | |
186 | unsigned volatile_flag : 1; | |
187 | unsigned readonly_flag : 1; | |
188 | unsigned unsigned_flag : 1; | |
189 | unsigned asm_written_flag: 1; | |
190 | ||
191 | unsigned used_flag : 1; | |
192 | unsigned raises_flag : 1; | |
193 | unsigned static_flag : 1; | |
194 | unsigned public_flag : 1; | |
195 | unsigned private_flag : 1; | |
196 | unsigned protected_flag : 1; | |
197 | ||
198 | unsigned lang_flag_0 : 1; | |
199 | unsigned lang_flag_1 : 1; | |
200 | unsigned lang_flag_2 : 1; | |
201 | unsigned lang_flag_3 : 1; | |
202 | unsigned lang_flag_4 : 1; | |
203 | unsigned lang_flag_5 : 1; | |
204 | unsigned lang_flag_6 : 1; | |
0a25f1f5 | 205 | |
005537df | 206 | /* There is room for three more flags. */ |
8da1b058 RS |
207 | }; |
208 | ||
a5f99f01 RK |
209 | /* The following table lists the uses of each of the above flags and |
210 | for which types of nodes they are defined. Note that expressions | |
211 | include decls. | |
212 | ||
213 | addressable_flag: | |
214 | ||
215 | TREE_ADDRESSABLE in | |
216 | VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE | |
217 | IDENTIFIER_NODE | |
218 | ||
219 | static_flag: | |
220 | ||
221 | TREE_STATIC in | |
e5e809f4 | 222 | VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR |
a5f99f01 RK |
223 | TREE_NO_UNUSED_WARNING in |
224 | CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR | |
225 | TREE_VIA_VIRTUAL in | |
226 | TREE_LIST or TREE_VEC | |
227 | TREE_CONSTANT_OVERFLOW in | |
228 | INTEGER_CST, REAL_CST, COMPLEX_CST | |
229 | TREE_SYMBOL_REFERENCED in | |
230 | IDENTIFIER_NODE | |
231 | ||
232 | public_flag: | |
233 | ||
234 | TREE_OVERFLOW in | |
235 | INTEGER_CST, REAL_CST, COMPLEX_CST | |
236 | TREE_PUBLIC in | |
237 | VAR_DECL or FUNCTION_DECL | |
238 | TREE_VIA_PUBLIC in | |
239 | TREE_LIST or TREE_VEC | |
dadafe54 PB |
240 | EXPR_WFL_EMIT_LINE_NOTE in |
241 | EXPR_WITH_FILE_LOCATION | |
a5f99f01 RK |
242 | |
243 | private_flag: | |
244 | ||
245 | TREE_VIA_PRIVATE in | |
246 | TREE_LIST or TREE_VEC | |
247 | TREE_PRIVATE in | |
248 | ??? unspecified nodes | |
249 | ||
250 | protected_flag: | |
251 | ||
252 | TREE_VIA_PROTECTED in | |
253 | TREE_LIST | |
254 | TREE_PROTECTED in | |
255 | BLOCK | |
256 | ??? unspecified nodes | |
257 | ||
258 | side_effects_flag: | |
259 | ||
260 | TREE_SIDE_EFFECTS in | |
261 | all expressions | |
262 | ||
263 | volatile_flag: | |
264 | ||
265 | TREE_THIS_VOLATILE in | |
266 | all expressions | |
267 | TYPE_VOLATILE in | |
268 | ..._TYPE | |
269 | ||
270 | readonly_flag: | |
271 | ||
272 | TREE_READONLY in | |
e5e809f4 | 273 | all expressions |
a5f99f01 RK |
274 | ITERATOR_BOUND_P in |
275 | VAR_DECL if iterator (C) | |
276 | TYPE_READONLY in | |
277 | ..._TYPE | |
278 | ||
279 | constant_flag: | |
280 | ||
281 | TREE_CONSTANT in | |
282 | all expressions | |
283 | ||
284 | permanent_flag: TREE_PERMANENT in all nodes | |
285 | ||
286 | unsigned_flag: | |
287 | ||
288 | TREE_UNSIGNED in | |
289 | INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL | |
a5f99f01 RK |
290 | DECL_BUILT_IN_NONANSI in |
291 | FUNCTION_DECL | |
292 | TREE_PARMLIST in | |
293 | TREE_PARMLIST (C++) | |
e9a25f70 JL |
294 | SAVE_EXPR_NOPLACEHOLDER in |
295 | SAVE_EXPR | |
a5f99f01 RK |
296 | |
297 | asm_written_flag: | |
298 | ||
299 | TREE_ASM_WRITTEN in | |
300 | VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE | |
301 | BLOCK | |
302 | ||
303 | used_flag: | |
304 | ||
305 | TREE_USED in | |
306 | expressions, IDENTIFIER_NODE | |
307 | ||
308 | raises_flag: | |
309 | ||
310 | TREE_RAISES in | |
311 | expressions | |
312 | ||
313 | */ | |
8da1b058 RS |
314 | /* Define accessors for the fields that all tree nodes have |
315 | (though some fields are not used for all kinds of nodes). */ | |
316 | ||
317 | /* The tree-code says what kind of node it is. | |
318 | Codes are defined in tree.def. */ | |
319 | #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code) | |
320 | #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE)) | |
321 | ||
12b195d9 | 322 | /* When checking is enabled, errors will be generated if a tree node |
8f985ec4 | 323 | is accessed incorrectly. The macros abort with a fatal error. */ |
6c9821b7 | 324 | #if defined ENABLE_CHECKING && (GCC_VERSION >= 2007) |
12b195d9 | 325 | |
8f985ec4 ZW |
326 | #define TREE_CHECK(t, code) \ |
327 | ({ const tree __t = t; \ | |
328 | if (TREE_CODE(__t) != (code)) \ | |
329 | tree_check_failed (__t, code, __FILE__, \ | |
330 | __LINE__, __PRETTY_FUNCTION__); \ | |
331 | __t; }) | |
332 | #define TREE_CLASS_CHECK(t, class) \ | |
333 | ({ const tree __t = t; \ | |
334 | if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \ | |
335 | tree_class_check_failed (__t, class, __FILE__, \ | |
336 | __LINE__, __PRETTY_FUNCTION__); \ | |
337 | __t; }) | |
338 | ||
339 | /* These checks have to be special cased. */ | |
340 | #define CST_OR_CONSTRUCTOR_CHECK(t) \ | |
341 | ({ const tree __t = t; \ | |
342 | enum tree_code __c = TREE_CODE(__t); \ | |
343 | if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \ | |
344 | tree_check_failed (__t, CONSTRUCTOR, __FILE__, \ | |
345 | __LINE__, __PRETTY_FUNCTION__); \ | |
346 | __t; }) | |
347 | #define EXPR_CHECK(t) \ | |
348 | ({ const tree __t = t; \ | |
349 | char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \ | |
350 | if (__c != 'r' && __c != 's' && __c != '<' \ | |
351 | && __c != '1' && __c != '2' && __c != 'e') \ | |
352 | tree_class_check_failed(__t, 'e', __FILE__, \ | |
353 | __LINE__, __PRETTY_FUNCTION__); \ | |
354 | __t; }) | |
355 | ||
356 | extern void tree_check_failed PROTO((const tree, enum tree_code, | |
357 | const char *, int, const char *)) | |
358 | ATTRIBUTE_NORETURN; | |
359 | extern void tree_class_check_failed PROTO((const tree, char, | |
360 | const char *, int, const char *)) | |
361 | ATTRIBUTE_NORETURN; | |
362 | ||
987009bf | 363 | #else /* not ENABLE_CHECKING, or not gcc */ |
12b195d9 | 364 | |
8f985ec4 ZW |
365 | #define TREE_CHECK(t, code) (t) |
366 | #define TREE_CLASS_CHECK(t, code) (t) | |
367 | #define CST_OR_CONSTRUCTOR_CHECK(t) (t) | |
368 | #define EXPR_CHECK(t) (t) | |
369 | ||
370 | #endif | |
371 | ||
372 | #include "tree-check.h" | |
373 | ||
374 | #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't') | |
375 | #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd') | |
376 | #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c') | |
12b195d9 | 377 | |
8da1b058 RS |
378 | /* In all nodes that are expressions, this is the data type of the expression. |
379 | In POINTER_TYPE nodes, this is the type that the pointer points to. | |
380 | In ARRAY_TYPE nodes, this is the type of the elements. */ | |
381 | #define TREE_TYPE(NODE) ((NODE)->common.type) | |
382 | ||
383 | /* Nodes are chained together for many purposes. | |
384 | Types are chained together to record them for being output to the debugger | |
385 | (see the function `chain_type'). | |
386 | Decls in the same scope are chained together to record the contents | |
387 | of the scope. | |
388 | Statement nodes for successive statements used to be chained together. | |
389 | Often lists of things are represented by TREE_LIST nodes that | |
390 | are chained together. */ | |
391 | ||
392 | #define TREE_CHAIN(NODE) ((NODE)->common.chain) | |
393 | ||
394 | /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs | |
395 | that don't change the machine mode. */ | |
396 | ||
397 | #define STRIP_NOPS(EXP) \ | |
398 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
399 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
400 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
401 | && (TYPE_MODE (TREE_TYPE (EXP)) \ | |
402 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
403 | (EXP) = TREE_OPERAND (EXP, 0); | |
0fafb45e | 404 | |
14a774a9 RK |
405 | /* Like STRIP_NOPS, but don't let the signedness change either. */ |
406 | ||
407 | #define STRIP_SIGN_NOPS(EXP) \ | |
408 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
409 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
410 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
411 | && (TYPE_MODE (TREE_TYPE (EXP)) \ | |
412 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
413 | && (TREE_UNSIGNED (TREE_TYPE (EXP)) \ | |
414 | == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
415 | (EXP) = TREE_OPERAND (EXP, 0); | |
416 | ||
0fafb45e RS |
417 | /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ |
418 | ||
419 | #define STRIP_TYPE_NOPS(EXP) \ | |
420 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
421 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
422 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
423 | && (TREE_TYPE (EXP) \ | |
424 | == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
425 | (EXP) = TREE_OPERAND (EXP, 0); | |
87291138 RK |
426 | |
427 | /* Nonzero if TYPE represents an integral type. Note that we do not | |
428 | include COMPLEX types here. */ | |
429 | ||
430 | #define INTEGRAL_TYPE_P(TYPE) \ | |
431 | (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \ | |
432 | || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE) | |
433 | ||
434 | /* Nonzero if TYPE represents a floating-point type, including complex | |
435 | floating-point types. */ | |
436 | ||
437 | #define FLOAT_TYPE_P(TYPE) \ | |
438 | (TREE_CODE (TYPE) == REAL_TYPE \ | |
439 | || (TREE_CODE (TYPE) == COMPLEX_TYPE \ | |
440 | && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)) | |
947765f9 PB |
441 | |
442 | /* Nonzero if TYPE represents an aggregate (multi-component) type. */ | |
443 | ||
444 | #define AGGREGATE_TYPE_P(TYPE) \ | |
445 | (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \ | |
446 | || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \ | |
447 | || TREE_CODE (TYPE) == SET_TYPE) | |
9e6cfc43 JM |
448 | |
449 | /* Nonzero if TYPE represents a pointer type. */ | |
450 | ||
451 | #define POINTER_TYPE_P(TYPE) \ | |
452 | (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) | |
555f90c5 JM |
453 | |
454 | /* Nonzero if TYPE represents a type. */ | |
455 | ||
456 | #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't') | |
8da1b058 RS |
457 | \f |
458 | /* Define many boolean fields that all tree nodes have. */ | |
459 | ||
460 | /* In VAR_DECL nodes, nonzero means address of this is needed. | |
461 | So it cannot be in a register. | |
462 | In a FUNCTION_DECL, nonzero means its address is needed. | |
463 | So it must be compiled even if it is an inline function. | |
464 | In CONSTRUCTOR nodes, it means object constructed must be in memory. | |
465 | In LABEL_DECL nodes, it means a goto for this label has been seen | |
466 | from a place outside all binding contours that restore stack levels. | |
467 | In ..._TYPE nodes, it means that objects of this type must | |
468 | be fully addressable. This means that pieces of this | |
469 | object cannot go into register parameters, for example. | |
470 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
471 | had its address taken. That matters for inline functions. */ | |
472 | #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag) | |
473 | ||
474 | /* In a VAR_DECL, nonzero means allocate static storage. | |
9f86614b | 475 | In a FUNCTION_DECL, nonzero if function has been defined. |
8da1b058 RS |
476 | In a CONSTRUCTOR, nonzero means allocate static storage. */ |
477 | #define TREE_STATIC(NODE) ((NODE)->common.static_flag) | |
478 | ||
248c0f74 JM |
479 | /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was |
480 | made implicitly and should not lead to an "unused value" warning. */ | |
8da1b058 RS |
481 | #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag) |
482 | ||
483 | /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation | |
484 | chain is via a `virtual' declaration. */ | |
485 | #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag) | |
486 | ||
ae202b56 RK |
487 | /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an |
488 | overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C | |
489 | requires a diagnostic when overflows occur in constant expressions. */ | |
261450e8 PE |
490 | #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag) |
491 | ||
d3568529 JM |
492 | /* In an IDENTIFIER_NODE, this means that assemble_name was called with |
493 | this string as an argument. */ | |
494 | #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag) | |
495 | ||
ae202b56 RK |
496 | /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an |
497 | overflow in folding, and no warning has been issued for this subexpression. | |
261450e8 PE |
498 | TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */ |
499 | #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag) | |
500 | ||
8da1b058 RS |
501 | /* In a VAR_DECL or FUNCTION_DECL, |
502 | nonzero means name is to be accessible from outside this module. | |
858a47b1 | 503 | In an identifier node, nonzero means an external declaration |
6dc42e49 | 504 | accessible from outside this module was previously seen |
8da1b058 RS |
505 | for this name in an inner scope. */ |
506 | #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag) | |
507 | ||
508 | /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the | |
509 | base class is via a `public' declaration, which preserves public | |
510 | fields from the base class as public. */ | |
511 | #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag) | |
512 | ||
9e5386db MS |
513 | /* Ditto, for `private' declarations. */ |
514 | #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag) | |
515 | ||
516 | /* Nonzero for TREE_LIST node means that the path to the | |
517 | base class is via a `protected' declaration, which preserves | |
518 | protected fields from the base class as protected. | |
519 | OVERLOADED. */ | |
026380ff | 520 | #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag) |
9e5386db | 521 | |
8da1b058 RS |
522 | /* In any expression, nonzero means it has side effects or reevaluation |
523 | of the whole expression could produce a different value. | |
524 | This is set if any subexpression is a function call, a side effect | |
525 | or a reference to a volatile variable. | |
526 | In a ..._DECL, this is set only if the declaration said `volatile'. */ | |
527 | #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag) | |
528 | ||
529 | /* Nonzero means this expression is volatile in the C sense: | |
530 | its address should be of type `volatile WHATEVER *'. | |
531 | In other words, the declared item is volatile qualified. | |
532 | This is used in _DECL nodes and _REF nodes. | |
533 | ||
534 | In a ..._TYPE node, means this type is volatile-qualified. | |
535 | But use TYPE_VOLATILE instead of this macro when the node is a type, | |
536 | because eventually we may make that a different bit. | |
537 | ||
538 | If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ | |
539 | #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag) | |
540 | ||
541 | /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, | |
542 | nonzero means it may not be the lhs of an assignment. | |
543 | In a ..._TYPE node, means this type is const-qualified | |
544 | (but the macro TYPE_READONLY should be used instead of this macro | |
545 | when the node is a type). */ | |
546 | #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag) | |
547 | ||
548 | /* Value of expression is constant. | |
549 | Always appears in all ..._CST nodes. | |
550 | May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR | |
551 | if the value is constant. */ | |
552 | #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag) | |
553 | ||
554 | /* Nonzero means permanent node; | |
555 | node will continue to exist for the entire compiler run. | |
556 | Otherwise it will be recycled at the end of the function. */ | |
557 | #define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag) | |
558 | ||
559 | /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type. | |
560 | In FIELD_DECL nodes, means an unsigned bit field. | |
561 | The same bit is used in functions as DECL_BUILT_IN_NONANSI. */ | |
562 | #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag) | |
563 | ||
564 | /* Nonzero in a VAR_DECL means assembler code has been written. | |
565 | Nonzero in a FUNCTION_DECL means that the function has been compiled. | |
566 | This is interesting in an inline function, since it might not need | |
567 | to be compiled separately. | |
3635a54b | 568 | Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE |
9f86614b RS |
569 | if the sdb debugging info for the type has been written. |
570 | In a BLOCK node, nonzero if reorder_blocks has already seen this block. */ | |
8da1b058 RS |
571 | #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag) |
572 | ||
573 | /* Nonzero in a _DECL if the name is used in its scope. | |
574 | Nonzero in an expr node means inhibit warning if value is unused. | |
575 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
576 | was used. */ | |
577 | #define TREE_USED(NODE) ((NODE)->common.used_flag) | |
578 | ||
579 | /* Nonzero for a tree node whose evaluation could result | |
580 | in the raising of an exception. Not implemented yet. */ | |
581 | #define TREE_RAISES(NODE) ((NODE)->common.raises_flag) | |
582 | ||
9f86614b | 583 | /* Used in classes in C++. */ |
8da1b058 | 584 | #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag) |
9f86614b RS |
585 | /* Used in classes in C++. |
586 | In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */ | |
8da1b058 RS |
587 | #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag) |
588 | ||
9f86614b | 589 | /* These flags are available for each language front end to use internally. */ |
8da1b058 RS |
590 | #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0) |
591 | #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1) | |
592 | #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2) | |
593 | #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3) | |
594 | #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4) | |
595 | #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5) | |
596 | #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6) | |
597 | \f | |
598 | /* Define additional fields and accessors for nodes representing constants. */ | |
599 | ||
e5d70561 RK |
600 | /* In an INTEGER_CST node. These two together make a 2-word integer. |
601 | If the data type is signed, the value is sign-extended to 2 words | |
8da1b058 | 602 | even though not all of them may really be in use. |
e5d70561 | 603 | In an unsigned constant shorter than 2 words, the extra bits are 0. */ |
12b195d9 ML |
604 | #define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low) |
605 | #define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high) | |
8da1b058 RS |
606 | |
607 | #define INT_CST_LT(A, B) \ | |
608 | (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ | |
609 | || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ | |
e5d70561 RK |
610 | && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \ |
611 | < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))) | |
8da1b058 RS |
612 | |
613 | #define INT_CST_LT_UNSIGNED(A, B) \ | |
e5d70561 RK |
614 | (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ |
615 | < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ | |
616 | || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
617 | == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \ | |
618 | && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \ | |
619 | < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))) | |
8da1b058 RS |
620 | |
621 | struct tree_int_cst | |
622 | { | |
623 | char common[sizeof (struct tree_common)]; | |
8e15f736 RK |
624 | struct rtx_def *rtl; /* acts as link to register transfer language |
625 | (rtl) info */ | |
e5d70561 RK |
626 | HOST_WIDE_INT int_cst_low; |
627 | HOST_WIDE_INT int_cst_high; | |
8da1b058 RS |
628 | }; |
629 | ||
630 | /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes, | |
631 | and generally in all kinds of constants that could | |
632 | be given labels (rather than being immediate). */ | |
633 | ||
12b195d9 | 634 | #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl) |
8da1b058 RS |
635 | |
636 | /* In a REAL_CST node. */ | |
637 | /* We can represent a real value as either a `double' or a string. | |
638 | Strings don't allow for any optimization, but they do allow | |
639 | for cross-compilation. */ | |
640 | ||
12b195d9 | 641 | #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst) |
8da1b058 RS |
642 | |
643 | #include "real.h" | |
644 | ||
645 | struct tree_real_cst | |
646 | { | |
647 | char common[sizeof (struct tree_common)]; | |
648 | struct rtx_def *rtl; /* acts as link to register transfer language | |
649 | (rtl) info */ | |
650 | REAL_VALUE_TYPE real_cst; | |
651 | }; | |
652 | ||
653 | /* In a STRING_CST */ | |
12b195d9 ML |
654 | #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) |
655 | #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer) | |
8da1b058 RS |
656 | |
657 | struct tree_string | |
658 | { | |
659 | char common[sizeof (struct tree_common)]; | |
660 | struct rtx_def *rtl; /* acts as link to register transfer language | |
661 | (rtl) info */ | |
662 | int length; | |
663 | char *pointer; | |
664 | }; | |
665 | ||
666 | /* In a COMPLEX_CST node. */ | |
12b195d9 ML |
667 | #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) |
668 | #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) | |
8da1b058 RS |
669 | |
670 | struct tree_complex | |
671 | { | |
672 | char common[sizeof (struct tree_common)]; | |
673 | struct rtx_def *rtl; /* acts as link to register transfer language | |
674 | (rtl) info */ | |
675 | union tree_node *real; | |
676 | union tree_node *imag; | |
677 | }; | |
678 | \f | |
679 | /* Define fields and accessors for some special-purpose tree nodes. */ | |
680 | ||
12b195d9 ML |
681 | #define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length) |
682 | #define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer) | |
8da1b058 RS |
683 | |
684 | struct tree_identifier | |
685 | { | |
686 | char common[sizeof (struct tree_common)]; | |
687 | int length; | |
688 | char *pointer; | |
689 | }; | |
690 | ||
691 | /* In a TREE_LIST node. */ | |
12b195d9 ML |
692 | #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) |
693 | #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) | |
8da1b058 RS |
694 | |
695 | struct tree_list | |
696 | { | |
697 | char common[sizeof (struct tree_common)]; | |
698 | union tree_node *purpose; | |
699 | union tree_node *value; | |
700 | }; | |
701 | ||
702 | /* In a TREE_VEC node. */ | |
12b195d9 ML |
703 | #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length) |
704 | #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I]) | |
52267fcb | 705 | #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length])) |
8da1b058 RS |
706 | |
707 | struct tree_vec | |
708 | { | |
709 | char common[sizeof (struct tree_common)]; | |
710 | int length; | |
711 | union tree_node *a[1]; | |
712 | }; | |
713 | ||
714 | /* Define fields and accessors for some nodes that represent expressions. */ | |
715 | ||
716 | /* In a SAVE_EXPR node. */ | |
717 | #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1) | |
12b195d9 | 718 | #define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2]) |
e9a25f70 | 719 | #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE) |
d26f8097 MM |
720 | /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs |
721 | both in normal code and in a handler. (Normally, in a handler, all | |
722 | SAVE_EXPRs are unsaved, meaning that there values are | |
723 | recalculated.) */ | |
724 | #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE) | |
8da1b058 RS |
725 | |
726 | /* In a RTL_EXPR node. */ | |
12b195d9 ML |
727 | #define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0]) |
728 | #define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1]) | |
8da1b058 RS |
729 | |
730 | /* In a CALL_EXPR node. */ | |
12b195d9 | 731 | #define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2]) |
8da1b058 RS |
732 | |
733 | /* In a CONSTRUCTOR node. */ | |
734 | #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1) | |
735 | ||
61131fa2 | 736 | /* In ordinary expression nodes. */ |
12b195d9 ML |
737 | #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I]) |
738 | #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity) | |
61131fa2 | 739 | |
40edd0bd APB |
740 | /* In a LABELED_BLOCK_EXPR node. */ |
741 | #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0) | |
742 | #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1) | |
743 | ||
744 | /* In a EXIT_BLOCK_EXPR node. */ | |
745 | #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0) | |
746 | #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1) | |
747 | ||
748 | /* In a LOOP_EXPR node. */ | |
749 | #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0) | |
750 | ||
dadafe54 | 751 | /* In a EXPR_WITH_FILE_LOCATION node. */ |
bf1e5319 | 752 | #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0) |
86fff623 MM |
753 | #define EXPR_WFL_FILENAME(NODE) \ |
754 | (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE)))) | |
755 | #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1) | |
12b195d9 ML |
756 | #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12) |
757 | #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff) | |
758 | #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity) | |
bf1e5319 APB |
759 | #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \ |
760 | (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff)) | |
dadafe54 | 761 | #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag) |
bf1e5319 | 762 | |
61131fa2 RS |
763 | struct tree_exp |
764 | { | |
765 | char common[sizeof (struct tree_common)]; | |
766 | int complexity; | |
767 | union tree_node *operands[1]; | |
768 | }; | |
769 | \f | |
8da1b058 | 770 | /* In a BLOCK node. */ |
12b195d9 | 771 | #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) |
12b195d9 ML |
772 | #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) |
773 | #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) | |
8da1b058 RS |
774 | /* Note: when changing this, make sure to find the places |
775 | that use chainon or nreverse. */ | |
776 | #define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE) | |
12b195d9 ML |
777 | #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) |
778 | #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) | |
8da1b058 RS |
779 | |
780 | /* Nonzero means that this block is prepared to handle exceptions | |
781 | listed in the BLOCK_VARS slot. */ | |
12b195d9 | 782 | #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag) |
8da1b058 | 783 | |
61131fa2 | 784 | struct tree_block |
8da1b058 RS |
785 | { |
786 | char common[sizeof (struct tree_common)]; | |
61131fa2 RS |
787 | |
788 | unsigned handler_block_flag : 1; | |
789 | unsigned abstract_flag : 1; | |
790 | ||
791 | union tree_node *vars; | |
61131fa2 RS |
792 | union tree_node *subblocks; |
793 | union tree_node *supercontext; | |
794 | union tree_node *abstract_origin; | |
8da1b058 RS |
795 | }; |
796 | \f | |
797 | /* Define fields and accessors for nodes representing data types. */ | |
798 | ||
799 | /* See tree.def for documentation of the use of these fields. | |
800 | Look at the documentation of the various ..._TYPE tree codes. */ | |
801 | ||
12b195d9 ML |
802 | #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid) |
803 | #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size) | |
804 | #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit) | |
805 | #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode) | |
806 | #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values) | |
807 | #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values) | |
808 | #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values) | |
809 | #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval) | |
810 | #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval) | |
811 | #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values) | |
812 | #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval) | |
813 | #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval) | |
814 | #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to) | |
815 | #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to) | |
816 | #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval) | |
817 | #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval) | |
818 | #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision) | |
819 | #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address) | |
820 | #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer) | |
821 | #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name) | |
822 | #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant) | |
823 | #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant) | |
12b195d9 ML |
824 | #define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts) |
825 | #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context) | |
826 | #define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack) | |
827 | #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific) | |
8da1b058 | 828 | |
8ff0c1af MM |
829 | /* For aggregate types, information about this type, as a base type |
830 | for itself. Used in a language-dependent way for types that are | |
831 | neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */ | |
832 | #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo) | |
833 | ||
41472af8 MM |
834 | /* The (language-specific) typed-based alias set for this type. |
835 | Objects whose TYPE_ALIAS_SETs are different cannot alias each | |
836 | other. If the TYPE_ALIAS_SET is -1, no alias set has yet been | |
837 | assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this | |
838 | type can alias objects of any type. */ | |
839 | #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set) | |
840 | ||
841 | /* Nonzero iff the typed-based alias set for this type has been | |
842 | calculated. */ | |
843 | #define TYPE_ALIAS_SET_KNOWN_P(NODE) \ | |
844 | (TYPE_CHECK (NODE)->type.alias_set != -1) | |
845 | ||
bad1b4ba RK |
846 | /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply |
847 | to this type. */ | |
12b195d9 | 848 | #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes) |
bad1b4ba | 849 | |
869637e6 RS |
850 | /* The alignment necessary for objects of this type. |
851 | The value is an int, measured in bits. */ | |
12b195d9 | 852 | #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align) |
869637e6 | 853 | |
8da1b058 RS |
854 | #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE)) |
855 | ||
3635a54b RK |
856 | /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type |
857 | has BLKmode only because it lacks the alignment requirement for | |
858 | its size. */ | |
12b195d9 | 859 | #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag) |
8da1b058 RS |
860 | |
861 | /* Nonzero in a type considered volatile as a whole. */ | |
862 | #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag) | |
863 | ||
864 | /* Means this type is const-qualified. */ | |
865 | #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag) | |
866 | ||
3932261a MM |
867 | /* If nonzero, this type is `restrict'-qualified, in the C sense of |
868 | the term. */ | |
869 | #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag) | |
870 | ||
871 | /* There is a TYPE_QUAL value for each type qualifier. They can be | |
872 | combined by bitwise-or to form the complete set of qualifiers for a | |
873 | type. */ | |
874 | ||
875 | #define TYPE_UNQUALIFIED 0x0 | |
876 | #define TYPE_QUAL_CONST 0x1 | |
877 | #define TYPE_QUAL_VOLATILE 0x2 | |
878 | #define TYPE_QUAL_RESTRICT 0x4 | |
879 | ||
880 | /* The set of type qualifiers for this type. */ | |
881 | #define TYPE_QUALS(NODE) \ | |
14a774a9 RK |
882 | ((TYPE_READONLY(NODE) * TYPE_QUAL_CONST) \ |
883 | | (TYPE_VOLATILE(NODE) * TYPE_QUAL_VOLATILE) \ | |
884 | | (TYPE_RESTRICT(NODE) * TYPE_QUAL_RESTRICT)) | |
3932261a | 885 | |
9f86614b | 886 | /* These flags are available for each language front end to use internally. */ |
12b195d9 ML |
887 | #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0) |
888 | #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1) | |
889 | #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2) | |
890 | #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3) | |
891 | #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4) | |
892 | #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5) | |
893 | #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6) | |
8da1b058 | 894 | |
74a3fd26 PB |
895 | /* If set in an ARRAY_TYPE, indicates a string type (for languages |
896 | that distinguish string from array of char). | |
897 | If set in a SET_TYPE, indicates a bitstring type. */ | |
12b195d9 | 898 | #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag) |
74a3fd26 | 899 | |
2fb2b21c PB |
900 | /* If non-NULL, this is a upper bound of the size (in bytes) of an |
901 | object of the given ARRAY_TYPE. This allows temporaries to be allocated. */ | |
902 | #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE) | |
903 | ||
4ac3d994 JM |
904 | /* Indicates that objects of this type must be initialized by calling a |
905 | function when they are created. */ | |
12b195d9 | 906 | #define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag) |
4ac3d994 | 907 | |
adb23061 RK |
908 | /* Indicates that objects of this type (a UNION_TYPE), should be passed |
909 | the same way that the first union alternative would be passed. */ | |
12b195d9 | 910 | #define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag) |
adb23061 | 911 | |
956d6950 | 912 | /* Indicated that objects of this type should be laid out in as |
9e357cd8 | 913 | compact a way as possible. */ |
12b195d9 | 914 | #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag) |
9e357cd8 | 915 | |
8da1b058 RS |
916 | struct tree_type |
917 | { | |
918 | char common[sizeof (struct tree_common)]; | |
919 | union tree_node *values; | |
920 | union tree_node *size; | |
ead17059 | 921 | union tree_node *size_unit; |
bad1b4ba | 922 | union tree_node *attributes; |
8da1b058 RS |
923 | unsigned uid; |
924 | ||
bad1b4ba | 925 | unsigned char precision; |
8da1b058 RS |
926 | #ifdef ONLY_INT_FIELDS |
927 | int mode : 8; | |
928 | #else | |
929 | enum machine_mode mode : 8; | |
930 | #endif | |
bad1b4ba | 931 | |
74a3fd26 | 932 | unsigned string_flag : 1; |
8da1b058 | 933 | unsigned no_force_blk_flag : 1; |
4ac3d994 | 934 | unsigned needs_constructing_flag : 1; |
adb23061 | 935 | unsigned transparent_union_flag : 1; |
9e357cd8 | 936 | unsigned packed_flag : 1; |
3932261a MM |
937 | unsigned restrict_flag : 1; |
938 | ||
8da1b058 RS |
939 | unsigned lang_flag_0 : 1; |
940 | unsigned lang_flag_1 : 1; | |
941 | unsigned lang_flag_2 : 1; | |
942 | unsigned lang_flag_3 : 1; | |
943 | unsigned lang_flag_4 : 1; | |
944 | unsigned lang_flag_5 : 1; | |
945 | unsigned lang_flag_6 : 1; | |
3932261a | 946 | /* room for 3 more bits */ |
8da1b058 | 947 | |
69b78d8d | 948 | unsigned int align; |
8da1b058 RS |
949 | union tree_node *pointer_to; |
950 | union tree_node *reference_to; | |
a0665b77 | 951 | union {int address; char *pointer; } symtab; |
8da1b058 RS |
952 | union tree_node *name; |
953 | union tree_node *minval; | |
954 | union tree_node *maxval; | |
955 | union tree_node *next_variant; | |
956 | union tree_node *main_variant; | |
957 | union tree_node *binfo; | |
958 | union tree_node *noncopied_parts; | |
959 | union tree_node *context; | |
b20e883e | 960 | struct obstack *obstack; |
41472af8 | 961 | int alias_set; |
8da1b058 RS |
962 | /* Points to a structure whose details depend on the language in use. */ |
963 | struct lang_type *lang_specific; | |
964 | }; | |
965 | \f | |
966 | /* Define accessor macros for information about type inheritance | |
967 | and basetypes. | |
968 | ||
969 | A "basetype" means a particular usage of a data type for inheritance | |
970 | in another type. Each such basetype usage has its own "binfo" | |
971 | object to describe it. The binfo object is a TREE_VEC node. | |
972 | ||
973 | Inheritance is represented by the binfo nodes allocated for a | |
974 | given type. For example, given types C and D, such that D is | |
975 | inherited by C, 3 binfo nodes will be allocated: one for describing | |
976 | the binfo properties of C, similarly one for D, and one for | |
977 | describing the binfo properties of D as a base type for C. | |
978 | Thus, given a pointer to class C, one can get a pointer to the binfo | |
979 | of D acting as a basetype for C by looking at C's binfo's basetypes. */ | |
980 | ||
981 | /* The actual data type node being inherited in this basetype. */ | |
982 | #define BINFO_TYPE(NODE) TREE_TYPE (NODE) | |
983 | ||
984 | /* The offset where this basetype appears in its containing type. | |
985 | BINFO_OFFSET slot holds the offset (in bytes) | |
986 | from the base of the complete object to the base of the part of the | |
987 | object that is allocated on behalf of this `type'. | |
988 | This is always 0 except when there is multiple inheritance. */ | |
989 | ||
990 | #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1) | |
991 | #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE)) | |
7d02bbef | 992 | #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) |
8da1b058 RS |
993 | |
994 | /* The virtual function table belonging to this basetype. Virtual | |
995 | function tables provide a mechanism for run-time method dispatching. | |
996 | The entries of a virtual function table are language-dependent. */ | |
997 | ||
998 | #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2) | |
999 | #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE)) | |
1000 | ||
1001 | /* The virtual functions in the virtual function table. This is | |
1002 | a TREE_LIST that is used as an initial approximation for building | |
1003 | a virtual function table for this basetype. */ | |
1004 | #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3) | |
1005 | #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE)) | |
1006 | ||
1007 | /* A vector of additional binfos for the types inherited by this basetype. | |
1008 | ||
1009 | If this basetype describes type D as inherited in C, | |
1010 | and if the basetypes of D are E anf F, | |
1011 | then this vector contains binfos for inheritance of E and F by C. | |
1012 | ||
1013 | ??? This could probably be done by just allocating the | |
1014 | base types at the end of this TREE_VEC (instead of using | |
1015 | another TREE_VEC). This would simplify the calculation | |
1016 | of how many basetypes a given type had. */ | |
1017 | #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4) | |
1018 | #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4) | |
1019 | ||
7d02bbef JM |
1020 | /* Accessor macro to get to the Nth basetype of this basetype. */ |
1021 | #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N)) | |
1022 | #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N))) | |
1023 | ||
2cc3ac7a MS |
1024 | /* For a BINFO record describing an inheritance, this yields a pointer |
1025 | to the artificial FIELD_DECL node which contains the "virtual base | |
1026 | class pointer" for the given inheritance. */ | |
2cc3ac7a MS |
1027 | #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5) |
1028 | ||
bbc0e641 JM |
1029 | /* The size of a base class subobject of this type. Not all frontends |
1030 | currently allocate the space for this field. */ | |
7d02bbef JM |
1031 | #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6) |
1032 | #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE)) | |
8da1b058 RS |
1033 | |
1034 | /* Slot used to build a chain that represents a use of inheritance. | |
1035 | For example, if X is derived from Y, and Y is derived from Z, | |
1036 | then this field can be used to link the binfo node for X to | |
1037 | the binfo node for X's Y to represent the use of inheritance | |
1038 | from X to Y. Similarly, this slot of the binfo node for X's Y | |
1039 | can point to the Z from which Y is inherited (in X's inheritance | |
1040 | hierarchy). In this fashion, one can represent and traverse specific | |
1041 | uses of inheritance using the binfo nodes themselves (instead of | |
1042 | consing new space pointing to binfo nodes). | |
1043 | It is up to the language-dependent front-ends to maintain | |
1044 | this information as necessary. */ | |
1045 | #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0) | |
1046 | \f | |
1047 | /* Define fields and accessors for nodes representing declared names. */ | |
1048 | ||
7766fe8e JM |
1049 | /* Nonzero if DECL represents a decl. */ |
1050 | #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd') | |
8da1b058 RS |
1051 | /* This is the name of the object as written by the user. |
1052 | It is an IDENTIFIER_NODE. */ | |
12b195d9 | 1053 | #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name) |
8da1b058 RS |
1054 | /* This is the name of the object as the assembler will see it |
1055 | (but before any translations made by ASM_OUTPUT_LABELREF). | |
1056 | Often this is the same as DECL_NAME. | |
1057 | It is an IDENTIFIER_NODE. */ | |
12b195d9 | 1058 | #define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name) |
868e8789 DE |
1059 | /* Records the section name in a section attribute. Used to pass |
1060 | the name from decl_attributes to make_function_rtl and make_decl_rtl. */ | |
12b195d9 | 1061 | #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name) |
9b800101 | 1062 | /* For FIELD_DECLs, this is the |
3635a54b RK |
1063 | RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is |
1064 | a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL, | |
a082c85a JM |
1065 | and CONST_DECL nodes, this points to either the FUNCTION_DECL for the |
1066 | containing function, the RECORD_TYPE or UNION_TYPE for the containing | |
1067 | type, or NULL_TREE if the given decl has "file scope". */ | |
12b195d9 ML |
1068 | #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context) |
1069 | #define DECL_FIELD_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context) | |
77cf75a8 RK |
1070 | /* In a DECL this is the field where configuration dependent machine |
1071 | attributes are store */ | |
12b195d9 | 1072 | #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes) |
8da1b058 RS |
1073 | /* In a FIELD_DECL, this is the field position, counting in bits, |
1074 | of the bit closest to the beginning of the structure. */ | |
12b195d9 | 1075 | #define DECL_FIELD_BITPOS(NODE) (DECL_CHECK (NODE)->decl.arguments) |
8da1b058 | 1076 | /* In a FIELD_DECL, this indicates whether the field was a bit-field and |
8e148bef RS |
1077 | if so, the type that was originally specified for it. |
1078 | TREE_TYPE may have been modified (in finish_struct). */ | |
12b195d9 | 1079 | #define DECL_BIT_FIELD_TYPE(NODE) (DECL_CHECK (NODE)->decl.result) |
8da1b058 RS |
1080 | /* In FUNCTION_DECL, a chain of ..._DECL nodes. */ |
1081 | /* VAR_DECL and PARM_DECL reserve the arguments slot | |
1082 | for language-specific uses. */ | |
12b195d9 | 1083 | #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments) |
8da1b058 | 1084 | /* In FUNCTION_DECL, holds the decl for the return value. */ |
12b195d9 | 1085 | #define DECL_RESULT(NODE) (DECL_CHECK (NODE)->decl.result) |
9506a28d | 1086 | /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ |
12b195d9 | 1087 | #define DECL_ORIGINAL_TYPE(NODE) (DECL_CHECK (NODE)->decl.result) |
8da1b058 | 1088 | /* In PARM_DECL, holds the type as written (perhaps a function or array). */ |
12b195d9 | 1089 | #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (DECL_CHECK (NODE)->decl.result) |
8da1b058 RS |
1090 | /* For a FUNCTION_DECL, holds the tree of BINDINGs. |
1091 | For a VAR_DECL, holds the initial value. | |
1092 | For a PARM_DECL, not used--default | |
1093 | values for parameters are encoded in the type of the function, | |
1094 | not in the PARM_DECL slot. */ | |
12b195d9 | 1095 | #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial) |
8da1b058 RS |
1096 | /* For a PARM_DECL, records the data type used to pass the argument, |
1097 | which may be different from the type seen in the program. */ | |
12b195d9 | 1098 | #define DECL_ARG_TYPE(NODE) (DECL_CHECK (NODE)->decl.initial) /* In PARM_DECL. */ |
3635a54b RK |
1099 | /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which |
1100 | if nonzero, indicates that the field occupies the type. */ | |
12b195d9 | 1101 | #define DECL_QUALIFIER(NODE) (DECL_CHECK (NODE)->decl.initial) |
8da1b058 | 1102 | /* These two fields describe where in the source code the declaration was. */ |
12b195d9 ML |
1103 | #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename) |
1104 | #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum) | |
8da1b058 RS |
1105 | /* Holds the size of the datum, as a tree expression. |
1106 | Need not be constant. */ | |
12b195d9 | 1107 | #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size) |
8da1b058 | 1108 | /* Holds the alignment required for the datum. */ |
12b195d9 | 1109 | #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.frame_size.u) |
17c73321 RK |
1110 | /* Holds the machine mode corresponding to the declaration of a variable or |
1111 | field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a | |
1112 | FIELD_DECL. */ | |
12b195d9 | 1113 | #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode) |
17c73321 RK |
1114 | /* Holds the RTL expression for the value of a variable or function. If |
1115 | PROMOTED_MODE is defined, the mode of this expression may not be same | |
1116 | as DECL_MODE. In that case, DECL_MODE contains the mode corresponding | |
1117 | to the variable's data type, while the mode | |
1118 | of DECL_RTL is the mode actually used to contain the data. */ | |
12b195d9 | 1119 | #define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl) |
0dfa1860 MM |
1120 | /* Holds an INSN_LIST of all of the live ranges in which the variable |
1121 | has been moved to a possibly different register. */ | |
12b195d9 | 1122 | #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl) |
8da1b058 RS |
1123 | /* For PARM_DECL, holds an RTL for the stack slot or register |
1124 | where the data was actually passed. */ | |
12b195d9 | 1125 | #define DECL_INCOMING_RTL(NODE) (DECL_CHECK (NODE)->decl.saved_insns.r) |
8da1b058 | 1126 | /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */ |
49ad7cfa | 1127 | #define DECL_SAVED_INSNS(NODE) (DECL_CHECK (NODE)->decl.saved_insns.f) |
66321686 RS |
1128 | /* For FUNCTION_DECL, if it is inline, |
1129 | holds the size of the stack frame, as an integer. */ | |
12b195d9 | 1130 | #define DECL_FRAME_SIZE(NODE) (DECL_CHECK (NODE)->decl.frame_size.i) |
66321686 RS |
1131 | /* For FUNCTION_DECL, if it is built-in, |
1132 | this identifies which built-in operation it is. */ | |
26db82d8 BS |
1133 | #define DECL_FUNCTION_CODE(NODE) (DECL_CHECK (NODE)->decl.frame_size.f.code) |
1134 | #define DECL_SET_FUNCTION_CODE(NODE,VAL) (DECL_CHECK (NODE)->decl.frame_size.f.code = (VAL)) | |
77f934bb | 1135 | /* For a FIELD_DECL, holds the size of the member as an integer. */ |
12b195d9 | 1136 | #define DECL_FIELD_SIZE(NODE) (DECL_CHECK (NODE)->decl.saved_insns.i) |
8da1b058 RS |
1137 | |
1138 | /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. | |
1139 | Before the struct containing the FUNCTION_DECL is laid out, | |
1140 | DECL_VINDEX may point to a FUNCTION_DECL in a base class which | |
1141 | is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual | |
1142 | function. When the class is laid out, this pointer is changed | |
1143 | to an INTEGER_CST node which is suitable for use as an index | |
1144 | into the virtual function table. */ | |
12b195d9 | 1145 | #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex) |
8da1b058 RS |
1146 | /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in |
1147 | which this FIELD_DECL is defined. This information is needed when | |
1148 | writing debugging information about vfield and vbase decls for C++. */ | |
12b195d9 | 1149 | #define DECL_FCONTEXT(NODE) (DECL_CHECK (NODE)->decl.vindex) |
8da1b058 | 1150 | |
0e77444b | 1151 | /* Every ..._DECL node gets a unique number. */ |
12b195d9 | 1152 | #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid) |
0e77444b | 1153 | |
c5caa350 CH |
1154 | /* For any sort of a ..._DECL node, this points to the original (abstract) |
1155 | decl node which this decl is an instance of, or else it is NULL indicating | |
4a7d05dc DE |
1156 | that this decl is not an instance of some other decl. For example, |
1157 | in a nested declaration of an inline function, this points back to the | |
1158 | definition. */ | |
12b195d9 | 1159 | #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin) |
c5caa350 | 1160 | |
02e24c7a MM |
1161 | /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract |
1162 | origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ | |
1163 | #define DECL_ORIGIN(NODE) \ | |
1164 | (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE) | |
1165 | ||
c5caa350 CH |
1166 | /* Nonzero for any sort of ..._DECL node means this decl node represents |
1167 | an inline instance of some original (abstract) decl from an inline function; | |
3d62d651 ZW |
1168 | suppress any warnings about shadowing some other variable. |
1169 | FUNCTION_DECL nodes can also have their abstract origin set to themselves | |
1170 | (see save_for_inline_copying). */ | |
1171 | #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \ | |
1172 | && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) | |
8da1b058 RS |
1173 | |
1174 | /* Nonzero if a _DECL means that the name of this decl should be ignored | |
1175 | for symbolic debug purposes. */ | |
12b195d9 | 1176 | #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag) |
8da1b058 | 1177 | |
c5caa350 CH |
1178 | /* Nonzero for a given ..._DECL node means that this node represents an |
1179 | "abstract instance" of the given declaration (e.g. in the original | |
1180 | declaration of an inline function). When generating symbolic debugging | |
9faa82d8 | 1181 | information, we mustn't try to generate any address information for nodes |
c5caa350 CH |
1182 | marked as "abstract instances" because we don't actually generate |
1183 | any code or allocate any data space for such instances. */ | |
12b195d9 | 1184 | #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag) |
c5caa350 | 1185 | |
3110a56e RS |
1186 | /* Nonzero if a _DECL means that no warnings should be generated just |
1187 | because this decl is unused. */ | |
12b195d9 | 1188 | #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag) |
3110a56e | 1189 | |
2c0d84d6 MS |
1190 | /* Nonzero for a given ..._DECL node means that this node should be |
1191 | put in .common, if possible. If a DECL_INITIAL is given, and it | |
1192 | is not error_mark_node, then the decl cannot be put in .common. */ | |
12b195d9 | 1193 | #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag) |
2c0d84d6 | 1194 | |
3110a56e | 1195 | /* Language-specific decl information. */ |
12b195d9 | 1196 | #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific) |
8da1b058 RS |
1197 | |
1198 | /* In a VAR_DECL or FUNCTION_DECL, | |
1199 | nonzero means external reference: | |
1200 | do not allocate storage, and refer to a definition elsewhere. */ | |
12b195d9 | 1201 | #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag) |
8da1b058 | 1202 | |
2ce3c6c6 JM |
1203 | /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority |
1204 | initializatons. */ | |
1205 | #define DEFAULT_INIT_PRIORITY 65535 | |
1206 | #define MAX_INIT_PRIORITY 65535 | |
9a6e70c9 | 1207 | #define MAX_RESERVED_INIT_PRIORITY 100 |
2ce3c6c6 | 1208 | |
60e9e4b7 DE |
1209 | /* In a TYPE_DECL |
1210 | nonzero means the detail info about this type is not dumped into stabs. | |
5a783256 | 1211 | Instead it will generate cross reference ('x') of names. |
60e9e4b7 | 1212 | This uses the same flag as DECL_EXTERNAL. */ |
12b195d9 | 1213 | #define TYPE_DECL_SUPPRESS_DEBUG(NODE) (DECL_CHECK (NODE)->decl.external_flag) |
60e9e4b7 DE |
1214 | |
1215 | ||
a5f99f01 | 1216 | /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ |
12b195d9 | 1217 | #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag) |
a5f99f01 RK |
1218 | /* In LABEL_DECL nodes, nonzero means that an error message about |
1219 | jumping into such a binding contour has been printed for this label. */ | |
12b195d9 | 1220 | #define DECL_ERROR_ISSUED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag) |
5a1c7968 | 1221 | /* In a FIELD_DECL, indicates this field should be bit-packed. */ |
12b195d9 | 1222 | #define DECL_PACKED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag) |
a5f99f01 RK |
1223 | /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a |
1224 | static chain is not needed. */ | |
12b195d9 | 1225 | #define DECL_NO_STATIC_CHAIN(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag) |
8da1b058 RS |
1226 | |
1227 | /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. | |
1228 | For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. | |
1229 | ||
1230 | For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. | |
1231 | ||
1232 | Also set in some languages for variables, etc., outside the normal | |
1233 | lexical scope, such as class instance variables. */ | |
12b195d9 | 1234 | #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag) |
8da1b058 RS |
1235 | |
1236 | /* Nonzero in a FUNCTION_DECL means this function can be substituted | |
1237 | where it is called. */ | |
12b195d9 | 1238 | #define DECL_INLINE(NODE) (DECL_CHECK (NODE)->decl.inline_flag) |
8da1b058 RS |
1239 | |
1240 | /* Nonzero in a FUNCTION_DECL means this is a built-in function | |
1241 | that is not specified by ansi C and that users are supposed to be allowed | |
1242 | to redefine for any purpose whatever. */ | |
1243 | #define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag) | |
1244 | ||
140592a0 AG |
1245 | /* Nonzero in a FUNCTION_DECL means this function should be treated |
1246 | as if it were a malloc, meaning it returns a pointer that is | |
1247 | not an alias. */ | |
1248 | #define DECL_IS_MALLOC(NODE) (DECL_CHECK (NODE)->decl.malloc_flag) | |
1249 | ||
8da1b058 RS |
1250 | /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed |
1251 | specially. */ | |
12b195d9 | 1252 | #define DECL_BIT_FIELD(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag) |
8da1b058 RS |
1253 | /* In a LABEL_DECL, nonzero means label was defined inside a binding |
1254 | contour that restored a stack level and which is now exited. */ | |
12b195d9 | 1255 | #define DECL_TOO_LATE(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag) |
26db82d8 | 1256 | |
8da1b058 | 1257 | /* In a FUNCTION_DECL, nonzero means a built in function. */ |
26db82d8 BS |
1258 | #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN) |
1259 | /* For a builtin function, identify which part of the compiler defined it. */ | |
c465d914 | 1260 | #define DECL_BUILT_IN_CLASS(NODE) (DECL_CHECK (NODE)->decl.frame_size.f.bclass) |
26db82d8 | 1261 | |
b8af45d0 RS |
1262 | /* In a VAR_DECL that's static, |
1263 | nonzero if the space is in the text section. */ | |
12b195d9 | 1264 | #define DECL_IN_TEXT_SECTION(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag) |
8da1b058 | 1265 | |
5a1c7968 | 1266 | /* Used in VAR_DECLs to indicate that the variable is a vtable. |
2458b9c0 JM |
1267 | Used in FIELD_DECLs for vtable pointers. |
1268 | Used in FUNCTION_DECLs to indicate that the function is virtual. */ | |
12b195d9 | 1269 | #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag) |
8da1b058 | 1270 | |
30801830 JM |
1271 | /* Used to indicate that the linkage status of this DECL is not yet known, |
1272 | so it should not be output now. */ | |
12b195d9 | 1273 | #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output) |
30801830 | 1274 | |
adb23061 RK |
1275 | /* Used in PARM_DECLs whose type are unions to indicate that the |
1276 | argument should be passed in the same way that the first union | |
1277 | alternative would be passed. */ | |
12b195d9 | 1278 | #define DECL_TRANSPARENT_UNION(NODE) (DECL_CHECK (NODE)->decl.transparent_union) |
adb23061 | 1279 | |
2c5f4139 JM |
1280 | /* Used in FUNCTION_DECLs to indicate that they should be run automatically |
1281 | at the beginning or end of execution. */ | |
12b195d9 ML |
1282 | #define DECL_STATIC_CONSTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_ctor_flag) |
1283 | #define DECL_STATIC_DESTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_dtor_flag) | |
2c5f4139 | 1284 | |
3edbc4b9 | 1285 | /* Used to indicate that this DECL represents a compiler-generated entity. */ |
12b195d9 | 1286 | #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag) |
3edbc4b9 | 1287 | |
daefd78b | 1288 | /* Used to indicate that this DECL has weak linkage. */ |
12b195d9 | 1289 | #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag) |
daefd78b | 1290 | |
c5bd82cb JM |
1291 | /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in |
1292 | multiple translation units should be merged. */ | |
12b195d9 | 1293 | #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union) |
c5bd82cb | 1294 | |
59182242 MM |
1295 | /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need |
1296 | not be put out unless it is needed in this translation unit. | |
1297 | Entities like this are shared across translation units (like weak | |
1298 | entities), but are guaranteed to be generated by any translation | |
1299 | unit that needs them, and therefore need not be put out anywhere | |
1300 | where they are not needed. DECL_COMDAT is just a hint to the | |
1301 | back-end; it is up to front-ends which set this flag to ensure | |
1302 | that there will never be any harm, other than bloat, in putting out | |
1303 | something which is DECL_COMDAT. */ | |
1304 | #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag) | |
1305 | ||
07417085 KR |
1306 | /* Used in FUNCTION_DECLs to indicate that function entry and exit should |
1307 | be instrumented with calls to support routines. */ | |
1308 | #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) ((NODE)->decl.no_instrument_function_entry_exit) | |
1309 | ||
c5c76735 JL |
1310 | /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be |
1311 | disabled in this function. */ | |
7d384cc0 KR |
1312 | #define DECL_NO_CHECK_MEMORY_USAGE(NODE) ((NODE)->decl.no_check_memory_usage) |
1313 | ||
a157febd GK |
1314 | /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be |
1315 | disabled in this function. */ | |
1316 | #define DECL_NO_LIMIT_STACK(NODE) ((NODE)->decl.no_limit_stack) | |
1317 | ||
8da1b058 | 1318 | /* Additional flags for language-specific uses. */ |
12b195d9 ML |
1319 | #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0) |
1320 | #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1) | |
1321 | #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2) | |
1322 | #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3) | |
1323 | #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4) | |
1324 | #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5) | |
1325 | #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6) | |
1326 | #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7) | |
8da1b058 | 1327 | |
27da1b4d MK |
1328 | /* Used to indicate that the pointer to this DECL cannot be treated as |
1329 | an address constant. */ | |
1330 | #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p) | |
1331 | ||
3932261a MM |
1332 | /* Used to indicate an alias set for the memory pointed to by this |
1333 | particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have | |
1334 | pointer (or reference) type. */ | |
1335 | #define DECL_POINTER_ALIAS_SET(NODE) \ | |
1336 | (DECL_CHECK (NODE)->decl.pointer_alias_set) | |
1337 | ||
1338 | /* Nonzero if an alias set has been assigned to this declaration. */ | |
1339 | #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \ | |
1340 | (DECL_POINTER_ALIAS_SET (NODE) != - 1) | |
1341 | ||
8da1b058 RS |
1342 | struct tree_decl |
1343 | { | |
1344 | char common[sizeof (struct tree_common)]; | |
1345 | char *filename; | |
1346 | int linenum; | |
0e77444b | 1347 | unsigned int uid; |
09f532c9 | 1348 | union tree_node *size; |
8da1b058 RS |
1349 | #ifdef ONLY_INT_FIELDS |
1350 | int mode : 8; | |
1351 | #else | |
1352 | enum machine_mode mode : 8; | |
1353 | #endif | |
8da1b058 RS |
1354 | |
1355 | unsigned external_flag : 1; | |
1356 | unsigned nonlocal_flag : 1; | |
1357 | unsigned regdecl_flag : 1; | |
1358 | unsigned inline_flag : 1; | |
1359 | unsigned bit_field_flag : 1; | |
1360 | unsigned virtual_flag : 1; | |
8da1b058 | 1361 | unsigned ignored_flag : 1; |
c5caa350 | 1362 | unsigned abstract_flag : 1; |
8da1b058 | 1363 | |
3110a56e | 1364 | unsigned in_system_header_flag : 1; |
2c0d84d6 | 1365 | unsigned common_flag : 1; |
30801830 | 1366 | unsigned defer_output : 1; |
adb23061 | 1367 | unsigned transparent_union : 1; |
2c5f4139 JM |
1368 | unsigned static_ctor_flag : 1; |
1369 | unsigned static_dtor_flag : 1; | |
3edbc4b9 | 1370 | unsigned artificial_flag : 1; |
daefd78b | 1371 | unsigned weak_flag : 1; |
3110a56e | 1372 | |
8da1b058 RS |
1373 | unsigned lang_flag_0 : 1; |
1374 | unsigned lang_flag_1 : 1; | |
1375 | unsigned lang_flag_2 : 1; | |
1376 | unsigned lang_flag_3 : 1; | |
1377 | unsigned lang_flag_4 : 1; | |
1378 | unsigned lang_flag_5 : 1; | |
1379 | unsigned lang_flag_6 : 1; | |
1380 | unsigned lang_flag_7 : 1; | |
1381 | ||
27da1b4d | 1382 | unsigned non_addr_const_p : 1; |
07417085 | 1383 | unsigned no_instrument_function_entry_exit : 1; |
7d384cc0 | 1384 | unsigned no_check_memory_usage : 1; |
59182242 | 1385 | unsigned comdat_flag : 1; |
140592a0 | 1386 | unsigned malloc_flag : 1; |
a157febd | 1387 | unsigned no_limit_stack : 1; |
27da1b4d | 1388 | |
09f532c9 RK |
1389 | /* For a FUNCTION_DECL, if inline, this is the size of frame needed. |
1390 | If built-in, this is the code for which built-in function. | |
1391 | For other kinds of decls, this is DECL_ALIGN. */ | |
1392 | union { | |
1393 | int i; | |
1394 | unsigned int u; | |
26db82d8 BS |
1395 | struct |
1396 | { | |
1397 | unsigned int code:24; | |
c465d914 | 1398 | unsigned int bclass:8; |
26db82d8 | 1399 | } f; |
09f532c9 RK |
1400 | } frame_size; |
1401 | ||
8da1b058 RS |
1402 | union tree_node *name; |
1403 | union tree_node *context; | |
1404 | union tree_node *arguments; | |
1405 | union tree_node *result; | |
1406 | union tree_node *initial; | |
c5caa350 | 1407 | union tree_node *abstract_origin; |
8da1b058 | 1408 | union tree_node *assembler_name; |
868e8789 | 1409 | union tree_node *section_name; |
77cf75a8 | 1410 | union tree_node *machine_attributes; |
8da1b058 RS |
1411 | struct rtx_def *rtl; /* acts as link to register transfer language |
1412 | (rtl) info */ | |
0dfa1860 | 1413 | struct rtx_def *live_range_rtl; |
77f934bb | 1414 | /* For FUNCTION_DECLs: points to insn that constitutes its definition |
e5e809f4 | 1415 | on the permanent obstack. For FIELD_DECL, this is DECL_FIELD_SIZE. */ |
77f934bb | 1416 | union { |
49ad7cfa | 1417 | struct function *f; |
77f934bb | 1418 | struct rtx_def *r; |
282d22c6 | 1419 | HOST_WIDE_INT i; |
77f934bb | 1420 | } saved_insns; |
8da1b058 | 1421 | union tree_node *vindex; |
3932261a | 1422 | int pointer_alias_set; |
8da1b058 RS |
1423 | /* Points to a structure whose details depend on the language in use. */ |
1424 | struct lang_decl *lang_specific; | |
1425 | }; | |
1426 | \f | |
1427 | /* Define the overall contents of a tree node. | |
1428 | It may be any of the structures declared above | |
1429 | for various types of node. */ | |
1430 | ||
1431 | union tree_node | |
1432 | { | |
1433 | struct tree_common common; | |
1434 | struct tree_int_cst int_cst; | |
1435 | struct tree_real_cst real_cst; | |
1436 | struct tree_string string; | |
1437 | struct tree_complex complex; | |
1438 | struct tree_identifier identifier; | |
1439 | struct tree_decl decl; | |
1440 | struct tree_type type; | |
1441 | struct tree_list list; | |
1442 | struct tree_vec vec; | |
1443 | struct tree_exp exp; | |
61131fa2 | 1444 | struct tree_block block; |
8da1b058 | 1445 | }; |
1d2a8985 | 1446 | \f |
81b3411c BS |
1447 | /* Standard named or nameless data types of the C compiler. */ |
1448 | ||
1449 | enum tree_index | |
1450 | { | |
1451 | TI_ERROR_MARK, | |
1452 | TI_INTQI_TYPE, | |
1453 | TI_INTHI_TYPE, | |
1454 | TI_INTSI_TYPE, | |
1455 | TI_INTDI_TYPE, | |
1456 | TI_INTTI_TYPE, | |
1457 | ||
1458 | TI_UINTQI_TYPE, | |
1459 | TI_UINTHI_TYPE, | |
1460 | TI_UINTSI_TYPE, | |
1461 | TI_UINTDI_TYPE, | |
1462 | TI_UINTTI_TYPE, | |
1463 | ||
1464 | TI_CHAR_TYPE, | |
1465 | TI_SIGNED_CHAR_TYPE, | |
1466 | TI_UNSIGNED_CHAR_TYPE, | |
1467 | TI_INTEGER_TYPE, | |
1468 | TI_UNSIGNED_TYPE, | |
1469 | TI_SHORT_INTEGER_TYPE, | |
1470 | TI_SHORT_UNSIGNED_TYPE, | |
1471 | TI_LONG_INTEGER_TYPE, | |
1472 | TI_LONG_UNSIGNED_TYPE, | |
1473 | TI_LONG_LONG_INTEGER_TYPE, | |
1474 | TI_LONG_LONG_UNSIGNED_TYPE, | |
1475 | ||
1476 | TI_INTEGER_ZERO, | |
1477 | TI_INTEGER_ONE, | |
1478 | TI_NULL_POINTER, | |
1479 | ||
1480 | TI_SIZE_ZERO, | |
1481 | TI_SIZE_ONE, | |
1482 | ||
1483 | TI_COMPLEX_INTEGER_TYPE, | |
1484 | TI_COMPLEX_FLOAT_TYPE, | |
1485 | TI_COMPLEX_DOUBLE_TYPE, | |
1486 | TI_COMPLEX_LONG_DOUBLE_TYPE, | |
1487 | ||
1488 | TI_FLOAT_TYPE, | |
1489 | TI_DOUBLE_TYPE, | |
1490 | TI_LONG_DOUBLE_TYPE, | |
1491 | ||
1492 | TI_VOID_TYPE, | |
1493 | TI_PTR_TYPE, | |
1494 | TI_CONST_PTR_TYPE, | |
1495 | TI_PTRDIFF_TYPE, | |
1496 | TI_VA_LIST_TYPE, | |
1497 | ||
1498 | TI_MAX | |
1499 | }; | |
1500 | ||
1501 | extern tree global_trees[TI_MAX]; | |
1502 | ||
1503 | #define error_mark_node global_trees[TI_ERROR_MARK] | |
1504 | ||
1505 | #define intQI_type_node global_trees[TI_INTQI_TYPE] | |
1506 | #define intHI_type_node global_trees[TI_INTHI_TYPE] | |
1507 | #define intSI_type_node global_trees[TI_INTSI_TYPE] | |
1508 | #define intDI_type_node global_trees[TI_INTDI_TYPE] | |
1509 | #define intTI_type_node global_trees[TI_INTTI_TYPE] | |
1510 | ||
1511 | #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE] | |
1512 | #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE] | |
1513 | #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE] | |
1514 | #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE] | |
1515 | #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE] | |
1516 | ||
1517 | #define char_type_node global_trees[TI_CHAR_TYPE] | |
1518 | #define signed_char_type_node global_trees[TI_SIGNED_CHAR_TYPE] | |
1519 | #define unsigned_char_type_node global_trees[TI_UNSIGNED_CHAR_TYPE] | |
1520 | #define short_integer_type_node global_trees[TI_SHORT_INTEGER_TYPE] | |
1521 | #define short_unsigned_type_node global_trees[TI_SHORT_UNSIGNED_TYPE] | |
1522 | #define integer_type_node global_trees[TI_INTEGER_TYPE] | |
1523 | #define unsigned_type_node global_trees[TI_UNSIGNED_TYPE] | |
1524 | #define long_integer_type_node global_trees[TI_LONG_INTEGER_TYPE] | |
1525 | #define long_unsigned_type_node global_trees[TI_LONG_UNSIGNED_TYPE] | |
1526 | #define long_long_integer_type_node global_trees[TI_LONG_LONG_INTEGER_TYPE] | |
1527 | #define long_long_unsigned_type_node global_trees[TI_LONG_LONG_UNSIGNED_TYPE] | |
1528 | ||
1529 | #define integer_zero_node global_trees[TI_INTEGER_ZERO] | |
1530 | #define integer_one_node global_trees[TI_INTEGER_ONE] | |
1531 | #define size_zero_node global_trees[TI_SIZE_ZERO] | |
1532 | #define size_one_node global_trees[TI_SIZE_ONE] | |
1533 | #define null_pointer_node global_trees[TI_NULL_POINTER] | |
1534 | ||
1535 | #define float_type_node global_trees[TI_FLOAT_TYPE] | |
1536 | #define double_type_node global_trees[TI_DOUBLE_TYPE] | |
1537 | #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE] | |
1538 | ||
1539 | #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE] | |
1540 | #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE] | |
1541 | #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE] | |
1542 | #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE] | |
1543 | ||
1544 | #define void_type_node global_trees[TI_VOID_TYPE] | |
1545 | #define ptr_type_node global_trees[TI_PTR_TYPE] | |
1546 | #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE] | |
1547 | #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE] | |
1548 | #define va_list_type_node global_trees[TI_VA_LIST_TYPE] | |
1549 | \f | |
f837a861 MM |
1550 | #define NULL_TREE (tree) NULL |
1551 | ||
e5d70561 RK |
1552 | /* The following functions accept a wide integer argument. Rather than |
1553 | having to cast on every function call, we use a macro instead, that is | |
1554 | defined here and in rtl.h. */ | |
1555 | ||
1556 | #ifndef exact_log2 | |
a1d061a1 JL |
1557 | #define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N)) |
1558 | #define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N)) | |
e5d70561 | 1559 | #endif |
a1d061a1 JL |
1560 | extern int exact_log2_wide PROTO((unsigned HOST_WIDE_INT)); |
1561 | extern int floor_log2_wide PROTO((unsigned HOST_WIDE_INT)); | |
e5d70561 | 1562 | |
f837a861 MM |
1563 | extern char *oballoc PROTO((int)); |
1564 | extern char *permalloc PROTO((int)); | |
1565 | extern char *savealloc PROTO((int)); | |
22ef8a13 | 1566 | extern char *expralloc PROTO((int)); |
8da1b058 RS |
1567 | |
1568 | /* Lowest level primitive for allocating a node. | |
1569 | The TREE_CODE is the only argument. Contents are initialized | |
1570 | to zero except for a few of the common fields. */ | |
1571 | ||
f837a861 | 1572 | extern tree make_node PROTO((enum tree_code)); |
0f4fd75d FS |
1573 | extern tree make_lang_type PROTO((enum tree_code)); |
1574 | extern tree (*make_lang_type_fn) PROTO((enum tree_code)); | |
8da1b058 RS |
1575 | |
1576 | /* Make a copy of a node, with all the same contents except | |
1577 | for TREE_PERMANENT. (The copy is permanent | |
1578 | iff nodes being made now are permanent.) */ | |
1579 | ||
f837a861 | 1580 | extern tree copy_node PROTO((tree)); |
8da1b058 RS |
1581 | |
1582 | /* Make a copy of a chain of TREE_LIST nodes. */ | |
1583 | ||
f837a861 | 1584 | extern tree copy_list PROTO((tree)); |
8da1b058 RS |
1585 | |
1586 | /* Make a TREE_VEC. */ | |
1587 | ||
f837a861 | 1588 | extern tree make_tree_vec PROTO((int)); |
8da1b058 RS |
1589 | |
1590 | /* Return the (unique) IDENTIFIER_NODE node for a given name. | |
1591 | The name is supplied as a char *. */ | |
1592 | ||
37b37199 | 1593 | extern tree get_identifier PROTO((const char *)); |
8da1b058 | 1594 | |
6b9300aa RK |
1595 | /* If an identifier with the name TEXT (a null-terminated string) has |
1596 | previously been referred to, return that node; otherwise return | |
1597 | NULL_TREE. */ | |
1598 | ||
37b37199 | 1599 | extern tree maybe_get_identifier PROTO((const char *)); |
6b9300aa | 1600 | |
8da1b058 RS |
1601 | /* Construct various types of nodes. */ |
1602 | ||
e5d70561 RK |
1603 | #define build_int_2(LO,HI) \ |
1604 | build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI)) | |
1605 | ||
bdea67fa RK |
1606 | extern tree build PVPROTO((enum tree_code, tree, ...)); |
1607 | extern tree build_nt PVPROTO((enum tree_code, ...)); | |
1608 | extern tree build_parse_node PVPROTO((enum tree_code, ...)); | |
f837a861 MM |
1609 | |
1610 | extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT)); | |
1611 | extern tree build_real PROTO((tree, REAL_VALUE_TYPE)); | |
1612 | extern tree build_real_from_int_cst PROTO((tree, tree)); | |
b217d7fe | 1613 | extern tree build_complex PROTO((tree, tree, tree)); |
37b37199 | 1614 | extern tree build_string PROTO((int, const char *)); |
f837a861 MM |
1615 | extern tree build1 PROTO((enum tree_code, tree, tree)); |
1616 | extern tree build_tree_list PROTO((tree, tree)); | |
1617 | extern tree build_decl_list PROTO((tree, tree)); | |
22ef8a13 | 1618 | extern tree build_expr_list PROTO((tree, tree)); |
f837a861 MM |
1619 | extern tree build_decl PROTO((enum tree_code, tree, tree)); |
1620 | extern tree build_block PROTO((tree, tree, tree, tree, tree)); | |
37b37199 | 1621 | extern tree build_expr_wfl PROTO((tree, const char *, int, int)); |
8da1b058 RS |
1622 | |
1623 | /* Construct various nodes representing data types. */ | |
1624 | ||
f837a861 MM |
1625 | extern tree make_signed_type PROTO((int)); |
1626 | extern tree make_unsigned_type PROTO((int)); | |
f8dac6eb | 1627 | extern void set_sizetype PROTO((tree)); |
f837a861 MM |
1628 | extern tree signed_or_unsigned_type PROTO((int, tree)); |
1629 | extern void fixup_unsigned_type PROTO((tree)); | |
1630 | extern tree build_pointer_type PROTO((tree)); | |
1631 | extern tree build_reference_type PROTO((tree)); | |
1632 | extern tree build_index_type PROTO((tree)); | |
1633 | extern tree build_index_2_type PROTO((tree, tree)); | |
1634 | extern tree build_array_type PROTO((tree, tree)); | |
1635 | extern tree build_function_type PROTO((tree, tree)); | |
1636 | extern tree build_method_type PROTO((tree, tree)); | |
1637 | extern tree build_offset_type PROTO((tree, tree)); | |
1638 | extern tree build_complex_type PROTO((tree)); | |
1639 | extern tree array_type_nelts PROTO((tree)); | |
1640 | ||
12cfc830 BK |
1641 | extern tree value_member PROTO((tree, tree)); |
1642 | extern tree purpose_member PROTO((tree, tree)); | |
1643 | extern tree binfo_member PROTO((tree, tree)); | |
9c130398 | 1644 | extern int attribute_hash_list PROTO((tree)); |
bad1b4ba RK |
1645 | extern int attribute_list_equal PROTO((tree, tree)); |
1646 | extern int attribute_list_contained PROTO((tree, tree)); | |
12cfc830 BK |
1647 | extern int tree_int_cst_equal PROTO((tree, tree)); |
1648 | extern int tree_int_cst_lt PROTO((tree, tree)); | |
40c9a549 | 1649 | extern int tree_int_cst_sgn PROTO((tree)); |
12cfc830 | 1650 | extern int index_type_equal PROTO((tree, tree)); |
a260abc9 | 1651 | extern tree get_inner_array_type PROTO((tree)); |
12cfc830 | 1652 | |
f837a861 MM |
1653 | /* From expmed.c. Since rtl.h is included after tree.h, we can't |
1654 | put the prototype here. Rtl.h does declare the prototype if | |
1655 | tree.h had been included. */ | |
1656 | ||
a1d061a1 | 1657 | extern tree make_tree PROTO((tree, struct rtx_def *)); |
8da1b058 | 1658 | \f |
bad1b4ba RK |
1659 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTES |
1660 | is ATTRIBUTE. | |
1661 | ||
1662 | Such modified types already made are recorded so that duplicates | |
1663 | are not made. */ | |
1664 | ||
1665 | extern tree build_type_attribute_variant PROTO((tree, tree)); | |
77cf75a8 | 1666 | extern tree build_decl_attribute_variant PROTO((tree, tree)); |
bad1b4ba | 1667 | |
d9525bec BK |
1668 | extern tree merge_machine_decl_attributes PROTO((tree, tree)); |
1669 | extern tree merge_machine_type_attributes PROTO((tree, tree)); | |
1670 | ||
1671 | /* Split a list of declspecs and attributes into two. */ | |
1672 | ||
1673 | extern void split_specs_attrs PROTO((tree, tree *, tree *)); | |
1674 | ||
1675 | /* Strip attributes from a list of combined specs and attrs. */ | |
1676 | ||
1677 | extern tree strip_attrs PROTO((tree)); | |
1678 | ||
9c130398 DE |
1679 | /* Return 1 if an attribute and its arguments are valid for a decl or type. */ |
1680 | ||
6cb3d314 | 1681 | extern int valid_machine_attribute PROTO((tree, tree, tree, tree)); |
9c130398 DE |
1682 | |
1683 | /* Given a tree node and a string, return non-zero if the tree node is | |
1684 | a valid attribute name for the string. */ | |
1685 | ||
37b37199 | 1686 | extern int is_attribute_p PROTO((const char *, tree)); |
9c130398 DE |
1687 | |
1688 | /* Given an attribute name and a list of attributes, return the list element | |
1689 | of the attribute or NULL_TREE if not found. */ | |
1690 | ||
37b37199 | 1691 | extern tree lookup_attribute PROTO((const char *, tree)); |
6cb3d314 DE |
1692 | |
1693 | /* Given two attributes lists, return a list of their union. */ | |
1694 | ||
1695 | extern tree merge_attributes PROTO((tree, tree)); | |
9c130398 | 1696 | |
3932261a MM |
1697 | /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for |
1698 | the same kind of data as TYPE describes. Variants point to the | |
1699 | "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT, | |
1700 | and it points to a chain of other variants so that duplicate | |
1701 | variants are never made. Only main variants should ever appear as | |
1702 | types of expressions. */ | |
1703 | ||
1704 | extern tree build_qualified_type PROTO((tree, int)); | |
1705 | ||
1706 | /* Like build_qualified_type, but only deals with the `const' and | |
1707 | `volatile' qualifiers. This interface is retained for backwards | |
1708 | compatiblity with the various front-ends; new code should use | |
1709 | build_qualified_type instead. */ | |
8da1b058 | 1710 | |
3932261a MM |
1711 | #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \ |
1712 | build_qualified_type (TYPE, \ | |
1713 | ((CONST_P) ? TYPE_QUAL_CONST : 0) \ | |
1714 | | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0)) | |
8da1b058 | 1715 | |
43100b14 RS |
1716 | /* Make a copy of a type node. */ |
1717 | ||
f837a861 | 1718 | extern tree build_type_copy PROTO((tree)); |
43100b14 | 1719 | |
8da1b058 RS |
1720 | /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT, |
1721 | TYPE_ALIGN and TYPE_MODE fields. | |
1722 | If called more than once on one node, does nothing except | |
1723 | for the first time. */ | |
1724 | ||
f837a861 | 1725 | extern void layout_type PROTO((tree)); |
8da1b058 RS |
1726 | |
1727 | /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), | |
1728 | return a canonicalized ..._TYPE node, so that duplicates are not made. | |
1729 | How the hash code is computed is up to the caller, as long as any two | |
1730 | callers that could hash identical-looking type nodes agree. */ | |
1731 | ||
f837a861 | 1732 | extern tree type_hash_canon PROTO((int, tree)); |
8da1b058 RS |
1733 | |
1734 | /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node, | |
1735 | calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE | |
1736 | fields. Call this only once for any given decl node. | |
1737 | ||
1738 | Second argument is the boundary that this field can be assumed to | |
1739 | be starting at (in bits). Zero means it can be assumed aligned | |
1740 | on any boundary that may be needed. */ | |
1741 | ||
f837a861 | 1742 | extern void layout_decl PROTO((tree, unsigned)); |
8da1b058 | 1743 | |
8da1b058 RS |
1744 | /* Return an expr equal to X but certainly not valid as an lvalue. */ |
1745 | ||
f837a861 | 1746 | extern tree non_lvalue PROTO((tree)); |
f0d568b7 | 1747 | extern tree pedantic_non_lvalue PROTO((tree)); |
8da1b058 | 1748 | |
f837a861 MM |
1749 | extern tree convert PROTO((tree, tree)); |
1750 | extern tree size_in_bytes PROTO((tree)); | |
e5e809f4 | 1751 | extern HOST_WIDE_INT int_size_in_bytes PROTO((tree)); |
f837a861 | 1752 | extern tree size_binop PROTO((enum tree_code, tree, tree)); |
697073d9 | 1753 | extern tree ssize_binop PROTO((enum tree_code, tree, tree)); |
f8dac6eb R |
1754 | extern tree size_int_wide PROTO((unsigned HOST_WIDE_INT, |
1755 | unsigned HOST_WIDE_INT, int)); | |
1756 | #define size_int(L) size_int_2 ((L), 0, 0) | |
1757 | #define bitsize_int(L, H) size_int_2 ((L), (H), 1) | |
1758 | #define size_int_2(L, H, T) \ | |
1759 | size_int_wide ((unsigned HOST_WIDE_INT) (L), \ | |
1760 | (unsigned HOST_WIDE_INT) (H), (T)) | |
1761 | ||
f837a861 MM |
1762 | extern tree round_up PROTO((tree, int)); |
1763 | extern tree get_pending_sizes PROTO((void)); | |
f05a769f | 1764 | extern void put_pending_sizes PROTO((tree)); |
8da1b058 RS |
1765 | |
1766 | /* Type for sizes of data-type. */ | |
1767 | ||
f8dac6eb R |
1768 | #define BITS_PER_UNIT_LOG \ |
1769 | ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \ | |
1770 | + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \ | |
1771 | + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256)) | |
1772 | ||
896cced4 RH |
1773 | struct sizetype_tab |
1774 | { | |
1775 | tree xsizetype, xbitsizetype; | |
e814ca97 RH |
1776 | tree xssizetype, xusizetype; |
1777 | tree xsbitsizetype, xubitsizetype; | |
896cced4 RH |
1778 | }; |
1779 | ||
1780 | extern struct sizetype_tab sizetype_tab; | |
1781 | ||
1782 | #define sizetype sizetype_tab.xsizetype | |
1783 | #define bitsizetype sizetype_tab.xbitsizetype | |
e814ca97 RH |
1784 | #define ssizetype sizetype_tab.xssizetype |
1785 | #define usizetype sizetype_tab.xusizetype | |
1786 | #define sbitsizetype sizetype_tab.xsbitsizetype | |
1787 | #define ubitsizetype sizetype_tab.xubitsizetype | |
8da1b058 | 1788 | |
8294accf PB |
1789 | /* If nonzero, an upper limit on alignment of structure fields, in bits. */ |
1790 | extern int maximum_field_alignment; | |
1791 | ||
abc95ed3 | 1792 | /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */ |
8294accf PB |
1793 | extern int set_alignment; |
1794 | ||
8da1b058 RS |
1795 | /* Concatenate two lists (chains of TREE_LIST nodes) X and Y |
1796 | by making the last node in X point to Y. | |
1797 | Returns X, except if X is 0 returns Y. */ | |
1798 | ||
f837a861 | 1799 | extern tree chainon PROTO((tree, tree)); |
8da1b058 RS |
1800 | |
1801 | /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ | |
1802 | ||
f837a861 MM |
1803 | extern tree tree_cons PROTO((tree, tree, tree)); |
1804 | extern tree perm_tree_cons PROTO((tree, tree, tree)); | |
1805 | extern tree temp_tree_cons PROTO((tree, tree, tree)); | |
1806 | extern tree saveable_tree_cons PROTO((tree, tree, tree)); | |
1807 | extern tree decl_tree_cons PROTO((tree, tree, tree)); | |
22ef8a13 | 1808 | extern tree expr_tree_cons PROTO((tree, tree, tree)); |
8da1b058 RS |
1809 | |
1810 | /* Return the last tree node in a chain. */ | |
1811 | ||
f837a861 | 1812 | extern tree tree_last PROTO((tree)); |
8da1b058 RS |
1813 | |
1814 | /* Reverse the order of elements in a chain, and return the new head. */ | |
1815 | ||
f837a861 | 1816 | extern tree nreverse PROTO((tree)); |
8da1b058 RS |
1817 | |
1818 | /* Returns the length of a chain of nodes | |
1819 | (number of chain pointers to follow before reaching a null pointer). */ | |
1820 | ||
f837a861 | 1821 | extern int list_length PROTO((tree)); |
8da1b058 RS |
1822 | |
1823 | /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */ | |
1824 | ||
f837a861 | 1825 | extern int integer_zerop PROTO((tree)); |
8da1b058 RS |
1826 | |
1827 | /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */ | |
1828 | ||
f837a861 | 1829 | extern int integer_onep PROTO((tree)); |
8da1b058 RS |
1830 | |
1831 | /* integer_all_onesp (tree x) is nonzero if X is an integer constant | |
1832 | all of whose significant bits are 1. */ | |
1833 | ||
f837a861 | 1834 | extern int integer_all_onesp PROTO((tree)); |
8da1b058 RS |
1835 | |
1836 | /* integer_pow2p (tree x) is nonzero is X is an integer constant with | |
1837 | exactly one bit 1. */ | |
1838 | ||
f837a861 | 1839 | extern int integer_pow2p PROTO((tree)); |
8da1b058 RS |
1840 | |
1841 | /* staticp (tree x) is nonzero if X is a reference to data allocated | |
1842 | at a fixed address in memory. */ | |
1843 | ||
f837a861 | 1844 | extern int staticp PROTO((tree)); |
8da1b058 RS |
1845 | |
1846 | /* Gets an error if argument X is not an lvalue. | |
1847 | Also returns 1 if X is an lvalue, 0 if not. */ | |
1848 | ||
5d5993dd | 1849 | extern int lvalue_or_else PROTO((tree, const char *)); |
8da1b058 RS |
1850 | |
1851 | /* save_expr (EXP) returns an expression equivalent to EXP | |
1852 | but it can be used multiple times within context CTX | |
1853 | and only evaluate EXP once. */ | |
1854 | ||
f837a861 | 1855 | extern tree save_expr PROTO((tree)); |
8da1b058 | 1856 | |
b7f6588d JM |
1857 | /* Returns the index of the first non-tree operand for CODE, or the number |
1858 | of operands if all are trees. */ | |
1859 | ||
1860 | extern int first_rtl_op PROTO((enum tree_code)); | |
1861 | ||
679163cf | 1862 | /* unsave_expr (EXP) returns an expression equivalent to EXP but it |
582db8e4 | 1863 | can be used multiple times and will evaluate EXP in its entirety |
679163cf MS |
1864 | each time. */ |
1865 | ||
1866 | extern tree unsave_expr PROTO((tree)); | |
1867 | ||
582db8e4 MM |
1868 | /* Reset EXP in place so that it can be expaned again. Does not |
1869 | recurse into subtrees. */ | |
1870 | ||
1871 | extern void unsave_expr_1 PROTO((tree)); | |
1872 | ||
1873 | /* Like unsave_expr_1, but recurses into all subtrees. */ | |
679163cf MS |
1874 | |
1875 | extern tree unsave_expr_now PROTO((tree)); | |
1876 | ||
582db8e4 MM |
1877 | /* If non-null, these are language-specific helper functions for |
1878 | unsave_expr_now. If present, LANG_UNSAVE is called before its | |
1879 | argument (an UNSAVE_EXPR) is to be unsaved, and all other | |
1880 | processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is | |
1881 | called from unsave_expr_1 for language-specific tree codes. */ | |
1882 | extern void (*lang_unsave) PROTO((tree *)); | |
1883 | extern void (*lang_unsave_expr_now) PROTO((tree)); | |
0a818f84 | 1884 | |
7380d707 RK |
1885 | /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size |
1886 | or offset that depends on a field within a record. | |
1887 | ||
1888 | Note that we only allow such expressions within simple arithmetic | |
1889 | or a COND_EXPR. */ | |
1890 | ||
1891 | extern int contains_placeholder_p PROTO((tree)); | |
1892 | ||
b7f6588d JM |
1893 | /* Return 1 if EXP contains any expressions that produce cleanups for an |
1894 | outer scope to deal with. Used by fold. */ | |
1895 | ||
1896 | extern int has_cleanups PROTO((tree)); | |
1897 | ||
7380d707 RK |
1898 | /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, |
1899 | return a tree with all occurrences of references to F in a | |
1900 | PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP | |
1901 | contains only arithmetic expressions. */ | |
1902 | ||
1903 | extern tree substitute_in_expr PROTO((tree, tree, tree)); | |
1904 | ||
90ca31be RS |
1905 | /* variable_size (EXP) is like save_expr (EXP) except that it |
1906 | is for the special case of something that is part of a | |
1907 | variable size for a data type. It makes special arrangements | |
1908 | to compute the value at the right time when the data type | |
1909 | belongs to a function parameter. */ | |
1910 | ||
f837a861 | 1911 | extern tree variable_size PROTO((tree)); |
90ca31be | 1912 | |
8da1b058 RS |
1913 | /* stabilize_reference (EXP) returns an reference equivalent to EXP |
1914 | but it can be used multiple times | |
1915 | and only evaluate the subexpressions once. */ | |
1916 | ||
f837a861 | 1917 | extern tree stabilize_reference PROTO((tree)); |
8da1b058 | 1918 | |
1c8b10bb RK |
1919 | /* Subroutine of stabilize_reference; this is called for subtrees of |
1920 | references. Any expression with side-effects must be put in a SAVE_EXPR | |
1921 | to ensure that it is only evaluated once. */ | |
1922 | ||
1923 | extern tree stabilize_reference_1 PROTO((tree)); | |
1924 | ||
8da1b058 RS |
1925 | /* Return EXP, stripped of any conversions to wider types |
1926 | in such a way that the result of converting to type FOR_TYPE | |
1927 | is the same as if EXP were converted to FOR_TYPE. | |
1928 | If FOR_TYPE is 0, it signifies EXP's type. */ | |
1929 | ||
f837a861 | 1930 | extern tree get_unwidened PROTO((tree, tree)); |
8da1b058 RS |
1931 | |
1932 | /* Return OP or a simpler expression for a narrower value | |
1933 | which can be sign-extended or zero-extended to give back OP. | |
1934 | Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended | |
1935 | or 0 if the value should be sign-extended. */ | |
1936 | ||
f837a861 | 1937 | extern tree get_narrower PROTO((tree, int *)); |
8da1b058 RS |
1938 | |
1939 | /* Given MODE and UNSIGNEDP, return a suitable type-tree | |
1940 | with that mode. | |
1941 | The definition of this resides in language-specific code | |
1942 | as the repertoire of available types may vary. */ | |
1943 | ||
f837a861 | 1944 | extern tree type_for_mode PROTO((enum machine_mode, int)); |
8da1b058 RS |
1945 | |
1946 | /* Given PRECISION and UNSIGNEDP, return a suitable type-tree | |
1947 | for an integer type with at least that precision. | |
1948 | The definition of this resides in language-specific code | |
1949 | as the repertoire of available types may vary. */ | |
1950 | ||
f837a861 | 1951 | extern tree type_for_size PROTO((unsigned, int)); |
8da1b058 RS |
1952 | |
1953 | /* Given an integer type T, return a type like T but unsigned. | |
1954 | If T is unsigned, the value is T. | |
1955 | The definition of this resides in language-specific code | |
1956 | as the repertoire of available types may vary. */ | |
1957 | ||
f837a861 | 1958 | extern tree unsigned_type PROTO((tree)); |
8da1b058 RS |
1959 | |
1960 | /* Given an integer type T, return a type like T but signed. | |
1961 | If T is signed, the value is T. | |
1962 | The definition of this resides in language-specific code | |
1963 | as the repertoire of available types may vary. */ | |
1964 | ||
f837a861 | 1965 | extern tree signed_type PROTO((tree)); |
8da1b058 RS |
1966 | |
1967 | /* This function must be defined in the language-specific files. | |
1968 | expand_expr calls it to build the cleanup-expression for a TARGET_EXPR. | |
1969 | This is defined in a language-specific file. */ | |
1970 | ||
f837a861 | 1971 | extern tree maybe_build_cleanup PROTO((tree)); |
8da1b058 RS |
1972 | |
1973 | /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF, | |
1974 | look for nested component-refs or array-refs at constant positions | |
1975 | and find the ultimate containing object, which is returned. */ | |
1976 | ||
b4523ff4 RK |
1977 | extern tree get_inner_reference PROTO((tree, int *, int *, tree *, |
1978 | enum machine_mode *, int *, | |
1979 | int *, int *)); | |
8da1b058 | 1980 | |
140b60b4 MM |
1981 | /* Given a DECL or TYPE, return the scope in which it was declared, or |
1982 | NUL_TREE if there is no containing scope. */ | |
1983 | ||
1984 | extern tree get_containing_scope PROTO((tree)); | |
1985 | ||
8da1b058 RS |
1986 | /* Return the FUNCTION_DECL which provides this _DECL with its context, |
1987 | or zero if none. */ | |
f837a861 | 1988 | extern tree decl_function_context PROTO((tree)); |
8da1b058 | 1989 | |
3635a54b RK |
1990 | /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides |
1991 | this _DECL with its context, or zero if none. */ | |
f837a861 | 1992 | extern tree decl_type_context PROTO((tree)); |
8da1b058 RS |
1993 | |
1994 | /* Given the FUNCTION_DECL for the current function, | |
1995 | return zero if it is ok for this function to be inline. | |
1996 | Otherwise return a warning message with a single %s | |
1997 | for the function's name. */ | |
1998 | ||
dff01034 | 1999 | extern const char *function_cannot_inline_p PROTO((tree)); |
a3c11cd3 JW |
2000 | |
2001 | /* Return 1 if EXPR is the real constant zero. */ | |
2002 | extern int real_zerop PROTO((tree)); | |
8da1b058 RS |
2003 | \f |
2004 | /* Declare commonly used variables for tree structure. */ | |
2005 | ||
8da1b058 RS |
2006 | /* Points to the name of the input file from which the current input |
2007 | being parsed originally came (before it went into cpp). */ | |
2008 | extern char *input_filename; | |
2009 | ||
2010 | /* Current line number in input file. */ | |
2011 | extern int lineno; | |
2012 | ||
2013 | /* Nonzero for -pedantic switch: warn about anything | |
2014 | that standard C forbids. */ | |
2015 | extern int pedantic; | |
2016 | ||
4812480a JM |
2017 | /* Nonzero means lvalues are limited to those valid in pedantic ANSI C. |
2018 | Zero means allow extended lvalues. */ | |
2019 | ||
2020 | extern int pedantic_lvalues; | |
2021 | ||
8da1b058 RS |
2022 | /* Nonzero means can safely call expand_expr now; |
2023 | otherwise layout_type puts variable sizes onto `pending_sizes' instead. */ | |
2024 | ||
2025 | extern int immediate_size_expand; | |
2026 | ||
2027 | /* Points to the FUNCTION_DECL of the function whose body we are reading. */ | |
2028 | ||
2029 | extern tree current_function_decl; | |
2030 | ||
8da1b058 RS |
2031 | /* Nonzero means all ..._TYPE nodes should be allocated permanently. */ |
2032 | ||
2033 | extern int all_types_permanent; | |
2034 | ||
a1d7ffe3 JM |
2035 | /* Pointer to function to compute the name to use to print a declaration. |
2036 | DECL is the declaration in question. | |
2037 | VERBOSITY determines what information will be printed: | |
2038 | 0: DECL_NAME, demangled as necessary. | |
2039 | 1: and scope information. | |
2040 | 2: and any other information that might be interesting, such as function | |
2041 | parameter types in C++. */ | |
2042 | ||
5f8ded66 | 2043 | extern const char *(*decl_printable_name) PROTO((tree, int)); |
dc437e16 RS |
2044 | |
2045 | /* Pointer to function to finish handling an incomplete decl at the | |
2046 | end of compilation. */ | |
2047 | ||
a1d061a1 | 2048 | extern void (*incomplete_decl_finalize_hook) PROTO((tree)); |
f425a887 KG |
2049 | |
2050 | extern char *init_parse PROTO((char *)); | |
2051 | extern void finish_parse PROTO((void)); | |
2052 | ||
26db82d8 BS |
2053 | extern const char * const language_string; |
2054 | ||
2055 | /* Declare a predefined function. Return the declaration. This function is | |
2056 | provided by each language frontend. */ | |
2057 | extern tree builtin_function PROTO((const char *, tree, int, | |
2058 | enum built_in_class, | |
2059 | const char *)); | |
8da1b058 | 2060 | \f |
143f1945 BK |
2061 | /* In tree.c */ |
2062 | extern char *perm_calloc PROTO((int, long)); | |
e9a25f70 | 2063 | extern tree get_file_function_name PROTO((int)); |
37b37199 | 2064 | extern tree get_file_function_name_long PROTO((const char *)); |
0f41302f | 2065 | extern tree get_set_constructor_bits PROTO((tree, char *, int)); |
4aad31ac | 2066 | extern tree get_set_constructor_bytes PROTO((tree, |
0f41302f | 2067 | unsigned char *, int)); |
41472af8 | 2068 | extern int get_alias_set PROTO((tree)); |
2ba57343 | 2069 | extern int new_alias_set PROTO((void)); |
41472af8 | 2070 | extern int (*lang_get_alias_set) PROTO((tree)); |
582db8e4 | 2071 | extern tree get_callee_fndecl PROTO((tree)); |
143f1945 | 2072 | \f |
8da1b058 RS |
2073 | /* In stmt.c */ |
2074 | ||
3f1d071b | 2075 | extern int in_control_zone_p PROTO((void)); |
d6b12657 | 2076 | extern void expand_fixups PROTO((struct rtx_def *)); |
f837a861 MM |
2077 | extern tree expand_start_stmt_expr PROTO((void)); |
2078 | extern tree expand_end_stmt_expr PROTO((tree)); | |
2079 | extern void expand_expr_stmt PROTO((tree)); | |
17ca38a2 | 2080 | extern int warn_if_unused_value PROTO((tree)); |
12cfc830 | 2081 | extern void expand_decl_init PROTO((tree)); |
f837a861 MM |
2082 | extern void clear_last_expr PROTO((void)); |
2083 | extern void expand_label PROTO((tree)); | |
2084 | extern void expand_goto PROTO((tree)); | |
2085 | extern void expand_asm PROTO((tree)); | |
2086 | extern void expand_start_cond PROTO((tree, int)); | |
2087 | extern void expand_end_cond PROTO((void)); | |
2088 | extern void expand_start_else PROTO((void)); | |
2089 | extern void expand_start_elseif PROTO((tree)); | |
2090 | extern struct nesting *expand_start_loop PROTO((int)); | |
2091 | extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int)); | |
2092 | extern void expand_loop_continue_here PROTO((void)); | |
2093 | extern void expand_end_loop PROTO((void)); | |
2094 | extern int expand_continue_loop PROTO((struct nesting *)); | |
2095 | extern int expand_exit_loop PROTO((struct nesting *)); | |
d6b12657 RK |
2096 | extern int expand_exit_loop_if_false PROTO((struct nesting *, |
2097 | tree)); | |
f837a861 MM |
2098 | extern int expand_exit_something PROTO((void)); |
2099 | ||
2100 | extern void expand_null_return PROTO((void)); | |
2101 | extern void expand_return PROTO((tree)); | |
564ea051 | 2102 | extern int optimize_tail_recursion PROTO((tree, struct rtx_def *)); |
f837a861 MM |
2103 | extern void expand_start_bindings PROTO((int)); |
2104 | extern void expand_end_bindings PROTO((tree, int, int)); | |
ba716677 | 2105 | extern void warn_about_unused_variables PROTO((tree)); |
956d6950 JL |
2106 | extern void start_cleanup_deferral PROTO((void)); |
2107 | extern void end_cleanup_deferral PROTO((void)); | |
e976b8b2 MS |
2108 | extern void mark_block_as_eh_region PROTO((void)); |
2109 | extern void mark_block_as_not_eh_region PROTO((void)); | |
2110 | extern int is_eh_region PROTO((void)); | |
2111 | extern int conditional_context PROTO((void)); | |
f837a861 | 2112 | extern tree last_cleanup_this_contour PROTO((void)); |
4c581243 MS |
2113 | extern int expand_dhc_cleanup PROTO((tree)); |
2114 | extern int expand_dcc_cleanup PROTO((tree)); | |
d6b12657 | 2115 | extern void expand_start_case PROTO((int, tree, tree, |
dff01034 | 2116 | const char *)); |
f837a861 | 2117 | extern void expand_end_case PROTO((tree)); |
d6b12657 RK |
2118 | extern int pushcase PROTO((tree, |
2119 | tree (*) (tree, tree), | |
2120 | tree, tree *)); | |
2121 | extern int pushcase_range PROTO((tree, tree, | |
2122 | tree (*) (tree, tree), | |
2123 | tree, tree *)); | |
487a6e06 | 2124 | extern void using_eh_for_cleanups PROTO((void)); |
4a050cc2 | 2125 | extern int stmt_loop_nest_empty PROTO((void)); |
8da1b058 RS |
2126 | |
2127 | /* In fold-const.c */ | |
2128 | ||
4b63dccb RK |
2129 | /* Fold constants as much as possible in an expression. |
2130 | Returns the simplified expression. | |
2131 | Acts only on the top level of the expression; | |
2132 | if the argument itself cannot be simplified, its | |
2133 | subexpressions are not changed. */ | |
2134 | ||
2135 | extern tree fold PROTO((tree)); | |
2136 | ||
2137 | extern int force_fit_type PROTO((tree, int)); | |
2138 | extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
2139 | HOST_WIDE_INT, HOST_WIDE_INT, | |
2140 | HOST_WIDE_INT *, HOST_WIDE_INT *)); | |
2141 | extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
2142 | HOST_WIDE_INT *, HOST_WIDE_INT *)); | |
2143 | extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
2144 | HOST_WIDE_INT, HOST_WIDE_INT, | |
2145 | HOST_WIDE_INT *, HOST_WIDE_INT *)); | |
2146 | extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
2147 | HOST_WIDE_INT, int, HOST_WIDE_INT *, | |
2148 | HOST_WIDE_INT *, int)); | |
2149 | extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
2150 | HOST_WIDE_INT, int, | |
2151 | HOST_WIDE_INT *, HOST_WIDE_INT *, int)); | |
2152 | extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
2153 | HOST_WIDE_INT, int, HOST_WIDE_INT *, | |
2154 | HOST_WIDE_INT *)); | |
2155 | extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT, | |
2156 | HOST_WIDE_INT, int, HOST_WIDE_INT *, | |
2157 | HOST_WIDE_INT *)); | |
2158 | extern int operand_equal_p PROTO((tree, tree, int)); | |
2159 | extern tree invert_truthvalue PROTO((tree)); | |
c530479e RH |
2160 | |
2161 | /* In builtins.c. Given a type, apply default promotions wrt unnamed | |
2162 | function arguments and return the new type. Return NULL_TREE if no | |
2163 | change. Required by any language that supports variadic arguments. */ | |
2164 | ||
2165 | extern tree (*lang_type_promotes_to) PROTO((tree)); | |
8da1b058 | 2166 | \f |
956d6950 JL |
2167 | /* Interface of the DWARF2 unwind info support. */ |
2168 | ||
2169 | /* Decide whether we want to emit frame unwind information for the current | |
2170 | translation unit. */ | |
2171 | ||
2172 | extern int dwarf2out_do_frame PROTO((void)); | |
2173 | ||
2174 | /* Generate a new label for the CFI info to refer to. */ | |
2175 | ||
2176 | extern char *dwarf2out_cfi_label PROTO((void)); | |
2177 | ||
2178 | /* Entry point to update the canonical frame address (CFA). */ | |
2179 | ||
2180 | extern void dwarf2out_def_cfa PROTO((char *, unsigned, long)); | |
2181 | ||
2182 | /* Add the CFI for saving a register window. */ | |
2183 | ||
2184 | extern void dwarf2out_window_save PROTO((char *)); | |
2185 | ||
2186 | /* Add a CFI to update the running total of the size of arguments pushed | |
2187 | onto the stack. */ | |
2188 | ||
2189 | extern void dwarf2out_args_size PROTO((char *, long)); | |
2190 | ||
2191 | /* Entry point for saving a register to the stack. */ | |
2192 | ||
2193 | extern void dwarf2out_reg_save PROTO((char *, unsigned, long)); | |
2194 | ||
2195 | /* Entry point for saving the return address in the stack. */ | |
2196 | ||
2197 | extern void dwarf2out_return_save PROTO((char *, long)); | |
2198 | ||
2199 | /* Entry point for saving the return address in a register. */ | |
2200 | ||
2201 | extern void dwarf2out_return_reg PROTO((char *, unsigned)); | |
2202 | ||
2203 | /* Output a marker (i.e. a label) for the beginning of a function, before | |
2204 | the prologue. */ | |
2205 | ||
2206 | extern void dwarf2out_begin_prologue PROTO((void)); | |
2207 | ||
2208 | /* Output a marker (i.e. a label) for the absolute end of the generated | |
2209 | code for a function definition. */ | |
2210 | ||
2211 | extern void dwarf2out_end_epilogue PROTO((void)); | |
2212 | \f | |
8da1b058 RS |
2213 | /* The language front-end must define these functions. */ |
2214 | ||
b53beeb2 RH |
2215 | /* Function of no arguments for initializing options. */ |
2216 | extern void lang_init_options PROTO((void)); | |
2217 | ||
8da1b058 | 2218 | /* Function of no arguments for initializing lexical scanning. */ |
f837a861 | 2219 | extern void init_lex PROTO((void)); |
8da1b058 | 2220 | /* Function of no arguments for initializing the symbol table. */ |
f837a861 | 2221 | extern void init_decl_processing PROTO((void)); |
8da1b058 RS |
2222 | |
2223 | /* Functions called with no arguments at the beginning and end or processing | |
2224 | the input source file. */ | |
f837a861 MM |
2225 | extern void lang_init PROTO((void)); |
2226 | extern void lang_finish PROTO((void)); | |
8da1b058 | 2227 | |
9faa82d8 | 2228 | /* Function to identify which front-end produced the output file. */ |
c9591059 KG |
2229 | extern const char *lang_identify PROTO((void)); |
2230 | ||
2231 | /* Called by report_error_function to print out function name. | |
2232 | * Default may be overridden by language front-ends. */ | |
2233 | extern void (*print_error_function) PROTO((const char *)); | |
d0d4af87 | 2234 | |
78b099bd JM |
2235 | /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */ |
2236 | extern void copy_lang_decl PROTO((tree)); | |
2237 | ||
8da1b058 | 2238 | /* Function called with no arguments to parse and compile the input. */ |
f837a861 | 2239 | extern int yyparse PROTO((void)); |
8da1b058 RS |
2240 | /* Function called with option as argument |
2241 | to decode options starting with -f or -W or +. | |
2242 | It should return nonzero if it handles the option. */ | |
a0d85b75 | 2243 | extern int lang_decode_option PROTO((int, char **)); |
8da1b058 RS |
2244 | |
2245 | /* Functions for processing symbol declarations. */ | |
2246 | /* Function to enter a new lexical scope. | |
2247 | Takes one argument: always zero when called from outside the front end. */ | |
f837a861 | 2248 | extern void pushlevel PROTO((int)); |
8da1b058 RS |
2249 | /* Function to exit a lexical scope. It returns a BINDING for that scope. |
2250 | Takes three arguments: | |
2251 | KEEP -- nonzero if there were declarations in this scope. | |
2252 | REVERSE -- reverse the order of decls before returning them. | |
2253 | FUNCTIONBODY -- nonzero if this level is the body of a function. */ | |
f837a861 | 2254 | extern tree poplevel PROTO((int, int, int)); |
69b78d8d RS |
2255 | /* Set the BLOCK node for the current scope level. */ |
2256 | extern void set_block PROTO((tree)); | |
8da1b058 RS |
2257 | /* Function to add a decl to the current scope level. |
2258 | Takes one argument, a decl to add. | |
2259 | Returns that decl, or, if the same symbol is already declared, may | |
2260 | return a different decl for that name. */ | |
f837a861 | 2261 | extern tree pushdecl PROTO((tree)); |
8da1b058 | 2262 | /* Function to return the chain of decls so far in the current scope level. */ |
f837a861 | 2263 | extern tree getdecls PROTO((void)); |
8da1b058 | 2264 | /* Function to return the chain of structure tags in the current scope level. */ |
f837a861 | 2265 | extern tree gettags PROTO((void)); |
a3c11cd3 JW |
2266 | |
2267 | extern tree build_range_type PROTO((tree, tree, tree)); | |
2268 | ||
2269 | /* Call when starting to parse a declaration: | |
2270 | make expressions in the declaration last the length of the function. | |
2271 | Returns an argument that should be passed to resume_momentary later. */ | |
2272 | extern int suspend_momentary PROTO((void)); | |
2273 | ||
2274 | extern int allocation_temporary_p PROTO((void)); | |
2275 | ||
2276 | /* Call when finished parsing a declaration: | |
2277 | restore the treatment of node-allocation that was | |
2278 | in effect before the suspension. | |
2279 | YES should be the value previously returned by suspend_momentary. */ | |
2280 | extern void resume_momentary PROTO((int)); | |
2281 | ||
2282 | /* Called after finishing a record, union or enumeral type. */ | |
2283 | extern void rest_of_type_compilation PROTO((tree, int)); | |
2284 | ||
2285 | /* Save the current set of obstacks, but don't change them. */ | |
2286 | extern void push_obstacks_nochange PROTO((void)); | |
2287 | ||
96bcb120 JW |
2288 | extern void permanent_allocation PROTO((int)); |
2289 | ||
a3c11cd3 JW |
2290 | extern void push_momentary PROTO((void)); |
2291 | ||
2292 | extern void clear_momentary PROTO((void)); | |
2293 | ||
2294 | extern void pop_momentary PROTO((void)); | |
2295 | ||
2296 | extern void end_temporary_allocation PROTO((void)); | |
2297 | ||
2298 | /* Pop the obstack selection stack. */ | |
2299 | extern void pop_obstacks PROTO((void)); | |
92cbe4d2 | 2300 | |
a1d061a1 JL |
2301 | /* In tree.c */ |
2302 | extern int really_constant_p PROTO ((tree)); | |
2303 | extern void push_obstacks PROTO ((struct obstack *, | |
2304 | struct obstack *)); | |
2305 | extern void pop_momentary_nofree PROTO ((void)); | |
2306 | extern void preserve_momentary PROTO ((void)); | |
2307 | extern void saveable_allocation PROTO ((void)); | |
2308 | extern void temporary_allocation PROTO ((void)); | |
2309 | extern void resume_temporary_allocation PROTO ((void)); | |
2310 | extern tree get_file_function_name PROTO ((int)); | |
2311 | extern void set_identifier_size PROTO ((int)); | |
2312 | extern int int_fits_type_p PROTO ((tree, tree)); | |
2313 | extern int tree_log2 PROTO ((tree)); | |
2314 | extern void preserve_initializer PROTO ((void)); | |
2315 | extern void preserve_data PROTO ((void)); | |
2316 | extern int object_permanent_p PROTO ((tree)); | |
2317 | extern int type_precision PROTO ((tree)); | |
2318 | extern int simple_cst_equal PROTO ((tree, tree)); | |
2319 | extern int type_list_equal PROTO ((tree, tree)); | |
2320 | extern int chain_member PROTO ((tree, tree)); | |
2321 | extern int chain_member_purpose PROTO ((tree, tree)); | |
2322 | extern int chain_member_value PROTO ((tree, tree)); | |
2323 | extern tree listify PROTO ((tree)); | |
2324 | extern tree type_hash_lookup PROTO ((int, tree)); | |
2325 | extern void type_hash_add PROTO ((int, tree)); | |
2326 | extern int type_hash_list PROTO ((tree)); | |
2327 | extern int simple_cst_list_equal PROTO ((tree, tree)); | |
2328 | extern void debug_obstack PROTO ((char *)); | |
2329 | extern void rtl_in_current_obstack PROTO ((void)); | |
2330 | extern void rtl_in_saveable_obstack PROTO ((void)); | |
2331 | extern void init_tree_codes PROTO ((void)); | |
2332 | extern void dump_tree_statistics PROTO ((void)); | |
37b37199 KG |
2333 | extern void print_obstack_statistics PROTO ((const char *, |
2334 | struct obstack *)); | |
a1d061a1 | 2335 | #ifdef BUFSIZ |
37b37199 | 2336 | extern void print_obstack_name PROTO ((char *, FILE *, const char *)); |
a1d061a1 JL |
2337 | #endif |
2338 | extern void expand_function_end PROTO ((char *, int, int)); | |
2339 | extern void expand_function_start PROTO ((tree, int)); | |
2340 | extern int real_onep PROTO ((tree)); | |
2341 | extern int real_twop PROTO ((tree)); | |
2342 | extern void start_identifier_warnings PROTO ((void)); | |
2343 | extern void gcc_obstack_init PROTO ((struct obstack *)); | |
2344 | extern void init_obstacks PROTO ((void)); | |
2345 | extern void obfree PROTO ((char *)); | |
01cfef6b BS |
2346 | extern void build_common_tree_nodes PROTO ((int)); |
2347 | extern void build_common_tree_nodes_2 PROTO ((int)); | |
a1d061a1 JL |
2348 | |
2349 | /* In function.c */ | |
2350 | extern void setjmp_protect_args PROTO ((void)); | |
2351 | extern void setjmp_protect PROTO ((tree)); | |
2352 | extern void expand_main_function PROTO ((void)); | |
2353 | extern void mark_varargs PROTO ((void)); | |
73a8b900 | 2354 | extern void init_dummy_function_start PROTO ((void)); |
49ad7cfa BS |
2355 | extern void expand_dummy_function_end PROTO ((void)); |
2356 | extern void init_function_for_compilation PROTO ((void)); | |
a1d061a1 | 2357 | extern void init_function_start PROTO ((tree, char *, int)); |
0d1416c6 | 2358 | extern void assign_parms PROTO ((tree)); |
a1d061a1 JL |
2359 | extern void put_var_into_stack PROTO ((tree)); |
2360 | extern void uninitialized_vars_warning PROTO ((tree)); | |
2361 | extern void setjmp_args_warning PROTO ((void)); | |
2362 | extern void mark_all_temps_used PROTO ((void)); | |
2363 | extern void init_temp_slots PROTO ((void)); | |
2364 | extern void combine_temp_slots PROTO ((void)); | |
2365 | extern void free_temp_slots PROTO ((void)); | |
2366 | extern void pop_temp_slots PROTO ((void)); | |
2367 | extern void push_temp_slots PROTO ((void)); | |
2368 | extern void preserve_temp_slots PROTO ((struct rtx_def *)); | |
2369 | extern int aggregate_value_p PROTO ((tree)); | |
5019d7a7 | 2370 | extern tree reorder_blocks PROTO ((tree, |
a1d061a1 JL |
2371 | struct rtx_def *)); |
2372 | extern void free_temps_for_rtl_expr PROTO ((tree)); | |
2373 | extern void instantiate_virtual_regs PROTO ((tree, struct rtx_def *)); | |
2374 | extern int max_parm_reg_num PROTO ((void)); | |
a1d061a1 JL |
2375 | extern void push_function_context PROTO ((void)); |
2376 | extern void pop_function_context PROTO ((void)); | |
2377 | extern void push_function_context_to PROTO ((tree)); | |
2378 | extern void pop_function_context_from PROTO ((tree)); | |
2379 | ||
2380 | /* In print-rtl.c */ | |
2381 | #ifdef BUFSIZ | |
2382 | extern void print_rtl PROTO ((FILE *, struct rtx_def *)); | |
2383 | #endif | |
2384 | ||
2385 | /* In print-tree.c */ | |
2386 | extern void debug_tree PROTO ((tree)); | |
2387 | #ifdef BUFSIZ | |
5d5993dd KG |
2388 | extern void print_node PROTO ((FILE *, const char *, tree, int)); |
2389 | extern void print_node_brief PROTO ((FILE *, const char *, tree, int)); | |
a1d061a1 JL |
2390 | extern void indent_to PROTO ((FILE *, int)); |
2391 | #endif | |
2392 | ||
2393 | /* In expr.c */ | |
2394 | extern void emit_queue PROTO ((void)); | |
2395 | extern int apply_args_register_offset PROTO ((int)); | |
a1d061a1 JL |
2396 | extern struct rtx_def *expand_builtin_return_addr |
2397 | PROTO ((enum built_in_function, int, struct rtx_def *)); | |
2398 | extern void do_pending_stack_adjust PROTO ((void)); | |
2399 | extern struct rtx_def *expand_assignment PROTO ((tree, tree, int, int)); | |
2400 | extern struct rtx_def *store_expr PROTO ((tree, struct rtx_def *, | |
2401 | int)); | |
dbecbbe4 | 2402 | extern void check_max_integer_computation_mode PROTO ((tree)); |
a1d061a1 JL |
2403 | |
2404 | /* In emit-rtl.c */ | |
2405 | extern void start_sequence_for_rtl_expr PROTO ((tree)); | |
2406 | extern struct rtx_def *emit_line_note_after PROTO ((char *, int, | |
2407 | struct rtx_def *)); | |
2408 | extern struct rtx_def *emit_line_note PROTO ((char *, int)); | |
2409 | extern struct rtx_def *emit_line_note_force PROTO ((char *, int)); | |
2410 | ||
3a8c995b MM |
2411 | /* In calls.c */ |
2412 | extern void special_function_p PROTO ((tree, int *, int *, | |
2413 | int *, int *)); | |
2414 | ||
a1d061a1 JL |
2415 | /* In c-typeck.c */ |
2416 | extern int mark_addressable PROTO ((tree)); | |
2417 | extern void incomplete_type_error PROTO ((tree, tree)); | |
2418 | ||
2419 | /* In c-lang.c */ | |
2420 | extern void print_lang_statistics PROTO ((void)); | |
2421 | ||
2422 | /* In c-common.c */ | |
2423 | extern tree truthvalue_conversion PROTO ((tree)); | |
2424 | extern int min_precision PROTO ((tree, int)); | |
2425 | extern void split_specs_attrs PROTO ((tree, tree *, tree *)); | |
2426 | ||
2427 | /* In c-decl.c */ | |
2428 | #ifdef BUFSIZ | |
2429 | extern void print_lang_decl PROTO ((FILE *, tree, int)); | |
2430 | extern void print_lang_type PROTO ((FILE *, tree, int)); | |
2431 | extern void print_lang_identifier PROTO ((FILE *, tree, int)); | |
2432 | #endif | |
2433 | extern int global_bindings_p PROTO ((void)); | |
2434 | extern void insert_block PROTO ((tree)); | |
2435 | ||
2436 | /* In integrate.c */ | |
2437 | extern void save_for_inline_nocopy PROTO ((tree)); | |
2438 | extern void save_for_inline_copying PROTO ((tree)); | |
2439 | extern void set_decl_abstract_flags PROTO ((tree, int)); | |
2440 | extern void output_inline_function PROTO ((tree)); | |
2441 | ||
2442 | /* In c-lex.c */ | |
2443 | extern void set_yydebug PROTO ((int)); | |
2444 | ||
2445 | /* In stor-layout.c */ | |
2446 | extern void fixup_signed_type PROTO ((tree)); | |
2447 | ||
2448 | /* varasm.c */ | |
87e11268 | 2449 | extern void make_decl_rtl PROTO ((tree, const char *, int)); |
a1d061a1 | 2450 | extern void make_decl_one_only PROTO ((tree)); |
487a6e06 | 2451 | extern int supports_one_only PROTO ((void)); |
a1d061a1 | 2452 | extern void variable_section PROTO ((tree, int)); |
a1d061a1 JL |
2453 | |
2454 | /* In fold-const.c */ | |
2455 | extern int div_and_round_double PROTO ((enum tree_code, int, | |
2456 | HOST_WIDE_INT, HOST_WIDE_INT, | |
2457 | HOST_WIDE_INT, HOST_WIDE_INT, | |
2458 | HOST_WIDE_INT *, | |
2459 | HOST_WIDE_INT *, | |
2460 | HOST_WIDE_INT *, | |
2461 | HOST_WIDE_INT *)); | |
2462 | ||
2463 | /* In stmt.c */ | |
2464 | extern void emit_nop PROTO ((void)); | |
2465 | extern void expand_computed_goto PROTO ((tree)); | |
2466 | extern struct rtx_def *label_rtx PROTO ((tree)); | |
2467 | extern void expand_asm_operands PROTO ((tree, tree, tree, tree, int, | |
2468 | char *, int)); | |
2469 | extern int any_pending_cleanups PROTO ((int)); | |
2470 | extern void init_stmt PROTO ((void)); | |
2471 | extern void init_stmt_for_function PROTO ((void)); | |
a1d061a1 JL |
2472 | extern int drop_through_at_end_p PROTO ((void)); |
2473 | extern void expand_start_target_temps PROTO ((void)); | |
2474 | extern void expand_end_target_temps PROTO ((void)); | |
2475 | extern void expand_elseif PROTO ((tree)); | |
2476 | extern void expand_decl PROTO ((tree)); | |
2477 | extern int expand_decl_cleanup PROTO ((tree, tree)); | |
2478 | extern void expand_anon_union_decl PROTO ((tree, tree, tree)); | |
2479 | extern void move_cleanups_up PROTO ((void)); | |
2480 | extern void expand_start_case_dummy PROTO ((void)); | |
2481 | extern void expand_end_case_dummy PROTO ((void)); | |
2482 | extern tree case_index_expr_type PROTO ((void)); | |
2483 | extern HOST_WIDE_INT all_cases_count PROTO ((tree, int *)); | |
a1d061a1 JL |
2484 | extern void check_for_full_enumeration_handling PROTO ((tree)); |
2485 | extern void declare_nonlocal_label PROTO ((tree)); | |
31ed227b JL |
2486 | #ifdef BUFSIZ |
2487 | extern void lang_print_xnode PROTO ((FILE *, tree, int)); | |
2488 | #endif | |
2489 | ||
a1d061a1 | 2490 | |
496651db MM |
2491 | /* If KIND=='I', return a suitable global initializer (constructor) name. |
2492 | If KIND=='D', return a suitable global clean-up (destructor) name. */ | |
2493 | extern tree get_file_function_name PROTO((int)); | |
af4142d5 JM |
2494 | \f |
2495 | /* Interface of the DWARF2 unwind info support. */ | |
2496 | ||
2497 | /* Decide whether we want to emit frame unwind information for the current | |
2498 | translation unit. */ | |
2499 | ||
2500 | extern int dwarf2out_do_frame PROTO((void)); | |
2501 | ||
2502 | /* Generate a new label for the CFI info to refer to. */ | |
2503 | ||
2504 | extern char *dwarf2out_cfi_label PROTO((void)); | |
2505 | ||
2506 | /* Entry point to update the canonical frame address (CFA). */ | |
2507 | ||
2508 | extern void dwarf2out_def_cfa PROTO((char *, unsigned, long)); | |
2509 | ||
2510 | /* Add the CFI for saving a register window. */ | |
2511 | ||
2512 | extern void dwarf2out_window_save PROTO((char *)); | |
2513 | ||
2514 | /* Add a CFI to update the running total of the size of arguments pushed | |
2515 | onto the stack. */ | |
2516 | ||
2517 | extern void dwarf2out_args_size PROTO((char *, long)); | |
2518 | ||
2519 | /* Entry point for saving a register to the stack. */ | |
2520 | ||
2521 | extern void dwarf2out_reg_save PROTO((char *, unsigned, long)); | |
2522 | ||
2523 | /* Entry point for saving the return address in the stack. */ | |
2524 | ||
2525 | extern void dwarf2out_return_save PROTO((char *, long)); | |
2526 | ||
2527 | /* Entry point for saving the return address in a register. */ | |
2528 | ||
2529 | extern void dwarf2out_return_reg PROTO((char *, unsigned)); | |
2530 | ||
2531 | /* Output a marker (i.e. a label) for the beginning of a function, before | |
2532 | the prologue. */ | |
2533 | ||
2534 | extern void dwarf2out_begin_prologue PROTO((void)); | |
2535 | ||
2536 | /* Output a marker (i.e. a label) for the absolute end of the generated | |
2537 | code for a function definition. */ | |
2538 | ||
2539 | extern void dwarf2out_end_epilogue PROTO((void)); | |
987009bf ZW |
2540 | |
2541 | /* Redefine abort to report an internal error w/o coredump, and | |
2542 | reporting the location of the error in the source file. This logic | |
2543 | is duplicated in rtl.h and tree.h because every file that needs the | |
2544 | special abort includes one or both. toplev.h gets too few files, | |
2545 | system.h gets too many. */ | |
2546 | ||
987009bf ZW |
2547 | extern void fancy_abort PROTO((const char *, int, const char *)) |
2548 | ATTRIBUTE_NORETURN; | |
6c9821b7 | 2549 | #if (GCC_VERSION >= 2007) |
987009bf | 2550 | #define abort() fancy_abort (__FILE__, __LINE__, __PRETTY_FUNCTION__) |
6c9821b7 PDM |
2551 | #else |
2552 | #define abort() fancy_abort (__FILE__, __LINE__, 0) | |
987009bf | 2553 | #endif |