?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
* doc/extend.texi: Document optional priority argument to
[official-gcc.git] / gcc / tree.h
blob1e2ecd070ef8b84c232937520cb4bf4bb73761cb
1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
4
5 This file is part of GCC.
6
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
10 version.
11
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
20 02110-1301, USA. */
21
22 #ifndef GCC_TREE_H
23 #define GCC_TREE_H
24
25 #include "hashtab.h"
26 #include "machmode.h"
27 #include "input.h"
28 #include "statistics.h"
29 #include "vec.h"
30
31 /* Codes of tree nodes */
32
33 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
34
35 enum tree_code {
36 #include "tree.def"
37
38 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
39 NUM_TREE_CODES. */
40 };
41
42 #undef DEFTREECODE
43
44 extern unsigned char tree_contains_struct[256][64];
45 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
46
47 /* Number of language-independent tree codes. */
48 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
49
50 /* Tree code classes. */
51
52 /* Each tree_code has an associated code class represented by a
53 TREE_CODE_CLASS. */
54
55 enum tree_code_class {
56 tcc_exceptional, /* An exceptional code (fits no category). */
57 tcc_constant, /* A constant. */
58 /* Order of tcc_type and tcc_declaration is important. */
59 tcc_type, /* A type object code. */
60 tcc_declaration, /* A declaration (also serving as variable refs). */
61 tcc_reference, /* A reference to storage. */
62 tcc_comparison, /* A comparison expression. */
63 tcc_unary, /* A unary arithmetic expression. */
64 tcc_binary, /* A binary arithmetic expression. */
65 tcc_statement, /* A statement expression, which have side effects
66 but usually no interesting value. */
67 tcc_vl_exp, /* A function call or other expression with a
68 variable-length operand vector. */
69 tcc_expression, /* Any other expression. */
70 tcc_gimple_stmt /* A GIMPLE statement. */
71 };
72
73 /* Each tree code class has an associated string representation.
74 These must correspond to the tree_code_class entries. */
75
76 extern const char *const tree_code_class_strings[];
77
78 /* Returns the string representing CLASS. */
79
80 #define TREE_CODE_CLASS_STRING(CLASS)\
81 tree_code_class_strings[(int) (CLASS)]
82
83 #define MAX_TREE_CODES 256
84 extern const enum tree_code_class tree_code_type[];
85 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
86
87 /* Nonzero if CODE represents an exceptional code. */
88
89 #define EXCEPTIONAL_CLASS_P(CODE)\
90 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
91
92 /* Nonzero if CODE represents a constant. */
93
94 #define CONSTANT_CLASS_P(CODE)\
95 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
96
97 /* Nonzero if CODE represents a type. */
98
99 #define TYPE_P(CODE)\
100 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
101
102 /* Nonzero if CODE represents a declaration. */
103
104 #define DECL_P(CODE)\
105 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
106
107 /* Nonzero if CODE represents a memory tag. */
108
109 #define MTAG_P(CODE) \
110 (TREE_CODE (CODE) == STRUCT_FIELD_TAG \
111 || TREE_CODE (CODE) == NAME_MEMORY_TAG \
112 || TREE_CODE (CODE) == SYMBOL_MEMORY_TAG \
113 || TREE_CODE (CODE) == MEMORY_PARTITION_TAG)
114
115
116 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
117
118 #define VAR_OR_FUNCTION_DECL_P(DECL)\
119 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
120
121 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
122 ascending code order. */
123
124 #define INDIRECT_REF_P(CODE)\
125 (TREE_CODE (CODE) == INDIRECT_REF \
126 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
127 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
128
129 /* Nonzero if CODE represents a reference. */
130
131 #define REFERENCE_CLASS_P(CODE)\
132 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
133
134 /* Nonzero if CODE represents a comparison. */
135
136 #define COMPARISON_CLASS_P(CODE)\
137 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
138
139 /* Nonzero if CODE represents a unary arithmetic expression. */
140
141 #define UNARY_CLASS_P(CODE)\
142 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
143
144 /* Nonzero if CODE represents a binary arithmetic expression. */
145
146 #define BINARY_CLASS_P(CODE)\
147 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
148
149 /* Nonzero if CODE represents a statement expression. */
150
151 #define STATEMENT_CLASS_P(CODE)\
152 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
153
154 /* Nonzero if CODE represents a function call-like expression with a
155 variable-length operand vector. */
156
157 #define VL_EXP_CLASS_P(CODE)\
158 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
159
160 /* Nonzero if CODE represents any other expression. */
161
162 #define EXPRESSION_CLASS_P(CODE)\
163 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
164
165 /* Returns nonzero iff CODE represents a type or declaration. */
166
167 #define IS_TYPE_OR_DECL_P(CODE)\
168 (TYPE_P (CODE) || DECL_P (CODE))
169
170 /* Returns nonzero iff CLASS is the tree-code class of an
171 expression. */
172
173 #define IS_EXPR_CODE_CLASS(CLASS)\
174 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
175
176 /* Returns nonzer iff CLASS is a GIMPLE statement. */
177
178 #define IS_GIMPLE_STMT_CODE_CLASS(CLASS) ((CLASS) == tcc_gimple_stmt)
179
180 /* Returns nonzero iff NODE is an expression of some kind. */
181
182 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
183
184 /* Returns nonzero iff NODE is an OpenMP directive. */
185
186 #define OMP_DIRECTIVE_P(NODE) \
187 (TREE_CODE (NODE) == OMP_PARALLEL \
188 || TREE_CODE (NODE) == OMP_FOR \
189 || TREE_CODE (NODE) == OMP_SECTIONS \
190 || TREE_CODE (NODE) == OMP_SINGLE \
191 || TREE_CODE (NODE) == OMP_SECTION \
192 || TREE_CODE (NODE) == OMP_MASTER \
193 || TREE_CODE (NODE) == OMP_ORDERED \
194 || TREE_CODE (NODE) == OMP_CRITICAL \
195 || TREE_CODE (NODE) == OMP_RETURN \
196 || TREE_CODE (NODE) == OMP_CONTINUE)
197
198 /* Number of argument-words in each kind of tree-node. */
199
200 extern const unsigned char tree_code_length[];
201 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
202
203 /* Names of tree components. */
204
205 extern const char *const tree_code_name[];
206
207 /* A vectors of trees. */
208 DEF_VEC_P(tree);
209 DEF_VEC_ALLOC_P(tree,gc);
210 DEF_VEC_ALLOC_P(tree,heap);
211
212 \f
213 /* Classify which part of the compiler has defined a given builtin function.
214 Note that we assume below that this is no more than two bits. */
215 enum built_in_class
216 {
217 NOT_BUILT_IN = 0,
218 BUILT_IN_FRONTEND,
219 BUILT_IN_MD,
220 BUILT_IN_NORMAL
221 };
222
223 /* Names for the above. */
224 extern const char *const built_in_class_names[4];
225
226 /* Codes that identify the various built in functions
227 so that expand_call can identify them quickly. */
228
229 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
230 enum built_in_function
231 {
232 #include "builtins.def"
233
234 /* Complex division routines in libgcc. These are done via builtins
235 because emit_library_call_value can't handle complex values. */
236 BUILT_IN_COMPLEX_MUL_MIN,
237 BUILT_IN_COMPLEX_MUL_MAX
238 = BUILT_IN_COMPLEX_MUL_MIN
239 + MAX_MODE_COMPLEX_FLOAT
240 - MIN_MODE_COMPLEX_FLOAT,
241
242 BUILT_IN_COMPLEX_DIV_MIN,
243 BUILT_IN_COMPLEX_DIV_MAX
244 = BUILT_IN_COMPLEX_DIV_MIN
245 + MAX_MODE_COMPLEX_FLOAT
246 - MIN_MODE_COMPLEX_FLOAT,
247
248 /* Upper bound on non-language-specific builtins. */
249 END_BUILTINS
250 };
251 #undef DEF_BUILTIN
252
253 /* Names for the above. */
254 extern const char * built_in_names[(int) END_BUILTINS];
255
256 /* Helper macros for math builtins. */
257
258 #define BUILTIN_EXP10_P(FN) \
259 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
260 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
261
262 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
263 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
264 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
265
266 #define BUILTIN_SQRT_P(FN) \
267 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
268
269 #define BUILTIN_CBRT_P(FN) \
270 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
271
272 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
273
274 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
275 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
276
277 /* An array of _DECL trees for the above. */
278 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
279 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
280 \f
281 /* In an OMP_CLAUSE node. */
282
283 /* Number of operands and names for each clause. */
284 extern unsigned const char omp_clause_num_ops[];
285 extern const char * const omp_clause_code_name[];
286
287 /* Clause codes. Do not reorder, as this is used to index into the tables
288 omp_clause_num_ops and omp_clause_code_name. */
289 enum omp_clause_code
290 {
291 /* Clause zero is special-cased inside the parser
292 (c_parser_omp_variable_list). */
293 OMP_CLAUSE_ERROR = 0,
294
295 /* OpenMP clause: private (variable_list). */
296 OMP_CLAUSE_PRIVATE,
297
298 /* OpenMP clause: shared (variable_list). */
299 OMP_CLAUSE_SHARED,
300
301 /* OpenMP clause: firstprivate (variable_list). */
302 OMP_CLAUSE_FIRSTPRIVATE,
303
304 /* OpenMP clause: lastprivate (variable_list). */
305 OMP_CLAUSE_LASTPRIVATE,
306
307 /* OpenMP clause: reduction (operator:variable_list).
308 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
309 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
310 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
311 into the shared one.
312 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
313 placeholder used in OMP_CLAUSE_REDUCTION_MERGE. */
314 OMP_CLAUSE_REDUCTION,
315
316 /* OpenMP clause: copyin (variable_list). */
317 OMP_CLAUSE_COPYIN,
318
319 /* OpenMP clause: copyprivate (variable_list). */
320 OMP_CLAUSE_COPYPRIVATE,
321
322 /* OpenMP clause: if (scalar-expression). */
323 OMP_CLAUSE_IF,
324
325 /* OpenMP clause: num_threads (integer-expression). */
326 OMP_CLAUSE_NUM_THREADS,
327
328 /* OpenMP clause: schedule. */
329 OMP_CLAUSE_SCHEDULE,
330
331 /* OpenMP clause: nowait. */
332 OMP_CLAUSE_NOWAIT,
333
334 /* OpenMP clause: ordered. */
335 OMP_CLAUSE_ORDERED,
336
337 /* OpenMP clause: default. */
338 OMP_CLAUSE_DEFAULT
339 };
340 \f
341 /* The definition of tree nodes fills the next several pages. */
342
343 /* A tree node can represent a data type, a variable, an expression
344 or a statement. Each node has a TREE_CODE which says what kind of
345 thing it represents. Some common codes are:
346 INTEGER_TYPE -- represents a type of integers.
347 ARRAY_TYPE -- represents a type of pointer.
348 VAR_DECL -- represents a declared variable.
349 INTEGER_CST -- represents a constant integer value.
350 PLUS_EXPR -- represents a sum (an expression).
351
352 As for the contents of a tree node: there are some fields
353 that all nodes share. Each TREE_CODE has various special-purpose
354 fields as well. The fields of a node are never accessed directly,
355 always through accessor macros. */
356
357 /* Every kind of tree node starts with this structure,
358 so all nodes have these fields.
359
360 See the accessor macros, defined below, for documentation of the
361 fields. */
362 union tree_ann_d;
363
364 struct tree_base GTY(())
365 {
366 ENUM_BITFIELD(tree_code) code : 8;
367
368 unsigned side_effects_flag : 1;
369 unsigned constant_flag : 1;
370 unsigned addressable_flag : 1;
371 unsigned volatile_flag : 1;
372 unsigned readonly_flag : 1;
373 unsigned unsigned_flag : 1;
374 unsigned asm_written_flag: 1;
375 unsigned nowarning_flag : 1;
376
377 unsigned used_flag : 1;
378 unsigned nothrow_flag : 1;
379 unsigned static_flag : 1;
380 unsigned public_flag : 1;
381 unsigned private_flag : 1;
382 unsigned protected_flag : 1;
383 unsigned deprecated_flag : 1;
384 unsigned invariant_flag : 1;
385
386 unsigned lang_flag_0 : 1;
387 unsigned lang_flag_1 : 1;
388 unsigned lang_flag_2 : 1;
389 unsigned lang_flag_3 : 1;
390 unsigned lang_flag_4 : 1;
391 unsigned lang_flag_5 : 1;
392 unsigned lang_flag_6 : 1;
393 unsigned visited : 1;
394
395 /* FIXME tuples: Eventually, we need to move this somewhere external to
396 the trees. */
397 union tree_ann_d *ann;
398 };
399
400 struct tree_common GTY(())
401 {
402 struct tree_base base;
403 tree chain;
404 tree type;
405 };
406
407 /* GIMPLE_MODIFY_STMT */
408 struct gimple_stmt GTY(())
409 {
410 struct tree_base base;
411 source_locus locus;
412 tree block;
413 /* FIXME tuples: Eventually this should be of type ``struct gimple_expr''. */
414 tree GTY ((length ("TREE_CODE_LENGTH (TREE_CODE (&%h))"))) operands[1];
415 };
416
417 /* The following table lists the uses of each of the above flags and
418 for which types of nodes they are defined. Note that expressions
419 include decls.
420
421 addressable_flag:
422
423 TREE_ADDRESSABLE in
424 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
425 ..._TYPE, IDENTIFIER_NODE.
426 In a STMT_EXPR, it means we want the result of the enclosed
427 expression.
428 CALL_EXPR_TAILCALL in CALL_EXPR
429 CASE_LOW_SEEN in CASE_LABEL_EXPR
430
431 static_flag:
432
433 TREE_STATIC in
434 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
435 BINFO_VIRTUAL_P in
436 TREE_BINFO
437 TREE_SYMBOL_REFERENCED in
438 IDENTIFIER_NODE
439 CLEANUP_EH_ONLY in
440 TARGET_EXPR, WITH_CLEANUP_EXPR
441 ASM_INPUT_P in
442 ASM_EXPR
443 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
444 TYPE_REF_CAN_ALIAS_ALL in
445 POINTER_TYPE, REFERENCE_TYPE
446 CASE_HIGH_SEEN in CASE_LABEL_EXPR
447
448 public_flag:
449
450 TREE_OVERFLOW in
451 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
452 TREE_PUBLIC in
453 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
454 ASM_VOLATILE_P in
455 ASM_EXPR
456 TYPE_CACHED_VALUES_P in
457 ..._TYPE
458 SAVE_EXPR_RESOLVED_P in
459 SAVE_EXPR
460 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
461 OMP_CLAUSE_LASTPRIVATE
462 OMP_CLAUSE_PRIVATE_DEBUG in
463 OMP_CLAUSE_PRIVATE
464
465 private_flag:
466
467 TREE_PRIVATE in
468 ..._DECL
469 CALL_EXPR_RETURN_SLOT_OPT in
470 CALL_EXPR
471 DECL_BY_REFERENCE in
472 PARM_DECL, RESULT_DECL
473 OMP_RETURN_NOWAIT in
474 OMP_RETURN
475 OMP_SECTION_LAST in
476 OMP_SECTION
477 OMP_PARALLEL_COMBINED in
478 OMP_PARALLEL
479
480 protected_flag:
481
482 TREE_PROTECTED in
483 BLOCK
484 ..._DECL
485 CALL_FROM_THUNK_P in
486 CALL_EXPR
487
488 side_effects_flag:
489
490 TREE_SIDE_EFFECTS in
491 all expressions
492 all decls
493 all constants
494
495 FORCED_LABEL in
496 LABEL_DECL
497
498 volatile_flag:
499
500 TREE_THIS_VOLATILE in
501 all expressions
502 TYPE_VOLATILE in
503 ..._TYPE
504
505 readonly_flag:
506
507 TREE_READONLY in
508 all expressions
509 TYPE_READONLY in
510 ..._TYPE
511
512 constant_flag:
513
514 TREE_CONSTANT in
515 all expressions
516 all decls
517 all constants
518 TYPE_SIZES_GIMPLIFIED
519 ..._TYPE
520
521 unsigned_flag:
522
523 TYPE_UNSIGNED in
524 all types
525 DECL_UNSIGNED in
526 all decls
527 BIT_FIELD_REF_UNSIGNED in
528 BIT_FIELD_REF
529
530 asm_written_flag:
531
532 TREE_ASM_WRITTEN in
533 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
534 BLOCK, SSA_NAME
535
536 used_flag:
537
538 TREE_USED in
539 expressions, IDENTIFIER_NODE
540
541 nothrow_flag:
542
543 TREE_NOTHROW in
544 CALL_EXPR, FUNCTION_DECL
545
546 TYPE_ALIGN_OK in
547 ..._TYPE
548
549 TREE_THIS_NOTRAP in
550 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
551
552 deprecated_flag:
553
554 TREE_DEPRECATED in
555 ..._DECL
556
557 IDENTIFIER_TRANSPARENT_ALIAS in
558 IDENTIFIER_NODE
559
560 visited:
561
562 Used in tree traversals to mark visited nodes.
563
564 invariant_flag:
565
566 TREE_INVARIANT in
567 all expressions.
568
569 nowarning_flag:
570
571 TREE_NO_WARNING in
572 ... any expr or decl node
573 */
574 #undef DEFTREESTRUCT
575 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
576 enum tree_node_structure_enum {
577 #include "treestruct.def"
578 LAST_TS_ENUM
579 };
580 #undef DEFTREESTRUCT
581
582 /* Define accessors for the fields that all tree nodes have
583 (though some fields are not used for all kinds of nodes). */
584
585 /* The tree-code says what kind of node it is.
586 Codes are defined in tree.def. */
587 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
588 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
589
590 /* When checking is enabled, errors will be generated if a tree node
591 is accessed incorrectly. The macros die with a fatal error. */
592 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
593
594 #define TREE_CHECK(T, CODE) __extension__ \
595 ({ const tree __t = (T); \
596 if (TREE_CODE (__t) != (CODE)) \
597 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
598 (CODE), 0); \
599 __t; })
600
601 #define TREE_NOT_CHECK(T, CODE) __extension__ \
602 ({ const tree __t = (T); \
603 if (TREE_CODE (__t) == (CODE)) \
604 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
605 (CODE), 0); \
606 __t; })
607
608 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
609 ({ const tree __t = (T); \
610 if (TREE_CODE (__t) != (CODE1) \
611 && TREE_CODE (__t) != (CODE2)) \
612 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
613 (CODE1), (CODE2), 0); \
614 __t; })
615
616 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
617 ({ const tree __t = (T); \
618 if (TREE_CODE (__t) == (CODE1) \
619 || TREE_CODE (__t) == (CODE2)) \
620 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
621 (CODE1), (CODE2), 0); \
622 __t; })
623
624 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
625 ({ const tree __t = (T); \
626 if (TREE_CODE (__t) != (CODE1) \
627 && TREE_CODE (__t) != (CODE2) \
628 && TREE_CODE (__t) != (CODE3)) \
629 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
630 (CODE1), (CODE2), (CODE3), 0); \
631 __t; })
632
633 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
634 ({ const tree __t = (T); \
635 if (TREE_CODE (__t) == (CODE1) \
636 || TREE_CODE (__t) == (CODE2) \
637 || TREE_CODE (__t) == (CODE3)) \
638 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
639 (CODE1), (CODE2), (CODE3), 0); \
640 __t; })
641
642 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
643 ({ const tree __t = (T); \
644 if (TREE_CODE (__t) != (CODE1) \
645 && TREE_CODE (__t) != (CODE2) \
646 && TREE_CODE (__t) != (CODE3) \
647 && TREE_CODE (__t) != (CODE4)) \
648 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
649 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
650 __t; })
651
652 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
653 ({ const tree __t = (T); \
654 if (TREE_CODE (__t) == (CODE1) \
655 || TREE_CODE (__t) == (CODE2) \
656 || TREE_CODE (__t) == (CODE3) \
657 || TREE_CODE (__t) == (CODE4)) \
658 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
659 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
660 __t; })
661
662 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
663 ({ const tree __t = (T); \
664 if (TREE_CODE (__t) != (CODE1) \
665 && TREE_CODE (__t) != (CODE2) \
666 && TREE_CODE (__t) != (CODE3) \
667 && TREE_CODE (__t) != (CODE4) \
668 && TREE_CODE (__t) != (CODE5)) \
669 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
670 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
671 __t; })
672
673 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
674 ({ const tree __t = (T); \
675 if (TREE_CODE (__t) == (CODE1) \
676 || TREE_CODE (__t) == (CODE2) \
677 || TREE_CODE (__t) == (CODE3) \
678 || TREE_CODE (__t) == (CODE4) \
679 || TREE_CODE (__t) == (CODE5)) \
680 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
681 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
682 __t; })
683
684 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
685 ({ const tree __t = (T); \
686 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
687 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
688 __FUNCTION__); \
689 __t; })
690
691 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
692 ({ const tree __t = (T); \
693 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
694 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
695 __FUNCTION__); \
696 __t; })
697
698 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
699 ({ const tree __t = (T); \
700 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
701 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
702 (CODE1), (CODE2)); \
703 __t; })
704
705 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
706 ({ const tree __t = (T); \
707 if (TREE_CODE (__t) != OMP_CLAUSE) \
708 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
709 OMP_CLAUSE, 0); \
710 if (__t->omp_clause.code != (CODE)) \
711 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
712 (CODE)); \
713 __t; })
714
715 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
716 ({ const tree __t = (T); \
717 if (TREE_CODE (__t) != OMP_CLAUSE) \
718 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
719 OMP_CLAUSE, 0); \
720 if ((int) __t->omp_clause.code < (int) (CODE1) \
721 || (int) __t->omp_clause.code > (int) (CODE2)) \
722 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
723 __FUNCTION__, (CODE1), (CODE2)); \
724 __t; })
725
726 /* These checks have to be special cased. */
727 #define EXPR_CHECK(T) __extension__ \
728 ({ const tree __t = (T); \
729 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
730 if (!IS_EXPR_CODE_CLASS (__c)) \
731 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
732 __FUNCTION__); \
733 __t; })
734
735 #define GIMPLE_STMT_CHECK(T) __extension__ \
736 ({ const tree __t = (T); \
737 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
738 if (!IS_GIMPLE_STMT_CODE_CLASS (__c)) \
739 tree_class_check_failed (__t, tcc_gimple_stmt, __FILE__, __LINE__,\
740 __FUNCTION__); \
741 __t; })
742
743 /* These checks have to be special cased. */
744 #define NON_TYPE_CHECK(T) __extension__ \
745 ({ const tree __t = (T); \
746 if (TYPE_P (__t)) \
747 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
748 __FUNCTION__); \
749 __t; })
750
751 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
752 (*({const tree __t = (T); \
753 const int __i = (I); \
754 if (TREE_CODE (__t) != TREE_VEC) \
755 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
756 TREE_VEC, 0); \
757 if (__i < 0 || __i >= __t->vec.length) \
758 tree_vec_elt_check_failed (__i, __t->vec.length, \
759 __FILE__, __LINE__, __FUNCTION__); \
760 &__t->vec.a[__i]; }))
761
762 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
763 (*({const tree __t = t; \
764 const int __i = (i); \
765 if (TREE_CODE (__t) != PHI_NODE) \
766 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
767 PHI_NODE, 0); \
768 if (__i < 0 || __i >= __t->phi.capacity) \
769 phi_node_elt_check_failed (__i, __t->phi.num_args, \
770 __FILE__, __LINE__, __FUNCTION__); \
771 &__t->phi.a[__i]; }))
772
773 #define OMP_CLAUSE_ELT_CHECK(t, i) __extension__ \
774 (*({const tree __t = t; \
775 const int __i = (i); \
776 if (TREE_CODE (__t) != OMP_CLAUSE) \
777 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
778 OMP_CLAUSE, 0); \
779 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
780 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
781 __FUNCTION__); \
782 &__t->omp_clause.ops[__i]; }))
783
784 /* Special checks for TREE_OPERANDs. */
785 #define TREE_OPERAND_CHECK(T, I) __extension__ \
786 (*({const tree __t = EXPR_CHECK (T); \
787 const int __i = (I); \
788 if (GIMPLE_TUPLE_P (__t)) \
789 gcc_unreachable (); \
790 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
791 tree_operand_check_failed (__i, __t, \
792 __FILE__, __LINE__, __FUNCTION__); \
793 &__t->exp.operands[__i]; }))
794
795 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
796 (*({const tree __t = (T); \
797 const int __i = (I); \
798 if (TREE_CODE (__t) != CODE) \
799 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
800 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
801 tree_operand_check_failed (__i, __t, \
802 __FILE__, __LINE__, __FUNCTION__); \
803 &__t->exp.operands[__i]; }))
804
805 /* Special checks for GIMPLE_STMT_OPERANDs. */
806 #define GIMPLE_STMT_OPERAND_CHECK(T, I) __extension__ \
807 (*({const tree __t = GIMPLE_STMT_CHECK (T); \
808 const int __i = (I); \
809 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
810 tree_operand_check_failed (__i, __t, \
811 __FILE__, __LINE__, __FUNCTION__); \
812 &__t->gstmt.operands[__i]; }))
813
814 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
815 (*(rtx *) \
816 ({const tree __t = (T); \
817 const int __i = (I); \
818 if (TREE_CODE (__t) != (CODE)) \
819 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
820 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
821 tree_operand_check_failed (__i, __t, \
822 __FILE__, __LINE__, __FUNCTION__); \
823 &__t->exp.operands[__i]; }))
824
825 /* Nodes are chained together for many purposes.
826 Types are chained together to record them for being output to the debugger
827 (see the function `chain_type').
828 Decls in the same scope are chained together to record the contents
829 of the scope.
830 Statement nodes for successive statements used to be chained together.
831 Often lists of things are represented by TREE_LIST nodes that
832 are chained together. */
833
834 #define TREE_CHAIN(NODE) __extension__ \
835 (*({const tree __t = (NODE); \
836 if (GIMPLE_TUPLE_P (__t)) \
837 gcc_unreachable (); \
838 &__t->common.chain; }))
839
840 /* In all nodes that are expressions, this is the data type of the expression.
841 In POINTER_TYPE nodes, this is the type that the pointer points to.
842 In ARRAY_TYPE nodes, this is the type of the elements.
843 In VECTOR_TYPE nodes, this is the type of the elements. */
844 #define TREE_TYPE(NODE) __extension__ \
845 (*({const tree __t = (NODE); \
846 if (GIMPLE_TUPLE_P (__t)) \
847 gcc_unreachable (); \
848 &__t->common.type; }))
849
850 extern void tree_contains_struct_check_failed (const tree,
851 const enum tree_node_structure_enum,
852 const char *, int, const char *)
853 ATTRIBUTE_NORETURN;
854
855 extern void tree_check_failed (const tree, const char *, int, const char *,
856 ...) ATTRIBUTE_NORETURN;
857 extern void tree_not_check_failed (const tree, const char *, int, const char *,
858 ...) ATTRIBUTE_NORETURN;
859 extern void tree_class_check_failed (const tree, const enum tree_code_class,
860 const char *, int, const char *)
861 ATTRIBUTE_NORETURN;
862 extern void tree_range_check_failed (const tree, const char *, int,
863 const char *, enum tree_code,
864 enum tree_code);
865 extern void tree_not_class_check_failed (const tree,
866 const enum tree_code_class,
867 const char *, int, const char *)
868 ATTRIBUTE_NORETURN;
869 extern void tree_vec_elt_check_failed (int, int, const char *,
870 int, const char *)
871 ATTRIBUTE_NORETURN;
872 extern void phi_node_elt_check_failed (int, int, const char *,
873 int, const char *)
874 ATTRIBUTE_NORETURN;
875 extern void tree_operand_check_failed (int, tree,
876 const char *, int, const char *)
877 ATTRIBUTE_NORETURN;
878 extern void omp_clause_check_failed (const tree, const char *, int,
879 const char *, enum omp_clause_code)
880 ATTRIBUTE_NORETURN;
881 extern void omp_clause_operand_check_failed (int, tree, const char *,
882 int, const char *)
883 ATTRIBUTE_NORETURN;
884 extern void omp_clause_range_check_failed (const tree, const char *, int,
885 const char *, enum omp_clause_code,
886 enum omp_clause_code)
887 ATTRIBUTE_NORETURN;
888
889 #else /* not ENABLE_TREE_CHECKING, or not gcc */
890
891 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
892 #define TREE_CHECK(T, CODE) (T)
893 #define TREE_NOT_CHECK(T, CODE) (T)
894 #define TREE_CHECK2(T, CODE1, CODE2) (T)
895 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
896 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
897 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
898 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
899 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
900 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
901 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
902 #define TREE_CLASS_CHECK(T, CODE) (T)
903 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
904 #define EXPR_CHECK(T) (T)
905 #define GIMPLE_STMT_CHECK(T) (T)
906 #define NON_TYPE_CHECK(T) (T)
907 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
908 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
909 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
910 #define GIMPLE_STMT_OPERAND_CHECK(T, I) ((T)->gstmt.operands[I])
911 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
912 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
913 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
914 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
915 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
916
917 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
918 #define TREE_TYPE(NODE) ((NODE)->common.type)
919
920 #endif
921
922 #define TREE_BLOCK(NODE) *(tree_block (NODE))
923
924 #include "tree-check.h"
925
926 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
927 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
928 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
929 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
930 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
931 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
932 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
933 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
934 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
935 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
936 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
937 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
938
939 #define RECORD_OR_UNION_CHECK(T) \
940 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
941 #define NOT_RECORD_OR_UNION_CHECK(T) \
942 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
943
944 #define NUMERICAL_TYPE_CHECK(T) \
945 TREE_CHECK4 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE)
946
947 /* Nonzero if NODE is a GIMPLE statement. */
948 #define GIMPLE_STMT_P(NODE) \
949 (TREE_CODE_CLASS (TREE_CODE ((NODE))) == tcc_gimple_stmt)
950
951 /* Nonzero if NODE is a GIMPLE tuple. */
952 #define GIMPLE_TUPLE_P(NODE) (GIMPLE_STMT_P (NODE))
953
954 /* A GIMPLE tuple that has a ``locus'' field. */
955 #define GIMPLE_TUPLE_HAS_LOCUS_P(NODE) GIMPLE_STMT_P ((NODE))
956
957 /* Like TREE_OPERAND but works with GIMPLE stmt tuples as well.
958
959 If you know the NODE is a GIMPLE statement, use GIMPLE_STMT_OPERAND. If the
960 NODE code is unknown at compile time, use this macro. */
961 #define GENERIC_TREE_OPERAND(NODE, I) *(generic_tree_operand ((NODE), (I)))
962
963 /* Like TREE_TYPE but returns void_type_node for gimple tuples that have
964 no type. */
965
966 #define GENERIC_TREE_TYPE(NODE) *(generic_tree_type ((NODE)))
967
968 /* Here is how primitive or already-canonicalized types' hash codes
969 are made. */
970 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
971
972 /* A simple hash function for an arbitrary tree node. This must not be
973 used in hash tables which are saved to a PCH. */
974 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
975
976 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
977 that don't change the machine mode. */
978
979 #define STRIP_NOPS(EXP) \
980 while ((TREE_CODE (EXP) == NOP_EXPR \
981 || TREE_CODE (EXP) == CONVERT_EXPR \
982 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
983 && TREE_OPERAND (EXP, 0) != error_mark_node \
984 && (TYPE_MODE (TREE_TYPE (EXP)) \
985 == TYPE_MODE (GENERIC_TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
986 (EXP) = TREE_OPERAND (EXP, 0)
987
988 /* Like STRIP_NOPS, but don't let the signedness change either. */
989
990 #define STRIP_SIGN_NOPS(EXP) \
991 while ((TREE_CODE (EXP) == NOP_EXPR \
992 || TREE_CODE (EXP) == CONVERT_EXPR \
993 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
994 && TREE_OPERAND (EXP, 0) != error_mark_node \
995 && (TYPE_MODE (TREE_TYPE (EXP)) \
996 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
997 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
998 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
999 (EXP) = TREE_OPERAND (EXP, 0)
1000
1001 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1002
1003 #define STRIP_TYPE_NOPS(EXP) \
1004 while ((TREE_CODE (EXP) == NOP_EXPR \
1005 || TREE_CODE (EXP) == CONVERT_EXPR \
1006 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1007 && TREE_OPERAND (EXP, 0) != error_mark_node \
1008 && (TREE_TYPE (EXP) \
1009 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1010 (EXP) = TREE_OPERAND (EXP, 0)
1011
1012 /* Remove unnecessary type conversions according to
1013 tree_ssa_useless_type_conversion. */
1014
1015 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1016 while (tree_ssa_useless_type_conversion (EXP)) \
1017 EXP = TREE_OPERAND (EXP, 0)
1018
1019 /* Nonzero if TYPE represents an integral type. Note that we do not
1020 include COMPLEX types here. Keep these checks in ascending code
1021 order. */
1022
1023 #define INTEGRAL_TYPE_P(TYPE) \
1024 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1025 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1026 || TREE_CODE (TYPE) == INTEGER_TYPE)
1027
1028 /* Nonzero if TYPE represents a scalar floating-point type. */
1029
1030 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1031
1032 /* Nonzero if TYPE represents a complex floating-point type. */
1033
1034 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1035 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1036 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1037
1038 /* Nonzero if TYPE represents a vector floating-point type. */
1039
1040 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1041 (TREE_CODE (TYPE) == VECTOR_TYPE \
1042 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1043
1044 /* Nonzero if TYPE represents a floating-point type, including complex
1045 and vector floating-point types. The vector and complex check does
1046 not use the previous two macros to enable early folding. */
1047
1048 #define FLOAT_TYPE_P(TYPE) \
1049 (SCALAR_FLOAT_TYPE_P (TYPE) \
1050 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1051 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1052 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1053
1054 /* Nonzero if TYPE represents a decimal floating-point type. */
1055 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1056 (SCALAR_FLOAT_TYPE_P (TYPE) \
1057 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1058
1059 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1060 Keep these checks in ascending code order. */
1061
1062 #define AGGREGATE_TYPE_P(TYPE) \
1063 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
1064 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1065
1066 /* Nonzero if TYPE represents a pointer or reference type.
1067 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1068 ascending code order. */
1069
1070 #define POINTER_TYPE_P(TYPE) \
1071 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1072
1073 /* Nonzero if this type is a complete type. */
1074 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1075
1076 /* Nonzero if this type is the (possibly qualified) void type. */
1077 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1078
1079 /* Nonzero if this type is complete or is cv void. */
1080 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1081 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1082
1083 /* Nonzero if this type is complete or is an array with unspecified bound. */
1084 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1085 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1086
1087 \f
1088 /* Define many boolean fields that all tree nodes have. */
1089
1090 /* In VAR_DECL nodes, nonzero means address of this is needed.
1091 So it cannot be in a register.
1092 In a FUNCTION_DECL, nonzero means its address is needed.
1093 So it must be compiled even if it is an inline function.
1094 In a FIELD_DECL node, it means that the programmer is permitted to
1095 construct the address of this field. This is used for aliasing
1096 purposes: see record_component_aliases.
1097 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1098 In LABEL_DECL nodes, it means a goto for this label has been seen
1099 from a place outside all binding contours that restore stack levels.
1100 In ..._TYPE nodes, it means that objects of this type must
1101 be fully addressable. This means that pieces of this
1102 object cannot go into register parameters, for example.
1103 In IDENTIFIER_NODEs, this means that some extern decl for this name
1104 had its address taken. That matters for inline functions. */
1105 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1106
1107 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1108 exit of a function. Calls for which this is true are candidates for tail
1109 call optimizations. */
1110 #define CALL_EXPR_TAILCALL(NODE) \
1111 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1112
1113 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1114 CASE_LOW operand has been processed. */
1115 #define CASE_LOW_SEEN(NODE) \
1116 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1117
1118 /* In a VAR_DECL, nonzero means allocate static storage.
1119 In a FUNCTION_DECL, nonzero if function has been defined.
1120 In a CONSTRUCTOR, nonzero means allocate static storage.
1121
1122 ??? This is also used in lots of other nodes in unclear ways which
1123 should be cleaned up some day. */
1124 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1125
1126 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
1127 should only be executed if an exception is thrown, not on normal exit
1128 of its scope. */
1129 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1130
1131 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1132 CASE_HIGH operand has been processed. */
1133 #define CASE_HIGH_SEEN(NODE) \
1134 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1135
1136 /* In an expr node (usually a conversion) this means the node was made
1137 implicitly and should not lead to any sort of warning. In a decl node,
1138 warnings concerning the decl should be suppressed. This is used at
1139 least for used-before-set warnings, and it set after one warning is
1140 emitted. */
1141 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1142
1143 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1144 this string as an argument. */
1145 #define TREE_SYMBOL_REFERENCED(NODE) \
1146 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1147
1148 /* Nonzero in a pointer or reference type means the data pointed to
1149 by this type can alias anything. */
1150 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1151 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1152
1153 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1154 there was an overflow in folding. */
1155
1156 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1157
1158 /* ??? This is an obsolete synonym for TREE_OVERFLOW. */
1159 #define TREE_CONSTANT_OVERFLOW(NODE) TREE_OVERFLOW(NODE)
1160
1161 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1162
1163 #define TREE_OVERFLOW_P(EXPR) \
1164 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1165
1166 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1167 nonzero means name is to be accessible from outside this module.
1168 In an IDENTIFIER_NODE, nonzero means an external declaration
1169 accessible from outside this module was previously seen
1170 for this name in an inner scope. */
1171 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1172
1173 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1174 of cached values, or is something else. */
1175 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1176
1177 /* In a SAVE_EXPR, indicates that the original expression has already
1178 been substituted with a VAR_DECL that contains the value. */
1179 #define SAVE_EXPR_RESOLVED_P(NODE) \
1180 (TREE_CHECK (NODE, SAVE_EXPR)->base.public_flag)
1181
1182 /* In any expression, decl, or constant, nonzero means it has side effects or
1183 reevaluation of the whole expression could produce a different value.
1184 This is set if any subexpression is a function call, a side effect or a
1185 reference to a volatile variable. In a ..._DECL, this is set only if the
1186 declaration said `volatile'. This will never be set for a constant. */
1187 #define TREE_SIDE_EFFECTS(NODE) \
1188 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1189
1190 /* In a LABEL_DECL, nonzero means this label had its address taken
1191 and therefore can never be deleted and is a jump target for
1192 computed gotos. */
1193 #define FORCED_LABEL(NODE) ((NODE)->base.side_effects_flag)
1194
1195 /* Nonzero means this expression is volatile in the C sense:
1196 its address should be of type `volatile WHATEVER *'.
1197 In other words, the declared item is volatile qualified.
1198 This is used in _DECL nodes and _REF nodes.
1199 On a FUNCTION_DECL node, this means the function does not
1200 return normally. This is the same effect as setting
1201 the attribute noreturn on the function in C.
1202
1203 In a ..._TYPE node, means this type is volatile-qualified.
1204 But use TYPE_VOLATILE instead of this macro when the node is a type,
1205 because eventually we may make that a different bit.
1206
1207 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1208 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1209
1210 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1211 accessing the memory pointed to won't generate a trap. However,
1212 this only applies to an object when used appropriately: it doesn't
1213 mean that writing a READONLY mem won't trap. Similarly for
1214 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1215
1216 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1217 (or slice of the array) always belongs to the range of the array.
1218 I.e. that the access will not trap, provided that the access to
1219 the base to the array will not trap. */
1220 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1221
1222 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1223 nonzero means it may not be the lhs of an assignment. */
1224 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1225
1226 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1227 #define TREE_READONLY_DECL_P(NODE)\
1228 (DECL_P (NODE) && TREE_READONLY (NODE))
1229
1230 /* Value of expression is constant. Always on in all ..._CST nodes. May
1231 also appear in an expression or decl where the value is constant. */
1232 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1233
1234 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1235 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1236 (TYPE_CHECK (NODE)->base.constant_flag)
1237
1238 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1239 #define DECL_UNSIGNED(NODE) \
1240 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1241
1242 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
1243 #define BIT_FIELD_REF_UNSIGNED(NODE) \
1244 (BIT_FIELD_REF_CHECK (NODE)->base.unsigned_flag)
1245
1246 /* In integral and pointer types, means an unsigned type. */
1247 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1248
1249 /* Nonzero in a VAR_DECL means assembler code has been written.
1250 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1251 This is interesting in an inline function, since it might not need
1252 to be compiled separately.
1253 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1254 if the sdb debugging info for the type has been written.
1255 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1256 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1257 PHI node. */
1258 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1259
1260 /* Nonzero in a _DECL if the name is used in its scope.
1261 Nonzero in an expr node means inhibit warning if value is unused.
1262 In IDENTIFIER_NODEs, this means that some extern decl for this name
1263 was used.
1264 In a BLOCK, this means that the block contains variables that are used. */
1265 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1266
1267 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1268 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1269 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1270
1271 /* In a CALL_EXPR, means that it's safe to use the target of the call
1272 expansion as the return slot for a call that returns in memory. */
1273 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->base.private_flag)
1274
1275 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1276 reference (and the TREE_TYPE is a pointer to the true type). */
1277 #define DECL_BY_REFERENCE(NODE) \
1278 (DECL_COMMON_CHECK (NODE)->base.private_flag)
1279
1280 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1281 thunked-to function. */
1282 #define CALL_FROM_THUNK_P(NODE) \
1283 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1284
1285 /* In a type, nonzero means that all objects of the type are guaranteed by the
1286 language or front-end to be properly aligned, so we can indicate that a MEM
1287 of this type is aligned at least to the alignment of the type, even if it
1288 doesn't appear that it is. We see this, for example, in object-oriented
1289 languages where a tag field may show this is an object of a more-aligned
1290 variant of the more generic type.
1291
1292 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1293 freelist. */
1294 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1295
1296 /* Used in classes in C++. */
1297 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1298 /* Used in classes in C++.
1299 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1300 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1301
1302 /* Nonzero in a _DECL if the use of the name is defined as a
1303 deprecated feature by __attribute__((deprecated)). */
1304 #define TREE_DEPRECATED(NODE) \
1305 ((NODE)->base.deprecated_flag)
1306
1307 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1308 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1309 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1310 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1311
1312 /* Value of expression is function invariant. A strict subset of
1313 TREE_CONSTANT, such an expression is constant over any one function
1314 invocation, though not across different invocations. May appear in
1315 any expression node. */
1316 #define TREE_INVARIANT(NODE) ((NODE)->base.invariant_flag)
1317
1318 /* These flags are available for each language front end to use internally. */
1319 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1320 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1321 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1322 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1323 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1324 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1325 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1326 \f
1327 /* Define additional fields and accessors for nodes representing constants. */
1328
1329 /* In an INTEGER_CST node. These two together make a 2-word integer.
1330 If the data type is signed, the value is sign-extended to 2 words
1331 even though not all of them may really be in use.
1332 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1333 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1334 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1335 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1336
1337 #define INT_CST_LT(A, B) \
1338 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1339 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1340 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1341
1342 #define INT_CST_LT_UNSIGNED(A, B) \
1343 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1344 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1345 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1346 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1347 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1348
1349 struct tree_int_cst GTY(())
1350 {
1351 struct tree_common common;
1352 double_int int_cst;
1353 };
1354
1355 /* In a REAL_CST node. struct real_value is an opaque entity, with
1356 manipulators defined in real.h. We don't want tree.h depending on
1357 real.h and transitively on tm.h. */
1358 struct real_value;
1359
1360 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1361 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1362
1363 struct tree_real_cst GTY(())
1364 {
1365 struct tree_common common;
1366 struct real_value * real_cst_ptr;
1367 };
1368
1369 /* In a STRING_CST */
1370 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1371 #define TREE_STRING_POINTER(NODE) \
1372 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1373
1374 struct tree_string GTY(())
1375 {
1376 struct tree_common common;
1377 int length;
1378 char str[1];
1379 };
1380
1381 /* In a COMPLEX_CST node. */
1382 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1383 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1384
1385 struct tree_complex GTY(())
1386 {
1387 struct tree_common common;
1388 tree real;
1389 tree imag;
1390 };
1391
1392 /* In a VECTOR_CST node. */
1393 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1394
1395 struct tree_vector GTY(())
1396 {
1397 struct tree_common common;
1398 tree elements;
1399 };
1400 \f
1401 #include "symtab.h"
1402
1403 /* Define fields and accessors for some special-purpose tree nodes. */
1404
1405 #define IDENTIFIER_LENGTH(NODE) \
1406 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1407 #define IDENTIFIER_POINTER(NODE) \
1408 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1409 #define IDENTIFIER_HASH_VALUE(NODE) \
1410 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1411
1412 /* Translate a hash table identifier pointer to a tree_identifier
1413 pointer, and vice versa. */
1414
1415 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1416 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1417 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1418
1419 struct tree_identifier GTY(())
1420 {
1421 struct tree_common common;
1422 struct ht_identifier id;
1423 };
1424
1425 /* In a TREE_LIST node. */
1426 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1427 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1428
1429 struct tree_list GTY(())
1430 {
1431 struct tree_common common;
1432 tree purpose;
1433 tree value;
1434 };
1435
1436 /* In a TREE_VEC node. */
1437 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1438 #define TREE_VEC_END(NODE) \
1439 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1440
1441 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1442
1443 struct tree_vec GTY(())
1444 {
1445 struct tree_common common;
1446 int length;
1447 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1448 };
1449
1450 /* In a CONSTRUCTOR node. */
1451 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1452
1453 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1454 value of each element (stored within VAL). IX must be a scratch variable
1455 of unsigned integer type. */
1456 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1457 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1458 ? false \
1459 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1460 true); \
1461 (IX)++)
1462
1463 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1464 the value of each element (stored within VAL) and its index (stored
1465 within INDEX). IX must be a scratch variable of unsigned integer type. */
1466 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1467 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1468 ? false \
1469 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1470 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1471 true); \
1472 (IX)++)
1473
1474 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1475 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1476 do { \
1477 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1478 _ce___->index = INDEX; \
1479 _ce___->value = VALUE; \
1480 } while (0)
1481
1482 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1483 element. INDEX can optionally design the position of VALUE: in arrays,
1484 it is the index where VALUE has to be placed; in structures, it is the
1485 FIELD_DECL of the member. */
1486 typedef struct constructor_elt_d GTY(())
1487 {
1488 tree index;
1489 tree value;
1490 } constructor_elt;
1491
1492 DEF_VEC_O(constructor_elt);
1493 DEF_VEC_ALLOC_O(constructor_elt,gc);
1494
1495 struct tree_constructor GTY(())
1496 {
1497 struct tree_common common;
1498 VEC(constructor_elt,gc) *elts;
1499 };
1500
1501 /* Define fields and accessors for some nodes that represent expressions. */
1502
1503 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1504 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1505 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1506 && integer_zerop (TREE_OPERAND (NODE, 0)))
1507
1508 /* In ordinary expression nodes. */
1509 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1510 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1511
1512 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1513 length. Its value includes the length operand itself; that is,
1514 the minimum valid length is 1.
1515 Note that we have to bypass the use of TREE_OPERAND to access
1516 that field to avoid infinite recursion in expanding the macros. */
1517 #define VL_EXP_OPERAND_LENGTH(NODE) \
1518 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1519
1520 /* In gimple statements. */
1521 #define GIMPLE_STMT_OPERAND(NODE, I) GIMPLE_STMT_OPERAND_CHECK (NODE, I)
1522 #define GIMPLE_STMT_LOCUS(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.locus)
1523 #define GIMPLE_STMT_BLOCK(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.block)
1524
1525 /* In a LOOP_EXPR node. */
1526 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1527
1528 /* The source location of this expression. Non-tree_exp nodes such as
1529 decls and constants can be shared among multiple locations, so
1530 return nothing. */
1531 #define EXPR_LOCATION(NODE) expr_location ((NODE))
1532 #define SET_EXPR_LOCATION(NODE, FROM) set_expr_location ((NODE), (FROM))
1533 #define EXPR_HAS_LOCATION(NODE) expr_has_location ((NODE))
1534 #define EXPR_LOCUS(NODE) expr_locus ((NODE))
1535 #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
1536 #define EXPR_FILENAME(NODE) *(expr_filename ((NODE)))
1537 #define EXPR_LINENO(NODE) *(expr_lineno ((NODE)))
1538
1539 /* True if a tree is an expression or statement that can have a
1540 location. */
1541 #define CAN_HAVE_LOCATION_P(NODE) (EXPR_P (NODE) || GIMPLE_STMT_P (NODE))
1542
1543 /* In a TARGET_EXPR node. */
1544 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1545 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1546 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1547
1548 /* DECL_EXPR accessor. This gives access to the DECL associated with
1549 the given declaration statement. */
1550 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1551
1552 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1553
1554 /* SWITCH_EXPR accessors. These give access to the condition, body and
1555 original condition type (before any compiler conversions)
1556 of the switch statement, respectively. */
1557 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1558 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1559 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1560
1561 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1562 of a case label, respectively. */
1563 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1564 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1565 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1566
1567 /* The operands of a TARGET_MEM_REF. */
1568 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1569 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1570 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1571 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1572 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1573 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1574 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1575
1576 /* The operands of a BIND_EXPR. */
1577 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1578 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1579 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1580
1581 /* GOTO_EXPR accessor. This gives access to the label associated with
1582 a goto statement. */
1583 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1584
1585 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1586 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1587 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1588 statement. */
1589 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1590 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1591 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1592 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1593 /* Nonzero if we want to create an ASM_INPUT instead of an
1594 ASM_OPERAND with no operands. */
1595 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1596 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1597
1598 /* COND_EXPR accessors. */
1599 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1600 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1601 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1602
1603 /* Accessors for the chains of recurrences. */
1604 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1605 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1606 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1607 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1608
1609 /* LABEL_EXPR accessor. This gives access to the label associated with
1610 the given label expression. */
1611 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1612
1613 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1614 accessors for SSA operands. */
1615
1616 /* CATCH_EXPR accessors. */
1617 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1618 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1619
1620 /* EH_FILTER_EXPR accessors. */
1621 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1622 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1623 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1624
1625 /* OBJ_TYPE_REF accessors. */
1626 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1627 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1628 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1629
1630 /* ASSERT_EXPR accessors. */
1631 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1632 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1633
1634 /* CALL_EXPR accessors.
1635 */
1636 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1637 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1638 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1639 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1640 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1641
1642 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1643 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1644 the argument count is zero when checking is enabled. Instead, do
1645 the pointer arithmetic to advance past the 3 fixed operands in a
1646 CALL_EXPR. That produces a valid pointer to just past the end of the
1647 operand array, even if it's not valid to dereference it. */
1648 #define CALL_EXPR_ARGP(NODE) \
1649 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1650
1651 /* OpenMP directive and clause accessors. */
1652
1653 #define OMP_BODY(NODE) \
1654 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1655 #define OMP_CLAUSES(NODE) \
1656 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1657
1658 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1659 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1660 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1661 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1662
1663 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1664 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1665 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1666 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1667 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1668 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1669
1670 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1671 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1672
1673 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1674
1675 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1676 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1677
1678 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1679
1680 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1681
1682 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1683 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1684
1685 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1686 #define OMP_CLAUSE_DECL(NODE) \
1687 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1688 OMP_CLAUSE_PRIVATE, \
1689 OMP_CLAUSE_COPYPRIVATE), 0)
1690
1691 /* True on an OMP_SECTION statement that was the last lexical member.
1692 This status is meaningful in the implementation of lastprivate. */
1693 #define OMP_SECTION_LAST(NODE) \
1694 TREE_PRIVATE (OMP_SECTION_CHECK (NODE))
1695
1696 /* True on an OMP_RETURN statement if the return does not require a
1697 thread synchronization via some sort of barrier. The exact barrier
1698 that would otherwise be emitted is dependent on the OMP statement
1699 with which this return is associated. */
1700 #define OMP_RETURN_NOWAIT(NODE) \
1701 TREE_PRIVATE (OMP_RETURN_CHECK (NODE))
1702
1703 /* True on an OMP_PARALLEL statement if it represents an explicit
1704 combined parallel work-sharing constructs. */
1705 #define OMP_PARALLEL_COMBINED(NODE) \
1706 TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE))
1707
1708 /* True on a PRIVATE clause if its decl is kept around for debugging
1709 information only and its DECL_VALUE_EXPR is supposed to point
1710 to what it has been remapped to. */
1711 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1712 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1713
1714 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1715 decl is present in the chain. */
1716 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1717 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1718
1719 #define OMP_CLAUSE_IF_EXPR(NODE) \
1720 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1721 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1722 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1723 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1724 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1725
1726 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1727 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1728 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1729 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1730 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1731 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1732 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1733 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1734
1735 enum omp_clause_schedule_kind
1736 {
1737 OMP_CLAUSE_SCHEDULE_STATIC,
1738 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1739 OMP_CLAUSE_SCHEDULE_GUIDED,
1740 OMP_CLAUSE_SCHEDULE_RUNTIME
1741 };
1742
1743 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1744 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1745
1746 enum omp_clause_default_kind
1747 {
1748 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1749 OMP_CLAUSE_DEFAULT_SHARED,
1750 OMP_CLAUSE_DEFAULT_NONE,
1751 OMP_CLAUSE_DEFAULT_PRIVATE
1752 };
1753
1754 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1755 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1756
1757 struct tree_exp GTY(())
1758 {
1759 struct tree_common common;
1760 source_locus locus;
1761 tree block;
1762 tree GTY ((special ("tree_exp"),
1763 desc ("TREE_CODE ((tree) &%0)")))
1764 operands[1];
1765 };
1766 \f
1767 /* SSA_NAME accessors. */
1768
1769 /* Returns the variable being referenced. Once released, this is the
1770 only field that can be relied upon. */
1771 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1772
1773 /* Returns the statement which defines this reference. Note that
1774 we use the same field when chaining SSA_NAME nodes together on
1775 the SSA_NAME freelist. */
1776 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1777
1778 /* Returns the SSA version number of this SSA name. Note that in
1779 tree SSA, version numbers are not per variable and may be recycled. */
1780 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1781
1782 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1783 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1784 status bit. */
1785 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1786 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1787
1788 /* Nonzero if this SSA_NAME expression is currently on the free list of
1789 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1790 has no meaning for an SSA_NAME. */
1791 #define SSA_NAME_IN_FREE_LIST(NODE) \
1792 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1793
1794 /* Nonzero if this SSA_NAME is the default definition for the
1795 underlying symbol. A default SSA name is created for symbol S if
1796 the very first reference to S in the function is a read operation.
1797 Default definitions are always created by an empty statement and
1798 belong to no basic block. */
1799 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1800 SSA_NAME_CHECK (NODE)->base.volatile_flag
1801
1802 /* Attributes for SSA_NAMEs for pointer-type variables. */
1803 #define SSA_NAME_PTR_INFO(N) \
1804 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1805
1806 /* Get the value of this SSA_NAME, if available. */
1807 #define SSA_NAME_VALUE(N) \
1808 SSA_NAME_CHECK (N)->ssa_name.value_handle
1809
1810 #ifndef _TREE_FLOW_H
1811 struct ptr_info_def;
1812 #endif
1813
1814
1815
1816 /* Immediate use linking structure. This structure is used for maintaining
1817 a doubly linked list of uses of an SSA_NAME. */
1818 typedef struct ssa_use_operand_d GTY(())
1819 {
1820 struct ssa_use_operand_d* GTY((skip(""))) prev;
1821 struct ssa_use_operand_d* GTY((skip(""))) next;
1822 tree GTY((skip(""))) stmt;
1823 tree *GTY((skip(""))) use;
1824 } ssa_use_operand_t;
1825
1826 /* Return the immediate_use information for an SSA_NAME. */
1827 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1828
1829 struct tree_ssa_name GTY(())
1830 {
1831 struct tree_common common;
1832
1833 /* _DECL wrapped by this SSA name. */
1834 tree var;
1835
1836 /* SSA version number. */
1837 unsigned int version;
1838
1839 /* Pointer attributes used for alias analysis. */
1840 struct ptr_info_def *ptr_info;
1841
1842 /* Value for SSA name used by various passes.
1843
1844 Right now only invariants are allowed to persist beyond a pass in
1845 this field; in the future we will allow VALUE_HANDLEs to persist
1846 as well. */
1847 tree value_handle;
1848
1849 /* Immediate uses list for this SSA_NAME. */
1850 struct ssa_use_operand_d imm_uses;
1851 };
1852 \f
1853 /* In a PHI_NODE node. */
1854
1855 /* These 2 macros should be considered off limits for use by developers. If
1856 you wish to access the use or def fields of a PHI_NODE in the SSA
1857 optimizers, use the accessor macros found in tree-ssa-operands.h.
1858 These two macros are to be used only by those accessor macros, and other
1859 select places where we *absolutely* must take the address of the tree. */
1860
1861 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1862 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1863
1864 /* PHI_NODEs for each basic block are chained together in a single linked
1865 list. The head of the list is linked from the block annotation, and
1866 the link to the next PHI is in PHI_CHAIN. */
1867 #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE))
1868
1869 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1870 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1871 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1872 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1873 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1874 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1875
1876 struct phi_arg_d GTY(())
1877 {
1878 /* imm_use MUST be the first element in struct because we do some
1879 pointer arithmetic with it. See phi_arg_index_from_use. */
1880 struct ssa_use_operand_d imm_use;
1881 tree def;
1882 };
1883
1884 struct tree_phi_node GTY(())
1885 {
1886 struct tree_common common;
1887 tree result;
1888 int num_args;
1889 int capacity;
1890
1891 /* Basic block holding this PHI node. */
1892 struct basic_block_def *bb;
1893
1894 /* Arguments of the PHI node. These are maintained in the same
1895 order as predecessor edge vector BB->PREDS. */
1896 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1897 };
1898
1899 \f
1900 #define OMP_CLAUSE_CODE(NODE) \
1901 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1902
1903 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1904 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1905
1906 #define OMP_CLAUSE_CODE(NODE) \
1907 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1908
1909 #define OMP_CLAUSE_OPERAND(NODE, I) \
1910 OMP_CLAUSE_ELT_CHECK (NODE, I)
1911
1912 struct tree_omp_clause GTY(())
1913 {
1914 struct tree_common common;
1915 enum omp_clause_code code;
1916 union omp_clause_subcode {
1917 enum omp_clause_default_kind default_kind;
1918 enum omp_clause_schedule_kind schedule_kind;
1919 enum tree_code reduction_code;
1920 } GTY ((skip)) subcode;
1921 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1922 };
1923 \f
1924
1925 struct varray_head_tag;
1926
1927 /* In a BLOCK node. */
1928 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1929 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1930 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1931 /* Note: when changing this, make sure to find the places
1932 that use chainon or nreverse. */
1933 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1934 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1935 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1936
1937 /* Nonzero means that this block is prepared to handle exceptions
1938 listed in the BLOCK_VARS slot. */
1939 #define BLOCK_HANDLER_BLOCK(NODE) \
1940 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1941
1942 /* An index number for this block. These values are not guaranteed to
1943 be unique across functions -- whether or not they are depends on
1944 the debugging output format in use. */
1945 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1946
1947 /* If block reordering splits a lexical block into discontiguous
1948 address ranges, we'll make a copy of the original block.
1949
1950 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1951 In that case, we have one source block that has been replicated
1952 (through inlining or unrolling) into many logical blocks, and that
1953 these logical blocks have different physical variables in them.
1954
1955 In this case, we have one logical block split into several
1956 non-contiguous address ranges. Most debug formats can't actually
1957 represent this idea directly, so we fake it by creating multiple
1958 logical blocks with the same variables in them. However, for those
1959 that do support non-contiguous regions, these allow the original
1960 logical block to be reconstructed, along with the set of address
1961 ranges.
1962
1963 One of the logical block fragments is arbitrarily chosen to be
1964 the ORIGIN. The other fragments will point to the origin via
1965 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1966 be null. The list of fragments will be chained through
1967 BLOCK_FRAGMENT_CHAIN from the origin. */
1968
1969 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1970 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1971
1972 /* For an inlined function, this gives the location where it was called
1973 from. This is only set in the top level block, which corresponds to the
1974 inlined function scope. This is used in the debug output routines. */
1975
1976 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1977
1978 struct tree_block GTY(())
1979 {
1980 struct tree_common common;
1981
1982 unsigned handler_block_flag : 1;
1983 unsigned abstract_flag : 1;
1984 unsigned block_num : 30;
1985
1986 tree vars;
1987 tree subblocks;
1988 tree supercontext;
1989 tree abstract_origin;
1990 tree fragment_origin;
1991 tree fragment_chain;
1992 location_t locus;
1993 };
1994 \f
1995 /* Define fields and accessors for nodes representing data types. */
1996
1997 /* See tree.def for documentation of the use of these fields.
1998 Look at the documentation of the various ..._TYPE tree codes.
1999
2000 Note that the type.values, type.minval, and type.maxval fields are
2001 overloaded and used for different macros in different kinds of types.
2002 Each macro must check to ensure the tree node is of the proper kind of
2003 type. Note also that some of the front-ends also overload these fields,
2004 so they must be checked as well. */
2005
2006 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2007 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2008 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2009 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
2010 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2011 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2012 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2013 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2014 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2015 (INTEGER_TYPE_CHECK (NODE)->type.values \
2016 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2017 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2018 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2019 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2020 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2021 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2022 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2023 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2024 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2025 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2026 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2027 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2028 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2029 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2030 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2031 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2032 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2033 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2034 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2035 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2036
2037 /* The "canonical" type for this type node, which can be used to
2038 compare the type for equality with another type. If two types are
2039 equal (based on the semantics of the language), then they will have
2040 equivalent TYPE_CANONICAL entries.
2041
2042 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2043 be used for comparison against other types. Instead, the type is
2044 said to require structural equality checks, described in
2045 TYPE_STRUCTURAL_EQUALITY_P. */
2046 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2047 /* Indicates that the type node requires structural equality
2048 checks. The compiler will need to look at the composition of the
2049 type to determine whether it is equal to another type, rather than
2050 just comparing canonical type pointers. For instance, we would need
2051 to look at the return and parameter types of a FUNCTION_TYPE
2052 node. */
2053 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2054 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2055 type node requires structural equality. */
2056 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2057 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2058
2059 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2060 in the debugging output. We use this to describe a vector as a
2061 structure containing an array. */
2062 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2063
2064 /* For record and union types, information about this type, as a base type
2065 for itself. */
2066 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2067
2068 /* For non record and union types, used in a language-dependent way. */
2069 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2070
2071 /* The (language-specific) typed-based alias set for this type.
2072 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2073 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2074 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2075 type can alias objects of any type. */
2076 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2077
2078 /* Nonzero iff the typed-based alias set for this type has been
2079 calculated. */
2080 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2081
2082 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2083 to this type. */
2084 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2085
2086 /* The alignment necessary for objects of this type.
2087 The value is an int, measured in bits. */
2088 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2089
2090 /* 1 if the alignment for this type was requested by "aligned" attribute,
2091 0 if it is the default for this type. */
2092 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
2093
2094 /* The alignment for NODE, in bytes. */
2095 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2096
2097 /* If your language allows you to declare types, and you want debug info
2098 for them, then you need to generate corresponding TYPE_DECL nodes.
2099 These "stub" TYPE_DECL nodes have no name, and simply point at the
2100 type node. You then set the TYPE_STUB_DECL field of the type node
2101 to point back at the TYPE_DECL node. This allows the debug routines
2102 to know that the two nodes represent the same type, so that we only
2103 get one debug info record for them. */
2104 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2105
2106 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2107 has BLKmode only because it lacks the alignment requirement for
2108 its size. */
2109 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2110
2111 /* In an INTEGER_TYPE, it means the type represents a size. We use
2112 this both for validity checking and to permit optimizations that
2113 are unsafe for other types. Note that the C `size_t' type should
2114 *not* have this flag set. The `size_t' type is simply a typedef
2115 for an ordinary integer type that happens to be the type of an
2116 expression returned by `sizeof'; `size_t' has no special
2117 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2118 always actual sizes. */
2119 #define TYPE_IS_SIZETYPE(NODE) \
2120 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2121
2122 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
2123 pointer depressed. */
2124 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
2125 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2126
2127 /* Nonzero in a type considered volatile as a whole. */
2128 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2129
2130 /* Means this type is const-qualified. */
2131 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2132
2133 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2134 the term. */
2135 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2136
2137 /* There is a TYPE_QUAL value for each type qualifier. They can be
2138 combined by bitwise-or to form the complete set of qualifiers for a
2139 type. */
2140
2141 #define TYPE_UNQUALIFIED 0x0
2142 #define TYPE_QUAL_CONST 0x1
2143 #define TYPE_QUAL_VOLATILE 0x2
2144 #define TYPE_QUAL_RESTRICT 0x4
2145
2146 /* The set of type qualifiers for this type. */
2147 #define TYPE_QUALS(NODE) \
2148 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2149 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2150 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2151
2152 /* These flags are available for each language front end to use internally. */
2153 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2154 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2155 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2156 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2157 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2158 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2159 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2160
2161 /* Used to keep track of visited nodes in tree traversals. This is set to
2162 0 by copy_node and make_node. */
2163 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2164
2165 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2166 that distinguish string from array of char).
2167 If set in a INTEGER_TYPE, indicates a character type. */
2168 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2169
2170 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2171 object of the given ARRAY_TYPE. This allows temporaries to be
2172 allocated. */
2173 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2174 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2175
2176 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2177 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2178 (((unsigned HOST_WIDE_INT) 1) \
2179 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2180
2181 /* Set precision to n when we have 2^n sub-parts of the vector. */
2182 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2183 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2184
2185 /* Indicates that objects of this type must be initialized by calling a
2186 function when they are created. */
2187 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2188 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2189
2190 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2191 the same way that the first union alternative would be passed. */
2192 #define TYPE_TRANSPARENT_UNION(NODE) \
2193 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2194
2195 /* For an ARRAY_TYPE, indicates that it is not permitted to
2196 take the address of a component of the type. */
2197 #define TYPE_NONALIASED_COMPONENT(NODE) \
2198 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2199
2200 /* Indicated that objects of this type should be laid out in as
2201 compact a way as possible. */
2202 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2203
2204 /* Used by type_contains_placeholder_p to avoid recomputation.
2205 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2206 this field directly. */
2207 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2208 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2209
2210 struct die_struct;
2211
2212 struct tree_type GTY(())
2213 {
2214 struct tree_common common;
2215 tree values;
2216 tree size;
2217 tree size_unit;
2218 tree attributes;
2219 unsigned int uid;
2220
2221 unsigned int precision : 9;
2222 ENUM_BITFIELD(machine_mode) mode : 7;
2223
2224 unsigned string_flag : 1;
2225 unsigned no_force_blk_flag : 1;
2226 unsigned needs_constructing_flag : 1;
2227 unsigned transparent_union_flag : 1;
2228 unsigned packed_flag : 1;
2229 unsigned restrict_flag : 1;
2230 unsigned contains_placeholder_bits : 2;
2231
2232 unsigned lang_flag_0 : 1;
2233 unsigned lang_flag_1 : 1;
2234 unsigned lang_flag_2 : 1;
2235 unsigned lang_flag_3 : 1;
2236 unsigned lang_flag_4 : 1;
2237 unsigned lang_flag_5 : 1;
2238 unsigned lang_flag_6 : 1;
2239 unsigned user_align : 1;
2240
2241 unsigned int align;
2242 tree pointer_to;
2243 tree reference_to;
2244 union tree_type_symtab {
2245 int GTY ((tag ("0"))) address;
2246 char * GTY ((tag ("1"))) pointer;
2247 struct die_struct * GTY ((tag ("2"))) die;
2248 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2249 descbits ("2"))) symtab;
2250 tree name;
2251 tree minval;
2252 tree maxval;
2253 tree next_variant;
2254 tree main_variant;
2255 tree binfo;
2256 tree context;
2257 tree canonical;
2258 HOST_WIDE_INT alias_set;
2259 /* Points to a structure whose details depend on the language in use. */
2260 struct lang_type *lang_specific;
2261 };
2262 \f
2263 /* Define accessor macros for information about type inheritance
2264 and basetypes.
2265
2266 A "basetype" means a particular usage of a data type for inheritance
2267 in another type. Each such basetype usage has its own "binfo"
2268 object to describe it. The binfo object is a TREE_VEC node.
2269
2270 Inheritance is represented by the binfo nodes allocated for a
2271 given type. For example, given types C and D, such that D is
2272 inherited by C, 3 binfo nodes will be allocated: one for describing
2273 the binfo properties of C, similarly one for D, and one for
2274 describing the binfo properties of D as a base type for C.
2275 Thus, given a pointer to class C, one can get a pointer to the binfo
2276 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2277
2278 /* BINFO specific flags. */
2279
2280 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2281 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2282
2283 /* Flags for language dependent use. */
2284 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2285 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2286 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2287 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2288 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2289 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2290 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2291
2292 /* The actual data type node being inherited in this basetype. */
2293 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2294
2295 /* The offset where this basetype appears in its containing type.
2296 BINFO_OFFSET slot holds the offset (in bytes)
2297 from the base of the complete object to the base of the part of the
2298 object that is allocated on behalf of this `type'.
2299 This is always 0 except when there is multiple inheritance. */
2300
2301 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2302 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2303
2304 /* The virtual function table belonging to this basetype. Virtual
2305 function tables provide a mechanism for run-time method dispatching.
2306 The entries of a virtual function table are language-dependent. */
2307
2308 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2309
2310 /* The virtual functions in the virtual function table. This is
2311 a TREE_LIST that is used as an initial approximation for building
2312 a virtual function table for this basetype. */
2313 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2314
2315 /* A vector of binfos for the direct basetypes inherited by this
2316 basetype.
2317
2318 If this basetype describes type D as inherited in C, and if the
2319 basetypes of D are E and F, then this vector contains binfos for
2320 inheritance of E and F by C. */
2321 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2322
2323 /* The number of basetypes for NODE. */
2324 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2325
2326 /* Accessor macro to get to the Nth base binfo of this binfo. */
2327 #define BINFO_BASE_BINFO(NODE,N) \
2328 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2329 #define BINFO_BASE_ITERATE(NODE,N,B) \
2330 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2331 #define BINFO_BASE_APPEND(NODE,T) \
2332 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2333
2334 /* For a BINFO record describing a virtual base class, i.e., one where
2335 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2336 base. The actual contents are language-dependent. In the C++
2337 front-end this field is an INTEGER_CST giving an offset into the
2338 vtable where the offset to the virtual base can be found. */
2339 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2340
2341 /* Indicates the accesses this binfo has to its bases. The values are
2342 access_public_node, access_protected_node or access_private_node.
2343 If this array is not present, public access is implied. */
2344 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2345
2346 #define BINFO_BASE_ACCESS(NODE,N) \
2347 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2348 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2349 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2350
2351 /* The index in the VTT where this subobject's sub-VTT can be found.
2352 NULL_TREE if there is no sub-VTT. */
2353 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2354
2355 /* The index in the VTT where the vptr for this subobject can be
2356 found. NULL_TREE if there is no secondary vptr in the VTT. */
2357 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2358
2359 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2360 inheriting this base for non-virtual bases. For virtual bases it
2361 points either to the binfo for which this is a primary binfo, or to
2362 the binfo of the most derived type. */
2363 #define BINFO_INHERITANCE_CHAIN(NODE) \
2364 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2365
2366 struct tree_binfo GTY (())
2367 {
2368 struct tree_common common;
2369
2370 tree offset;
2371 tree vtable;
2372 tree virtuals;
2373 tree vptr_field;
2374 VEC(tree,gc) *base_accesses;
2375 tree inheritance;
2376
2377 tree vtt_subvtt;
2378 tree vtt_vptr;
2379
2380 VEC(tree,none) base_binfos;
2381 };
2382
2383 \f
2384 /* Define fields and accessors for nodes representing declared names. */
2385
2386 /* Nonzero if DECL represents a variable for the SSA passes. */
2387 #define SSA_VAR_P(DECL) \
2388 (TREE_CODE (DECL) == VAR_DECL \
2389 || TREE_CODE (DECL) == PARM_DECL \
2390 || TREE_CODE (DECL) == RESULT_DECL \
2391 || MTAG_P (DECL) \
2392 || (TREE_CODE (DECL) == SSA_NAME \
2393 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2394 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2395 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2396 || MTAG_P (SSA_NAME_VAR (DECL)))))
2397
2398
2399
2400
2401 /* Enumerate visibility settings. */
2402 #ifndef SYMBOL_VISIBILITY_DEFINED
2403 #define SYMBOL_VISIBILITY_DEFINED
2404 enum symbol_visibility
2405 {
2406 VISIBILITY_DEFAULT,
2407 VISIBILITY_PROTECTED,
2408 VISIBILITY_HIDDEN,
2409 VISIBILITY_INTERNAL
2410 };
2411 #endif
2412
2413 struct function;
2414
2415
2416 /* This is the name of the object as written by the user.
2417 It is an IDENTIFIER_NODE. */
2418 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2419
2420 /* Every ..._DECL node gets a unique number. */
2421 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2422
2423 /* These two fields describe where in the source code the declaration
2424 was. If the declaration appears in several places (as for a C
2425 function that is declared first and then defined later), this
2426 information should refer to the definition. */
2427 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2428 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2429 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2430 #ifdef USE_MAPPED_LOCATION
2431 #define DECL_IS_BUILTIN(DECL) \
2432 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2433 #else
2434 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
2435 #endif
2436
2437 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2438 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2439 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2440 points to either the FUNCTION_DECL for the containing function,
2441 the RECORD_TYPE or UNION_TYPE for the containing type, or
2442 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2443 scope". */
2444 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2445 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2446 struct tree_decl_minimal GTY(())
2447 {
2448 struct tree_common common;
2449 location_t locus;
2450 unsigned int uid;
2451 tree name;
2452 tree context;
2453 };
2454
2455 /* When computing aliasing information, we represent the memory pointed-to
2456 by pointers with artificial variables called "memory tags" (MT). There
2457 are two kinds of tags, namely symbol and name:
2458
2459 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2460 represent all the pointed-to locations and variables pointed-to by
2461 the same pointer symbol. Usually, this set is computed using
2462 type-based analysis (i.e., alias set classes), but this may not
2463 always be the case.
2464
2465 Name tags (NMT) are used in flow-sensitive points-to alias
2466 analysis, they represent the variables and memory locations
2467 pointed-to by a specific SSA_NAME pointer.
2468
2469 In general, given a pointer P with a symbol tag SMT, the alias set
2470 of SMT should be the union of all the alias sets of the NMTs of
2471 every SSA_NAME for P. */
2472 struct tree_memory_tag GTY(())
2473 {
2474 struct tree_decl_minimal common;
2475
2476 bitmap GTY ((skip)) aliases;
2477
2478 unsigned int is_global:1;
2479 };
2480
2481 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2482 #define MTAG_ALIASES(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.aliases)
2483
2484 struct tree_struct_field_tag GTY(())
2485 {
2486 struct tree_memory_tag common;
2487
2488 /* Parent variable. */
2489 tree parent_var;
2490
2491 /* Offset inside structure. */
2492 unsigned HOST_WIDE_INT offset;
2493
2494 /* Size of the field. */
2495 unsigned HOST_WIDE_INT size;
2496
2497 };
2498 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var)
2499 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset)
2500 #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size)
2501
2502 /* Memory Partition Tags (MPTs) group memory symbols under one
2503 common name for the purposes of placing memory PHI nodes. */
2504
2505 struct tree_memory_partition_tag GTY(())
2506 {
2507 struct tree_memory_tag common;
2508
2509 /* Set of symbols grouped under this MPT. */
2510 bitmap symbols;
2511 };
2512
2513 #define MPT_SYMBOLS(NODE) (MEMORY_PARTITION_TAG_CHECK (NODE)->mpt.symbols)
2514
2515
2516 /* For any sort of a ..._DECL node, this points to the original (abstract)
2517 decl node which this decl is an instance of, or else it is NULL indicating
2518 that this decl is not an instance of some other decl. For example,
2519 in a nested declaration of an inline function, this points back to the
2520 definition. */
2521 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2522
2523 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2524 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2525 #define DECL_ORIGIN(NODE) \
2526 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2527
2528 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2529 inline instance of some original (abstract) decl from an inline function;
2530 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2531 nodes can also have their abstract origin set to themselves. */
2532 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2533 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2534
2535 /* In a DECL this is the field where attributes are stored. */
2536 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2537
2538 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2539 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2540 For a VAR_DECL, holds the initial value.
2541 For a PARM_DECL, not used--default
2542 values for parameters are encoded in the type of the function,
2543 not in the PARM_DECL slot.
2544 For a FIELD_DECL, this is used for enumeration values and the C
2545 frontend uses it for temporarily storing bitwidth of bitfields.
2546
2547 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2548 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2549
2550 /* Holds the size of the datum, in bits, as a tree expression.
2551 Need not be constant. */
2552 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2553 /* Likewise for the size in bytes. */
2554 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2555 /* Holds the alignment required for the datum, in bits. */
2556 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.u1.a.align)
2557 /* The alignment of NODE, in bytes. */
2558 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2559 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2560 DECL_FIELD_OFFSET which are known to be always zero.
2561 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2562 has. */
2563 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2564 /* Holds the machine mode corresponding to the declaration of a variable or
2565 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2566 FIELD_DECL. */
2567 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2568
2569 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2570 operation it is. Note, however, that this field is overloaded, with
2571 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2572 checked before any access to the former. */
2573 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_common.u1.f)
2574 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2575 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2576
2577 /* Nonzero for a given ..._DECL node means that the name of this node should
2578 be ignored for symbolic debug purposes. Moreover, for a FUNCTION_DECL,
2579 the body of the function should also be ignored. */
2580 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2581
2582 /* Nonzero for a given ..._DECL node means that this node represents an
2583 "abstract instance" of the given declaration (e.g. in the original
2584 declaration of an inline function). When generating symbolic debugging
2585 information, we mustn't try to generate any address information for nodes
2586 marked as "abstract instances" because we don't actually generate
2587 any code or allocate any data space for such instances. */
2588 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2589
2590 /* Language-specific decl information. */
2591 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2592
2593 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2594 do not allocate storage, and refer to a definition elsewhere. Note that
2595 this does not necessarily imply the entity represented by NODE
2596 has no program source-level definition in this translation unit. For
2597 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2598 DECL_EXTERNAL may be true simultaneously; that can be the case for
2599 a C99 "extern inline" function. */
2600 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2601
2602 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2603 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2604
2605 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2606
2607 Also set in some languages for variables, etc., outside the normal
2608 lexical scope, such as class instance variables. */
2609 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2610
2611 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2612 Used in FIELD_DECLs for vtable pointers.
2613 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2614 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2615
2616 /* Used to indicate that this DECL represents a compiler-generated entity. */
2617 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2618
2619 /* Additional flags for language-specific uses. */
2620 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2621 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2622 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2623 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2624 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2625 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2626 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2627 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2628
2629 /* Used to indicate an alias set for the memory pointed to by this
2630 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2631 pointer (or reference) type. */
2632 #define DECL_POINTER_ALIAS_SET(NODE) \
2633 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2634
2635 /* Nonzero if an alias set has been assigned to this declaration. */
2636 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2637 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2638
2639 /* Nonzero for a decl which is at file scope. */
2640 #define DECL_FILE_SCOPE_P(EXP) \
2641 (! DECL_CONTEXT (EXP) \
2642 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2643
2644 /* Nonzero for a decl that is decorated using attribute used.
2645 This indicates compiler tools that this decl needs to be preserved. */
2646 #define DECL_PRESERVE_P(DECL) \
2647 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2648
2649 /* For function local variables of COMPLEX and VECTOR types,
2650 indicates that the variable is not aliased, and that all
2651 modifications to the variable have been adjusted so that
2652 they are killing assignments. Thus the variable may now
2653 be treated as a GIMPLE register, and use real instead of
2654 virtual ops in SSA form. */
2655 #define DECL_GIMPLE_REG_P(DECL) \
2656 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2657
2658 struct tree_decl_common GTY(())
2659 {
2660 struct tree_decl_minimal common;
2661 tree size;
2662
2663 ENUM_BITFIELD(machine_mode) mode : 8;
2664
2665 unsigned nonlocal_flag : 1;
2666 unsigned virtual_flag : 1;
2667 unsigned ignored_flag : 1;
2668 unsigned abstract_flag : 1;
2669 unsigned artificial_flag : 1;
2670 unsigned user_align : 1;
2671 unsigned preserve_flag: 1;
2672 unsigned debug_expr_is_from : 1;
2673
2674 unsigned lang_flag_0 : 1;
2675 unsigned lang_flag_1 : 1;
2676 unsigned lang_flag_2 : 1;
2677 unsigned lang_flag_3 : 1;
2678 unsigned lang_flag_4 : 1;
2679 unsigned lang_flag_5 : 1;
2680 unsigned lang_flag_6 : 1;
2681 unsigned lang_flag_7 : 1;
2682
2683 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2684 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2685 unsigned decl_flag_0 : 1;
2686 /* In FIELD_DECL, this is DECL_PACKED. */
2687 unsigned decl_flag_1 : 1;
2688 /* In FIELD_DECL, this is DECL_BIT_FIELD
2689 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2690 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2691 unsigned decl_flag_2 : 1;
2692 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2693 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2694 unsigned decl_flag_3 : 1;
2695 /* Logically, these two would go in a theoretical base shared by var and
2696 parm decl. */
2697 unsigned gimple_reg_flag : 1;
2698
2699 union tree_decl_u1 {
2700 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2701 DECL_FUNCTION_CODE. */
2702 enum built_in_function f;
2703 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2704 is used by language-dependent code. */
2705 HOST_WIDE_INT i;
2706 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2707 FUNCTION_DECLs). */
2708 struct tree_decl_u1_a {
2709 unsigned int align : 24;
2710 unsigned int off_align : 8;
2711 } a;
2712 } GTY ((skip)) u1;
2713
2714 tree size_unit;
2715 tree initial;
2716 tree attributes;
2717 tree abstract_origin;
2718
2719 HOST_WIDE_INT pointer_alias_set;
2720 /* Points to a structure whose details depend on the language in use. */
2721 struct lang_decl *lang_specific;
2722 };
2723
2724 extern tree decl_value_expr_lookup (tree);
2725 extern void decl_value_expr_insert (tree, tree);
2726
2727 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2728 if transformations have made this more complicated than evaluating the
2729 decl itself. This should only be used for debugging; once this field has
2730 been set, the decl itself may not legitimately appear in the function. */
2731 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2732 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2733 #define DECL_VALUE_EXPR(NODE) \
2734 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2735 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2736 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2737
2738 /* Holds the RTL expression for the value of a variable or function.
2739 This value can be evaluated lazily for functions, variables with
2740 static storage duration, and labels. */
2741 #define DECL_RTL(NODE) \
2742 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2743 ? (NODE)->decl_with_rtl.rtl \
2744 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2745
2746 /* Set the DECL_RTL for NODE to RTL. */
2747 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2748
2749 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2750 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2751
2752 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2753 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2754
2755 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2756 NODE1, it will not be set for NODE2; this is a lazy copy. */
2757 #define COPY_DECL_RTL(NODE1, NODE2) \
2758 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2759
2760 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2761 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2762
2763 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2764 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2765
2766 struct tree_decl_with_rtl GTY(())
2767 {
2768 struct tree_decl_common common;
2769 rtx rtl;
2770 };
2771
2772 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2773 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2774 of the structure. */
2775 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2776
2777 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2778 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2779 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2780 natural alignment of the field's type). */
2781 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2782
2783 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2784 if so, the type that was originally specified for it.
2785 TREE_TYPE may have been modified (in finish_struct). */
2786 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2787
2788 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2789 if nonzero, indicates that the field occupies the type. */
2790 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2791
2792 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2793 DECL_FIELD_OFFSET which are known to be always zero.
2794 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2795 has. */
2796 #define DECL_OFFSET_ALIGN(NODE) \
2797 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align)
2798
2799 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2800 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2801 (FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align = exact_log2 ((X) & -(X)))
2802 /* 1 if the alignment for this type was requested by "aligned" attribute,
2803 0 if it is the default for this type. */
2804
2805 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2806 which this FIELD_DECL is defined. This information is needed when
2807 writing debugging information about vfield and vbase decls for C++. */
2808 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2809
2810 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2811 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2812
2813 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2814 specially. */
2815 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2816
2817 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2818 this component. */
2819 #define DECL_NONADDRESSABLE_P(NODE) \
2820 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2821
2822 struct tree_field_decl GTY(())
2823 {
2824 struct tree_decl_common common;
2825
2826 tree offset;
2827 tree bit_field_type;
2828 tree qualifier;
2829 tree bit_offset;
2830 tree fcontext;
2831
2832 };
2833
2834 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2835 dense, unique within any one function, and may be used to index arrays.
2836 If the value is -1, then no UID has been assigned. */
2837 #define LABEL_DECL_UID(NODE) \
2838 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2839
2840 /* In LABEL_DECL nodes, nonzero means that an error message about
2841 jumping into such a binding contour has been printed for this label. */
2842 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2843
2844 struct tree_label_decl GTY(())
2845 {
2846 struct tree_decl_with_rtl common;
2847 /* Java's verifier has some need to store information about labels,
2848 and was using fields that no longer exist on labels.
2849 Once the verifier doesn't need these anymore, they should be removed. */
2850 tree java_field_1;
2851 tree java_field_2;
2852 tree java_field_3;
2853 unsigned int java_field_4;
2854
2855 };
2856
2857 struct tree_result_decl GTY(())
2858 {
2859 struct tree_decl_with_rtl common;
2860 };
2861
2862 struct tree_const_decl GTY(())
2863 {
2864 struct tree_decl_with_rtl common;
2865 };
2866
2867 /* For a PARM_DECL, records the data type used to pass the argument,
2868 which may be different from the type seen in the program. */
2869 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2870
2871 /* For PARM_DECL, holds an RTL for the stack slot or register
2872 where the data was actually passed. */
2873 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2874
2875 struct tree_parm_decl GTY(())
2876 {
2877 struct tree_decl_with_rtl common;
2878 rtx incoming_rtl;
2879 };
2880
2881
2882 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2883 this variable in a BIND_EXPR. */
2884 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2885 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2886
2887 /* Used to indicate that the linkage status of this DECL is not yet known,
2888 so it should not be output now. */
2889 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2890
2891 /* Nonzero for a given ..._DECL node means that no warnings should be
2892 generated just because this node is unused. */
2893 #define DECL_IN_SYSTEM_HEADER(NODE) \
2894 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2895
2896 /* Used to indicate that this DECL has weak linkage. */
2897 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2898
2899 /* Internal to the gimplifier. Indicates that the value is a formal
2900 temporary controlled by the gimplifier. */
2901 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2902 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2903
2904 /* Used to indicate that the DECL is a dllimport. */
2905 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2906
2907 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2908 based on a variable with a restrict qualified type. If it is,
2909 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2910 it is based. */
2911
2912 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2913 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2914 #define DECL_GET_RESTRICT_BASE(NODE) \
2915 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2916 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2917 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2918
2919 extern tree decl_restrict_base_lookup (tree);
2920 extern void decl_restrict_base_insert (tree, tree);
2921
2922 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2923 not be put out unless it is needed in this translation unit.
2924 Entities like this are shared across translation units (like weak
2925 entities), but are guaranteed to be generated by any translation
2926 unit that needs them, and therefore need not be put out anywhere
2927 where they are not needed. DECL_COMDAT is just a hint to the
2928 back-end; it is up to front-ends which set this flag to ensure
2929 that there will never be any harm, other than bloat, in putting out
2930 something which is DECL_COMDAT. */
2931 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2932
2933 /* A replaceable function is one which may be replaced at link-time
2934 with an entirely different definition, provided that the
2935 replacement has the same type. For example, functions declared
2936 with __attribute__((weak)) on most systems are replaceable.
2937
2938 COMDAT functions are not replaceable, since all definitions of the
2939 function must be equivalent. It is important that COMDAT functions
2940 not be treated as replaceable so that use of C++ template
2941 instantiations is not penalized.
2942
2943 For example, DECL_REPLACEABLE is used to determine whether or not a
2944 function (including a template instantiation) which is not
2945 explicitly declared "inline" can be inlined. If the function is
2946 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2947 implementation chosen at link-time may be different. However, a
2948 function that is not DECL_REPLACEABLE can be inlined, since all
2949 versions of the function will be functionally identical. */
2950 #define DECL_REPLACEABLE_P(NODE) \
2951 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2952
2953 /* The name of the object as the assembler will see it (but before any
2954 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2955 as DECL_NAME. It is an IDENTIFIER_NODE. */
2956 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2957
2958 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2959 This is true of all DECL nodes except FIELD_DECL. */
2960 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2961 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2962
2963 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2964 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2965 yet. */
2966 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2967 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2968
2969 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2970 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2971 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2972
2973 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2974 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2975 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2976 semantics of using this macro, are different than saying:
2977
2978 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2979
2980 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2981
2982 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2983 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2984 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2985 DECL_ASSEMBLER_NAME (DECL1)) \
2986 : (void) 0)
2987
2988 /* Records the section name in a section attribute. Used to pass
2989 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2990 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2991
2992 /* Value of the decls's visibility attribute */
2993 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2994
2995 /* Nonzero means that the decl had its visibility specified rather than
2996 being inferred. */
2997 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2998
2999 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3000 multiple translation units should be merged. */
3001 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
3002
3003 struct tree_decl_with_vis GTY(())
3004 {
3005 struct tree_decl_with_rtl common;
3006 tree assembler_name;
3007 tree section_name;
3008
3009 /* Belong to VAR_DECL exclusively. */
3010 unsigned defer_output:1;
3011 unsigned hard_register:1;
3012 unsigned thread_local:1;
3013 unsigned common_flag:1;
3014 unsigned in_text_section : 1;
3015 unsigned gimple_formal_temp : 1;
3016 unsigned dllimport_flag : 1;
3017 unsigned based_on_restrict_p : 1;
3018 /* Used by C++. Might become a generic decl flag. */
3019 unsigned shadowed_for_var_p : 1;
3020
3021 /* Don't belong to VAR_DECL exclusively. */
3022 unsigned in_system_header_flag : 1;
3023 unsigned weak_flag:1;
3024 unsigned seen_in_bind_expr : 1;
3025 unsigned comdat_flag : 1;
3026 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3027 unsigned visibility_specified : 1;
3028 /* Belong to FUNCTION_DECL exclusively. */
3029 unsigned one_only : 1;
3030 unsigned init_priority_p:1;
3031
3032 /* Belongs to VAR_DECL exclusively. */
3033 ENUM_BITFIELD(tls_model) tls_model : 3;
3034 /* 11 unused bits. */
3035 };
3036
3037 /* In a VAR_DECL that's static,
3038 nonzero if the space is in the text section. */
3039 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3040
3041 /* Nonzero for a given ..._DECL node means that this node should be
3042 put in .common, if possible. If a DECL_INITIAL is given, and it
3043 is not error_mark_node, then the decl cannot be put in .common. */
3044 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3045
3046 /* In a VAR_DECL, nonzero if the decl is a register variable with
3047 an explicit asm specification. */
3048 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3049
3050 extern tree decl_debug_expr_lookup (tree);
3051 extern void decl_debug_expr_insert (tree, tree);
3052 /* For VAR_DECL, this is set to either an expression that it was split
3053 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3054 subexpressions that it was split into. */
3055 #define DECL_DEBUG_EXPR(NODE) \
3056 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3057
3058 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3059 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3060
3061 /* An initializationp priority. */
3062 typedef unsigned short priority_type;
3063
3064 extern priority_type decl_init_priority_lookup (tree);
3065 extern priority_type decl_fini_priority_lookup (tree);
3066 extern void decl_init_priority_insert (tree, priority_type);
3067 extern void decl_fini_priority_insert (tree, priority_type);
3068
3069 /* In a non-local VAR_DECL with static storage duration, true if the
3070 variable has an initialization priority. If false, the variable
3071 will be initialized at the DEFAULT_INIT_PRIORITY. */
3072 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3073 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3074
3075 /* For a VAR_DECL or FUNCTION_DECL with DECL_HAS_INIT_PRIORITY_P set,
3076 the initialization priority of NODE. */
3077 #define DECL_INIT_PRIORITY(NODE) \
3078 (decl_init_priority_lookup (NODE))
3079 /* Set the initialization priority for NODE to VAL. */
3080 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3081 (decl_init_priority_insert (NODE, VAL))
3082
3083 /* For a FUNCTION_DECL with DECL_HAS_INIT_PRIORITY_P set, the
3084 finalization priority of NODE. */
3085 #define DECL_FINI_PRIORITY(NODE) \
3086 (decl_fini_priority_lookup (NODE))
3087 /* Set the finalization priority for NODE to VAL. */
3088 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3089 (decl_fini_priority_insert (NODE, VAL))
3090
3091 /* The initialization priority for entities for which no explicit
3092 initialization priority has been specified. */
3093 #define DEFAULT_INIT_PRIORITY 65535
3094
3095 /* The maximum allowed initialization priority. */
3096 #define MAX_INIT_PRIORITY 65535
3097
3098 /* The largest priority value reserved for use by system runtime
3099 libraries. */
3100 #define MAX_RESERVED_INIT_PRIORITY 100
3101
3102 /* In a VAR_DECL, the model to use if the data should be allocated from
3103 thread-local storage. */
3104 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3105
3106 /* In a VAR_DECL, nonzero if the data should be allocated from
3107 thread-local storage. */
3108 #define DECL_THREAD_LOCAL_P(NODE) \
3109 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
3110
3111 struct tree_var_decl GTY(())
3112 {
3113 struct tree_decl_with_vis common;
3114 };
3115
3116
3117 /* This field is used to reference anything in decl.result and is meant only
3118 for use by the garbage collector. */
3119 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3120
3121 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3122 Before the struct containing the FUNCTION_DECL is laid out,
3123 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3124 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3125 function. When the class is laid out, this pointer is changed
3126 to an INTEGER_CST node which is suitable for use as an index
3127 into the virtual function table.
3128 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3129 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3130
3131 struct tree_decl_non_common GTY(())
3132
3133 {
3134 struct tree_decl_with_vis common;
3135 /* C++ uses this in namespaces. */
3136 tree saved_tree;
3137 /* C++ uses this in templates. */
3138 tree arguments;
3139 /* Almost all FE's use this. */
3140 tree result;
3141 /* C++ uses this in namespaces. */
3142 tree vindex;
3143 };
3144
3145 /* In FUNCTION_DECL, holds the decl for the return value. */
3146 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3147
3148 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3149 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3150
3151 /* In a FUNCTION_DECL, the saved representation of the body of the
3152 entire function. */
3153 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3154
3155 /* Nonzero in a FUNCTION_DECL means this function should be treated
3156 as if it were a malloc, meaning it returns a pointer that is
3157 not an alias. */
3158 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3159
3160 /* Nonzero in a FUNCTION_DECL means this function may return more
3161 than once. */
3162 #define DECL_IS_RETURNS_TWICE(NODE) \
3163 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3164
3165 /* Nonzero in a FUNCTION_DECL means this function should be treated
3166 as "pure" function (like const function, but may read global memory). */
3167 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3168
3169 /* Nonzero in a FUNCTION_DECL means this function should be treated
3170 as "novops" function (function that does not read global memory,
3171 but may have arbitrary side effects). */
3172 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3173
3174 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3175 at the beginning or end of execution. */
3176 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3177 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3178
3179 #define DECL_STATIC_DESTRUCTOR(NODE) \
3180 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3181
3182 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3183 be instrumented with calls to support routines. */
3184 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3185 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3186
3187 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3188 disabled in this function. */
3189 #define DECL_NO_LIMIT_STACK(NODE) \
3190 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3191
3192 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3193 static chain is not needed. */
3194 #define DECL_NO_STATIC_CHAIN(NODE) \
3195 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3196
3197 /* Nonzero for a decl that cgraph has decided should be inlined into
3198 at least one call site. It is not meaningful to look at this
3199 directly; always use cgraph_function_possibly_inlined_p. */
3200 #define DECL_POSSIBLY_INLINED(DECL) \
3201 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3202
3203 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3204 where it is called. */
3205 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3206
3207 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3208 such as via the `inline' keyword in C/C++. This flag controls the linkage
3209 semantics of 'inline'; whether or not the function is inlined is
3210 controlled by DECL_INLINE. */
3211 #define DECL_DECLARED_INLINE_P(NODE) \
3212 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3213
3214 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3215 that describes the status of this function. */
3216 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3217
3218 /* In a FUNCTION_DECL, nonzero means a built in function. */
3219 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3220
3221 /* For a builtin function, identify which part of the compiler defined it. */
3222 #define DECL_BUILT_IN_CLASS(NODE) \
3223 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3224
3225 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3226 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3227 uses. */
3228 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3229 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3230
3231 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3232 arguments/result/saved_tree fields by front ends. It was either inherit
3233 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3234 which seemed a bit strange. */
3235
3236 struct tree_function_decl GTY(())
3237 {
3238 struct tree_decl_non_common common;
3239
3240 unsigned static_ctor_flag : 1;
3241 unsigned static_dtor_flag : 1;
3242 unsigned uninlinable : 1;
3243 unsigned possibly_inlined : 1;
3244 unsigned novops_flag : 1;
3245 unsigned returns_twice_flag : 1;
3246 unsigned malloc_flag : 1;
3247 unsigned pure_flag : 1;
3248
3249 unsigned declared_inline_flag : 1;
3250 unsigned regdecl_flag : 1;
3251 unsigned inline_flag : 1;
3252 unsigned no_instrument_function_entry_exit : 1;
3253 unsigned no_limit_stack : 1;
3254 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3255
3256 struct function *f;
3257 };
3258
3259 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3260 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3261
3262 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3263 into stabs. Instead it will generate cross reference ('x') of names.
3264 This uses the same flag as DECL_EXTERNAL. */
3265 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3266 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3267
3268 struct tree_type_decl GTY(())
3269 {
3270 struct tree_decl_non_common common;
3271
3272 };
3273 \f
3274 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3275 To reduce overhead, the nodes containing the statements are not trees.
3276 This avoids the overhead of tree_common on all linked list elements.
3277
3278 Use the interface in tree-iterator.h to access this node. */
3279
3280 #define STATEMENT_LIST_HEAD(NODE) \
3281 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3282 #define STATEMENT_LIST_TAIL(NODE) \
3283 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3284
3285 struct tree_statement_list_node
3286 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3287 {
3288 struct tree_statement_list_node *prev;
3289 struct tree_statement_list_node *next;
3290 tree stmt;
3291 };
3292
3293 struct tree_statement_list
3294 GTY(())
3295 {
3296 struct tree_common common;
3297 struct tree_statement_list_node *head;
3298 struct tree_statement_list_node *tail;
3299 };
3300
3301 #define VALUE_HANDLE_ID(NODE) \
3302 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3303
3304 #define VALUE_HANDLE_EXPR_SET(NODE) \
3305 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3306
3307 #define VALUE_HANDLE_VUSES(NODE) \
3308 (VALUE_HANDLE_CHECK (NODE)->value_handle.vuses)
3309
3310 /* Defined and used in tree-ssa-pre.c. */
3311
3312 struct tree_value_handle GTY(())
3313 {
3314 struct tree_common common;
3315
3316 /* The set of expressions represented by this handle. */
3317 struct bitmap_set * GTY ((skip)) expr_set;
3318
3319 /* Unique ID for this value handle. IDs are handed out in a
3320 conveniently dense form starting at 0, so that we can make
3321 bitmaps of value handles. */
3322 unsigned int id;
3323
3324 /* Set of virtual uses represented by this handle. */
3325 VEC (tree, gc) *vuses;
3326 };
3327 \f
3328 /* Define the overall contents of a tree node.
3329 It may be any of the structures declared above
3330 for various types of node. */
3331
3332 union tree_node GTY ((ptr_alias (union lang_tree_node),
3333 desc ("tree_node_structure (&%h)")))
3334 {
3335 struct tree_base GTY ((tag ("TS_BASE"))) base;
3336 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3337 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3338 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3339 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3340 struct tree_string GTY ((tag ("TS_STRING"))) string;
3341 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3342 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3343 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3344 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3345 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3346 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3347 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3348 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3349 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3350 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3351 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3352 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3353 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3354 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3355 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3356 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3357 struct tree_list GTY ((tag ("TS_LIST"))) list;
3358 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3359 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3360 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3361 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3362 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3363 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3364 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3365 struct gimple_stmt GTY ((tag ("TS_GIMPLE_STATEMENT"))) gstmt;
3366 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3367 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3368 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3369 struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft;
3370 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3371 struct tree_memory_partition_tag GTY ((tag ("TS_MEMORY_PARTITION_TAG"))) mpt;
3372 };
3373 \f
3374 /* Standard named or nameless data types of the C compiler. */
3375
3376 enum tree_index
3377 {
3378 TI_ERROR_MARK,
3379 TI_INTQI_TYPE,
3380 TI_INTHI_TYPE,
3381 TI_INTSI_TYPE,
3382 TI_INTDI_TYPE,
3383 TI_INTTI_TYPE,
3384
3385 TI_UINTQI_TYPE,
3386 TI_UINTHI_TYPE,
3387 TI_UINTSI_TYPE,
3388 TI_UINTDI_TYPE,
3389 TI_UINTTI_TYPE,
3390
3391 TI_UINT32_TYPE,
3392 TI_UINT64_TYPE,
3393
3394 TI_INTEGER_ZERO,
3395 TI_INTEGER_ONE,
3396 TI_INTEGER_MINUS_ONE,
3397 TI_NULL_POINTER,
3398
3399 TI_SIZE_ZERO,
3400 TI_SIZE_ONE,
3401
3402 TI_BITSIZE_ZERO,
3403 TI_BITSIZE_ONE,
3404 TI_BITSIZE_UNIT,
3405
3406 TI_PUBLIC,
3407 TI_PROTECTED,
3408 TI_PRIVATE,
3409
3410 TI_BOOLEAN_FALSE,
3411 TI_BOOLEAN_TRUE,
3412
3413 TI_COMPLEX_INTEGER_TYPE,
3414 TI_COMPLEX_FLOAT_TYPE,
3415 TI_COMPLEX_DOUBLE_TYPE,
3416 TI_COMPLEX_LONG_DOUBLE_TYPE,
3417
3418 TI_FLOAT_TYPE,
3419 TI_DOUBLE_TYPE,
3420 TI_LONG_DOUBLE_TYPE,
3421
3422 TI_FLOAT_PTR_TYPE,
3423 TI_DOUBLE_PTR_TYPE,
3424 TI_LONG_DOUBLE_PTR_TYPE,
3425 TI_INTEGER_PTR_TYPE,
3426
3427 TI_VOID_TYPE,
3428 TI_PTR_TYPE,
3429 TI_CONST_PTR_TYPE,
3430 TI_SIZE_TYPE,
3431 TI_PID_TYPE,
3432 TI_PTRDIFF_TYPE,
3433 TI_VA_LIST_TYPE,
3434 TI_VA_LIST_GPR_COUNTER_FIELD,
3435 TI_VA_LIST_FPR_COUNTER_FIELD,
3436 TI_BOOLEAN_TYPE,
3437 TI_FILEPTR_TYPE,
3438
3439 TI_DFLOAT32_TYPE,
3440 TI_DFLOAT64_TYPE,
3441 TI_DFLOAT128_TYPE,
3442 TI_DFLOAT32_PTR_TYPE,
3443 TI_DFLOAT64_PTR_TYPE,
3444 TI_DFLOAT128_PTR_TYPE,
3445
3446 TI_VOID_LIST_NODE,
3447
3448 TI_MAIN_IDENTIFIER,
3449
3450 TI_MAX
3451 };
3452
3453 extern GTY(()) tree global_trees[TI_MAX];
3454
3455 #define error_mark_node global_trees[TI_ERROR_MARK]
3456
3457 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3458 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3459 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3460 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3461 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3462
3463 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3464 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3465 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3466 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3467 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3468
3469 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3470 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3471
3472 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3473 #define integer_one_node global_trees[TI_INTEGER_ONE]
3474 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3475 #define size_zero_node global_trees[TI_SIZE_ZERO]
3476 #define size_one_node global_trees[TI_SIZE_ONE]
3477 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3478 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3479 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3480
3481 /* Base access nodes. */
3482 #define access_public_node global_trees[TI_PUBLIC]
3483 #define access_protected_node global_trees[TI_PROTECTED]
3484 #define access_private_node global_trees[TI_PRIVATE]
3485
3486 #define null_pointer_node global_trees[TI_NULL_POINTER]
3487
3488 #define float_type_node global_trees[TI_FLOAT_TYPE]
3489 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3490 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3491
3492 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3493 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3494 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3495 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3496
3497 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3498 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3499 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3500 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3501
3502 #define void_type_node global_trees[TI_VOID_TYPE]
3503 /* The C type `void *'. */
3504 #define ptr_type_node global_trees[TI_PTR_TYPE]
3505 /* The C type `const void *'. */
3506 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3507 /* The C type `size_t'. */
3508 #define size_type_node global_trees[TI_SIZE_TYPE]
3509 #define pid_type_node global_trees[TI_PID_TYPE]
3510 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3511 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3512 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3513 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3514 /* The C type `FILE *'. */
3515 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3516
3517 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3518 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3519 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3520
3521 /* The decimal floating point types. */
3522 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3523 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3524 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3525 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3526 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3527 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3528
3529 /* The node that should be placed at the end of a parameter list to
3530 indicate that the function does not take a variable number of
3531 arguments. The TREE_VALUE will be void_type_node and there will be
3532 no TREE_CHAIN. Language-independent code should not assume
3533 anything else about this node. */
3534 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3535
3536 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3537 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3538
3539 /* An enumeration of the standard C integer types. These must be
3540 ordered so that shorter types appear before longer ones, and so
3541 that signed types appear before unsigned ones, for the correct
3542 functioning of interpret_integer() in c-lex.c. */
3543 enum integer_type_kind
3544 {
3545 itk_char,
3546 itk_signed_char,
3547 itk_unsigned_char,
3548 itk_short,
3549 itk_unsigned_short,
3550 itk_int,
3551 itk_unsigned_int,
3552 itk_long,
3553 itk_unsigned_long,
3554 itk_long_long,
3555 itk_unsigned_long_long,
3556 itk_none
3557 };
3558
3559 typedef enum integer_type_kind integer_type_kind;
3560
3561 /* The standard C integer types. Use integer_type_kind to index into
3562 this array. */
3563 extern GTY(()) tree integer_types[itk_none];
3564
3565 #define char_type_node integer_types[itk_char]
3566 #define signed_char_type_node integer_types[itk_signed_char]
3567 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3568 #define short_integer_type_node integer_types[itk_short]
3569 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3570 #define integer_type_node integer_types[itk_int]
3571 #define unsigned_type_node integer_types[itk_unsigned_int]
3572 #define long_integer_type_node integer_types[itk_long]
3573 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3574 #define long_long_integer_type_node integer_types[itk_long_long]
3575 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3576 \f
3577 /* Set to the default thread-local storage (tls) model to use. */
3578
3579 extern enum tls_model flag_tls_default;
3580
3581 \f
3582 /* A pointer-to-function member type looks like:
3583
3584 struct {
3585 __P __pfn;
3586 ptrdiff_t __delta;
3587 };
3588
3589 If __pfn is NULL, it is a NULL pointer-to-member-function.
3590
3591 (Because the vtable is always the first thing in the object, we
3592 don't need its offset.) If the function is virtual, then PFN is
3593 one plus twice the index into the vtable; otherwise, it is just a
3594 pointer to the function.
3595
3596 Unfortunately, using the lowest bit of PFN doesn't work in
3597 architectures that don't impose alignment requirements on function
3598 addresses, or that use the lowest bit to tell one ISA from another,
3599 for example. For such architectures, we use the lowest bit of
3600 DELTA instead of the lowest bit of the PFN, and DELTA will be
3601 multiplied by 2. */
3602
3603 enum ptrmemfunc_vbit_where_t
3604 {
3605 ptrmemfunc_vbit_in_pfn,
3606 ptrmemfunc_vbit_in_delta
3607 };
3608 \f
3609 #define NULL_TREE (tree) NULL
3610
3611 extern tree decl_assembler_name (tree);
3612 extern bool decl_assembler_name_equal (tree decl, tree asmname);
3613
3614 /* Compute the number of bytes occupied by 'node'. This routine only
3615 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3616
3617 extern size_t tree_size (tree);
3618
3619 /* Compute the number of bytes occupied by a tree with code CODE. This
3620 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3621 variable length. */
3622 extern size_t tree_code_size (enum tree_code);
3623
3624 /* Lowest level primitive for allocating a node.
3625 The TREE_CODE is the only argument. Contents are initialized
3626 to zero except for a few of the common fields. */
3627
3628 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3629 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3630
3631 /* Make a copy of a node, with all the same contents. */
3632
3633 extern tree copy_node_stat (tree MEM_STAT_DECL);
3634 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3635
3636 /* Make a copy of a chain of TREE_LIST nodes. */
3637
3638 extern tree copy_list (tree);
3639
3640 /* Make a BINFO. */
3641 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3642 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3643
3644 /* Make a TREE_VEC. */
3645
3646 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3647 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3648
3649 /* Tree nodes for SSA analysis. */
3650
3651 extern void init_phinodes (void);
3652 extern void fini_phinodes (void);
3653 extern void release_phi_node (tree);
3654 #ifdef GATHER_STATISTICS
3655 extern void phinodes_print_statistics (void);
3656 #endif
3657
3658 extern void init_ssanames (void);
3659 extern void fini_ssanames (void);
3660 extern tree make_ssa_name (tree, tree);
3661 extern tree duplicate_ssa_name (tree, tree);
3662 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
3663 extern void release_ssa_name (tree);
3664 extern void release_defs (tree);
3665 extern void replace_ssa_name_symbol (tree, tree);
3666
3667 #ifdef GATHER_STATISTICS
3668 extern void ssanames_print_statistics (void);
3669 #endif
3670
3671 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3672 The name is supplied as a char *. */
3673
3674 extern tree get_identifier (const char *);
3675
3676 #if GCC_VERSION >= 3000
3677 #define get_identifier(str) \
3678 (__builtin_constant_p (str) \
3679 ? get_identifier_with_length ((str), strlen (str)) \
3680 : get_identifier (str))
3681 #endif
3682
3683
3684 /* Identical to get_identifier, except that the length is assumed
3685 known. */
3686
3687 extern tree get_identifier_with_length (const char *, size_t);
3688
3689 /* If an identifier with the name TEXT (a null-terminated string) has
3690 previously been referred to, return that node; otherwise return
3691 NULL_TREE. */
3692
3693 extern tree maybe_get_identifier (const char *);
3694
3695 /* Construct various types of nodes. */
3696
3697 extern tree build_nt (enum tree_code, ...);
3698 extern tree build_nt_call_list (tree, tree);
3699
3700 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3701 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3702 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3703 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3704 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3705 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3706 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3707 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3708 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3709 tree MEM_STAT_DECL);
3710 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3711 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3712 tree MEM_STAT_DECL);
3713 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3714 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
3715 tree, tree, tree MEM_STAT_DECL);
3716 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3717 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3718
3719 extern tree build_gimple_modify_stmt_stat (tree, tree MEM_STAT_DECL);
3720 #define build_gimple_modify_stmt(t1,t2) \
3721 build_gimple_modify_stmt_stat (t1,t2 MEM_STAT_INFO)
3722
3723 extern tree build_int_cst (tree, HOST_WIDE_INT);
3724 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3725 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3726 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3727 extern tree build_int_cst_wide_type (tree,
3728 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3729 extern tree build_vector (tree, tree);
3730 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3731 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3732 extern tree build_constructor_single (tree, tree, tree);
3733 extern tree build_constructor_from_list (tree, tree);
3734 extern tree build_real_from_int_cst (tree, tree);
3735 extern tree build_complex (tree, tree, tree);
3736 extern tree build_one_cst (tree);
3737 extern tree build_string (int, const char *);
3738 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3739 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3740 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3741 extern tree build_fn_decl (const char *, tree);
3742 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3743 extern tree build_block (tree, tree, tree, tree);
3744 #ifndef USE_MAPPED_LOCATION
3745 extern void annotate_with_file_line (tree, const char *, int);
3746 extern void annotate_with_locus (tree, location_t);
3747 #endif
3748 extern tree build_empty_stmt (void);
3749 extern tree build_omp_clause (enum omp_clause_code);
3750
3751 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3752 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3753
3754 extern tree build_call_list (tree, tree, tree);
3755 extern tree build_call_nary (tree, tree, int, ...);
3756 extern tree build_call_valist (tree, tree, int, va_list);
3757 extern tree build_call_array (tree, tree, int, tree*);
3758
3759 /* Construct various nodes representing data types. */
3760
3761 extern tree make_signed_type (int);
3762 extern tree make_unsigned_type (int);
3763 extern tree signed_type_for (tree);
3764 extern tree unsigned_type_for (tree);
3765 extern void initialize_sizetypes (bool);
3766 extern void set_sizetype (tree);
3767 extern void fixup_unsigned_type (tree);
3768 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3769 extern tree build_pointer_type (tree);
3770 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3771 extern tree build_reference_type (tree);
3772 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3773 extern tree build_vector_type (tree innertype, int nunits);
3774 extern tree build_type_no_quals (tree);
3775 extern tree build_index_type (tree);
3776 extern tree build_index_2_type (tree, tree);
3777 extern tree build_array_type (tree, tree);
3778 extern tree build_function_type (tree, tree);
3779 extern tree build_function_type_list (tree, ...);
3780 extern tree build_method_type_directly (tree, tree, tree);
3781 extern tree build_method_type (tree, tree);
3782 extern tree build_offset_type (tree, tree);
3783 extern tree build_complex_type (tree);
3784 extern tree build_resx (int);
3785 extern tree array_type_nelts (tree);
3786 extern bool in_array_bounds_p (tree);
3787 extern bool range_in_array_bounds_p (tree);
3788
3789 extern tree value_member (tree, tree);
3790 extern tree purpose_member (tree, tree);
3791
3792 extern int attribute_list_equal (tree, tree);
3793 extern int attribute_list_contained (tree, tree);
3794 extern int tree_int_cst_equal (tree, tree);
3795 extern int tree_int_cst_lt (tree, tree);
3796 extern int tree_int_cst_compare (tree, tree);
3797 extern int host_integerp (tree, int);
3798 extern HOST_WIDE_INT tree_low_cst (tree, int);
3799 extern int tree_int_cst_msb (tree);
3800 extern int tree_int_cst_sgn (tree);
3801 extern int tree_int_cst_sign_bit (tree);
3802 extern bool tree_expr_nonnegative_p (tree);
3803 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
3804 extern bool may_negate_without_overflow_p (tree);
3805 extern tree get_inner_array_type (tree);
3806
3807 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3808 put the prototype here. Rtl.h does declare the prototype if
3809 tree.h had been included. */
3810
3811 extern tree make_tree (tree, rtx);
3812 \f
3813 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3814 is ATTRIBUTE.
3815
3816 Such modified types already made are recorded so that duplicates
3817 are not made. */
3818
3819 extern tree build_type_attribute_variant (tree, tree);
3820 extern tree build_decl_attribute_variant (tree, tree);
3821
3822 /* Structure describing an attribute and a function to handle it. */
3823 struct attribute_spec
3824 {
3825 /* The name of the attribute (without any leading or trailing __),
3826 or NULL to mark the end of a table of attributes. */
3827 const char *const name;
3828 /* The minimum length of the list of arguments of the attribute. */
3829 const int min_length;
3830 /* The maximum length of the list of arguments of the attribute
3831 (-1 for no maximum). */
3832 const int max_length;
3833 /* Whether this attribute requires a DECL. If it does, it will be passed
3834 from types of DECLs, function return types and array element types to
3835 the DECLs, function types and array types respectively; but when
3836 applied to a type in any other circumstances, it will be ignored with
3837 a warning. (If greater control is desired for a given attribute,
3838 this should be false, and the flags argument to the handler may be
3839 used to gain greater control in that case.) */
3840 const bool decl_required;
3841 /* Whether this attribute requires a type. If it does, it will be passed
3842 from a DECL to the type of that DECL. */
3843 const bool type_required;
3844 /* Whether this attribute requires a function (or method) type. If it does,
3845 it will be passed from a function pointer type to the target type,
3846 and from a function return type (which is not itself a function
3847 pointer type) to the function type. */
3848 const bool function_type_required;
3849 /* Function to handle this attribute. NODE points to the node to which
3850 the attribute is to be applied. If a DECL, it should be modified in
3851 place; if a TYPE, a copy should be created. NAME is the name of the
3852 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
3853 of the arguments (which may be NULL). FLAGS gives further information
3854 about the context of the attribute. Afterwards, the attributes will
3855 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
3856 unless *NO_ADD_ATTRS is set to true (which should be done on error,
3857 as well as in any other cases when the attributes should not be added
3858 to the DECL or TYPE). Depending on FLAGS, any attributes to be
3859 applied to another type or DECL later may be returned;
3860 otherwise the return value should be NULL_TREE. This pointer may be
3861 NULL if no special handling is required beyond the checks implied
3862 by the rest of this structure. */
3863 tree (*const handler) (tree *node, tree name, tree args,
3864 int flags, bool *no_add_attrs);
3865 };
3866
3867 /* Flags that may be passed in the third argument of decl_attributes, and
3868 to handler functions for attributes. */
3869 enum attribute_flags
3870 {
3871 /* The type passed in is the type of a DECL, and any attributes that
3872 should be passed in again to be applied to the DECL rather than the
3873 type should be returned. */
3874 ATTR_FLAG_DECL_NEXT = 1,
3875 /* The type passed in is a function return type, and any attributes that
3876 should be passed in again to be applied to the function type rather
3877 than the return type should be returned. */
3878 ATTR_FLAG_FUNCTION_NEXT = 2,
3879 /* The type passed in is an array element type, and any attributes that
3880 should be passed in again to be applied to the array type rather
3881 than the element type should be returned. */
3882 ATTR_FLAG_ARRAY_NEXT = 4,
3883 /* The type passed in is a structure, union or enumeration type being
3884 created, and should be modified in place. */
3885 ATTR_FLAG_TYPE_IN_PLACE = 8,
3886 /* The attributes are being applied by default to a library function whose
3887 name indicates known behavior, and should be silently ignored if they
3888 are not in fact compatible with the function type. */
3889 ATTR_FLAG_BUILT_IN = 16
3890 };
3891
3892 /* Default versions of target-overridable functions. */
3893
3894 extern tree merge_decl_attributes (tree, tree);
3895 extern tree merge_type_attributes (tree, tree);
3896
3897 /* Given a tree node and a string, return nonzero if the tree node is
3898 a valid attribute name for the string. */
3899
3900 extern int is_attribute_p (const char *, tree);
3901
3902 /* Given an attribute name and a list of attributes, return the list element
3903 of the attribute or NULL_TREE if not found. */
3904
3905 extern tree lookup_attribute (const char *, tree);
3906
3907 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3908 modified list. */
3909
3910 extern tree remove_attribute (const char *, tree);
3911
3912 /* Given two attributes lists, return a list of their union. */
3913
3914 extern tree merge_attributes (tree, tree);
3915
3916 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3917 /* Given two Windows decl attributes lists, possibly including
3918 dllimport, return a list of their union . */
3919 extern tree merge_dllimport_decl_attributes (tree, tree);
3920
3921 /* Handle a "dllimport" or "dllexport" attribute. */
3922 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3923 #endif
3924
3925 /* Check whether CAND is suitable to be returned from get_qualified_type
3926 (BASE, TYPE_QUALS). */
3927
3928 extern bool check_qualified_type (tree, tree, int);
3929
3930 /* Return a version of the TYPE, qualified as indicated by the
3931 TYPE_QUALS, if one exists. If no qualified version exists yet,
3932 return NULL_TREE. */
3933
3934 extern tree get_qualified_type (tree, int);
3935
3936 /* Like get_qualified_type, but creates the type if it does not
3937 exist. This function never returns NULL_TREE. */
3938
3939 extern tree build_qualified_type (tree, int);
3940
3941 /* Like build_qualified_type, but only deals with the `const' and
3942 `volatile' qualifiers. This interface is retained for backwards
3943 compatibility with the various front-ends; new code should use
3944 build_qualified_type instead. */
3945
3946 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3947 build_qualified_type ((TYPE), \
3948 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3949 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3950
3951 /* Make a copy of a type node. */
3952
3953 extern tree build_distinct_type_copy (tree);
3954 extern tree build_variant_type_copy (tree);
3955
3956 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3957 fields. Optionally specify an alignment, and then lay it out. */
3958
3959 extern void finish_builtin_struct (tree, const char *,
3960 tree, tree);
3961
3962 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3963 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3964 node, does nothing except for the first time. */
3965
3966 extern void layout_type (tree);
3967
3968 /* These functions allow a front-end to perform a manual layout of a
3969 RECORD_TYPE. (For instance, if the placement of subsequent fields
3970 depends on the placement of fields so far.) Begin by calling
3971 start_record_layout. Then, call place_field for each of the
3972 fields. Then, call finish_record_layout. See layout_type for the
3973 default way in which these functions are used. */
3974
3975 typedef struct record_layout_info_s
3976 {
3977 /* The RECORD_TYPE that we are laying out. */
3978 tree t;
3979 /* The offset into the record so far, in bytes, not including bits in
3980 BITPOS. */
3981 tree offset;
3982 /* The last known alignment of SIZE. */
3983 unsigned int offset_align;
3984 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
3985 tree bitpos;
3986 /* The alignment of the record so far, in bits. */
3987 unsigned int record_align;
3988 /* The alignment of the record so far, ignoring #pragma pack and
3989 __attribute__ ((packed)), in bits. */
3990 unsigned int unpacked_align;
3991 /* The previous field layed out. */
3992 tree prev_field;
3993 /* The static variables (i.e., class variables, as opposed to
3994 instance variables) encountered in T. */
3995 tree pending_statics;
3996 /* Bits remaining in the current alignment group */
3997 int remaining_in_alignment;
3998 /* True if we've seen a packed field that didn't have normal
3999 alignment anyway. */
4000 int packed_maybe_necessary;
4001 } *record_layout_info;
4002
4003 extern void set_lang_adjust_rli (void (*) (record_layout_info));
4004 extern record_layout_info start_record_layout (tree);
4005 extern tree bit_from_pos (tree, tree);
4006 extern tree byte_from_pos (tree, tree);
4007 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4008 extern void normalize_offset (tree *, tree *, unsigned int);
4009 extern tree rli_size_unit_so_far (record_layout_info);
4010 extern tree rli_size_so_far (record_layout_info);
4011 extern void normalize_rli (record_layout_info);
4012 extern void place_field (record_layout_info, tree);
4013 extern void compute_record_mode (tree);
4014 extern void finish_record_layout (record_layout_info, int);
4015
4016 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4017 return a canonicalized ..._TYPE node, so that duplicates are not made.
4018 How the hash code is computed is up to the caller, as long as any two
4019 callers that could hash identical-looking type nodes agree. */
4020
4021 extern tree type_hash_canon (unsigned int, tree);
4022
4023 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4024 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4025 fields. Call this only once for any given decl node.
4026
4027 Second argument is the boundary that this field can be assumed to
4028 be starting at (in bits). Zero means it can be assumed aligned
4029 on any boundary that may be needed. */
4030
4031 extern void layout_decl (tree, unsigned);
4032
4033 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4034 a previous call to layout_decl and calls it again. */
4035
4036 extern void relayout_decl (tree);
4037
4038 /* Return the mode for data of a given size SIZE and mode class CLASS.
4039 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4040 The value is BLKmode if no other mode is found. This is like
4041 mode_for_size, but is passed a tree. */
4042
4043 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int);
4044
4045 /* Return an expr equal to X but certainly not valid as an lvalue. */
4046
4047 extern tree non_lvalue (tree);
4048
4049 extern tree convert (tree, tree);
4050 extern unsigned int expr_align (tree);
4051 extern tree expr_first (tree);
4052 extern tree expr_last (tree);
4053 extern tree expr_only (tree);
4054 extern tree size_in_bytes (tree);
4055 extern HOST_WIDE_INT int_size_in_bytes (tree);
4056 extern HOST_WIDE_INT max_int_size_in_bytes (tree);
4057 extern tree bit_position (tree);
4058 extern HOST_WIDE_INT int_bit_position (tree);
4059 extern tree byte_position (tree);
4060 extern HOST_WIDE_INT int_byte_position (tree);
4061
4062 /* Define data structures, macros, and functions for handling sizes
4063 and the various types used to represent sizes. */
4064
4065 enum size_type_kind
4066 {
4067 SIZETYPE, /* Normal representation of sizes in bytes. */
4068 SSIZETYPE, /* Signed representation of sizes in bytes. */
4069 BITSIZETYPE, /* Normal representation of sizes in bits. */
4070 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4071 TYPE_KIND_LAST};
4072
4073 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4074
4075 #define sizetype sizetype_tab[(int) SIZETYPE]
4076 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4077 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4078 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4079
4080 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4081 extern tree size_binop (enum tree_code, tree, tree);
4082 extern tree size_diffop (tree, tree);
4083
4084 #define size_int(L) size_int_kind (L, SIZETYPE)
4085 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4086 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4087 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4088
4089 extern tree round_up (tree, int);
4090 extern tree round_down (tree, int);
4091 extern tree get_pending_sizes (void);
4092 extern void put_pending_size (tree);
4093 extern void put_pending_sizes (tree);
4094
4095 /* Type for sizes of data-type. */
4096
4097 #define BITS_PER_UNIT_LOG \
4098 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4099 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4100 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4101
4102 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4103 extern unsigned int maximum_field_alignment;
4104 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4105 extern unsigned int initial_max_fld_align;
4106
4107 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4108 by making the last node in X point to Y.
4109 Returns X, except if X is 0 returns Y. */
4110
4111 extern tree chainon (tree, tree);
4112
4113 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4114
4115 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4116 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4117
4118 /* Return the last tree node in a chain. */
4119
4120 extern tree tree_last (tree);
4121
4122 /* Reverse the order of elements in a chain, and return the new head. */
4123
4124 extern tree nreverse (tree);
4125
4126 /* Returns the length of a chain of nodes
4127 (number of chain pointers to follow before reaching a null pointer). */
4128
4129 extern int list_length (tree);
4130
4131 /* Returns the number of FIELD_DECLs in a type. */
4132
4133 extern int fields_length (tree);
4134
4135 /* Given an initializer INIT, return TRUE if INIT is zero or some
4136 aggregate of zeros. Otherwise return FALSE. */
4137
4138 extern bool initializer_zerop (tree);
4139
4140 /* Examine CTOR to discover:
4141 * how many scalar fields are set to nonzero values,
4142 and place it in *P_NZ_ELTS;
4143 * how many scalar fields in total are in CTOR,
4144 and place it in *P_ELT_COUNT.
4145 * if a type is a union, and the initializer from the constructor
4146 is not the largest element in the union, then set *p_must_clear.
4147
4148 Return whether or not CTOR is a valid static constant initializer, the same
4149 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4150
4151 extern bool categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4152 bool *);
4153
4154 extern HOST_WIDE_INT count_type_elements (tree, bool);
4155
4156 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4157
4158 extern int integer_zerop (tree);
4159
4160 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4161
4162 extern int integer_onep (tree);
4163
4164 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4165 all of whose significant bits are 1. */
4166
4167 extern int integer_all_onesp (tree);
4168
4169 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4170 exactly one bit 1. */
4171
4172 extern int integer_pow2p (tree);
4173
4174 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4175 with a nonzero value. */
4176
4177 extern int integer_nonzerop (tree);
4178
4179 extern bool cst_and_fits_in_hwi (tree);
4180 extern tree num_ending_zeros (tree);
4181
4182 /* staticp (tree x) is nonzero if X is a reference to data allocated
4183 at a fixed address in memory. Returns the outermost data. */
4184
4185 extern tree staticp (tree);
4186
4187 /* save_expr (EXP) returns an expression equivalent to EXP
4188 but it can be used multiple times within context CTX
4189 and only evaluate EXP once. */
4190
4191 extern tree save_expr (tree);
4192
4193 /* Look inside EXPR and into any simple arithmetic operations. Return
4194 the innermost non-arithmetic node. */
4195
4196 extern tree skip_simple_arithmetic (tree);
4197
4198 /* Return which tree structure is used by T. */
4199
4200 enum tree_node_structure_enum tree_node_structure (tree);
4201
4202 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4203 or offset that depends on a field within a record.
4204
4205 Note that we only allow such expressions within simple arithmetic
4206 or a COND_EXPR. */
4207
4208 extern bool contains_placeholder_p (tree);
4209
4210 /* This macro calls the above function but short-circuits the common
4211 case of a constant to save time. Also check for null. */
4212
4213 #define CONTAINS_PLACEHOLDER_P(EXP) \
4214 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4215
4216 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4217 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4218 positions. */
4219
4220 extern bool type_contains_placeholder_p (tree);
4221
4222 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4223 return a tree with all occurrences of references to F in a
4224 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4225 contains only arithmetic expressions. */
4226
4227 extern tree substitute_in_expr (tree, tree, tree);
4228
4229 /* This macro calls the above function but short-circuits the common
4230 case of a constant to save time and also checks for NULL. */
4231
4232 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4233 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4234
4235 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4236 for it within OBJ, a tree that is an object or a chain of references. */
4237
4238 extern tree substitute_placeholder_in_expr (tree, tree);
4239
4240 /* This macro calls the above function but short-circuits the common
4241 case of a constant to save time and also checks for NULL. */
4242
4243 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4244 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4245 : substitute_placeholder_in_expr (EXP, OBJ))
4246
4247 /* variable_size (EXP) is like save_expr (EXP) except that it
4248 is for the special case of something that is part of a
4249 variable size for a data type. It makes special arrangements
4250 to compute the value at the right time when the data type
4251 belongs to a function parameter. */
4252
4253 extern tree variable_size (tree);
4254
4255 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4256 but it can be used multiple times
4257 and only evaluate the subexpressions once. */
4258
4259 extern tree stabilize_reference (tree);
4260
4261 /* Subroutine of stabilize_reference; this is called for subtrees of
4262 references. Any expression with side-effects must be put in a SAVE_EXPR
4263 to ensure that it is only evaluated once. */
4264
4265 extern tree stabilize_reference_1 (tree);
4266
4267 /* Return EXP, stripped of any conversions to wider types
4268 in such a way that the result of converting to type FOR_TYPE
4269 is the same as if EXP were converted to FOR_TYPE.
4270 If FOR_TYPE is 0, it signifies EXP's type. */
4271
4272 extern tree get_unwidened (tree, tree);
4273
4274 /* Return OP or a simpler expression for a narrower value
4275 which can be sign-extended or zero-extended to give back OP.
4276 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4277 or 0 if the value should be sign-extended. */
4278
4279 extern tree get_narrower (tree, int *);
4280
4281 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4282 look for nested component-refs or array-refs at constant positions
4283 and find the ultimate containing object, which is returned. */
4284
4285 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4286 tree *, enum machine_mode *, int *, int *,
4287 bool);
4288
4289 /* Return 1 if T is an expression that get_inner_reference handles. */
4290
4291 extern int handled_component_p (tree);
4292
4293 /* Return a tree of sizetype representing the size, in bytes, of the element
4294 of EXP, an ARRAY_REF. */
4295
4296 extern tree array_ref_element_size (tree);
4297
4298 /* Return a tree representing the lower bound of the array mentioned in
4299 EXP, an ARRAY_REF. */
4300
4301 extern tree array_ref_low_bound (tree);
4302
4303 /* Return a tree representing the upper bound of the array mentioned in
4304 EXP, an ARRAY_REF. */
4305
4306 extern tree array_ref_up_bound (tree);
4307
4308 /* Return a tree representing the offset, in bytes, of the field referenced
4309 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4310
4311 extern tree component_ref_field_offset (tree);
4312
4313 /* Given a DECL or TYPE, return the scope in which it was declared, or
4314 NUL_TREE if there is no containing scope. */
4315
4316 extern tree get_containing_scope (tree);
4317
4318 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4319 or zero if none. */
4320 extern tree decl_function_context (tree);
4321
4322 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4323 this _DECL with its context, or zero if none. */
4324 extern tree decl_type_context (tree);
4325
4326 /* Return 1 if EXPR is the real constant zero. */
4327 extern int real_zerop (tree);
4328 \f
4329 /* Declare commonly used variables for tree structure. */
4330
4331 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4332 Zero means allow extended lvalues. */
4333
4334 extern int pedantic_lvalues;
4335
4336 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4337
4338 extern GTY(()) tree current_function_decl;
4339
4340 /* Nonzero means a FUNC_BEGIN label was emitted. */
4341 extern GTY(()) const char * current_function_func_begin_label;
4342 \f
4343 /* In tree.c */
4344 extern unsigned crc32_string (unsigned, const char *);
4345 extern void clean_symbol_name (char *);
4346 extern tree get_file_function_name (const char *);
4347 extern tree get_callee_fndecl (tree);
4348 extern void change_decl_assembler_name (tree, tree);
4349 extern int type_num_arguments (tree);
4350 extern bool associative_tree_code (enum tree_code);
4351 extern bool commutative_tree_code (enum tree_code);
4352 extern tree upper_bound_in_type (tree, tree);
4353 extern tree lower_bound_in_type (tree, tree);
4354 extern int operand_equal_for_phi_arg_p (tree, tree);
4355 extern bool empty_body_p (tree);
4356 extern tree call_expr_arg (tree, int);
4357 extern tree *call_expr_argp (tree, int);
4358 extern tree call_expr_arglist (tree);
4359 \f
4360 /* In stmt.c */
4361
4362 extern void expand_expr_stmt (tree);
4363 extern int warn_if_unused_value (tree, location_t);
4364 extern void expand_label (tree);
4365 extern void expand_goto (tree);
4366
4367 extern rtx expand_stack_save (void);
4368 extern void expand_stack_restore (tree);
4369 extern void expand_return (tree);
4370 extern int is_body_block (tree);
4371
4372 /* In tree-eh.c */
4373 extern void using_eh_for_cleanups (void);
4374
4375 /* In fold-const.c */
4376
4377 /* Non-zero if we are folding constants inside an initializer; zero
4378 otherwise. */
4379 extern int folding_initializer;
4380
4381 /* Fold constants as much as possible in an expression.
4382 Returns the simplified expression.
4383 Acts only on the top level of the expression;
4384 if the argument itself cannot be simplified, its
4385 subexpressions are not changed. */
4386
4387 extern tree fold (tree);
4388 extern tree fold_unary (enum tree_code, tree, tree);
4389 extern tree fold_binary (enum tree_code, tree, tree, tree);
4390 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4391 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4392 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4393 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4394 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4395 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4396 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4397 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4398 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4399 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4400 extern tree fold_build_call_list (tree, tree, tree);
4401 extern tree fold_build_call_list_initializer (tree, tree, tree);
4402 extern tree fold_convert (tree, tree);
4403 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4404 extern tree fold_ignored_result (tree);
4405 extern tree fold_abs_const (tree, tree);
4406 extern tree fold_indirect_ref_1 (tree, tree);
4407 extern void fold_defer_overflow_warnings (void);
4408 extern void fold_undefer_overflow_warnings (bool, tree, int);
4409 extern void fold_undefer_and_ignore_overflow_warnings (void);
4410 extern bool fold_deferring_overflow_warnings_p (void);
4411
4412 extern tree force_fit_type_double (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4413 int, bool);
4414
4415 extern int fit_double_type (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4416 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, tree);
4417 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4418 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4419 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4420 bool);
4421 #define add_double(l1,h1,l2,h2,lv,hv) \
4422 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4423 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4424 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4425 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4426 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4427 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4428 bool);
4429 #define mul_double(l1,h1,l2,h2,lv,hv) \
4430 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4431 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4432 HOST_WIDE_INT, unsigned int,
4433 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4434 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4435 HOST_WIDE_INT, unsigned int,
4436 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4437 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4438 HOST_WIDE_INT, unsigned int,
4439 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4440 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4441 HOST_WIDE_INT, unsigned int,
4442 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4443
4444 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4445 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4446 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4447 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4448 HOST_WIDE_INT *);
4449
4450 enum operand_equal_flag
4451 {
4452 OEP_ONLY_CONST = 1,
4453 OEP_PURE_SAME = 2
4454 };
4455
4456 extern int operand_equal_p (tree, tree, unsigned int);
4457
4458 extern tree omit_one_operand (tree, tree, tree);
4459 extern tree omit_two_operands (tree, tree, tree, tree);
4460 extern tree invert_truthvalue (tree);
4461 extern tree fold_truth_not_expr (tree);
4462 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4463 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4464 extern tree fold_read_from_constant_string (tree);
4465 extern tree int_const_binop (enum tree_code, tree, tree, int);
4466 extern tree build_fold_addr_expr (tree);
4467 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4468 extern tree fold_strip_sign_ops (tree);
4469 extern tree build_fold_addr_expr_with_type (tree, tree);
4470 extern tree build_fold_indirect_ref (tree);
4471 extern tree fold_indirect_ref (tree);
4472 extern tree constant_boolean_node (int, tree);
4473 extern tree build_low_bits_mask (tree, unsigned);
4474
4475 extern bool tree_swap_operands_p (tree, tree, bool);
4476 extern void swap_tree_operands (tree, tree *, tree *);
4477 extern enum tree_code swap_tree_comparison (enum tree_code);
4478
4479 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4480 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4481
4482 extern bool tree_expr_nonzero_p (tree);
4483 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4484
4485 /* In builtins.c */
4486 extern tree fold_call_expr (tree, bool);
4487 extern tree fold_builtin_fputs (tree, tree, bool, bool, tree);
4488 extern tree fold_builtin_strcpy (tree, tree, tree, tree);
4489 extern tree fold_builtin_strncpy (tree, tree, tree, tree, tree);
4490 extern tree fold_builtin_memory_chk (tree, tree, tree, tree, tree, tree, bool,
4491 enum built_in_function);
4492 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, tree, tree, bool,
4493 enum built_in_function);
4494 extern tree fold_builtin_strncpy_chk (tree, tree, tree, tree, tree);
4495 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4496 extern bool fold_builtin_next_arg (tree, bool);
4497 extern enum built_in_function builtin_mathfn_code (tree);
4498 extern tree build_function_call_expr (tree, tree);
4499 extern tree fold_build_call_expr (tree, tree, tree, tree);
4500 extern tree fold_builtin_call_list (tree, tree, tree);
4501 extern tree fold_builtin_call_valist (tree, tree, int, va_list);
4502 extern tree build_call_expr (tree, int, ...);
4503 extern tree mathfn_built_in (tree, enum built_in_function fn);
4504 extern tree strip_float_extensions (tree);
4505 extern tree c_strlen (tree, int);
4506 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4507 extern tree build_va_arg_indirect_ref (tree);
4508 extern tree build_string_literal (int, const char *);
4509 extern bool validate_arglist (tree, ...);
4510 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4511 extern int get_pointer_alignment (tree, unsigned int);
4512
4513 /* In convert.c */
4514 extern tree strip_float_extensions (tree);
4515
4516 /* In alias.c */
4517 extern void record_component_aliases (tree);
4518 extern HOST_WIDE_INT get_alias_set (tree);
4519 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4520 extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT);
4521 extern int objects_must_conflict_p (tree, tree);
4522
4523 /* In tree.c */
4524 extern int really_constant_p (tree);
4525 extern int int_fits_type_p (tree, tree);
4526 extern bool variably_modified_type_p (tree, tree);
4527 extern int tree_log2 (tree);
4528 extern int tree_floor_log2 (tree);
4529 extern int simple_cst_equal (tree, tree);
4530 extern hashval_t iterative_hash_expr (tree, hashval_t);
4531 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT);
4532 extern int type_list_equal (tree, tree);
4533 extern int chain_member (tree, tree);
4534 extern tree type_hash_lookup (unsigned int, tree);
4535 extern void type_hash_add (unsigned int, tree);
4536 extern int simple_cst_list_equal (tree, tree);
4537 extern void dump_tree_statistics (void);
4538 extern void expand_function_end (void);
4539 extern void expand_function_start (tree);
4540 extern void stack_protect_prologue (void);
4541 extern void stack_protect_epilogue (void);
4542 extern void recompute_tree_invariant_for_addr_expr (tree);
4543 extern bool is_global_var (tree t);
4544 extern bool needs_to_live_in_memory (tree);
4545 extern tree reconstruct_complex_type (tree, tree);
4546
4547 extern int real_onep (tree);
4548 extern int real_twop (tree);
4549 extern int real_minus_onep (tree);
4550 extern void init_ttree (void);
4551 extern void build_common_tree_nodes (bool, bool);
4552 extern void build_common_tree_nodes_2 (int);
4553 extern void build_common_builtin_nodes (void);
4554 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4555 extern tree build_range_type (tree, tree, tree);
4556 extern HOST_WIDE_INT int_cst_value (tree);
4557 extern tree build_addr (tree, tree);
4558
4559 extern bool fields_compatible_p (tree, tree);
4560 extern tree find_compatible_field (tree, tree);
4561
4562 extern location_t expr_location (tree);
4563 extern void set_expr_location (tree, location_t);
4564 extern bool expr_has_location (tree);
4565 extern
4566 #ifdef USE_MAPPED_LOCATION
4567 source_location *
4568 #else
4569 source_locus
4570 #endif
4571 expr_locus (tree);
4572 extern void set_expr_locus (tree,
4573 #ifdef USE_MAPPED_LOCATION
4574 source_location *loc
4575 #else
4576 source_locus loc
4577 #endif
4578 );
4579 extern const char **expr_filename (tree);
4580 extern int *expr_lineno (tree);
4581 extern tree *tree_block (tree);
4582 extern tree *generic_tree_operand (tree, int);
4583 extern tree *generic_tree_type (tree);
4584
4585 /* In function.c */
4586 extern void expand_main_function (void);
4587 extern void init_dummy_function_start (void);
4588 extern void expand_dummy_function_end (void);
4589 extern unsigned int init_function_for_compilation (void);
4590 extern void allocate_struct_function (tree);
4591 extern void init_function_start (tree);
4592 extern bool use_register_for_decl (tree);
4593 extern void setjmp_vars_warning (tree);
4594 extern void setjmp_args_warning (void);
4595 extern void init_temp_slots (void);
4596 extern void free_temp_slots (void);
4597 extern void pop_temp_slots (void);
4598 extern void push_temp_slots (void);
4599 extern void preserve_temp_slots (rtx);
4600 extern int aggregate_value_p (tree, tree);
4601 extern void push_function_context (void);
4602 extern void pop_function_context (void);
4603 extern void push_function_context_to (tree);
4604 extern void pop_function_context_from (tree);
4605 extern tree gimplify_parameters (void);
4606
4607 /* In print-rtl.c */
4608 #ifdef BUFSIZ
4609 extern void print_rtl (FILE *, rtx);
4610 #endif
4611
4612 /* In print-tree.c */
4613 extern void debug_tree (tree);
4614 #ifdef BUFSIZ
4615 extern void dump_addr (FILE*, const char *, void *);
4616 extern void print_node (FILE *, const char *, tree, int);
4617 extern void print_node_brief (FILE *, const char *, tree, int);
4618 extern void indent_to (FILE *, int);
4619 #endif
4620
4621 /* In tree-inline.c: */
4622 extern bool debug_find_tree (tree, tree);
4623 /* This is in tree-inline.c since the routine uses
4624 data structures from the inliner. */
4625 extern tree unsave_expr_now (tree);
4626 extern tree build_duplicate_type (tree);
4627
4628 /* In emit-rtl.c */
4629 extern rtx emit_line_note (location_t);
4630
4631 /* In calls.c */
4632
4633 /* Nonzero if this is a call to a function whose return value depends
4634 solely on its arguments, has no side effects, and does not read
4635 global memory. */
4636 #define ECF_CONST 1
4637 /* Nonzero if this call will never return. */
4638 #define ECF_NORETURN 2
4639 /* Nonzero if this is a call to malloc or a related function. */
4640 #define ECF_MALLOC 4
4641 /* Nonzero if it is plausible that this is a call to alloca. */
4642 #define ECF_MAY_BE_ALLOCA 8
4643 /* Nonzero if this is a call to a function that won't throw an exception. */
4644 #define ECF_NOTHROW 16
4645 /* Nonzero if this is a call to setjmp or a related function. */
4646 #define ECF_RETURNS_TWICE 32
4647 /* Nonzero if this call replaces the current stack frame. */
4648 #define ECF_SIBCALL 64
4649 /* Nonzero if this is a call to "pure" function (like const function,
4650 but may read memory. */
4651 #define ECF_PURE 128
4652 /* Nonzero if this is a call to a function that returns with the stack
4653 pointer depressed. */
4654 #define ECF_SP_DEPRESSED 256
4655 /* Create libcall block around the call. */
4656 #define ECF_LIBCALL_BLOCK 512
4657 /* Function does not read or write memory (but may have side effects, so
4658 it does not necessarily fit ECF_CONST). */
4659 #define ECF_NOVOPS 1024
4660
4661 extern int flags_from_decl_or_type (tree);
4662 extern int call_expr_flags (tree);
4663
4664 extern int setjmp_call_p (tree);
4665 extern bool alloca_call_p (tree);
4666 extern bool must_pass_in_stack_var_size (enum machine_mode, tree);
4667 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree);
4668
4669 /* In attribs.c. */
4670
4671 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4672 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4673 it should be modified in place; if a TYPE, a copy should be created
4674 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4675 information, in the form of a bitwise OR of flags in enum attribute_flags
4676 from tree.h. Depending on these flags, some attributes may be
4677 returned to be applied at a later stage (for example, to apply
4678 a decl attribute to the declaration rather than to its type). */
4679 extern tree decl_attributes (tree *, tree, int);
4680
4681 /* In integrate.c */
4682 extern void set_decl_abstract_flags (tree, int);
4683 extern void set_decl_origin_self (tree);
4684
4685 /* In stor-layout.c */
4686 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
4687 extern void fixup_signed_type (tree);
4688 extern void internal_reference_types (void);
4689 extern unsigned int update_alignment_for_field (record_layout_info, tree,
4690 unsigned int);
4691 /* varasm.c */
4692 extern void make_decl_rtl (tree);
4693 extern void make_decl_one_only (tree);
4694 extern int supports_one_only (void);
4695 extern void resolve_unique_section (tree, int, int);
4696 extern void mark_referenced (tree);
4697 extern void mark_decl_referenced (tree);
4698 extern void notice_global_symbol (tree);
4699 extern void set_user_assembler_name (tree, const char *);
4700 extern void process_pending_assemble_externals (void);
4701 extern void finish_aliases_1 (void);
4702 extern void finish_aliases_2 (void);
4703 extern tree emutls_decl (tree);
4704
4705 /* In stmt.c */
4706 extern void expand_computed_goto (tree);
4707 extern bool parse_output_constraint (const char **, int, int, int,
4708 bool *, bool *, bool *);
4709 extern bool parse_input_constraint (const char **, int, int, int, int,
4710 const char * const *, bool *, bool *);
4711 extern void expand_asm_expr (tree);
4712 extern tree resolve_asm_operand_names (tree, tree, tree);
4713 extern void expand_case (tree);
4714 extern void expand_decl (tree);
4715 extern void expand_anon_union_decl (tree, tree, tree);
4716 #ifdef HARD_CONST
4717 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4718 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
4719 #endif
4720
4721 /* In gimplify.c. */
4722 extern tree create_artificial_label (void);
4723 extern void gimplify_function_tree (tree);
4724 extern const char *get_name (tree);
4725 extern tree unshare_expr (tree);
4726 extern void sort_case_labels (tree);
4727 \f
4728 /* Interface of the DWARF2 unwind info support. */
4729
4730 /* Generate a new label for the CFI info to refer to. */
4731
4732 extern char *dwarf2out_cfi_label (void);
4733
4734 /* Entry point to update the canonical frame address (CFA). */
4735
4736 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
4737
4738 /* Add the CFI for saving a register window. */
4739
4740 extern void dwarf2out_window_save (const char *);
4741
4742 /* Add a CFI to update the running total of the size of arguments pushed
4743 onto the stack. */
4744
4745 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
4746
4747 /* Entry point for saving a register to the stack. */
4748
4749 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
4750
4751 /* Entry point for saving the return address in the stack. */
4752
4753 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
4754
4755 /* Entry point for saving the return address in a register. */
4756
4757 extern void dwarf2out_return_reg (const char *, unsigned);
4758
4759 /* Entry point for saving the first register into the second. */
4760
4761 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
4762
4763 /* In tree-inline.c */
4764
4765 /* The type of a set of already-visited pointers. Functions for creating
4766 and manipulating it are declared in pointer-set.h */
4767 struct pointer_set_t;
4768
4769 /* The type of a callback function for walking over tree structure. */
4770
4771 typedef tree (*walk_tree_fn) (tree *, int *, void *);
4772 extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*);
4773 extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*);
4774
4775 /* Assign the RTX to declaration. */
4776
4777 extern void set_decl_rtl (tree, rtx);
4778 extern void set_decl_incoming_rtl (tree, rtx);
4779 \f
4780 /* Enum and arrays used for tree allocation stats.
4781 Keep in sync with tree.c:tree_node_kind_names. */
4782 typedef enum
4783 {
4784 d_kind,
4785 t_kind,
4786 b_kind,
4787 s_kind,
4788 r_kind,
4789 e_kind,
4790 c_kind,
4791 id_kind,
4792 perm_list_kind,
4793 temp_list_kind,
4794 vec_kind,
4795 binfo_kind,
4796 phi_kind,
4797 ssa_name_kind,
4798 constr_kind,
4799 x_kind,
4800 lang_decl,
4801 lang_type,
4802 omp_clause_kind,
4803 gimple_stmt_kind,
4804 all_kinds
4805 } tree_node_kind;
4806
4807 extern int tree_node_counts[];
4808 extern int tree_node_sizes[];
4809
4810 /* True if we are in gimple form and the actions of the folders need to
4811 be restricted. False if we are not in gimple form and folding is not
4812 restricted to creating gimple expressions. */
4813 extern bool in_gimple_form;
4814
4815 /* In tree-gimple.c. */
4816 extern tree get_base_address (tree t);
4817
4818 /* In tree-vectorizer.c. */
4819 extern void vect_set_verbosity_level (const char *);
4820
4821 /* In tree.c. */
4822
4823 struct tree_map_base GTY(())
4824 {
4825 tree from;
4826 };
4827
4828 extern int tree_map_base_eq (const void *, const void *);
4829 extern unsigned int tree_map_base_hash (const void *);
4830 extern int tree_map_base_marked_p (const void *);
4831
4832 /* Map from a tree to another tree. */
4833
4834 struct tree_map GTY(())
4835 {
4836 struct tree_map_base base;
4837 unsigned int hash;
4838 tree to;
4839 };
4840
4841 #define tree_map_eq tree_map_base_eq
4842 extern unsigned int tree_map_hash (const void *);
4843 #define tree_map_marked_p tree_map_base_marked_p
4844
4845 /* Map from a tree to an int. */
4846
4847 struct tree_int_map GTY(())
4848 {
4849 struct tree_map_base base;
4850 unsigned int to;
4851 };
4852
4853 #define tree_int_map_eq tree_map_base_eq
4854 #define tree_int_map_hash tree_map_base_hash
4855 #define tree_int_map_marked_p tree_map_base_marked_p
4856
4857 /* Map from a tree to initialization/finalization priorities. */
4858
4859 struct tree_priority_map GTY(())
4860 {
4861 struct tree_map_base base;
4862 priority_type init;
4863 priority_type fini;
4864 };
4865
4866 #define tree_priority_map_eq tree_map_base_eq
4867 #define tree_priority_map_hash tree_map_base_hash
4868 #define tree_priority_map_marked_p tree_map_base_marked_p
4869
4870 /* In tree-ssa-address.c. */
4871 extern tree tree_mem_ref_addr (tree, tree);
4872 extern void copy_mem_ref_info (tree, tree);
4873
4874 /* In tree-vrp.c */
4875 extern bool ssa_name_nonzero_p (tree);
4876 extern bool ssa_name_nonnegative_p (tree);
4877
4878 /* In tree-object-size.c. */
4879 extern void init_object_sizes (void);
4880 extern void fini_object_sizes (void);
4881 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
4882
4883 /* In expr.c. */
4884 extern unsigned HOST_WIDE_INT highest_pow2_factor (tree);
4885
4886 /* In tree-inline.c. */
4887
4888 void init_inline_once (void);
4889
4890 /* Compute the number of operands in an expression node NODE. For
4891 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
4892 otherwise it is looked up from the node's code. */
4893 static inline int
4894 tree_operand_length (tree node)
4895 {
4896 if (VL_EXP_CLASS_P (node))
4897 return VL_EXP_OPERAND_LENGTH (node);
4898 else
4899 return TREE_CODE_LENGTH (TREE_CODE (node));
4900 }
4901
4902 /* Abstract iterators for CALL_EXPRs. These static inline definitions
4903 have to go towards the end of tree.h so that union tree_node is fully
4904 defined by this point. */
4905
4906 /* Structure containing iterator state. */
4907 typedef struct call_expr_arg_iterator_d GTY (())
4908 {
4909 tree t; /* the call_expr */
4910 int n; /* argument count */
4911 int i; /* next argument index */
4912 } call_expr_arg_iterator;
4913
4914 /* Initialize the abstract argument list iterator object ITER with the
4915 arguments from CALL_EXPR node EXP. */
4916 static inline void
4917 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
4918 {
4919 iter->t = exp;
4920 iter->n = call_expr_nargs (exp);
4921 iter->i = 0;
4922 }
4923
4924 /* Return the next argument from abstract argument list iterator object ITER,
4925 and advance its state. Return NULL_TREE if there are no more arguments. */
4926 static inline tree
4927 next_call_expr_arg (call_expr_arg_iterator *iter)
4928 {
4929 tree result;
4930 if (iter->i >= iter->n)
4931 return NULL_TREE;
4932 result = CALL_EXPR_ARG (iter->t, iter->i);
4933 iter->i++;
4934 return result;
4935 }
4936
4937 /* Initialize the abstract argument list iterator object ITER, then advance
4938 past and return the first argument. Useful in for expressions, e.g.
4939 for (arg = first_call_expr_arg (exp, &iter); arg;
4940 arg = next_call_expr_arg (&iter)) */
4941 static inline tree
4942 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
4943 {
4944 init_call_expr_arg_iterator (exp, iter);
4945 return next_call_expr_arg (iter);
4946 }
4947
4948 /* Test whether there are more arguments in abstract argument list iterator
4949 ITER, without changing its state. */
4950 static inline bool
4951 more_call_expr_args_p (const call_expr_arg_iterator *iter)
4952 {
4953 return (iter->i < iter->n);
4954 }
4955
4956
4957 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4958 (of type call_expr_arg_iterator) to hold the iteration state. */
4959 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4960 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4961 (arg) = next_call_expr_arg (&(iter)))
4962
4963 #endif /* GCC_TREE_H */
Mirror of the offical gcc git repository hosted at gcc.gnu.org