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